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
0
votes
1
NPDA and DPDA
Can we make NPDA? L= {anbn n>=0,a,b are input variables} if yes then make it .
answered
Jul 6
in
Theory of Computation

26
views
pushdownautomata
npda
+1
vote
2
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
0
votes
3
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
answered
May 13
in
Theory of Computation

60
views
+1
vote
4
The gatebook
Total order relation is Lattice or not please explain?
answered
May 12
in
Set Theory & Algebra

70
views
settheory&algebra
+3
votes
5
ISRO201723
What is the minimum number of twoinput NAND gates used to perform the function of twoinput OR gate? One Two Three Four
answered
May 10
in
Digital Logic

449
views
isro2017
digitallogic
minnogates
+2
votes
6
ISRO201743
Which of the following UML 2.0 diagrams capture behavioral aspects of a system? Use case diagram, Object diagram, Activity diagram and state machine diagram Use case diagram, Activity diagram and state machine diagram ... Diagram, Timing diagram and Interaction diagram Object diagram, Composite structure diagram, package diagram and Deployment diagram
answered
May 8
in
Object Oriented Programming

1.1k
views
isro2017
objectorientedprogramming
nongate
+1
vote
7
ISRO20173
Using NewtonRaphson method, a root correct to 3 decimal places of $x^3  3x 5 = 0$ 2.222 2.275 2.279 None of the above
answered
May 8
in
Numerical Methods

673
views
isro2017
newtonraphson
nongate
+5
votes
8
ISRO201762
What will be the output of the following C code? #include <stdio.h> main() { int i; for(i=0;i<5;i++) { int i=10; printf("%d" , i); i++; } return 0; } 10 11 12 13 14 10 10 10 10 10 0 1 2 3 4 Compilation error
answered
May 8
in
Programming

1.3k
views
isro2017
programminginc
+1
vote
9
Aptitude
The number of positive numbers of not more than 10 digits formed using 0,1,2,3?
answered
Apr 29
in
Numerical Ability

64
views
+2
votes
10
UGCNETDec2011II6
A hash table has space for $75$ records, then the probability of collision before the table is $6$% full. $.25$ $.20$ $.35$ $.30$
answered
Apr 28
in
Others

127
views
ugcnetdec2011ii
+1
vote
11
Cormen
Given an adjacencylist representation of a directed graph, how long does it take to compute the out degree of every vertex? How long does it take to compute indegrees?
answered
Apr 28
in
Algorithms

95
views
algorithms
+3
votes
12
GATE2017104
Consider the following functions from positive integers to real numbers: $10$, $\sqrt{n}$, $n$, $\log_{2}n$, $\frac{100}{n}$. The CORRECT arrangement of the above functions in increasing order of asymptotic complexity is: (A) $\log_{2}n$, $\frac{100}{n}$, $10$, $\sqrt ... $\sqrt{n}$, $\log_{2}n$, $n$ (D) $\frac{100}{n}$, $\log_{2}n$, $10$, $\sqrt{n}$, $n$
answered
Apr 28
in
Algorithms

1.2k
views
gate20171
algorithms
asymptoticnotations
normal
+2
votes
13
Made Easy test series
"A" sort a particular dataset of size n using merge sort in 640 msec, "B" uses the same algorithm on dataset of size 16, it takes 256 msec to sort them. what is size of data set used by "A" A. 32 B. 64 C. 128 D. None of above
answered
Apr 25
in
Algorithms

67
views
0
votes
14
why this program give "Invalid memory reference" error explain it?
answered
Apr 22
in
Programming

80
views
programminginc
+6
votes
15
TOC: empty language and epsilon
answered
Apr 19
in
Theory of Computation

94
views
theoryofcomputation
0
votes
16
T(n)=16T(n/4)+n! using the Master Theorem
answered
Apr 18
in
Algorithms

345
views
algorithms
mastertheorem
+2
votes
17
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
Apr 14
in
Combinatory

213
views
discretemathematics
kennethrosen
+2
votes
18
Rosen chapter6 (counting)
How many solutions are there to the equation x1 + x2 + x3 + x4 + x5 = 21, where xi , i = 1, 2, 3, 4, 5, is a nonnegative integer such that: 0$\leq$ x1$\leq$10 ?
answered
Apr 14
in
Combinatory

213
views
discretemathematics
kennethrosen
+4
votes
19
kenneith rosen
At least how many numbers should be selected from the set {1, 5, 9, 13, …125} to be assured that two of the numbers selected have a sum of 146?
answered
Apr 13
in
Set Theory & Algebra

96
views
kennethrosen
discretemathematics
+2
votes
20
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
answered
Apr 13
in
Theory of Computation

414
views
gate2001
theoryofcomputation
easy
regularlanguages
+2
votes
21
Rosen, Discrete Mathematics ,counting
answered
Apr 11
in
Combinatory

55
views
+2
votes
22
Gatebook Test
A man ate 300 mangoes in 15 days , each day eating two more than the previous day . How many mangoes did he eat on the 3rd day?
answered
Apr 10
in
Numerical Ability

121
views
+1
vote
23
GATE200580
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 for memory read operation – ... M[PC]; The minimum number of CPU clock cycles needed during the execution cycle of this instruction is: 2 3 4 5
answered
Apr 8
in
CO & Architecture

1.2k
views
co&architecture
normal
gate2005
datapath
machineinstructions
+3
votes
24
GATE200759
Information about a collection of students is given by the relation $\text{studInfo(}\underline{\text{studId}},\text{ name, sex)}$. The relation $\text{enroll(}\underline{\text{studId}}, \underline{\text{ courseId}})$ gives which ... in which a proper subset of female students are enrolled. Courses in which only male students are enrolled. None of the above
answered
Apr 7
in
Databases

1.6k
views
gate2007
databases
relationalalgebra
normal
+3
votes
25
Average Access time in Memory Organization
answered
Apr 5
in
CO & Architecture

888
views
cachememory
co&architecture
fault
+4
votes
26
c language
#include <stdio.h> int main() { int a = 1; int b = 1; int c = a  b; printf("%d %d",c,b); } Answer is given 1, 1 but i m having doubt in logical OR operator and uninary operator .uni operator having higher precedence then so we firstly decrement the 'b' and then perform OR by which i got output 1,0 where i m wrong plz explain.
answered
Apr 4
in
Programming

73
views
+2
votes
27
Peter Linz Exercise 8.1
#8 Determine whether or not the following languages are contextfree (a) L= { anwwRan : n>=0 , w ∈ {a,b}* } (b) L = { anbjanbj : n>=0, j>=0 } (c) L = { anbjajbn : n>=0, j>=0 } (d) L= { anbjakbl : n+j<=k+l } (e) L ... nb(w)=2nc(w) } My answers are : (a)CFL (b)Not CFL (c)CFL (d) CFL (e)Not CFL (f)Not CFL (g) Not CFL Please verify.
answered
Apr 3
in
Theory of Computation

83
views
theoryofcomputation
contextfreelanguage
+3
votes
28
GATE2017154
A cache memory unit with capacity of $N$ words and block size of $B$ words is to be designed. If it is designed as a direct mapped cache, the length of the TAG field is 10 bits. If the cache unit is now designed as a 16way setassociative cache, the length of the TAG field is ____________ bits.
answered
Apr 3
in
CO & Architecture

2k
views
gate20171
co&architecture
cachememory
normal
numericalanswers
+4
votes
29
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

102
views
isro2016ece
digitallogic
+5
votes
30
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

1.1k
views
gate20172
theoryofcomputation
finiteautomata
+6
votes
31
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

1k
views
gate20172
theoryofcomputation
decidability
+5
votes
32
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

1.3k
views
gate20172
co&architecture
cachememory
numericalanswers
+3
votes
33
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

833
views
gate20172
theoryofcomputation
contextfreelanguage
+1
vote
34
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

1.1k
views
gate20172
numericalability
probability
+12
votes
35
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

1.3k
views
theoryofcomputation
gate20172
finiteautomata
numericalanswers
+19
votes
36
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

1k
views
gate20172
discretemathematics
lattice
numericalanswers
+2
votes
37
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

1.1k
views
gate20172
programminginc
numericalanswers
+10
votes
38
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

963
views
gate20172
digitallogic
hammingcode
+2
votes
39
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

913
views
gate20172
programminginc
Page:
1
2
3
4
5
6
...
15
next »
24,796
questions
31,866
answers
73,707
comments
30,011
users