No.  Question  

1 
Consider the following program segment for a hypothetical CPU having three user registers Rl, R2 and R3.
Let the clock cycles required for various operations be as follows: 

Options 


Correct Answer  B  
2  The order of an internal node in a B+ tree index is the maximum number of children it can have. Suppose that a child pointer takes 6 bytes, the search field value takes 14 bytes, and the block size is 512 bytes. What is the order of the internal node?  
Options 


Correct Answer  C  
3  The Boolean function x^{,} y^{,} + xy + x^{, }y  
Options 


Correct Answer  D  
4  In an MxN matrix such that all nonzero entries are covered in a rows and b columns. Then the maximum number of nonzero entries, such that no two are on the same row or column, is  
Options 


Correct Answer  A  
5 
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies: name, courseNo ® grade rollNo, courseNo ® grade name ® rollNo rollNo ® name The highest normal form of this relation scheme is 

Correct Answer  A  
6  The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by  
Options 


Correct Answer  D  
7 
Consider the following program segment for a hypothetical CPU having three user registers Rl, R2 and R3.
Consider that the memory is byte addressable with size 32 bits, and the program has been loaded starting from memory location 1000 (decimal). If an interrupt occurs while the CPU has been halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be 

Options 


Correct Answer  A  
8  Let G be a simple graph with 20 vertices and 100 edges. The size of the minimum vertex cover of G is 8. Then, the size of the maximum independent set of G is  
Options 


Correct Answer  A  
9 
What does the following algorithm approximate? (Assume m > 1, Î > 0). x = m; yi; while (x  y > Î) { x = (x + y) / 2 ; y = m/x ; } print (x) ; 

Options 


Correct Answer  C  
10 
Consider the following C program main () { int x, y, m, n ; scanf ("%d %d", &x, &y); / * Assume x > 0 and y > 0 * / m = x; n = y ; while ( m ! = n) { if (m > n) m = m — n; else n = n  m ; } printf("%d",n); } The program computes 

Options 


Correct Answer  C  
11  The best data structure to check whether an arithmetic expression has balanced parentheses is a  
Options 


Correct Answer  B  
12 
A PriorityQueue is implemented as a MaxHeap. Initially, it has 5 elements. The levelorder traversal of the heap is given below: 10, 8,5,3,2 Two new elements 1 and 7 are inserted in the heap in that order. The levelorder traversal of the heap after the insertion of the elements is 

Options 


Correct Answer  D  
13 
Consider the following C program segment
The value returned by the function DoSomething when a pointer to the root of a 

Options 


Correct Answer  D  
14  An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be  
Options 


Correct Answer  D  
15  Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48bit jamming signal is 46.4 ms. The minimum frame size is:  
Options 


Correct Answer  C  
16 
Consider the following C program segment: char p [ 20]; char * s = "string" ; int length = strlen (s) ; for (i = 0 ; i < length; i++) p[ i ] = s [length  i] ;
print f ("%s", p) ; 

Correct Answer  A  
17 
Consider the grammar S ® (S)  a Let the number of states in SLR(1), LR(1) and LALR(1) parsers for the grammar be n_{1}, n_{2} and n_{3} respectively. The following relationship holds good 

Options 


Correct Answer  B  
18 
Consider the following C function: int f (int n) { static int i = 1; if (n >= 5) return n; n = n + i; i ++; return f (n); } The value returned by f(1) is 

Options 


Correct Answer  C  
19 
Consider the following code fragment: if (fork ( ) = = 0) {a = a + 5; print f (“%d, %d / n”, a, and a); } else {a  5; print f (“ %d, %d / n”, a,& a); } Let u, v be the values printed by the parent process, and x, y be the values printed by the child process. Which one of the following is TRUE? 

Options 


Correct Answer  B  
20  The following numbers are inserted into an empty binary search tree in the given order: 10, 1, 3, 5, 15, 12, 16. What is the height of the binary search tree (the height is the maximum distance of a leaf node from the root)?  
Options 


Correct Answer  B 