GATE CSE 1991

## GATE CSE

Minimum number of comparisons required to sort 5 elements

View Question Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G with n vertices and m edges has the time c

View Question Obtain the optimal binary search tree with equal probabilities for the
identifier set (a1, a2, a3) = ( if, stop, while)

View Question The weighted external path length of the binary tree in figure is ___________.

View Question The following sequence of operations is performed on stack:
PUSH (10),PUSH (20),POP,PUSH (10),PUSH (20),POP,POP,POP,PUS

View Question If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______

View Question Find the minimum sum of products form of the logic function
$$f\left( {A,B,C,D} \right) = \sum d \left( {3,11,12,14} \r

View Question Find the maximum clock frequency at which the counter in Fig., can be operated. Assume that the propagation delay throug

View Question The maximum number of possible edges in an undirected graph with a vertices and $$k$$ components is _________ .

View Question Match the pairs in the following question by writing the corresponding letters only.

View Question State whether the following statement TRUE or FALSE.
The amount of virtual memory available is limited by the availabili

View Question State whether the following statement TRUE or FALSE.
Any implementation of a critical section requires the use of an ind

View Question A ''link editor'' is a program that:

View Question The total size of address space in a virtual memory systems is limited by

View Question State whether the following statement TRUE or FALSE.
The best-fit techniques for memory allocation ensures the memory wi

View Question State whether the following statement TRUE or FALSE.
The use of monitors ensures that no dead -locks will be caused.

View Question State whether the following statement TRUE or FALSE.
The $$LRU$$ page-replacement policy may cause thrashing for some ty

View Question Indicate the following statement true or false:
A programming language not supporting either recursion or pointer type
d

View Question Indicate the following statement true or false:
Although C does not support call by name parameter passing, the effect c

View Question Let $$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$ and $$\,t = {1^ * }\,0$$ be three regular expressions. Which

View Question Which one of the following is the strongest correct statement about a finite language over some finite alphabet $$\sum ?

View Question