61. Most appropriate data structure to implement a priority queue is a:

Data Structures and Algorithms • Priority Queues • JUNE 2010

62. Given push(A),push(B),push(C) with A before B before C, which pop order is impossible?

Data Structures and Algorithms • Stacks • JUNE 2010

63. In a complete binary tree of n nodes, the distance between two farthest nodes is about:

Data Structures and Algorithms • Tree Properties • JUNE 2010

64. Logic expression for the output of the given circuit is

Data Structures and Algorithms • Boolean Algebra • JUNE 2010

65. Function represented by the K-map below is

Data Structures and Algorithms • Karnaugh Maps • JUNE 2010

66. Decimal equivalent of BCD 11011.1100 is

Data Structures and Algorithms • Number Systems • JUNE 2010

67. Advantage of synchronous sequential over asynchronous is

Data Structures and Algorithms • Sequential Circuits • JUNE 2010

68. In a B-tree of order 5, inserting 7,8,1,4,13,20,2,6,5 yields how many keys in the root?

Databases • B-Tree Insertion • JUNE 2010

69. Which language component lets the DBA define schema components?

Databases • Data Definition Language • JUNE 2010

70. An entity instance is a single occurrence of an _______.

Databases • ER Modeling • JUNE 2010

71. Match: I. 2NF (a) transitive dependencies eliminated; II. 3NF (b) multivalued attrs removed; III. 4NF (c) no partial FDs; IV. 5NF (d) no join dependencies. Codes I II III IV = ?

Databases • Normalization • JUNE 2010

72. The PROJECT command creates a new table with:

Databases • Relational Algebra • JUNE 2010

73. “x1 is a clone of x” based on identical physical attributes—cloning is an equivalence relation. Impression?

Discrete Structures and Optimization • Relations • JUNE 2010

74. ________ synchronizes critical resources to prevent deadlock.

Operating System • Concurrency Control • JUNE 2010

75. To allow only one process into its critical section, binary semaphores are initialized to:

Operating System • Concurrency Control • JUNE 2010

76. ________ is a preemptive scheduling algorithm.

Operating System • CPU Scheduling • JUNE 2010

77. Remote Computing Service uses timesharing and _______.

Operating System • Remote Services • JUNE 2010

78. Match: (a) Disk scheduling – Round-robin; (b) Batch – SCAN; (c) Time sharing – LIFO; (d) Interrupt processing – FIFO

Operating System • Scheduling & Processing • JUNE 2010

79. The statement `printf("%d", 10 ? 0 ? 5 : 1 : 12);` prints which value?

Programming Languages • C Operators • JUNE 2010

80. Which component groups characters into tokens?

Programming Languages • Compiler Phases • JUNE 2010