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 Habibkhan
User Habibkhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User Habibkhan
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
UGCNETAug2016III70
closed
6 hours
ago
in
Databases

5
views
1
answer
2
Max Possible height in AVL Tree
answered
14 hours
ago
in
Programming

13
views
datastructure
avltree
1
answer
3
Textbook question:
Let f(N) = 1 + f(logN) then find the upper bound of f(N).What is the intutive way to solve this?
answered
17 hours
ago
in
Algorithms

35
views
timecomplexity
2
answers
4
ISRO 2016(Q.7)
The minimum number of NAND gates required to implement the boolean function A+AB(bar)+AB(bar)C is equal to (a)0 (b)1 (c)4 (d)7 .HOW TO SOLVE SUCH TYPE OF QUESTION? WHAT SHOULD BE THE APPROACH?
answer selected
May 2
in
Digital Logic

103
views
1
answer
5
Discrete Mathematics Thegatebook
answer selected
May 1
in
Mathematical Logic

31
views
propositionallogic
1
answer
6
ethernet
if an ethernet station collide 4 times to try to transmit a single frame .How long might it wait to be before the next attempt if time slot 51.2 micro sec ...................micro sec. a. 768 b. 819.2 c.409.6 d. none
answered
May 1
in
Computer Networks

37
views
ethernet
2
answers
7
PGEE 2017
Consider a graph where vertex having number 2 to 12 (including 2 and 12), there is an edge between two vertex x and y iff x divides y What would be maximum path length between any two vertices of graph ?
comment reshown
Apr 30
in
Graph Theory

108
views
iiithpgee
graphtheory
2
answers
8
PGEE 2017
$\int_{3}^{3} \left  X+1 \right dx$
answered
Apr 30
in
Calculus

69
views
iiithpgee
calculus
1
answer
9
theory of computation
Determine whether or not the following language is contextfree. MY ANSWER : The given language is equivalent to L1 = { wwR : where w $\in$ {a,b}* } . And so the given language is Nondeterministic CFL. Please verify ...
answered
Apr 13
in
Theory of Computation

46
views
theoryofcomputation
2
answers
10
Rosen, Discrete Mathematics
How many bit strings of length eight contain either three consecutive 0s or four consecutive 1s?
answered
Apr 11
in
Combinatory

97
views
permutationsandcombinations
inclusionexclusion
0
answers
11
#Regular Expression
Que 8
closed
Apr 5
in
Theory of Computation

28
views
1
answer
12
theory of computation
The language L = {anbm : 2n ≤ m ≤ 3n} is a Non deterministic CFL but not a DCFL right ??? please correct me if i am wrong ...
answered
Apr 5
in
Theory of Computation

27
views
theoryofcomputation
#contextfreelanguage
2
answers
13
ISI 2004 MIII
Q7 The equation $x^{6}5x^{4}+16x^{2}72x+9=0$ has A) Exactly two distinct real roots B) Exactly three distinct real roots C) Exactly four distinct real roots D) six different real roots
answered
Apr 4
in
Set Theory & Algebra

69
views
isi2004
polynomials
1
answer
14
ISI 2004 MIII
Q11 If $\alpha 1,\alpha 2,\dots,\alpha n$ are the positive numbers then $\frac{a1}{a2}+\frac{a2}{a3}+\dots+\frac{an1}{an}+\frac{an}{a1}$ is always A) $\geq n$ B) $\leq n$ C) $\leq n^{\frac{1}{2}}$ D) None of the above
commented
Apr 4
in
Set Theory & Algebra

60
views
isi2004
settheory&algebra
numbertheory
1
answer
15
ISI 2004 MIII
Q12 The maximum possible value of xy2z3 subjected to condition x,y,z$\geq 0$ and x+y+z=3 is A) 1 B) $\frac{9}{8}$ C) $\frac{9}{4}$ D) $\frac{27}{16}$
answered
Apr 4
in
Calculus

50
views
isi2004
engineeringmathematics
maximaminima
3
answers
16
GATE2017248
If a random variable X has a Poisson distribution with mean 5, then the expectation E[(X+2)2] equals ___.
answer selected
Feb 24
in
Probability

1.1k
views
gate20172
expectation
poissondistribution
numericalanswers
1
answer
17
#probability_doubt_in_basic_concept
commented
Feb 23
in
Numerical Ability

105
views
probability
engineeringmathematics
discretemathematics
numericalability
4
answers
18
GATE2017252
If the characteristic polynomial of a 3 $\times$ 3 matrix $M$ over $\mathbb{R}$ (the set of real numbers) is $\lambda^3 – 4 \lambda^2 + a \lambda +30, \quad a \in \mathbb{R}$, and one eigenvalue of $M$ is 2, then the largest among the absolute values of the eigenvalues of $M$ is _______
answered
Feb 14
in
Linear Algebra

1.2k
views
gate20172
engineeringmathematics
linearalgebra
numericalanswers
eigenvalue
1
answer
19
Computer network MSS and MTU
Are these definations of MSS and MTU correct?? MSS is maximum payload of TCP segment. TCP segment (MSS + TCP header) For IPpacket, it consists of (MSS + TCP header + IP header) And payload of IP packet means (TCPheader + ... fragmentation always done at router?? Can it be done by source?? I am really confused about these terms. Plz verify.
commented
Feb 9
in
Computer Networks

765
views
computernetworks
tcp
network
ippacket
ethernet
2
answers
20
Gate ECE GA 2017
commented
Feb 8
in
Numerical Ability

749
views
speedtimedistance
2
answers
21
madeeasy
What are the last two digits of the number 7245 ? (A) 07 (B) 23 (C) 49 (D) 43
commented
Feb 8
in
Verbal Ability

138
views
0
answers
22
Gatebook_Mocktest2(DS)
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such thatxy ≤ xiy for all xi in the current set. Let where ... in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
closed
Feb 8
in
DS

67
views
gatebook_mt2
datastructure
avltree
2
answers
23
Pipelining and CPI
Consider a nonpipelined processor design which has a cycle time of 10ns and average CPI of 1.4. If each pipeline stage adds extra 20ps due to register setup delay. The pipeline stalls 20% of the time for 1 cycle and 5% of the time for 2 cycles (these occurrences are disjoint). What is the new CPI?
commented
Feb 8
in
CO & Architecture

375
views
co&architecture
pipelining
badquestion
2
answers
24
MADE EASY TEST SERIES
Consider 6 stage pipeline (S1, S2, S3, S4, S5, S6) which allows all the instructions except branch instructions. Processor stops fetching the following instruction after the branch until the target address is available. Target address is available ... are balanced with a 2.3 GHz clock. MIPS rate of the processor is ________ (in 2 decimal places).
commented
Feb 8
in
CO & Architecture

91
views
1
answer
25
Sequential Circuit
The following sequential circuit has initial state QAQB = 00 with one input X and one output Z. What is the minimum input sequence which takes the machine to state 11? (A) 00 (B) 10 (C) 11 (D) State 11 is not reachable
answered
Feb 8
in
Digital Logic

329
views
virtualgate
digitallogic
sequentialcircuit
2
answers
26
Type of error
a) Lexical Error b) Syntax error c) Both a and b d) None of these
commented
Feb 8
in
Compiler Design

179
views
4
answers
27
GateBook MockTest2
Suppose datagrams are limited to 1,500 bytes (including header) between source Host A and destination Host B. Assuming a 20byte IP header and a 20byte TCP header, how many datagrams would be required to send an MP3 consisting of 4 million bytes?
commented
Feb 8
in
Computer Networks

381
views
computernetworks
gatebook_mt2
ippacket
3
answers
28
Test series: gatebook mock 2
Consider the collection of all un directed graphs with 10 nodes and 6 edges. Let M and m, respectively, be the maximum and minimum number of connected components in any graph in the collection. If a graph has no self loops and there is at most one edge between any pair ... m = 1 (C) M = 7, m = 4 (D) M = 6, m = 4 Shouldn't the answer be D?
answered
Feb 8
in
Graph Theory

140
views
gatebook_mt2
2
answers
29
Gatebook mock
answered
Feb 8
in
CO & Architecture

341
views
gatebook_mt2
co&architecture
speedup
1
answer
30
Decidability
Ambiguity of DCFL and CFL is decidable or not??
commented
Feb 8
in
Theory of Computation

135
views
decidability
theoryofcomputation
contextfreelanguage
deterministiccontextfreegrammars
1
answer
31
Computer networks colloison domain
commented
Feb 7
in
Computer Networks

125
views
computernetworks
network
networkflow
1
answer
32
Decidablity+DCFL
I) LR where L is DCFl and R is regular. Is LR also DCFL decidable or not??? II)If L1 is reducible to L2 and L2 is nonRE then L1 is also NonRE??? III) If L1 is reducible to L2 and L1 is nonRE then L2 is also nonRE??
answered
Feb 7
in
Theory of Computation

98
views
theoryofcomputation
decidability
dcfl
closureproperty
regularlanguages
recursiveandrecursivelyenumerablelanguages
3
answers
33
Gatebook_Mocktest2(Operating Systems)
answered
Feb 7
in
Operating System

241
views
operatingsystem
fork
1
answer
34
How many maximum cycles possible in any Complete graph? (Unlabelled nodes)
commented
Feb 7
in
Graph Theory

143
views
graphtheory
cycle
2
answers
35
gatebook mt2 qn36
Consider a simple inorder fivestage pipeline with a twocycle branch misprediction penalty and a singlecycle loaduse delay penalty. For a specific program, 30% of the instructions are loads, 20% are branches, the remaining 50% ... instruction, and 75% of branches are predicted correctly. What is the average CPI of this program on this processor?
answered
Feb 7
in
CO & Architecture

614
views
co&architecture
machineinstructions
clockcycle
4
answers
36
GB Mock 2
answered
Feb 7
in
Theory of Computation

146
views
gatebook_mt2
theoryofcomputation
2
answers
37
gatebook mock 2
Sender window size is 2^6 . So reciever window should be the same. i. e. 2^6. Sequence no = (sender window + rexiever window) =2^7 i.e. 7 bit
answered
Feb 7
in
Computer Networks

99
views
1
answer
38
Divide and conquer
Reply with solution @Arjun sir,@habibkhan,@vijaycs
commented
Feb 7
in
Algorithms

150
views
algorithms
divideandconquer
1
answer
39
DS......
Consider a data type whose elements are integers and whose operations are INSERT, DELETE, and FINDCLOSEST, with FINDCLOSEST(y) deﬁned to be some element x in the current set such thatxy ≤ xiy for all xi in the current set. Let where denotes the ... use in order to minimizeT? (A) A sorted list (B) An unordered list (C) An implicit heap (D) An AVL tree
answered
Feb 7
in
DS

597
views
datastructure
1
answer
40
NO of tables
Let the cardinality of each relation is 1: 1, then find the minimum number of tables possible in relational model? (Assume that the participation of A, B is total)
answered
Feb 7
in
Databases

65
views
databases
24,141
questions
31,143
answers
70,892
comments
29,467
users