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 sudsho
User sudsho
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User sudsho
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
DatabaseNormalisation
Determine the highest normal for relation R(A,B,C,D) AB →C BC→D
answered
9 hours
ago
in
Databases

26
views
databasenormalization
functionaldependencies
partialdependency
1
answer
2
Lossy Join In database
Consider a schema R (A, B, C, D, E, F) and functional dependencies are A → B, C → D, B → E Which is divided into R, (A, B, E), R2 (C, D, E) then decomposition? (1) Dependency preserving and loss Join (2) Loss less join but not dependency preserving (3) Dependency preserving but not loss join (4) Not dependency preserving and not loss Join
answer selected
9 hours
ago
in
Databases

12
views
0
answers
3
derangements
In how many ways can the integers 1 through 5 be permuted such that no odd integers will be on it's natural position..??
closed
13 hours
ago
in
Mathematical Logic

7
views
1
answer
4
COMPILERS DOUBT
IS EVERY LL(1) GRAMMAR LALR(1)?? I DONT KNOW WHETHER ITS TRUE OR NOT? CAN SOMEONE EXPLAIN??
commented
14 hours
ago
in
Compiler Design

36
views
compilerdesign
1
answer
5
Minimum No of states in DFA
No. of states in the DFA accepting the following set of strings are: ( ( aa* + φ* )* (aa* + φ* ) + bb* + φ* φ + φ* )* Quite confusing to me. Share your approach!
answered
15 hours
ago
in
Theory of Computation

72
views
theoryofcomputation
minimalstateautomata
dfa
theoryofcomputation_
finiteautomata
1
answer
6
testbook test series
commented
20 hours
ago
in
Operating System

138
views
diskscheduling
1
answer
7
L = { 0n+m 1n+m 0m  n, m >= 0 } CSL or RE?
commented
21 hours
ago
in
Theory of Computation

46
views
theoryofcomputation
csl
contextsensitive
recursiverecursivelyenumerable
1
answer
8
Flow control
packet number 7 will always be lost, right?
commented
1 day
ago
in
Computer Networks

69
views
testbook
computernetworks
1
answer
9
MADE EASY TEST SERIES
Suppose we used a hash function H(n) to hash ‘n’ distinct elements (keys) into an array T of length ‘m’. What is the expected number of colliding pairs of elements, if we used simple uniform hashing?
commented
1 day
ago
in
DS

44
views
hashing
6
answers
10
GATE20151_46
Consider a uniprocessor system executing three tasks $T_{1}, T_{2}$ and $T_{3}$ each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 ... millisecond and task preemptions are allowed, the first instance of $T_{3}$ completes its execution at the end of_____________________milliseconds.
commented
1 day
ago
in
Operating System

1.7k
views
gate20151
operatingsystem
processschedule
normal
numericalanswers
2
answers
11
testbook
commented
1 day
ago
in
Digital Logic

178
views
testbook
testseries
digitallogic
1
answer
12
Testbook
packets are being transmitted using GB5 and here every 4th packet is lost.How many packets need to be transmitted to transmit 10 packets? my answr 18 given :20
commented
1 day
ago
in
Computer Networks

138
views
computernetworks
testbook
testseries
1
answer
13
IS WAITING TIME AND RESPONSE TIME BOTH ARE SAME ?
commented
1 day
ago
in
Operating System

56
views
1
answer
14
LL(k) grammars
1. LL(k) grammars have one to one correspondance with DCFL's 2. LR(k) grammars have one to one correspondance with CFL's Which of them is True and explain it bit clearly?
commented
2 days
ago
in
Compiler Design

326
views
theoryofcomputation
compilerdesign
grammar
ll1
0
answers
15
operating system ace
commented
2 days
ago
in
Operating System

31
views
4
answers
16
GATE199212b
Let the page reference and the working set window be $c\ c\ d\ b\ c\ e\ c\ e\ a\ d\ $ and $4$, respectively. The initial working set at time $t=0$ contains the pages $\{a,d,e\}$, where $a$ was referenced at time ... $t=2$. Determine the total number of page faults and he average number of page frames used by computing the working set at each reference.
commented
3 days
ago
in
Operating System

297
views
gate1992
operatingsystem
memorymanagement
normal
0
answers
17
Which of the following is CSL?
commented
3 days
ago
in
Theory of Computation

82
views
1
answer
18
Highest Normal Form
Consider the following functional dependencies on the relation $R(A,B,C,D,E)$ $\begin{align*} A\rightarrow BC \\BC\rightarrow AD \\D\rightarrow E \end{align*}$ Question 1 What is the heighest Normal Form the above ... 3 Justify the statement "If a relation to be in 3NF then NonPrime Attributes MUST NOT determine nonprime attributes"
commented
3 days
ago
in
Databases

27
views
databasenormalization
databases
1
answer
19
Made Easy Test Series
Why is option d wrong?
commented
3 days
ago
in
Theory of Computation

37
views
1
answer
20
Made Easy
Given relation R(A, B, C, D, E) and set of functional dependencies F = {AB → C, AB → D, D → A, BC → D, BC → E} What will be the highest normal form satisfied by R ? a. 1 NF b. 2 NF c. 3 NF d. BCNF
answered
3 days
ago
in
Databases

27
views
2
answers
21
#cn#routers
wat is minimum no of interface in router?
answered
3 days
ago
in
Computer Networks

76
views
1
answer
22
ravula test series
How many maximum number of representations can some number have in signed magnitude representation, given n bits are used?( Marks: 0.33 ) 2 Explanation: 0 (zero) has 2 representations in signed magnitude representation. 1 2n n
answered
3 days
ago
in
Digital Logic

41
views
1
answer
23
Time complexity of fractionak knapsack using greedy algorithm is O(n^2)??TRUE/FALSE
commented
5 days
ago
in
Algorithms

51
views
greedyalgorithm
algorithms
1
answer
24
GeeksForGeeks Test 2017
I belived, 2nd option is correct but GeeksforGeeks anwered it as (iv), how?
commented
5 days
ago
in
Theory of Computation

70
views
theoryofcomputation
contextsensitive
1
answer
25
Ravulla Os Test  1 Question 13
commented
5 days
ago
in
Operating System

52
views
ravulatestseries
testseries
operatingsystem
1
answer
26
Parsing
Why in this I6 and I7 are not in same state??
commented
6 days
ago
in
Compiler Design

36
views
0
answers
27
NUMBER SYSTEM FLOATING POINT
IN FLOATING POINT REPRESENTATION WE KNOW THAT BIAS ADDED IS THE MAXIMUM NUMBER WHICH CAN BE REPRESENTED IN 2S COMPLEMENT. Suppose exponent is represented using 8 bits, so bias added= (2^7)1=127. But the max negative number ... do we get postitive exponent by biassing in this case??. It sounds confusing to me. Plz resolve my confusion.
commented
6 days
ago
in
Digital Logic

42
views
floatingpointrepresentation
digitallogic
numberrepresentation
1
answer
28
TOC: DCFL Closed under equivalence property
commented
6 days
ago
in
Theory of Computation

181
views
theoryofcomputation
dcfl
closureproperty
decidability
1
answer
29
testbook
commented
6 days
ago
in
Theory of Computation

50
views
testbook
testseries
theoryofcomputation
0
answers
30
Few Doubts in CN
1. Througput = data size/ TT + 2PT or data size/ 2PT.?? 2. What are the minimum number of interfaces required in a router? 3. Why we have a separate flow control at TCP layer when we already have it in DLL? 4. What is the ... last bit in first octet is 1, then it is multicasting orelse unicast. But mac address is fixed, so, how can we say this?
commented
6 days
ago
in
Computer Networks

44
views
computernetworks
2
answers
31
How Q1 and Q2 are Equal ?
Please Explain How Q1 and Q2 are equal using state Minimization Technique State Equivalance Algorithm Table Filling Algorithm a b Q1 Q2 Q1 Q2 Q1 Q2
commented
Jan 9
in
Theory of Computation

65
views
theoryofcomputation
0
answers
32
Ace test series
closed
Jan 9
in
Computer Networks

15
views
2
answers
33
What we should consider NFA or DFA while they ask 'Finite Autpmata' in question?
answered
Jan 9
in
Theory of Computation

27
views
general
finiteautomata
9
answers
34
GATE200767, ISRO201672
The address of a class B host is to be split into subnets with a 6bit subnet number. What is the maximum number of subnets and the maximum number of hosts in each subnet? 62 subnets and 262142 hosts. 64 subnets and 262142 hosts. 62 subnets and 1022 hosts. 64 subnets and 1024 hosts.
answer edited
Jan 9
in
Computer Networks

2.1k
views
gate2007
computernetworks
subnetting
easy
isro2016
2
answers
35
How to convert a Decimal Number to IEEE754 Representation ?
answered
Jan 9
in
CO & Architecture

98
views
floatingpointrepresentation
ieeerepresentation
2
answers
36
SDT evaluation
$\begin{align*} &E\rightarrow E+E \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\large + \;\; } \text{E}_2\text{.val}}} \\ &E\rightarrow E*E \; \qquad {\color{red}{\text{E.val} = \text{E}_1\text{.val} { \;\;\ ... \left ( 3*3 \right )+\left ( 3*5 \right )  6 \right ]+7}} \quad \text{is evaluated using above SDT ?} \\ \end{align*}$
comment edited
Jan 9
in
Compiler Design

155
views
madeeasy_testseries
syntaxdirectedtranslation
1
answer
37
DBMS: Number of Super Keys
30 is given answer, please provide detialed explanation.
answer selected
Jan 8
in
Databases

73
views
databases
functionaldependencies
1
answer
38
CNTCP Congestion control
Consider the effect of using slow start on a line with propagation delay of 10ms.The receive window is 24KB and the maximum segment size is 2KB.How long does it take to send full window size segment in ms initial threshold of 20KB? My ans is 2  4  8  16 ... 24  Thus 8 RTT's= 160ms Given ans is 2  4  8  16  20  24  Thus 6 RTT's =120ms
answered
Jan 6
in
Computer Networks

54
views
computernetworks
congestioncontrol
tcp
3
answers
39
GATE 2016150
Consider the following proposed solution for the critical section problem. There are $n$ processes : $P_0....P_{n1}$. In the code, function $\text{pmax}$ returns an integer not smaller than any of its arguments .For ... the critical section at any time The bounded wait condition is satisfied The progress condition is satisfied It cannot cause a deadlock
comment edited
Jan 6
in
Operating System

3.3k
views
gate20161
operatingsystem
resourceallocation
difficult
ambiguous
1
answer
40
Digital imp..
What is the initial input to $D$? Is it $0$? How to DO?
answered
Jan 6
in
Digital Logic

16
views
digitallogic
18,898
questions
23,865
answers
51,932
comments
20,186
users