menu
search
Log In

GO Book for GATECSE 2022

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

Subjects


GATE Overflow
Recent questions tagged gate1992

Network Sites

 GO Mechanical
 GO Electrical
 GO Electronics
 GO Civil
 CSE Doubts

Recent questions tagged gate1992

4 votes
1 answer
1
GATE1992-04c
Design a $3-$bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
Design a $3-$bit counter using D-flip flops such that not more than one flip-flop changes state between any two consecutive states.
asked Apr 24, 2016 in Digital Logic jothee 498 views
11 votes
2 answers
2
GATE1992-07b
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)$.
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 jothee 1.2k views
0 votes
1 answer
3
GATE1992-10b
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
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 jothee 493 views
19 votes
2 answers
4
GATE1992-11b
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$
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 jothee 1.4k views
37 votes
5 answers
5
GATE1992-12-b
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.
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$, $d$ was ... $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 jothee 5.5k views
22 votes
2 answers
6
GATE1992-13b
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.
Suppose we have a database consisting of the following three relations: ... which 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 jothee 1.7k views
18 votes
2 answers
7
GATE1992-14b
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
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 jothee 2.2k views
2 votes
2 answers
8
GATE1992-15.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 $a-b$ is a multiple of $n$. Show that $R$ is an equivalence relation and find its equivalence classes for $n = 5$.
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 $a-b$ 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 jothee 1.1k views
4 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.
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 Cruise Device 5.3k views
0 votes
0 answers
10
GATE1992-05,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.$
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 INTR3. Draw a ... of the priority 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 Arjun 417 views
25 votes
1 answer
11
GATE1992-16
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.
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 Kathleen 2.9k views
3 votes
1 answer
12
GATE1992-15.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) \vee \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.
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) \vee \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 Kathleen 1.2k views
25 votes
3 answers
13
GATE1992-14a
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
If $G$ is a group of even order, then show that there exists an element $a≠e$, the identity in $G$, such that $a^2 = e$.
asked Sep 13, 2014 in Set Theory & Algebra Kathleen 2.8k views
5 votes
1 answer
14
GATE1992-13a
How is redundancy reduced in the following models? Hierarchical Network Relational
How is redundancy reduced in the following models? Hierarchical Network Relational
asked Sep 13, 2014 in Databases Kathleen 620 views
9 votes
2 answers
15
GATE1992-12-a
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
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 Kathleen 1.9k views
11 votes
1 answer
16
GATE1992-11a
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$
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. $D \rightarrow TL;$ $T \rightarrow \text{int}$ $T \rightarrow \text{real}$ $L \rightarrow L,id$ $L \rightarrow id$
asked Sep 13, 2014 in Compiler Design Kathleen 1.5k views
1 vote
1 answer
17
GATE1992-10a
What type of parameter passing mechanism (call-by-value, call-by-reference, call-by-name, or-by-value 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.&#8203;
What type of parameter passing mechanism (call-by-value, call-by-reference, call-by-name, or-by-value 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 correct? ... , say z. Assign to z the value of A[i]. Execute the body of P using z for A[i] Set A[i] to z.&#8203;
asked Sep 13, 2014 in Programming Kathleen 521 views
22 votes
2 answers
18
GATE1992-09
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.
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$ ... operations 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 Kathleen 1.8k views
11 votes
5 answers
19
GATE1992-8
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.
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 printing the ... be 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 Kathleen 2.4k views
11 votes
4 answers
20
GATE1992-07a
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)$
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 Kathleen 1.8k views
2 votes
0 answers
21
GATE1992-06,a,b
A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit 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.
A microprocessor is capable of addressing 1 megabyte of memory with a 20-bit 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 (electrically ... equivalent 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 Kathleen 458 views
39 votes
4 answers
22
GATE1992-5-a
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 ... write-through policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory (in ns)
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 the read ... a write-through 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 Kathleen 10k views
13 votes
3 answers
23
GATE1992-4-a
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.
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 Kathleen 1.2k views
8 votes
3 answers
24
GATE1992-03,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.
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 Kathleen 2k views
16 votes
3 answers
25
GATE1992-03,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.
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 Kathleen 2.4k views
26 votes
3 answers
26
GATE1992-03,iii
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
asked Sep 13, 2014 in DS Kathleen 3.1k views
13 votes
1 answer
27
GATE1992-03,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
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 Kathleen 2.4k views
5 votes
1 answer
28
GATE1992-3,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.
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 Kathleen 745 views
23 votes
1 answer
29
GATE1992-02,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 non-deterministic machine $M_{1}$ ... $M_{1}$ and $M_2$, the above statement true.
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 non-deterministic machine $M_{1}$ there exists an equivalent deterministic machine $M_{2}$ recognizing ... $M_{1}$ is a non-deterministic Turing machine. For no machines $M_{1}$ and $M_2$, the above statement true.
asked Sep 13, 2014 in Theory of Computation Kathleen 2.7k views
32 votes
4 answers
30
GATE1992-02,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$
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 Kathleen 6.1k views
Page:
Dark theme
Muffin by Hélio Chun
Thanks to Q2A
...