The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
GATE Overflow
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 Dharmendra Lodhi
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Dharmendra Lodhi
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
3
answers
1
GATE201943
Consider the augmented grammar given below: $S’ \rightarrow S$ $S \rightarrow \langle L \rangle \mid id$ $L \rightarrow L, S \mid S$ Let $I_0 = \text{CLOSURE} (\{[S’ \rightarrow \cdot S ]\})$ The number of items in the set $\text{GOTO} (I_0, \langle \: )$ is______
comment edited
Feb 7
in
Compiler Design

2.1k
views
gate2019
numericalanswers
compilerdesign
grammar
2
answers
2
GATE201923
Consider three concurrent processes $P1$, $P2$ and $P3$ as shown below, which access a shared variable D that has been initialized to $100$ ... maximum possible values of $D$ after the three processes have completed execution are $X$ and $Y$ respectively, then the value of $YX$ is ____
commented
Feb 7
in
Operating System

2.5k
views
gate2019
numericalanswers
operatingsystem
processsynchronization
2
answers
3
GATE201918
Consider the following C program : #include<stdio.h> int jumble(int x, int y){ x = 2*x+y; return x; } int main(){ int x=2, y=5; y=jumble(y,x); x=jumble(y,x); printf("%d \n",x); return 0; } The value printed by the program is ______________.
commented
Feb 7
in
Programming

1.9k
views
gate2019
numericalanswers
programminginc
1
answer
4
GATE20193
Which one of the following kinds of derivation is used by LR parsers? Leftmost Leftmost in reverse Rightmost Rightmost in reverse
commented
Feb 7
in
Compiler Design

1.9k
views
gate2019
compilerdesign
parsing
2
answers
5
In sorting algo which has a running time that is least dependent on initial ordering of inputs
commented
Jan 28
in
Algorithms

1.9k
views
2
answers
6
GATEBOOK2019LA118
If $E=\begin{bmatrix} 1 & 2 & 1 & 0 \\ 3 & 4 & 0 & 1 \\ 1 & 0 & 0 & 0 \\ 0 & 1 & 0 & 0 \end{bmatrix}$ then $E^{1}$ ...
commented
Jan 1
in
Linear Algebra

153
views
gb2019la1
1
answer
7
ACE TEST SERIES QUESTION
answered
Dec 29, 2018
in
Set Theory & Algebra

37
views
1
answer
8
grade up
Assuming that a pointer take 4 bytes and the size of an integer is 2 bytes. What is the size of the *a in declaration: int (*a) [10][2] ? 4 80 20 40
commented
Dec 26, 2018
in
Programming

99
views
4
answers
9
GATE200530
Let r be a relation instance with schema R = (A, B, C, D). We define $r_1 = \pi_{A, B, C} (R)$ and $r_2=\pi_{A, D} (r)$. Let $s =r_1 \: * \: r_2$ where $*$ denotes natural join. Given that the decomposition of $r$ into $r_1$ and $r_2$ is lossy, which one of the following is TRUE? $s \subset r$ $r \cup s =r$ $r \subset s$ $r^*s=s$
commented
Dec 2, 2018
in
Databases

2.7k
views
gate2005
databases
relationalalgebra
naturaljoin
normal
4
answers
10
GATE2014130
Given the following two statements: S1: Every table with two singlevalued attributes is in 1NF, 2NF, 3NF and BCNF. S2: $AB \to C$, $D \to E$, $E \to C$ is a minimal cover for the set of functional dependencies $AB \to C$, $D \to E$, $AB \to E$ ... the following is CORRECT? S1 is TRUE and S2 is FALSE. Both S1 and S2 are TRUE. S1 is FALSE and S2 is TRUE. Both S1 and S2 are FALSE.
commented
Dec 1, 2018
in
Databases

2.8k
views
gate20141
databases
databasenormalization
normal
4
answers
11
GATE199810a
Prove by induction that the expression for the number of diagonals in a polygon of $n$ sides is $\frac{n(n3)}{2}$
commented
Nov 5, 2018
in
Set Theory & Algebra

1.1k
views
gate1998
settheory&algebra
descriptive
relations
1
answer
12
ISI2004MIII11
If $\alpha 1,\alpha 2,\dots,\alpha n$ are the positive numbers then $\frac{a1}{a2}+\frac{a2}{a3}+\dots+\frac{an1}{an}+\frac{an}{a1}$ is always $\geq n$ $\leq n$ $\leq n^{\frac{1}{2}}$ None of the above
commented
Nov 4, 2018
in
Set Theory & Algebra

259
views
isi2004
settheory&algebra
numbertheory
2
answers
13
GATE20004
Let $S= \{0, 1, 2, 3, 4, 5, 6, 7\}$ and $⊗$ denote multiplication modulo $8,$ that is, $x ⊗ y= (xy) \mod 8$ Prove that $( \{ 0, 1\}, ⊗)$ is not a group. Write three distinct groups $(G, ⊗)$ where $G ⊂ S$ and $G$ has $2$ elements.
answered
Nov 4, 2018
in
Set Theory & Algebra

765
views
gate2000
settheory&algebra
descriptive
groups
1
answer
14
self doubt
The uPC is not incremented in the following cases : (i)When an end microinstruction is encountered. (ii)When a new instruction is loaded into IR(instruction register) (iii)When a branch microinstruction is encountered and branch condition is satisfied. Someone, please explain the last point. I didn't get why it will not be incremented. These statements are from the standard book
answered
Nov 4, 2018
in
CO & Architecture

15
views
2
answers
15
GATE199214b
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
answered
Nov 4, 2018
in
Set Theory & Algebra

842
views
gate1992
settheory&algebra
groups
normal
2
answers
16
GATE200540
Let $P, Q$ and $R$ be three atomic propositional assertions. Let $X$ denote $( P ∨ Q ) → R$ and Y denote $(P → R) ∨ (Q → R).$ Which one of the following is a tautology? $X ≡ Y$ $X → Y$ $Y → X$ $¬Y → X$
commented
Nov 2, 2018
in
Mathematical Logic

1.5k
views
gate2005
mathematicallogic
propositionallogic
normal
3
answers
17
TIFR2017B11
Given that $B(x)$ means "$x$ is a bat", $F(x)$ means "$x$ is a fly", and $E(x, y)$ means "x eats $y$", what is the best English translation of $ \forall x(F(x) \rightarrow \forall y (E(y, x) \rightarrow B(y)))?$ all flies eat bats every fly is eaten by some bat bats eat only flies every bat eats flies only bats eat flies
answered
Nov 1, 2018
in
Mathematical Logic

753
views
tifr2017
firstorderlogic
2
answers
18
Permutations, TIFR2011B30
What does it mean when they say "An array A[1...n] consists of a permutation of numbers 1....n.".? Also I'd be grateful if you give some example.
answered
Nov 1, 2018
in
Numerical Ability

70
views
datastructure
permutationsandcombinations
arrays
usertifr2011
usermod
generalaptitude
2
answers
19
CMI2013B02
A complete graph on $n$ vertices is an undirected graph in which every pair of distinct vertices is connected by an edge. A simple path in a graph is one in which no vertex is repeated. Let $G$ be a complete graph on 10 vertices. Let $u, \: v, \: w$ be three distinct vertices in $G$. How many simple paths are there from $u$ to $v$ going through $w$?
answered
Oct 27, 2018
in
Graph Theory

480
views
cmi2013
descriptive
graphtheory
counting
1
answer
20
TANCET 2016 DEADLOCK
answered
Oct 25, 2018
in
Operating System

30
views
tancet
0
answers
21
valid or Invalid
$ \forall x (P(x) \rightarrow Q(x)) \rightarrow [\exists P(x)] \rightarrow [\forall Q(x)]$ how to check that a statement is valid or invalid ?
commented
Oct 24, 2018
in
Mathematical Logic

66
views
0
answers
22
GateForum Test Series: Databases  Sql
The answer should be D, but C is provided as the answer.
commented
Oct 24, 2018
in
Databases

70
views
gateforumtestseries
databases
sql
1
answer
23
TANCET 2016 Interrupt
answered
Oct 23, 2018
in
CO & Architecture

15
views
tancet
1
answer
24
Indexing
commented
Oct 23, 2018
in
Databases

538
views
databases
indexing
1
answer
25
which one is right. Also pleasse explain in few words.
. Consider an implementation of unsorted circular linked list. Suppose it has its representation with a head pointer only. Given the representation, which of the following operation can be implemented in O(1) time? Insertion at the front of the linked list Insertion at ... linked list (a) I and II (b) I and III (c) I, II, III and IV (d) None
commented
Oct 22, 2018
in
DS

146
views
3
answers
26
Consider the following statement about indexes
Consider the following statement (i) Primary index is always sparse (ii) Secondary index may or may not be dense Which of the above statement is/are false? A)Only (i) B)Only (ii) C)Both (i) and (ii) D)None of these
commented
Oct 21, 2018
in
Databases

1.3k
views
databases
indexing
0
answers
27
self_doubt
A processor uses 36 bit physical address and 32 bit virtual addresses, with a page frame size of 4 Kbytes. Each page table entry is of size 4 bytes. A three level page table is used for virtual to physical address translation, where the virtual ... table entry of the first, second and third level page tables are respectively. modified from : https://gateoverflow.in/490/gate200867
commented
Oct 21, 2018
in
Operating System

163
views
virtualmemory
operatingsystem
1
answer
28
selfdoubt
can anyone explain how TLB is organized when it is used as Direct mapped and setassosiative or suggest any resource to read ? https://gateoverflow.in/1840/gate200662isro201650
asked
Oct 20, 2018
in
Operating System

21
views
1
answer
29
GATE200662, ISRO201650
A CPU generates $32$bit virtual addresses. The page size is $4$ KB. The processor has a translation lookaside buffer (TLB) which can hold a total of $128$ page table entries and is $4$way set associative. The minimum size of the TLB tag is: $\text{11 bits}$ $\text{13 bits}$ $\text{15 bits}$ $\text{20 bits}$
commented
Oct 20, 2018
in
Operating System

7.5k
views
gate2006
operatingsystem
virtualmemory
normal
isro2016
0
answers
30
Galvin #page fault service time #memory management #disk access
comment edited
Oct 19, 2018
in
Operating System

124
views
pagefault
operatingsystem
effectivememoryaccess
pagereplacement
page
0
answers
31
#OS Fork () tell the O/P?
A process executes the following segment of code : for(i = 1; i <= n; i++) fork (); fork (); The number of new processes created is
commented
Oct 19, 2018
in
Operating System

147
views
fork
operatingsystem
1
answer
32
#virtualgate
they have given b as the answer...i think answer is d....plz check!
commented
Oct 19, 2018
in
Theory of Computation

56
views
3
answers
33
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
answered
Oct 18, 2018
in
Operating System

1.9k
views
gate2005it
operatingsystem
resourceallocation
normal
4
answers
34
GATE198911a
A system of four concurrent processes, $P, Q, R$ and $S$, use shared resources $A, B$ and $C$. The sequences in which processes, $P, Q, R$ and $S$ request and release resources are as follows: Process P: 1. P requests A ... . What strategies can be used to prevent deadlocks in a system of concurrent processes using shared resources if preemption of granted resources is not allowed?
answered
Oct 18, 2018
in
Operating System

530
views
descriptive
gate1989
operatingsystem
resourceallocation
3
answers
35
GATE2006IT55
Consider the solution to the bounded buffer producer/consumer problem by using general semaphores $S, F,$ and $E$. The semaphore $S$ is the mutual exclusion semaphore initialized to $1$. The semaphore $F$ ... and Signal $(F)$ in the Consumer process (I) only (II) only Neither (I) nor (II) Both (I) and (II)
commented
Oct 16, 2018
in
Operating System

2.8k
views
gate2006it
operatingsystem
processsynchronization
normal
2
answers
36
Fragmentation
Consider a TCP message that contains 1024 bytes of data and 20 bytes of TCP header is passed to IP for delivery across two networks interconnected by a router (i.e., it travels from the source host to a router to the destination host). The first network has ... the IP layer at the destination for TCP message, in the best case is _________ bytes. (Assume all IP headers are 20 bytes)
answered
Oct 16, 2018
in
Computer Networks

129
views
fragmentation
computernetworks
0
answers
37
digital logic full adder
Q:min number of NAND gate required to realize Full Adder circuit? (NAND gate is 2 input NAND gate) A7 B8 C9 D10
commented
Oct 16, 2018
in
Digital Logic

33
views
1
answer
38
What is the state of the process when it has multiple threads ?
When we have a multiple threads in a system which may be have different states like running , blocked ,ready then can we define the overall state of the process ? Because we will have PCB corresponding to a process so what will be the state of the process in it ? I am taking into consideration multiprocessor system .
commented
Oct 16, 2018
in
Operating System

27
views
operatingsystem
0
answers
39
Process state
A printf or malloc takes the process to what state? Running Ready Suspended Terminated
commented
Oct 16, 2018
in
CO & Architecture

15
views
5
answers
40
GATE200381
Suppose we want to synchronize two concurrent processes $P$ and $Q$ using binary semaphores $S$ and $T$. The code for the processes $P$ and $Q$ is shown below. Process P: Process Q: while(1) { while(1) { W: Y: print '0'; print '1'; print '0'; print '1'; X: Z: } } Synchronization statements ... $1$ $V(S)$ at $W, V(T)$ at $X, P(S)$ at $Y, P(T)$ at $Z, S$ and $T$ initially $1$
commented
Oct 16, 2018
in
Operating System

2.9k
views
gate2003
operatingsystem
processsynchronization
normal
48,515
questions
52,763
answers
183,377
comments
68,234
users