ISRO CSE 2013
Q2.
In an array of 2N elements that is both 2-ordered and 3-ordered, what is the maximum number of positions that an element can be from its position if the array were 1-ordered?Q3.
Let A(1:8, -5:5, -10:5) be a three dimensional array. How many elements are there in the array A?Q4.
The number of rotations required to insert a sequence of elements 9, 6, 5, 8, 7, 10 into an empty AVL tree is?Q5.
How much speed do we gain by using the cache, when cache is used 80% of the time? Assume cache is faster than main memory.Q7.
What is the output of the following program? Class Test { public static void main (String [] args) { int x = 0; int y = 0 for (int z = 0; z < 5; z++) { if((++x >2)||(++y > 2)) { x++; } } System.out.printIn (x+ "" + y); } }Q8.
Consider the following C code. #include < stdio.h > #include < math.h > void main () { double pi = 3.1415926535; int a = 1; int i; for (i=0; i < 3; i++) if (a = cos(pi * i/2)) printf("% d", 1); else printf("%d", 0); } What would the program print?Q10.
Which of the following strategy is employed for overcoming the priority inversion problem?