The Gateway to Computer Science Excellence
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
Exam Category
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 Amit Pal
User Amit Pal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Amit Pal
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
votes
1
Apti: Tank Question
Ratio of daimeters of 3 taps are 1:2:3 given, if tap with max diameter fills the tank in 10 hrs, then What is the time taken to to fill the tankm if all three taps are opened together?
answered
Jan 9
in
Verbal Ability

86
views
+4
votes
2
CN: Flow Control
Compute the efficiency of Stop and Wait protocol for the frame size of 1000 bits over 1Mbps and propagation delay between the system is 20ms, if the probability of error in frame is .1 _____?
answered
Dec 24, 2016
in
Computer Networks

247
views
computernetworks
networkflow
0
votes
3
IP doubt
Suppose host A sends a message to some byte (say $x$) to host B. But in between routers fragment the packet sent by A and as a result 5 fragments reach destination. (IP header = $20B$). What is the IP overhead at destination?? Somewhere I ... is also an overhead. So total Overhead is equal to size of $5$ IP headers. Please clarify what is wrong what is right??
answered
Nov 30, 2016
in
Computer Networks

233
views
computernetworks
+1
vote
4
Hashing
answered
Nov 30, 2016
in
DS

150
views
+7
votes
5
GATE19894iii
Provide short answers to the following questions: Show that {NOR} is a functionally complete set of Boolean operations.
answered
Nov 30, 2016
in
Digital Logic

182
views
gate1989
descriptive
digitallogic
functionalcompleteness
+12
votes
6
GATE19894i
Provide short answers to the following questions: How many substrings (of all lengths inclusive) can be formed from a character string of length $n$? Assume all characters to be distinct, prove your answer.
answered
Nov 30, 2016
in
Combinatory

344
views
gate1989
descriptive
permutationsandcombinations
0
votes
7
ACE TEST
which is the correct option?
answered
Nov 30, 2016
in
Operating System

48
views
+3
votes
8
made easy  test series
#plz check???
answered
Nov 30, 2016
in
Operating System

168
views
madeeasytestseries
operatingsystem
processsynchronization
0
votes
9
made easy Test series
#plz check i am correct or wrong???
answered
Nov 29, 2016
in
Operating System

57
views
0
votes
10
A arrives at office at 810am regularly; B arrives at 911 am every day
answered
Nov 26, 2016
in
Probability

134
views
probability
counting
+3
votes
11
Hashing
How do i prove that : : : In hashing n items into a hash table with k locations, the expected number of collisions is $n  k + k( 1\frac{1}{k})^n$ ??
answered
Nov 26, 2016
in
Algorithms

145
views
hashing
+1
vote
12
doubt
its a very silly confusion plz check (ab)* b + a* b its equal to S> (ab)+b / a+b / b check ??
answered
Nov 26, 2016
in
Theory of Computation

44
views
theoryofcomputation
+1
vote
13
max keys in BTree
answered
Nov 26, 2016
in
Programming

56
views
+4
votes
14
ME test
For synchronous series counter of modulus 256, the propagation delay for each flip flop is 25 nsec and propagation delay of each two input AND gate is 5 nsec. What is the maximum frequency of the MOD256 counter ? (in MHz)
answered
Nov 26, 2016
in
Digital Logic

476
views
digitallogic
digitalcounter
flipflop
+1
vote
15
function
consider 2 statement: 1: every eqvivalance relation is function 2:no eqvivalance relation is functon which is true/false(explain it)
answered
Nov 26, 2016
in
Mathematical Logic

46
views
+4
votes
16
Maths: Linear Algebra
Please explain in details!
answered
Nov 26, 2016
in
Linear Algebra

124
views
linearalgebra
engineeringmathematics
0
votes
17
function
Question 1: Is the graph shown below that of a function? plz explain how to identify is function or not???? what is concept here???
answered
Nov 26, 2016
in
Mathematical Logic

35
views
+4
votes
18
made easy
The maximum number of Boolean expressions that can be formed for the function f(x, y, z) satisfying the relation f(~x,y,~z) = f(x,y,z) is ___________.
answered
Nov 26, 2016
in
Digital Logic

133
views
0
votes
19
function
function F is define by:h(x) = 3 x 2  7 x  5 find h(x2)=?? the new value of expession is funtion???
answered
Nov 26, 2016
in
Mathematical Logic

62
views
0
votes
20
function
Match this equation with its graph: y = 3x  4 + 1 5. explain it
answered
Nov 26, 2016
in
Mathematical Logic

33
views
+2
votes
21
IITM November 2016
FD s given P1P3>P4, P1>P2, P2>P1 now a) bcnf and p2p3>p4 holds b)bcnf and p2p3>p4 does not hold c)3nf not in bcnf and p2p3>p4 holds d)3nf not in bcnf and p2p3>p4 does not hold
answered
Nov 25, 2016
in
Databases

105
views
+4
votes
22
GATE19871xxvi
If $(f(x_{t}).f(x_{i+1})< 0$ then There must be a root of $f(x)$ between $x_i$ and $x_{i+1}$ There need not be a root of $f(x)$ between $x_{i}$ and $x_{i+1}$. There fourth derivative of $f(x)$ with respect to $x$ vanishes at $x_{i}$. The fourth derivative of $f(x)$ with respect to $x$ vanishes at $x_{i+1}$.
answered
Nov 11, 2016
in
Calculus

146
views
gate1987
calculus
functions
0
votes
23
Parsing
which is false? a) An unambiguous grammar has same RMD for every sentence. b)An ambiguous grammar may have an infinite no. of derivation trees for some sentences in the language generated.
answered
Nov 11, 2016
in
Compiler Design

66
views
+1
vote
24
DIGITAL. Prop delay
can anybody tell me when does AND gate take inputs (1,1) and when does Y go from 0 to 1. assume Y=1 initially thanks!
answered
Nov 11, 2016
in
Digital Logic

85
views
+4
votes
25
Ace Questions
Answer is 407 , how? Please dont just throw away formula, explain it.
answered
Nov 8, 2016
in
Programming

159
views
arrays
0
votes
26
Gate Practice question
L1 = {a^n b^n c^n  n>=1}, L2 = Σ* L1 is : a.{a^i b^j c^k ; i!=j or i!=k} U (Σ*  a*b*c*) b.{a^i b^j c^k ; i!=j and i!=k} U (Σ*  a*b*c*) c.{a^i b^j c^k ; i!=j or i!=k} ∩ (Σ*  a*b*c*) d.c.{a^i b^j c^k ; i!=j and i!=k} ∩ (Σ*  a*b*c*)
answered
Nov 8, 2016
in
Theory of Computation

47
views
contextsensitivelanguages
cfg
0
votes
27
UGCNETAUG2016III33
Consider a weighted complete graph $G$ on the vertex set $\left\{ν_{1} , ν_{2},.... ν_{n} \right\}$ such that the weight of the edge $(ν_{i} , ν_{j})$ is $4  i – j$. The weight of minimum cost spanning tree of $G$ is : $4n^{2}$ $n$ $4n – 4$ $2n – 2$
answered
Oct 2, 2016
in
Others

180
views
ugcnetaug2016iii
0
votes
28
Asymptotic notation
Consider the following functions f(n) = 3n√n g(n) = 2√nlog2 n h(n) = n! Which of the following is true? a. h(n) is O(f(n)) b. h(n) is O(g(n)) c. g(n) is not O(f(n)) d. f(n) is O(g(n)) Why is answer d?
answered
Sep 2, 2016

98
views
+2
votes
29
rank of a matrix
Rank of following matix? 12 22 32 42 32 42 52 62 42 52 62 72 please note the changes.
answered
Sep 2, 2016
in
Mathematical Logic

445
views
+1
vote
30
toc
Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which produces a ... states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states
answered
Sep 2, 2016

45
views
minimal
dfa
+2
votes
31
toc minimal dfa
. Find minimized finite automata which recognizes the below languages, separately by m1 and m2 over binary strings as input, then find the number of states in each of the following. L1:L2 is a language, which contains a set of strings which ... states (c) m1 contains 3 states and m2 contains 9 states (d) m1 contains 4 states and m2 contains 9 states
answered
Sep 2, 2016
in
Theory of Computation

130
views
theoryofcomputation
minimalstateautomata
+2
votes
32
GATEBOOK exam
A hash function h maps 16bit inputs to 8bit hash values. What is the largest k such that in any set of 1,000 inputs, there are at least k inputs that h maps to the same hash value? A) 3 B) 4 C) 10 D) 64
answered
Sep 1, 2016
in
Algorithms

79
views
algorithms
+1
vote
33
GATEBOOK exam
Consider the following data structure: Usually, inserting an element to this datastructure requires (1) work. However, the datastructure has a parameter k, s.t. every k elements we insert, it requires additional (k) work. That is, upon insertion of the kth ... cost per operation of inserting elements into the data structure? (a) (1) (b) () (c)(k) (d) ()
answered
Sep 1, 2016
in
Algorithms

59
views
algorithms
Page:
1
2
next »
29,101
questions
36,904
answers
91,826
comments
34,770
users