The Gateway to Computer Science Excellence
For all GATE CSE Questions
Toggle navigation
Facebook Login
or
Email or Username
Password
Remember
Login
Register

I forgot my password
Activity
Questions
Unanswered
Tags
Subjects
Users
Ask
Prev
Blogs
New Blog
Exams
Recent activity by suneetha
User suneetha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User suneetha
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
0
answers
1
gate 2019
in gate 2019 my marks are 29.67 and my gate score is 352 in general category please give some information about is there any chance of getting m.tech admission in nit’s or iiit’s and please give me the list of universitie’s of information where can i get m.tech admission
asked
Apr 5, 2019
in
NITs

62
views
gate2019
0
answers
2
textbook
please gie the answer
asked
Feb 6, 2019
in
Algorithms

95
views
1
answer
3
textbook
T(n)=T(7n/8)+0.05 solve this equation and find out the time complexity?
asked
Feb 5, 2019
in
Algorithms

87
views
0
answers
4
textbook
give a pda over the alphabet (a,b) which accepts set of all odd length palindrome which start with ‘a’?
closed
Jan 23, 2019
in
Theory of Computation

11
views
0
answers
5
text book
please construct a pda for the language l={w belongs to {0,1,2}* the number of 0’s is exactly 3 times the number of 1’s}
asked
Jan 23, 2019
in
Theory of Computation

23
views
0
answers
6
MadeEasy Subject Test 2019: Computer Networks  Tcp
If TCP RTT is currently 20 ms and following acknowledgement come in after 22,24 and 23 ms respectively. What is new RTT estimate ? 28.527 28.82 20.82 21.22
commented
Jan 17, 2019
in
Computer Networks

103
views
computernetworks
tcp
madeeasytestseries2019
madeeasytestseries
1
answer
7
general
Consider a two level cache system. For 100 memory references, 16 misses in the first level cache and 8 misses in the second level cache. Miss penalty from L2 cache to memory is 50 cycles. The hit time of L2 cache is 5 cycles and hit time of the L1 cache is 1 clock cycle. What is the average memory ... Miss penalty of L2 = ((16/ 100) x 5) + ((16/ 100) (8 / 16) x 50) = (16/ 100) (26)=4.8
answered
Jan 15, 2019
in
CO and Architecture

123
views
0
answers
8
textbook
consider a 12 bit physical address and a directmapped cache with 64 blocks and each block has a size of 16 bytes. To which block number does the byte address 1200 map?
commented
Jan 15, 2019
in
CO and Architecture

85
views
0
answers
9
textbook
draw an entity diagram for the given queston
asked
Jan 14, 2019
in
Databases

12
views
0
answers
10
MadeEasy Test Series 2019: Digital Logic  Hamming Code
plz tell the answer
commented
Jan 12, 2019
in
Digital Logic

93
views
digitallogic
hammingcode
madeeasytestseries2019
madeeasytestseries
0
answers
11
MadeEasy Test Series: Computer Networks  Subnetting
asked
Jan 11, 2019
in
Computer Networks

66
views
madeeasytestseries
computernetworks
subnetting
5
answers
12
GATE19992.20
The minimum number of record movements required to merge five files A (with $10$ records), B (with $20$ records), C (with $15$ records), D (with $5$ records) and E (with $25$ records) is: $165$ $90$ $75$ $65$
commented
Jan 8, 2019
in
Algorithms

3.6k
views
gate1999
algorithms
normal
greedyalgorithm
4
answers
13
GATE20002.18
Let $G$ be an undirected connected graph with distinct edge weights. Let $e_{max}$ be the edge with maximum weight and $e_{min}$ the edge with minimum weight. Which of the following statements is false? Every minimum spanning tree of $G$ ... tree, then its removal must disconnect $G$ No minimum spanning tree contains $e_{max}$ $G$ has a unique minimum spanning tree
commented
Jan 7, 2019
in
Algorithms

4.7k
views
gate2000
algorithms
spanningtree
normal
0
answers
14
MadeEasy Test Series: Programming & DS  Programming In C
#include<stdio.h> int main() { code(4); return 0; } int code(int m) { if(m>0){ int i=1; for(;i<3;i++){ code(mi); code(mi1); printf("MadeEasy"); } } return 0; } the number of times made easy will be printed? plz explain in detail
commented
Jan 5, 2019
in
Programming

56
views
madeeasytestseries
programminginc
1
answer
15
made easy
for 2 relations R(A,B) with functional dependency F={A>B} and S(B,C) witht functional dependency S={B>C} natural join of R and S is in BCNF
asked
Dec 30, 2018
in
Databases

32
views
databases
1
answer
16
IP Address allocation
64,128 32,16 32,128 64,32
commented
Dec 30, 2018
in
Computer Networks

188
views
computernetworks
ipv4
subnetting
1
answer
17
engineering maths
Let $A=\begin{bmatrix} 2\\4 \\7 \end{bmatrix}.\begin{bmatrix} 1 &9 &5 \end{bmatrix}$ and $x,y$ and $z$ be the eigenvalue of $A$, then the value of $xyz$ is equal to?
asked
Dec 25, 2018
in
Linear Algebra

74
views
engineeringmathematics
1
answer
18
regular expression
the regular expression for the given finite automata plz provide ans step by step
asked
Dec 24, 2018
in
Theory of Computation

65
views
regularexpressions
1
answer
19
MadeEasy Test Series: Theory Of Computation  Recursive And Recursive Enumerable Languages
asked
Dec 24, 2018
in
Theory of Computation

154
views
madeeasytestseries
theoryofcomputation
recursiveandrecursivelyenumerablelanguages
1
answer
20
MadeEasy Test Series: Theory Of Computation  Regular Expressions
self doubt the minimal dfa for the given regular expression over the alphabet {0,1} is 1*(0+10)*1*?
commented
Dec 23, 2018
in
Theory of Computation

82
views
madeeasytestseries
theoryofcomputation
regularexpressions
0
answers
21
MadeEasy Subject Test 2018: Theory Of Computation  Regular Grammar
commented
Dec 23, 2018
in
Theory of Computation

74
views
0
answers
22
MadeEasy Subject Test 2019: Theory Of Computation  Finite Automata
what is the answer
commented
Dec 22, 2018
in
Theory of Computation

69
views
madeeasytestseries
theoryofcomputation
finiteautomata
2
answers
23
MadeEasy Test Series: Theory Of Computation  Grammar
i thought that it is the language where both start and end symbols are same and i got 65 but the ans is 29
asked
Dec 22, 2018
in
Theory of Computation

82
views
madeeasytestseries
theoryofcomputation
grammar
1
answer
24
MadeEasy Test Series: Theory Of Computation  Grammar
what is the answer
commented
Dec 22, 2018
in
Theory of Computation

63
views
madeeasytestseries
theoryofcomputation
grammar
1
answer
25
MadeEasy Test Series: Theory Of Computation  Grammar
G1: S→ aSa bSbe G2:S→ aaSbbS e the shortest length strings which does not belongs to L(g1) but belongs to L(G2) is
commented
Dec 22, 2018
in
Theory of Computation

99
views
madeeasytestseries
theoryofcomputation
grammar
1
answer
26
MadeEasy Subject Test 2019: Theory Of Computation  Regular Expressions
the length of the shortest string which is not present in the regular expression 1*(0+10)*1* is?
asked
Dec 22, 2018
in
Theory of Computation

90
views
madeeasytestseries
theoryofcomputation
regularexpressions
3
answers
27
GATE2015151
Consider the NPDA ... is as follows: Which one of the following sequences must follow the string $101100$ so that the overall string is accepted by the automaton? $10110$ $10010$ $01010$ $01001$
commented
Dec 21, 2018
in
Theory of Computation

8k
views
gate20151
theoryofcomputation
pushdownautomata
normal
3
answers
28
Instruction Format
Consider a computer has 64 registers and support 15 different instructions. Each instruction has 4 fields i.e. opcode, source register, destination register and immediate value of 6 bits. If each instruction in byte aligned and 50 instructions are ... answer My question is, in this question what is difference between computer has 15 instruction and memory has 50 instructions?
commented
Dec 18, 2018
in
CO and Architecture

415
views
machineinstructions
instructionformat
coandarchitecture
0
answers
29
MadeEasy Test Series: Operating System  Memory Management
consider a 900KB memory is managed using variable partitions but no compaction it currently has 3 processes occupied partition sizes 212KB 114KB and 100KB respectively which of the following smallest request wil be denied a)475 b)285 c)355 d)none of the above
asked
Dec 17, 2018
in
Operating System

142
views
madeeasytestseries
operatingsystem
memorymanagement
1
answer
30
MadeEasy Subject Test 2019: Computer Networks  Flow Control Methods
consider a network connecting two nodes A and B having a propagation delay of 6*10^4 micro sec.bandwidth of network is 150 Mbps if each frame size is 5000 bytes and both uses go back n sliding window protocal, where maximum 100 frames can be sent at a time then the maximum possible data rate is  [ mbps]
commented
Dec 10, 2018
in
Computer Networks

234
views
madeeasytestseries
computernetworks
flowcontrolmethods
slidingwindow
2
answers
31
TCP Congestion window
Assume the scenario where size of the congestion window of a TCP connection be 40KB when timeout occurs. The MSS is 2KB. Propagation delay be 200msec. Time taken by TCP connection to get back to 40KB congestion window is …...
answer edited
Dec 9, 2018
in
Computer Networks

202
views
computernetworks
tcp
congestioncontrol
0
answers
32
MadeEasy Workbook: Computer Networks  Sliding Window
Consider a sliding window protocol operating at the data link layer between two stations 1000 kilometers apart, directly connected by an errorfree 1.0 Mbps link. The frame sizes used are 500 bits, of which 50 bits are header and 450 bits are data ... delay is 10 µsec/km. If a window size of W = 10 is used, then the efficiency of the channel is
comment edited
Dec 6, 2018
in
Computer Networks

201
views
computernetworks
slidingwindow
madeeasybooklet
1
answer
33
MadeEasy Test Series: Digital Logic  Flip Flop
commented
Dec 6, 2018
in
Digital Logic

120
views
madeeasytestseries
digitallogic
flipflop
1
answer
34
MadeEasy Subject Test: Digital Logic  Booths Algorithm
I understand booth's algorithm, but what is the meaning of this question?
commented
Dec 3, 2018
in
Digital Logic

676
views
madeeasytestseries
digitallogic
boothsalgorithm
0
answers
35
functions
f(x)=ln x +x g(x)=x^2 sin(x) h(x)=x^3x which of them are represents the manytoone function?
asked
Nov 23, 2018
in
Mathematical Logic

29
views
discretemathematics
0
answers
36
graphs
consider a complete garph on 2^(log(2^10)) vertices then the minimum number of edge removal operations needed to make graph disconnected
asked
Nov 23, 2018
in
Mathematical Logic

36
views
discretemathematics
0
answers
37
prev year question
the eigen values of the following matrix 1 3 5 3 1 6 0 0 3
asked
Nov 20, 2018
in
Mathematical Logic

40
views
matrixeigenvector
4
answers
38
GATE2008IT77
A binary tree with $n > 1$ nodes has $n_1$, $n_2$ and $n_3$ nodes of degree one, two and three respectively. The degree of a node is defined as the number of its neighbours. Starting with the above tree, while there remains a node $v$ of degree two in the tree, add an edge ... edges will remain at the end of the process? $2 * n_1 3$ $n_2 + 2 * n_1  2$ $n_3  n_2$ $n_2+ n_1 2$
commented
Nov 15, 2018
in
DS

4.1k
views
gate2008it
datastructures
binarytree
normal
1
answer
39
GATE199201,x
(x) Maximum number of edges in a planar graph with n vertices is _____
commented
Nov 14, 2018
in
Graph Theory

1.5k
views
gate1992
graphtheory
graphplanarity
easy
outofsyllabusnow
6
answers
40
GATE2017237
Consider the C program fragment below which is meant to divide $x$ by $y$ using repeated subtractions. The variables $x$, $y$, $q$ and $r$ are all unsigned int. while (r >= y) { r=ry; q=q+1; } Which of the following conditions on the variables $x, y, q$ and $r$ before the execution of ... $(q==0) \ \&\& \ (y>0)$
commented
Nov 10, 2018
in
Programming

3.8k
views
gate20172
programming
loopinvariants
50,741
questions
57,244
answers
198,020
comments
104,614
users