Data Structures and Algorithms MCQs – Set 21

By Atul Sahu • Computer Science, Data Structures and Algorithms

Data Structures and Algorithms MCQs – Set 21

UGC NET Paper 2 Computer Science JUNE 2012 – Data Structures and Algorithms

401. Circuit output f(x,y,z) is:?

Data Structures and Algorithms • Combinational Logic • UGC NET Paper 2 Computer Science JUNE 2012

A. x¬z+xy+¬y z B. x¬z+xy+¬y¬z C. xz+xy+¬y¬z D. xz+x¬y+¬y z

402. Pseudocode with m nested loops counts combinations K; K =:?

Data Structures and Algorithms • Combinatorics • UGC NET Paper 2 Computer Science JUNE 2012

A. C(n+m−1,m) B. C(n−m+1,m) C. C(n+m−1,n) D. C(n−m+1,n)

403. Number of binary trees with 5 nodes =:?

Data Structures and Algorithms • Combinatorics • UGC NET Paper 2 Computer Science JUNE 2012

A. 32 B. 36 C. 120 D. 42

404. Which data structure is linear type?

Data Structures and Algorithms • Data structures • UGC NET Paper 2 Computer Science JUNE 2012

A. Strings B. Lists C. Queues D. All of the above

405. Given equal search probabilities, optimal BST is which diagram?

Data Structures and Algorithms • Search Trees • UGC NET Paper 2 Computer Science JUNE 2012

A. A B. B C. C D. D

406. Inorder traversal yields sorted listing in

Data Structures and Algorithms • Tree traversals • UGC NET Paper 2 Computer Science JUNE 2012

A. Binary tree B. Binary search tree C. Heaps D. None

407. To represent hierarchical relationships, which structure is suitable?

Data Structures and Algorithms • Trees • UGC NET Paper 2 Computer Science JUNE 2012

A. Dequeue B. Priority C. Tree D. All of the above

408. Match: a.Bucket sort; b.Matrix chain; c.Huffman; d.All-pairs → i.O(n); ii.O(n³); iii.O(n log n); iv.O(n³ log n).

Data Structures and Algorithms • Algorithms • UGC NET Paper 2 Computer Science JUNE 2012

A. iv, ii, i, iii B. ii, iv, i, iii C. iv, ii, iii, i D. iii, ii, iv, i

409. Match: a.Bucket sort; b.Matrix chain; c.Huffman; d.All-pairs – i.O(n);ii.O(n³);iii.O(n log n);iv.O(n³ log n)

Data Structures and Algorithms • Algorithms • UGC NET Paper 2 Computer Science JUNE 2012

A. iv ii i iii B. ii iv i iii C. iv ii iii i D. iii ii iv i

410. 5 men P,Q,R,S,T to jobs I–V, times as table. Min total time?

Data Structures and Algorithms • Assignment problem • UGC NET Paper 2 Computer Science JUNE 2012

A. 5 B. 11 C. 13 D. 15

411. Big-O for f(x)=(x+1)·log(x²+1)+3x² =

Data Structures and Algorithms • Asymptotic Analysis • UGC NET Paper 2 Computer Science JUNE 2012

A. O(x log x) B. O(x²) C. O(x³) D. O(x² log x)

412. For any B-tree of minimum degree t≥2, every node other than root must have at least ______ keys and at most ______ keys.

Data Structures and Algorithms • B-trees: Properties • UGC NET Paper 2 Computer Science JUNE 2012

A. t−1,2t+1 B. t+1,2t+1 C. t−1,2t−1 D. t+1,2t−1

413. We show CLIQUE is NP-hard by which reduction?

Data Structures and Algorithms • Complexity Theory • UGC NET Paper 2 Computer Science JUNE 2012

A. 3-CNF-SAT≤pCLIQUE B. VERTEX_COVER≤pCLIQUE C. SUBSET_SUM≤pCLIQUE D. None

414. Matrix dims 10×100,100×5,5×50: ((A1A2)A3) is how many times faster than (A1(A2A3))?

Data Structures and Algorithms • Dynamic Programming • UGC NET Paper 2 Computer Science JUNE 2012

A. 5 B. 10 C. 20 D. 100

415. Dijkstra is a _______, Floyd-Warshall is a _______.

Data Structures and Algorithms • Graph Algorithms • UGC NET Paper 2 Computer Science JUNE 2012

A. Greedy, DP B. DP, Greedy C. Greedy, Divide-Conquer D. Divide-Conquer, Greedy

416. Given two sorted lists of sizes m and n, comparisons needed in merge in worst case =

Data Structures and Algorithms • Merge Algorithm Analysis • UGC NET Paper 2 Computer Science JUNE 2012

A. m×n B. max(m,n) C. min(m,n) D. m+n−1

417. If a queue is implemented with head and tail pointers, which change on insertion into a non-empty queue?

Data Structures and Algorithms • Queues: Pointer Implementation • UGC NET Paper 2 Computer Science JUNE 2012

A. Neither pointer B. Front pointer only C. Rear pointer only D. Both pointers

418. For a B-tree of height h and degree t, CPU time to insert a node is

Data Structures and Algorithms • B-trees • UGC NET Paper 2 Computer Science JUNE 2012

A. O(h log t) B. O(t log h) C. O(t² h) D. O(t h)

419. In an open-address hash table with load factor α<1, expected probes in a successful search is

Data Structures and Algorithms • Hashing • UGC NET Paper 2 Computer Science JUNE 2012

A. at most (1/α) ln(1/(1–α)) B. at most (1/α) ln(1/(1–α)) [duplicate] C. at least (1/α) ln(1/(1–α)) D. at least (1/α) ln(α/(1–α))

420. Time complexity to build heap from n numbers is

Data Structures and Algorithms • Heaps • UGC NET Paper 2 Computer Science JUNE 2012

A. O(log n) B. O(n) C. O(n log n) D. O(n²)

Disclaimer for MCQ Quiz
This quiz is for educational purposes only…

0 0 votes

Article Rating

0 Comments

Oldest

Newest Most Voted

Inline Feedbacks

View all comments

Data Structures and Algorithms MCQs – Set 21

Related Posts