Questions by targate2018
User targate2018 Wall Recent activity All questions All answers Exams Taken All Blogs
User targate2018
Graph Book
The maximum number of edges in a n-node undirected graph WITH self-loops is?
asked Apr 7, 2018 in Algorithms | 134 views
#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
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 _______
asked Jan 16, 2018 in Algorithms | 207 views
programming-in-c
extern-variable
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)
asked Dec 5, 2017 in Algorithms | 81 views
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
theory-of-computation
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)
Are MST and shortest path tree identical? T/F? with reasoning.
minimum-spanning-trees
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}$
asked Nov 18, 2017 in Algorithms | 49 views
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
asked Nov 10, 2017 in Theory of Computation | 94 views
Recurrence Relation
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!
asked Nov 9, 2017 in Algorithms | 156 views
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
bad-question
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
asked Nov 5, 2017 in Linear Algebra | 239 views
engineering-mathematics
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.
asked Nov 5, 2017 in Computer Networks | 462 views
computer-networks
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.
congestion-control
made-easy-test-series
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
asked Aug 12, 2017 in Databases | 1.7k views
er-diagram
er-to-relational
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
Computer Networks Tanenbaum
A noiseless 4-kHz 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 signal-to-noise ratio of 30 dB?
asked Jul 20, 2017 in Computer Networks | 374 views
tanenbaum
How many Spanning Trees are possible from the graph?
How many Spanning Trees are possible from the graph given below? (a) 24 (b) 34 (c) 44 (d) 54
asked May 3, 2017 in Algorithms | 991 views