Details of this Paper

MCQ of Data Structure Set-1

Description

solution

Question

1. Which if the following is/are the levels of implementation of data structure;A) Abstract level;B) Application level;C) Implementation level;D) All of the above;2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ??;A) AVL tree;B) Red-black tree;C) Lemma tree;D) None of the above;3. ??????.. level is where the model becomes compatible executable code;A) Abstract level;B) Application level;C) Implementation level;D) All of the above;4. Stack is also called as;A) Last in first out;B) First in last out;C) Last in last out;D) First in first out;5. Which of the following is true about the characteristics of abstract data types?;i) It exports a type.;ii) It exports a set of operations;A) True, False;B) False, True;C) True, True;D) False, False;6. ????? is not the component of data structure.;A) Operations;B) Storage Structures;C) Algorithms;D) None of above;7. Which of the following is not the part of ADT description?;A) Data;B) Operations;C) Both of the above;D) None of the above;8. Inserting an item into the stack when stack is not full is called ????. Operation and deletion of item form the stack, when stack is not empty is called ???..operation.;A) push, pop;B) pop, push;C) insert, delete;D) delete, insert;9. ?????. Is a pile in which items are added at one end and removed from the other.;A) Stack;B) Queue;C) List;D) None of the above;10. ???? is very useful in situation when data have to stored and then retrieved in reverse order.;A) Stack;B) Queue;C) List;D) Link list

Paper#68167 | Written in 18-Jul-2015

Price : \$22