MCQOPTIONS
Saved Bookmarks
MCQOPTIONS
This section includes 168 Mcqs, each offering curated multiple-choice questions to sharpen your Civil Engineering knowledge and support exam preparation. Choose a topic below to get started.
| 101. |
If A = {x: x = 3n, n ? 6, n ? N} and B = {x: x = 9n, n ? 4, n ? N}, then which of thefollowing is false? |
| A. | A ? B = {9, 81, 729, 6561} |
| B. | A U B = {3, 9, 27, 81,243, 729, 6561} |
| C. | A ? D = {3, 27, 243, 6561} |
| D. | A-B = {3, 27,243} |
| Answer» B. A U B = {3, 9, 27, 81,243, 729, 6561} | |
| 102. |
Computers use addressing mode techniques for _____________________. |
| A. | to reduce no. of bits in the field of instruction |
| B. | giving programming versatility to the user by providing facilities as pointers to memory counters for loop control |
| C. | All the above |
| D. | specifying rules for modifying or interpreting address field of the instruction |
| Answer» D. specifying rules for modifying or interpreting address field of the instruction | |
| 103. |
The number of simple digraphs with |V | = 3 and exactly 3 edges is |
| A. | 80 |
| B. | 88 |
| C. | 76 |
| D. | 84 |
| Answer» D. 84 | |
| 104. |
SSTF stands for |
| A. | small – small-time-first |
| B. | Shortest-Seek-time-first scheduling |
| C. | small-simple-time-first scheduling |
| D. | simple-seek-time-first |
| Answer» C. small-simple-time-first scheduling | |
| 105. |
The number of interchanges required to sort 5, 1, 6, 2 4 in ascending order using Bubble Sortis |
| A. | 5 |
| B. | 6 |
| C. | 8 |
| D. | 7 |
| Answer» B. 6 | |
| 106. |
How are information system and capability related to each other ? |
| A. | Increased volumed processing speed |
| B. | Improved processing speed |
| C. | All of the above |
| D. | Faster retrieval of information |
| Answer» E. | |
| 107. |
The scale of cohesion from the weakest (least desirable) to the strongest (most desirable) are |
| A. | informational, functional,temporal, coincidental,sequential, logical |
| B. | cofincidental, logical, temporal, communicational, sequential, functional, informational |
| C. | informational, temporal, logical, sequential, functional, coincidental |
| D. | informational, logical, temporal, sequential, functional |
| Answer» C. informational, temporal, logical, sequential, functional, coincidental | |
| 108. |
In the slow start phase of the TCP congestion control algorithm, the size of the congestion window |
| A. | increases linearly |
| B. | does not increase |
| C. | increases exponentially |
| D. | increases quadratically |
| Answer» D. increases quadratically | |
| 109. |
The ASCII code for letter A is |
| A. | 1000001 |
| B. | 1100011 |
| C. | 10011 |
| D. | 1111111 |
| Answer» B. 1100011 | |
| 110. |
By an extranet we mean |
| A. | the intranets of two co-operating organizations interconnected via a secure leased line |
| B. | an extra fast computer network |
| C. | an extra connection to internet provided to co-operating organization |
| D. | an extra network used by an organization for higher reliability |
| Answer» B. an extra fast computer network | |
| 111. |
For the same functionality coding in C vs coding in assembly language yieds code in LOC which is |
| A. | times smaller |
| B. | three times larger |
| C. | same size |
| D. | 10 times smaller |
| Answer» B. three times larger | |
| 112. |
The set of all real numbers under the usual multiplication operation is not a group since |
| A. | multiplication is not associative |
| B. | multiplication is not a binary operation |
| C. | zero has no inverse |
| D. | identity element does not exist |
| Answer» D. identity element does not exist | |
| 113. |
The complexity of multiplying two matrices of order m*n and n*p is |
| A. | mp |
| B. | mnp |
| C. | np |
| D. | mn |
| Answer» C. np | |
| 114. |
If set x = {a, b, c, d}, then number of binary operations that can be defined on x is |
| A. | 24 |
| B. | 42 |
| C. | 416 |
| D. | 216 |
| Answer» E. | |
| 115. |
An FSM (Finite State Machine) can be considered to be a TM (Turing Machine) of finite tape length |
| A. | rewinding capacity, and unidirectional tape movement |
| B. | without rewinding capability and unidirectional tape movement. |
| C. | rewinding capability and bidirectional tape movement |
| D. | without rewinding capability and bidirectional tape movement |
| Answer» C. rewinding capability and bidirectional tape movement | |
| 116. |
2.The time required for a gate or inverter to change its state is called |
| A. | Decay time |
| B. | Rise time |
| C. | Charging time |
| D. | Propagation time |
| Answer» E. | |
| 117. |
Checking quality of software in both simulated and live environments is known as |
| A. | Usability |
| B. | Checking |
| C. | Validation |
| D. | Vaidity |
| Answer» B. Checking | |
| 118. |
XLL definition is used along with XML to specify |
| A. | The presentation of XML document |
| B. | The data types of the contents of XML document |
| C. | The structure of XML document |
| D. | The links with other documents |
| Answer» E. | |
| 119. |
If the stack pointer is initialised with (4FEB)H, then after execution of Pushoperation in 8085 microprocessor, the Stack Pointer shall be |
| A. | 4FEC |
| B. | 4FEA |
| C. | 4FED |
| D. | 4FE9 |
| Answer» D. 4FE9 | |
| 120. |
The instructions which copy information from one location to another either in theprocessor’s internal register set or in the external main memory are called |
| A. | Program control instructions. |
| B. | Data transfer instructions |
| C. | Logical instructions. |
| D. | Input-output instructions |
| Answer» C. Logical instructions. | |
| 121. |
Which two files are used during operation of the DBMS |
| A. | DML and query language |
| B. | Query languages and utilities |
| C. | Data dictionary and query language |
| D. | Data dictionary and transaction log |
| Answer» E. | |
| 122. |
The rating of coupling of modules for strongest (least desirable) to weakest (most desirable) are |
| A. | common, content, control, stamp, data |
| B. | content, common, control, stamp, data |
| C. | data, control, common, stamp, content |
| D. | data, common ,stamp, content, common |
| Answer» C. data, control, common, stamp, content | |
| 123. |
If for two sets A and B, A U B = A? B = A, then we have |
| A. | B ? A ? f |
| B. | A- B ? f |
| C. | None of these |
| D. | A = B |
| Answer» E. | |
| 124. |
Consider a program with a linked origin of 5000. Let the memory area allocated to ithave the start address of 70000. Which amongst the following will be the valueto be loaded in relocation register? |
| A. | 50000 |
| B. | 20000 (B) (C) |
| C. | None of above |
| D. | 70000 |
| Answer» D. 70000 | |
| 125. |
A characteristic of the data that binary search uses but the linear search ignores isthe___________. |
| A. | Length of the list. |
| B. | Order of the elements of the list |
| C. | Type of elements of the list |
| D. | Maximum value in list. |
| Answer» C. Type of elements of the list | |
| 126. |
The name of the protocol is unit in network layer |
| A. | frame |
| B. | Segment |
| C. | message |
| D. | datagram |
| Answer» E. | |
| 127. |
What are the values of C0 and C1 in d(t) = C1 C0t - 16t2, if d(1) = 4 and v(2) = -65? |
| A. | C0 = 1, C1 = -21 |
| B. | C0 = -1, C1 = 21 |
| C. | C0 = 0, C1 = 1 |
| D. | C0 = -1, C1 = 19 |
| Answer» C. C0 = 0, C1 = 1 | |
| 128. |
The cache memory of 1K words uses direct mapping with a block size of 4 words.How many blocks can the cache accommodate. |
| A. | 512 words. |
| B. | 256 words. |
| C. | 128 words. |
| D. | 1024 words. |
| Answer» C. 128 words. | |
| 129. |
If regular set A is represented by A = (01 1)* and the regular set \'B\' is represented by B = ((01)*1*)*, then |
| A. | B ⊂ A |
| B. | A ⊂ B |
| C. | A=B |
| D. | A and B are incomparable |
| Answer» D. A and B are incomparable | |
| 130. |
Coding and testing is done in following manner : |
| A. | Cross sectional |
| B. | Adhoc |
| C. | Top-clown |
| D. | Bottom-up |
| Answer» B. Adhoc | |
| 131. |
Which of the following respectively represent commutative law, Associative law and Distributive law ?I. A.(B C)=(A.B).CII. A.(B C)=A.B A.CIII. A B = B ACODES |
| A. | II, I and III |
| B. | I,III, and II |
| C. | III, I and II |
| D. | III, II and I |
| Answer» D. III, II and I | |
| 132. |
Internet requires |
| A. | a local area network |
| B. | an international agreement to connect computers |
| C. | a World Wide Web |
| D. | a commonly agreed set of rules to communicate between computers |
| Answer» E. | |
| 133. |
Internet uses |
| A. | Circuit switching |
| B. | Packet switching |
| C. | Telex switching |
| D. | Telephone switching |
| Answer» C. Telex switching | |
| 134. |
A full binary tree with 2n 1 nodes contain |
| A. | n non-leaf nodes |
| B. | n leaf nodes |
| C. | n-1 non-leaf nodes |
| D. | n-1 leaf nodes |
| Answer» B. n leaf nodes | |
| 135. |
Running time of NFA to DFA conversion including the case where NFA has e-transition i |
| A. | 0 (n332) |
| B. | 0 (n3) |
| C. | 0 (n22n) |
| D. | 0 (n32n) |
| Answer» E. | |
| 136. |
In multiple granularity level locking a transaction is locking a node in Exclusive write mode. At that mode what are the locks that are permitted. |
| A. | Intension – Exclusive lock |
| B. | Intension – share lock |
| C. | None of above |
| D. | Shared – Intension – Exclusive |
| Answer» D. Shared – Intension – Exclusive | |
| 137. |
Informational cohesion is a realization of |
| A. | structured programming |
| B. | data abstraction |
| C. | concurrency |
| D. | modularity |
| Answer» C. concurrency | |
| 138. |
A sort which relatively passes through a list to exchange the first element with any elementless than it and then repeats with a new first element is called |
| A. | selection sort. |
| B. | insertion sort. |
| C. | quick sort. |
| D. | heap sort. |
| Answer» D. heap sort. | |
| 139. |
Your evaluation shows the beneits out weight costs for a proposed system. Select the best fit foranswer : |
| A. | Feasibility study |
| B. | Cost/beneit analysis |
| C. | Benefits |
| D. | Feasibility |
| Answer» C. Benefits | |
| 140. |
Which of these is not a part of Synthesis phase |
| A. | Obtain address of a memory operand from the symbol table |
| B. | Obtain machine code corresponding to the mnemonic from the Mnemonics table |
| C. | Synthesize a machine instruction or the machine form of a constant |
| D. | Perform LC processing |
| Answer» E. | |
| 141. |
A combinational logic circuit which generates a particular binary word or number is |
| A. | Multiplexer |
| B. | Decoder |
| C. | Demultiplexer |
| D. | Encoder |
| Answer» B. Decoder | |
| 142. |
Floating point representation is used to store |
| A. | whole numbers |
| B. | Boolean values |
| C. | integers |
| D. | real integers |
| Answer» E. | |
| 143. |
A grammar will be meaningless |
| A. | if left hand side of a production is a single terminal |
| B. | if terminal set and non-terminal set are not disjoint |
| C. | all of these |
| D. | if left hand side of a production has no non terminal |
| Answer» D. if left hand side of a production has no non terminal | |
| 144. |
Adders |
| A. | is called so because a full adder involves two half-adders |
| B. | adds 2 bits |
| C. | All of these |
| D. | needs two input and generates two output |
| Answer» D. needs two input and generates two output | |
| 145. |
If a node in a BST has two children, then its inorder predecessor has |
| A. | no right child |
| B. | no left child |
| C. | no child |
| D. | two children |
| Answer» B. no left child | |
| 146. |
The [][]UL decomposition method is computationally more efficient than Naïve Gauss elimination for solving |
| A. | multiple sets of simultaneous linear equations with different coefficient matrices and the same right hand side vectors. |
| B. | a single set of simultaneous linear equations. |
| C. | less than ten simultaneous linear equations. |
| D. | multiple sets of simultaneous linear equations with the same coefficient matrix and different right hand side vectors. |
| Answer» E. | |
| 147. |
Which of the following are not a machine instructions |
| A. | ORG. |
| B. | MOV. |
| C. | (B) & (C). |
| D. | EN |
| Answer» D. EN | |
| 148. |
Which scheduling policy is most suitable for a time-shared operating system |
| A. | Elevator. |
| B. | Shortest-job First |
| C. | First-Come-First-Serve. |
| D. | Round-Robin |
| Answer» E. | |
| 149. |
If a node having two children is deleted from a binary tree, it is replaced by its |
| A. | Inorder successor |
| B. | Inorder predecessor |
| C. | None of the above |
| D. | Preorder predecessor |
| Answer» B. Inorder predecessor | |
| 150. |
\'n\' Flip flops will divide the clock frequency by a factor of |
| A. | n |
| B. | n2 |
| C. | log (n) |
| D. | 2n |
| Answer» D. 2n | |