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 Kapil
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Kapil
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
TIFR2010A8
Which of the following is NOT necessarily true? { Notation: The symbol ''$\neg$''notes negation; $P (x, y)$ means that for given $x$ and $y$, the property $P(x, y)$ is true }. $(∀x∀y P(x, y)) \Rightarrow (∀y∀x P(x, y))$ $(∀x∃y \neg P(x, y)) \Rightarrow \neg ... x, y))$ $(∃x∀y P(x, y)) \Rightarrow (∀y∃x P(x, y))$ $(∀x∃y P(x, y)) \Rightarrow (∃y∀x P(x, y))$
answer edited
3 days
ago
in
Mathematical Logic

395
views
tifr2010
mathematicallogic
firstorderlogic
6
answers
2
GATE2017239
Let $\delta$ denote the transition function and $\widehat{\delta}$ denote the extended transition function of the $\epsilon$NFA whose transition table is given below: $\delta$ $\epsilon$ $a$ $b$ $\rightarrow \: q_0$ $\{q_2\}$ $\{q_1\}$ $\{q_0\}$ $q_1$ $\{q_2\}$ $\ ... }(q_2, aba)$ is $\emptyset$ $\{q_0, q_1, q_3\}$ $\{q_0, q_1, q_2\}$ $\{q_0, q_2, q_3 \}$
answer selected
Jul 19
in
Theory of Computation

1.1k
views
gate20172
theoryofcomputation
finiteautomata
1
answer
3
Doubt on Regular and unambiguous
commented
Jul 18
in
Theory of Computation

37
views
theoryofcomputation
4
answers
4
GATE200318
In a bottomup evaluation of a syntax directed definition, inherited attributes can always be evaluated be evaluated only if the definition is Lattributed be evaluated only if the definition has synthesized attributes never be evaluated
answer edited
Jul 17
in
Compiler Design

2.4k
views
gate2003
compilerdesign
syntaxdirectedtranslation
normal
0
answers
5
Proof of whether a TM accepts epsilon is semi decidable
commented
Jul 15
in
Theory of Computation

31
views
theoryofcomputation
decidability
1
answer
6
toc gatebook test Q 2
Let $R$ be a regular language and $L$ is a language which accepts only even length strings from $R$. Then $L$ is Always Regular Always Not Regular Sometimes Regular, but not always None
edited
Jul 13
in
Theory of Computation

143
views
regularlanguages
1
answer
7
Series Summation
Series summation of $S_n$ in closed form? $\begin{align*} &S_n = \frac{1}{1.2.3.4} + \frac{1}{2.3.4.5} + \frac{1}{3.4.5.6} + \dots + \frac{1}{n.(n+1).(n+2).(n+3)} \end{align*}$
commented
Jul 12
in
Set Theory & Algebra

71
views
numbertheory
summation
discretemathematics
5
answers
8
GATE2004IT13
Let P be a singly linked list. Let Q be the pointer to an intermediate node x in the list. What is the worstcase time complexity of the bestknown algorithm to delete the node x from the list ? O(n) O(log2 n) O(log n) O(1)
answer selected
Jul 7
in
DS

1.3k
views
gate2004it
datastructure
linkedlists
normal
ambiguous
0
answers
9
Minimum No. of vertices required
commented
Jul 2
in
Graph Theory

98
views
graphtheory
proof
2
answers
10
ISRO201515
The queue data structure is to be realized by using stack. The number of stacks needed would be It cannot be implemented 2 stacks 4 stacks 1 stack
answer selected
Jun 29
in
DS

965
views
isro2015
datastructure
stack
2
answers
11
ISRO201150
Data is transmitted continuously at 2.048 Mbps rate for 10 hours and received 512 bits errors. What is the bit error rate? 6.9 e9 6.9 e6 69 e9 4 e9
answer selected
Jun 29
in
Computer Networks

1.2k
views
isro2011
computernetworks
errordetection
1
answer
12
discrete math
Give an example where distributive lattice is not complemented lattice? Is always distributive lattice bounded?
commented
Jun 14
in
Set Theory & Algebra

880
views
2
answers
13
min heap
The number of binary min. heaps that can be formed from a set of 7 distinct integers is _________?
commented
Jun 13
in
DS

526
views
2
answers
14
COA DMA doubt
What is formula for % of time CPU gets blocked?? Is it X(X+Y) or X/Y only??? What is formula for % of time CPU is consumed in Interuppt driven IO??? Formula for % of CPU slow down in interrupt driven IO???
comment edited
Jun 8
in
CO & Architecture

473
views
co&architecture
dma
interrupts
1
answer
15
HamacherDMA
The average seek time and rotational delay in a disk system are 6ms and 3ms, respectively. The rate of data transfer to or from the disk is 30 Mbytes/sec and all disk accesses are for 8 Kbytes of data. Disk DMA controller, the ... a disk unit, on average over a long period of time during which a sequence of independent 8Kbyte transfers takes place?
commented
Jun 4
in
CO & Architecture

623
views
co&architecture
dma
2
answers
16
DMA operation
A) Consider $1$mbps harddisk is interfaced to the processor in a cycle stealing mode of DMA whenever $64$ bytes of data is available in the buffer,then it is transferred to main memory (1 word = $64$ bits) and machine cycle time is $2$ ... time consumed for DMA operation is ? B) Percentage of CPU time consumed for DMA operation, if burst mode is used ?
commented
Jun 3
in
CO & Architecture

845
views
dma
co&architecture
2
answers
17
ISRO201716
Given two statements Insertion of an element should be done at the last node of the circular list Deletion of an element should be done at the last node of the circular list Both are true Both are false First is false and second is true None of the above
commented
May 25
in
DS

2.2k
views
isro2017
datastructure
linkedlists
badquestion
2
answers
18
Write Through Cache Policy Questions  As per me answer should be 30, Given as 46 ns !
commented
May 22
in
CO & Architecture

639
views
write_through
cachememory
2
answers
19
ISRO201771
At a particular time the value of counting semaphore is 10. It will become 7 after: 3 V operations 3 P operations 5 V operations and 2 P operations 2 V operations and 5 P operations
commented
May 11
in
Operating System

1.1k
views
isro2017
operatingsystem
semaphore
3
answers
20
GATE1999_2.15
A grammar that is both left and right recursive for a nonterminal, is Ambiguous Unambiguous Information is not sufficient to decide whether it is ambiguous or unambiguous None of the above
answer edited
May 9
in
Compiler Design

770
views
gate1999
compilerdesign
grammar
normal
2
answers
21
Best source to study Calculus
Hello, kindly consider for a second that I've just passed my 10th class and just got admit to 11th standard. So, where would you suggest me to learn calculus from the very scratch. Kindly mention the video sources which can be very helpful in learning calculus from the very beginning.
commented
May 9
in
Calculus

66
views
engineeringmathematics
calculus
0
answers
22
Gate 2004 cse syntax directed translations
closed
May 9
in
Compiler Design

42
views
1
answer
23
ISRO201747
Capability maturity Model (CMM) is the methodology to develop and refine an organization's software development process develop the software test the software All of the above
answer selected
May 8
in
IS&Software Engineering

931
views
isro2017
is&softwareengg
nongate
cmm
1
answer
24
GATE199103,ii
Choose the correct alternatives (more than one may be correct) and write the corresponding letters only: (ii). Advantage of synchronous sequential circuits over asynchronous ones is: faster operation ease of avoiding problems due to hazards lower hardware requirement better noise immunity none of the above
edited
May 8
in
Digital Logic

2.1k
views
gate1991
digitallogic
normal
1
answer
25
Selection sort and Insertion sort
commented
May 6
in
Algorithms

206
views
sorting
algorithms
1
answer
26
GATE201351
The procedure given below is required to find and replace certain characters inside an input character string supplied in array A. The characters to be replaced are supplied in array oldc, while their respective replacement characters are supplied in array ... cases will be successful in exposing the flaw in this procedure? None 2 only 3 and 4 only 4 only
answer selected
May 3
in
DS

239
views
gate2013
datastructure
arrays
normal
0
answers
27
GATE 2015 Q.54
Consider the operations f (X,Y,Z ) = X′YZ + XY′+Y′Z′ and g (X,Y,Z ) = X′YZ + X′YZ′ + XY Which one of the following is correct? (A) Both {f} and {g} are functionally complete (B) Only {f} is functionally complete (C) Only {g} is functionally complete (D) Neither {f} nor {g} is functionally complete
closed
May 3
in
Digital Logic

24
views
0
answers
28
GATE 2015 SET 3 Q.33
The total number of prime implicates of the function f (w,x, y,z) = (0,2,4,5,6,10) is ____ .
closed
May 3
in
Digital Logic

37
views
0
answers
29
GATE 2004 Q.59
Which are the essential prime implicants of the following Boolean function? f (a,b, c) = a'c + ac'+ b'c (a) a'c and ac' (b) a'c and b'c (c) a'c only (d) ac' and bc'
closed
May 3
in
Digital Logic

93
views
1
answer
30
ISRO200728
The level of aggregation of information required for operational control is Detailed Aggregate Qualitative None of the above
answer selected
May 2
in
IS&Software Engineering

768
views
isro2007
nongate
0
answers
31
operating system
Does this solution guarantee A) mutual exclusion, B) progress, C) bounded waiting, D) starvationfreedom, E) deadlockfreedom
commented
May 1
in
Operating System

54
views
operatingsystem
os
0
answers
32
GATE2012_34
An Internet Service Provider (ISP) has the following chunk of CIDRbased IP addresses available with it: 245.248.128.0/20. The ISP wants to give half of this chunk of addresses to Organization A, and a quarter to Organization B, while retaining the remaining with itself. Which of the following is a valid allocation of address to A and B?
closed
May 1
in
Computer Networks

58
views
1
answer
33
GATE2013_34
A shared variable x, initialized to zero, is operated on by four concurrent processes W, X, Y, Z as follows. Each of the processes W and X reads x from memory, increments by one, stores it to memory, and then terminates. Each ... x to memory. Semaphore S is initialized to two. What is the maximum possible value of x after all processes complete execution?
closed
May 1
in
Operating System

71
views
1
answer
34
C programming  Output ?
Assume sizeof int as 4 #include <stdio.h> unsigned int L = (sizeof(unsigned int)) << 3; int foo(unsigned int m,unsigned int start,unsigned int length) { length = length >> 1; if(!length) { return m&(1<<start)?1:0; } ... length,length); return n1+n2; } } int main() { int m = 100; printf("%d\n",foo(m,0,L)); }
commented
Apr 30
in
Programming

251
views
programminginc
output
2
answers
35
rosen discrete
How many strings of six lowercase letters of the English alphabet contain exactly two vowel?
answer selected
Apr 28
in
Combinatory

64
views
kennethrosen
discretemathematics
permutationsandcombinations
1
answer
36
combinatorics
In how many ways 8 different shirts can be distributed to 4 different people so that each will get 2 shirts?
answered
Apr 28
in
Combinatory

82
views
discretemathematics
permutationsandcombinations
2
answers
37
Tokenization in lexical analysis
commented
Apr 27
in
Compiler Design

371
views
compilerdesign
compilertokenization
tokens
lexicalanalysis
0
answers
38
GATE20075
Consider the DAG with V={1,2,3,4,5,6} shown below. Which of the following is not a topological ordering?
closed
Apr 27
in
Programming

63
views
1
answer
39
GATE 2000 Q 2.10
The simultaneous equations on the Boolean variables x, y, z and w, X+Y+Z=1 XY=0 XZ+W=1 have the following solution for x, y, z and w, respectively: (a) 0 1 0 0 (b) 1 1 0 1 (c) 1 0 1 1 (d) 1 0 0 0
closed
Apr 25
in
Digital Logic

57
views
1
answer
40
CAN Inherently ambiguous languages HAVE DETERMINISTIC CONTEXT FREE GRAMMARS?
commented
Apr 25
in
Compiler Design

391
views
compilerdesign
contextfreelanguage
danglingelseproblem
deterministiccontextfreegrammars
24,137
questions
31,140
answers
70,874
comments
29,458
users