GATE 1991 CSE & IT

The following sequence of operations is performed on stack: PUSH (10),PUSH (20),POP,PUSH (10),PUSH (20),POP,POP,POP,PUSH (20),POP The sequence of the value popped out is:

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

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

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} \right)$$ Where $$m$$ and $$d$$ denote the minterms and don't c...

Indicate the following statement true or false: Although C does not support call by name parameter passing, the effect can be correctly simulated in C.

State whether the following statement TRUE or FALSE. The best-fit techniques for memory allocation ensures the memory will never be fragmented.

State whether the following statement TRUE or FALSE. The amount of virtual memory available is limited by the availability of secondary storage.

State whether the following statement TRUE or FALSE. Any implementation of a critical section requires the use of an indivisible machine instruction such as test-and-set.

Obtain the optimal binary search tree with equal probabilities for the identifier set (a 1 , a 2 , a 3 ) = ( if, stop, while)

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

Minimum number of comparisons required to sort 5 elements

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

State whether the following statement TRUE or FALSE. The $$LRU$$ page-replacement policy may cause thrashing for some type of programs.

Indicate the following statement true or false : A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation.

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

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

Let $$r = 1\,{\left( {1 + 0} \right)^ * },s = {11^ * }\,0$$ and $$\,t = {1^ * }\,0$$ be three regular expressions. Which one of the following is true?