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 Soumya29
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Soumya29
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
4
answers
1
GATE201818
The chromatic number of the following graph is _____
answer selected
1 day
ago
in
Graph Theory

2.1k
views
graphtheory
graphcoloring
numericalanswers
gate2018
1
answer
2
GATEBOOK2019TOC14
Let $L$ contains set of all strings over $\{a,b\}$ where there are exactly $4$ occurrences of $‘bb’$ substring. Which of the following is true? $L$ is finite and regular $L$ is infinite but regular $L$ is not regular None
commented
1 day
ago
in
Theory of Computation

132
views
gb2019toc1
2
answers
3
GATE20059
The following is the Hasse diagram of the poset $\left[\{a,b,c,d,e\},≺\right]$ The poset is : not a lattice a lattice but not a distributive lattice a distributive lattice but not a Boolean algebra a Boolean algebra
comment edited
2 days
ago
in
Set Theory & Algebra

1.6k
views
gate2005
settheory&algebra
lattice
normal
0
answers
4
Group Theory
I was trying to find the chapter on Group Theory in Kenneth Rosen, but it's not there. Can anyone recommend me the best source for this ?
commented
3 days
ago
in
GATE

24
views
3
answers
5
GATE200855
An LALR(1) parser for a grammar G can have shiftreduce (SR) conflicts if and only if The SLR(1) parser for G has SR conflicts The LR(1) parser for G has SR conflicts The LR(0) parser for G has SR conflicts The LALR(1) parser for G has reducereduce conflicts
commented
4 days
ago
in
Compiler Design

3k
views
gate2008
compilerdesign
parsing
normal
0
answers
6
Binary tree
Consider a binary tree for every node  P  Q  <= 2. P represents number of nodes in left subtree of S and Q represents number of nodes in right subtree of S for h > 0. The minimum number of nodes present in such tree of height h = 4 ( Root at 0 level)
closed
5 days
ago
in
Programming

11
views
datastructure
binarytree
algorithms
madeeasytestseries
4
answers
7
GATE201855
Consider a simple communication system where multiple nodes are connected by a shared broadcast medium (like Ethernet or wireless). The nodes in the system use the following carriersense based medium access protocol. A node that receives a packet to ... that allows $Q$ to successfully avoid a collision between its proposed transmission and $P$'s ongoing transmission is _______.
edited
6 days
ago
in
Computer Networks

4.8k
views
gate2018
computernetworks
congestioncontrol
numericalanswers
2
answers
8
GATE2017149
Consider a RISC machine where each instruction is exactly $4$ bytes long. Conditional and unconditional branch instructions use PCrelative addressing mode with Offset specified in bytes to the target location of the branch instruction. Further the Offset is always with ... Offset If the target of the branch instruction is $i,$ then the decimal value of the Offset is ____________ .
answer edited
Jan 14
in
CO & Architecture

3.5k
views
gate20171
coandarchitecture
normal
numericalanswers
instructionexecution
9
answers
9
GATE200580
The ALU, the bus and all the registers in the data path are of identical size. All operations including incrementation of the PC and the GPRs are to be carried out in the ALU. Two clock cycles are needed for memory read operation  the first one for loading address in ... $2$ $3$ $4$ $5$
comment edited
Jan 14
in
CO & Architecture

4.7k
views
coandarchitecture
normal
gate2005
datapath
machineinstructions
0
answers
10
TESTBOOK FLT3
Que Consider the following statements about the dining philosopher problem. 1. There should be at least 6 chopsticks to avoid deadlock for 6 philosophers. 2. If the asymmetric solution is implemented then $1^{st}$ philosopher picks up her right chopstick first while $6^{th}$ ... Which of the above statement is correct? a. Only 1 b. Only 2 c. Both I and II d. None of the above
commented
Jan 7
in
Operating System

47
views
testbooktestseries
operatingsystem
0
answers
11
Made Easy FLT 4 Q. 56
Que. Unix INode has a block size of $8 \ KB$ and file possible with triple indirect is $128 \ GB$. The number of bits disk block address contain is ____ ? 256 bits ?
asked
Jan 6
in
Operating System

70
views
madeeasytestseries
operatingsystem
0
answers
12
TESTBOOK FLT3
$Que$ The minimum number of states in the $NFA$ for the regular expression $(a + a(b + aa)*b)* a(b + aa)*a$ is ______. Approach ?
commented
Jan 6
in
Theory of Computation

77
views
testbooktestseries
theoryofcomputation
nfa
1
answer
13
TESTBOOK FLT
$Que$ A sender uses a StopandWait protocol for transmission of $8000 \ Kbits$ size frames on a $1Gbps$ satellite channel with a propagation delay of $400 \ ms$. What will be the link utilization (%) if a probability of single frame error is $0.001?$ $\text{Note – Here Frame size is 8000 K bits i.e 8}*10^6 \ bits$
commented
Jan 6
in
Computer Networks

45
views
testbooktestseries
computernetworks
3
answers
14
GATE2004IT60
Choose the correct option to fill the $?1$ and $?2$ so that the program prints an input string in reverse order. Assume that the input string is terminated by a new line character. #include <stdio.h> void wrt_it (void); int main (void) { printf("Enter Text"); printf ("\n") ... \n' $?2$ is $putchar(c);$ $?1$ is $(c = getchar()) ! =$ '\n' $?2$ is $putchar(c);$
commented
Jan 3
in
Programming

869
views
gate2004it
programming
programminginc
normal
1
answer
15
GATE201335
Consider the following relational schema. Students(rollno: integer, sname: string) Courses(courseno: integer, cname: string) Registration(rollno: integer, courseno: integer, percent: real) Which of the following queries are equivalent to this query in English? Find the distinct names of all students ... I, II, III and IV I, II and III only I, II and IV only II, III and IV only
commented
Dec 29, 2018
in
Databases

3.2k
views
gate2013
databases
sql
relationalcalculus
normal
1
answer
16
GATEBOOK2019DM118
Everyone has exactly one best friend Which of the following first order logic statements correctly represents above English statement? $BF(x,y)$ means $x$ and $y$ are best friends $S1 : \forall x \exists y \forall z (BF(x,y) \wedge \sim BF(x,z) \rightarrow (y \neq z))$ ... $S1$ Only $S2$ Both $S1$ and $S2$ None of the two
commented
Dec 27, 2018
in
Mathematical Logic

119
views
gb2019dm1
discretemathematics
mathematicallogic
firstorderlogic
0
answers
17
made easy 2018
The number of positive number which divides either 2700 or 9000 are _________? i am getting 20
commented
Dec 26, 2018
in
Combinatory

105
views
10
answers
18
GATE2007IT24
A depthfirst search is performed on a directed acyclic graph. Let $d[u]$ denote the time at which vertex $u$ is visited for the first time and $f[u]$ the time at which the DFS call to the vertex $u$ terminates. Which of the following statements is always TRUE for all edges $(u, v)$ in the graph ? $d[u] < d[v]$ $d[u] < f[v]$ $f[u] < f[v]$ $f[u] > f[v]$
commented
Dec 25, 2018
in
Algorithms

2.6k
views
gate2007it
algorithms
graphalgorithms
normal
0
answers
19
Self Doubt
L= {a*b*c* – (a^nb^nc^n : n>=0)} Explain whether it is Regular, CFL,DCFL.,CSL
comment edited
Dec 25, 2018
in
Theory of Computation

102
views
1
answer
20
ACE Test Series
commented
Dec 23, 2018
in
Theory of Computation

136
views
1
answer
21
Madeeasy[TOC]
L = { $a^{nm}b^{n}  n,m\geq 1$ } L is DCFL OR L is CFL but not DCFL OR L is not CFL which one is true ?
commented
Dec 23, 2018
in
Theory of Computation

217
views
madeeasytestseries
theoryofcomputation
0
answers
22
B+ Tree _ 40q
Calculate the order of B+ tree internal node and leaf node respectively if the disk block size is 512 Bytes. Assume that block pointer, record pointer and key field are of 7B, 8B, and 10B respectively (A) 30,29 (B) 31,30 (C) 29,28 (D) 32,31
commented
Dec 22, 2018
in
Databases

70
views
2
answers
23
made easy
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
answer selected
Dec 22, 2018
in
Theory of Computation

43
views
madeeasytestseries
1
answer
24
Self Doubt
A 1*0(0+1)* B (0+1)*01* Both RE are not equivalent right ?
commented
Dec 21, 2018
in
Theory of Computation

51
views
0
answers
25
Functional Dependency
Consider a relation R(ABCD) with functional dependency F:{ AD → B, AB → C }. Is AB → C partial or total dependency?
commented
Dec 20, 2018
in
Databases

101
views
databases
0
answers
26
Madeeasytestseries
This program will give lexical error or not? Int main() { Int a = 09; /* Hello world */ } In the solution it is written that this program will give lexical error because integer has been assigned an invalid octal. Is this problem comes under lexical error?
commented
Dec 18, 2018
in
Compiler Design

121
views
0
answers
27
Self doubt Propositional Logic
Que. Consider domain is the set of all people in the world. $F(x,y) =x \text{ is the friend of y}.$ Represent each of the following sentences using firstorder logic statements $1.$ Every person has $at most \ 2$ friends. $2.$ Every person has $exactly \ 2$ ... $3. \forall x \exists y_1\exists y_2(F(x,y_1) \wedge F(x,y_2) \wedge (y_1 \neq y_2))$ Please verify.
commented
Dec 16, 2018
in
Mathematical Logic

74
views
discretemathematics
firstorderlogic
propositionallogic
1
answer
28
Ace Test Series
I think the answer is b) and in their solution also they are saying it b) but in option c) is correct. Can anyone confirm?
commented
Dec 11, 2018
in
Theory of Computation

43
views
2
answers
29
GATE200512, ISRO200964
Let $f(x)$ be the continuous probability density function of a random variable $x$, the probability that $a < x \leq b$, is : $f(ba)$ $f(b)  f(a)$ $\int\limits_a^b f(x) dx$ $\int\limits_a^b xf (x)dx$
commented
Dec 8, 2018
in
Probability

2.3k
views
gate2005
probability
randomvariable
easy
isro2009
2
answers
30
ME Test Series
Two dice are thrown simultaneously. The expected sum of the numbers shown up is?
answer selected
Dec 8, 2018
in
Mathematical Logic

91
views
1
answer
31
GATEBOOK2019DM14
Minesweeper is a singleplayer computer game invented by Robert Donner in 1989. A unary predicate mine is defined, where $\text{mine}(x)$ means that the cell $x$ ... $n$ mines in the game There are at most $n$ mines in the game None of the above
commented
Dec 7, 2018
in
Mathematical Logic

191
views
gb2019dm1
discretemathematics
mathematicallogic
quantifiers
5
answers
32
GATE198710d
Give a regular expression over the alphabet $\{0, 1\}$ to denote the set of proper nonnull substrings of the string $0110$.
commented
Dec 6, 2018
in
Theory of Computation

963
views
gate1987
theoryofcomputation
regularexpressions
3
answers
33
CMI2011A07
Let $G=(V, E)$ be a graph. Define $\bar{G}$ to be $(V, \bar{E})$, where for all $u, \: v \: \in V \: , (u, v) \in \bar{E}$ if and only if $(u, v) \notin E$. Then which of the following is true? $\bar{G}$ is always connected. $\bar{G}$ is connected if $G$ is not connected. At least one of $G$ and $\bar{G}$ connected. $G$ is not connected or $\bar{G}$ is not connected
commented
Dec 6, 2018
in
Graph Theory

513
views
cmi2011
graphtheory
graphconnectivity
0
answers
34
GATEBOOK2019DM19
Which of the following formulas represents the sentence, 'Share prices will go up, and if interest rates go up too, there will be a recession', where ; $p$ means 'share prices will go up' $q$ means 'interest rates will go up' $r$ means 'there will be a recession'. $ p \wedge q \rightarrow r$ $ p \wedge (q \rightarrow r)$ $ p \rightarrow q \wedge r$ $ (p \rightarrow q) \vee r$
commented
Dec 6, 2018
in
Mathematical Logic

120
views
gb2019dm1
discretemathematics
mathematicallogic
propositionallogic
3
answers
35
TIFR2011B23
Suppose $(S_{1}, S_{2},...,S_{m})$ is a finite collection of nonempty subsets of a universe U. Note that the sets in this collection need not to be distinct. Consider the following basic step to be performed on this sequence. While there exist sets $S_{i}$ and ... of a finite universe $U$ and a choice of $S_{i}$ and $S_{j}$ in each step such that the process does not terminate.
commented
Dec 3, 2018
in
Set Theory & Algebra

240
views
tifr2011
settheory&algebra
sets
0
answers
36
Self Doubt Quick Sort
Que  Consider the recursive quicksort algorithm with random pivoting . That is, in each recursive call, a pivot is chosen uniformly at random from the subarray being sorted. When this randomized algorithm is applied to an array of size n all whose elements are distinct, what is the probability ...  $\frac{2}{n}+(\frac{1}{n}*\frac{2}{n1}) = \frac{2}{n1} $ Please verify.
commented
Dec 3, 2018
in
Algorithms

93
views
algorithms
quicksort
2
answers
37
Self doubt SQL
Select Rating From professor P2 Where 5>=(Select count (*) From professor P3 Where P2.Rating <= P3.Rating); Can someone please explain the query?
comment edited
Dec 2, 2018
in
Databases

149
views
sql
1
answer
38
deterministic finite automata
find the DFA which accept strings such that 2nd symbol from RHS is $'a'$ . $w=\{a,b\}^*$
answer selected
Nov 27, 2018
in
Theory of Computation

101
views
theoryofcomputation
finiteautomata
1
answer
39
Made Easy (Question on recursion)
The answer given is 27. I am getting 34. Please verify.
asked
Nov 21, 2018
in
Programming

149
views
programminginc
madeeasytestseries
recursion
1
answer
40
Thrashing
Q. Consider Global Replacement policy is used for page replacement. Which of the following statement is correct  S1  Increase in the degree of multiprogramming beyond a certain point leads to thrashing. S2  Thrashing beyond a certain point leads to ... ready queue decreases. As a result, CPU utilization drops and scheduler tries to increase the degree of multiprogramming even more.
asked
Nov 17, 2018
in
Operating System

107
views
operatingsystem
thrashing
47,139
questions
51,388
answers
178,059
comments
66,699
users