Quizsummary
0 of 65 questions completed
Questions:
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
Information
You have already completed the quiz before. Hence you can not start it again.
Quiz is loading...
You must sign in or sign up to start the quiz.
You have to pass the previous Module's quiz in order to start this quiz
Results
Results
0 of 65 questions answered correctly
Your time:
Time has elapsed
You have reached 0 of 0 points, (0)
Earned Points: 0 of 0, (0)
0 Essay(s) Pending (Possible Points: 0)
Categories
 Not categorized 0%
 1
 2
 3
 4
 5
 6
 7
 8
 9
 10
 11
 12
 13
 14
 15
 16
 17
 18
 19
 20
 21
 22
 23
 24
 25
 26
 27
 28
 29
 30
 31
 32
 33
 34
 35
 36
 37
 38
 39
 40
 41
 42
 43
 44
 45
 46
 47
 48
 49
 50
 51
 52
 53
 54
 55
 56
 57
 58
 59
 60
 61
 62
 63
 64
 65
 Answered
 Review

Question 1 of 65
1. Question
Consider the set X={a, b,c,d,e} under the partial ordering
R={(a,a),(a,b),(a,c),(a,d),(a,e),(b,b),(b,c),(b,e),(c,c),(c,e),(d,d),(d,e),(e,e)}.
The Hasse diagram of the partial order (X, R) is shown below.
The minimum number of ordered pairs that need to be added to R to make (X, R) a lattice is ________.
CorrectIncorrectHint
^{}NAT Type Question

Question 2 of 65
2. Question
Which of the following statements about parser is/are CORRECT?
I. Canonical LR is more powerful than SLR.
II. SLR is more powerful than LALR
III. SLR is more powerful than Canonical LR.
CorrectIncorrect 
Question 3 of 65
3. Question
Match the following:
CorrectIncorrect 
Question 4 of 65
4. Question
Let L_{1}, L_{2} be any two context free languages and R be any regular language. Then which of the following is/are CORRECT ?
CorrectIncorrect 
Question 5 of 65
5. Question
G is undirected graph with n vertices and 25 edges such that each vertex of G has degree at least 3. Then the maximum possible value of n is ___________.
CorrectIncorrectHint
NAT Type Question

Question 6 of 65
6. Question
Let p, q, r denote the statements “It is raining ,“ It is cold”, and “ It is pleasant,” respectively. Then the statement “It is not raining and it is pleasant, and it is not pleasant only if it is raining and it is cold” is represented by
CorrectIncorrect 
Question 7 of 65
7. Question
The Breadth First Search (BFS) algorithm has been implemented using the queue data structure. Which one of the following is a possible order of visiting the nodes in the graph below?
CorrectIncorrect 
Question 8 of 65
8. Question
Let be two matrices. Then the rank of P + Q is _________.
CorrectIncorrectHint
NAT Type Question

Question 9 of 65
9. Question
Consider socket API on a Linux machine that supports connected UDP sockets. A connected UDP socket is a UDP socket on which connect function has already been called. Which of the following statements is/are CORRECT ?
I. A connected UDP socket can be used to communicate with multiple peers simultaneously.
II. A process can successfully call connect function again for an already connected UDP socket.
CorrectIncorrect 
Question 10 of 65
10. Question
The minimum possible number of states of a deterministic automaton that accepts the regular language
L = {w_{1}aw_{2}w_{1}, w_{2} ∈ {a, b}*, w_{1} = 2,w_{2} ≥ 3} is ______.
CorrectIncorrectHint
NAT Type Question

Question 11 of 65
11. Question
Consider the following tables T1 and T2.
In table T1, P is the primary key and Q is the foreign key referencing R in table T2 with on delete cascade and onupdate cascade. In table T2, R is the primary key and S is the foreign key referencing P in table T1 ondelete set NULL and onupdate cascade. In order to delete record from table T1, the number of additional records that need to be deleted from table T1 is ______________.
CorrectIncorrectHint
NAT Type Question

Question 12 of 65
12. Question
Which of the following is/are shared by all the threads in a process ?
I. Program counter II. Stack
III. Address space IV. Registers
CorrectIncorrect 
Question 13 of 65
13. Question
A circular queue has been implemented using a single linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the rear node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operation can be performed in O (1) time ?
I. Next pointer of front node points to the rear node.
II. Next pointer of rear node points to the front node.
CorrectIncorrect 
Question 14 of 65
14. Question
Given the following binary number in 32bit (single precision) IEEE754 format:
00111110011011010000000000000000
The decimal value closest to this floating point number is
CorrectIncorrect 
Question 15 of 65
15. Question
An ER model of a database consists of entity types A and B. These are connected by a relationship R which does not have its own attribute. Under which one of the following conditions, can the relational table for R be merged with that of A?
CorrectIncorrect 
Question 16 of 65
16. Question
CorrectIncorrect 
Question 17 of 65
17. Question
Match the following according to input (from the left column) to the complier phase (in the right column) that processes it.
CorrectIncorrect 
Question 18 of 65
18. Question
Consider the following statements about the routing protocols, Routing Information Protocol (RIP) and Open Shortest Path First (OSPF) in an IPv4 network.
I. RIP uses distance vector routing
II. RIP packets are sent using UDP
III. OSPF packets are sent using TCP
OSPF operation is based on linkstate routing
Which of the statements above are CORRECT?
CorrectIncorrect 
Question 19 of 65
19. Question
If and then the constants R and S are respectively
CorrectIncorrect 
Question 20 of 65
20. Question
In a file allocation system, which of the following allocation schemes(s) can be used if no external fragmentation is allowed?
I. Contiguous II. Linked III. Indexed
CorrectIncorrect 
Question 21 of 65
21. Question
Consider a quadratic equation x^{2} – 13x + 36 = 0 with coefficients in a base b. The solutions of this equation in the same base b are x = 5 and x = 6. Then b = ___________.
CorrectIncorrectHint
NAT Type Question

Question 22 of 65
22. Question
Identify the language generated by the following grammar, where S is start variable.
S → XY
X → aXa
Y → aYb∈
CorrectIncorrect 
Question 23 of 65
23. Question
The representation of the value of a 16bit unsigned integer X in hexadecimal number system is BCA9. The representation of the value of X in octal number system is
CorrectIncorrect 
Question 24 of 65
24. Question
Consider the following function implemented in C:
void printxy (int x, int y) {
int *ptr ;
x = 0;
ptr = &x;
y = * ptr;
* ptr = l;
print f (“%d, %d,” x, y);
}
The output of invoking printxy (l, l) is
CorrectIncorrect 
Question 25 of 65
25. Question
The maximum number of IPv4 router addresses that can be listed in the record route (RR) option field of an IPv4 header is _________.
CorrectIncorrectHint
NAT Type Question

Question 26 of 65
26. Question
Consider a binary code that consists of only four valid code words as given below:
00000,01011,10101,11110
Let the minimum Hamming distance of the code be p and the maximum number of erroneous bits that can be corrected by the code be q. Then the values of p and q are
CorrectIncorrect 
Question 27 of 65
27. Question
A system shares 9 tape drives. The current allocation and maximum requirement of tape drives for three processes are shown below:
Which of the following best describes current state of the system ?
CorrectIncorrect 
Question 28 of 65
28. Question
Two transactions T_{1} and T_{2} are given as
T_{1} : r_{1} (X) w_{1} (X) r_{1} (Y) w_{1} (Y)
T_{2} : r_{2} (Y) w_{2} (Y) r_{2} (Z) w_{2} (Z)
where r_{i}(V) denotes a read operation by transaction T_{i} on a variable V and w_{i}(V) denotes a write operations by transaction T_{i} on a variable V. The total number of conflict serializable schedules that can be formed by T1 and T2 is _____________.
CorrectIncorrectHint
NAT Type Question

Question 29 of 65
29. Question
If w, x, y, z are Boolean variables, then which one of the following is INCORRECT ?
CorrectIncorrect 
Question 30 of 65
30. Question
Consider the following C Program.
# include <stdio.h>
#include< string.h>
#int main ( ) {
char* c = “GATECSIT2017”;
char* p = c;
printf(“%d”, (int) strlen (c+2[p]6[p]1));
return 0;
}
The output of the program is _______________.
CorrectIncorrectHint
NAT Type Question

Question 31 of 65
31. Question
P and Q are considering to apply for a job. The probability that P applies for the job is The probability that P applies for the job given that Q applies for the job is and the probability that Q applies for the job given that P applies for the job Then the probability that P does not apply for the job given that Q does not apply for the job is
CorrectIncorrect 
Question 32 of 65
32. Question
If the characteristics polynomial of 3× 3 matrix M over R ( the set of real numbers) is λ^{3} – 4λ^{2} + aλ + 30, a ∈ R, and one eigenvalue of M is 2, then the largest among the absolute values of the eigenvalues of M is ________.
CorrectIncorrectHint
NAT Type Question

Question 33 of 65
33. Question
Consider the following expression grammar G:
E → E – TT
T → T + FF
F → (E) id
Which of the following grammars is not left recursive, but is equivalent to G?
CorrectIncorrect 
Question 34 of 65
34. Question
In a twolevel cache system, the access times of L_{1} and L_{2} caches are 1 and 8 clock cycles, respectively. The miss penalty from L2 cache to main memory is 18 clock cycles . The miss rate of L_{1} cache is twice that of L_{2}. The average memory access time (AMAT) of this cache system is 2 cycles. This miss rates of L_{1} and L_{2} respectively are :
CorrectIncorrect 
Question 35 of 65
35. Question
Consider two hosts X and Y, connected by a single direct link of rate 10^{6} bits/sec. The distance between the two hosts is 10,000 km and the propagation speed along the link is 2 × 10^{8} m/sec. Host X sends a file of 50,000 bytes as one large message to host Y continuously. Let the transmission and propagation delays be p milliseconds and q milliseconds, respectively . Then the values of p and q are
CorrectIncorrect 
Question 36 of 65
36. Question
Consider the recurrence function
Then T(n) in terms of θ notation is
CorrectIncorrect 
Question 37 of 65
37. Question
If a random variable X has a Poisson distribution with mean 5, then the expectation E[(X+2)^{2}] equals ______.
CorrectIncorrectHint
NAT Type Question

Question 38 of 65
38. Question
Consider the following C function
int fun (int n) {
int i, j;
for (i = 1; i < = n; i++) {
for (j = 1 ; j < n ; j+=i) {
printf (“%d %d , i, j ) ;
}
}
}
Time complexity of fun in terms of θ notation is
CorrectIncorrect 
Question 39 of 65
39. Question
The preorder transversal of a binary search tree is given by 12, 8, 6, 2, 7, 9, 10, 16, 15, 19, 17, 20. Then the postorder traversal of this tree is:
CorrectIncorrect 
Question 40 of 65
40. Question
Consider the C program fragment below which is meant to divide x by y using repeated subtractions. The variables x, y, q and r are all unsigned int.
while (r >= y) {
r = r – y;
q = q +1;
}
Which of the following conditions on the variables x, y, q and r before the execution of the fragment will ensure that the loop terminates in a state satisfying the condition x = = (y*q + r)?
CorrectIncorrect 
Question 41 of 65
41. Question
A message is made up entirely of characters from the set X= {P,Q,R,S,T}. The table of probabilities for each of the characters is shown below:
If a message of 100 characters over X is encoded using Huffman coding, then the expected length of the encoded message in bits is_____
CorrectIncorrectHint
NAT Type Question

Question 42 of 65
42. Question
The next state table of a 2bit saturating upcounter is given below.
The counter is built as a synchronous sequential circuit using T flipflops. The expression for T_{1} and T_{0} are
CorrectIncorrect 
Question 43 of 65
43. Question
Consider the set of processes with arrival time (in milliseconds). CPU burst time (in milliseconds), and priority (0 is the highest priority) shown below. None of the processes have I/O burst time.
The average waiting time (in milliseconds) of all the processes using preemptive priority scheduling algorithm is __________
CorrectIncorrectHint
NAT Type Question

Question 44 of 65
44. Question
For any discrete random variable X, with probability mass function P(X = j) = p_{j}, p_{j} ≥ 0, j ∈ {0,….. N} and define the polynomial function g_{x For a certain discrete random variable Y, there exists a scalar β ∈ [0, 1] such that gY (z) = (1 – β+ βz)n. The expectation of Y is}
CorrectIncorrect 
Question 45 of 65
45. Question
The read access times and the hit ratios for different caches in a memory hierarchy are as given below.
The read access time of main memory is 90 nanoseconds. Assume that the caches use the referred wordfirst read policy and the write back policy. Assume that all the caches are direct mapped caches. Assume that the dirty bit is always 0 for all the blocks in the caches. In execution of a program, 60% of memory reads are for instruction fetch and 40% are for memory operand fetch. The average read access time in nanoseconds (up to 2 decimal places) is______.
CorrectIncorrectHint
NAT Type Question

Question 46 of 65
46. Question
If the ordinary generating function of a sequence then a_{3} – a_{0} is equal to ______.
CorrectIncorrectHint
NAT Type Question

Question 47 of 65
47. Question
Consider the following snippet of a C program. Assume that swap (&x, &y) exchanges the contents of x and y.
int main ( ) {
int array[]={3,5,1,4,6,2};
int done =0 ;
int i ;
while (done = = 0) {
done = 1;
for (i = 0; i <=4; i ++) {
if (array [i] < array [i +1]) {
swap (& array [i], &array [i+1]);
done = 0;
}
}
for (i = 5 ; i > =1; i –) {
if (array [i] > array [ i1]) {
swap ( & array [i] , &array [i1]);
done = 0;
}
}
}
printf ( “ %d “ , array [3] );
}
The output of the program is ____________.
CorrectIncorrectHint
NAT Type Question

Question 48 of 65
48. Question
Consider the following C program.
# include <stdio.h>
int main ( ) {
int m = 10;
int n, n1;
n = ++m;
n1 = m++;
n–;
–n1;
n – = nl;
printf (“%d”, n) ;
return 0;
}
The output of the program is ______________.
CorrectIncorrectHint
NAT Type Question

Question 49 of 65
49. Question
Consider the following database table named top _scorer.
Consider the following SQL query:
SELECT ta.player FROM top _scorer AS ta
WHERE ta.goals > ALL (SELECT tb. goals
FROM top _ scorer AS tb
WHERE tb.country = ‘Spain’)
AND ta.goals > ANY (SELECT tc. goals
FROM top_ scorer AS tc
WHERE tc.country = ‘Germany’)
The number of tuples returned by the above SQL query is ___________.
CorrectIncorrectHint
NAT Type Question

Question 50 of 65
50. Question
Given f (w, x, y, z) = ∑_{m} (0,1,2,3,7,8,10) + ∑_{d} (5,6,11,15), where d represents the don’t care condition in Karnaugh maps. Which of the following is a minimum productofsums (POS) form of f(w, x, y, z) ?
CorrectIncorrect 
Question 51 of 65
51. Question
In a B^{+} tree, if the search –key value is 8 bytes long, the block size is 512 bytes and the block pointer size is 2 bytes, then maximum order of the B+ tree is _______________.
CorrectIncorrectHint
NAT Type Question

Question 52 of 65
52. Question
Let L(R) be the language represented by regular expression R. Let L(G) be the language generated by a context free grammar G. Let L (M) be the language accepted by a Turning machine M. Which of the following decision problems are undecidable ?
I. Given a regular expression R and a string w, is w ∈ L(R)?
II. Given a contextfree grammar G, L(G) = ∅
III. Given a contextfree grammar G, is L(G) = ∑^{*} for some alphabet ∑?
IV. Given a Turning machine M and a string w, is w ∈ L(M)?
CorrectIncorrect 
Question 53 of 65
53. Question
Consider a machine with a byte addressable main memory of 2^{32}bytes divided into blocks of size 32 bytes. Assume that a direct mapped cache having 512 cache lines is used with this machine. The size of the tag field in bits is ______.
CorrectIncorrectHint
NAT Type Question

Question 54 of 65
54. Question
Let δ denote that transition function and denote the extended transition function of the ∈ − NFA whose transition table is given below:
Then (q_{2}, aba) is
CorrectIncorrect 
Question 55 of 65
55. Question
Consider the following languages.
L_{1} = {a^{p}p is a prime number}
L_{2} = {a^{n}b^{m}c^{2m}n ≥ 0, m ≥ 0}
L_{3} = {a^{n}b^{n}c^{2n}n ≥ 0}
L_{4} = {a^{n}b^{n}n ≥ 1}
Which of the following are CORRECT ?
I. L_{1} is contextfree but not regular.
II. L_{2} is not contextfree.
III. L_{3} is not contextfree but recursive.
IV. L_{4} is deterministic contextfree.
CorrectIncorrect 
Question 56 of 65
56. Question
There are 3 red socks, 4 green socks and 3 blue socks, you choose 2 socks. The probability that they are of the same colour is ___________.
CorrectIncorrect 
Question 57 of 65
57. Question
Choose the option with words that are not synonyms.
CorrectIncorrect 
Question 58 of 65
58. Question
There are five buildings called V, W, X, Y and Z in a row (not necessarily in that order). V is to the west of W. Z is to the East of X and the West of V. W is to the West of Y. Which is the building in the middle ?
CorrectIncorrect 
Question 59 of 65
59. Question
A test has twenty questions worth 100 marks in total. There are two types of questions, multiple choice questions are worth 3 marks each and essay questions are worth 11 marks each. How many multiple choice questions does the exam have?
CorrectIncorrect 
Question 60 of 65
60. Question
Saturn is ____ to be seen on a clear night with the naked eye.
CorrectIncorrect 
Question 61 of 65
61. Question
“We lived in a culture that denied any merit to literary works, considering them important only when they were handmaidens to something seemingly more urgent – namely ideology. This was a country where all gestures, even the most private, were interpreted in political terms.”
The author’s belief that ideology is not as important as literature is revealed by the word:
CorrectIncorrect 
Question 62 of 65
62. Question
X is a 30 digit number starting with the digit 4 followed by the digit 7, then the number X^{3} will have
CorrectIncorrect 
Question 63 of 65
63. Question
There are three boxes, one contains apples, another contains oranges and the last one contains both apples and oranges. All three are known to be incorrectly labelled. If you are permitted to open just one box and then pull out and inspect only one fruit, which box would you open to determine the contents of all three boxes?
CorrectIncorrect 
Question 64 of 65
64. Question
An air pressure contour line joins locations in a region having the same atmospheric pressure . The following is an air contour plot of a geographical region . Contour lines are shown at 0.05 bar intervals in this plot.
If the possibility of a thunderstorm is given by how fast air pressure rises or drops over a region, which of the following regions is most likely to have a thunderstorm?
CorrectIncorrect 
Question 65 of 65
65. Question
The number of roots of e^{x} + 0.5x^{2} – 2 = 0 in the range [−5, 5] is
CorrectIncorrect