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 Gabbar
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Gabbar
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Virtual Gate (Network)
Consider data frames consisting of 20 header and 1980 data bits. Assume headers and retransmissions are overhead, ACK frames are negligible and NAK frames are 20 bits. The error rate for data frames is 2 percent and the error rate for NAK frames is ... Compute the fraction of the bandwidth that is wasted on overhead. (A) 2% (B) 98% (C) 97% (D) 3%
answered
Jan 25
in
Computer Networks

30
views
virtualgate
computernetworks
virtualgate
+2
votes
2
Testbook CN question
A 2kmlong, 10Mbps CSMA/CD LAN (not 802.3) has a propagation speed of 200 m/microsec. Repeaters are not allowed in this system. Data frames are 512 bits long, including 32 bits of header, checksum, and ... The effective data rate is _____________________ Mbps (correct to 2 decimal places), excluding overhead, assuming that there are no collisions?
answered
Jan 19
in
Computer Networks

160
views
testbook
computernetworks
csmacd
effectivedatarate
+6
votes
3
GATE2008IT24
The exponent of 11 in the prime factorization of 300! is 27 28 29 30
answered
Jan 18
in
Combinatory

652
views
gate2008it
combinatory
normal
+1
vote
4
Btree Insertion
An order 3 Btree is an index tree where every node other than root has at most 2 keys and at least one key. Starting with an empty tree if following keys are inserted into the tree 1,2,3,4,5,6,7,8,9,10. (not necessarily in the given order.) What would be the minimum number of node splits possible, if node splitting algorithm is used?
answered
Jan 18
in
Databases

48
views
dbms
btree
+2
votes
5
digital logic
answered
Jan 17
in
Digital Logic

59
views
digitallogic
+4
votes
6
multilevel paging
can some one provide me procedure to solve this que?
answered
Jan 13
in
Operating System

102
views
+1
vote
7
hoe many different choices for classes does we have? ________
answered
Jan 13
in
Combinatory

109
views
combinations
permutation
+1
vote
8
Binary Search tree
Consider an array with ‘n’ numbers, let “T” be time complexity for finding a number appeared maximum number of times in an array. Using Binary Search Tree data structure the T will be A. O(log n) B. O(n) C. O(n logn) D. O(n2)
answered
Jan 12
in
Algorithms

154
views
algorithms
binarysearchtree
datastructure
bst
0
votes
9
Deadlocks
Consider a system with processes P0, P1,P2, . . . . P99, P100, each process requires maximum of 4 resources. System has allocated 2 resources to each process. The minimum number of resources should release such that above system is deadlock free is _____
answered
Jan 12
in
Operating System

82
views
resourceallocation
operatingsystem
+2
votes
10
Peter linz, chapter 7 exercises
answered
Jan 10
in
Theory of Computation

39
views
+2
votes
11
GATE20006
Let $S$ be a set of $n$ elements $\left\{1, 2,....., n\right\}$ and $G$ a graph with 2$^{n}$ vertices, each vertex corresponding to a distinct subset of $S$. Two vertices are adjacent iff the symmetric difference of the ... Every vertex in $G$ has the same degree. What is the degree of a vertex in $G$? How many connected components does $G$ have?
answered
Jan 6
in
Set Theory & Algebra

337
views
gate2000
settheory&algebra
normal
descriptive
+3
votes
12
GATE200424
Consider the binary relation: $S= \left\{\left(x, y\right) \mid y=x+1 \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$ The reflexive transitive closure is $S$ is $\left\{\left(x, y\right) \mid y >x \text{ and } x, y \in \left\{0, 1, 2\right ... } \right\}$ $\left\{\left(x, y\right) \mid y \leq x \text{ and } x, y \in \left\{0, 1, 2\right\} \right\}$
answered
Jan 6
in
Set Theory & Algebra

300
views
gate2004
settheory&algebra
easy
+1
vote
13
TIFR2014MathsB4
Let $H_{1}$, $H_{2}$ be two distinct subgroups of a finite group $G$, each of order $2$. Let $H$ be the smallest subgroup containing $H_{1}$ and $H_{2}$. Then the order of $H$ is Always 2 Always 4 Always 8 None of the above.
answered
Jan 3
in
Set Theory & Algebra

130
views
tifrmaths2014
settheory&algebra
groups
+2
votes
14
CO Cache Memory Access
In a certain system the main memory access time is 100 ns. The cache is 10 time faster than the main memory and uses the write though protocol. If the hit ratio for read request is 0.92 and 85% of the memory requests generated by the ... the average time consideration both read and write requests is a) 28.95ns b) 348.47ns c) 29.62ns d) 296.2ns
answered
Jan 3
in
CO & Architecture

67
views
cachememory
co&architecture
#computerorganisationandarchitecture
+2
votes
15
me test
Which of the following statements about Link State Protocol (LSP) is/are true? S1 : If LSP data is less recent than the data stored in database, then the new LSP packet is updated with data stored in database and is flooded to channels. S2 : If LSP data is not ... all interfaces but not to the one on which it was received a. Only S1 b. Only S2 c. Both. d. N.o.t
answered
Dec 21, 2016
in
Computer Networks

74
views
+2
votes
16
find the output
#include<stdio.h> int main() { int m[6] = {15, 11, 25, 30, 35, 45}; int p, q, r; p = ++m[1]; q = m[1]++; r = m[p++]; printf("%d, %d, %d", p, q, r); return 0; }
answered
Dec 20, 2016
in
Programming

61
views
programminginc
datastructure
+2
votes
17
William Stalling cache memory  4.21
answered
Dec 19, 2016
in
CO & Architecture

53
views
co&architecture
cachememory
+1
vote
18
[Programming/Min heap] Test Series
answered
Dec 19, 2016
in
Programming

88
views
testseries
algorithms
programminginc
+2
votes
19
GATE1998_22
An identifier in a programming language consists of up to six letters and digits of which the first character must be a letter. Derive a regular expression for the identifier. Build an LL(1) parsing table for the language defined by the LL(1) grammar with ... end}$ $X \rightarrow d \text{ semi } X \mid sY$ $Y \rightarrow \text{ semi } s Y \mid \epsilon$
answered
Dec 18, 2016
in
Compiler Design

247
views
gate1998
compilerdesign
parsing
descriptive
+2
votes
20
Let A, B, C be recognizable languages over an alphabet Σ,
answered
Dec 18, 2016
in
Theory of Computation

90
views
theoryofcomputation
decidability
+2
votes
21
select and group by  navathe
a) every column that appears in group by clause must appear in select statement. b) every column that appears in select statement must appear in group by clause out of these two what is a valid argument?
answered
Dec 18, 2016
in
Databases

29
views
databases
+3
votes
22
ravula test
On a TCP connection, current congestion window size is Congestion Window = 8 KB. The window size advertised by the receiver is Advertise Window = 10 KB. The last byte sent by the sender is LastByteSent = 18476 and the last byte acknowledged by the receiver is LastByteAcked = 12112. The current window size at the sender is _____________
answered
Dec 18, 2016
in
Computer Networks

164
views
ravulatestseries
computernetworks
+3
votes
23
GATE199110a
Consider the following grammar for arithmetic expressions using binary operators $$ and $/$ which are not associative $E \rightarrow E T\mid T$ $T \rightarrow T/F\mid F$ $F \rightarrow (E) \mid id$ ($E$ is the start symbol) Is the ... the relative precedence between $$ and $/$? If not, give an unambiguous grammar that gives $/$ precedence over $$.
answered
Dec 17, 2016
in
Compiler Design

585
views
gate1991
grammar
compilerdesign
normal
descriptive
+2
votes
24
me test
For gigabit ethernet, the length of the cable, if length of the cable in standard ethernet l (2000) to maintain same frame size is _______.
answered
Dec 15, 2016
in
Computer Networks

128
views
madeeasy_testseries
ethernet
computernetworks
+1
vote
25
me test series
Consider an array with the following elements: 12, 18, 17, 11, 13, 15, 16 and 14. The number of element will change their initial position after completion of partition algorithm by choosing 15 as pivot are ________. plss explain by each pass
answered
Dec 13, 2016
in
Algorithms

92
views
madeeasy_testseries
algorithms
quicksort
+4
votes
26
Madeeasy TestSeries
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?
answered
Nov 20, 2016
in
Programming

204
views
+2
votes
27
computer network
An upper layer packet is split into 8 frames each of which has 40% chance of arriving damaged.also assume that no error control at Data Link Layer.How many times the message is sent on an average to get the entire message through a) 24.65 b)13.33 c)59.54 d)20
answered
Nov 19, 2016
in
Computer Networks

54
views
computernetworks
network
+1
vote
28
Broadcast Address.
Consider a subnet mask 255.255.255.42 for a network 192.198.191. A data packet has arrived with destination IP as 192.198.191.121. The Broadcasting address of the subnet to which the packet belongs to is _____
answered
Nov 18, 2016
in
Computer Networks

119
views
computernetworks
subnetting
+2
votes
29
Digital electronics
Given the sequence 010202010 is generated from a sequential circuit of n flipflops. And these flipflops generate the sequence respectively. What is the minimum value of n?
answered
Nov 18, 2016
in
Digital Logic

162
views
digitallogic
sequential
cicruit
+5
votes
30
GATE200343
The following is a scheme for floating point number representation using 16 bits. Bit Position 15 14 .... 9 8 ...... 0 s e m Sign Exponent Mantissa Let s, e, and m be the numbers represented in binary in the sign, exponent, and mantissa ... difference between two successive real numbers representable in this system? $2^{40}$ $2^{9}$ $2^{22}$ $2^{31}$
answered
Nov 18, 2016
in
Digital Logic

1k
views
gate2003
digitallogic
numberrepresentation
floatingpointrepresentation
normal
+2
votes
31
Made easy
answered
Nov 18, 2016
in
CO & Architecture

84
views
+2
votes
32
Floating point
What is the result of evaluating the following two expressions using three digit floating point arithmetic using three digit floating point arithmetic with rounding (113. + 111. ) + 7.51 113. + (111. + 7.51) a) 9.51 and 10.0 respectively b)10.0 and 9.51 respectively c) 9.51 and 9.51 respectively d) 10.0 and 10.0 respectively
answered
Nov 18, 2016
in
CO & Architecture

43
views
+1
vote
33
circuitswitch
Suppose a digital network implemented by circuitswitch technology which has a data rate of 1 Mbps. Assume that 2 machines are connected to this network and they are separated by 5000 Km with 2 routers in the path. If 1000 bits has to exchange ... phase is a twoway communication and the teardown phase is a oneway communication. 104 ms 102 ms 98 ms 92 ms
answered
Nov 18, 2016
in
Computer Networks

65
views
+1
vote
34
Precedence and associativity
answered
Nov 17, 2016
in
Compiler Design

55
views
compilerdesign
+3
votes
35
What is the hit ratio of a cache memory.If cache memory access time.....
answered
Nov 17, 2016
in
CO & Architecture

93
views
co&architecture
+2
votes
36
A nonpipeline system 50ns to process a task....
answered
Nov 17, 2016
in
CO & Architecture

46
views
co&architecture
+1
vote
37
Memory Organization
suppose that a direct mapped cache has 2^9 lines, with 2^4 bytes per cache line. If cache items of a byte addressable memory space of 2^39 bytes. How many bits of space will be required for storing tags(Do not include bits for validity or other tags; only consider the cost of tags themselves) a)2^8 bits b)2^11 bits c)2^13 bits d) None of these
answered
Nov 17, 2016
in
CO & Architecture

46
views
+2
votes
38
GATE198716a
A Boolean function $f$ is to be realized only by NOR gates. Its Kmap is given below: The realization is
answered
Nov 16, 2016
in
Digital Logic

62
views
gate1987
digitallogic
kmap
0
votes
39
TOC Turing Machine
Consider the following languages L1 = {< M, q > M is a turing machine that visits state q on some input within 10 steps} L2 = {< M > M is a turing machine, M  < 100 where M  is number of states ... L2 is decidable In L2, if the states are unreachable, then will it be possible to detect whether machine has less than 100 states ???
answered
Nov 16, 2016
in
Theory of Computation

245
views
toc
turingmachine
theoryofcomputation
Page:
1
2
3
4
5
6
7
next »
20,793
questions
25,951
answers
59,558
comments
21,976
users