πŸ“Š Data Structure and Algorithms (DSA)
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
πŸ’¬ Discuss
βœ… Correct Answer: (C) LOC(Array[5]=Base(Array)+w(5-lower bou
πŸ“Š Data Structure and Algorithms (DSA)
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
πŸ’¬ Discuss
βœ… Correct Answer: (B) Binary search trees
πŸ“Š Data Structure and Algorithms (DSA)
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
πŸ’¬ Discuss
βœ… Correct Answer: (B) every value in children of it
πŸ“Š Data Structure and Algorithms (DSA)
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
πŸ’¬ Discuss
βœ… Correct Answer: (D) All of above

Jump to