Data Structure and Algorithms (DSA) MCQs with answers Page - 2

Dear candidates you will find MCQ questions of Data Structure and Algorithms (DSA) here. Learn these questions and prepare yourself for coming examinations and interviews. You can check the right answer of any question by clicking on any option or by clicking view answer button.
Share your questions by clicking Add Question

A

Admin • 617.67K Points
Coach

Q. The memory address of fifth element of an array can be calculated by the formula

  • (A) LOC(Array[5])=Base(Array[5])+(5-lower boun(D), where w is the number of words per memory cell for the array
  • (B) LOC(Array[5])=Base(Array[4])+(5-Upper boun(D), where w is the number of words per memory cell for the array
  • (C) LOC(Array[5]=Base(Array)+w(5-lower bou
  • (D) , where w is the number of words per memory cell for the array

A

Admin • 617.67K Points
Coach

Q. The following data structure can’t store the non-homogeneous data elements

  • (A) Arrays
  • (B) Records
  • (C) Pointers
  • (D) None of the above

A

Admin • 617.67K Points
Coach

Q. The in order traversal of tree will yield a sorted listing of elements of tree in

  • (A) Binary trees
  • (B) Binary search trees
  • (C) Heaps
  • (D) None of above

A

Admin • 617.67K Points
Coach

Q. In a Heap tree values in a node is greater than

  • (A) every value in left sub tree and smaller than right sub tree
  • (B) every value in children of it
  • (C) Both of above conditions are true
  • (D) None of above conditions are true

A

Admin • 617.67K Points
Coach

Q. In a graph if e=[u, v], Then u and v are called

  • (A) endpoints of e
  • (B) adjacent nodes
  • (C) neighbors
  • (D) all of the above

A

Admin • 617.67K Points
Coach

Q. A connected graph T without any cycles is called

  • (A) tree graph
  • (B) free tree
  • (C) tree
  • (D) All of the above

A

Admin • 617.67K Points
Coach

Q. The difference between linear array and a record is

  • (A) An array is suitable for homogeneous data but hte data items in a record may have different data type
  • (B) In a record, there may not be a natural ordering in opposed to linear array.
  • (C) A record form a hierarchical structure but a linear array does not
  • (D) All of above

A

Admin • 617.67K Points
Coach

Q. The following data structure store the ho- mogeneous data elements

  • (A) Arrays
  • (B) Records
  • (C) Pointers
  • (D) None of the above

A

Admin • 617.67K Points
Coach

Q. Which of the following data structure is not linear data structure?

  • (A) Arrays
  • (B) Linked lists
  • (C) A and B are true
  • (D) None is true

A

Admin • 617.67K Points
Coach

Q. It exports a set of operations

  • (A) true, false
  • (B) false, true
  • (C) true, true
  • (D) false, false

Browse Categories

Click on category to learn MCQs of that category.