## GATE CSE 1991

Exam Held on Thu Jan 01 1970 00:00:00 GMT+0000 (Coordinated Universal Time)
Click View All Questions to see questions one by one or you can choose a single question from below.

## Algorithms

Minimum number of comparisons required to sort 5 elements
Kruskal’s algorithm for finding a minimum spanning tree of a weighted graph G wi...
Obtain the optimal binary search tree with equal probabilities for the identifie...
The weighted external path length of the binary tree in figure is ___________. <...

## Data Structures

The following sequence of operations is performed on stack: PUSH (10),PUSH (20)...
If the binary tree in figure is traversed in inorder, then the order in which th...

Find the minimum sum of products form of the logic function <br>$$f\left( {A,B,... Find the maximum clock frequency at which the counter in Fig., can be operated. ... ## Discrete Mathematics The maximum number of possible edges in an undirected graph with a vertices and ... ## Operating Systems Match the pairs in the following question by writing the corresponding letters o... State whether the following statement TRUE or FALSE. <p>The amount of virtual me... State whether the following statement TRUE or FALSE. <p>Any implementation of a ... A ''link editor'' is a program that: The total size of address space in a virtual memory systems is limited by State whether the following statement TRUE or FALSE. <p>The best-fit techniques ... State whether the following statement TRUE or FALSE. <p>The use of monitors ensu... State whether the following statement TRUE or FALSE. <p>The$$LRU$$page-replace... ## Programming Languages Indicate the following statement true or false: <br/><br/>A programming language... <b>Indicate the following statement true or false:</b> <br/><br/>Although C does... ## Theory of Computation Let$$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$and$$\,t = {1^ * }\...
Which one of the following is the strongest correct statement about a finite lan...