Register

Recent questions tagged gatecse-2001

22 votes
7 answers
33
GATE CSE 2001 | Question: 2.16
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$? One Two Three Four
What is the minimum number of stacks of size $n$ required to implement a queue of size $n$?OneTwoThreeFour
User Avatar
53 votes
6 answers
34
GATE CSE 2001 | Question: 2.15
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices? $\frac{n(n-1)} {2}$ $2^n$ $n!$ $2^\frac{n(n-1)} {2} $
How many undirected graphs (not necessarily connected) can be constructed out of a given set $V=\{v_1, v_2, \dots v_n\}$ of $n$ vertices?$\frac{n(n-1)} {2}$$2^n$$n!$$2^\f...
User Avatar
47 votes
5 answers
38
GATE CSE 2001 | Question: 2.11
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$. Which of the following is true? $f=X_1'+X_2$ $f=X_1'X_2+X_1X_2'$ $f=X_1X_2+X_1'X_2'$ $f=X_1+X_2'$
Consider the circuit shown below. The output of a $2:1$ MUX is given by the function $(ac' + bc)$.Which of the following is true?$f=X_1'+X_2$$f=X_1'X_2+X_1X_2'$$f=X_1X_2+...
User Avatar
30 votes
4 answers
39
GATE CSE 2001 | Question: 2.10
The $2's$ complement representation of (-539)10 in hexadecimal is $ABE$ $DBC$ $DE5$ $9E7$
The $2's$ complement representation of (-539)10 in hexadecimal is$ABE$$DBC$$DE5$$9E7$
User Avatar
33 votes
2 answers
40
GATE CSE 2001 | Question: 2.9
Which is the most appropriate match for the items in the first column with the items in the second column: ... ), (Y, III), (Z, I) (X, III), (Y, II), (Z, I) (X, I), (Y, III), (Z, II)
Which is the most appropriate match for the items in the first column with the items in the second column:$$\begin{array}{|cl|cl|} \hline \text{X.} &\text{Indirect Addres...
User Avatar
41 votes
4 answers
44
GATE CSE 2001 | Question: 2.5
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of states that the DFA will have? $8$ $14$ $15$ $48$
Consider a DFA over $\Sigma=\{a,b\}$ accepting all strings which have number of a's divisible by $6$ and number of $b$'s divisible by $8$. What is the minimum number of s...
User Avatar
38 votes
4 answers
45
GATE CSE 2001 | Question: 2.4
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day? $\dfrac{1}{7^7}\\$ $\dfrac{1}{7^6}\\$ $\dfrac{1}{2^7}\\$ $\dfrac{7}{2^7}\\$
Seven (distinct) car accidents occurred in a week. What is the probability that they all occurred on the same day?$\dfrac{1}{7^7}\\$$\dfrac{1}{7^6}\\$$\dfrac{1}{2^7}\\$$\...
User Avatar
38 votes
9 answers
48
GATE CSE 2001 | Question: 2.1
How many $4$-digit even numbers have all $4$ digits distinct? $2240$ $2296$ $2620$ $4536$
How many $4$-digit even numbers have all $4$ digits distinct?$2240$$2296$$2620$$4536$
User Avatar
52 votes
3 answers
49
GATE CSE 2001 | Question: 1.25
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)$ is always equal to $\sigma_{A=a}(r)$ $r$ $\sigma_{A=a}(r) \bowtie s$ None of the above
Let r and s be two relations over the relation schemes R and S respectively, and let A be an attribute in R. The relational algebra expression $\sigma_{A=a}(r \bowtie s)...
User Avatar
25 votes
2 answers
51
GATE CSE 2001 | Question: 1.22
Which of the following requires a device driver? Register Cache Main memory Disk
Which of the following requires a device driver?RegisterCacheMain memoryDisk
User Avatar
37 votes
3 answers
53
GATE CSE 2001 | Question: 1.20
Where does the swap space reside? RAM Disk ROM On-chip cache
Where does the swap space reside?RAMDiskROMOn-chip cache
User Avatar
37 votes
6 answers
54
GATE CSE 2001 | Question: 1.18
Which of the following statements is false? An unambiguous grammar has same leftmost and rightmost derivation An LL(1) parser is a top-down parser LALR is more powerful than SLR An ambiguous grammar can never be LR(k) for any k
Which of the following statements is false?An unambiguous grammar has same leftmost and rightmost derivationAn LL(1) parser is a top-down parserLALR is more powerful than...
User Avatar
36 votes
2 answers
55
GATE CSE 2001 | Question: 1.17
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called Assembly parsing Relocation Symbol resolution
The process of assigning load addresses to the various parts of the program and adjusting the code and the data in the program to reflect the assigned addresses is called...
User Avatar
43 votes
4 answers
58
GATE CSE 2001 | Question: 1.14
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort? $O(n)$ $O(n \log n)$ $O(n^2)$ $O(n!)$
Randomized quicksort is an extension of quicksort where the pivot is chosen randomly. What is the worst case complexity of sorting n numbers using Randomized quicksort?$O...
User Avatar
30 votes
1 answer
60
GATE CSE 2001 | Question: 1.12
A processor needs software interrupt to test the interrupt system of the processor implement co-routines obtain system services which need execution of privileged instructions return from subroutine
A processor needs software interrupt totest the interrupt system of the processorimplement co-routinesobtain system services which need execution of privileged instructio...
User Avatar
Page: