Login
Register
@
Dark Mode
Profile
Edit my Profile
Messages
My favorites
Register
Activity
Q&A
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous Years
Blogs
New Blog
Exams
Dark Mode
Recent questions tagged gate1996
38
votes
4
answers
31
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
Kathleen
asked
in
Digital Logic
Oct 9, 2014
by
Kathleen
10.4k
views
gate1996
digital-logic
circuit-output
normal
22
votes
2
answers
32
GATE CSE 1996 | Question: 2.20, ISRO2008-15
Four jobs to be executed on a single processor system arrive at time $0$ in the order $A, B, C, D$. Their burst CPU time requirements are $4, 1, 8, 1$ time units respectively. The completion time of $A$ under round robin scheduling with time slice of one time unit is $10$ $4$ $8$ $9$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
9.0k
views
gate1996
operating-system
process-scheduling
normal
isro2008
31
votes
4
answers
33
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
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
9.0k
views
gate1996
operating-system
process-synchronization
normal
39
votes
5
answers
34
GATE CSE 1996 | Question: 2.18
A $1000$ $\text{Kbyte}$ memory is managed using variable partitions but no compaction. It currently has two partitions of sizes $200$ $\text{Kbyte}$ and $260$ $\text{Kbyte}$ respectively. The smallest allocation request in $\text{Kbyte}$ that could be denied is for $151$ $181$ $231$ $541$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
15.7k
views
gate1996
operating-system
memory-management
normal
19
votes
1
answer
35
GATE CSE 1996 | Question: 2.17
The correct matching for the following pairs is ... $\text{A-4 B-3 C-1 D-2}$ $\text{A-4 B-3 C-2 D-1}$ $\text{A-3 B-4 C-2 D-1}$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
4.7k
views
gate1996
operating-system
easy
runtime-environment
7
votes
1
answer
36
GATE CSE 1996 | Question: 2.16
Which of the following macros can put a macro assembler into an infinite loop? .MACRO M1, X .IF EQ, X ;if X=0 then M1 X + 1 .ENDC .IF NE, X ;if X ≠ O then .WORD X ;address (X) is stored here .ENDC .ENDM .MACRO M2, X .IF EQ, X M2 X .ENDC .IF NE, X .WORD X + 1 .ENDC .ENDM (ii) only (i) only both (i) and (ii) None of the above
Kathleen
asked
in
Compiler Design
Oct 9, 2014
by
Kathleen
3.1k
views
gate1996
compiler-design
macros
normal
28
votes
3
answers
37
GATE CSE 1996 | Question: 2.15
Quick-sort is run on two inputs shown below to sort in ascending order taking first element as pivot $1, 2, 3, \dots n$ $n, n-1, n-2, \dots, 2, 1$ Let $C_1$ and $C_2$ be the number of comparisons made for the inputs (i) and (ii) respectively. Then, $C_1 < C_2$ $C_1 > C_2$ $C_1 = C_2$ we cannot say anything for arbitrary $n$
Kathleen
asked
in
Algorithms
Oct 9, 2014
by
Kathleen
8.9k
views
gate1996
algorithms
sorting
normal
23
votes
4
answers
38
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)$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
26.7k
views
gate1996
data-structures
binary-search-tree
normal
47
votes
8
answers
39
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
Kathleen
asked
in
Algorithms
Oct 9, 2014
by
Kathleen
25.5k
views
gate1996
algorithms
easy
isro2016
searching
21
votes
4
answers
40
GATE CSE 1996 | Question: 2.12
The recurrence relation $T(1) = 2$ $T(n) = 3T (\frac{n}{4}) +n$ has the solution $T(n)$ equal to $O(n)$ $O (\log n)$ $O\left(n^\frac{3}{4}\right)$ None of the above
Kathleen
asked
in
Algorithms
Oct 9, 2014
by
Kathleen
5.5k
views
gate1996
algorithms
recurrence-relation
normal
25
votes
3
answers
41
GATE CSE 1996 | Question: 2.11
The minimum number of interchanges needed to convert the array into a max-heap is $89, 19, 40, 17, 12, 10, 2, 5, 7, 11, 6, 9, 70$ $0$ $1$ $2$ $3$
Kathleen
asked
in
DS
Oct 9, 2014
by
Kathleen
11.6k
views
gate1996
data-structures
heap
easy
25
votes
1
answer
42
GATE CSE 1996 | Question: 2.10
The grammar whose productions are $\langle\text{stmt}\rangle \to\text{ if id then } \langle\text{stmt}\rangle$ $\langle\text{stmt}\rangle\to\text{ if id then } \langle\text{stmt}\rangle\text{ else } \langle\text{stmt}\rangle$ ... f has more than two parse trees (d) the sentence if a then if b then c:= d else c:= f has two parse trees
Kathleen
asked
in
Compiler Design
Oct 9, 2014
by
Kathleen
4.1k
views
gate1996
compiler-design
grammar
normal
40
votes
3
answers
43
GATE CSE 1996 | Question: 2.9
Define a context free languages $L \in \{0, 1\}^*$, $\text{init} (L) = \{u \mid uv \in L$ for some $v$ in $\{0, 1\}^*\}$ ( in other words, $\text{init}(L)$ is the set of prefixes of $L$ ... string the set of all binary strings with exactly one more $0$ than the number of $1$'s or one more $1$ than the number of $0$'s None of the above
Kathleen
asked
in
Theory of Computation
Oct 9, 2014
by
Kathleen
8.3k
views
gate1996
theory-of-computation
context-free-language
normal
22
votes
6
answers
44
GATE CSE 1996 | Question: 2.8
If $L_1$ and $L_2$ are context free languages and $R$ a regular set, one of the languages below is not necessarily a context free language. Which one? $L_1.L_2$ $L_1 \cap L_2$ $L_1 \cap R$ $L_1 \cup L_2$
Kathleen
asked
in
Theory of Computation
Oct 9, 2014
by
Kathleen
4.8k
views
gate1996
theory-of-computation
context-free-language
easy
21
votes
3
answers
45
GATE CSE 1996 | Question: 2.7
The probability that top and bottom cards of a randomly shuffled deck are both aces is $\frac{4}{52} \times \frac{4}{52}$ $\frac{4}{52} \times \frac{3}{52}$ $\frac{4}{52} \times \frac{3}{51}$ $\frac{4}{52} \times \frac{4}{51}$
Kathleen
asked
in
Probability
Oct 9, 2014
by
Kathleen
3.6k
views
gate1996
probability
easy
14
votes
3
answers
46
GATE CSE 1996 | Question: 2.6
The matrices $\begin{bmatrix} \cos\theta && -\sin\theta \\ \sin\theta && \cos\theta \end{bmatrix}$ and $\begin{bmatrix} a && 0\\ 0&& b \end{bmatrix}$ commute under multiplication if $a=b \text{ or } \theta = n\pi, n$ an integer always never if $a \cos\theta = b \sin\theta$
Kathleen
asked
in
Linear Algebra
Oct 9, 2014
by
Kathleen
3.6k
views
gate1996
linear-algebra
normal
matrix
4
votes
2
answers
47
GATE CSE 1996 | Question: 2.5
Newton-Raphson iteration formula for finding $\sqrt[3]{c}$, where $c > 0$ is $x_{n+1}=\frac{2x_n^3 + \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - \sqrt[3]{c}}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 + c}{3x_n^2}$ $x_{n+1}=\frac{2x_n^3 - c}{3x_n^2}$
Kathleen
asked
in
Numerical Methods
Oct 9, 2014
by
Kathleen
1.5k
views
gate1996
numerical-methods
newton-raphson
normal
out-of-syllabus-now
35
votes
3
answers
48
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$
Kathleen
asked
in
Set Theory & Algebra
Oct 9, 2014
by
Kathleen
7.0k
views
gate1996
set-theory&algebra
normal
set-theory
group-theory
25
votes
8
answers
49
GATE CSE 1996 | Question: 2.3
Which of the following is NOT True? (Read $\wedge$ as AND, $\vee$ as OR, $\neg$ as NOT, $\rightarrow$ as one way implication and $\leftrightarrow$ as two way implication) $((x \rightarrow y) \wedge x) \rightarrow y$ ... $(x \rightarrow (x \vee y))$ $((x \vee y) \leftrightarrow (\neg x \rightarrow \neg y))$
Kathleen
asked
in
Mathematical Logic
Oct 9, 2014
by
Kathleen
6.0k
views
gate1996
mathematical-logic
normal
propositional-logic
32
votes
4
answers
50
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
Kathleen
asked
in
Set Theory & Algebra
Oct 9, 2014
by
Kathleen
11.8k
views
gate1996
set-theory&algebra
relations
normal
37
votes
7
answers
51
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 ]$
Kathleen
asked
in
Set Theory & Algebra
Oct 9, 2014
by
Kathleen
7.0k
views
gate1996
set-theory&algebra
functions
normal
43
votes
2
answers
52
GATE CSE 1996 | Question: 1.25
Consider the following floating-point number representation.$\begin{array}{c|c} \begin{array}{cc}31\;\;\hspace{15pt}&\hspace{15pt}24\end{array} & \begin{array}{cc}23\hspace{15pt}&\hspace{15pt}0\end{array} \\\hline \text{Exponent}&\text{Mantissa}\\ \hline \end{array}$The ... to $1$ $0.5$ to $1$ $2^{-23}$ to $0.5$ $0.5$ to $\left(1-2^{-23}\right)$
Kathleen
asked
in
Digital Logic
Oct 9, 2014
by
Kathleen
17.2k
views
gate1996
digital-logic
number-representation
normal
14
votes
2
answers
53
GATE CSE 1996 | Question: 1.24
For the daisy chain scheme of connecting I/O devices, which of the following statements is true? It gives non-uniform priority to various devices It gives uniform priority to all devices It is only useful for connecting slow devices to a processor device It requires a separate interrupt pin on the processor for each device
Kathleen
asked
in
CO and Architecture
Oct 9, 2014
by
Kathleen
5.6k
views
gate1996
co-and-architecture
io-handling
normal
22
votes
2
answers
54
GATE CSE 1996 | Question: 1.23
Booth’s algorithm for integer multiplication gives worst performance when the multiplier pattern is $101010\ldots1010$ $100000\ldots 0001$ $111111\ldots 1111$ $011111\ldots1110$
Kathleen
asked
in
Digital Logic
Oct 9, 2014
by
Kathleen
5.6k
views
gate1996
digital-logic
booths-algorithm
normal
3
votes
2
answers
55
GATE CSE 1996 | Question: 1.22
Number of machine cycles required for RET instruction in 8085 microprocessor is 1 2 3 5
Kathleen
asked
in
CO and Architecture
Oct 9, 2014
by
Kathleen
2.9k
views
gate1996
co-and-architecture
8085-microprocessor
out-of-syllabus-now
31
votes
1
answer
56
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$
Kathleen
asked
in
Digital Logic
Oct 9, 2014
by
Kathleen
16.1k
views
gate1996
digital-logic
normal
rom
28
votes
3
answers
57
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
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
8.9k
views
gate1996
operating-system
io-handling
normal
isro2008
20
votes
1
answer
58
GATE CSE 1996 | Question: 1.19, ISRO2008-61
A critical section is a program segment which should run in a certain amount of time which avoids deadlocks where shared resources are accessed which must be enclosed by a pair of semaphore operations, $P$ and $V$
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
4.5k
views
gate1996
operating-system
process-synchronization
easy
isro2008
26
votes
1
answer
59
GATE CSE 1996 | Question: 1.18
The process state transition diagram in the below figure is representative of a batch operating system an operating system with a preemptive scheduler an operating system with a non-preemptive scheduler a uni-programmed operating system
Kathleen
asked
in
Operating System
Oct 9, 2014
by
Kathleen
6.2k
views
gate1996
operating-system
normal
process
33
votes
2
answers
60
GATE CSE 1996 | Question: 1.17
The pass numbers for each of the following activities object code generation literals added to literal table listing printed address resolution of local symbols that occur in a two pass assembler respectively are $1, 2, 1, 2$ $2, 1, 2, 1$ $2, 1, 1, 2$ $1, 2, 2, 2$
Kathleen
asked
in
Compiler Design
Oct 9, 2014
by
Kathleen
10.5k
views
gate1996
compiler-design
normal
assembler
Page:
« prev
1
2
3
next »
Subscribe to GATE CSE 2023 Test Series
Subscribe to GO Classes for GATE CSE 2023
Quick search syntax
tags
tag:apple
author
user:martin
title
title:apple
content
content:apple
exclude
-tag:apple
force match
+apple
views
views:100
score
score:10
answers
answers:2
is accepted
isaccepted:true
is closed
isclosed:true
Recent Posts
POWER GRID CORPORATION OF INDIA LIMITED
INSTITUTE OF BANKING PERSONNEL SELECTION
GATE Overflow books for TIFR, ISRO, UGCNET and NIELIT
RECRUITMENT IN OIL AND GAS CORPORATION LIMITED
Aptitude Overflow Book
Subjects
All categories
General Aptitude
(2.4k)
Engineering Mathematics
(9.1k)
Digital Logic
(3.2k)
Programming and DS
(5.8k)
Algorithms
(4.5k)
Theory of Computation
(6.6k)
Compiler Design
(2.3k)
Operating System
(4.9k)
Databases
(4.5k)
CO and Architecture
(3.7k)
Computer Networks
(4.5k)
Non GATE
(1.3k)
Others
(2.4k)
Admissions
(647)
Exam Queries
(841)
Tier 1 Placement Questions
(17)
Job Queries
(74)
Projects
(9)
Unknown Category
(855)
Recent questions tagged gate1996
Recent Blog Comments
@abir_banerjee Thanks Abir. I'm third year...
@nolan_keats Currently I am in third year...
@abir_banerjee thank you Abir.Supposing you...
@nolan_keats just a suggestion as I also...
@abir_banerjee Hope I can do this in span of one...