| Que.
1 |
Determinimg all possible decompositions of sequential machines requires...............
time in N,where N is the number of states. |
| A |
logarithmic |
| B |
linear |
| C |
N log(N) |
| D |
exponential |
|
| Que.
2 |
The following sequence of operations is performed on a stack
PUSH(10),PUSH(20),POP,PUSH(10)PUSH(20),POP,POP,POP,PUSH(20),POP
the sequence of values popped out is |
| A |
20,10,20,10,20 |
| B |
20,20,10,10,20 |
| C |
10,20,20,10,20 |
| D |
20,20,10,20,10 |
|
| Que.
3 |
A sorting technique is called stable if |
| A |
it takes 0 (n log n) time |
| B |
it maintains the relative order of occurrence of non-distinct
elements |
| C |
it uses divide and conquer paradigm |
| D |
it takes 0 (n) space. |
|
| Que.
4 |
Which of the following is correct? |
| A |
B-trees are for storing data on disk and B* trees are for
main memory. |
| B |
Range queries are faster on B* trees. |
| C |
B-trees are for primary indexes and B* trees are for secondary
indexes. |
| D |
The height of a B* tree is independent of the number of
records. |
|
| Que.
5 |
A certain processor supports only the immediate and the direct
addressing modes. Which of the following programming language features
cannot be implemented on this processor? |
| A |
Pointers |
| B |
Arrays |
| C |
Records |
| D |
Recursive procedures with local variable |
|
| Que.
6 |
The problems 3-SAT and 2-SAT are |
| A |
both P |
| B |
both NP |
| C |
NP complete and in P respectively |
| D |
undecidable and NP complete respectively |
|
| Que.
7 |
In SQL, relations can contain null values, and comparisons with null
values are treated as unknown. Suppose all comparisons with a null value
are treated as false. Which of the following pairs is not equivalent? |
| A |
x = 5 not (not (x = 5 ) ) |
| B |
x= 5 x> 4 and x < 6, where x is an integer |
| C |
x (not equal) 5 not (x = 5) |
| D |
None of the above |
|
| Que.
8 |
consider the following C function:
int f(int n)
{
static int i=1;
if(n>=50) return n;
n=n+1;
i++;
return f(n);
}
The value returned by f(1) is |
| A |
5 |
| B |
6 |
| C |
7 |
| D |
8 |
|
| Que.
9 |
The time complexity of the following C function is
int recursive(int n) {
if(n==1)
return(1);
else
return(recursive (n-1)+recursive(n-1));
} |
| A |
O(n) |
| B |
O(n log n) |
| C |
O(n^2) |
| D |
O(2^n) |
|
| Que.
10 |
What does the following code do? var a,b:integer;
begin
a:=a+b; b:=a-b; a:=a-b; end; |
| A |
exchangs a and b |
| B |
doubles a and stores in b |
| C |
doubles b and stores in a |
| D |
leaves a and b unchanged |
|
| Que.
11 |
In the index allocation scheme of block to file,the maximum possible size
ofthe file depends on |
| A |
the size ofthe blocks,and the size of the address of the blocks. |
| B |
the number of blocks used for the index, and the size of the block. |
| C |
the size of the blocks,the number of blocks used for the index,and
the size ofthe address ofthe blocks. |
| D |
none of these |
|
| Que.
12 |
indicate which ofthe following statments are true The number of rooted
binary trees with n nodes is, |
| A |
equal to number of ways of multiplying (n+1) matrices |
| B |
equal to number of ways of arrenging n out of 2n distinct elements |
| C |
equal to 1/(n+1)=(2n/2) |
| D |
equal to n! |
|
| Que.
13 |
What does the following code do? var a,b:integer begin a:=a+b;
b:=a-b; a:=a-b; end; |
| A |
exchanges a and b |
| B |
doubles a and store in b |
| C |
doubles b and store in a |
| D |
leaves a and b unchanged
(E)none of these |
|
| Que.
14 |
A part of the system software,which under all circumstances must reside
in the main memory,is |
| A |
text editor |
| B |
assembler |
| C |
linker |
| D |
loader
(E)none of these |
|
| Que.
15 |
Listed below are some operating system abstractions (in the left
column) and the hardware components (in the right column)? |
| A |
(d) -4, (B)-1, (C)-2, (D)-3 |
| B |
(d) (A)-4, -1, (C)-2, (D)-3 |
| C |
(d) (A)-4, (B)-1, -2, (D)-3 |
| D |
(A)-4, (B)-1, (C)-2, -3 |