Data Structure & Algorithms Questions and Answers

Practice Mode
Showing 10 of 77 questions
Q11
If every node u in G is adjacent to every other node v in G, A graph is said to be
  • A Isolated
  • B Complete
  • C Finite
  • D Strongly connected
Answer: Option B
Q12
A variable P is called pointer if
  • A P points to the address of first element in DATA
  • B P can store only memory addresses
  • C P contain the DATA and the address of DATA
  • D P contains the address of an element in DATA.
Answer: Option D
Q13
The Worst case ocur in linear search algorithm when
  • A Item is not in the array at all
  • B Item is the last element in the array
  • C Item is the last element in the array or is not there at all
  • D None of above
Answer: Option C
Q14
The Average case occur in linear search algorithm
  • A When Item is somewhere in he middle of the array
  • B When Item is not in the array at all
  • C When Item is the last element in the array
  • D All the above
Answer: Option A
Q15
The complexity of the average case of an algorithm is
  • A Much more complicated to analyze than that of worst case
  • B Much more simpler to analyze than that of worst case
  • C Sometimes more complicated and some other times simpler than that of worst case
  • D None of above
Answer: Option A
Q16
The following data structure allows deleting data elemtnts from front and inserting at rear
  • A Stacks
  • B Queues
  • C Deques
  • D Binary search tree
Answer: Option B
Q17
This data structure allows deletions at both ends of the list but insertion at only one end.
  • A Input-restricted deque
  • B Output-restricted deque
  • C Priority queues
  • D None of the above
Answer: Option A
Q18
The follwing data structure is non-linear type
  • A Strings
  • B Lists
  • C Stacks
  • D None of the above
Answer: Option D
Q19
The following data structure is non-linear type
  • A Strings
  • B Lists
  • C Queues
  • D All of the above
Answer: Option D
Q20
To represent hierachical relationship between elements, the following data structure is not suitable
  • A Deque
  • B Priority
  • C Tree
  • D All of above
Answer: Option C

📚 More from Technical

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