UGC NET PAPER 2 COMPUTER SCIENCE – SET 18
Period: JUNE 2012
341. BST is a binary tree where __.
Data Structures and Algorithms • Trees • JUNE 2012
342. Leaves of which of the following trees are at the same level?
Data Structures and Algorithms • B-trees • JUNE 2012
343. Circuit output f(x,y,z) is:?
Data Structures and Algorithms • Combinational Logic • JUNE 2012
344. Pseudocode with m nested loops counts combinations K; K =:?
Data Structures and Algorithms • Combinatorics • JUNE 2012
345. Number of binary trees with 5 nodes =:?
Data Structures and Algorithms • Combinatorics • JUNE 2012
346. Which data structure is linear type?
Data Structures and Algorithms • Data structures • JUNE 2012
347. Given equal search probabilities, optimal BST is which diagram?
Data Structures and Algorithms • Search Trees • JUNE 2012
348. Inorder traversal yields sorted listing in
Data Structures and Algorithms • Tree traversals • JUNE 2012
349. To represent hierarchical relationships, which structure is suitable?
Data Structures and Algorithms • Trees • JUNE 2012
350. Concurrent updates prevented by __ in multiuser DB
Databases • Concurrency Control • JUNE 2012
351. (Duplicate) Deleting records but keeping structure = PACK.
Databases • DML Commands • JUNE 2012
352. Fastest among these copy commands is __.
Databases • File Utilities • JUNE 2012
353. Match OLAP, OLTP, Decision Tree, Neural Network to (DataWarehouse, RDBMS, Classification, Regression):
Databases • Data Analytics • JUNE 2012
354. Data warehousing provides:
Databases • Data Warehousing • JUNE 2012
355. Which DB abstraction level describes what data are stored?
Databases • DBMS Architecture • JUNE 2012
356. For B+ tree on 8-byte names, 512-byte blocks, 4-byte pointers, best degree is
Databases • Index structures • JUNE 2012
357. Schema R(A,B,C,D) with A→B, C→D decomposed into R₁(A,B), R₂(C,D) is:?
Databases • Normalization • JUNE 2012
358. When a transaction updates then aborts leaving dirty writes, the problem is called:?
Databases • Transaction Anomalies • JUNE 2012
359. Max colors needed for any planar graph = __.
Discrete Structures and Optimization • Graph Coloring • JUNE 2012
360. Two cosets aH and bH in a group are always _?
Discrete Structures and Optimization • Group Theory • JUNE 2012
Disclaimer for MCQ Quiz
This quiz is for educational purposes only…