Home
MCQs / Quiz
MCQs all subjects
Quiz all subjects
Allama Iqbal Open University
Old Papers AIOU
Solved Papers AIOU 
Assignments AIOU
Internship Reports
All Other Material
Contact us
About us
Feedback
FB
Data structures and Algorithms MCQs and Quiz
The complexity of merge sort algorithm is
|
Option 1
|
O(n) |
|
Option 2
|
O(log n) |
|
Option 3
|
O(n2) |
|
Option 4
|
O(n log n) |
The operation of processing each element in the list is known as
|
Option 1
|
Sorting |
|
Option 2
|
Merging |
|
Option 3
|
Inserting |
|
Option 4
|
Traversal |
Linked lists are best suited
|
Option 1
|
for relatively permanent collections of data |
|
Option 2
|
for the size of the structure and the data in the structure are constantly changing |
|
Option 3
|
for both of above situation |
|
Option 4
|
for none of above situation |
The elements of an array are stored successively in memory cells because
|
Option 1
|
the architecture of computer memory does not allow arrays to store other than serially |
|
Option 2
|
by this way computer can keep track only the address of the first element and the addresses of other elements can be calculated |
|
Option 3
|
All of these |
|
Option 4
|
None of these |
