Login
Register
Dark Mode
Brightness
Profile
Edit Profile
Messages
My favorites
My Updates
Logout
Recent questions tagged gate1992
13
votes
2
answers
1
GATE CSE 1992 | Question: 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 ...
go_editor
2.4k
views
go_editor
asked
Apr 24, 2016
Algorithms
gate1992
algorithms
recurrence-relation
descriptive
+
–
7
votes
1
answer
2
GATE CSE 1992 | Question: 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...
go_editor
1.6k
views
go_editor
asked
Apr 24, 2016
Programming in C
gate1992
parameter-passing
programming
runtime-environment
normal
descriptive
+
–
25
votes
2
answers
3
GATE CSE 1992 | Question: 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 boolea...
go_editor
2.7k
views
go_editor
asked
Apr 24, 2016
Compiler Design
gate1992
compiler-design
syntax-directed-translation
intermediate-code
descriptive
+
–
41
votes
6
answers
4
GATE CSE 1992 | Question: 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$ ... 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...
go_editor
11.5k
views
go_editor
asked
Apr 24, 2016
Operating System
gate1992
operating-system
memory-management
normal
descriptive
+
–
26
votes
3
answers
5
GATE CSE 1992 | Question: 13b
Suppose we have a database consisting of the following three relations: ... 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:$$\begin{array}{|c|c|} \hline \text {FREQUENTS} & \text {(CUSTOMER, HOTEL)} \\\hline \text {SERVES}...
go_editor
3.7k
views
go_editor
asked
Apr 24, 2016
Databases
gate1992
databases
relational-algebra
normal
descriptive
+
–
28
votes
3
answers
6
GATE CSE 1992 | Question: 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 ...
go_editor
4.7k
views
go_editor
asked
Apr 24, 2016
Set Theory & Algebra
gate1992
set-theory&algebra
partial-order
lattice
normal
+
–
8
votes
2
answers
7
GATE CSE 1992 | Question: 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 relat...
go_editor
3.5k
views
go_editor
asked
Apr 24, 2016
Set Theory & Algebra
gate1992
set-theory&algebra
normal
relations
descriptive
+
–
4
votes
0
answers
8
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....
Cruise Device
6.1k
views
Cruise Device
asked
Jan 15, 2016
Compiler Design
compiler-design
parsing
gate1992
+
–
2
votes
0
answers
9
GATE CSE 1992 | Question: 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 INTR$1,$ INTR$2$ and INTR$3$ are available with priority of INTR$1 >$ priority ... priority 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 INT...
Arjun
841
views
Arjun
asked
Dec 19, 2015
CO and Architecture
gate1992
co-and-architecture
interrupts
normal
descriptive
unsolved
+
–
24
votes
4
answers
10
GATE1992-04-c
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.
Arjun
3.5k
views
Arjun
asked
Sep 22, 2015
Digital Logic
gate1992
digital-logic
sequential-circuit
flip-flop
digital-counter
normal
descriptive
+
–
26
votes
5
answers
11
GATE1992-04-b
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a two-bit output $(X_1, X_0 )$ corresponding to the highest priority active input signal. Assume $A$ has the highest priority followed by $B$ and $C$ has the lowest ... none of the inputs are active the output should be $00$, design the priority encoder using $4:1$ multiplexers as the main components.
A priority encoder accepts three input signals $\text{(A, B and C)}$ and produces a two-bit output $(X_1, X_0 )$ corresponding to the highest priority active input signal...
Arjun
6.9k
views
Arjun
asked
Sep 22, 2015
Digital Logic
gate1992
digital-logic
combinational-circuit
multiplexer
descriptive
+
–
33
votes
1
answer
12
GATE CSE 1992 | Question: 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 ...
Kathleen
8.8k
views
Kathleen
asked
Sep 13, 2014
Theory of Computation
gate1992
theory-of-computation
normal
closure-property
proof
descriptive
+
–
13
votes
1
answer
13
GATE CSE 1992 | Question: 15.a
Use Modus ponens $(A, A → B |= B)$ or resolution to show that the following set is inconsistent: $Q(x) \rightarrow 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) \rightarrow P (x) \vee \sim R (a)$$R (a) \vee \sim Q(a)$$Q(a)$$\si...
Kathleen
3.5k
views
Kathleen
asked
Sep 13, 2014
Mathematical Logic
gate1992
normal
mathematical-logic
propositional-logic
descriptive
+
–
40
votes
4
answers
14
GATE CSE 1992 | Question: 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$.
Kathleen
7.3k
views
Kathleen
asked
Sep 13, 2014
Set Theory & Algebra
gate1992
set-theory&algebra
group-theory
normal
descriptive
proof
+
–
6
votes
1
answer
15
GATE CSE 1992 | Question: 13a
How is redundancy reduced in the following models? Hierarchical Network Relational
How is redundancy reduced in the following models?HierarchicalNetworkRelational
Kathleen
1.0k
views
Kathleen
asked
Sep 13, 2014
Databases
gate1992
databases
descriptive
relational-model
+
–
10
votes
2
answers
16
GATE CSE 1992 | Question: 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 belowS1 parbegin begin S2:S4 end; begin S3; parbegin S5; begin S6:S8 end parend end; S7 parend; S9
Kathleen
3.6k
views
Kathleen
asked
Sep 13, 2014
Operating System
gate1992
operating-system
normal
concurrency
precedence-graph
descriptive
+
–
15
votes
1
answer
17
GATE CSE 1992 | Question: 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 ... $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....
Kathleen
3.2k
views
Kathleen
asked
Sep 13, 2014
Compiler Design
gate1992
compiler-design
syntax-directed-translation
normal
descriptive
+
–
1
votes
1
answer
18
GATE CSE 1992 | Question: 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 ... 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.
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...
Kathleen
1.2k
views
Kathleen
asked
Sep 13, 2014
Programming in C
gate1992
parameter-passing
programming
normal
out-of-gate-syllabus
+
–
27
votes
2
answers
19
GATE CSE 1992 | Question: 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$ ... 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 ...
Kathleen
4.0k
views
Kathleen
asked
Sep 13, 2014
DS
gate1992
data-structures
normal
descriptive
queue
+
–
16
votes
5
answers
20
GATE CSE 1992 | Question: 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 ... 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 r...
Kathleen
5.1k
views
Kathleen
asked
Sep 13, 2014
Algorithms
gate1992
algorithms
descriptive
algorithm-design
+
–
15
votes
4
answers
21
GATE CSE 1992 | Question: 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] 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 ...
Kathleen
3.7k
views
Kathleen
asked
Sep 13, 2014
Algorithms
gate1992
algorithms
recurrence-relation
descriptive
+
–
2
votes
0
answers
22
GATE CSE 1992 | Question: 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 ... 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 ...
Kathleen
1.1k
views
Kathleen
asked
Sep 13, 2014
Digital Logic
gate1992
digital-logic
descriptive
memory-interfacing
out-of-gate-syllabus
8085-microprocessor
+
–
46
votes
4
answers
23
GATE CSE 1992 | Question: 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 ... 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 memor...
Kathleen
24.9k
views
Kathleen
asked
Sep 13, 2014
CO and Architecture
gate1992
co-and-architecture
cache-memory
normal
numerical-answers
+
–
16
votes
3
answers
24
GATE CSE 1992 | Question: 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 overf...
Kathleen
2.7k
views
Kathleen
asked
Sep 13, 2014
Digital Logic
gate1992
digital-logic
normal
number-representation
descriptive
+
–
9
votes
2
answers
25
GATE CSE 1992 | Question: 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 forError detectionError correctionSynchronizationSlowing down the communications...
Kathleen
3.5k
views
Kathleen
asked
Sep 13, 2014
Computer Networks
gate1992
computer-networks
easy
serial-communication
out-of-gate-syllabus
+
–
23
votes
3
answers
26
GATE CSE 1992 | Question: 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...
Kathleen
4.7k
views
Kathleen
asked
Sep 13, 2014
Algorithms
gate1992
algorithms
sorting
easy
quick-sort
descriptive
+
–
33
votes
3
answers
27
GATE CSE 1992 | Question: 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?
Kathleen
6.6k
views
Kathleen
asked
Sep 13, 2014
Graph Theory
gate1992
graph-theory
graph-connectivity
descriptive
+
–
17
votes
2
answers
28
GATE CSE 1992 | Question: 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 generationliterals added to literal tablelisting printedaddres...
Kathleen
4.7k
views
Kathleen
asked
Sep 13, 2014
Compiler Design
gate1992
compiler-design
assembler
easy
+
–
7
votes
1
answer
29
GATE CSE 1992 | Question: 3,i
Write short answers to the following: Which of the following macros can put a macro assembler into an infinite loop? .MACRO M1,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:Which of the following macros can put a macro assembler into an infinite loop?.MACRO M1,X .IF EQ,X M1 X+1 .ENDC .IF NE,X .WORD X .END...
Kathleen
2.0k
views
Kathleen
asked
Sep 13, 2014
Compiler Design
gate1992
compiler-design
assembler
normal
descriptive
+
–
28
votes
1
answer
30
GATE CSE 1992 | Question: 02,xx
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 the same language". $M_{1}$ ... $M_{1}$ and $M_2$, the above statement true.
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}$ r...
Kathleen
7.5k
views
Kathleen
asked
Sep 13, 2014
Theory of Computation
gate1992
theory-of-computation
easy
non-determinism
multiple-selects
+
–
Page:
1
2
next »
Email or Username
Show
Hide
Password
I forgot my password
Remember
Log in
Register