Recent questions tagged gate1991

+3 votes

3 answers

1

gate1991
Indicate all the true statements from the following: (a) A programming language not supporting either recursion or pointer type does not need the support of dynamic memory allocation. (b) Although C does not support call by name parameter passing, the effect can be correctly simulated in C.

asked Apr 8 in Programming by Vishal Rana (371 points) | 310 views

0 votes

0 answers

2

GATE1991-07b
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a 16 bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. Assume that the lower order 8 bits of an instruction constitute the operand field. Draw the logic schematic of the hardwired controller including the data path.

asked Apr 24, 2016 in CO & Architecture by jothee Veteran (103k points) | 292 views

+11 votes

1 answer

3

GATE1991-10c
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Does the grammar ... given production rules and adding at most one more production rule. Convert the grammar obtained above into one that is not left recursive.

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

+8 votes

2 answers

4

GATE1991-10b
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Does the ... with redundant parentheses. Do this with minimum number of changes to the given production rules and adding at most one more production rule.

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

+12 votes

2 answers

5

GATE1991-09b
For the following code, indicate the output if static scope rules dynamic scope rules are used var a,b : integer; procedure P; a := 5; b := 10; end {P}; procedure Q; var a, b : integer; P; end {Q}; begin a := 1; b := 2; Q; Write ('a = ', a, 'b = ', b); end

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

+19 votes

1 answer

6

GATE1991-14,c
Consider the binary tree in the figure below: Outline a procedure in Pseudo-code to delete an arbitrary node from such a binary tree with $n$ nodes that preserves the structures. What is the worst-case-time-complexity of your procedure?

asked Apr 18, 2016 in DS by jothee Veteran (103k points) | 580 views

+11 votes

2 answers

7

GATE1991-14,b
Consider the binary tree in the figure below: Give different steps for deleting the node with key $5$ so that the structure is preserved.

asked Apr 18, 2016 in DS by jothee Veteran (103k points) | 495 views

+1 vote

1 answer

8

GATE1991-11,b
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] := ... situation in which a waiting process can never enter the critical section? If so, explain and suggest modifications to the code to solve this problem

asked Apr 18, 2016 in Operating System by jothee Veteran (103k points) | 373 views

+2 votes

1 answer

9

GATE1991-12,b
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write algebraic solution to the following : Get SCODE values for suppliers who supply to both projects PR1 and PR2. Get PRCODE values for projects supplied by at least one supplier not in the same city.

asked Apr 18, 2016 in Databases by jothee Veteran (103k points) | 388 views

+19 votes

2 answers

10

GATE1991-15,b
(b) Consider the following first order formula: $\left ( \matrix{ \forall x \exists y : R(x,y) \\[1em] \Large \land \\[1em] \forall x \forall y : \left ( R(x,y) \implies \lnot R(y,x) \right) \\[1em] \Large \land \\[1em] \forall x \forall y \forall ... \land \\[1em] \forall x: \lnot R(x,x) }\right )$ Does it have finite models? Is it satisfiable? If so, give a countable model for it.

asked Nov 16, 2015 in Mathematical Logic by ibia Active (3.5k points) | 1.1k views

+10 votes

4 answers

11

GATE1991-17,a
Show that the Turing machines, which have a read only input tape and constant size work tape, recognize precisely the class of regular languages.

asked Nov 15, 2015 in Theory of Computation by Arjun Veteran (359k points) | 604 views

+20 votes

3 answers

12

GATE1991-16,b
Show that all vertices in an undirected finite graph cannot have distinct degrees, if the graph has at least two vertices.

asked Nov 15, 2015 in Graph Theory by Arjun Veteran (359k points) | 788 views

+5 votes

0 answers

13

GATE1991-6,b
Design a 1024 bit serial-in/serial-out unidirectional shift register using a 1K $\times$ 1 bit RAM with a data input $D_{in}$, data output $D_{out}$ and control input $\text{READ}/\overline{\text{WRITE}}$. You may assume the availability of standard SSI and MSI components such as gates, registers and counters.

asked Nov 14, 2015 in Digital Logic by ibia Active (3.5k points) | 273 views

+28 votes

5 answers

14

GATE1991-5-c
Find the maximum clock frequency at which the counter in the figure below can be operated. Assume that the propagation delay through each flip flop and each AND gate is $10$ $\text{ns}$. Also assume that the setup time for the $JK$ inputs of the flip flops is negligible.

asked Nov 14, 2015 in Digital Logic by ibia Active (3.5k points) | 3.2k views

+12 votes

2 answers

15

GATE1991-5-b
Find the minimum sum of products form of the logic function $ f(A,B,C,D) = \Sigma m(0,2,8,10,15)+ \Sigma d(3,11,12,14)$ where $m$ and $d$ represent minterm and don't care term respectively.

asked Nov 14, 2015 in Digital Logic by ibia Active (3.5k points) | 480 views

+3 votes

1 answer

16

GATE1991-01,xi
The arithmetic expression $$(a+b) * c- d/e ** l$$ is to be evaluated on a two address machine, where each operand is either a register or a memory location. With a minimum number of memory accesses of operands.the number of registers required to evaluate this expression is ______. The number of memory accesses of operands is ____________

asked Nov 14, 2015 in Compiler Design by ibia Active (3.5k points) | 346 views

+18 votes

6 answers

17

GATE1991-17,b
Let $L$ be the language of all binary strings in which the third symbol from the right is a $1$. Give a non-deterministic finite automaton that recognizes $L$. How many states does the minimized equivalent deterministic finite automaton have? Justify your answer briefly?

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

+25 votes

1 answer

18

GATE1991-16,a
Find the number of binary strings $w$ of length $2n$ with an equal number of $1's$ and $0's$ and the property that every prefix of $w$ has at least as many $0's$ as $1's.$

asked Sep 13, 2014 in Combinatory by Kathleen Veteran (59.6k points) | 934 views

+11 votes

5 answers

19

GATE1991-15,a
Show that the product of the least common multiple and the greatest common divisor of two positive integers $a$ and $b$ is $a\times b$.

asked Sep 13, 2014 in Set Theory & Algebra by Kathleen Veteran (59.6k points) | 463 views

+14 votes

4 answers

20

GATE1991-14,a
Consider the binary tree in the figure below: (a). What structure is represented by the binary tree?

asked Sep 13, 2014 in DS by Kathleen Veteran (59.6k points) | 781 views

+12 votes

3 answers

21

GATE1991-13
Give an optimal algorithm in pseudo-code for sorting a sequence of $n$ numbers which has only $k$ distinct numbers ($k$ is not known a Priori). Give a brief analysis for the time-complexity of your algorithm.

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

+13 votes

4 answers

22

GATE1991-12-a
Suppose a database consist of the following relations: SUPPLIER (SCODE,SNAME,CITY). PART (PCODE,PNAME,PDESC,CITY). PROJECTS (PRCODE,PRNAME,PRCITY). SPPR (SCODE,PCODE,PRCODE,QTY). Write SQL programs corresponding to the following queries: Print PCODE values for parts supplied ... part to a project in the second city, but do not print the triples in which the two CITY values are same.

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

+1 vote

2 answers

23

GATE1991-11,a
Consider the following scheme for implementing a critical section in a situation with three processes $P_i, P_j$ and $P_k$. Pi; repeat flag[i] := true; while flag [j] or flag[k] do case turn of j: if flag [j] then begin flag [i] := false; ... := j; flag [i] := false non-critical section until false; Does the scheme ensure mutual exclusion in the critical section? Briefly explain.

asked Sep 13, 2014 in Operating System by Kathleen Veteran (59.6k points) | 611 views

+14 votes

2 answers

24

GATE1991-10a
Consider the following grammar for arithmetic expressions using binary operators $-$ and $/$ which are not associative $E \rightarrow E -T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the grammar unambiguous? Is so, what is the relative precedence between $-$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $-$.

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

+15 votes

3 answers

25

GATE1991-09a
Consider the following pseudo-code (all data items are of type integer): procedure P(a, b, c); a := 2; c := a + b; end {P} begin x := 1; y := 5; z := 100; P(x, x*y, z); Write ('x = ', x, 'z = ', z); end Determine its output, if the parameters are passed to the Procedure P by value reference name

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

+1 vote

0 answers

26

GATE1991-08,a,b

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

+1 vote

0 answers

27

GATE1991-07a
It is required to design a hardwired controller to handle the fetch cycle of a single address CPU with a 16 bit instruction-length. The effective address of an indexed instruction should be derived in the fetch cycle itself. Assume that the ... 8 bits of an instruction constitute the operand field. Give the register transfer sequence for realizing the above instruction fetch cycle.

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

+2 votes

1 answer

28

GATE1991-06,a
Using D flip-flop gates, design a parallel-in/serial-out shift register that shifts data from left to right with the following input lines: Clock $\text{CLK}$ Three parallel data inputs $A, B, C$ Serial input $S$ Control input $\text{load} / \overline{\text{SHIFT}}$.

asked Sep 13, 2014 in Digital Logic by Kathleen Veteran (59.6k points) | 284 views

+13 votes

1 answer

29

GATE1991-5-a
Analyse the circuit in Fig below and complete the following table a b $Q_n$ 0 0 0 1 1 0 1 1

asked Sep 13, 2014 in Digital Logic by Kathleen Veteran (59.6k points) | 841 views

+4 votes

0 answers

30

GATE1991-04,i,ii,iii,iv

asked Sep 12, 2014 in Non GATE by Kathleen Veteran (59.6k points) | 169 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 gate1991

Recent Posts

Recent Blog Comments