# Questions by targate2018

1 vote
1
The maximum number of edges in a n-node undirected graph WITH self-loops is?
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++); }
3
extern int i; int i = 10; i = 5; int main() { printf("%d", i); return 0; } The output for the above code is _______
4
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)
5
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
6
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)
7
Are MST and shortest path tree identical? T/F? with reasoning.
8
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}$
1 vote
9
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
1 vote
10
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!
11
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.
12
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
13
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.
14
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.
15
How many minimum relations required for given ER diagram ?