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.
| 51. |
Which one of the following is not true for a view: |
| A. | View is a virtual table. |
| B. | View is derived from other tables. |
| C. | View never contains derived columns. |
| D. | A view definition is permanently stored as part of the database |
| Answer» E. | |
| 52. |
Where was John Boynton Priestley born? |
| A. | Manchester |
| B. | Bradford |
| C. | Edinburgh |
| D. | Liverpool |
| Answer» C. Edinburgh | |
| 53. |
Variation in debugging : coding ability has been reported to be |
| A. | 1:1 |
| B. | 1:10 |
| C. | 1:5 |
| D. | 1:2 |
| Answer» C. 1:5 | |
| 54. |
In which of the following adder circuits, the carry look ripple delay is eliminated ? |
| A. | Full adder |
| B. | Half adder |
| C. | Carry-look-ahead adder |
| D. | Parallel adder |
| Answer» E. | |
| 55. |
Consider two well-formed formulas in propositional logicF1 : P →Ë¥P F2 : (P →Ë¥P) v ( Ë¥P →)Which of the following statement is correct? |
| A. | F1 is unsatisfiable, F2 is satisfiable |
| B. | F1 is satisfiable, F2 is unsatisfiable |
| C. | F1 & F2 are both satisfiable |
| D. | F1 is unsatisfiable, F2 is valid |
| Answer» E. | |
| 56. |
If a logic gates has four inputs, then total number of possible input combinations is |
| A. | 8 |
| B. | 4 |
| C. | 32 |
| D. | 16 |
| Answer» E. | |
| 57. |
A layer-4 firewall ( a device that can look at all protocol headers up to the transport layer) CANNOT |
| A. | block HTTP traffic during 9:00PM and 5:00AM |
| B. | block all ICMP traffic |
| C. | block TCP traffic from a specific user on a specific IP address on multi-user system during 9:00PM and 5:00AM |
| D. | stop incoming traffic from a specific IP address but allow outgoing traffic to same IP |
| Answer» B. block all ICMP traffic | |
| 58. |
A linear list of elements in which deletion can be done from one end (front) and insertioncan take place only at the other end (rear) is known as a |
| A. | stack. |
| B. | queue. |
| C. | linked list. |
| D. | tree. |
| Answer» C. linked list. | |
| 59. |
In Reverse Polish notation, expression A*B C*D is written as |
| A. | A*BCD* |
| B. | AB*CD* |
| C. | A*B*CD |
| D. | AB*CD * |
| Answer» C. A*B*CD | |
| 60. |
In order to interpret XML documents one should |
| A. | Have a document type definition which defines the tags |
| B. | Use standardized tags |
| C. | Specify tag filename |
| D. | Define the tags separately |
| Answer» B. Use standardized tags | |
| 61. |
Which of the following can be recognized by a Deterministic Finite-state Automaton ? |
| A. | Set of binary string in which number of zeros is same as the number of ones. |
| B. | Numbers, 1,2,4, ....... zN ..... written in binary. |
| C. | Set of binary string in which number of zeros is same as the number of ones. |
| D. | Numbers 1, 2, 4, ........, zN ...... written in unbinary. |
| Answer» C. Set of binary string in which number of zeros is same as the number of ones. | |
| 62. |
Which of the following paintings did Joseph Mallord William Turner paint in 1812? |
| A. | A Fire at Sea |
| B. | Snowstorm: Hannibal crossing the Alps |
| C. | The Shipwreck |
| D. | Rockets and Blue Lights |
| Answer» C. The Shipwreck | |
| 63. |
A decimal number has 25 digits. The number of bits needed for its equivalent binary representation is, approximately |
| A. | 55 |
| B. | 50 |
| C. | 80 |
| D. | 75 |
| Answer» E. | |
| 64. |
The circuit used to store one bit of data is known as |
| A. | OR gate |
| B. | Encoder |
| C. | Decoder |
| D. | Flip Flop |
| Answer» E. | |
| 65. |
A device/circuit that goes through a predefined sequence of states upon the applicationof input pulses is called |
| A. | flip-flop |
| B. | register |
| C. | counter. |
| D. | transistor. |
| Answer» D. transistor. | |
| 66. |
The prefix form of A-B/ (C * D ^ E) is, |
| A. | -ABCD*^DE |
| B. | -/*^ACBDE |
| C. | -A/BC*^DE |
| D. | -A/B*C^DE |
| Answer» E. | |
| 67. |
Which of the following module does not incorporate initialization of values changed by the module ? |
| A. | serially reusable module |
| B. | non reusable module |
| C. | all of these |
| D. | re-enterable module |
| Answer» C. all of these | |
| 68. |
An ADT is defined to be a mathematical model of a user-defined type along with the collectionof all ____________ operations on that model. |
| A. | Assignment |
| B. | Cardinality |
| C. | Structured |
| D. | Primitive |
| Answer» E. | |
| 69. |
A combinational circuit is one in which the output depends on the |
| A. | input combination and the previous output |
| B. | input combination at the time |
| C. | present output and the previous output |
| D. | input combination at that time and the previous input combination |
| Answer» C. present output and the previous output | |
| 70. |
The secant method of finding roots of nonlinear equations falls under the category of _____________ methods. |
| A. | graphical |
| B. | bracketing |
| C. | random |
| D. | open |
| Answer» E. | |
| 71. |
In object oriented design of software, objects have. |
| A. | Attributes name and operation |
| B. | Operations and name only |
| C. | All of the above |
| D. | Attributes and name only |
| Answer» E. | |
| 72. |
For which of the following does there exist a tree satisfying the specified constraints? |
| A. | A rooted tree of height 3 where every vertex has at most 3 children and there are 41 total vertices. |
| B. | A full binary tree with 31 leaves, each leaf of height 5. |
| C. | A binary tree with 2 leaves and height 100. |
| D. | A full binary tree with 11 vertices and height 6. |
| Answer» D. A full binary tree with 11 vertices and height 6. | |
| 73. |
(Z,*) is a group with a*b = a b 1 ∀ a, b ∈Z. The inverse of a is |
| A. | -2 |
| B. | 0 |
| C. | -a-2 |
| D. | a-2 |
| Answer» D. a-2 | |
| 74. |
The set (A U B U C) ? (A ? B\' ? C\')\' ? C\' is equal to |
| A. | A ? C |
| B. | B?C' |
| C. | none of these. |
| D. | B' ? C' |
| Answer» C. none of these. | |
| 75. |
L = {aP | p ; } is prime is |
| A. | not regular |
| B. | regular |
| C. | accepted by PDA |
| D. | accepted by DFA |
| Answer» B. regular | |
| 76. |
What is the content of Stack Pointer (SP)? |
| A. | Address of the next instruction |
| B. | Address of the current instruction |
| C. | Size of the stack. |
| D. | Address of the top element of the stack |
| Answer» E. | |
| 77. |
The role of an integrated CASE tool in system analysis and design project is |
| A. | To provide an environment that automate key tasks throughout sotware development process |
| B. | Proving a CASE study for software development |
| C. | None of the above |
| D. | To provide tool for reacting a word file |
| Answer» B. Proving a CASE study for software development | |
| 78. |
One of the header fields in an IP datagram is the Time to Live (TTL) field. Which of the following statements best explains the need for this field? |
| A. | It can be used to reduce delays |
| B. | It can be used to priortize packets |
| C. | It can be used to prevent packet looping |
| D. | It can be used to optimize throughput |
| Answer» D. It can be used to optimize throughput | |
| 79. |
When was An Inspector Calls published? |
| A. | 1946 |
| B. | 1914 |
| C. | 1940 |
| D. | 1918 |
| Answer» B. 1914 | |
| 80. |
Which method is used for resolving data dependency conflict by the compileritself? |
| A. | operand forwarding. |
| B. | Delayed loa |
| C. | loop buffer. |
| D. | Pre fetch target instruction. |
| Answer» C. loop buffer. | |
| 81. |
The generated on compilation of data definition language are stored in __________ |
| A. | data file |
| B. | data abstraction |
| C. | meta data |
| D. | data dictionary |
| Answer» E. | |
| 82. |
The number of different polynomials that can go through two fixed data points (x1,y1) and (x2,y2) is |
| A. | 1 |
| B. | 0 |
| C. | infinite |
| D. | 2 |
| Answer» D. 2 | |
| 83. |
In binary search, average number of comparison required for searching an element in a list if nnumbers is |
| A. | n/2 |
| B. | log2 n . |
| C. | n – 1. |
| D. | n |
| Answer» C. n – 1. | |
| 84. |
Which amongst the following is not a valid page replacement policy? |
| A. | FIFO policy (First in first out) |
| B. | LRU policy (Least Recently Use |
| C. | Optimal page replacement policy |
| D. | RU policy (Recurrently use |
| Answer» E. | |
| 85. |
The natural join is equal to : |
| A. | Combination of Union and Cartesian product |
| B. | Cartesian Product |
| C. | Combination of projection and Cartesian product |
| D. | Combination of selection and Cartesian product |
| Answer» D. Combination of selection and Cartesian product | |
| 86. |
A primary key if combined with a foreign key creates |
| A. | Many to many relationship between the tables that connect them. |
| B. | Parent-Child relationship between the tables that connect them. |
| C. | None of the above. |
| D. | Network model between the tables that connect them. |
| Answer» C. None of the above. | |
| 87. |
If A = {2,3,4,8,10} B={3,4,5,10,12} and C = {4,5,6,12,14} then (AUB) ? (A U C) isequal to |
| A. | {2,3,4,5, 8,10,12} |
| B. | {2,3,4,5,10,12} |
| C. | none of these |
| D. | {2, 3, 4, 10,12} |
| Answer» B. {2,3,4,5,10,12} | |
| 88. |
Consider two modules A and B, both utility programs in the same organization developed by the same team of programmers, where a and b are the sizes, respetively. The cost to develop each module is Ca and Cb. The efforts are Ea and Eb. if Ca > Cb t |
| A. | Ea < Eb |
| B. | Ea > Eb |
| C. | Ea and Eb are incomparable |
| D. | Ea =Eb |
| Answer» C. Ea and Eb are incomparable | |
| 89. |
7.The number of canonical expressions that can be developed over a 3-valued boolean algebra is |
| A. | 16 |
| B. | 8 |
| C. | 64 |
| D. | 32 |
| Answer» D. 32 | |
| 90. |
4.The maximum frequency at which digital data can be applied to gate is called |
| A. | Propagation speed |
| B. | Operating speed |
| C. | Charging time |
| D. | Binary level transaction period |
| Answer» C. Charging time | |
| 91. |
A transaction Ti needs to be redone if it contains |
| A. | commits |
| B. | Start |
| C. | none |
| D. | both a & b |
| Answer» B. Start | |
| 92. |
Let a, b, c, d be propositions. Assume that the equivalence a ↔ (b v Ë¥b) and b ↔ c hold. Then truth value of the formula ( a ^ b) → ((a ^ c) v d) is always |
| A. | False |
| B. | True |
| C. | Same as the truth value of b |
| D. | Same as the truth value of a |
| Answer» C. Same as the truth value of b | |
| 93. |
To recover from an error, the operator precedence parser may |
| A. | delete symbols from the stack |
| B. | insert symbols onto the stack and onto the input |
| C. | all of these |
| D. | delete symbols from the input |
| Answer» D. delete symbols from the input | |
| 94. |
If A = {x ? C: x2 = 1} and B = {x ? C: x4 = 1}, then A ? B is equal to |
| A. | {-1, 1, i, -i} |
| B. | {-1, 1} |
| C. | none of these |
| D. | {-i, i} |
| Answer» E. | |
| 95. |
Vienna Definition Language is an example of language definition facility based on |
| A. | Interpretative semantics |
| B. | Mathematical semantics |
| C. | Axiomatic semantics |
| D. | Translational semantics |
| Answer» C. Axiomatic semantics | |
| 96. |
If A Í B, then B\' - A\' is equal to |
| A. | B' |
| B. | A' |
| C. | ? |
| D. | A-B |
| Answer» C. ? | |
| 97. |
Which of the following regular expressions denotes a language comprising all possible strings over the alphabet {a, b } ? |
| A. | (a | * |
| B. | a* b* |
| C. | (a | b*) |
| D. | (a |
| Answer» B. a* b* | |
| 98. |
Which of the following are not regular ? |
| A. | Set of all palindromes made up of 0's and 1's |
| B. | String of 0's whose length is a perfect square |
| C. | All of these |
| D. | Strings of 0's, whose length is a prime number |
| Answer» D. Strings of 0's, whose length is a prime number | |
| 99. |
Sign extension is a step in |
| A. | Signed 16 bit integer addition |
| B. | floating point multiplication |
| C. | None of these |
| D. | Arithmetic left shift |
| Answer» C. None of these | |
| 100. |
In which of the following page replacement policies Balady’s anomaly occurs? |
| A. | LRU |
| B. | FIFO |
| C. | NRU |
| D. | LFU |
| Answer» C. NRU | |