The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent questions tagged gate1992
+2
votes
1
answer
1
GATE199204c
Design a $3$bit counter using Dflip flops such that not more than one flipflop changes state between any two consecutive states.
asked
Apr 24, 2016
in
Digital Logic
by
jothee
Veteran
(
100k
points)

258
views
gate1992
normal
descriptive
digitallogic
flipflop
+10
votes
2
answers
2
GATE199207b
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] Solve the recurrence relation for a closed form solution of $F(n)$.
asked
Apr 24, 2016
in
Algorithms
by
jothee
Veteran
(
100k
points)

617
views
gate1992
algorithms
recurrence
descriptive
0
votes
0
answers
3
GATE199210b
Show the activation records and the display structure just after the procedures called at lines marked $x$ and $y$ have started their execution. Be sure to indicate which of the two procedures named $A$ you are referring to. Program Test; Procedure A; Procedure B; Procedure A; begin …… end A; begin y: A; end B; begin B; end A; begin x: A; end Test
asked
Apr 24, 2016
in
Programming
by
jothee
Veteran
(
100k
points)

340
views
gate1992
parameterpassing
programming
runtimeenvironments
normal
unsolved
+16
votes
2
answers
4
GATE199211b
Write $3$ address intermediate code (quadruples) for the following boolean expression in the sequence as it would be generated by a compiler. Partial evaluation of boolean expressions is not permitted. Assume the usual rules of precedence of the operators.$(a+b) > (c+d) \text{ or } a > c \text{ and }b < d$
asked
Apr 24, 2016
in
Compiler Design
by
jothee
Veteran
(
100k
points)

694
views
gate1992
compilerdesign
syntaxdirectedtranslation
intermediatecode
descriptive
+29
votes
4
answers
5
GATE199212b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ was referenced at time $t=0$ ... referenced at time $t=2$. Determine the total number of page faults and the average number of page frames used by computing the working set at each reference.
asked
Apr 24, 2016
in
Operating System
by
jothee
Veteran
(
100k
points)

2.4k
views
gate1992
operatingsystem
memorymanagement
normal
+15
votes
2
answers
6
GATE199213b
Suppose we have a database consisting of the following three relations: ... snacks are liked by each customer. Express the following query in relational algebra: Print the hotels the serve the snack that customer Rama likes.
asked
Apr 24, 2016
in
Databases
by
jothee
Veteran
(
100k
points)

764
views
gate1992
databases
relationalalgebra
normal
+12
votes
2
answers
7
GATE199214b
Consider the set of integers $\{1,2,3,4,6,8,12,24\}$ together with the two binary operations LCM (lowest common multiple) and GCD (greatest common divisor). Which of the following algebraic structures does this represent? group ring field lattice
asked
Apr 24, 2016
in
Set Theory & Algebra
by
jothee
Veteran
(
100k
points)

944
views
gate1992
settheory&algebra
groups
normal
0
votes
1
answer
8
GATE199215.b
Let $S$ be the set of all integers and let $n > 1$ be a fixed integer. Define for $a,b \in S, a R b$ iff $ab$ is a multiple of $n$. Show that $R$ is an equivalence relation and find its equivalence classes for $n = 5$.
asked
Apr 24, 2016
in
Set Theory & Algebra
by
jothee
Veteran
(
100k
points)

368
views
gate1992
settheory&algebra
normal
relations
+3
votes
0
answers
9
Compiler Design  Parsing Techniques
Consider the SLR(1) and LALR(1) parsing tables for a context free grammar. Which of the following statements is/are true? a] The goto part of both tables may be different. b] The shift entries are identical in both the tables c] The reduce entries in the tables may be different d] The error entries in the tables may be different.
asked
Jan 15, 2016
in
Compiler Design
by
Cruise Device
(
357
points)

1.5k
views
compilerdesign
parsing
gate1992
0
votes
0
answers
10
GATE199205,b
Three devices $A, B$ and $C$ are connected to the bus of a computer, input/output transfers for all three devices use interrupt control. Three interrupt request lines INTR1, INTR2 and INTR3 are available with priority of INTR1 > priority of INTR2 > priority of ... logic, using an interrupt mask register, in which Priority of $A$ > Priority of $B$ > Priority of $C.$
asked
Dec 19, 2015
in
CO and Architecture
by
Arjun
Veteran
(
418k
points)

287
views
gate1992
coandarchitecture
interrupts
normal
unsolved
+20
votes
1
answer
11
GATE199216
Which of the following three statements are true? Prove your answer. The union of two recursive languages is recursive. The language $\{O^n \mid n\text{ is a prime} \}$ is not regular. Regular languages are closed under infinite union.
asked
Sep 13, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

1k
views
gate1992
theoryofcomputation
normal
closureproperty
+3
votes
1
answer
12
GATE199215.a
Use Modus ponens $(A, A → B = B)$ or resolution to show that the following set is inconsistent: $Q(x) → P (x) \vee \sim R (a)$ $R (a) \wedge \sim Q(a)$ $Q(a)$ $\sim P (y)$ where $x$ and $y$ are universally quantified variables, $a$ is a constant and $P, Q, R$ are monadic predicates.
asked
Sep 13, 2014
in
Mathematical Logic
by
Kathleen
Veteran
(
52.1k
points)

513
views
gate1992
normal
mathematicallogic
propositionallogic
+20
votes
2
answers
13
GATE199214a
If $G$ is a group of even order, then show that there exists an element $a≠e$, $e$, the identity in $G$, such that $a^2 = e$.
asked
Sep 13, 2014
in
Set Theory & Algebra
by
Kathleen
Veteran
(
52.1k
points)

987
views
gate1992
settheory&algebra
groups
normal
descriptive
proof
+5
votes
1
answer
14
GATE199213a
How is redundancy reduced in the following models? Hierarchical Network Relational
asked
Sep 13, 2014
in
Databases
by
Kathleen
Veteran
(
52.1k
points)

420
views
gate1992
databases
descriptive
+7
votes
2
answers
15
GATE199212a
Draw the precedence graph for the concurrent program given below S1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
asked
Sep 13, 2014
in
Operating System
by
Kathleen
Veteran
(
52.1k
points)

873
views
gate1992
operatingsystem
normal
concurrency
precedencegraph
+10
votes
1
answer
16
GATE199211a
Write syntax directed definitions (semantic rules) for the following grammar to add the type of each identifier to its entry in the symbol table during semantic analysis. Rewriting the grammar is not permitted and semantic rules are to be added to the ends of productions only. ... $T \rightarrow \text{int}$ $T \rightarrow \text{real}$ $L \rightarrow L,id$ $L \rightarrow id$
asked
Sep 13, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

779
views
gate1992
compilerdesign
syntaxdirectedtranslation
normal
+1
vote
1
answer
17
GATE199210a
What type of parameter passing mechanism (callbyvalue, callbyreference, callbyname, orbyvalue result) is the following sequence of actions trying to implement for a procedure call $P (A[i])$ where P (i:integer) is a procedure and A is an integer array? Is the implementation ... z. Assign to z the value of A[i]. Execute the body of P using z for A[i] Set A[i] to z.​
asked
Sep 13, 2014
in
Programming
by
Kathleen
Veteran
(
52.1k
points)

359
views
gate1992
parameterpassing
programming
normal
outofsyllabusnow
+15
votes
2
answers
18
GATE199209
Suggest a data structure for representing a subset $S$ of integers from $1$ to $n$. Following operations on the set $S$ are to be performed in constant time (independent of cardinality of $S$ ... in an English like language. You may assume that the data structure has been suitable initialized. Clearly state your assumptions regarding initialization.
asked
Sep 13, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

891
views
gate1992
datastructure
normal
descriptive
queues
+10
votes
4
answers
19
GATE19928
Let $T$ be a Depth First Tree of a undirected graph $G$. An array $P$ indexed by the vertices of $G$ is given. $P[V]$ is the parent of vertex $V$, in $T$. Parent of the root is the root itself. Give a method for finding and ... proportional to the length of the cycle. Describe the algorithm in a PASCAL $(C)$  like language. Assume that the variables have been suitably declared.
asked
Sep 13, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

904
views
gate1992
algorithms
descriptive
algorithmdesign
+9
votes
4
answers
20
GATE199207a
Consider the function $F(n)$ for which the pseudocode is given below : Function F(n) begin F1 ← 1 if(n=1) then F ← 3 else For i = 1 to n do begin C ← 0 For j = 1 to n – 1 do begin C ← C + 1 end F1 = F1 * C end F = F1 end [$n$ is a positive integer greater than zero] (a) Derive a recurrence relation for $F(n)$
asked
Sep 13, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

830
views
gate1992
algorithms
recurrence
descriptive
+2
votes
0
answers
21
GATE199206,a,b
A microprocessor is capable of addressing 1 megabyte of memory with a 20bit address bus. The system to be designed requires 256 K bytes of RAM, 256 K bytes of EPROM, 16 I/O devices (memory mapped I/O) and 1 K byte of EERAM ( ... to two clock cycles for memory read and write. Assuming control signals similar to 8085, design the extra logic required for interfacing EERAM.
asked
Sep 13, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

327
views
gate1992
digitallogic
descriptive
memoryinterfacing
outofsyllabusnow
8085
+22
votes
4
answers
22
GATE19925a
The access times of the main memory and the Cache memory, in a computer system, are $500$ $n sec$ and $50$ $nsec$, respectively. It is estimated that $80$% of the main memory request are for read the rest for write. The hit ratio for ... writethrough policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory (in ns)
asked
Sep 13, 2014
in
CO and Architecture
by
Kathleen
Veteran
(
52.1k
points)

4.1k
views
gate1992
coandarchitecture
cachememory
normal
numericalanswers
+9
votes
3
answers
23
GATE19924a
Consider addition in two's complement arithmetic. A carry from the most significant bit does not always correspond to an overflow. Explain what is the condition for overflow in two's complement arithmetic.
asked
Sep 13, 2014
in
Digital Logic
by
Kathleen
Veteran
(
52.1k
points)

620
views
gate1992
digitallogic
normal
numberrepresentation
+6
votes
3
answers
24
GATE199203,v
Start and stop bits do not contain any "information" but are used in serial communication for Error detection Error correction Synchronization Slowing down the communications.
asked
Sep 13, 2014
in
Computer Networks
by
Kathleen
Veteran
(
52.1k
points)

779
views
gate1992
computernetworks
easy
serialcommunication
+13
votes
1
answer
25
GATE199203,iv
Assume that the last element of the set is used as partition element in Quicksort. If $n$ distinct elements from the set $\left[1\dots n\right]$ are to be sorted, give an input for which Quicksort takes maximum time.
asked
Sep 13, 2014
in
Algorithms
by
Kathleen
Veteran
(
52.1k
points)

964
views
gate1992
algorithms
sorting
easy
+18
votes
3
answers
26
GATE199203,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
asked
Sep 13, 2014
in
DS
by
Kathleen
Veteran
(
52.1k
points)

1.3k
views
gate1992
datastructure
graphs
easy
+12
votes
1
answer
27
GATE199203,ii
Mention the pass number for each of the following activities that occur in a two pass assembler: object code generation literals added to literal table listing printed address resolution of local symbols
asked
Sep 13, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

1.2k
views
gate1992
compilerdesign
assembler
easy
+4
votes
1
answer
28
GATE19923,i
Write short answers to the following: (i). Which of the following macros can put a macro assembler into an infinite loop? .MACRO MI,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .ENDC .ENDM .MACRO M2,X .IF EQ,X M2 X .ENDC .IF NE,X .WORD X+1 .ENDC .ENDM Give an example call that does so.
asked
Sep 13, 2014
in
Compiler Design
by
Kathleen
Veteran
(
52.1k
points)

353
views
gate1992
compilerdesign
assembler
normal
+18
votes
1
answer
29
GATE199202,xx
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: In which of the cases stated below is the following statement true? "For every nondeterministic machine $M_{1}$ ... $M_{1}$ and $M_2$, the above statement true.
asked
Sep 13, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

1k
views
gate1992
theoryofcomputation
easy
nondeterminism
+23
votes
3
answers
30
GATE199202,xviii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: If $G$ is a context free grammar and $w$ is a string of length $l$ in $L(G)$, how long is a derivation of $w$ in $G$, if $G$ is in Chomsky normal form? $2l$ $2l +1$ $2l 1$ $l$
asked
Sep 13, 2014
in
Theory of Computation
by
Kathleen
Veteran
(
52.1k
points)

2.3k
views
gate1992
theoryofcomputation
contextfreelanguage
easy
Page:
1
2
next »
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
Minimum Number of States in a DFA accepting a binary number divisible by 'n'
GATE 2020 Application Form Opened!
My GATE Preparation Journey
ISI MTECH CS 2019 INTERVIEW EXPERIENCE
IIT HYDERABAD MTECH TA INTERVIEW EXPERIENCE
Follow @csegate
Recent questions tagged gate1992
Recent Blog Comments
Feedback for next edition (if ever there's...
Is go book still available,I want to buy it
will pdfs be uploaded ?
50,092
questions
55,256
answers
190,786
comments
86,054
users