MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 128 Mcqs, each offering curated multiple-choice questions to sharpen your C Sharp Programming knowledge and support exam preparation. Choose a topic below to get started.
| 51. |
If the Consistency Index of soil is in the range of 50 - 75 % then the soil is said to be |
| A. | Soft |
| B. | Medium |
| C. | Stiff |
| D. | Hard |
| Answer» C. Stiff | |
| 52. |
Over dry mass of a pat of clay is 10.8 gm and mass of mercury displaced on immersion is 84.2 gm. If the specific gravity of solids is 2.72 and the density of the mercury is 13.6 g/cm3, the shrinkage limit of the soil will be nearly |
| A. | 12% |
| B. | 15% |
| C. | 18% |
| D. | 21% |
| Answer» E. | |
| 53. |
In a wet soil mass, air occupies 1/6 of its volume and water occupies 1/3 of its volume. The void ratio of the soil is:- |
| A. | 0.67 |
| B. | 1 |
| C. | 0.25 |
| D. | 0.5 |
| Answer» C. 0.25 | |
| 54. |
Liquidity index for a soil with water content w, plastic limit wP and liquid limit wL is given by the expression |
| A. | \(\frac{{w - {w_P}}}{{{w_L} - {w_P}}}\) |
| B. | \(\frac{{{w_L} - w}}{{{w_L} - {w_P}}}\) |
| C. | wL - wP |
| D. | \(\frac{{{w_L} - {w_P}}}{{{w_L} - w}}\) |
| Answer» B. \(\frac{{{w_L} - w}}{{{w_L} - {w_P}}}\) | |
| 55. |
A soil has liquid limit of 60%, plastic limit of 35%, shrinkage limit of 20% and it has a natural moisture content of 50%. What is the liquidity index of the soil? |
| A. | 0.4 |
| B. | 0.6 |
| C. | 1.5 |
| D. | 1.3 |
| Answer» C. 1.5 | |
| 56. |
In soil Mechanics and Foundation Engineering, the ratio of the density of solid to that of water at a given temperature is termed as _______ of soil solids. |
| A. | specific gravity |
| B. | porosity |
| C. | degree of saturation |
| D. | void ratio |
| Answer» B. porosity | |
| 57. |
Consistency index for a clayey soil is __________, where LL = liquid limit, PL = plastic limit, PI = plasticity index, w = natural moisture content |
| A. | 0.5 w |
| B. | \(\frac{LL - w}{PI}\) |
| C. | \(\frac{w - LL}{PI}\) |
| D. | LL - PL |
| Answer» C. \(\frac{w - LL}{PI}\) | |
| 58. |
A soil has a Liquid Limit of 40% and Plastic Limit of 30%. If its Flow Index is 20%, the corresponding Toughness Index would be |
| A. | 0.25 |
| B. | 0.50 |
| C. | 0.75 |
| D. | 1.00 |
| Answer» C. 0.75 | |
| 59. |
Minimum quantity of water at which the soil can be rolled in 3 mm dia threads without cracks is termed as:- |
| A. | Plastic limit |
| B. | Plasticity index |
| C. | Shrinkage limit |
| D. | Liquid limit |
| Answer» B. Plasticity index | |
| 60. |
A soil has a liquid limit of 40% and lies above the A-line when plotted on plasticity chart. As per IS soil classification, the group symbol of the soil is |
| A. | CH |
| B. | MH |
| C. | MI |
| D. | CI |
| Answer» E. | |
| 61. |
If the liquid limit is increased then, the compression index of soil will |
| A. | Increase |
| B. | May increase or decrease |
| C. | Decrease |
| D. | Remain constant |
| Answer» B. May increase or decrease | |
| 62. |
A soil has bulk unit weight of 20 kN/m2 and water content of 17%. Calculate the water content if the soil particle dries to a unit weight of 19 kN/m2 and the void ratio remains constant. (Give the answer rounded to the nearest integer value.) |
| A. | 20% |
| B. | 15% |
| C. | 8% |
| D. | 11% |
| Answer» E. | |
| 63. |
The spanning tree will be maximally acyclic if ____________ |
| A. | one additional edge makes a cycle in the tree |
| B. | two additional edges makes a cycle in the tree |
| C. | removing one edge makes the tree cycle free |
| D. | removing two edges make the tree cycle free |
| Answer» B. two additional edges makes a cycle in the tree | |
| 64. |
Breadth First Search traversal of a binary tree finds its application in __________ |
| A. | Cloud computing |
| B. | Peer to peer networks |
| C. | Weighted graph |
| D. | Euler path |
| Answer» C. Weighted graph | |
| 65. |
The time complexity to find shortest distances by using Dijkstra’s algorithm is __________ |
| A. | O(E²) |
| B. | O(V+1-E) |
| C. | O(V+E) |
| D. | O(E+VlogV) |
| Answer» E. | |
| 66. |
If G is a simple graph with n-vertices and n>=3, the condition for G has a Hamiltonian circuit is __________ |
| A. | the degree of each vertex is at most n/2 |
| B. | the degree of each vertex is equal to n |
| C. | the degree of every vertex is at least n+1/2 |
| D. | the degree of every vertex in G is at least n/2 |
| Answer» E. | |
| 67. |
For an n-vertex undirected graph, the time required to find a cycle is ____________ |
| A. | O(n) |
| B. | O(n²) |
| C. | O(n+1) |
| D. | O(logn) |
| Answer» B. O(n²) | |
| 68. |
For the expression (7-(4*5))+(9/3) which of the following is the post order tree traversal? |
| A. | *745-93/+ |
| B. | 93/+745*- |
| C. | 745*-93/+ |
| D. | 74*+593/- |
| Answer» D. 74*+593/- | |
| 69. |
Evaluation of 4*5+3/2-9 in prefix notation. |
| A. | *45-/32+9 |
| B. | *+453/-29 |
| C. | -+*45/329 |
| D. | *+/45932 |
| Answer» D. *+/45932 | |
| 70. |
How many edges are there in a complete graph of order 9? |
| A. | 35 |
| B. | 36 |
| C. | 45 |
| D. | 19 |
| Answer» C. 45 | |
| 71. |
An immediate application of minimum spanning tree ______ |
| A. | gesture analysis |
| B. | handwriting recognition |
| C. | fingerprint detection |
| D. | soft computing |
| Answer» C. fingerprint detection | |
| 72. |
Evaluation of expression a/b+c*d-e in postfix notation. |
| A. | ab+cd/*-e |
| B. | ab/cd*+e- |
| C. | abc/+d*-e |
| D. | abcd/+*-e |
| Answer» C. abc/+d*-e | |
| 73. |
A complete undirected graph of n nodes can have maximum ______ spanning trees. |
| A. | nⁿ⁺¹ |
| B. | nⁿ⁻² |
| C. | \(\frac{n(n+1)}{2}\) |
| D. | n |
| Answer» C. \(\frac{n(n+1)}{2}\) | |
| 74. |
If minimum cost edge of a graph is unique, then that edge will be added to any MST. Choose the correct option. |
| A. | false |
| B. | maximum cost edge is added |
| C. | true |
| D. | minimum cost edge need not be unique |
| Answer» D. minimum cost edge need not be unique | |
| 75. |
Infix to prefix conversion can be done using __________ |
| A. | two queues |
| B. | two stacks |
| C. | one stack and two queues |
| D. | one stack |
| Answer» C. one stack and two queues | |
| 76. |
What is the postfix expression of (A+B)-C*(D/E))+F? |
| A. | A B + C D E / * – F + |
| B. | A B C D E + / * F – + |
| C. | A B C + * D E / F + – |
| D. | A B + C – * D E / F + |
| Answer» B. A B C D E + / * F – + | |
| 77. |
Convert the following expression into prefix notation. |
| A. | (f^e/d+c)-ba) |
| B. | -ab/+-ec^dgf |
| C. | -ab-+c/d^efg |
| D. | ab/+-^cde-fg |
| Answer» D. ab/+-^cde-fg | |
| 78. |
The time complexity of calculating the sum of all leaf nodes in an n-order binary tree is __________ |
| A. | O(n²) |
| B. | O(n+1) |
| C. | O(1) |
| D. | O(n) |
| Answer» E. | |
| 79. |
Prefix expression can be evaluated _________ |
| A. | from right to left |
| B. | from left to right |
| C. | from the exact middle |
| D. | from second right element |
| Answer» C. from the exact middle | |
| 80. |
The time complexity to find a Eulerian path in a graph of vertex V and edge E is _____________ |
| A. | O(V²) |
| B. | O(V+E-1) |
| C. | O(V+E) |
| D. | O(E+1) |
| Answer» D. O(E+1) | |
| 81. |
A binary cycle space forms a ______ over the two element field. |
| A. | triangular graph |
| B. | vector space |
| C. | binary tree |
| D. | hamiltonian graph |
| Answer» C. binary tree | |
| 82. |
What is the postfix expression of the given expression, (2*4-(5+7/3^4)-8)10? |
| A. | 2 4 5 * 7 3 4 ^ / + 8 – – 10 |
| B. | 2 4 * ^ 5 7 3 4 / + 8 10 – – |
| C. | 2 4 * 5 7 ^ 3 4 / + – 8 10 – |
| D. | 2 4 * 5 7 3 4 ^ / + – 8 – 10 |
| Answer» E. | |
| 83. |
What is the postfix expression of 9+3*5/(10-4)? |
| A. | 9 3 + * 5 / 10 4 – |
| B. | 9 3 5 + * / 10 4 – |
| C. | 9 3 + 5 * / 10 4 – |
| D. | 9 3 5 * / + 10 – 4 |
| Answer» D. 9 3 5 * / + 10 – 4 | |
| 84. |
An important application of binary tree is ______ |
| A. | Huffman coding |
| B. | stack implementation |
| C. | queue implementation |
| D. | traverse a cyclic graph |
| Answer» B. stack implementation | |
| 85. |
If two cycle graphs Gm and Gn are joined together with a vertex, the number of spanning trees in the new graph is ______ |
| A. | m+n-1 |
| B. | m-n |
| C. | m*n |
| D. | m*n+1 |
| Answer» D. m*n+1 | |
| 86. |
An immediate application of a Depth First Search traversal is __________ |
| A. | count the number of leaf nodes |
| B. | perform Inorder traversal in easy way |
| C. | count number of nodes |
| D. | implement preorder traversal |
| Answer» B. perform Inorder traversal in easy way | |
| 87. |
In a maximum spanning tree the weighted graph is of _______ |
| A. | maximum number of edges |
| B. | maximum number of cyclic trees |
| C. | minimum number of vertices |
| D. | maximum weight |
| Answer» E. | |
| 88. |
What is a separable graph? |
| A. | A disconnected graph by deleting a vertex |
| B. | A disconnected graph by removing an edge |
| C. | A disconnected graph by removing one edge and a vertex |
| D. | A simple graph which does not contain a cycle |
| Answer» B. A disconnected graph by removing an edge | |
| 89. |
How many cycles are there in a wheel graph of order 5? |
| A. | 6 |
| B. | 10 |
| C. | 25 |
| D. | 7 |
| Answer» E. | |
| 90. |
If the weight of an edge e of cycle C in a graph is larger than the individual weights of all other edges of C, then that edge ________ |
| A. | belongs to an minimum spanning tree |
| B. | cannot belong to an minimum spanning tree |
| C. | belongs to all MSTs of the graph |
| D. | can not belong to the graph |
| Answer» C. belongs to all MSTs of the graph | |
| 91. |
Topological sorting of a graph represents _______ of a graph. |
| A. | linear probing |
| B. | linear ordering |
| C. | quadrilateral ordering |
| D. | insertion sorting |
| Answer» C. quadrilateral ordering | |
| 92. |
For every spanning tree with n vertices and n edges what is the least number of different Spanning trees can be formed? |
| A. | 2 |
| B. | 5 |
| C. | 3 |
| D. | 4 |
| Answer» D. 4 | |
| 93. |
Prim’s algorithm can be implemented using _______ |
| A. | a stack data structure |
| B. | radix sort |
| C. | priority queue data structure |
| D. | bubble sort |
| Answer» D. bubble sort | |
| 94. |
In preorder traversal of a binary tree the second step is ____________ |
| A. | traverse the right subtree |
| B. | traverse the left subtree |
| C. | traverse right subtree and visit the root |
| D. | visit the root |
| Answer» C. traverse right subtree and visit the root | |
| 95. |
Worst case complexity of Breadth First Search traversal __________ |
| A. | O(n*n) |
| B. | O(nlogn) |
| C. | O(n² logn) |
| D. | O(n³) |
| Answer» C. O(n² logn) | |
| 96. |
Spanning trees have a special class of depth-first search trees named _________ |
| A. | Euclidean minimum spanning trees |
| B. | Tremaux trees |
| C. | Complete bipartite graphs |
| D. | Decision trees |
| Answer» C. Complete bipartite graphs | |
| 97. |
Conversion from prefix to postfix expression can be done _______________ |
| A. | using bubble sort |
| B. | using radix sort |
| C. | using two queues |
| D. | in a direct manner |
| Answer» E. | |
| 98. |
What is the minimum height for a binary search tree with 60 nodes? |
| A. | 1 |
| B. | 3 |
| C. | 4 |
| D. | 2 |
| Answer» E. | |
| 99. |
Time complexity of Prim’s algorithm is _________ |
| A. | O((V+E)logV) |
| B. | O(E+V) |
| C. | O(E) |
| D. | O(V+1) |
| Answer» B. O(E+V) | |
| 100. |
What is the output of the following if funct1(7)? |
| A. | 128 |
| B. | 4320 |
| C. | 720 |
| D. | 5040 |
| Answer» E. | |