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 targate2018
User targate2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
User targate2018
Wall
Recent activity
All questions
All answers
Exams Taken
All Blogs
1
answer
1
Graph Book
The maximum number of edges in a nnode undirected graph WITH selfloops is?
asked
Apr 7, 2018
in
Algorithms

133
views
algorithms
graphs
1
answer
2
website
#include <stdio.h> int main() { int a = 1, b = 1, d = 1; printf("%d, %d, %d", ++a + ++a+a++, a++ + ++b, ++d + d++ + a++); }
asked
Mar 17, 2018
in
Programming

45
views
1
answer
3
ONGC Recuritment 2018
is any one have applied for ongc 2018 GT ? I am unable to find any link for registration. And in Gateoverflow it is showing last date to apply is 15 Feb 2018.
answered
Feb 9, 2018
in
Job Queries

172
views
2
answers
4
staticsingle
what will be the minimum number of temporary variables required in case of single static assignment? (a + (b*c))  (b*c)
answered
Feb 3, 2018
in
Compiler Design

102
views
staticsingleassignment
compilerdesign
2
answers
5
SELF DOUBT
Which gates are functionally complete? e.g.NAND
answered
Feb 3, 2018
in
Digital Logic

79
views
1
answer
6
Test Series
Consider the following C function: int f(int n) { static int r = 0; if (n <= 0) return 1; if (n > 3) { r = n; return f(n1) + 2; } return f(n2) + r; } What is the value of $f(5)?$
commented
Feb 1, 2018
in
Programming

78
views
programminginc
1
answer
7
Ack Duplicacy in TCP
After receiving 3 duplicate ACKs sender will go to slow start phase or congestion avoidance? Somewhere, I read that, 3 duplicacy means the weakpossibility of congestion. When does global timer expire?
answered
Jan 16, 2018
in
Computer Networks

283
views
computernetworks
tcp
congestioncontrol
1
answer
8
test series
Consider the following code segment: The minimum number of temporary variable required to convert the above code segment to static single assignment form is ________.
answered
Jan 16, 2018
in
Compiler Design

60
views
2
answers
9
Algorithm  Extern Variable
extern int i; int i = 10; i = 5; int main() { printf("%d", i); return 0; } The output for the above code is _______
answered
Jan 16, 2018
in
Algorithms

206
views
programminginc
externvariable
algorithms
2
answers
10
MadeEasy Test Series 2018: Databases  Indexing
In a database file structure, the search key field is 9 bytes long, the block size is 1024 bytes, a record pointer is 7 bytes and a block pointer is 6 bytes. The largest possible order of a leaf node in a B+ tree implementing this file structure is ________. I am getting 63 as the answer, but in the solution, it's saying 64. Can anyone check?
commented
Jan 16, 2018
in
Databases

511
views
databases
indexing
madeeasytestseries
madeeasytestseries2018
1
answer
11
Hamming Distance Question
commented
Dec 31, 2017
in
Computer Networks

675
views
hammingcode
errordetection
1
answer
12
no of simple graph possible with 6 vertices and 4 edges is ?
commented
Dec 31, 2017
in
Graph Theory

322
views
0
answers
13
associative mapping
Consider 4way set associative cache of a 64 KB organized into a 32 blocks. Main memory size is 4 GB. In the cache controller, each line in the set contain 1 valid, 1 modified and 2 replacement bits along with a tag. How much space is required in the cache controller to store the tag information (Meta data)
commented
Dec 28, 2017
in
CO and Architecture

234
views
computr
coandarchitecture
1
answer
14
MadeEasy Test Series: CO & Architecture  Expanding Opcode
How to solve this ?
answered
Dec 27, 2017
in
CO and Architecture

158
views
madeeasytestseries
cachememory
coandarchitecture
expandingopcode
9
answers
15
Minimum number of tables to represent ERDiagram
How many minimum relations required for given ER diagram ?
answered
Dec 27, 2017
in
Databases

1.7k
views
erdiagram
databases
ertorelational
relational
2
answers
16
NIELITDEC 2017 SET C65
When we use slow start algorithm ,the size of CW increases ...............until it reaches threshold. A)Additively B)Multiplicatively C)Exponentially D) NONE
answered
Dec 25, 2017
in
Computer Networks

117
views
0
answers
17
NIELITDEC 2017 set c 115
In boolean algebra 1+1+1+1+..........800 times ones A) 0 B)1 C)11 D)800
commented
Dec 24, 2017
in
Combinatory

137
views
0
answers
18
class test
Given an array of n numbers, a median x exists such that x is larger than at least n/20 of the numbers and smaller than at lest n/20 numbers. If this x is used as a pivot in quick sort. What is the worst case running time of this algorithm? a. O(n) b. O(n11/10) 3. O(nlogn) 4.O(n2) 5. O(n10/11 log n)
commented
Dec 5, 2017
in
Algorithms

81
views
algorithms
timecomplexity
1
answer
19
class test
Which of the following strings will match the linux regex a?b*? 1. (empty string) 2. b,bb,bbb.... and ab,abb,abbb...... 3. both a and b 4. acbd, acbde and acbdef
answer selected
Dec 5, 2017
in
Algorithms

51
views
theoryofcomputation
3
answers
20
class test
m=1; for i=1 to n do begin m=m*3; for j=1 to m do {Something which is O(1)} What is the complexity of above algorithm? 1. O(n*m3) 2. O(n3) 3. O(3n) 4. O(3m)
answer selected
Dec 5, 2017
in
Algorithms

88
views
algorithms
1
answer
21
Test Series
Are MST and shortest path tree identical? T/F? with reasoning.
asked
Dec 5, 2017
in
Algorithms

63
views
graph
graphtheory
mst
minimumspanningtrees
0
answers
22
test series
Given a problem X we want to determine whether X is NPhard. Therefore, a. We construct a reduction from instances of problem X to instances of SAT that runs in polynomial time. b. We construct a reduction from instances of problem X to instances of SAT that runs in ... are mapped to YES instances of problem X, and NO instances of pi are mapped to NO instances of X. e. None of the above
comment edited
Dec 4, 2017
in
Theory of Computation

93
views
theoryofcomputation
0
answers
23
Testbook
Which of the following graph corresponds to given adjacency matrix $\begin{bmatrix} 0 1 0 0 0 1\\ 1 0 1 0 0 0 \\ 0 1 0 1 0 1 \\ 0 0 1 0 1 0\\ 0 0 0 1 0 1 \\ 1 0 1 0 1 0 \end{bmatrix}$
commented
Nov 20, 2017
in
Algorithms

49
views
graphtheory
2
answers
24
Relations
Consider the set S = {a, b} and ‘L’ be a binary relation such that L = {all binary relations except reflexive relation set S}. The number of relation which are symmetric _______.
commented
Nov 20, 2017
in
Set Theory & Algebra

357
views
relations
discretemathematics
1
answer
25
Recurrence Relation
The solution for the recurrence: T(1)=1 T(n) = T(n1) + T(n2) + 1 a. log(n) <= T(n)=n b. n<=T(n)<=n2 c. n2 <= T(n)<= 2n d. 2n <= T(n) <=n!
edited
Nov 10, 2017
in
Algorithms

155
views
algorithms
recurrence
1
answer
26
online
Explain the behaviour of following code: int main() { int *j=0; { int i=10; j=&i; } printf("%d",*j); } a. output is 10. j pointed to address of i, so it was not freed. b. output may be 10 or garbage in given execution c. output is 10. i becomes invisible outside of its block scope, but lives as long as function scope d. output is 0.
asked
Nov 9, 2017
in
Algorithms

56
views
programminginc
badquestion
2
answers
27
Bottom up parsing SDT
answer edited
Nov 6, 2017
in
Compiler Design

316
views
compilerdesign
parsing
0
answers
28
Computer Networks  Congestion Control
Consider the effect of using slow start on a line with 10 msec round trip time. The receiver window and the size of congestion window are set to 38 KB and 36 KB respectively. Sender side threshold is set to 18 KB. After 8 transmission a time ... first full window of 18 KB is____________ (in msec). Assume window size at the start of slow start phase is 2 KB.
closed
Nov 6, 2017
in
Computer Networks

163
views
computernetworks
congestioncontrol
madeeasytestseries
network
2
answers
29
Computer Networks
Consider a network system consisting of three networks connected with two routers. NetworkA has MTU of 1500 bytes, NetworkB has MTU of 620 bytes, NetworkC has MTU of 1500 bytes (MTU includes header size). Station1 needs to send a segment of1380 bytes. The Total size of the packets received at NetworkC is _________ bytes if the header size is 20 B.
commented
Nov 6, 2017
in
Computer Networks

458
views
computernetworks
network
1
answer
30
ANY GOOD SOURCE TO LEARN LOSSYLESS DECOMPOSITION ?
ANY GOOD SOURCE TO LEARN LOSSYLESS DECOMPOSITION ?
answered
Nov 5, 2017
in
Databases

27
views
databases
1
answer
31
virtual gate
Choose the correct answer for following grammar S → Aa  bAc  Bc  bBa A → d B → d (A) It is LL(1), LALR(1), and CLR(1) (B) LR(0), LALR(1), and CLR(1), but not SLR(1) (C) It is CLR(1), but not LL(1), LR(0), SLR(1), LALR(1) (D) It is LALR(1), and CLR(1)
answered
Nov 5, 2017
in
Compiler Design

402
views
parser
2
answers
32
Engineering Mathematics  Linear Algebra
If the equations (λ+1)x + 8y = 4λ and λx + (λ+3)y = 3λ1 have no solution, then the number of values of λ is : (A) one (B) two (C) three (D) more than three
answer selected
Nov 5, 2017
in
Linear Algebra

239
views
engineeringmathematics
linearalgebra
1
answer
33
please solve this Q
Q. The direct broadcast address of the IP address 205.18.136.187 with subnet Mask 255.255.255.240 is
answered
Sep 1, 2017
in
Computer Networks

200
views
computernetworks
1
answer
34
#DIGITAL
commented
Sep 1, 2017
in
Digital Logic

65
views
2
answers
35
Morris Mano exercise
With the use of maps , find the simplest sum of products form of the function F = fg where f = abc' + c'd + a'cd'+ b'cd' g = (a + b +c' + d')(b' + c' + d)(a'+ c + d')
commented
Aug 31, 2017
in
Digital Logic

400
views
3
answers
36
Minimum number of tables to represent ERDiagram
The minimum number of tables to represent ERDiagram such that the relational database satisfies 1NF.
asked
Aug 11, 2017
in
Databases

2.4k
views
erdiagram
databases
ertorelational
relational
1
answer
37
Serial transfer of CN
In synchronous serial transfer, if 3 eight bit sync., characters are included in 30 eight bit information character and the bandwidth of cable is 1200 bits per sec. Then calculate the data rate of receiver.
commented
Aug 2, 2017
in
Computer Networks

98
views
2
answers
38
B and B+ Trees
Can any one please provide any good source for B and B PLUS trees various algorithm and properties?
answered
Jul 31, 2017
in
DS

104
views
3
answers
39
normalisation 2nf
The Second Normal Form states that it should meet all the rules for 1NF and there must be no partial dependences of any of the columns on the primary key , so i have doubt regarding this if a prime attribute determines another prime attribute in a separate functional dependency then still is this 2nf or not? I'm confuse little bit , please help me . thanks in advance
commented
Jul 31, 2017
in
Databases

360
views
databasenormalization
2nf
3
answers
40
Computer Networks Tanenbaum
A noiseless 4kHz channel is sampled every 1 msec. What is the maximum data rate? How does the maximum data rate change if the channel is noisy, with a signaltonoise ratio of 30 dB?
commented
Jul 22, 2017
in
Computer Networks

373
views
computernetworks
tanenbaum
network
50,741
questions
57,232
answers
197,993
comments
104,579
users