search
Log In

Recent activity by targate2018

1 answer
1
The maximum number of edges in a n-node undirected graph WITH self-loops is?
asked Apr 7, 2018 in Algorithms 242 views
1 answer
2
#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 54 views
1 answer
3
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 190 views
2 answers
4
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 117 views
2 answers
5
Which gates are functionally complete? e.g.NAND
answered Feb 3, 2018 in Digital Logic 96 views
1 answer
6
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(n-1) + 2; } return f(n-2) + r; } What is the value of $f(5)?$
commented Feb 1, 2018 in Programming 106 views
1 answer
7
After receiving 3 duplicate ACKs sender will go to slow start phase or congestion avoidance? Somewhere, I read that, 3 duplicacy means the weak-possibility of congestion. When does global timer expire?
answered Jan 16, 2018 in Computer Networks 335 views
1 answer
8
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 77 views
2 answers
9
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 266 views
2 answers
10
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 617 views
0 answers
13
Consider 4-way 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 386 views
4 answers
16
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 193 views
0 answers
17
In boolean algebra 1+1+1+1+..........800 times ones A) 0 B)1 C)11 D)800
commented Dec 24, 2017 in Combinatory 543 views
0 answers
18
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 92 views
1 answer
19
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 61 views
3 answers
20
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 108 views
1 answer
21
Are MST and shortest path tree identical? T/F? with reasoning.
asked Dec 5, 2017 in Algorithms 79 views
0 answers
22
Given a problem X we want to determine whether X is NP-hard. 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 108 views
0 answers
23
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 89 views
2 answers
24
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 453 views
1 answer
25
The solution for the recurrence: T(1)=1 T(n) = T(n-1) + T(n-2) + 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 182 views
1 answer
26
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 64 views
0 answers
28
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-out occurs, after time out ... taken to send 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 192 views
2 answers
29
Consider a network system consisting of three networks connected with two routers. Network-A has MTU of 1500 bytes, Network-B has MTU of 620 bytes, Network-C has MTU of 1500 bytes (MTU includes header size). Station-1 needs to send a segment of1380 bytes. The Total size of the packets received at Network-C is _________ bytes if the header size is 20 B.
commented Nov 6, 2017 in Computer Networks 608 views
1 answer
30
...