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
GATE19981.26
Which of the following statements is true? SLR paper is more powerful than LALR LALR parser is more powerful than Canonical LR parser Canonical LR parser is more powerful than LALR parser The parsers SLR, Canonical CR, and LALR have the same power
answer selected
Feb 23
in
Compiler Design

649
views
gate1998
compilerdesign
parsing
normal
3
answers
2
GATE2017121
Consider the Karnaugh map given below, where X represents "don't care" and blank represents 0. Assume for all inputs $\left ( a,b,c,d \right )$, the respective complements $\left ( \bar{a}, \bar{b}, \bar{c} ... $ are also available. The above logic is implemented using 2input NOR gates only. The minimum number of gates required is ____________ .
answer edited
Feb 23
in
Digital Logic

709
views
gate20171
digitallogic
kmap
numericalanswers
normal
1
answer
3
GATE2017133
Consider a combination of T and D flipflops connected as shown below. The output of the D flipflop is connected to the input of the T flipflop and the output of the T flipflop is connected to the input of the D flipflop. Initially, ... cycle are 11 respectively. (D) $Q_{1}Q_{0}$ after the 3rd cycle are 01 and after the 4th cycle are 01 respectively.
answer edited
Feb 23
in
Digital Logic

418
views
gate20171
digitallogic
flipflop
normal
2
answers
4
Discrete Math
Prove or disprove the following: for finite sets A and B, $\overline{(A  B) \cup (B  A)} = A \cap B$ . If the proposition is incorrect, do minimal modifications to the same and prove.
comment edited
Feb 23
in
Set Theory & Algebra

63
views
discretemathematics
iitg_math
nongate
descriptive
2
answers
5
Broadcast MAC Address
Which of the following frames would be flooded on a switch port? Frame with source address as FFFFFFFFFFFF Frame with destination macaddress as FFFFFFFFFFFF. Frames which do not have the destination macaddress known in the macaddress table of the switch. None of the above.
commented
Feb 23
in
Computer Networks

50
views
computernetworks
subnetting
0
answers
6
Discrete math
Let $w \in \sum$$*$ be a string, with $\sum$ being the alphabet. Let $w^R$ be the reversal of string $w$, using induction prove that $(w^R)(w^R). . .(\text{for k times}) = (ww . . .(\text{for k times}))^R.$
commented
Feb 22
in
Set Theory & Algebra

42
views
descriptive
iitg_math
discretemathematics
2
answers
7
GATE2017131
Let $A$ be $n\times n$ real valued square symmetric matrix of rank 2 with $\sum_{i=1}^{n}\sum_{j=1}^{n}A^{2}_{ij} =$ 50. Consider the following statements. (I) One eigenvalue must be in $\left [ 5,5 \right ]$ (II) The eigenvalue with the largest ... $A$ is/are necessarily CORRECT? (A) Both (I) and (II) (B) (I) only (C) (II) only (D) Neither (I) nor (II)
commented
Feb 21
in
Linear Algebra

621
views
gate20171
linearalgebra
eigenvalue
normal
1
answer
8
ISRO2016ECE Digital Logic
How many inputs & outputs does a full adder have? (a) 3, 2 (b) 2, 3 (c) 3, 3 (d) 2, 2
answered
Feb 21
in
Digital Logic

43
views
isro2016ece
digitallogic
2
answers
9
GATE2017247
If the ordinary generating function of a sequence $\big \{a_n\big \}_{n=0}^\infty$ is $\large \frac{1+z}{(1z)^3}$, then $a_3a_0$ is equal to ___________ .
answer selected
Feb 14
in
Combinatory

637
views
gate20172
combinatory
generatingfunctions
numericalanswers
5
answers
10
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 edited
Feb 14
in
Theory of Computation

844
views
gate20172
4
answers
11
GATE2017253
Consider a machine with a byte addressable main memory of $2^{32}$ bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is _______
answer selected
Feb 14
in
CO & Architecture

969
views
gate20172
co&architecture
cachememory
numericalanswers
2
answers
12
GATE2017241
Let $L(R)$ be the language represented by regular expression $R$. Let $L(G)$ be the language generated by a context free grammar $G$. Let $L(M)$ be the language accepted by a Turing machine $M$. Which of the following decision problems are undecidable? Given a ... $w$, is $w \in L(M)$? I and IV only II and III only II, III and IV only III and IV only
answered
Feb 14
in
Theory of Computation

836
views
gate20172
theoryofcomputation
5
answers
13
GATE201726
Which of the following statements about parser is/are CORRECT? Canonical LR is more powerful than SLR SLR is more powerful than LALR SLR is more powerful than Canonical LR I only II only III only II and III only
commented
Feb 14
in
Compiler Design

563
views
gate20172
5
answers
14
GATE2017216
Identify the language generated by the following grammar, where $S$ is the start variable. $$ S \rightarrow XY$$ $$ X \rightarrow aX \mid a$$ $$ Y \rightarrow aYb \mid \epsilon$$ $\{a^mb^n \mid m \geq n, n > 0 \}$ $ \{ a^mb^n \mid m \geq n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n \geq 0 \}$ $\{a^mb^n \mid m > n, n > 0 \}$
answered
Feb 14
in
Theory of Computation

601
views
gate20172
theoryofcomputation
6
answers
15
GATE20172GA5
There are 3 red socks, 4 green socks and 3 blue socks. You choose 2 socks. The probability that they are of the same colour is 1/5 7/30 1/4 4/15
answered
Feb 14
in
Numerical Ability

712
views
gate20172
numericalability
probability
4
answers
16
GATE2017225
The minimum possible number of states of a deterministic finite automaton that accepts the regular language $L$ = {$w_{1}aw_{2}$  $w_{1},w_{2}$ $\in$ $\left \{ a,b \right \}^{*}$ , $\left  w_{1} \right  = 2, \left  w_{2} \right \geq 3$} is ______________ .
answered
Feb 14
in
Theory of Computation

940
views
theoryofcomputation
gate20172
dfa
numericalanswers
1
answer
17
GATE2017221
Consider the set $X=\{a, b, c, d, e\}$ under partial ordering $R=\{(a,a), (a, b), (a, c), (a, d), (a, e), (b, b), (b, c), (b, e), (c, c), (c, e), (d, d), (d, e), (e, e) \}$. The Hasse diagram ... Hasse diagram of the partial order $(X, R)$ is shown below. The minimum number of ordered pairs that need to be added to $R$ to make $(X, R)$ a lattice is ______
answered
Feb 14
in
Set Theory & Algebra

685
views
gate20172
discretemathematics
lattice
numericalanswers
4
answers
18
GATE2017214
Consider the following function implemented in C: void printxy(int x, int y) { int *ptr; x=0; ptr=&x; y=*ptr; *ptr=1; printf(“%d, %d”, x, y); } The output of invoking printxy(1,1) is 0, 0 0, 1 1, 0 1, 1
commented
Feb 14
in
Programming

660
views
gate20172
programminginc
3
answers
19
GATE2017249
In a B+ Tree , if the searchkey value is $8$ bytes long , the block size is $512$ bytes and the ointer size is $2$ B , then the maximum order of the B+ Tree is ____
commented
Feb 14
in
Databases

930
views
gate20172
databases
indexing
btree
numericalanswers
5
answers
20
GATE2017254
Consider the following C program. #include<stdio.h> int main () { int m=10; int n, n1; n=++m; n1=m++; n; n1; n=n1; printf(“%d”, n); return 0; } The output of the program is ______
answered
Feb 14
in
Programming

827
views
gate20172
programminginc
numericalanswers
2
answers
21
GATE2017234
Consider the binary code that consists of only four valid codewords as given below: 00000, 01011, 10101, 11110 Let the minimum Hamming distance of the code $p$ and the maximum number of erroneous bits that can be corrected by the code be $q$. Then the values of $p$ and $q$ are $p=3$ and $q=1$ $p=3$ and $q=2$ $p=4$ and $q=1$ $p=4$ and $q=2$
answered
Feb 14
in
Digital Logic

655
views
gate20172
digitallogic
hammingcode
4
answers
22
GATE2017211
Let $p, q, r$ denote the statements It is raining , It is cold , and It is pleasant , respectively. Then the statement It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold is represented by $(\neg p \wedge ... r) \vee ((p \wedge q) \rightarrow \neg r)$ $(\neg p \wedge r) \vee (r \rightarrow (p \wedge q))$
answered
Feb 14
in
Mathematical Logic

878
views
gate20172
mathematicallogic
predicatelogic
4
answers
23
GATE201722
Match the following: P. static char var; i. Sequence of memory locations to store addresses Q. m=malloc(10); m=NULL; ii. A variable located in data section of memory R. char *ptr[10]; iii. Request to allocate a CPU register to store data S. register int varl; iv. A lost memory ... Siii Pii; Qi; Riv; Siii Pii; Qiv; Riii; Si Piii; Qiv; Ri; Sii
answered
Feb 14
in
Programming

725
views
gate20172
programming
programminginc
4
answers
24
GATE2017213
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. ... (I) only. (B) (II) only. (C) Both (I) and (II). (D) Neither (I) nor (II).
answered
Feb 14
in
DS

2.4k
views
gate20172
datastructure
1
answer
25
Time complexity
Let A =[a1, a2, …, an] be a onedimensional array of integers define a MEGAPEAK in A to be an element ai belongs A such that ai >= aj for all aj with  j – i  <= 2. What is the time complexity to find MEGAPEAK?
commented
Dec 12, 2016
in
Algorithms

39
views
1
answer
26
Time complexity
Consider the array of size n. the first (n – 1) elements are already sorted. What is the worst case time complexity to insert a nth element in an array after insertion the array should be in sorted order??
commented
Dec 12, 2016
in
Algorithms

54
views
0
answers
27
closure properties of relations
edited
Dec 10, 2016
in
Set Theory & Algebra

94
views
1
answer
28
Advanced Computer Architecture , KAI HWANG  How to Find MAL from Collision Vector  NonLinear Pipeline
answer edited
Dec 10, 2016
in
CO & Architecture

388
views
co&architecture
pipeline
nonlinearpipeline
1
answer
29
Gateforum TOC Assessment test
answer selected
Dec 9, 2016
in
Theory of Computation

65
views
gateforumtestseries
theoryofcomputation
closureproperty
identifyclasslanguage
2
answers
30
ME FLT4 Q58
am getting 2.75. given answer is 4. number of cycles when there are no misses= 250*5 = 1250 number of cycles with given misses = 1800 stall cycles = 18001250 = 550 number of stalls/instruction= 550/200 = 2.75 please verify
commented
Dec 9, 2016
in
CO & Architecture

440
views
madeeasy
testseries
0
answers
31
#digitalCIrcuit
commented
Dec 7, 2016
in
Digital Logic

82
views
2
answers
32
#digitalCircuit
how it works??
commented
Dec 7, 2016
in
Digital Logic

82
views
0
answers
33
made easy
reopened
Dec 7, 2016
in
Databases

69
views
madeeasy_testseries
2
answers
34
what is valid PC after execution of these instruction
commented
Dec 7, 2016
in
CO & Architecture

147
views
1
answer
35
dpda }} Linz7.34
DPDA for $L = \left \{ a^nb^n:n\geq 1 \right \} \cup\left \{ a \right \}$
answered
Dec 7, 2016
in
Theory of Computation

99
views
pushdownautomata
theoryofcomputation
0
answers
36
made easy_TOC
I think below is CFL, we need two copies but answer given is DCFL..please help for below lang. L= {a bn an  n>0} U {aa bk a2k  k>0 }
edited
Dec 7, 2016
in
Theory of Computation

64
views
7
answers
37
number of WAR dependencies
commented
Dec 6, 2016
in
CO & Architecture

826
views
co&architecture
datadependencies
0
answers
38
cormen chapter 3
Consider the two functions (logn)k and nϵ, where k>1 and ϵ>0. The solution is (logn)k= O(nϵ). My doubt is that if we take ϵ as0.000000000000000000000000000000.......000000000001 that is very small wont this result be wrong?? Can someone check?
commented
Dec 6, 2016
in
Algorithms

60
views
algorithms
4
answers
39
Discrete Maths
Explain each one of the following: a ) In how many ways can we put 31 people in 3 rooms such that each room has an odd number of people ? b ) Coefficient of $x^4$ in the expansion $(1+ x + x^2 + x^3)^{11}$ using generating functions. c)Find out number of solutions $x_1+x_2+x_3 = 20 , 2<x_1<6 , 6<x_2<10 , 0<x_3<5$
commented
Dec 6, 2016
in
Mathematical Logic

348
views
combinatory
0
answers
40
ME FLT3 Q26
tag bits =4. means 0.5 Bytes size of tag memory = 0.5* number of blocks=0.5* 2^9 Bytes= 0.25 KB ryt?
commented
Dec 6, 2016
in
CO & Architecture

75
views
testseries
madeeasy
21,446
questions
26,759
answers
60,943
comments
22,955
users