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 just_bhavana
User just_bhavana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User just_bhavana
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
2
answers
1
Selfdoubt
Which of the following is exact recurrence relation for binary search (in terms of number of comparisons) ? 1. T(n) = 2T(n/2) + 1 2. T(n) = 2T(n/2) + 2 Please specify relevant reasons.
edited
10 hours
ago
in
Algorithms

45
views
binarysearch
1
answer
2
binary tree
If a binary tree contains 1056 nodes the what is the height of binary tree??
commented
2 days
ago
in
DS

40
views
binarytree
1
answer
3
Circular Queue
a)a_cb_ b)_abc_ c)abc_ _ d)_ab_c
answered
2 days
ago
in
Programming

29
views
datastructure
circularqueue
queues
1
answer
4
made easy work book
the head of a movin disk with 100 tracks numbered 0 to 99 is serving a request at track 'x' if the requests of track 25, 76, 43,10,67 are served using fifo algo. then head movements are 194 the track 'x' initially served was.?
commented
2 days
ago
in
Operating System

20
views
disks
diskscheduling
2
answers
5
BCNF3NF
Consider the following statements. If relation R is in 3NF and every key is simple, then R is in BCNF If relation R is in 3NF and R has only one key, then R is in BCNF Both 1 and 2 are true 1 is true but 2 is false 1 is false and 2 is true Both 1 and 2 are false
commented
3 days
ago
in
Databases

87
views
1
answer
6
Dennis Ritchie doubt pg 49
As an illustration of some of the bit operators, consider the function getbits(x,p,n) that returns the (right adjusted) nbit field of x that begins at position p. We assume that bit position 0 is at the right end and that n and ... makes a mask with ones in the rightmost n bits. Can anyone please explain this to me?? What's happening here???
commented
4 days
ago
in
Programming

17
views
2
answers
7
Self_doubt
This is true that at every router the value of TTL is decremented by one but does that actually mean that other fields in the header are also recomputed?
commented
4 days
ago
in
Computer Networks

59
views
#networks
1
answer
8
String pointers
Assume object of int take 2 byte. What is output of above program.
commented
4 days
ago
in
Programming

25
views
0
answers
9
Block Nested Loop Join
Consider a relation R with 2000 records and relation S with 500 records. Size of each record is 5 Byte and block size is 100 Byte, then minimum number of block access that are needed block nested loop join. I think its answer should be 2525.
commented
4 days
ago
in
Databases

45
views
databases
naturaljoin
blocknestedloopjoin
0
answers
10
Geometry
two equal circles intersect at A and B and distance between their centres is 40 cm. Distance between A and B is 30 cm then find the radius of circle.
commented
4 days
ago
in
Study Resources

29
views
1
answer
11
Generate CFG
What will be the CFG when w$\in$(a,b)* where w contains at least 3 a's?
commented
4 days
ago
in
Theory of Computation

24
views
theoryofcomputation
contextfreelanguage
1
answer
12
Min DFA states?
Consider the regular language L=(00+0000)* . The minimum number of states in any DFA accepting this languages is?
commented
5 days
ago
in
Theory of Computation

49
views
dfa
theoryofcomputation
minimalstateautomata
finiteautomata
1
answer
13
number of comparison
how many comparison are needed to locate the maximum and minimum in a sequence with 128 elements?
commented
5 days
ago
in
Mathematical Logic

19
views
2
answers
14
Cn: Optimal windows size
The round trip delay between x and y is given as 60 ms and bandwidth of link between X and Y is 512 KBps. What is the optimal window size (in packets) if the packet size is 64 bytes and channel is full duplex
commented
5 days
ago
in
Computer Networks

108
views
computernetworks
slidingwindow
1
answer
15
CN: CRC Rules
From forouzan : If the generator has more than one term and coefficient of x^0 is 1 then all single bit error can be caught. So if e(x)=x^i // means some power of 2 number g(x) = at least two terms and coefficient of x^0 is always 1, means some odd number. So is it saying that the number some 2^i will never be divisible by odd number?
answered
5 days
ago
in
Computer Networks

13
views
computernetworks
crcpolynomial
0
answers
16
Mott Kandel Baker Ex. 1.7 Q. 23
asked
5 days
ago
in
Mathematical Logic

14
views
pigeonholeprinciple
0
answers
17
Directed graph
how to calculate number of directed graphs possible having n vertices?
commented
5 days
ago
in
Graph Theory

48
views
directedgraph
0
answers
18
am i right ?
//////////////log x (base 3) = O ( ln (x) )
commented
6 days
ago
in
Algorithms

35
views
1
answer
19
CN Maximum sender window Size
In every sliding window protocol,the maximum sender window size is the number of frames that can be transferred by sender in RTT? Is this statement true?
comment edited
6 days
ago
in
Computer Networks

58
views
computernetworks
slidingwindow
2
answers
20
CN: TCP Window Size
Consider TCP congestion control. Assuming RTT as 4 seconds and segment size as 3KB, if bandwidth is 500kbps, what is the smallest window size for which there is no stalling in this case?
commented
6 days
ago
in
Computer Networks

61
views
computernetworks
tcp
1
answer
21
Optimal Merging .
The optimal time required in merging the list of size 11, 21, 33, 34,45,54,60 where merging of 2 lists takes O(m+n) time is I think the answer should be 692. But the answer given is 258.
commented
6 days
ago
in
Algorithms

65
views
algorithms
arrays
1
answer
22
PARSER
Is this statement true: If Grammar is unambiguous must be LL(1) if not LL(1) it does not mean ambiguous.
commented
Aug 16
in
Compiler Design

27
views
compilerdesign
grammar
parsing
1
answer
23
What will be the R.E of this DFA
commented
Aug 16
in
Theory of Computation

58
views
finiteautomata
regs
regularexpressions
1
answer
24
SET Maharashtra April 2017 Ques38 Paper II
answered
Aug 16
in
CO & Architecture

23
views
digitallogic
8
answers
25
GATE200957, ISRO201675
Frames of 1000 bits are sent over a $10^6$ bps duplex link between two hosts. The propagation time is 25ms. Frames are to be transmitted into this link to maximally pack them in transit (within the link). What is the minimum number of ... distinctly? Assume that no time gap needs to be given between transmission of two frames. I=2 I=3 I=4 I=5
commented
Aug 16
in
Computer Networks

4.8k
views
gate2009
computernetworks
slidingwindow
normal
isro2016
2
answers
26
Cache Memory
Consider a 256KB direct mapped byte addressable cache. If one word is 4 bytes and each cache block contains 16 words , then determine the number of bits required for tag.(Assume that physical address of computer is 32 bits)
commented
Aug 15
in
CO & Architecture

74
views
1
answer
27
Toc Basics
Complement of (0+1)*1 ?? my answer is (0+11*0)* given answer is (1*0)* please give detail explanation!
commented
Aug 15
in
Theory of Computation

38
views
theoryofcomputation
finiteautomata
regularexpressions
1
answer
28
TOC BaSiCs
Please explain:
answered
Aug 15
in
Theory of Computation

23
views
theoryofcomputation
regularexpressions
finiteautomata
1
answer
29
INDEXING
Consider a disk with block size B=512 bytes. A block pointer is p=6 bytes long and a record pointer is R=7 bytes long. A file has 30,000 employee records of fixed length. Each record has 100 bytes. Assume that unspanned organization ... required to retrieve a record from the file using single level index and binary search? Please help me to find the answer...
answered
Aug 15
in
Databases

20
views
2
answers
30
ternary relationship
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?
commented
Aug 14
in
Databases

251
views
ternary
relationship
1
answer
31
array
How to get address for this ? As i understood till now that we have 90 (2 d array of 30*40) pls explain the concept of calcultaing address for this ?
commented
Aug 13
in
DS

71
views
arrays
datastructure
1
answer
32
TOCDFA
Design a NFA and DFA for the following :: 1) Accepting all substrings of the string abab. 2) Accepting all prefixes of the string abab. 3) Accepting all suffixes of the string abab.
answered
Aug 12
in
Theory of Computation

42
views
theoryofcomputation
finiteautomata
dfa
1
answer
33
cache
Suppose that in 1000 memory references there are 150 misses in first level and 100 miss in second level cache. Assume that miss penalty from L2 cache to memory is 120 cycles. The hit time of L2 cache is 50 cycles. If there are 4 memory references per instruction, the average stall per instruction is _________. (ans given:78 )
commented
Aug 12
in
CO & Architecture

25
views
1
answer
34
2's compliment
The Decimal equivalent of 2’s complement representation of 8 bit integer is most positive when except _________ (A) MSB are zeros (B) LSB are zeros (C) MSB are ones (D) LSB are ones
answered
Aug 12
in
Digital Logic

33
views
2
answers
35
number system
A number system with base 99 will have X different digits and range from 0 to Y. then appropriate value of X and Y is; a) 100 and 9 b) 99 and 98 c) 98 and 99 d) 99 and 100
answered
Aug 11
in
Digital Logic

29
views
3
answers
36
TOC Naive Doubt
I'm so confused what happens when you concatenate/MUL Epsilon ε with any input symbol? What is ε.a = ? and what is ε.0 = ? what is ε.1= ?
commented
Aug 11
in
Theory of Computation

67
views
theoryofcomputation
finiteautomata
regularexpressions
2
answers
37
TOC Question
Sorry my BAD, it's an infinite language! The given set {1, 101, 11011,1110111,......} is a Regular Language or CFL?
commented
Aug 10
in
Theory of Computation

81
views
theoryofcomputation
finiteautomata
2
answers
38
Demand paging
answered
Aug 9
in
Operating System

49
views
1
answer
39
Computer Networks Supernetting
If I need to have a network of 509 hosts using class C,then do i need to join 2 Class c networks or 3? One class C gives us 2562=254 hosts in case of subnetting.Does the same hold in case of super netting also?Or does in super netting one class c can give 256 hosts?
answer edited
Aug 9
in
Computer Networks

35
views
computernetworks
network
1
answer
40
Discrete mathematics example 13 Kenneth rosen
comment edited
Aug 9
in
Mathematical Logic

53
views
25,071
questions
32,223
answers
75,102
comments
30,232
users