# Data Structure MCQ – More MCQ With Answer Part-3

A. 2

B. 3

C. 4

D. 5

## 2. Quotation marks are also called as ____________.

A. string delimiters.

B. period.

C. stopper.

D. string.

## 3. A string `s` consists of x, y and if x is an empty string then y is called as___________.

A. initial substring.

B. substring of s.

C. node of the string.

D. index.

## 4. The length of the string can be listed as an additional item in _____________.

A. base pointer.

B. pointer array.

C. node.

D. record.

A. Hoare.

B. Sedgewick.

C. Mellroy.

D. Coreman.

A. binary.

B. arithmetic

C. algebraic

D. logarithmic

A. 2i-1.

B. 3i-1.

C. i+1.

D. 2i+1.

## 8. The number of edges in a regular graph of degree d and n vertices is _______.

A. maximum of n,d.

B. n+d.

C. nd.

D. nd/2.C

A. Stack.

B. Set.

C. List.

D. Queue.

## 10. What is an external sorting algorithm?

A. Algorithm that uses tape or disk during the sort

B. Algorithm that uses main memory during the sort

C. Algorithm that involves swapping

D. Algorithm that are considered in place

Answer: A.Algorithm that uses tape or disk during the sort

## 11. Allocating memory for arrays during program compilation is___________.

A. dynamic memory allocation.

B. memory allocation.

C. static allocation.

D. random allocation.

A. successively.

B. randomly.

C. alternately.

D. on any order.

A. sorting.

B. traversing.

C. searching.

D. merging.

A. m.

B. n.

C. m2.

D. m*n.

## 15. The sequence (1,1) (2,1) (3,1) (1,2) (2,2) (3,2) . . . .represents _________.

A. row major order.

B. column major order.

C. random order.

D. successive order.

A. pre-order

B. post-order

C. prefix

D. in-order

## 17. Selection sort and quick sort both fall into the same category of sorting algorithms._________ is thatcategory.

A. O(n log n) sorts.

B. Divide-and-conquer sorts.

C. Interchange sorts.

A. merge.

B. obstacle.

C. overlapping.

D. collision.

## 19. Uniform distribution of the hash address throughout the given set L is __________.

A. reduce the number of collision.

B. increase the number of collision.

C. totally avoid collision.

Answer: A.reduce the number of collision.

## 20. An edge E is called _________ if it has identical endpoints.

A. multiple edges.

B. loops.

C. finite.

D. digraph.

A. Arranging.

B. Bonding.

C. Combing.

D. Chaining.

A. Algorithm.

B. Program.

C. Procedure.

D. Process.

A. hierarchical.

B. procedural.

C. indexed.

D. leveled.

A. n.

B. n+1.

C. n+2.

D. n-1.

## 25. A vertex of degree one is called __________.

B. isolated vertex

C. null vertex

D. colored vertex

## 26. A connected graph T without any cycles is called _____________.

A. a tree graph.

B. free tree.

C. a tree.

D. all of the above.

## 27. If every node u in G is adjacent to every other node v in G, A graph is said to be _______.

A. isolate.

B. complete.

C. finite.

D. Strongly connected.

## 28. In a graph G if e=(u,v), then u and v are called ___________.

A. endpoints.

C. neighbours.

D. all of the above.

## 29. Which of the following is true while inserting a new node in the list?

A. Check there is node in the list.

B. Check in the free node in the pool.

C. There is no node.

D. Underflow.

Answer: B.Check in the free node in the pool.

## 30. Which of the following data structures are indexed structures?

A. Linear arrays.

C. Arrays.

A. Algorithm.

B. Tree.

C. Problem.

D. Graph.

A. log n.

B. n-1/2.

C. n/2.

D. n+1/2.

## 33. Divide and conquer is an important algorithm design paradigm based on _______.

A. multi-branched recursion.

B. single-branched recursion.

C. two-way recursion.

D. None.

## 34. The correctness of a divide and conquer algorithm is usually proved by _________.

A. mathematical theorem.

B. de-Morgan `s law.

C. mathematical induction.

D. none.

A. Heap sort.

B. Quick sort.

C. Merge sort.

## 36. ____________ is finding a path/tour through the graph such that every vertex is visited exactly once.

A. Travelling Salesman tour.

B. Eulerian tour.

C. Hamiltonian tour.

D. None.

A. Array.

C. Queue.

D. Stack.

## 38. The binary tree that has n leaf nodes. The number of nodes of degree 2 in this tree is

A. log2N

B. n-1

C. n

D. None of the above

## 39. Each entry in a linked list is a called a_______________.

B. Node.

C. Data Structure.

D. Avail.

## 40. Which of the following is two way lists?

D. List traversed in two directions.

Answer: D.List traversed in two directions.

## 41. In a linked list the _________field contains the address of next element in the list.

B. Next element field.

C. Start field.

D. Info field .

## 42. A list that has no nodes is called________.

A. End list.

B. Zero list.

C. Null list.

D. Sentinel list.

## 43. The special list which consists of unused memory space is called __________.

A. Free space.

B. Empty space.

C. Available space.

D. Free storage list.

## 44. The efficient searching algorithm for algorithm for a sorted array is _________.

A. Binary search.

B. Linear search.

C. Indexed search.

D. Repeated search.

## 45. To insert a new node in linked list free node will be available in ___________.

A. Available list.

B. Avail list.

C. Free node list.

D. Memory space list.

A. 1.

B. 2.

C. 3.

D. 5.

## 48. An algorithm that calls itself directly or indirectly is known as ____________.

A. Sub algorithm. .

B. Recursion.

C. Polish notation.

D. Traversal algorithm.