461. Traversing all nodes in-order on a BST of n nodes runs in?

Data Structures and Algorithms • Trees • UGC NET Paper 2 Computer Science AUG 2016

462. Expected inversions in random permutation of n distinct elements is θ(?) .

Data Structures and Algorithms • Analysis of Algorithms: Inversions • UGC NET Paper 2 Computer Science AUG 2016

463. Which search path could NOT occur in BST of 1–100 when searching 364? Sequences given.

Data Structures and Algorithms • Binary Search Trees • UGC NET Paper 2 Computer Science AUG 2016

464. Number of different binary trees with 6 nodes is:

Data Structures and Algorithms • Combinatorics: Binary Trees • UGC NET Paper 2 Computer Science AUG 2016

465. Match algorithms to complexities: (a) Huffman (b) Polygon triangulation (c) Activity selection (d) Quicksort → O(n²), θ(n³), θ(n), O(n lg n).

Data Structures and Algorithms • Greedy & Divide-Conquer • UGC NET Paper 2 Computer Science AUG 2016

466. Which array is a max‐heap? [1] [26,13,17,14,11,9,15] [2] [26,15,14,17,11,9,13] [3] [26,15,17,14,11,9,13] [4] [26,15,13,14,11,9,17]

Data Structures and Algorithms • Heaps: Max‐Heap Property • UGC NET Paper 2 Computer Science AUG 2016

467. Stack size 5: Push(a); Pop(); Push(b); Push(c); Pop(); Push(d); Pop(); Pop(); Push(e). What occurs?

Data Structures and Algorithms • Stacks • UGC NET Paper 2 Computer Science AUG 2016

468. Which is not an inherent application of stack?

Data Structures and Algorithms • Stacks – Applications • UGC NET Paper 2 Computer Science AUG 2016

469. In the given BST, if we remove the root, which node from left subtree replaces it?

Data Structures and Algorithms • Trees – BST Deletion • UGC NET Paper 2 Computer Science AUG 2016

470. For a full binary tree (zero or two children) with n nodes, maximum height is?

Data Structures and Algorithms • Trees – Height • UGC NET Paper 2 Computer Science AUG 2016

471. What is the height of the BST after inserting 10,1,3,5,15,12,16?

Data Structures and Algorithms • BST properties • UGC NET Paper 2 Computer Science AUG 2016

472. In a binary heap array, parent of element i is at index:

Data Structures and Algorithms • Heaps • UGC NET Paper 2 Computer Science AUG 2016

473. Which statement about MST of G is false?

Data Structures and Algorithms • MST properties • UGC NET Paper 2 Computer Science AUG 2016

474. Worst-case running time of merge-sort on n strings of length n is:

Data Structures and Algorithms • Sorting algorithms • UGC NET Paper 2 Computer Science AUG 2016

475. Which in-order traversal matches the given postorder of BST?

Data Structures and Algorithms • Tree traversals • UGC NET Paper 2 Computer Science AUG 2016

476. Optimistic concurrency control method?

Databases • Concurrency control • UGC NET Paper 2 Computer Science AUG 2016

477. VSAM dynamic overflow handled by?

Databases • File organizations • UGC NET Paper 2 Computer Science AUG 2016

478. Dependency-preserving decomposition ensures X→Y appears or is inferrable in some Ri?

Databases • Normalization • UGC NET Paper 2 Computer Science AUG 2016

479. 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 • UGC NET Paper 2 Computer Science AUG 2016

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

Databases • Data Definition Language • UGC NET Paper 2 Computer Science AUG 2016