GATE CSE
For all GATE CSE Questions
Toggle navigation
GATE Overflow
Facebook Login
Google Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
All Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Previous
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.
Recent activity by kunal chalotra
User kunal chalotra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User kunal chalotra
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
UGCNETDec2015III63
Consider the following three tables R, S and T. In this question, all the join operations are natural joins ($\bowtie$). ($\pi$) is the projection operation of a relation: Possible answer tables for this question are also given as below: (a) (b) (c) (d)
answer selected
Mar 19
in
Others

127
views
ugcnetdec2015iii
4
answers
2
GATE2017110
Consider the following contextfree grammar over the alphabet $\sum$ = {$a,b,c$} with $S$ as the start symbol: $S$ $\rightarrow$ $abScT$  $abcT$ $T$ $\rightarrow$ $bT$  $b$ Which one of the following represents the language generated by the above grammar? (A) {$\left ( ab \ ... (D) {$\left ( ab \right )^{n}\left ( cb^{n} \right )^{m}$  $m,n$ $\geq$ 1 }
commented
Feb 15
in
Theory of Computation

1.1k
views
gate20171
theoryofcomputation
contextfree
normal
6
answers
3
GATE201716
Let $T$ be a binary search tree with 15 nodes. The minimum and maximum possible heights of $T$ are: Note: The height of a tree with a single node is 0. (A) 4 and 15 respectively. (B) 3 and 14 respectively. (C) 4 and 14 respectively. (D) 3 and 15 respectively.
answer selected
Feb 15
in
DS

507
views
gate20171
datastructure
binarysearchtree
easy
3
answers
4
GATE2017240
Consider the following languages. $L_1 = \{a^p \mid p \text{ is a prime number} \}$ $L_2 = \{ a^nb^mc^{2m} \mid n \geq 0, m \geq 0 \}$ $L_3 = \{a^n b^n c^{2n} \mid n \geq 0 \}$ $L_4 = \{ a^n b^n \ ... not context free $L_3$ is not context free but recursive $L_4$ is deterministic context free I, II and IV only II and III only I and IV only III and IV only
answer selected
Feb 14
in
Theory of Computation

868
views
gate20172
theoryofcomputation
3
answers
5
GATE2017120
Let $T$ be a tree with 10 vertices. The sum of the degrees of all the vertices in $T$ is ________
answer selected
Feb 13
in
DS

700
views
gate20171
datastructure
trees
numericalanswers
1
answer
6
SQL query
how is q1 right it only shows sid for students with rank less than everyone
commented
Feb 6
in
Databases

526
views
databases
sql
2
answers
7
Subnet maskNID
For a class C network if IP address of a computer is 200.99.39.112 and subnet mask is 255.255.255.224 the decimal value of last octet of last host of sixth subnet is ? shouldn't it be 190 but the answer given is 222? anyone help
answer selected
Feb 6
in
Computer Networks

110
views
computernetworks
networkaddressing
subnetting
1
answer
8
Probability
What is conditional probability that a family with 2 children has 2 boys, given they have atleast 1 boy? Why do we take total cases as 4 { GB, BB, BG, GG}? Shouldn't we consider GB AND BG same only.
answer selected
Feb 2
in
Verbal Ability

38
views
1
answer
9
CFL Automata
A = {w t wr w, t ∈ {0, 1} and t=5} is this a CFL? My Analysis if t=5 were not mentioned it would have been a Regular language.But for the given question above,I could construct only NPDA.Thus the laguage I believe is not DCFL . Is this the correct answer?
answer selected
Feb 2
in
Theory of Computation

35
views
1
answer
10
Euler Path
Which of the following Graph has Euler Path but is not an Euler Graph? A. K1,1 B.K2,10 C.K2,11 D.K10,11.
commented
Feb 1
in
Graph Theory

68
views
graphtheory
eulergraph
eulerpath
2
answers
11
MADEEASY
S: R1(A), R3(D), W1(B), R2(B), R4(B), W2(C), R5(C), W4(E), R5(E), W5(B) Number of serial schedules which are view equal to above S are __. Polygraph that I drew:
commented
Jan 31
in
Databases

212
views
databases
madeeasytestseries
view_serializable
2
answers
12
file system
In particular unix OS each data block is of size 1024 bytes each node has 10 direct data blocks and 2additional addresses one for single indirect block and one for double indirect block. Each block is addressed with 64 byte. The maximum possible size of file in the file system (in KB) is ? My answer:282 answer given 256.? anyone help.
commented
Jan 29
in
Operating System

49
views
operatingsystem
filesystem
inode
2
answers
13
UGCNETDEC2016III23
Given the following two languages: $L_1 = \{a^n b^n \mid n \geq 0, \: n \neq 100\}$ $L_2 = \{ w \in \{a, b, c\}^* \mid n_a(w) = n_b (w) = n_c(w) \}$ Which of the following options ... $L_2$ are context free language $L_1$ is context free language, $L_2$ is not context free language $L_1$ is not context free language, $L_2$ is context free language
commented
Jan 28
in
Others

43
views
ugcnetdec2016iii
1
answer
14
made easy os check once
asked
Jan 28
in
Operating System

34
views
madeeasy_testseries
operatingsystem
2
answers
15
PTE paging
consider a paging system with 48bit virtual address space.Each address defers to a byte in memory.suppose the size of page is 16KB and the main memory size is 16GB.The minimum size of page table with each entry need 2 protection bits is _____ (in GB) ... i round it to 3bytes and make answer as 48GB or shuld i keep it as it is and write the answer as 44GB?
answered
Jan 28
in
Operating System

109
views
operatingsystem
paging
0
answers
16
#Testbook 3 Qno.26
#plz check i think 2nd property hold in reverse way??
commented
Jan 27
in
Set Theory & Algebra

20
views
testseries
1
answer
17
addressing format
Consider a hypothetical system which has 32 bit instructions and 8 bit addresses. If there are 90 2address instructions and 200 one address instructions, then how many zero address instructions can be formulated? A) 216 – 90 × 28 B) ( 216 – 90 × 28 – 200) × 28 C) ((216 – 90) × 28 – 200) × 28 D) (216 – 90) × 28 – 200 × 28
answered
Jan 27
in
CO & Architecture

19
views
3
answers
18
how many view equivalent serial schedules are possible
commented
Jan 27
in
Databases

476
views
transactions
0
answers
19
dbms ..
just expalin about view serilizable
asked
Jan 26
in
Databases

23
views
databases
dbms
testbook
0
answers
20
madeeasy_DBMS
......
closed
Jan 26
in
Databases

15
views
1
answer
21
toc  doubt
how (i) is true???
asked
Jan 25
in
Theory of Computation

74
views
theoryofcomputation
1
answer
22
Madeeasy
commented
Jan 25
in
Theory of Computation

42
views
madeeasytestseries
theoryofcomputation
2
answers
23
Cryptography
total number of keys saved for a set of 10 individuals to be able to communicate with each other using public key compared to of secret key crypto systems are
answered
Jan 25
in
CO & Architecture

42
views
2
answers
24
testbook
payload value should be divided by here they take 505 it should be 504 so it become 504/8=63??
commented
Jan 25
in
Programming

27
views
testseries
testbook
1
answer
25
testbook compiler
commented
Jan 25
in
Compiler Design

66
views
testbook
testseries
compilerdesign
1
answer
26
compiler first follow
answer selected
Jan 25
in
Compiler Design

70
views
testbooktestseries
compilerdesign
1
answer
27
made easy cbt
answer selected
Jan 24
in
CO & Architecture

73
views
0
answers
28
Made Easy
commented
Jan 24
in
Theory of Computation

44
views
madeeasy
madeeasy_testseries
theoryofcomputation
1
answer
29
testbook
no of strings upto length 3 on alphabet ∑={a,b,c,d} are (including string of zero length )??
commented
Jan 24
in
Combinatory

55
views
testbook
1
answer
30
minmax algo
The minimum number of comparisons required to find the minimum and maximum of 60 numbers is____
answer selected
Jan 24
in
Algorithms

87
views
3
answers
31
Ace test Series
Which of the following is CSL?
commented
Jan 23
in
Theory of Computation

113
views
acetestseries
theoryofcomputation
1
answer
32
Gate Practice
L1 = {a^nb^nC^n  n>=0} L2 = {a^nb^mc^k  k=m+n , n,m>=0} L1.(L2)* = ??
commented
Jan 23
in
Theory of Computation

55
views
theoryofcomputation
0
answers
33
Testbook
Can anyone clarify hy they are getting 269 and and I am getting 258?
commented
Jan 23
in
DS

147
views
merging
1
answer
34
Made EasyCBT2017Q13
commented
Jan 23
in
CO & Architecture

174
views
madeeasy
cbt2017
0
answers
35
cn MTU
my doubt when packet get fragmented from first router than reassembly should take place or each individual packet have to be fragment again in the second router MTU??
commented
Jan 23
in
Computer Networks

37
views
computernetworks
computernetworks
2
answers
36
Whether languages regular or not
answered
Jan 23
in
Theory of Computation

122
views
theoryofcomputation
regularlanguage
1
answer
37
ACE test series
____________ uses entire capacity of link. (a)circuit switching (b)packet switching (c)both (d)none
commented
Jan 23
in
Computer Networks

58
views
acetestseries
computernetworks
1
answer
38
C Program
#include <stdio.h> char *str[]={"FirstSring","Is","Already","Written"}; char **strp[]={str+3,str+2,str+1,str}; char ***strpp=strp; int main(void) { printf("%s",**++strpp); printf("%s",**++strpp+3); return 0; } Output of this, and the interpretation?
commented
Jan 21
in
Programming

124
views
3
answers
39
GATE2014343
An instruction pipeline has five stages, namely, instruction fetch (IF), instruction decode and register fetch (ID/RF), instruction execution (EX), memory access (MEM), and register writeback (WB) with stage latencies 1 ns, 2.2 ns, 2 ns ... program on the old and the new design are $P$ and $Q$ nanoseconds, respectively. The value of $P/Q$ is __________.
answer edited
Jan 21
in
CO & Architecture

1.8k
views
gate20143
co&architecture
pipeline
numericalanswers
normal
0
answers
40
Ace Pregate Question
T(n) = T(n/4) + T(3n/4) + n if n>1 = 1 if n =1 T(n) = ??
commented
Jan 21
in
Algorithms

47
views
timecomplexity
algorithms
21,535
questions
26,867
answers
61,199
comments
23,218
users