Register

Recent questions tagged gate1996

35 votes
6 answers
61
GATE CSE 1996 | Question: 1.16, ISRO2016-42
Relative mode of addressing is most relevant to writing: Co – routines Position – independent code Shareable code Interrupt Handlers
Relative mode of addressing is most relevant to writing:Co – routinesPosition – independent codeShareable codeInterrupt Handlers
User Avatar
21 votes
3 answers
62
GATE CSE 1996 | Question: 1.15
Which of the following sequences denotes the post order traversal sequence of the below tree? $f\; e\; g\; c\; d\; b\; a$ $g\; c\; b\; d\; a\; f\; e$ $g\; c\; d\; b\; f\; e\; a$ $f\; e\; d\; g\; c\; b \;a$
Which of the following sequences denotes the post order traversal sequence of the below tree?$f\; e\; g\; c\; d\; b\; a$$g\; c\; b\; d\; a\; f\; e$$g\; c\; d\; b\; f\; e\...
User Avatar
29 votes
3 answers
63
GATE CSE 1996 | Question: 1.14
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”? $1$ $3$ $7$ $8$
In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?$1$$3$$7$$8$
User Avatar
39 votes
6 answers
64
GATE CSE 1996 | Question: 1.13
An advantage of chained hash table (external hashing) over the open addressing scheme is Worst case complexity of search operations is less Space used is less Deletion is easier None of the above
An advantage of chained hash table (external hashing) over the open addressing scheme isWorst case complexity of search operations is lessSpace used is lessDeletion is ea...
User Avatar
43 votes
2 answers
66
GATE CSE 1996 | Question: 1.11
Which of the following is false? $100n \log n=O(\frac{n\log n}{100})$ $\sqrt{\log n} = O(\log\log n)$ If $0 < x < y \text{ then } n^x = O\left(n^y\right)$ $2^n \neq O\left(nk\right)$
Which of the following is false?$100n \log n=O(\frac{n\log n}{100})$$\sqrt{\log n} = O(\log\log n)$If $0 < x < y \text{ then } n^x = O\left(n^y\right)$$2^n \neq O\left(nk...
User Avatar
30 votes
6 answers
69
GATE CSE 1996 | Question: 1.8
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string). $(00)^ * (\varepsilon +0)$ $(00)^*$ $0^*$ $0(00)^*$ (i) and (ii) (ii) and (iii) (i) and (iii) (iii) and (iv)
Which two of the following four regular expressions are equivalent? ($\varepsilon$ is the empty string).$(00)^ * (\varepsilon +0)$$(00)^*$$0^*$$0(00)^*$(i) and (ii)(ii) a...
User Avatar
20 votes
3 answers
72
GATE CSE 1996 | Question: 1.5
Two dice are thrown simultaneously. The probability that at least one of them will have $6$ facing up is $\frac{1}{36}$ $\frac{1}{3}$ $\frac{25}{36}$ $\frac{11}{36}$
Two dice are thrown simultaneously. The probability that at least one of them will have $6$ facing up is$\frac{1}{36}$$\frac{1}{3}$$\frac{25}{36}$$\frac{11}{36}$
User Avatar
22 votes
5 answers
75
GATE CSE 1996 | Question: 1.2
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is $3$ $4$ $9$ None of the above
Let $X = \{2, 3, 6, 12, 24\}$, Let $\leq$ be the partial order defined by $X \leq Y$ if $x$ divides $y$. Number of edges in the Hasse diagram of $(X, \leq)$ is$3$$4$$9$No...
User Avatar
26 votes
8 answers
76
GATE CSE 1996 | Question: 1.1
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to $A \cup B$ $A^c \cup B^c$ $A \cap B$ $A^c \cap B^c$
Let $A$ and $B$ be sets and let $A^c$ and $B^c$ denote the complements of the sets $A$ and $B$. The set $(A-B) \cup (B-A) \cup (A \cap B)$ is equal to$A \cup B$$A^c \cup ...
User Avatar
Page: