Data Structures and Algorithms MCQ Quiz

Which if the following is/are the levels of implementation of data structure?

• Abstract level

• Application level

• Implementation level

• Allof the above

A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

• AVL tree

• Red-black tree

• Lemma tree

• None of the above

3 level is where the model becomes

• compatible executable code

• Abstract level

• Application level

• All of the above

Stack is also called

• Last in first

• First in last

• Last in last

• First in first

Which of the following is true about the characteristics of abstract data types?

• It exports a type.

• It exports a set of operations

• True, False

• False, True

6 is not the component of data structure.

• Operations

• Storage Structures

• Algorithms

• None of above

Which of the following is not the part of ADT description?

• Data

• Operations

• Both of the above

• None of the above

Inserting an item into the stack when stack is not full is called ________.

• push

• pop

• insert

• delete

Is a pile in which items are added at one and removed from the other.

• Stack

• Queue

• List

• None of the above

Which data structure allows deleting data elements from and inserting at rear?

• Stacks

• Queues

• Dequeues

• Binary search tree