Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Search results for gate1996
56
votes
8
answers
1
GATE CSE 1996 | Question: 2.13, ISRO2016-28
The average number of key comparisons required for a successful search for sequential search on $n$ items is $\frac{n}{2}$ $\frac{n-1}{2}$ $\frac{n+1}{2}$ None of the above
The average number of key comparisons required for a successful search for sequential search on $n$ items is$\frac{n}{2}$$\frac{n-1}{2}$$\frac{n+1}{2}$None of the above
Kathleen
31.7k
views
Kathleen
asked
Oct 9, 2014
Algorithms
gate1996
algorithms
easy
isro2016
searching
+
–
27
votes
5
answers
2
GATE CSE 1996 | Question: 2.14
A binary search tree is generated by inserting in order the following integers: $50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$ The number of nodes in the left subtree and right subtree of the root respectively is $(4, 7)$ $(7, 4)$ $(8, 3)$ $(3, 8)$
A binary search tree is generated by inserting in order the following integers:$$50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24$$The number of nodes in the left subtree and ...
Kathleen
30.6k
views
Kathleen
asked
Oct 9, 2014
DS
gate1996
data-structures
binary-search-tree
easy
+
–
50
votes
7
answers
3
GATE CSE 1996 | Question: 1.7
Let $Ax = b$ be a system of linear equations where $A$ is an $m \times n$ matrix and $b$ is a $m \times 1$ column vector and $X$ is an $n \times1$ column vector of unknowns. Which of the following is false? The system has a solution if and ... a unique solution. The system will have only a trivial solution when $m=n$, $b$ is the zero vector and $\text{rank}(A) =n$.
Let $Ax = b$ be a system of linear equations where $A$ is an $m \times n$ matrix and $b$ is a $m \times 1$ column vector and $X$ is an $n \times1$ column vector of unknow...
Kathleen
21.5k
views
Kathleen
asked
Oct 9, 2014
Linear Algebra
gate1996
linear-algebra
system-of-equations
normal
+
–
34
votes
6
answers
4
GATE CSE 1996 | Question: 1.4
Which of the following statements is FALSE? The set of rational numbers is an abelian group under addition The set of integers in an abelian group under addition The set of rational numbers form an abelian group under multiplication The set of real numbers excluding zero is an abelian group under multiplication
Which of the following statements is FALSE?The set of rational numbers is an abelian group under additionThe set of integers in an abelian group under additionThe set of ...
Kathleen
23.0k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
group-theory
normal
+
–
54
votes
7
answers
5
GATE CSE 1996 | Question: 4
A binary search tree is used to locate the number $43$ ...
A binary search tree is used to locate the number $43$. Which of the following probe sequences are possible and which are not? Explain.$\begin{array}{llllll} \text{(a)} ...
Kathleen
22.9k
views
Kathleen
asked
Oct 9, 2014
DS
gate1996
data-structures
binary-search-tree
normal
descriptive
+
–
33
votes
2
answers
6
GATE CSE 1996 | Question: 1.21
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is $256 \times 16$ $64 K \times 8$ $4 K \times 16$ $64 K \times 16$
A ROM is used to store the table for multiplication of two $8$-bit unsigned integers. The size of ROM required is$256 \times 16$$64 K \times 8$$4 K \times 16$$64 K \times...
Kathleen
18.6k
views
Kathleen
asked
Oct 9, 2014
Digital Logic
gate1996
digital-logic
normal
rom
+
–
33
votes
6
answers
7
GATE CSE 1996 | Question: 2.25
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Minimum number of bits required in the control word to generate the required control signals will be: $2$ $2.5$ $10$ $12$
A micro program control unit is required to generate a total of $25$ control signals. Assume that during any micro instruction, at most two control signals are active. Mi...
Kathleen
24.8k
views
Kathleen
asked
Oct 9, 2014
CO and Architecture
gate1996
co-and-architecture
microprogramming
normal
+
–
39
votes
6
answers
8
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...
Kathleen
13.8k
views
Kathleen
asked
Oct 9, 2014
DS
gate1996
data-structures
hashing
normal
+
–
43
votes
5
answers
9
GATE CSE 1996 | Question: 2.21
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output. Binary to Hex conversion Binary to BCD conversion Binary to Gray code conversion Binary to $radix-12$ conversion
Consider the circuit in below figure which has a four bit binary number $b_3b_2b_1b_0$ as input and a five bit binary number, $d_4d_3d_2d_1d_0$ as output.Binary to Hex co...
Kathleen
14.0k
views
Kathleen
asked
Oct 9, 2014
Digital Logic
gate1996
digital-logic
circuit-output
normal
+
–
40
votes
5
answers
10
GATE CSE 1996 | Question: 2.2
Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement) $A$ is reflexive and transitive $R$ is symmetric and not transitive $R$ is an equivalence relation $R$ is not reflexive and not symmetric
Let $R$ be a non-empty relation on a collection of sets defined by $_{A}R_ B$ if and only if $A \cap B = \phi$. Then, (pick the true statement)$A$ is reflexive and transi...
Kathleen
14.0k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
relations
normal
+
–
22
votes
5
answers
11
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...
Kathleen
13.4k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
partial-order
normal
+
–
30
votes
4
answers
12
GATE CSE 1996 | Question: 1.20, ISRO2008-56
Which of the following is an example of spooled device? A line printer used to print the output of a number of jobs A terminal used to enter input data to a running program A secondary storage device in a virtual memory system A graphic display device
Which of the following is an example of spooled device?A line printer used to print the output of a number of jobsA terminal used to enter input data to a running program...
Kathleen
11.1k
views
Kathleen
asked
Oct 9, 2014
Operating System
gate1996
operating-system
io-handling
normal
isro2008
+
–
43
votes
9
answers
13
GATE CSE 1996 | Question: 2.1
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is given by $f^{-1} (x,y) = \left( \frac {1}{x+y}, \frac{1}{x-y}\right)$ ... $f^{-1}(x,y)=\left [ 2\left(x-y\right),2\left(x+y\right) \right ]$
Let $R$ denote the set of real numbers. Let $f:R\times R \rightarrow R \times R$ be a bijective function defined by $f(x,y) = (x+y, x-y)$. The inverse function of $f$ is ...
Kathleen
9.8k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
33
votes
4
answers
14
GATE CSE 1996 | Question: 1.12
Consider the following statements: First-in-first out types of computations are efficiently supported by STACKS. Implementing LISTS on linked lists is more efficient than implementing LISTS on an array for almost all the basic LIST operations. Implementing QUEUES on a circular array is more ... $(ii)$ are true $(iii)$ and $(iv)$ are true $(ii)$ and $(iv)$ are true
Consider the following statements:First-in-first out types of computations are efficiently supported by STACKS.Implementing LISTS on linked lists is more efficient than i...
Kathleen
14.9k
views
Kathleen
asked
Oct 9, 2014
DS
gate1996
data-structures
easy
queue
stack
linked-list
+
–
33
votes
5
answers
15
GATE CSE 1996 | Question: 2.19
A solution to the Dining Philosophers Problem which avoids deadlock is to ensure that all philosophers pick up the left fork before the right fork ensure that all philosophers pick up the right fork before the left fork ensure that one particular ... the right fork, and that all other philosophers pick up the right fork before the left fork None of the above
A solution to the Dining Philosophers Problem which avoids deadlock is toensure that all philosophers pick up the left fork before the right forkensure that all philosoph...
Kathleen
11.1k
views
Kathleen
asked
Oct 9, 2014
Operating System
gate1996
operating-system
process-synchronization
normal
+
–
35
votes
6
answers
16
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
Kathleen
12.6k
views
Kathleen
asked
Oct 9, 2014
CO and Architecture
gate1996
co-and-architecture
addressing-modes
easy
isro2016
+
–
46
votes
4
answers
17
GATE CSE 1996 | Question: 2.4
Which one of the following is false? The set of all bijective functions on a finite set forms a group under function composition The set $\{1, 2, \dots p-1\}$ forms a group under multiplication mod $p$, where $p$ is a prime number The set of all strings over a finite ... $\langle G, * \rangle$ if and only if for any pair of elements $a, b \in S, a * b^{-1} \in S$
Which one of the following is false?The set of all bijective functions on a finite set forms a group under function compositionThe set $\{1, 2, \dots p-1\}$ forms a group...
Kathleen
9.6k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
normal
set-theory
group-theory
+
–
30
votes
6
answers
18
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...
Kathleen
10.2k
views
Kathleen
asked
Oct 9, 2014
Theory of Computation
gate1996
theory-of-computation
regular-expression
easy
+
–
36
votes
5
answers
19
GATE CSE 1996 | Question: 26
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below: ... of less than $100 nsec$? What is the average access time achieved using the chosen sizes of level $1$ and level $2$ memories?
A computer system has a three-level memory hierarchy, with access time and hit ratios as shown below:$$\overset{ \text {Level $1$ (Cache memory)} \\ \text{Access time = ...
Kathleen
15.1k
views
Kathleen
asked
Oct 9, 2014
CO and Architecture
gate1996
co-and-architecture
cache-memory
normal
+
–
34
votes
5
answers
20
GATE CSE 1996 | Question: 1.3
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one can conclude that $|X| =1, |Y| =97$ $|X| =97, |Y| =1$ $|X| =97, |Y| =97$ None of the above
Suppose $X$ and $Y$ are sets and $|X| \text{ and } |Y|$ are their respective cardinality. It is given that there are exactly $97$ functions from $X$ to $Y$. From this one...
Kathleen
8.7k
views
Kathleen
asked
Oct 9, 2014
Set Theory & Algebra
gate1996
set-theory&algebra
functions
normal
+
–
Page:
1
2
3
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register