Recent questions tagged gate1992
Register

Recent questions tagged gate1992

Recent questions tagged gate1992
0 votes
0 answers 26 views
GATE1992-92,xv Video Solution
Which of the following predicate calculus statements is/are valid? $(\forall (x)) P(x) \vee (\forall(x))Q(x) \implies (\forall (x)) (P(x) \vee Q(x))$ $(\exists (x)) P(x) \wedge (\exists (x))Q(x) \implies (\exists (x)) (P(x) \wedge Q(x))$ ... $(\exists (x)) (P(x) \vee Q(x)) \implies \sim (\forall (x)) P(x) \vee (\exists (x)) Q(x)$
admin asked in Mathematical Logic Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 40 views
GATE1992-5-a Video Solution
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 ... through policy (where both main and cache memories are updated simultaneously) is used. Determine the average time of the main memory (in ns)
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
40 views
0 votes
0 answers 18 views
GATE1992-01,ix Video Solution
Complexity of Kruskal’s algorithm for finding the minimum spanning tree of an undirected graph containing $n$ vertices and $m$ edges if the edges are sorted is _______
admin asked in Algorithms Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 13 views
GATE1992-02,x, ISRO2015-35 Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: At a particular time of computation, the value of a counting semaphore is $7$. Then $20$ $P$ operations and $15$ $V$ operations were completed on this semaphore. The resulting value of the semaphore is : $42$ $2$ $7$ $12$
admin asked in Operating System Apr 18, 2020
by admin
585 points
13 views
0 votes
0 answers 16 views
GATE1992-01,ii Video Solution
Consider a $3$-$bit$ error detection and $1$-$bit$ error correction hamming code for $4$-$bit$ data. The extra parity bits required would be ___ and the $3$-$bit$ error detection is possible because the code has a minimum distance of ____.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 20 views
GATE1992-12-b Video Solution
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$ ... 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.
admin asked in Operating System Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 26 views
GATE1992-01-vi Video Solution
In an $11-bit$ computer instruction format, the size of address field is $4-bits.$ The computer uses expanding OP code technique and has $5$ two-address instructions and $32$ one-address instructions. The number of zero-address instructions it can support is ________
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 26 views
GATE1992-02,xviii Video Solution
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$
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
26 views
0 votes
0 answers 24 views
GATE1992-02,vii Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: A $2-3$ tree is such that All internal nodes have either $2$ or $3$ children All paths from root to the leaves have the same length. The number of internal nodes of a $2-3$ tree having $9$ leaves could be $4$ $5$ $6$ $7$
admin asked in DS Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 19 views
GATE1992-02,ix Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Following algorithm(s) can be used to sort $n$ in the range $[1\ldots n^3]$ in $O(n)$ time Heap sort Quick sort Merge sort Radix sort
admin asked in Algorithms Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 18 views
GATE1992-02,xiv Video Solution
Choose the correct alternatives (more than one may be correct ) and write the corresponding letters only: Consider the $SLR(1)$ and $LALR (1)$ parsing tables for a context free grammar. Which of the following statement is/are true? The ... identical in both the tables. The reduce entries in the tables may be different. The error entries in tables may be different
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
18 views
0 votes
0 answers 56 views
GATE1992-02,xvii Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following regular expression identities is/are TRUE? $r^{(^*)} =r^*$ $(r^*s^*)=(r+s)^*$ $(r+s)^* = r^* + s^*$ $r^*s^* = r^*+s^*$
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
56 views
1 vote
0 answers 90 views
GATE1992-02,xiii Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: For a context free grammar, FOLLOW(A) is the set of terminals that can appear immediately to the right of non-terminal $A$ in some " ... FOLLOW(A) and RFOLLOW(A) are always the same. All the three sets are identical. All the three sets are different.
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
90 views
0 votes
0 answers 19 views
GATE1992-02-ii Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: All digital circuits can be realized using only Ex-OR gates Multiplexers Half adders OR gates
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 19 views
GATE1992-03,iii Video Solution
How many edges can there be in a forest with $p$ components having $n$ vertices in all?
admin asked in DS Apr 18, 2020
by admin
585 points
19 views
0 votes
0 answers 20 views
GATE1992-01-i Video Solution
The Boolean function in sum of products form where K-map is given below (figure) is _______
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 27 views
GATE1992-03,ii Video Solution
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
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
27 views
0 votes
0 answers 16 views
GATE1992-16 Video Solution
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.
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 23 views
GATE1992-02,xvi Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following is/are a tautology? $a \vee b \to b \wedge c$ $a \wedge b \to b \vee c$ $a \vee b \to \left(b \to c \right)$ $a \to b \to \left(b \to c \right)$
admin asked in Mathematical Logic Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 22 views
GATE1992-03,iv Video Solution
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.
admin asked in Algorithms Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 25 views
GATE1992-14b Video Solution
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
admin asked in Set Theory & Algebra Apr 18, 2020
by admin
585 points
25 views
0 votes
0 answers 22 views
GATE1992-14a Video Solution
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$.
admin asked in Set Theory & Algebra Apr 18, 2020
by admin
585 points
22 views
0 votes
0 answers 15 views
GATE1992-02,xx Video Solution
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 ... $M_{1}$ and $M_2$, the above statement true.
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
15 views
0 votes
0 answers 20 views
GATE1992-8 Video Solution
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.
admin asked in Algorithms Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 36 views
GATE1992-02,vi Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: Which of the following problems is not $NP$-hard? Hamiltonian circuit problem The $0/1$ Knapsack problem Finding bi-connected components of a graph The graph coloring problem
admin asked in Algorithms Apr 18, 2020
by admin
585 points
36 views
0 votes
0 answers 21 views
GATE1992-09 Video Solution
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.
admin asked in DS Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 37 views
GATE1992-12-a Video Solution
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
admin asked in Operating System Apr 18, 2020
by admin
585 points
37 views
0 votes
0 answers 31 views
GATE1992-07a Video Solution
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)$
admin asked in Algorithms Apr 18, 2020
by admin
585 points
31 views
0 votes
0 answers 31 views
GATE1992-02,xix Video Solution
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (xix) Context-free languages are: closed under union closed under complementation closed under intersection closed under Kleene closure
admin asked in Theory of Computation Apr 18, 2020
by admin
585 points
31 views
0 votes
0 answers 21 views
GATE1992-01,viii Video Solution
The purpose of instruction location counter in an assembler is _______
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 25 views
GATE1992-02-xi Video Solution
02. Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (xi) A computer system has $6$ tape devices, with n processes competing for them. Each process may need $3$ tape drives. The maximum value of n for which the system is guaranteed to be deadlock-free is: $2$ $3$ $4$ $1$
admin asked in Operating System Apr 18, 2020
by admin
585 points
25 views
0 votes
0 answers 16 views
GATE1992-11a Video Solution
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$
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 32 views
GATE1992-01,v Video Solution
A simple and reliable data transfer can be accomplished by using the 'handshake protocol'. It accomplishes reliable data transfer because for every data item sent by the transmitter _____.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
32 views
0 votes
0 answers 23 views
GATE1992-13b Video Solution
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.
admin asked in Databases Apr 18, 2020
by admin
585 points
23 views
0 votes
0 answers 20 views
GATE1992-03,v Video Solution
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.
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
20 views
0 votes
0 answers 21 views
GATE1992-02,v Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (v). Start and stop bits do not contain any 'information' but are used in serial communication Error detection Error correction Synchronization Slowing down the communications
admin asked in Computer Networks Apr 18, 2020
by admin
585 points
21 views
0 votes
0 answers 15 views
GATE1992-02-i Video Solution
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: The operation which is commutative but not associative is: AND OR EX-OR NAND
admin asked in Digital Logic Apr 18, 2020
by admin
585 points
15 views
0 votes
0 answers 24 views
GATE1992-11b Video Solution
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$
admin asked in Compiler Design Apr 18, 2020
by admin
585 points
24 views
0 votes
0 answers 16 views
GATE1992-01-iii Video Solution
Many microprocessors have a specified lower limit on clock frequency (apart from the maximum clock frequency limit) because _____
admin asked in CO & Architecture Apr 18, 2020
by admin
585 points
16 views
0 votes
0 answers 18 views
GATE1992-07b Video Solution
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)$.
admin asked in Algorithms Apr 18, 2020
by admin
585 points
18 views
Page:
Ask a Question
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
Welcome to GATE CSE Doubts, where you can ask questions and receive answers from other members of the community.
Developed by Chun