This practice GATE test includes only questions which are asked in the GATE computer since solved paper. Also, practice GATE previous year papers to improve your chances of getting admission in the IIT.
End Test Now
An organization has a class B network and wishes to form subnets for 64 departments. The subnet mask would be….
255.255.0.0
255.255.252.0
255.255.128.0
255.255.64.0
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…...
More than 12
Less than 8
12
8
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?
24
26
27
25
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by….
page size
physical memory size
the instruction set architecture
number of processes in memory
The best data structure to check whether an arithmetic expression has balanced parentheses is a…..
list
tree
stack
queue
Suppose the round trip propagation delay for a 10 Mbps Ethernet having 48-bit jamming signal is 46.4 ms. The minimum frame size is:
464
94
416
512
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
x mod y using repeated subtraction
the greatest common divisor of x and y
the least common multiple of x and y
x + y, using repeated subtraction
The minimum number of page frames that must be allocated to a running process in a virtual memory environment is determined by…..
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
5
6
7
A Priority-Queue is implemented as a Max-Heap. Initially, it has 5 elements. The level-order 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 level-order traversal of the heap after the insertion of the elements is…...
10,8,7,3,2,1,5
10,8,7,5,3,2,1
10,8,7,1,2,3,5
10,8,7,2,3,1,5
What does the following algorithm approximate? (Assume m > 1, ÃŽ > 0). x = m; y-i; while (x – y > ÃŽ) { x = (x + y) / 2 ; y = m/x ; } print (x) ;
log m
m2
m1/3
m1/2
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)?
2
4
3
In an MxN matrix such that all non-zero entries are covered in a rows and b columns. Then the maximum number of non-zero entries, such that no two are on the same row or column, is…..
£ min {a, b}
£ max {a, b}
£ a + b
£ min {M-a, N-b}
The relation scheme Student Performance (name, courseNo, rollNo, grade) has the following functional dependencies:
The highest normal form of this relation scheme is
name, courseNo -> grade
rollNo, courseNo -> grade
rollNo -> name
name -> rollNo
The Boolean function x, y, + xy + x, y
x, + y
x + y,
x + y
x, + y,
When you are sure that you have answered as many questions as possible, click the ‘Done’ button below and view your results.
