Recent questions tagged gate1992

+5 votes

2 answers

1

GATE 1992-2 (xii) Which of the following regular expression identities are true?

asked Nov 19, 2016 in Theory of Computation by PEKKA Loyal (2.5k points) | 519 views

0 votes

1 answer

2

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.

asked Apr 24, 2016 in Digital Logic by jothee Veteran (92.5k points) | 134 views

0 votes

0 answers

3

GATE1992-04b
A priority encoder accepts three input signals (A, B and C) and produce 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 ... of the inputs are active the output should be 00. design the priority encoder using 4:1 multiplexers as the main components.

asked Apr 24, 2016 in Digital Logic by jothee Veteran (92.5k points) | 109 views

+5 votes

2 answers

4

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 & ... 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 (92.5k points) | 256 views

0 votes

0 answers

5

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; ... ;hellip;… 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 (92.5k points) | 145 views

+12 votes

1 answer

6

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$$

asked Apr 24, 2016 in Compiler Design by jothee Veteran (92.5k points) | 280 views

+8 votes

4 answers

7

GATE1992-12b
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=-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 (92.5k points) | 669 views

+9 votes

2 answers

8

GATE1992-13b
Suppose we have a database consisting of the following three relations: FREQUENTS (CUSTOMER, HOTEL) SERVES (HOTEL, SNACKS) LIKES (CUSTOMER, SNACKS) The first indicates the hotels each customer visits, the second tells which snacks each ... . 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 (92.5k points) | 266 views

+4 votes

1 answer

9

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

asked Apr 24, 2016 in Set Theory & Algebra by jothee Veteran (92.5k points) | 265 views

0 votes

0 answers

10

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$.

asked Apr 24, 2016 in Set Theory & Algebra by jothee Veteran (92.5k points) | 143 views

+1 vote

0 answers

11

Compiler Design - Parsing Techniques

asked Jan 15, 2016 in Compiler Design by Cruise Device Junior (593 points) | 566 views

+1 vote

2 answers

12

GATE1992-4,b
A priority encoder accepts three input signals $(A,B$ and $C)$ and produce 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$ ... of the inputs are active the output should be $00$. Design the priority encoder using $4:1$ multiplexers as the main components.

asked Dec 19, 2015 in Digital Logic by Arjun Veteran (319k points) | 489 views

0 votes

0 answers

13

GATE1992-05,b
Three devices A, B and C are corrected 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 ... priority logic, using an interrupt mask register, in which Priority of A > Priority of B > Priority of C.

asked Dec 19, 2015 in CO & Architecture by Arjun Veteran (319k points) | 159 views

+7 votes

1 answer

14

GATE1992-16
Which of the following three statements are true? Prove your answer. (i) The union of two recursive languages is recursive. (ii) The language $\{O^n \mid n\text{ is a prime} \}$ is not regular. (iii) Regular languages are closed under infinite union.

asked Sep 13, 2014 in Theory of Computation by Kathleen Veteran (66.2k points) | 342 views

0 votes

0 answers

15

GATE1992-15.a
Uses 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 (66.2k points) | 211 views

+8 votes

2 answers

16

GATE1992-14a
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 (66.2k points) | 354 views

+5 votes

1 answer

17

GATE1992-13a
How is redundancy reduced in the following models? Hierarchical Network Relational

asked Sep 13, 2014 in Databases by Kathleen Veteran (66.2k points) | 291 views

+4 votes

2 answers

18

GATE1992-12a
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 (66.2k points) | 419 views

+7 votes

2 answers

19

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 ... TL;$ $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 (66.2k points) | 329 views

+1 vote

1 answer

20

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? ... 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 (66.2k points) | 173 views

+8 votes

2 answers

21

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$). (i). MEMBER (X): ... 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 (66.2k points) | 316 views

+3 votes

1 answer

22

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 ... 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 (66.2k points) | 270 views

+2 votes

3 answers

23

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)

asked Sep 13, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 317 views

+1 vote

0 answers

24

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 ... 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 (66.2k points) | 173 views

+7 votes

2 answers

25

GATE1992-5,a
The access times of the main memory and the Cache memory, in a computer system, are 500 n sec and 50 n sec, respectively. It is estimated that 80% of the main memory request are for read the rest for write. The hit ... -through policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory.

asked Sep 13, 2014 in CO & Architecture by Kathleen Veteran (66.2k points) | 1.6k views

+1 vote

2 answers

26

GATE1992_04a
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 (66.2k points) | 260 views

+2 votes

2 answers

27

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.

asked Sep 13, 2014 in Computer Networks by Kathleen Veteran (66.2k points) | 331 views

+4 votes

1 answer

28

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.

asked Sep 13, 2014 in Algorithms by Kathleen Veteran (66.2k points) | 372 views

+5 votes

3 answers

29

GATE1992_03,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 (66.2k points) | 371 views

+5 votes

1 answer

30

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

asked Sep 13, 2014 in Compiler Design by Kathleen Veteran (66.2k points) | 540 views

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 questions tagged gate1992

Recent Posts

Recent Blog Comments

Recent Badges