|
1. The starting location of an array is 1000. If the array[1..5/...4] is stored in row
major order, what is the location of element [4,3]. Each word occupies 4 bytes.
2. In a tertiary tree, which has three childs for every node, if the number of
internal nodes are N, then the total number of leaf nodes are
3. Explain the term "locality of reference" ?
4. What is the language used for Artificial Intelligence
Ans: lisp
5. What is the character set used in JAVA 2.0 ?
Ans: Unicode
6. char a =0xAA ;
int b ;
b = (int) a ;
b = b >> 4 ;
printf("%x",b);
What is the output of the above program segment ?
7. struct s1 { struct { struct { int x; } s2 } s3 }y;
How does one access x in the above given structure definition ?
8. Why there is no recursion in Fortran ?
Ans. There is no dynamic allocation.
9. What is the worst case complexity of Quick sort?
Ans. O(n2)
10. What will be sequence of operating system activities when an interrupt
occurs ?
11. In a sequential search, what is the average number of comparisons it takes to
search through n elements ?
|
|
