MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 100 Mcqs, each offering curated multiple-choice questions to sharpen your Computer Science knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
In a press meet on the recent scam, the minister said, "The buck stops here". What did the minister convey by the statement? |
| A. | He wants all the money |
| B. | He will return the money |
| C. | He will assume final responsibility |
| D. | He will resist all enquiries |
| Answer» C. He will assume final responsibility | |
| 52. |
Choose the most appropriate word from the options given below to complete the following sentence. He could not understand the judges awarding her the first prize, because he thought that her performance was quite __________ |
| A. | superb |
| B. | medium |
| C. | mediocre |
| D. | exhilarating |
| Answer» C. mediocre | |
| 53. |
Consider a uniprocessor system executing three tasks T1, T2 and T3, each of which is composed of an infinite sequence of jobs (or instances) which arrive periodically at intervals of 3, 7 and 20 milliseconds, respectively. The priority of each task is the inverse of its period and the available tasks are scheduled in order of priority, with the highest priority task scheduled first. Each instance of T1, T2 and T3 requires an execution time of 1, 2 and 4 milliseconds, respectively. Given that all tasks initially arrive at the beginning of the 1st milliseconds and task preemptions are allowed, the first instance of T3 completes its execution at the end of ______________ milliseconds. |
| A. | 5 |
| B. | 10 |
| C. | 12 |
| D. | 15 |
| Answer» D. 15 | |
| 54. |
The least number of temporary variables required to create a three-address code in static single assignment form for the expression q + r/3 + s – t * 5 + u * v/w is |
| A. | 4 |
| B. | 8 |
| C. | 7 |
| D. | 9 |
| Answer» C. 7 | |
| 55. |
Let G be a connected planar graph with 10 vertices. If the number of edges on each face is three, then the number of edges in G is _ |
| A. | 24 |
| B. | 20 |
| C. | 32 |
| D. | 64 |
| Answer» B. 20 | |
| 56. |
Suppose that the stop-and-wait protocol is used on a link with a bit rate of 64 kilobits per second and 20 milliseconds propagation delay. Assume that the transmission time for the acknowledgment and the processing time at nodes are negligible. Then the minimum frame size in bytes to achieve a link utilization of at least 50% is _____ |
| A. | 160 |
| B. | 320 |
| C. | 640 |
| D. | 220 |
| Answer» C. 640 | |
| 57. |
Consider the following C program segment. while (first |
| A. | 3 |
| B. | 4 |
| C. | 5 |
| D. | 6 |
| Answer» D. 6 | |
| 58. |
Consider an Entity-Relationship (ER) model in which entity sets E1 and E2 are connected by an m : n relationship R12, E1 and E3 are connected by a 1 : n (1 on the side of E1 and n on the side of E3) relationship R13. E1 has two single-valued attributes a11 and a12 of which a11 is the key attribute. E2 has two single-valued attributes a21 and a22 is the key attribute. E3 has two single-valued attributes a31 and a32 of which a31 is the key attribute. The relationships do not have any attributes. If a relational model is derived from the above ER model, then the minimum number of relations that would be generated if all the relations are in 3NF is ___________ |
| A. | 2 |
| B. | 3 |
| C. | 4 |
| D. | 5 |
| Answer» D. 5 | |
| 59. |
An algorithm performs (logN)1/2 find operations, N insert operations, (logN)1/2 operations, and (logN)1/2 decrease-key operations on a set of data items with keys drawn from a linearly ordered set. For a delete operation, a pointer is provided to the record that must be deleted. For the decrease-key operation, a pointer is provided to the record that has its key decreased. Which one of the following data structures is the most suited for the algorithm to use, if the goal is to achieve the best total asymptotic complexity considering all the operations? |
| A. | Unsorted array |
| B. | Min-heap |
| C. | Sorted array |
| D. | Sorted doubly linked list |
| Answer» B. Min-heap | |
| 60. |
Consider the operations f(X, Y, Z) = X'YZ + XY' + Y'Z' and g(X′, Y, Z) = X′YZ + X′YZ′ + XY Which one of the following is correct? |
| A. | Both {f} and {g} are functionally complete |
| B. | Only {f} is functionally complete |
| C. | Only {g} is functionally complete |
| D. | Neither {f} nor {g} is functionally complete |
| Answer» C. Only {g} is functionally complete | |
| 61. |
Consider a non-pipelined processor with a clock rate of 2.5 gigahertz and average cycles per instruction of four. The same processor is upgraded to a pipelined processor with five stages; but due to the internal pipeline delay, the clock speed is reduced to 2 gigahertz. Assume that there are no stalls in the pipeline. The speed up achieved in this pipelined processor is __________. A |
| A. | 3.2 |
| B. | 3.0 |
| C. | 2.2 |
| D. | 2.0 |
| Answer» B. 3.0 | |
| 62. |
A positive edge-triggered D flip-flop is connected to a positive edge-triggered JK flipflop as follows. The Q output of the D flip-flop is connected to both the J and K inputs of the JK flip-flop, while the Q output of the JK flip-flop is connected to the input of the D flip-flop. Initially, the output of the D flip-flop is set to logic one and the output of the JK flip-flop is cleared. Which one of the following is the bit sequence (including the initial state) generated at the Q output of the JK flip-flop when the flip-flops are connected to a free-running common clock? Assume that J = K = 1 is the toggle mode and J = K = 0 is the state-holding mode of the JK flip-flop. Both the flip-flops have non-zero propagation delays. |
| A. | 0110110. |
| B. | 0100100... |
| C. | 011101110.. |
| D. | 011001100... |
| Answer» B. 0100100... | |
| 63. |
Consider the following 2 × 2 matrix A where two elements are unknown and are marked by a and b. The eigenvalues of this matrix are –1 and 7. What are the values of a and b? A = | 1 4 | | b a | |
| A. | a = 6, b = 4 |
| B. | a = 4, b = 6 |
| C. | a = 3, b = 5 |
| D. | a = 5, b = 3 |
| Answer» E. | |
| 64. |
Consider the following pseudo code, where x and y are positive integers. begin q := 0 r := x while r >= y do begin r := r – y q := q + 1 end end The post condition that needs to be satisfied after the program terminates is |
| A. | {r = qx + y ∧ r < y} |
| B. | {x = qy + r ∧ r < y} |
| C. | {y = qx + r ∧ 0 < r < y} |
| D. | { q + 1 < r–y ∧ y > 0} |
| Answer» C. {y = qx + r ∧ 0 < r < y} | |
| 65. |
Consider a max heap, represented by the array: 40, 30, 20, 10, 15, 16, 17, 8, 4. Now consider that a value 35 is inserted into this heap. After insertion, the new heap is |
| A. | 40, 30, 20, 10, 15, 16, 17, 8, 4, 35 |
| B. | 40, 35, 20, 10, 30, 16, 17, 8, 4, 15 |
| C. | 40, 30, 20, 10, 35, 16, 17, 8, 4, 15 |
| D. | 40, 35, 20, 10, 15, 16, 17, 8, 4, 30 |
| Answer» C. 40, 30, 20, 10, 35, 16, 17, 8, 4, 15 | |
| 66. |
Consider the following C function. int fun1 (int n) { int i, j, k, p, q = 0; for (i = 1; i1; j=j/2) ++p; for (k=1; k |
| A. | n3 |
| B. | n (logn)2 |
| C. | nlogn |
| D. | nlog(logn) |
| Answer» E. | |
| 67. |
Suppose the following disk request sequence (track numbers) for a disk with 100 tracks is given: 45, 20, 90, 10, 50, 60, 80, 25, 70. Assume that the initial position of the R/W head is on track 50. The additional distance that will be traversed by the R/W head when the Shortest Seek Time First (SSTF) algorithm is used compared to the SCAN (Elevator) algorithm (assuming that SCAN algorithm moves towards 100 when it starts execution) is _________ tracks |
| A. | 8 |
| B. | 9 |
| C. | 10 |
| D. | 11 |
| Answer» D. 11 | |
| 68. |
Consider a LAN with four nodes S1, S2, S3 and S4. Time is divided into fixed-size slots, and a node can begin its transmission only at the beginning of a slot. A collision is said to have occurred if more than one node transmit in the same slot. The probabilities of generation of a frame in a time slot by S1, S2, S3 and S4 are 0.1, 0.2, 0.3 and 0.4, respectively. The probability of sending a frame in the first slot without any collision by any of these four stations is |
| A. | 0.462 |
| B. | 0.711 |
| C. | 0.5 |
| D. | 0.652 |
| Answer» B. 0.711 | |
| 69. |
The height of a tree is the length of the longest root-to-leaf path in it. The maximum and minimum number of nodes in a binary tree of height 5 are |
| A. | 63 and 6, respectively |
| B. | 64 and 5, respectively |
| C. | 32 and 6, respectively |
| D. | 31 and 5, respectively |
| Answer» B. 64 and 5, respectively | |
| 70. |
A file is organized so that the ordering of data records is the same as or close to the ordering of data entries in some index. Then that index is called |
| A. | Dense |
| B. | Sparse |
| C. | Clustered |
| D. | Unclustered |
| Answer» D. Unclustered | |
| 71. |
What are the worst-case complexities of insertion and deletion of a key in a binary search tree? |
| A. | Θ(logn) for both insertion and deletion |
| B. | Θ(n) for both insertion and deletion |
| C. | Θ(n) for insertion and Θ(logn) for deletion |
| D. | Θ(logn) for insertion and Θ(n) for deletion |
| Answer» C. Θ(n) for insertion and Θ(logn) for deletion | |
| 72. |
Which one of the following fields of an IP header is NOT modified by a typical IP router? |
| A. | Checksum |
| B. | Source address |
| C. | Time to Live (TTL |
| D. | Length |
| Answer» C. Time to Live (TTL | |
| 73. |
Suppose that everyone in a group of N people wants to communicate secretly with the N–1 others using symmetric key cryptographic system. The communication between any two persons should not be decodable by the others in the group. The number of keys required in the system as a whole to satisfy the confidentiality requirement is |
| A. | 2N |
| B. | N(N – 1) |
| C. | N(N – 1)/2 |
| D. | (N – 1)2 |
| Answer» D. (N – 1)2 | |
| 74. |
Consider a 4 bit Johnson counter with an initial value of 0000. The counting sequence of this counter is: |
| A. | 0, 1, 3, 7, 15, 14, 12, 8, 0 |
| B. | 0, 1, 3, 5, 7, 9, 11, 13, 15, 0 |
| C. | 0, 2, 4, 6, 8, 10, 12, 14, 0 |
| D. | 0, 8, 12, 14, 15, 7, 3, 1, 0 |
| Answer» E. | |
| 75. |
Suppose two hosts use a TCP connection to transfer a large file. Which of the following statements is/are False with respect to the TCP connection? 1. If the sequence number of a segment is m, then the sequence number of the subsequent segment is always m+1. 2. If the estimated round trip time at any given point of time is t sec, the value of the retransmission timeout is always set to greater than or equal to t sec. 3. The size of the advertised window never changes during the course of the TCP connection. 4. The number of unacknowledged bytes at the sender is always less than or equal to the advertised window |
| A. | 3 only |
| B. | 1 and 3 only |
| C. | 1 and 4 only |
| D. | 2 and 4 only |
| Answer» C. 1 and 4 only | |
| 76. |
In the LU decomposition of the matrix | 2 2 | | 4 9 | , if the diagonal elements of U are both 1, then the lower diagonal entry l22 of L is |
| A. | 4 |
| B. | 5 |
| C. | 6 |
| D. | 7 |
| Answer» C. 6 | |
| 77. |
In one of the pairs of protocols given below, both the protocols can use multiple TCP connections between the same client and the server. Which one is that? |
| A. | HTTP, FTP |
| B. | HTTP, TELNET |
| C. | FTP, SMTP |
| D. | HTTP, SMTP |
| Answer» B. HTTP, TELNET | |
| 78. |
For a set A, the power set of A is denoted by 2A. If A = {5, {6}, {7}}, which of the following options are True. Q12 |
| A. | I and III only |
| B. | II and III only |
| C. | I, II and III only |
| D. | I, II and IV only |
| Answer» D. I, II and IV only | |
| 79. |
Which of following statements is/are False? 1. XML overcomes the limitations in HTML to support a structured way of organizing content. 2. XML specification is not case sensitive while HTML specification is case sensitive. 3. XML supports user defined tags while HTML uses pre-defined tags. 4. XML tags need not be closed while HTML tags must be closed. |
| A. | 2 only |
| B. | 1 only |
| C. | 2 and 4 only |
| D. | 3 and 4 only |
| Answer» B. 1 only | |
| 80. |
Which one of the following is not equivalent to p←→q Q81 |
| A. | A |
| B. | B |
| C. | C |
| D. | D |
| Answer» D. D | |
| 81. |
Which one of the following is True at any valid state in shift-reduce parsing? |
| A. | Viable prefixes appear only at the bottom of the stack and not inside |
| B. | Viable prefixes appear only at the top of the stack and not inside |
| C. | The stack contains only a set of viable prefixes |
| D. | The stack never contains viable prefixes |
| Answer» D. The stack never contains viable prefixes | |
| 82. |
Consider a system with byte-addressable memory, 32 bit logical addresses, 4 kilobyte page size and page table entries of 4 bytes each. The size of the page table in the system in megabytes is |
| A. | 2 |
| B. | 4 |
| C. | 8 |
| D. | 16 |
| Answer» C. 8 | |
| 83. |
The output of the following C program is __________. void f1 (int a, int b) { int c; c=a; a=b; b=c; } void f2 (int *a, int *b) { int c; c=*a; *a=*b;*b=c; } int main() { int a=4, b=5, c=6; f1(a, b); f2(&b, &c); printf (“%d”, c-a-b); return 0; |
| A. | -5 |
| B. | -4 |
| C. | 5 |
| D. | 3 |
| Answer» B. -4 | |
| 84. |
Which of the following is/are correct inorder traversal sequence(s) of binary search tree(s)? 1. 3, 5, 7, 8, 15, 19, 25 2. 5, 8, 9, 12, 10, 15, 25 3. 2, 7, 10, 8, 14, 16, 20 4. 4, 6, 7, 9, 18, 20, 25 |
| A. | 1 and 4 only |
| B. | 2 and 3 only |
| C. | 2 and 4 only |
| D. | 2 only |
| Answer» B. 2 and 3 only | |
| 85. |
The following two functions P1 and P2 that share a variable B with an initial value of 2 execute concurrently. P1() { C = B – 1; B = 2*C; } P2() { D = 2 * B; B = D - 1; } The number of distinct values that B can possibly take after the execution is |
| A. | 3 |
| B. | 2 |
| C. | 5 |
| D. | 4 |
| Answer» B. 2 | |
| 86. |
For computers based on three-address instruction formats, each address field can be used to specify which of the following: S1: A memory operand S2: A processor register S3: An implied accumulator register |
| A. | Either S1 or S2 |
| B. | Either S2 or S3 |
| C. | Only S2 and S3 |
| D. | All of S1, S2 and S3 |
| Answer» B. Either S2 or S3 | |
| 87. |
Select operation in SQL is equivalent to |
| A. | the selection operation in relational algebra |
| B. | the selection operation in relational algebra, except that select in SQL retains duplicates |
| C. | the projection operation in relational algebra |
| D. | the projection operation in relational algebra, except that select in SQL retains duplicates |
| Answer» E. | |
| 88. |
List-I A. Prim’s algorithm for minimum spanning tree B. Floyd-Warshall algorithm for all pairs shortest paths C. Mergesort D. Hamiltonian circuit List-II 1. Backtracking 2. Greed method 3. Dynamic programming 4. Divide and conquer Codes: A B C D (a) 3 2 4 1 (b) 1 2 4 3 (c) 2 3 4 1 (d) 2 1 3 4 |
| A. | a |
| B. | b |
| C. | c |
| D. | d |
| Answer» D. d | |
| 89. |
For any two languages L1 and L2 such that L1 is context free and L2 is recursively enumerable but not recursive, which of the following is/are necessarily true? 1. L1' (complement of L1) is recursive 2. L2' (complement of L2) is recursive 3. L1' is context-free 4. L1' ∪ L2 is recursively enumerable |
| A. | 1 only |
| B. | 3 only |
| C. | 3 and 4 only |
| D. | 1 and 4 only |
| Answer» E. | |
| 90. |
Which one of the following is the recurrence equation for the worst case time complexity of the Quicksort algorithm for sorting n(≥ 2) numbers? In the recurrence equations given in the options below, c is a constant. |
| A. | T(n) = 2T (n/2) + cn |
| B. | T(n) = T(n – 1) + T(0) + cn |
| C. | T(n) = 2T (n – 2) + cn |
| D. | T(n) = T(n/2) + cn |
| Answer» C. T(n) = 2T (n – 2) + cn | |
| 91. |
List-I List-II A. Condition coverage 1. Black-box testing B. Equivalence class partitioning 2. System testing C. Volume testing 3. White-box testing D. Alpha testing 4. Performance testing Codes: A B C D (a) 2 3 1 4 (b) 3 4 2 1 (c) 3 1 4 2 (d) 3 1 2 4 |
| A. | a |
| B. | b |
| C. | c |
| D. | d |
| Answer» D. d | |
| 92. |
The probabilities that a student passes in Mathematics, Physics and Chemistry are m, p and c respectively. Of these subjects, the student has 75% chance of passing in at least one, a 50% chance of passing in at least two and a 40% chance of passing in exactly two. Following relations are drawn in m, p and c: 1. p + m + c = 27/20 2. p + m + c = 13/20 3. (p) × (m) × (c) = 1/10 |
| A. | Only relation 1 is true |
| B. | only relation 2 is true |
| C. | Relations 2 and 3 are true |
| D. | Relations 1 and 3 are true |
| Answer» E. | |
| 93. |
The given statement is following by some courses of action. Assuming the statement to be true, decide the correct option. Statement: There has been a significant drop in the water level in the lakes supplying water to the city. Course of action: 1. The water supply authority should impose a partial cut in supply to tackle the situation. 2. The government should appeal to all the residents through mass media for minimal use of water. 3. The government should ban the water supply in lower areas |
| A. | Statement 1 and 2 follow |
| B. | Statement 1 and 3 follow |
| C. | Statement 2 and 3 follow |
| D. | All statements follow |
| Answer» B. Statement 1 and 3 follow | |
| 94. |
Select the alternative meaning of the underlined part of the sentence. The chain snatchers took to their heels when the police party arrived. |
| A. | took shelter in a thick jungle |
| B. | open indiscriminate fire |
| C. | took to flight |
| D. | unconditionally surrendered |
| Answer» D. unconditionally surrendered | |
| 95. |
What is the average of the marks obtained by the class in the examination? |
| A. | 2.290 |
| B. | 2.970 |
| C. | 6.795 |
| D. | 8.795 |
| Answer» D. 8.795 | |
| 96. |
Which one of the following combinations is incorrect? |
| A. | Acquiescence - Submission |
| B. | Wheedle - Roundabout |
| C. | Flippancy - Lightness |
| D. | Profligate - Extravagant |
| Answer» C. Flippancy - Lightness | |
| 97. |
Based on the given statements, select the most appropriate option to solve the given question. If two floors in a certain building are 9 feet apart, how many steps are there in a set of stairs that extends from the first floor to the second floor of the building? Statements: 1. Each step is 3/4 foot high. 2. Each step is 1 foot wide. |
| A. | Statement 1 alone is sufficient, but statement 2 alone is not sufficien |
| B. | Statement 2 alone is sufficient, but statement 1 alone is not sufficient |
| C. | Both statement together are sufficient, but neither statement alone is sufficien |
| D. | Statement 1 and 2 together are not sufficien |
| Answer» B. Statement 2 alone is sufficient, but statement 1 alone is not sufficient | |
| 98. |
Given Set A = {2, 3, 4, 5} and Set B = {11, 12, 13, 14, 15}, two numbers are randomly selected, one from each set. What is the probability that the sum of the two numbers equals 16? |
| A. | 0.20 |
| B. | 0.25 |
| C. | 0.30 |
| D. | 0.33 |
| Answer» B. 0.25 | |
| 99. |
Which of the following options is the closest in meaning to the sentence below? She enjoyed herself immensely at the party. |
| A. | She had a terrible time at the party |
| B. | She had a horrible time at the party |
| C. | She had a terrific time at the party |
| D. | She had a terrifying time at the party |
| Answer» D. She had a terrifying time at the party | |
| 100. |
Didn’t you buy _________ when you went shopping? |
| A. | any paper |
| B. | much paper |
| C. | no paper |
| D. | a few paper |
| Answer» B. much paper | |