Register
Filter

Questions by targate2018

1 votes
1 answer
1
Graph Book
The maximum number of edges in a n-node undirected graph WITH self-loops is?
The maximum number of edges in a n-node undirected graph WITH self-loops is?
0 votes
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++); }
#include <stdio.h>int main(){int a = 1, b = 1, d = 1;printf("%d, %d, %d", ++a + ++a+a++, a++ + ++b, ++d + d++ + a++);}
2 votes
2 answers
3
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 _______
extern int i; int i = 10; i = 5; int main() { printf("%d", i); return 0; }The output for the above code is _______
0 votes
0 answers
4
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)
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...
0 votes
1 answer
5
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
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 b4. acbd, acbde and acbdef
0 votes
3 answers
6
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)
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)...
0 votes
1 answer
7
Test Series
Are MST and shortest path tree identical? T/F? with reasoning.
Are MST and shortest path tree identical?T/F? with reasoning.
0 votes
0 answers
8
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}$
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 \e...
1 votes
1 answer
10
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!
The solution for the recurrence:T(1)=1T(n) = T(n-1) + T(n-2) + 1a. log(n) <= T(n)=nb. n<=T(n)<=n2c. n2 <= T(n)<= 2nd. 2n <= T(n) <=n!
0 votes
2 answers
12
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
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
15 votes
13 answers
15
Minimum number of tables to represent ER-Diagram
How many minimum relations required for given ER diagram ?
How many minimum relations required for given ER diagram ?
11 votes
4 answers
16
Minimum number of tables to represent ER-Diagram
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
The minimum number of tables to represent ER-Diagram such that the relational database satisfies 1NF.
1 votes
3 answers
17
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?
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 ra...