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.
Answers 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
+4
votes
1
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

42
views
isro2016ece
digitallogic
+3
votes
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 \}$
answered
Feb 14
in
Theory of Computation

844
views
gate20172
+4
votes
3
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
+4
votes
4
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 _______
answered
Feb 14
in
CO & Architecture

969
views
gate20172
co&architecture
cachememory
numericalanswers
+3
votes
5
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
+1
vote
6
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

711
views
gate20172
numericalability
probability
+10
votes
7
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
+17
votes
8
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
+2
votes
9
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

826
views
gate20172
programminginc
numericalanswers
+8
votes
10
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
+2
votes
11
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
answered
Feb 14
in
Programming

660
views
gate20172
programminginc
+4
votes
12
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
+5
votes
13
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
+18
votes
14
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
+2
votes
15
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
+4
votes
16
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$
answered
Dec 6, 2016
in
Mathematical Logic

348
views
combinatory
+3
votes
17
Calicut Gate Academy Test Series  TOC Q32
answered
Dec 5, 2016
in
Theory of Computation

85
views
testseries
calicutgateacademytestseries
theoryofcomputation
turingmachine
+3
votes
18
Find the predicate logic for the following statement.
answered
Dec 5, 2016
in
Mathematical Logic

91
views
engineeringmathematics
mathematicallogic
+3
votes
19
cormen chapter 23 third edition.
answered
Dec 1, 2016
in
Algorithms

116
views
algorithms
+3
votes
20
Pointers
answered
Dec 1, 2016
in
Programming

159
views
pointers
programminginc
+6
votes
21
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.
answered
Nov 28, 2016
in
CO & Architecture

633
views
co&architecture
dma
+2
votes
22
Imp doubt
answered
Nov 28, 2016
in
Algorithms

57
views
+2
votes
23
DMA madeeasy
Here device transfer rate is 416.7 us and cpu executing an instruction in .5 us. So how to decide the clock cycle time, to calculate the fraction of cpu slows down?
answered
Nov 28, 2016
in
Operating System

145
views
dma
co&architecture
+4
votes
24
level cache
Suppose that a CPU has access to 3 levels of memory. L1 = 2000 words and access time = 0.02 ms and H1 = 0.65 L2 = 10000 words and access time = 0.2 ms and H2 = 0.45 L3 = 20000 words and access time = 2 ms Assume that if a Word to be ... . If it is in L2, first transfer it to L1 and then send to CPU. Similarly, for L3 . What is the average access time in % ?
answered
Nov 28, 2016
in
Operating System

360
views
cachememory
co&architecture
+3
votes
25
dma,harddisk
Consider a hard disk which when requested to read a sector of 2048 bytes, first reads into its own local memory, and then uses DMA to transfer it to the main memory over a bus. The latency of access of both memories is 80ns each. ... the transfer? All possible pipelining between stages is implemented. (A) 10250ns (B) 10330ns (C) 10360ns (D) None of these
answered
Nov 27, 2016
in
CO & Architecture

138
views
+1
vote
26
question bank
Consider the following statements: S1: Infinite union of regular languages can be contextfree. S2: Language obtained after applying Kleen closure on a regular language will always be regular and infinite. Which of the above statement is true?
answered
Nov 27, 2016
in
Theory of Computation

26
views
+2
votes
27
Eigen Vector
The number of linearly independent eigen vector of matrix A(3$\times$3) given as following a11=a22=2, a12=1, a13=a21=a23=a31=a32=0, a33=3
answered
Nov 27, 2016
in
Linear Algebra

68
views
+4
votes
28
GATE20075
Consider the DAG with $V = \{1,2,3,4,5,6\}$ shown below. Which of the following is not a topological ordering? 1 2 3 4 5 6 1 3 2 4 5 6 1 3 2 4 6 5 3 2 4 1 6 5
answered
Nov 27, 2016
in
Algorithms

461
views
gate2007
topologicalsort
algorithms
graphalgorithms
0
votes
29
GATE19893v
Answer the following: Which of the following wellformed formulas are equivalent? $P \rightarrow Q$ $\neg Q \rightarrow \neg P$ $\neg P \vee Q$ $\neg Q \rightarrow P$
answered
Nov 27, 2016
in
Mathematical Logic

99
views
gate1989
normal
predicatelogic
mathematicallogic
+3
votes
30
GATE19893iii
Answer the following questions: Which of the following problems are undecidable? Membership problem in contextfree languages. Whether a given contextfree language is regular. Whether a finite state automation halts on all inputs. Membership problem for type $0$ languages.
answered
Nov 27, 2016
in
Theory of Computation

155
views
gate1989
normal
theoryofcomputation
decidability
+5
votes
31
GATE19893ii
Contextfree languages and regular languages are both closed under the operation (s) of : Union Intersection Concatenation Complementation
answered
Nov 27, 2016
in
Theory of Computation

71
views
gate1989
easy
theoryofcomputation
closureproperty
Page:
1
2
3
4
5
6
...
14
next »
21,440
questions
26,754
answers
60,924
comments
22,934
users