GS: Hindi / English · Language questions stay in their original language.
120 questions · 120 marks · 2 hours
Choose one option per question.
Tap an option to check it, or open “See answer”.
Correct answer: (C) Control signals
The control unit generates control signals to drive the other units.
Correct answer: (C) h
A user-defined header file carries the extension .h and is included within quotation marks.
Correct answer: (D) More than one of the above
Direct, indirect and immediate addressing are all commonly employed by the CPU, so the answer is ‘more than one’.
Correct answer: (B) The program is compiled and executed successfully
Calling delete on a NULL pointer is safe in C++—nothing happens—so the program compiles and runs successfully.
Correct answer: (B) Buffer registers
Buffer registers are used to overcome the difference in data transfer speed, holding the data between a fast unit and a slow one.
Correct answer: (A) PCI bus
The PCI bus is used to extend the connectivity of the processor bus, so that many devices can be attached.
Correct answer: (A) The I/O devices and the memory share the same address space
In memory-mapped I/O the devices share the same address space as the memory, so the ordinary memory instructions reach them.
Correct answer: (C) Absolute
In an instruction such as ADD X Y the full addresses of the operands are given outright, so the addressing is absolute.
Correct answer: (C) int array[10];
In C++ an array is declared as int array[10];—the type, the name and the size in brackets.
Correct answer: (B) Virtual tables
An SQL view is called a virtual table, since it stores no data of its own—it is produced by its query.
Correct answer: (A) Only 1
A table can have only one primary key, even if that key is made up of several columns.
Correct answer: (C) Error
Character arrays cannot be joined with + in C++, so this code gives a compile-time error.
Correct answer: (C) Union
UNION is an operator that joins the results of two queries, not a constraint; primary key and not null are constraints.
Correct answer: (B) COMPUTE
COUNT, SUM, AVG, MIN and MAX are aggregate functions; there is no such valid function as COMPUTE.
Correct answer: (B) Charles Babbage
Charles Babbage is called the father of the computer, for his conception of the Analytical Engine.
Correct answer: (B) ASC
With nothing written after ORDER BY, SQL takes ascending order (ASC).
Correct answer: (D) More than one of the above
IA-32 provides TF, IF and IOPL besides the general flags, so the answer is ‘more than one’.
Correct answer: (C) Similar to WHERE, but used for groups rather than rows
HAVING is like WHERE, except that it puts a condition on the groups formed by GROUP BY rather than on rows.
Correct answer: (A) Program-controlled I/O
Working a device by checking its status flags over and over is program-controlled I/O, that is polling.
Correct answer: (A) WITH
The WITH clause creates a temporary relation for the query it is defined on, to be used within that query.
Correct answer: (A) 70
ROUND(65.726, −1) means rounding to the tens place, so the result is 70.
Correct answer: (A) Total number of zero elements > (m × n)/2
A matrix is called sparse when the number of zero elements exceeds half the total, that is (m × n)/2.
Correct answer: (B) COMMIT
COMMIT makes a transaction's changes permanent in the database; ROLLBACK undoes them.
Correct answer: (D) More than one of the above
Natural join and subqueries are both basic approaches to joining tables, so the answer is ‘more than one’.
Correct answer: (B) O(N)
In infix-to-postfix conversion each symbol is read once and pushed once, so the time complexity is O(N).
Correct answer: (B) Easier to access the elements in an array
The merit of an array is just this—any element can be reached directly by its index. Mixed types are not stored in it and the index starts from zero.
Correct answer: (B) Stack
A recursive algorithm keeps the record of each call on a stack, so that is the structure mainly used.
Correct answer: (A) abc * + de * +
In a + b * c + (d * e) the multiplications come first, so the postfix form is abc * + de * +.
Correct answer: (E) None of the above
Linear, circular and double-ended are all types of queue, so the answer is ‘None of the above’.
Correct answer: (B) Underflow
Before taking an element out of a queue one has to see that it is not empty—that is the check for underflow.
Correct answer: (C) 10 30 40 15
Work the operations through—[10], [20,10], [20,10,30], deleting from the front [10,30], then [10,30,40], [10,30,40,10], deleting from the rear [10,30,40], and finally [10,30,40,15].
Correct answer: (C) Deque
A linear structure allowing insertion and deletion at both ends is a deque.
Correct answer: (A) Front = rear = −1
A circular queue is empty when front = rear = −1, which is also its initial state.
Correct answer: (B) Perform push() with pop as the costlier operation
q1.offer(x) simply enqueues, so push stays cheap; on removal the elements must be shifted to the other queue, which makes pop the costlier operation.
Correct answer: (A) Randomized traversal
A binary tree is traversed in preorder, inorder and postorder; there is no such technique as randomized traversal.
Correct answer: (C) Single-user access only
A DBMS lets many users work at once, so ‘single-user access only’ is not a feature of it.
Correct answer: (C) Implementation of a doubly linked list is easier than that of a singly linked list.
A doubly linked list can be traversed both ways, but every node must carry an extra pointer—so its implementation is not easier but harder.
Correct answer: (A) Referential
A value in the referencing relation must also occur in the referenced one: that is the referential integrity constraint, enforced by a foreign key.
Correct answer: (E) None of the above
In a binary search tree the left child is smaller, the right child larger, and both subtrees are search trees too—all three statements hold, so the answer is ‘None of the above’.
Correct answer: (B) SOP
Y = AB + BC + AC is a sum of products, so it shows the SOP form.
Correct answer: (C) SOM and POM
The canonical forms of a Boolean expression are SOM (sum of minterms) and POM (product of maxterms).
Correct answer: (A) C(A + B)DE
A and B go through an OR, and C, D and E are then ANDed in turn, so the expression is C(A + B)DE.
Correct answer: (D) More than one of the above
Boolean algebra serves in designing digital computers, in building logic symbols and in circuit theory alike, so the answer is ‘more than one’.
Correct answer: (C) Control signals
The control unit puts out control signals, by which each unit learns what to do and when.
Correct answer: (A) Seven-segment decoder
A seven-segment decoder is used to show the time at railway stations, lighting the digits as segments.
Correct answer: (B) Optical fiber
In optical fibre the signal travels as light, so electrical interference has no effect on it.
Correct answer: (A) Star
In the star topology every node is attached to a central hub, so a central controller is required.
Correct answer: (A) World Wide Web (WWW)
The collection of hyperlinked documents on the Internet is the World Wide Web.
Correct answer: (C) The IPv6 flow label is considered
In header translation the IPv6 flow label is dropped, there being no field for it in IPv4—so ‘the flow label is considered’ is not a step in the procedure.
Correct answer: (B) Full access rights for all users
Giving all users full access rights lets anyone alter the data, which breaches the integrity of the system.