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 Prashant.
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Prashant.
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
b tree
what are b trees..explain in simplest way
answer edited
Jul 26
in
Databases

215
views
2
answers
2
GATE20011.4
Consider the following two statements: $S1: \left\{ 0^{2n} \mid n \geq 1 \right\}$ is a regular language $S2: \left\{0^m1^n0^{m+n} \mid m \geq 1 \text{ and } n \geq 1 \right\}$ is a regular language Which of the following statement is correct? Only S1 is correct Only S2 is correct Both S1 and S2 are correct None of S1 and S2 is correct
commented
Jul 20
in
Theory of Computation

414
views
gate2001
theoryofcomputation
easy
regularlanguages
3
answers
3
GATE200355
Consider the NFA M shown below. Let the language accepted by M be L. Let $L_1$ be the language accepted by the NFA $M_1$ obtained by changing the accepting state of M to a nonaccepting state and by changing the nonaccepting states of M to accepting states. Which ... statements is true? $L_1 = \{0,1\}^*L$ $L_1 = \{0,1\}^*$ $L_1 \subseteq L$ $L_1 = L$
edited
Jul 10
in
Theory of Computation

920
views
gate2003
theoryofcomputation
finiteautomata
normal
2
answers
4
computer network
Suppose that 2 parties A and B wish to setup a common secret key (DH key) between themselves using the Diffie  Hellman key exchange technique. They agree on 47 as the modulus and 3 as the primitive root . Party A chooses 8 and party B chooses 10 as their respective secrets. Their DH key is ___________________ A) 3 B) 4 C) 5 D) 6
commented
Jul 8
in
Computer Networks

88
views
2
answers
5
Made Easy CBT20172Q22
Please explain how they merged.(Modified)
answer edited
Jul 8
in
Databases

273
views
madeeasytestseries
cbt2017
databases
erdiagram
2
answers
6
normalisation
can a table be in 3rd normal form without being in 2nd normal form!!
commented
Jul 7
in
Databases

41
views
4
answers
7
GATE2014250
Consider the following relation on subsets of the set $S$ of integers between 1 and 2014. For two distinct subsets $U$ and $V$ of $S$ we say $U\:<\:V$ if the minimum element in the symmetric difference of the two sets is in $U$. Consider ... and $S2$ are true $S1$ is true and $S2$ is false $S2$ is true and $S1$ is false Neither $S1$ nor $S2$ is true
answer edited
Jul 7
in
Set Theory & Algebra

1.2k
views
gate20142
settheory&algebra
normal
sets
2
answers
8
Fragmentation
header size not given.
edited
Jul 7
in
Computer Networks

329
views
2
answers
9
ER to Table Conversion
Any Good Resource to study this topic ? Or Could anyone explain this topic to me ?
commented
Jul 7
in
Databases

339
views
erdiagram
rdbmstables
databases
4
answers
10
GATE200579
Consider the following data path of a CPU. 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 ... <= R0 + R1. The minimum number of clock cycles needed for execution cycle of this instruction is: 2 3 4 5
commented
Jul 7
in
CO & Architecture

2k
views
gate2005
co&architecture
machineinstructions
datapath
normal
1
answer
11
Identify the language
Which of the following is the language L={0n#02n#03n│n≥0}( Marks: 0.33 ) Regular but not Context free Context free but not Regular Not Context free None of these
commented
Jul 7
in
Theory of Computation

52
views
3
answers
12
GATE200019
Consider the syntax directed translation scheme (SDTS) given in the following. Assume attribute evaluation with bottomup parsing, i.e., attributes are evaluated immediately after a reduction. E$\rightarrow $ E$_{1}$ * T {E.val = E$_{1}$ ... given, without changing the grammar, to find E.red, the number of reductions performed while reducing an input to E.
answer selected
Jul 7
in
Compiler Design

610
views
gate2000
compilerdesign
syntaxdirectedtranslation
normal
descriptive
1
answer
13
CMI2010A04
Let $m$ and $n$ range over natural numbers and let $Prime(n)$ be true if $n$ is a prime number. Which of the following formulas expresses the fact that the set of prime numbers is infinite? $(\forall m) (\exists n) (n > m) \text{ implies } Prime(n)$ $(\ ... ) (\exists n) (n > m) \wedge Prime(n)$ $(\exists n) (\forall m) (n > m) \wedge Prime(n)$
commented
Jul 6
in
Mathematical Logic

30
views
cmi2010
firstorderlogic
1
answer
14
ER to Relational mapping
How can trainer id be p.key of Parts??
commented
Jul 6
in
Databases

286
views
erdiagram
rdbmstables
1
answer
15
Answer is provided as 1, why not +1?
edited
Jul 6
in
Mathematical Logic

35
views
1
answer
16
GATE20055
A program P reads in 500 integers in the range [0, 100] representing the scores of 500 students. It then prints the frequency of each score above 50. What would be the best way for P to store the frequencies? An array of 50 numbers An array of 100 numbers An array of 500 numbers A dynamically allocated array of 550 numbers
commented
Jul 6
in
DS

1.1k
views
gate2005
datastructure
arrays
easy
1
answer
17
NPDA and DPDA
Can we make NPDA? L= {anbn n>=0,a,b are input variables} if yes then make it .
commented
Jul 6
in
Theory of Computation

26
views
pushdownautomata
npda
1
answer
18
Regular Language to Regular Grammar
edited
Jul 6
in
Theory of Computation

45
views
theoryofcomputation
regularlanguages
regulargrammar
1
answer
19
GATE200541
What is the first order predicate calculus statement equivalent to the following? "Every teacher is liked by some student" $∀(x)\left[\text{teacher}\left(x\right) → ∃(y) \left[\text{student}\left(y\right) → \text{likes}\left(y,x\right)\right]\ ... left(x\right) ∧ ∃(y) \left[\text{student}\left(y\right) → \text{likes}\left(y,x\right)\right]\right]$
commented
Jul 6
in
Mathematical Logic

752
views
gate2005
mathematicallogic
easy
firstorderlogic
1
answer
20
UGCNETDec2013III55
Consider the following ER diagram: The minimum number of tables required to represent M, N, P, R$_1$, R$_2$ is 2 3 4 5
commented
Jul 6
in
Databases

182
views
ugcnetdec2013iii
databases
erdiagram
1
answer
21
GATE200830
Let $\text{fsa}$ and $\text{pda}$ be two predicates such that $\text{fsa}(x)$ means $x$ is a finite state automaton and $\text{pda}(y)$ means that $y$ is a pushdown automaton. Let $\text{equivalent}$ be another predicate such that $\text{ ... \left(\text{fsa}\left(y\right) \wedge \text{pda}\left(x\right) \wedge \text{equivalent}\left(x,y\right)\right)$
commented
Jul 5
in
Mathematical Logic

1k
views
gate2008
easy
mathematicallogic
firstorderlogic
4
answers
22
TIFR2012A2
If $Mr.M$ is guilty, then no witness is lying unless he is afraid. There is a witness who is afraid. Which of the following statements is true? (Hint: Formulate the problem using the following predicates $G  Mr.M$ is guilty $W(x)  ... guilty. From these facts one cannot conclude that $Mr.M$ is guilty. There is a witness who is lying. No witness is lying.
commented
Jul 5
in
Mathematical Logic

340
views
tifr2012
mathematicallogic
firstorderlogic
2
answers
23
Multidimensional array
int b[10][10]; int *a[10]; //How b[2][3] and a[2][3] will work??
commented
Jul 4
in
Programming

206
views
2
answers
24
GATE1999_2.24
Consider the following C function definition int Trial (int a, int b, int c) { if ((a>=b) && (c<b) return b; else if (a>=b) return Trial(a, c, b); else return Trial(b, a, c); } The functional Trial: Finds the maximum of a, b, and c Finds the minimum of a, b, and c Finds the middle number of a, b, c None of the above
answer reshown
Jul 4
in
Algorithms

868
views
gate1999
algorithms
identifyfunction
normal
3
answers
25
DCFLs
S1: Every DCFL has unambiguous grammar S2: Every language accepted by DPDA with final state is also accepted by DPDA with empty stack S1 is given as true and S2 false. Explain how?!
answered
Jul 4
in
Theory of Computation

44
views
dcfl
unambiguousgrammar
1
answer
26
UGCNETDEC2016III52
Some of the criteria for calculation of priority of a process are: Processor utilization by an individual process Weight assigned to a user or group of users Processor utilization by a user or group of processes In fair share scheduler, priority is calculated based on: only a and b only a and c a, b and c only b and c
edited
Jul 3
in
Others

122
views
ugcnetdec2016iii
2
answers
27
CLRS Book Exercises 4.45
Use recursion tree method to determine Upper Bound of T(n) = T(n1) + T(n/2) + n
commented
Jul 2
in
Algorithms

139
views
algorithms
timecomplexity
1
answer
28
UGCNETDEC2016II31
Which of the following strings would match the regular expression: p+[35]*[xyz]? p443y p6y 3xyz p35z p353535x ppp5 I, III and Vl only IV, V and VI only II, IV and V only I, IV and V only
answer selected
Jul 2
in
Others

224
views
ugcnetdec2016ii
3
answers
29
UGCNETSep2013II36
Consider the following program segment: d=0; for(i=1; i<31, ++i) for (j=1; j < 31; ++j) for (k=1; k < 31; ++k) if((i+j+k%3)==0)) d=d+1; printf(“%d”, d); The output will be 9000 3000 90 2700
answer edited
Jun 7
in
Others

125
views
ugcnetsep2013ii
1
answer
30
UGCNETDec2013III45
Which layer of OSI reference model is responsible for decomposition of messages and generation of sequence numbers to ensure correct recomposition from end to end of the network? Physical Datalink Transport Application
commented
Jun 1
in
Computer Networks

214
views
ugcnetdec2013iii
computernetworks
newt
networklayering
2
answers
31
ISRO201726
Advantage of synchronous sequential circuits over asynchronous one is: Lower hardware requirement Better noise immunity Faster operation All of the above
commented
May 27
in
Digital Logic

1.4k
views
isro2017
digitallogic
digitalcircuits
badquestion
2
answers
32
GATE200216
For relation R=(L, M, N, O, P), the following dependencies hold: $ M \rightarrow O,$ $NO \rightarrow P,$ $P \rightarrow L$ and $L \rightarrow MN$ R is decomposed into R1 = (L, M, N, P) and R2 = (M ... dependencypreserving? If not, list all the dependencies that are not preserved. What is the highest normal form satisfied by the above decomposition?
answer edited
May 13
in
Databases

822
views
gate2002
databases
databasenormalization
normal
descriptive
2
answers
33
GATE200217
The following table refers to search items for a key in $B$trees and $B^+$ trees. B−tree B+−tree Successful search Unsuccessful search Successful search Unsuccessful search X1 X2 X3 X4 A successful search means that the key exists in the database and ... (2,11) and (11,6) are now inserted into R. What are the additional tuples that are inserted in V?
answer edited
May 13
in
Databases

471
views
gate2002
databases
btree
normal
descriptive
3
answers
34
GATE200219
A computer uses 32bit virtual address, and 32bit physical address. The physical memory is byte addressable, and the page size is 4 kbytes. It is decided to use two level page tables to translate from virtual address to physical ... be contained in each page? How many bits are available for storing protection and other information in each page table entry?
answer edited
May 13
in
Operating System

1.2k
views
gate2002
operatingsystem
virtualmemory
normal
descriptive
1
answer
35
doubt
Overlaying is used to run a program which is longer than the address space of a computer Is the above statement is TRUE/FALSE? I think it is TRUE, as we can load required process space for execution at different time. Correct me if I am wrong
commented
May 13
in
Operating System

41
views
operatingsystem
overlay
1
answer
36
computer networks
Assume we need to design a Go Back N sliding window protocol for a network in which the bandwidth is 100 Mbps and the average distance between the sender and receiver is 10,000 km. Assume the average packet size is 100,000 bits and ... windows, the number of bits in the sequence number field ( m), and an appropriate time out value for the timer.
edited
May 13
in
Computer Networks

67
views
3
answers
37
ISRO201723
What is the minimum number of twoinput NAND gates used to perform the function of twoinput OR gate? One Two Three Four
commented
May 13
in
Digital Logic

449
views
isro2017
digitallogic
minnogates
3
answers
38
DMA transfer rate
An 8bit DMA device is operating is cycle stealing mode (single transfer mode). Each DMA cycle is of 6 clock states and DMA clock is 2MHz. Intermediate CPU machine cycle takes 2 microsecond, determine the DMA data transfer rate.
commented
May 13
in
CO & Architecture

818
views
co&architecture
dma
3
answers
39
TOC QUESTION
Which of the following is not true? A)Class of All languages is not countable B)Every language in P is also in NP C)Every language in NP is decidabale. D)There are some languages in NP but not in P
commented
May 13
in
Theory of Computation

60
views
2
answers
40
Toc question
Consider the two given languages : A={x:x is an integer and divisible by 2) B ={2x:x is an integer }.Which of the following is correct? A) A is accepted by an automata but not by B B) B is accepted by an automata but not by A C) Both A and B are accepted by an automata D)None are accepted by automata
edited
May 13
in
Theory of Computation

64
views
24,796
questions
31,866
answers
73,707
comments
30,011
users