Data Structure & Algorithms Questions and Answers

Practice Mode
Showing 10 of 77 questions
Q41
Two dimensional arrays are also called
  • A tables arrays
  • B matrix arrays
  • C both of the above
  • D none of the above
Answer: Option C
Q42
The term "push" and "pop" is related to the
  • A Array
  • B Lists
  • C stacks
  • D all of above
Answer: Option C
Q43
A data structure where elements can be added or removed at either end but not in the middle is referred as
  • A Linked lists
  • B Stacks
  • C Queues
  • D Deque
Answer: Option D
Q44
The following sorting algorithm is of divide ad-conquer type
  • A Bubble sort
  • B Insertion sort
  • C Quick sort
  • D None of the above
Answer: Option B
Q45
An algorithm that calls itself directly or indirectly is known as
  • A Recursion
  • B Polish notation
  • C Traversal algorithm
  • D None of the above
Answer: Option A
Q46
The elements of an array are stored successively in memory cells because
  • A by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated
  • B the architecture of computer memory does not allow arrays to store other than serially
  • C A and B both false
  • D A and B both true
Answer: Option A
Q47
The memory address of the first element of an array is called
  • A base address
  • B floor address
  • C foundation address
  • D first address
Answer: Option A
Q48
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 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 boun(D), where w is the number of words per memory cell for the array words per memory cell for the arrray
  • D None of the above
Answer: Option C
Q49
The following data structure can't store the non-homogeneous data elements
  • A Arrays
  • B Records
  • C Pointers
  • D None of the above
Answer: Option A
Q50
The in order traversal of tree will yield a sorted listing of element of tree in
  • A Binary trees
  • B Binary search trees
  • C Heaps
  • D None of above
Answer: Option B

📚 More from Technical

← All Topics 🎯 Practice ⏱️ Take Test 🔍 Search
Technical
Back to Technical
Other Subjects
Questions and Answers for Competitive Exams Various Entrance Test