Data Structure & Algorithms Questions and Answers

Practice Mode
Showing 10 of 77 questions
Q31
Linked lists are best suited for
  • A relatively permanent collections of data
  • B the size of the structure and the data in the structure are cosnstantly changing
  • C both of above situation
  • D none of above situation
Answer: Option B
Q32
Each array declaration need not give, implicitly or explicitly, the information about the
  • A name of array
  • B data type of array
  • C first data from the set to be stored
  • D index set of the array
Answer: Option C
Q33
The complexity of merge sort algorithm is
  • A O (n)
  • B O(log n)
  • C O(n log n)
  • D None of these
Answer: Option C
Q34
The indirect change of the values of a variabhle in one modue by another module is called
  • A internal change
  • B inter-module change
  • C side efect
  • D all the above
Answer: Option C
Q35
Two main measures for the efficiency of an algorithm are
  • A Time and space
  • B Processor and memory
  • C Complexity and capacity
  • D Data and space
Answer: Option A
Q36
The time factor when determining the efficiency of algrithm is measured by
  • A Counting the number of key operations
  • B Counting the number of statement
  • C Counting the kilobytes of algorithm
  • D None of the above
Answer: Option A
Q37
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
Answer: Option A
Q38
All the above which of the following data structures are indexed structures
  • A linear arrays
  • B linked lists
  • C both of above
  • D none of above
Answer: Option A
Q39
Which of the following is not the required condition for binary search algorithm
  • A there must be mechanism to delete and / condition for binary search algorithm
  • B the list must be sorted
  • C there should be the direct access to the middle element in any sublist
  • D none of the above
Answer: Option A
Q40
Which of the following is not a limitation of binary search algorithm ?
  • A binary search algorithm is not efficient when the data elements are more than 1000
  • B must use a sorted array
  • C requirement of sorted array is expensive when a lot of insertion and deletions are needed
  • D there must be a mechanism to access middle element directly
Answer: Option A

📚 More from Technical

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