441. 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 • DEC 2013

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

Data Structures and Algorithms • Assignment problem • DEC 2013

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

Data Structures and Algorithms • Asymptotic Analysis • DEC 2013

444. 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 • DEC 2013

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

Data Structures and Algorithms • Complexity Theory • DEC 2013

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

Data Structures and Algorithms • Dynamic Programming • DEC 2013

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

Data Structures and Algorithms • Graph Algorithms • DEC 2013

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

Data Structures and Algorithms • Merge Algorithm Analysis • DEC 2013

449. 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 • DEC 2013

450. Based on cardinality and participation ________ associated with a relationship type, choose design.

Databases • Design • DEC 2013

451. Which correct? I.2PL optimistic. II.2PL pessimistic. III.TS optimistic. IV.TS pessimistic.

Databases • Concurrency Control • DEC 2013

452. “Student marks ≤100” is a ___.

Databases • Constraints • DEC 2013

453. Location transparency allows I.Users II.Programmers III.Managers to treat data as if at one location. Which?

Databases • Distributed DB • DEC 2013

454. I.Recon in mixed frag is commutative. II.Vertical frag is commutative. Which?

Databases • Distributed DB • DEC 2013

455. ER model includes I.diagram II.attributes III.relationships IV.semantic constraints. Which?

Databases • ER Modeling • DEC 2013

456. GO BOTTOM then SKIP-3 in 30 records shifts to

Databases • File Handling • DEC 2013

457. R=ABCDE, F={A→B,B→C,AC→D}. Closures of A and E are

Databases • Functional Dependencies • DEC 2013

458. Which is false?

Databases • Normalization • DEC 2013

459. __________ rules limit log volume on volatile failure.

Databases • Recovery • DEC 2013

460. A Trojan horse is

Databases • Security • DEC 2013