The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Questions by dhairya
User dhairya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User dhairya
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
0
answers
1
GATE CS2008
(P + Q’) (PQ’ + PR) (P'Q’+PR) (P’R’ + Q’) simplifies to (A) PQ’ (B) PQ’+ R (C) PR’ (D) PR’ + Q
asked
Dec 4, 2016
in
Mathematical Logic

126
views
+1
vote
1
answer
2
GATE EC2006
A probability density function density function is of form P(x)= k e ^(a x) , the value of k is A)0.5 B)1 C) 0.5 a D) a
asked
Nov 8, 2016
in
Probability

324
views
+1
vote
1
answer
3
Is 1.02e+4 is a token in C program...??
asked
Aug 28, 2016
in
Compiler Design

136
views
+1
vote
1
answer
4
Which phase of compiler will give error ?
a = b + " cde " ; Which phase of compiler will give error ?
asked
Aug 14, 2016

108
views
+2
votes
1
answer
5
First and follow
S> AB / Ɛ A> AC / 0C B>0S C>1 What is the first (A)..??
asked
Aug 13, 2016
in
Compiler Design

355
views
compilerdesign
parsing
firstfollow
+3
votes
1
answer
6
First and follow
Find first and follow... S→ABa / bCA A→cBCD / є B→CdA / ad C→eC / є D→bsf / a
asked
Aug 3, 2016
in
Compiler Design

2k
views
+1
vote
1
answer
7
Database
Consider 3 relation R(A, B, C) WITH 20 TUPLES and S(A,D , E) With 30 tuples and T(D,F,G ) with 40 tuples. What is the max no. of tuples in natural joint of R S T Plz explain
asked
Jul 27, 2016
in
Databases

199
views
0
votes
4
answers
8
What Value Function Return ?
Consider the following C function: int f(int n) { static int r = 0; If (n < = 0) return 1; If (n > 3) { r = n; return f (n – 2) + 2; } return f(n – 1) + r; } What is the value of f(5)? (A) 3 (B) 7 (C) 9 (D) 18
asked
Jul 12, 2016
in
Programming

812
views
programminginc
functions
+1
vote
3
answers
9
DS
Let S be a stack of size n ≥ 1. Starting with the empty stack, suppose we Push the first n natural numbers in sequence, and then perform n Pop operations. Assume that Push and POP operations take X seconds each, and Y seconds elapse between the end of one such stack operation and the start of the next operation ... an element of this stack is (A) n(X + Y) (B) 3Y + 2X (C) N(X + Y)  X (D) Y + 2X
asked
Jul 12, 2016
in
Programming

404
views
0
votes
1
answer
10
Queue
A circularly linked list is used to represent a Queue. A single variable pp is used to access the Queue. To which node should pp point such that both the operations are EnQueue and DeQueue enQueue deQueue can be performed in constant time? rear node front node not possible with a single pointer node next to front What does "constant time" means...(last words of the question).?
asked
Jul 10, 2016
in
DS

581
views
0
votes
1
answer
11
plzz tel me...from where should I start my preparation of algorithm..
asked
Jun 28, 2016
in
Algorithms

234
views
0
votes
0
answers
12
ER Diagram
Consider the following ER diagram: If A has 100 entities, B has 1000 entities, and C has 10 entities, what is the maximum number of triples of entities that could be in the relationship set for R?
asked
Jun 26, 2016
in
Databases

138
views
0
votes
2
answers
13
3NF
Consider the following F.D. ab > cd ; e>c ; b>ef Which options show the relations normalized to 3NF of R(A,B,C,D,E,F) 1) R(A,B,C,D) , R(C,E) , R(E,F,B) 2) R(A,B,D) , R(E,C) , R(B,E,F) 3) R(A,B,C,D) , R(C,E) , R(B,E,F) 4) R(A,B,C,D,E,F) , R(E,C) , R(B,E,F) Ans is C
asked
Jun 24, 2016
in
Databases

606
views
0
votes
0
answers
14
BCNF
R(A,B,C,D) is a relation. Which of the following does not have a lossless join, dependency preserving BCNF decomposition? a)A>B, B>CD b)A>B, B>C, C>D c) AB>C, C>AD d)A >BCD Plz explain as well...!!!!
asked
Jun 23, 2016

425
views
0
votes
2
answers
15
super key / candidate key
R (A, B, C ,D ,E ) F={ A>B, BC> D, D>BC, B>E, B>A } Check whether BD is C.Key or S.key . Also find the candidate key.
asked
Jun 18, 2016
in
Databases

511
views
0
votes
3
answers
16
super key
R ( A, B, C, D) A & B are the candidate keys . what are the possible Super keys and there no ..??
asked
Jun 18, 2016
in
Databases

150
views
0
votes
3
answers
17
Super key
R (A, B, C) Functional dependency= { A > B, B > C , C > A } No of super keys are...??
asked
Jun 18, 2016
in
Databases

201
views
+2
votes
5
answers
18
candidate key
Q1) R(A1,A2,A3,..................An) having A1A2 as its candidate key. Find the no of super key..? Q2) R(A1,A2,A3,..................An) having A1 and A2 as its candidate key. Find the no of super key..?
asked
Jun 18, 2016
in
Databases

884
views
0
votes
1
answer
19
Find the cardinality..
Find the cardinality of  1) $\phi$ 2) { $\phi$} 3) { $\phi$ , { $\phi$} } 4) { $\phi$, { $\phi$} , { $\phi$, { $\phi$ } } }
asked
Jun 17, 2016
in
Set Theory & Algebra

130
views
+1
vote
1
answer
20
equality of sets
For 2 sets to be equal..is it necessary to have same no of elements as well..? ex A={1,2,3} B={1,1,3,3,2}.. Are they equal.?
asked
Jun 17, 2016
in
Set Theory & Algebra

105
views
0
votes
1
answer
21
tuple relation
consider the relation r1(P,Q,R) and r2(R,S,T) with primary key P and R respectively. r1 contain 2000 tuples and r2 2500 tuples. max size of natural joint of r1 and r2..? plz explain..
asked
Jun 16, 2016
in
Databases

337
views
0
votes
1
answer
22
for composite attribute we require an extra table..?
asked
Jun 3, 2016
in
Databases

68
views
0
votes
2
answers
23
ER diagram
if anyone got this then plz explain me as well..
asked
Jun 2, 2016
in
Databases

158
views
erdiagram
0
votes
1
answer
24
minimum no of tables..?
asked
Jun 2, 2016
in
Databases

118
views
0
votes
1
answer
25
design ER diagram of :
Each employee is assigned to a project work at only one location for that project, but can be at a different location for a different project. At a given location, an employee works on only one project. At a particular location, there can be many employees ... to a given project." and it is not mentioned that every project is held by a employee . Am i right..??
asked
Jun 2, 2016
in
Databases

50
views
0
votes
2
answers
26
how to find minimum no of table out of a given ER diagram..?
asked
Jun 2, 2016
in
Databases

498
views
0
votes
3
answers
27
train problem
Two, trains, one from Howrah to Patna and the other from Patna to Howrah, start simultaneously. After they meet, the trains reach their destinations after 9 hours and 16 hours respectively. The ratio of their speeds is ??
asked
May 28, 2016

1k
views
0
votes
1
answer
28
is anyone having pdf of korth ..dbms..??
asked
May 27, 2016
in
Others

179
views
+1
vote
2
answers
29
can 255.255.31.0 be a n/w mask..?
Can 255.255.31.0 be a n/w mask..? mask is cont. no of 1's and then no of 0's.. So in this case it is..11111111.11111111.00011111.00000000.. how come 1 has come in between ..? plz explain ..
asked
May 1, 2016
in
Computer Networks

321
views
0
votes
2
answers
30
An organization has class B n/w wishes to form subnet for 64 departments. The subnet mask will be.??
asked
Apr 28, 2016
in
Computer Networks

782
views
Page:
1
2
next »
50,737
questions
57,324
answers
198,415
comments
105,178
users