This action might not be possible to undo. Are you sure you want to continue?

Following are the multiple choice questions (MCQs) or objective questions from Data Structures and Algorithms. The questions are set from the topics such as arrays, records, pointers, linked lists, stacks, queues, recursion, trees, sorting and searching. Set - 1 1. Two main measures for the efficiency of an algorithm are a. Processor and memory b. Complexity and capacity c. Time and space d. Data and space 2. The time factor when determining the efficiency of algorithm is measured by a. Counting microseconds b. Counting the number of key operations c. Counting the number of statements d. Counting the kilobytes of algorithm 3. 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 needed by the algorithm 4. Which of the following case does not exist in complexity theory a. Best case b. Worst case c. Average case d. Null case 5. The Worst case occur in linear search algorithm when a. Item is somewhere in the middle of the array b. Item is not in the array at all c. Item is the last element in the array d. Item is the last element in the array or is not there at all 6. The Average case occur in linear search algorithm a. When Item is somewhere in the middle of the array

1/6

O(log n) c. O(n2) d. None or above 8. O(n log n) 10. The complexity of merge sort algorithm is a. O(n2) d.Objective Set 1 b. O(n2) d. When Item is the last element in the array d. O(log n) c. O(n log n) 9. O(n) b. Much more simpler to analyze than that of worst case c. O(n) b. When Item is not in the array at all c. O(log n) c. Much more complicated to analyze than that of worst case b. O(n) b. The complexity of linear search algorithm is a. O(n) b. The complexity of Binary search algorithm is a. O(n2) d. The complexity of the average case of an algorithm is a. O(n log n) 2/6 . Sometimes more complicated and some other times simpler than that of worst case d. The complexity of Bubble sort algorithm is a.Multiple Choice Questions (MCQs) . O(n log n) 11. When Item is the last element in the array or is not there at all 7. O(log ) c.Data structures & Algorithms .

for none of above situation 3/6 . Trees b. None of above 17. None of above 15. Linked lists c. Arrays d.Data structures & Algorithms . Traversal b. Sorting b. Both of above d. The indirect change of the values of a variable in one module by another module is called a.Objective Set 1 12. for the size of the structure and the data in the structure are constantly changing c. None of above 14. Arrays are best data structures a.Multiple Choice Questions (MCQs) . The operation of processing each element in the list is known as a. Search c. side effect d. Inserting d. for relatively permanent collections of data b. Sort d. Finding the location of the element with a given value is: a. for both of above situation d. Traversal 16. Graphs c. Arrays b. internal change b. side-module update 13. inter-module change c. Merging c. Which of the following data structure is linear data structure? a. Which of the following data structure is not linear data structure? a.

The elements of an array are stored successively in memory cells because a. the information about a. for relatively permanent collections of data b. both of above d. Null case 5. the architecture of computer memory does not allow arrays to store other than serially c.Data structures & Algorithms . The time factor when determining the efficiency of algorithm is measured by b. Two main measures for the efficiency of an algorithm are c. Time and space 2. Counting the maximum memory needed by the algorithm 4.Multiple Choice Questions (MCQs) . the data type of array c. Each array declaration need not give. by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated b. Linked lists are best suited a. Which of the following case does not exist in complexity theory d. the index set of the array 20. implicitly or explicitly. the name of array b. The space factor when determining the efficiency of algorithm is measured by a. for both of above situation d.Objective Set 1 18. for the size of the structure and the data in the structure are constantly changing c. Counting the number of key operations 3. for none of above situation 19. The Worst case occur in linear search algorithm when d. Item is the last element in the array or is not there at all 4/6 . the first data from the set to be stored d. none of above Answers 1.

the information about c. for relatively permanent collections of data 18. The operation of processing each element in the list is known as d. The elements of an array are stored successively in memory cells because a. Arrays are best data structures a.Data structures & Algorithms . The complexity of Bubble sort algorithm is c. The complexity of the average case of an algorithm is a. Each array declaration need not give. implicitly or explicitly.Objective Set 1 6. Which of the following data structure is linear data structure? c. When Item is somewhere in the middle of the array 7. O(n 2 ) 11. O(n) 9. Finding the location of the element with a given value is: b. The complexity of Binary search algorithm is b. The complexity of linear search algorithm is a. Linked lists are best suited b. Search 17. The indirect change of the values of a variable in one module by another module is called c. Much more complicated to analyze than that of worst case 8. None of above 14. side effect 13. the first data from the set to be stored 20. O(n log n) 12. The complexity of merge sort algorithm is d. by this way computer can keep track only the address of the first element and the addresses of other 5/6 . O(log n) 10. for the size of the structure and the data in the structure are constantly changing 19.Multiple Choice Questions (MCQs) . Traversal 16. Arrays 15. The Average case occur in linear search algorithm a. Which of the following data structure is not linear data structure? d.

Data structures & Algorithms .Multiple Choice Questions (MCQs) .Objective Set 1 elements can be calculated 6/6 .

Sign up to vote on this title

UsefulNot useful- data-structures-a-algorithms-multiple-choice-questions-mcqs-objective-set-2
- MCQ-Test-Questions-on-Data-Structures-and-Algorithms-www.psexam.com_
- Data Structure MCQ
- Data Structures a Algorithms Multiple Choset 3
- os-mcq
- Suggestion Paper for CS503 - Design and Analysis of Algorithm
- MCQ's of Operating System (OS)
- DBMS.MCQs
- 50756667 Data Structure Objective Questions
- Operating System Mcq
- data structure objective questions
- Software Engineering MCQ Exam
- c Multiple Choice Questions and Answers PDF
- Data Structure Multiple Choice Questions _ Admissionadda
- 203 Dbms Question Bank
- MCQ of C++
- Operating System MCQS (GATE)
- Analysis And Design Of Algorithms (ADA) 2 marks question
- Cs33- Data Structures Questions and Answers
- c++ mcq
- Database Management System and Design MCQ
- Software Engineering Quiz
- mcq
- UNIX - MCQ
- Operating System Mcq Bank
- mcq
- Mcqs on Software Engineering
- MCQ on Operating System
- Software Engineering Solved Mcqs
- Multiple Choice Question of Computer Networking
- Data Structures a Algorithms Multiple Choice Questions Mcqs Objective Set 1