www.ThinkITI.com

Home
MCQ
Search
Free Apps
Important
Study Groups
Contact Us
Policy

Home
MCQ
Objective Questions
Engineering
Computer Science
Computer Science Set-1
Data structures and Algorithms
107

Data structures and Algorithms MCQ with Answers

107) The elements of an array are stored successively in memory cells because

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

the architecture of computer memory does not allow arrays to store other than serially

both of above

none of above

Answer is:

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

Related Data structures and Algorithms MCQ with Answers

108) Which of these is the worst case time complexity of Quick Sort - and cannot be expressed in lower order terms ?

O(n)

O(n log n)

O(n²)

O(n³)

Answer is:

O(n²)

109) Which of these is the worst case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

O(n)

O(n log n)

O(n²)

O(n³)

Answer is:

O(n log n)

110) Which of these is the average case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

O(n)

O(n log n)

O(n²)

O(n³)

Answer is:

O(n log n)

111) Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms

O(n)

O(n log n)

O(n²)

O(n³)

Answer is:

O(n)

Data structures and Algorithms MCQ with Answers

For more MCQ's Click Here

107) The elements of an array are stored successively in memory cells because

by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated

Data structures and Algorithms MCQ with Answers

Related Data structures and Algorithms MCQ with Answers

108) Which of these is the worst case time complexity of Quick Sort - and cannot be expressed in lower order terms ?

O(n2)

109) Which of these is the worst case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

O(n log n)

110) Which of these is the average case time complexity of Merge Sort - and cannot be expressed in lower order terms ?

O(n log n)

111) Which of these is the time complexity involved in building a heap of n elements - and cannot be expressed in lower order terms

O(n)

Data structures and Algorithms MCQ with Answers

O(n²)