Data Structures: MCQ Set – 05

Q41: Maximum possible height of binary tree of N node is:

  • (A) Log2N
  • (B) N
  • (C) N2
  • (D) 2N – 1

Q42: Length of the linear array can be found by using the formula ?

  • (A) UB – LB + 1
  • (B) LB + UB
  • (C) LB – UB
  • (D) LB – UB + 1

Q43: Which of the following data structure is Non-linear type ?

  • (A) Strings
  • (B) Lists
  • (C) Stacks
  • (D) None of the above

Q44: A binary tree whose every node has either zero or two children is called

  • (A) Complete binary tree
  • (B) Binary search tree
  • (C) Extended binary tree
  • (D) None of above

Q45: Express the formula (n – 2)*(n – 4) using θ notation:

  • (A) θ (n2)
  • (B) θ (8)
  • (C) θ (log n)
  • (D) θ (n)
  • (E) θ (1)

Q46: The space factor when determining the efficiency of algorithm is measured by

  • (A) Counting the maximum memory needed by the algorithm
  • (B) Counting the minimum memory needed by the algorithm
  • (C) Counting the average memory needed by the algorithm
  • (D) Counting the maximum disk space needed by the algorithm

Q47: An algorithm A is admissible if

  • (A) It is not guaranteed to return an optimal solution when one exists
  • (B) It is guaranteed to return an optimal solution when one exists
  • (C) It returns more solutions, but not an optimal one
  • (D) It guarantees to return more optimal solutions
  • (E) It returns no solutions at all.

Q48: The data structure required for Breadth First Traversal on a graph is

  • (A) Queue
  • (B) Stack
  • (C) Array
  • (D) Tree

Q49: The two basic types of record access methods are

  • (A) sequential and random
  • (B) direct and immediate
  • (C) sequential and indexed
  • (D) on-line and real-time
  • (E) none of above

Q50: Which file organization is allowed by a direct access storage device?

  • (A) direct only
  • (B) sequential and direct only
  • (C) indexed and direct only
  • (D) sequential, indexed and direct
  • (E) none of above

Answers:

QuestionQ41Q42Q43Q44Q45Q46Q47Q48Q49Q50
AnswerBADCAABAAD

≪ Previous | Next ≫


 

Leave a Reply

Your email address will not be published.