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
Chat
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 Sanjay Sharma
User Sanjay Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Sanjay Sharma
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
# DBMS #Normalization
IF a relation R(A,B,C,D,E) where AB is the key and ADE>C so is this in 2NF or not? Do Partial dependency exist??? because C is derived from ADE (A is part of key AB)
commented
7 hours
ago
in
Databases

35
views
databases
databasenormalization
1
answer
2
DBMS Normalisation
Consider a schema R(A, B, C, D) and functional dependencies {AB → C, C → D, D→ A}. Then the decomposition of R into R1 (CD), R2 (AC) and R3 (BC) is in a. 1NF but not 2NF b. 2NF but not 3NF c. 3NF but not BCNF d. BCNF
commented
1 day
ago
in
Databases

54
views
databases
decomposition
databasenormalization
1
answer
3
# gate cse 1998 2 marks
Plz explain the answer of ques no. 4 a) 2NF b) 3NF
answer selected
1 day
ago
in
Databases

43
views
databases
databasenormalization
0
answers
4
UGC Net Query
The query may sound trivial but (my bad) I have no knowledge about such exam. I am not much aware about UGCNET exam for Computer Science and came to come about such an exam recently. I wanted to know, What is the eligibility of this ... career prospects ? What is the score validity? What is the max age limit ? Anything else that would be useful to know.
comment edited
1 day
ago
in
CBSE/UGC NET

18
views
netexam
1
answer
5
peter linz excercise
Which of the following languages are regular 1)L= wwR v : v,w belongs to {a,b}+ 2)L=uwwR v : u,v,w belongs to {a,b}+ 3)L=uwwR v : u,v,w belongs to {a,b}+ .u >= v
asked
2 days
ago
in
Theory of Computation

20
views
0
answers
6
peter linz excercise
commented
3 days
ago
in
Theory of Computation

39
views
0
answers
7
decomposition is lossy or lossless
edited
3 days
ago
in
Databases

72
views
3
answers
8
ISRO201468
What is the minimum number of resources required to ensure that deadlock will never occur, if there are currently three processes $P_1, P_2$ and $P_3$ running in a system whose maximum demand for the resources of same type are 3, 4, and 5 respectively. 3 7 9 10
commented
3 days
ago
in
Operating System

530
views
isro2014
operatingsystem
resourceallocation
1
answer
9
UGCNETJune2014III16
Software testing is the process of establishing that errors are not present the process of establishing confidence that a program does what it is supposed to do the process of executing a program to show that it is working as per specifications the process of executing a program with the intent of finding errors
answered
6 days
ago
in
Others

38
views
ugcnetjune2014iii
1
answer
10
UGCNETJune2016III62
Consider the following statements: Revised simplex method requires lesser computations than the simplex methods Revised simplex method automatically generates the inverse of the current basis matrix Less number of entries are needed in each table of the revised simplex ... statements is true? a and b only a and c only b and c only a, b, and c
answered
6 days
ago
in
Others

91
views
ugcnetjune2016iii
1
answer
11
UGCNETJune2016III63
The following transportation problem A B C Supply I 50 30 220 1 II 90 45 170 3 III 250 200 50 4 Demand 4 2 2 0 Has a solution A B C I 1 II 3 0 III 2 2 The above solution of a given transportation problem is Infeasible solution optimum solution nonoptimum solution unbounded solution
commented
6 days
ago
in
Others

123
views
ugcnetjune2016iii
2
answers
12
UGCNETJune2015III68
Consider the following transportation problem: The initial basic feasible solution of the above transportation problem using Vogel's Approximation method (VAM) is given below: The solution of the above problem: is degenerate solution is optimum solution needs to improve is infeasible solution
answer selected
6 days
ago
in
Others

297
views
ugcnetjune2015iii
1
answer
13
UGCNETDec2015III54
Consider the following transportation problem: The transportation cost in the inital basic feasible solution of the above transportation problem using Vogel's Approximation method is 1450 1465 1480 1520
commented
6 days
ago
in
Others

156
views
ugcnetdec2015iii
2
answers
14
Number of productions to derive a string of length x
answer selected
Apr 18
in
Theory of Computation

46
views
1
answer
15
segmentation and paging
commented
Apr 16
in
Operating System

80
views
3
answers
16
The intersection of a context free language and a regular language
asked
Apr 16
in
Theory of Computation

104
views
1
answer
17
Probability
in a game of bridge the entire deck of 52 cards is dealt out to 4 players.What is the probability that i)one of the players receive all 13 spades ii )each player receives one ace?
answered
Apr 16
in
Probability

58
views
probability
engineeringmathematics
2
answers
18
DFA (timothy)
asked
Apr 15
in
Theory of Computation

26
views
1
answer
19
Let P,Q,R be 3 languages
Let P,Q,R be 3 languages. If P and R are regular and if PQ=R, then a)Q has to be regular b)Q can not be regular c)Q need not be regular d)Q has to be CFL
answer selected
Apr 15
in
Theory of Computation

24
views
0
answers
20
which of the following is not primitive recursive but computable
asked
Apr 15
in
Others

9
views
0
answers
21
Timothy excercise
asked
Apr 15
in
Theory of Computation

41
views
2
answers
22
ISI 2015 PCB C4 B
Draw a 4state DFA for the language $L \subseteq$ {a,b}* , L = {x : the number of time ab appears in x is even}
commented
Apr 15
in
Theory of Computation

61
views
theoryofcomputation
isi2015
finiteautomata
dfa
1
answer
23
Timothy Williams Question
The machine pictured in fig a)complements a given bit pattern b)finds 2's complement c)increments a given bit pattern by 1 d)changes the sign bit
asked
Apr 15
in
Theory of Computation

60
views
1
answer
24
UGCNETJune2016III22
The symmetric differences of two sets $S_1$ and $S_2$ is defined as: $S_1 \oplus S_2 =\{x \mid x \in S_1 \text{ or } x \in S_2, \text{ but x is not in both } S_1 \text{ and } S_2 \}$ The ... of regular languages are closed under both symmetric difference and nor The family of regular languages are not closed under both symmetric difference and nor
answer selected
Apr 14
in
Others

94
views
ugcnetjune2016iii
2
answers
25
Peter line 2.1
Construct the DFA for all string with at least one a and exactly two b
answer selected
Apr 13
in
Theory of Computation

41
views
1
answer
26
UGCNETDec2015III23
Match the following: ListI ListII a. $\{a^n b^n \mid n > 0\}$ is a deterministic context free language i. but not recursive language b. The complement of $\{a^n b^n a^n \mid n>0\}$ is a context free language ii. but not context free language c. $\{a^nb^na ... , ciii, div ai, bii, civ, diii aiv, biii, cii, di aiv, biii, ci, dii
commented
Apr 13
in
Theory of Computation

81
views
ugcnetdec2015iii
theoryofcomputation
1
answer
27
#ugc2016 #question 56
Let L = {0n1n  n≥0} be a context free language. Which of the following is correct? (A) L' is context free and Lk is not context free for any k≥1 (B) L' is not context free and Lk is context free for any k≥1 (C) Both L' and Lk ... D) Both L' and Lk is for any k≥1 are not context free. Official answer given by UGC is C . according to me answer is B
answered
Apr 13
in
Theory of Computation

42
views
theoryofcomputation
ugcnetjul2016iii
1
answer
28
UGCNETJune2015III71
Let A and B be two fuzzy integers defined as: A={(1.0.3), (2, 0.6), (3, 1), (4, 0.7), (5, 0.2)} B={(10, 0.5), (11, 1), (12, 0.5)} Using fuzzy arithmetic operation given by $\mu_{A+B^{(Z)}} = \underset{x+y=z}{\oplus} (\mu_A (x) \otimes \mu_B(y))$ $f(A+B ... 0.5), (17, 0.2)} {(11, 0.3), (12, 0.5), (13, 0.6), (14, 1), (15, 0.7), (16, 0.5), (17, 0.2)}
answer edited
Apr 13
in
Others

163
views
ugcnetjune2015iii
1
answer
29
UGCNETDec2014III71
A ________ point of a fuzzy set $A$ is a point $x \in X$ at which $\mu_{A} (x) = 0.5$ Core Support Crossover $\alpha$cut
answer edited
Apr 10
in
Others

52
views
ugcnetdec2014iii
1
answer
30
UGCNETJune2016III24
Consider the following two languages: $L_1=\{0^i1^j \mid ged (i,j)=1 \}$ $L_2$ is any subset of 0* Which of the following is correct? $L_1$ is regular and $L_2*$ is not regular $L_1$ is not regular and $L_2*$ is regular Both $L_1$ and $L_2*$ are regular languages Both $L_1$ and $L_2*$ are not regular languages
answer selected
Apr 10
in
Theory of Computation

74
views
ugcnetjune2016iii
1
answer
31
Can FCFS give less avg waiting time than SJF
answer selected
Apr 8
in
Operating System

46
views
3
answers
32
Gate math book
Find the sum of n terms of the series $log a+ log \frac{a^{2}}{b} + log \frac{a^{3}}{b^{2}}+ ...$ to n terms
answer selected
Apr 8
in
Mathematical Logic

56
views
engineeringmathematics
1
answer
33
#Doubt ClassFull Addressing
When we already have classFull Addressing Scheme in which we divided the IP addresses into Class A , Classs B , Class C , Class D and Class E then what was limitation in this that we need to introduce ClassLess ... Can anyone tell please what happens in ClassLess IP addressing scheme and what was drawback that classless came from classfull.
commented
Apr 7
in
Computer Networks

58
views
computernetworks
ipaddress
1
answer
34
GATE2006IT83
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until ... spent on crashing so that ALL paths are critical are, respectively. 100 and 1000 100 and 1200 150 and 1200 200 and 2000
answer selected
Apr 7
in
IS&Software Engineering

158
views
gate2006it
is&softwareengg
projectcost
normal
nongate
1
answer
35
GATE2007IT52
Given the following algorithm for sorting an array X and N numbers: SUBROUTINE SHORT (X, N) IF (N < 2) RETURN FOR (i = 2) TO N INCREMENT BY 1) FOR (j = 1) TO i INCREMENT BY 1) IF (X [i] > X [j]) CONTINUE TEMP = X[i] X[i] = X[j] X[j] = TEMP END FOR END SUBROUTINE A good approximation of Halstead`s estimated program length is 20 50 80 110
answer selected
Apr 6
in
IS&Software Engineering

109
views
gate2007it
is&softwareengg
halsteadsmethod
normal
outofsyllabusnow
2
answers
36
GATE2006IT82
A software project has four phases P1, P2, P3 and P4. Of these phases, P1 Is the first one and needs to be completed before any other phase can commence. Phases P2 and P3 can be executed in parallel. Phase P4 cannot commence until both P2 and P3 are completed. ... of P2 are, respectively, P1P2P4, 1 day P1P3P4, 1 day P1P3P4, 2 days P1P2P4, 2 days
answer selected
Apr 6
in
IS&Software Engineering

137
views
gate2006it
is&softwareengg
normal
nongate
2
answers
37
GATE2014118
Match the following: 1) Waterfall model a) Specifications can be developed incrementally 2) Evolutionary model b) Requirements compromises are inevitable 3) Componentbased software engineering c) Explicit recognition of risk 4) Spiral development d) Inflexible partitioning of the project into stages 1a, ... 3b, 4c 1d, 2b, 3a, 4c 1c, 2a, 3b, 4d
answer selected
Apr 6
in
IS&Software Engineering

272
views
gate20141
is&softwareengg
normal
2
answers
38
GATE2007IT54
Consider the CPM activity chart where an arc connecting two milestones is labeled with a task identifier and the time taken in days. For example in order to go from A to B, task T1 takes 180 days. A dashed line depicts an additional dependency that is equivalent to a zero time ... T3, T8, T10 T1, T2, T3, T4, T5, T6, T7, T8, T9, T10 T1, T4, T5, T7, T8, T10
answer selected
Apr 6
in
IS&Software Engineering

128
views
gate2007it
is&softwareengg
criticalpath
normal
nongate
2
answers
39
GATE2004IT68
A software project involves execution of 5 tasks T1, T2, T3, T4 and T5 of duration 10, 15, 18, 30 and 40 days, respectively. T2 and T4 can start only after T1 completes. T3 can start after T2 completes. T5 can start only after both T3 and T4 complete. What is the slack time of the task T3 in days? 0 3 18 30
answer selected
Apr 6
in
IS&Software Engineering

409
views
gate2004it
is&softwareengg
softwaretimeestimation
normal
1
answer
40
GATE2007IT51
The following table shows the time between failures for a software system. Error Number 1 2 3 4 5 Time since last failure(hours) 6 4 8 5 6 The reliability of the system for one hour of operation assuming an exponential model is : 0.45 0.63 0.84 0.95
answer selected
Apr 6
in
IS&Software Engineering

352
views
gate2007it
is&softwareengg
softwarereliability
normal
outofsyllabusnow
22,147
questions
28,138
answers
63,516
comments
24,290
users