The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
First time here? Checkout the
FAQ
!
x
×
Close
Use the google search bar on side panel. It searches through all previous GATE/other questions. For hardcopy of previous year questions please see
here
Recent activity by Arjun
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Arjun
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
UGCNETJune2019II34
In relational databases, if relation R is in BCNF, then which of the following is true about relation R? R is in 4NF R is not in 1NF R is in 2NF and not in 3NF R is in 2NF and 3NF
answer selected
3 hours
ago
in
Databases

38
views
ugcnetjune2019ii
databasenormalization
1
answer
2
GATE198812i
What are the three axioms of functional dependency for the relational databases given by Armstrong.
answer selected
23 hours
ago
in
Databases

139
views
gate1988
normal
descriptive
databases
functionaldependencies
1
answer
3
GATE19889i
The following program fragment was written in an assembly language for a single address computer with one accumulator register: LOAD B MULT C STORE T1 ADD A STORE T2 MULT T2 ADD T1 STORE Z Give the arithmetic expression implemented by the fragment.
answer selected
23 hours
ago
in
CO and Architecture

103
views
gate1988
normal
descriptive
coandarchitecture
machineinstructions
2
answers
4
GATE200463
Consider the following program segment for a hypothetical CPU having three user registers $R_1, R_2$ and $R_3.$ ... halted after executing the HALT instruction, the return address (in decimal) saved in the stack will be $1007$ $1020$ $1024$ $1028$
answer selected
23 hours
ago
in
CO and Architecture

8.3k
views
gate2004
coandarchitecture
machineinstructions
normal
1
answer
5
GATE19884ii
Using binary full adders and other logic gates (if necessary), design an adder for adding 4bit number (including sign) in 2’s complement notation.
answer selected
1 day
ago
in
Digital Logic

186
views
gate1988
digitallogic
descriptive
adder
8
answers
6
GATE2008IT63
Consider the following three schedules of transactions T1, T2 and T3. [Notation: In the following NYO represents the action Y (R for read, W for write) performed by transaction N on object O.] ... conflict equivalent to each other S2 is conflict equivalent to S3, but not to S1 S1 is conflict equivalent to S2, but not to S3
answer selected
1 day
ago
in
Databases

2.7k
views
gate2008it
databases
transactions
normal
4
answers
7
GATE200668
Consider the relation enrolled (student, course) in which (student, course) is the primary key, and the relation paid (student, amount) where student is the primary key. Assume no null values and no foreign keys or integrity constraints. ... for which Query3 returns strictly fewer rows than Query2 There exist databases for which Query4 will encounter an integrity violation at runtime
commented
1 day
ago
in
Databases

4.6k
views
gate2006
databases
sql
normal
1
answer
8
Self Doubt: Decidability
$L=\left \{< M_{1},M_{2}> \text{such that L}(M_{1})\prec L(M_{2}) \right \}$ is it recursive enumerable? here $L\left ( M_{1} \right )\prec L\left ( M_{2} \right )$ signifies language $L\left ( M_{1} \right )$ is reducible to $L\left ( M_{2} \right )$
commented
2 days
ago
in
Theory of Computation

61
views
theoryofcomputation
turingmachine
decidability
recursiveandrecursivelyenumerablelanguages
3
answers
9
GATE201930
Consider three $4$variable functions $f_1, f_2$, and $f_3$, which are expressed in sumofminterms as $f_1=\Sigma(0,2,5,8,14),$ $f_2=\Sigma(2,3,6,8,14,15),$ $f_3=\Sigma (2,7,11,14)$ For the following circuit with one AND gate and one XOR gate the output function $f$ can be expressed as: $\Sigma(7,8,11)$ $\Sigma (2,7,8,11,14)$ $\Sigma (2,14)$ $\Sigma (0,2,3,5,6,7,8,11,14,15)$
answer selected
2 days
ago
in
Digital Logic

2.2k
views
gate2019
digitallogic
kmap
digitalcircuits
9
answers
10
GATE199827
Consider the following relational database schemes: COURSES (Cno, Name) PRE_REQ(Cno, Pre_Cno) COMPLETED (Student_no, Cno) COURSES gives the number and name of all the available courses. PRE_REQ gives the information about which courses are prerequisites for ... using relational algebra: List all the courses for which a student with Student_no 2310 has completed all the prerequisites.
answer reshown
3 days
ago
in
Databases

2k
views
gate1998
databases
relationalalgebra
normal
0
answers
11
GOCompiler1: Parsing11
Which of the following is TRUE regarding the running time of a LR(1) parser? It runs in linear time for all inputs It runs in polynomial time but not necessarily $O(n^3)$ for all inputs For some inputs it may take exponential time It runs in $O(n^3)$ but not always $O(n^2)$
commented
4 days
ago
in
Compiler Design

95
views
go2019cd1
3
answers
12
GATE199773
A concurrent system consists of $3$ processes using a shared resource $R$ in a nonpreemptible and mutually exclusive manner. The processes have unique priorities in the range $1 \dots 3$, $3$ being the highest priority. It is required to synchronize the processes ... ]:=true; else begin V(proceed [priority]); busy:=true; end V(mutex) Give the pseudo code for the procedure release_R.
answered
4 days
ago
in
Operating System

409
views
gate1997
operatingsystem
processsynchronization
1
answer
13
GATE19889iii
In the program scheme given below indicate the instructions containing any operand needing relocation for position independent behaviour. Justify your answer. ...
answered
4 days
ago
in
CO and Architecture

120
views
gate1988
normal
descriptive
coandarchitecture
addressingmodes
3
answers
14
GATE2005IT62
Two shared resources $R_1$ and $R_2$ are used by processes $P_1$ and $P_2$. Each process has a certain priority for accessing each resource. Let $T_{ij}$ denote the priority of $P_i$ for accessing $R_j$. A process $P_i$ can snatch a resource $R_k$ from process $P_j$ ... ensures that $P_1$ and $P_2$ can never deadlock? (I) and (IV) (II) and (III) (I) and (II) None of the above
answer edited
4 days
ago
in
Operating System

2.1k
views
gate2005it
operatingsystem
resourceallocation
normal
4
answers
15
GATE201226
Which of the following graphs is isomorphic to
commented
4 days
ago
in
Graph Theory

2.1k
views
gate2012
graphtheory
graphisomorphism
normal
nongate
1
answer
16
GATE19908b
State the Booth's algorithm for multiplication of two numbers. Draw a block diagram for the implementation of the Booth's algorithm for determining the product of two 8bit signed numbers.
answer selected
4 days
ago
in
Digital Logic

234
views
gate1990
descriptive
digitallogic
boothsalgorithm
2
answers
17
GATE19936.2
If the state machine described in figure should have a stable state, the restriction on the inputs is given by $a.b=1$ $a+b=1$ $\bar{a} + \bar{b} =0$ $\overline{a.b}=1$ $\overline{a+b} =1$
answered
4 days
ago
in
Digital Logic

1.5k
views
gate1993
digitallogic
normal
circuitoutput
1
answer
18
GATE199621
The concurrent programming constructs fork and join are as below: Fork <label> which creates a new process executing from the specified label Join <variable> which decrements the specified synchronization variable (by $1$) and terminates the process if the new value is not $0$. Show the ... join $N$ $S3$ $L2$ : join $M$ $S5$ $L3:S2$ Goto $L1$ $L4:S4$ Goto $L2$ Next:
answer edited
4 days
ago
in
Operating System

2k
views
gate1996
operatingsystem
processsynchronization
normal
4
answers
19
GATE2014133
Assume that there are $3$ page frames which are initially empty. If the page reference string is $\text{1, 2, 3, 4, 2, 1, 5, 3, 2, 4, 6}$ the number of page faults using the optimal replacement policy is__________.
answered
4 days
ago
in
Operating System

1.4k
views
gate20141
operatingsystem
pagereplacement
numericalanswers
4
answers
20
GATE198811
A number of processes could be in a deadlock state if none of them can execute due to nonavailability of sufficient resources. Let $P_i, 0 \leq i \leq 4$ represent five processes and let there be four resources types $r_j, 0 \leq j \leq 3$. Suppose the following data ... Is the system currently in a safe state? If yes, explain why.
answered
4 days
ago
in
Operating System

556
views
gate1988
normal
descriptive
operatingsystem
resourceallocation
1
answer
21
GATE199517a
An asynchronous serial communication controller that uses a startstop scheme for controlling the serial I/O of a system is programmed for a string of length seven bits, one parity bit (odd parity) and one stop bit. The transmission rate is $1200$ bits/ ... What is the complete bit stream that is transmitted for the string 0110101'? How many such string can be transmitted per second?
answer selected
5 days
ago
in
Computer Networks

561
views
gate1995
serialcommunication
normal
descriptive
0
answers
22
GATE199517b
Consider a CRT display that has a text mode display format of $80×25$ characters with a $9×12$ character cell. What is the size of the video buffer RAM for the display to be used in monochrome (1 bit per pixel) graphics mode
asked
5 days
ago
in
Computer Peripherals

14
views
gate1995
nongate
computerperipherals
descriptive
1
answer
23
GATE199624b
Consider the synchronous sequential circuit in the below figure Given that the initial state of the circuit is S$_4$, identify the set of states, which are not reachable.
answer selected
5 days
ago
in
Digital Logic

450
views
gate1996
normal
digitallogic
circuitoutput
1
answer
24
GATE199772
Following floating point number format is given $f$ is a fraction represented by a $6bit$ mantissa (includes sign bit) in sign magnitude form, $e$ is a $4bit$ exponent (includes sign hit) in sign magnitude form and $n=(f, e) = f. 2^e$ is a ... point addition of $A$ and $B.$ What is the percentage error (up to one position beyond decimal point) in the addition operation in (b)?
answered
5 days
ago
in
Digital Logic

380
views
gate1997
digitallogic
floatingpointrepresentation
normal
5
answers
25
GATE2014245
The value of a $\text{float}$ type variable is represented using the singleprecision $\text{32bit}$ floating point format of $IEEE754$ standard that uses $1$ $\text{bit}$ for sign, $\text{8 bits}$ ... is assigned the decimal value of $−14.25$. The representation of $X$ in hexadecimal notation is $C1640000H$ $416C0000H$ $41640000H$ $C16C0000H$
answered
6 days
ago
in
Digital Logic

2.5k
views
gate20142
digitallogic
numberrepresentation
normal
ieeerepresentation
2
answers
26
GATE19883ab
The Karnaugh map of a function of (A, B, C) is shown on the left hand side of the above figure. The reduced form of the same map is shown on the right hand side, in which the variable C is entered in the map itself. Discuss, The methodology by ... the reduced map has been derived and the rules (or steps) by which the boolean function can be derived from the entries in the reduced map.
answered
6 days
ago
in
Digital Logic

199
views
gate1988
descriptive
digitallogic
kmap
6
answers
27
GATE2008IT41
Assume that a main memory with only $4$ pages, each of $16$ bytes, is initially empty. The CPU generates the following sequence of virtual addresses and uses the Least Recently Used (LRU) page replacement policy. $\text{0, 4, 8, 20, 24, 36, 44, 12, 68, 72, 80, 84, 28, 32, 88, 92}$ How many page faults ... $1, 2, 3, 4$ $7$ and $1, 2, 4, 5$ $8$ and $1, 2, 4, 5$ $9$ and $1, 2, 3, 5$
answer edited
Jul 12
in
Operating System

5.5k
views
gate2008it
operatingsystem
pagereplacement
normal
2
answers
28
GATE201934
Consider the following sets: S1: Set of all recursively enumerable languages over the alphabet $\{0, 1\}$ S2: Set of all syntactically valid C programs S3: Set of all languages over the alphabet $\{0,1\}$ S4: Set of all nonregular languages over the alphabet $\{ 0,1 \}$ Which of the above sets are uncountable? S1 and S2 S3 and S4 S2 and S3 S1 and S4
commented
Jul 9
in
Theory of Computation

2k
views
gate2019
theoryofcomputation
countableuncountableset
1
answer
29
L = { 0n+m 1n+m 0m  n, m >= 0 } CSL or RE?
L = { 0n+m 1n+m 0m  n, m >= 0 } The above language is (a) CFL but not Regular (b) CSL but not CFL (c) RE but not CSL (d) None of the above I thought the answer would be (b) CSL but not CFL but it was given as (c) RE but not CSL Can anyone explain how?
commented
Jul 9
in
Theory of Computation

613
views
theoryofcomputation
contextsensitivelanguages
contextsensitive
recursiveandrecursivelyenumerablelanguages
2
answers
30
UGCNETJune2019II1
Consider the poset $( \{3,5,9,15,24,45 \}, )$ Which of the following is correct for the given poset ? There exist a greatest element and a least element There exist a greatest element but not a least element There exist a least element but not a greatest element There does not exist a greatest element and a least element
answer selected
Jul 8
in
Set Theory & Algebra

165
views
ugcnetjune2019ii
poset
settheory&algebra
3
answers
31
Find address of element in 3d array
A is an array $[2.....6, 2.....8, 2.......10]$ of elements. The starting location is $500$. The location of an element $A(5, 5, 5)$ using column major order is __________.
commented
Jul 7
in
DS

9k
views
datastructure
arrays
algorithms
1
answer
32
GATE19894ii
Provide short answers to the following questions: Compute the postfix equivalent of the following infix arithmetic expression $a + b * c + d * e ↑ f$ where $↑$ represents exponentiation. Assume normal operator precedences.
answer edited
Jul 7
in
Compiler Design

170
views
gate1989
descriptive
compilerdesign
infixpostfix
intermediatecode
2
answers
33
GATE198810ia
Consider the following grammar: $S \rightarrow S$ $S \rightarrow SS \mid a \mid \epsilon$ Construct the collection of sets of LR (0) items for this grammar and draw its goto graph.
answer selected
Jul 7
in
Compiler Design

322
views
gate1988
descriptive
grammar
parsing
10
answers
34
GATE200361
In a permutation \(a_1 ... a_n\), of n distinct integers, an inversion is a pair \((a_i, a_j)\) such that \(i < j\) and \(a_i > a_j\). If all permutations are equally likely, what is the expected number of inversions in a randomly chosen permutation of \(1. . . n\)? \(\frac{n(n1)}{2}\) \(\frac{n(n1)}{4}\) \(\frac{n(n+1)}{4}\) \(2n[\log_2n]\)
answered
Jul 6
in
Algorithms

4.5k
views
gate2003
algorithms
sorting
normal
0
answers
35
GATE198910b
Consider the following grammar for variable declarations: <vardecl> $\rightarrow$ <vardecl><idlist> : <type>; <vardecl> $\rightarrow \in$ <idlist> $\rightarrow$ ... wherever necessary. Make suitable assumptions regarding procedures operating on the symbol table; you need not elaborate upon these procedures.
edited
Jul 6
in
Compiler Design

204
views
descriptive
gate1989
compilerdesign
syntaxdirectedtranslation
unsolved
1
answer
36
GATE199325
A simple Pascal like language has only three statements. assignment statement e.g. x:=expression loop construct e.g. for i:=expression to expression do statement sequencing e.g. begin statement ;…; statement end Write a contextfree grammar (CFG) for statements in the ... in CFG. Show the parse tree for the following statements: for j:=2 to 10 do begin x:=expr1; y:=expr2; end
answered
Jul 6
in
Compiler Design

322
views
gate1993
compilerdesign
parsing
normal
2
answers
37
GATE199011a
What does the following program output? program module (input, output); var a:array [1...5] of integer; i, j: integer; procedure unknown (var b: integer, var c: integer); var i:integer; begin for i := 1 to 5 do a[i] := i; b:= 0; c := 0 for i := 1 to 5 do write (a[i]); writeln(); a[3 ... b); b := 5; c := 6; end; begin i:=1; j:=3; unknown (a[i], a[j]); for i:=1 to 5 do write (a[i]); end;
answered
Jul 6
in
Compiler Design

256
views
gate1990
descriptive
compilerdesign
runtimeenvironments
parameterpassing
2
answers
38
GATE19898a
What is the output produced by the following program, when the input is "HTGATE" Function what (s:string): string; var n:integer; begin n = s.length if n <= 1 then what := s else what :=contact (what (substring (s, 2, n)), s.C [1]) end; Note type string= ... $s_{2}$  length obtained by concatenating $s_{1}$ with $s_{2}$ such that $s_{1}$ precedes $s_{2}$.
edited
Jul 6
in
Algorithms

167
views
gate1989
descriptive
algorithms
identifyfunction
1
answer
39
UGCNETJune2019I10
Which of the following is a plagiarism checking website? http://go.turtnitin.com http://researchgate.com http://www.editorial.elsevier.com http://grammarly.com
answer selected
Jul 6
in
Others

17
views
ugcnetjune2019i
generalawareness
1
answer
40
TIFR2012B20
This question concerns the classes $P$ and $NP.$ If you are familiar with them, you may skip the definitions and go directly to the question. Let $L$ be a set. We say that $L$ is in $P$ if there is some algorithm which given input $x$ decides if $x$ is in $L$ ... $\text{MATCH} \notin P\text{ and } \overline{\text{MATCH}} \notin P$ none of the above
answered
Jul 6
in
Algorithms

216
views
tifr2012
algorithms
pnpnpcnph
49,807
questions
54,506
answers
188,319
comments
74,944
users