Top 350+ Solved Data Structures (DS) MCQ Questions Answer

From 136 to 150 of 370

Q. The initial configuration of the queue is a,b,c,d (a is the front end). To get the configuration d,c,b,a oneneeds a minimum of ?

a. 2 deletions and 3 additions

b. 3 additions and 2 deletions

c. 3 deletions and 3 additions

d. 3 deletions and 4 additions

  • c. 3 deletions and 3 additions

Q. Quotation marks are also called as ____________.

a. string delimiters.

b. period.

c. stopper.

d. string.

  • a. string delimiters.

Q. 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.

  • a. initial substring.

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

a. base pointer.

b. pointer array.

c. node.

d. recor

  • b. pointer array.

Q. Who invented Quick sort procedure?

a. Hoare.

b. Sedgewick.

c. Mellroy.

d. Coreman.

  • a. Hoare.

Q. For the heap sort, access to nodes involves simple _______________ operations.

a. binary.

b. arithmetic

c. algebraic

d. logarithmic

  • b. arithmetic

Q. The maximum number of nodes on level i of a binary tree is ___________.

a. 2i-1.

b. 3i-1.

c. i+1.

d. 2i+1.

  • a. 2i-1.

Q. 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

  • c. nd.

Q. 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

  • a. Algorithm that uses tape or disk during the sort

Q. Allocating memory for arrays during program compilation is___________.

a. dynamic memory allocation.

b. memory allocation.

c. static allocation.

d. random allocation.

  • c. static allocation.

Q. The elements of an array are allocated in spaces________.

a. successively.

b. randomly.

c. alternately.

d. on any order.

  • a. successively.

Q. Accessing and processing each array elements is called __________.

a. sorting.

b. traversing.

c. searching.

d. merging.

  • b. traversing.

Q. An m*n array has _________number of elements.

a. m.

b. n.

c. m2.

d. m*n.

  • d. m*n.
Subscribe Now

Get All Updates & News