Register
Filter

Questions by Kathleen

1 votes
0 answers
1121
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.
51 votes
4 answers
1123
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 ______.
19 votes
3 answers
1124
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.
16 votes
1 answer
1125
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 ______
33 votes
8 answers
1126
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...
44 votes
2 answers
1127
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 ______
50 votes
3 answers
1128
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 ______
24 votes
3 answers
1129
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...
38 votes
1 answer
1130
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 ________
20 votes
5 answers
1131
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 ______
0 votes
3 answers
1132
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 ............
26 votes
5 answers
1133
GATE CSE 1991 | Question: 01-iii
Consider the number given by the decimal expression: $16^3*9 + 16^2*7 + 16*5+3$ The number of $1’s$ in the unsigned binary representation of the number is ______
Consider the number given by the decimal expression:$$16^3*9 + 16^2*7 + 16*5+3$$The number of $1’s$ in the unsigned binary representation of the number is ______
2 votes
2 answers
1134
GATE CSE 1991 | Question: 01,ii
In interleaved memory organization, consecutive words are stored in consecutive memory modules in _______ interleaving, whereas consecutive words are stored within the module in ________ interleaving.
In interleaved memory organization, consecutive words are stored in consecutive memory modules in _______ interleaving, whereas consecutive words are stored within the mo...
42 votes
10 answers
1136
GATE CSE 2008 | Question: 78
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s. Which of the following recurrences does $x_n$ satisfy? $x_n = 2x_{n-1}$ $x_n = x_{\lfloor n/2 \rfloor} + 1$ $x_n = x_{\lfloor n/2 \rfloor} + n$ $x_n = x_{n-1} + x_{n-2}$
Let $x_n$ denote the number of binary strings of length $n$ that contain no consecutive $0$s.Which of the following recurrences does $x_n$ satisfy?$x_n = 2x_{n-1}$$x_n = ...
Page: