Campus Software Developer Assessment-Mytat Set 1

Queue ✘ Stack ✘ Directed graph ✘ Threaded binary tree ✔

Arrays must be sorted. ✘ Requirement of a sorted array is expensive when a lot of insertion and deletions are required. ✘ A mechanism is required to access middle element directly. ✘ The binary search algorithm is inefficient when the number of data elements grow in number ✔

Sorted linked list ✘ Sorted binary tree ✘ Sorted linear array ✘ Pointer array ✔

w x + y z - * ✘ w x y z + - * ✘ w x + y z * - ✘ w x + - y z * ✔

It is conceptually easier and dynamic. ✘ It is efficient in accessing an entry. ✘ It is efficient, if the sparse matrix is a band matrix. ✘ None of these ✔

Complete binary tree ✘ Binary search tree ✘ Extended binary tree ✘ None of these ✔

Primary key ✘ Foreign key ✘ Alternate key ✘ Unique ✔

ALTER ✘ INDEX ✘ DELETE ✘ All of these ✔

DELETE ✘ DROP ✘ TRUNCATE ✘ COMMIT ✔

LIKE ✘ BETWEEN ✘ = ✘ All of these ✔