#### 1. Drop table cannot be used to drop a table referenced by a…….. Constraint

A. PrimaryB. CompositeC. ForeignD. None

#### 2. ……. Specify a search condition for a group or an aggregate.

A. FROMB. WHEREC. HAVINGD. GROUP BY

#### 3. ….is a directed tree in which out degree of each node is less than or equal to two?

A. UnaryB. BinaryC. BothD. None

4. A …… in an acyclic digraph,which has
only one node with indegree 0,and other node have indegree 1

A. UndirectedB. DirectedC. JointD. None

#### 5. A directed graph is…………. If there is a path from each vertex to every other vertex in the digraph

A. Weakly connectedB. Strongly connectedC. Tightly connectedD. None

#### 6. In ……traversal we process all of a vertex’s descendents before move to an adjacent vertex.

A. Depth firstB. Breadth firstC. BothD. None

#### 7. The number of comparisons done by a sequential search

A. NB. N-1C. N-1/2D. N+1/2

#### 8. There is an extra element at the head of the list is called ……..

A. List headB. HeaderC. SentinelD. None

#### 9. …….. is not the operation that can be performed on queue.

A. InsertionB. DeletionC. TraversalD. Retrieval

#### 10. In a queue the initial value of front pointer f and rear pointer r is ……and …….respectively

A. 0 and 1B. 1 and -1C. 0 and -1D. 1 and 1