681. Which statements about trees are true? (i) Unique path ⇔ tree. (ii) Connected & e=v–1 ⇔ tree. (iii) e=v–1 & acyclic ⇔ tree.

Data Structures and Algorithms • Graph Theory • SEPT 2013

682. Linked lists are not suitable for ______.

Data Structures and Algorithms • Linear Data Structures • SEPT 2013

683. In Quicksort with splits 1–β to β, max recursion depth ≈ _____.

Data Structures and Algorithms • Quicksort Analysis • SEPT 2013

684. Amortized time per operation in Splay trees for ______ is O(log n).

Data Structures and Algorithms • Self-Adjusting Trees • SEPT 2013

685. Minimum nodes in binary tree of depth d (root at level 0) = _____.

Data Structures and Algorithms • Tree Properties • SEPT 2013

686. Given In-order and Post-order traversals (as above), Pre-order is ___.

Data Structures and Algorithms • Tree Traversals • SEPT 2013

687. An optimal assignment requires that # lines covering all zeros = # ________

Data Structures and Algorithms • Assignment problem • SEPT 2013

688. Minimum cost for the assignment problem (matrix given) is ________

Data Structures and Algorithms • Assignment problem • SEPT 2013

689. Number of parenthesizations of n matrices grows as ________

Data Structures and Algorithms • Combinatorics • SEPT 2013

690. Longest increasing subsequence in n numbers can be found in time ________

Data Structures and Algorithms • Dynamic Programming • SEPT 2013

691. Time complexity of T(n)=T(n/3)+T(2n/3)+O(n) is ________

Data Structures and Algorithms • Recurrences • SEPT 2013

692. Optimal BST cost (given pᵢ,qᵢ) is ________

Data Structures and Algorithms • Search Structures • SEPT 2013

693. Thomas’s write rule is ______.

Databases • Concurrency Control • SEPT 2013

694. Cross-tab displays permit users to view ______ of multidimensional data.

Databases • OLAP & Reporting • SEPT 2013

695. Preemption plus transaction rollback prevents ______.

Databases • Transaction Management • SEPT 2013

696. Views are useful for ______ unwanted information and aggregating relations.

Databases • Views & Materialized Views • SEPT 2013

697. Match: (a) Create (b) Select (c) Rectangle (d) Record — (i) DDL (ii) DML (iii) E-R model (iv) Relational model

Databases • Data Modeling • SEPT 2013

698. Match: (a) one-to-one (b) relationship (c) many-to-many (d) many-to-one — codes below.

Databases • ER Modeling • SEPT 2013

699. constraints ensure values in one relation also appear in another.

Databases • Integrity constraints • SEPT 2013

700. SQL SELECT DISTINCT T.branch_name … T.assets>S.assets AND S.branch_city='Mumbai' finds

Databases • SQL queries • SEPT 2013