Welcome to your Data structure & Algorithm MCQ (part 1)
1.
Which of the following data structure is more appropriate to represent a heap?
2.
A data structure in which linear sequence is maintained by pointers is known as
3.
Stack is also called as
4.
........ is not a component of Data structures
5.
Which if the following is/are the levels of implementation of data structure
6.
A binary search tree whose left subtree and rightsubtree differ in hight by at most 1 unit is called
7.
……………….. level is where the model becomescompatible executable code
8.
Which of the following is true about thecharacteristics of abstract data types?
i) It exports a type
ii) It exports a set of operations
9.
Inserting an item into the stack when stack is notfull is called …………. Operation and deletion of itemform the stack, when stack is not empty is called………..operation
10.
Which data structure allows deleting data elementsfrom and inserting at rear?
-----------------------------------------------------Thank You -----------------------------------------------------
Join our social networks below and stay updated with latest contests, videos, internships and jobs!
YouTube | LinkedIn | Instagram | Facebook | Pinterest
