Register
Filter

Previous GATE Questions

36 votes
4 answers
3084
GATE CSE 1991 | Question: 03,iii
The total size of address space in a virtual memory system is limited by: the length of MAR the available secondary storage the available main memory all of the above none of the above
The total size of address space in a virtual memory system is limited by:the length of MARthe available secondary storagethe available main memoryall of the abovenone of ...
User Avatar
29 votes
2 answers
3085
GATE CSE 1991 | Question: 03-ii
Advantage of synchronous sequential circuits over asynchronous ones is: faster operation ease of avoiding problems due to hazards lower hardware requirement better noise immunity none of the above
Advantage of synchronous sequential circuits over asynchronous ones is:faster operationease of avoiding problems due to hazardslower hardware requirementbetter noise immu...
User Avatar
43 votes
4 answers
3087
GATE CSE 1991 | Question: 02-iv
Match the pairs in the following questions by writing the corresponding letters only. ...
Match the pairs in the following questions by writing the corresponding letters only.$$\begin{array}{|c|l|c|l|} \hline A. & \text{The number of distinct binary tree} & P....
User Avatar
24 votes
1 answer
3088
GATE CSE 1991 | Question: 02-iii
Match the pairs in the following questions by writing the corresponding letters only. ...
Match the pairs in the following questions by writing the corresponding letters only.$$\begin{array}{|ll|ll|}\hline \text{(a)} & \text{Buddy system} & \text{(p)} & \tex...
User Avatar
1 votes
0 answers
3089
GATE CSE 1991 | Question: 02,ii
02. Match the pairs in the following questions by writing the corresponding letters only.
02. Match the pairs in the following questions by writing the corresponding letters only.
User Avatar
51 votes
4 answers
3091
GATE CSE 1991 | Question: 01,xv
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
The maximum number of possible edges in an undirected graph with $n$ vertices and $k$ components is ______.
User Avatar
19 votes
3 answers
3092
GATE CSE 1991 | Question: 01,xiv
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
If the longest chain in a partial order is of length $n$, then the partial order can be written as a _____ of $n$ antichains.
User Avatar
16 votes
1 answer
3093
GATE CSE 1991 | Question: 01-xii
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
A given set of processes can be implemented by using only parbegin/parend statement, if the precedence graph of these processes is ______
User Avatar
33 votes
8 answers
3094
GATE CSE 1991 | Question: 01,x
Consider the following recursive definition of $fib$: fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2) The number of times $fib$ is called (including the first call) for evaluation of $fib(7)$ is___________.
Consider the following recursive definition of $fib$:fib(n) := if n = 0 then 1 else if n = 1 then 1 else fib(n-1) + fib(n-2)The number of times $fib$ is called (includin...
User Avatar
44 votes
2 answers
3095
GATE CSE 1991 | Question: 01,viii
The weighted external path length of the binary tree in figure is ______
The weighted external path length of the binary tree in figure is ______
User Avatar
50 votes
3 answers
3096
GATE CSE 1991 | Question: 01,vii
The minimum number of comparisons required to sort $5$ elements is ______
The minimum number of comparisons required to sort $5$ elements is ______
User Avatar
24 votes
3 answers
3097
GATE CSE 1991 | Question: 1,vi
Consider the following PASCAL program segment: if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < > 0 then i := i - 1; else i := i – 2; end; An appropriate loop-invariant for the while-loop is ________
Consider the following PASCAL program segment:if i mod 2 = 0 then while i >= 0 do begin i := i div 2; if i mod 2 < 0 then i := i - 1; else i := i – 2; end;An appropria...
User Avatar
38 votes
1 answer
3098
GATE CSE 1991 | Question: 01-v
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
When two $4$-bit numbers $A = a_3a_2a_1a_0$ and $B=b_3b_2b_1b_0$ are multiplied, the bit $c_1$ of the product $C$ is given by ________
User Avatar
20 votes
5 answers
3099
GATE CSE 1991 | Question: 1,ix
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
If the binary tree in figure is traversed in inorder, then the order in which the nodes will be visited is ______
User Avatar
0 votes
3 answers
3100
GATE CSE 1991 | Question: 01,iv
Using the 8087 arithmetic coprocessor with the 8086 CPU requires that the 8086 CPU is operated ............
Using the 8087 arithmetic coprocessor with the 8086 CPU requires that the 8086 CPU is operated ............
User Avatar
Page: