Logo educatepk.com
MCQs & Books free for all subjects and educational help  
Subscribe email alerts:
MCQs Online
MCQs on Data structures and Algorithms
Books
MCQs on Data structures and Algorithms

Data structures and Algorithms MCQs and Quiz



Q No.1 of 10

The situation when in a linked list START=NULL is


Option 1

overflow


Option 2

housefull


Option 3

underflow


Option 4

saturated


Q No.2 of 10

Which of the following is two way list?


Option 1

circular header list


Option 2

grounded header list


Option 3

linked list with header and trailer nodes


Option 4

None of these


Q No.3 of 10

Which of the following name does not relate to stacks?


Option 1

LIFO list


Option 2

FIFO lists


Option 3

Piles


Option 4

Push-down lists


Q No.4 of 10

The term "push" and "pop" is related to the


Option 1

array


Option 2

stacks


Option 3

lists


Option 4

All of these


Q No.5 of 10

When inorder traversing a tree resulted E A C K F H D B G; the preorder traversal would return


Option 1

FEAKDCHBG


Option 2

 EAFKHDCBG


Option 3

FAEKCDBHG


Option 4

FAEKCDHGB


Q No.6 of 10

 

A data structure where elements can be added or removed at either end but not in the middle


Option 1

Deque


Option 2

Queues


Option 3

Stacks


Option 4

Linked lists


Q No.7 of 10

Two main measures for the efficiency of an algorithm are 


Option 1

Processor and memory


Option 2

Data and space


Option 3

Complexity and capacity


Option 4

Time and space


Q No.8 of 10

 

The space factor when determining the efficiency of algorithm is measured by


Option 1

Counting the average memory needed by the algorithm


Option 2

Counting the maximum disk space needed by the algorithm


Option 3

Counting the maximum memory needed by the algorithm


Option 4

Counting the minimum memory needed by the algorithm


Q No.9 of 10

 

The Average case occur in linear search algorithm


Option 1

When Item is the last element in the array


Option 2

When Item is somewhere in the middle of the array 


Option 3

When Item is not in the array at all


Option 4

When Item is the last element in the array or is not there at all


Q No.10 of 10

The complexity of the average case of an algorithm is 


Option 1

Much more simpler to analyze than that of worst case


Option 2

Much more complicated to analyze than that of worst case


Option 3

Sometimes more complicated and some other times simpler than that of worst case 


Option 4

None of these



Correct Answers