Comp _ Quizizz.pdf

8/19/24, 2:32 PM Comp | Quizizz Worksheets Name Comp Class Total questions: 23...

8/19/24, 2:32 PM Comp | Quizizz Worksheets Name Comp Class Total questions: 23 Worksheet time: 12mins Date Instructor name: Deepthi Reddy 1. A ____ does not keep track of address of every element in the list a) String b) Stack c) Linear Array d) Queue 2. A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called___ a) Red Black Tree b) Spanning Trees c) AVL Tree d) B Trees 3. A Linkedlist is a ___ Structure a) Array b) Static c) Fixed d) Dynamic 4. Aposterior analysis are more accurate than apriori analysis because a) It assumes all other factors to be dynamic b) It is a result of reverse engineering c) It contains the real data d) It assumes all other factors to be constant 5. Arrays are best data Structures a) For the size of the b) For relatively permanent collections of data structure and the data in the structure are constantly changing c) Both d) None https://quizizz.com/print/quiz/66c2e18e9c3713f0d043369a 1/4 8/19/24, 2:32 PM Comp | Quizizz 6. If array is already sorted, which of these algorithms will exhibit the best performance a) Heap Sort b) Quick Sort c) Merge sort d) Insertion sort 7. Inserting an item into teh stakc when stakck is not full is called ___ operation Deletion of item from stack when stack is empty is called ____ operation a) Push & pop b) Delete & Insert c) Insert & delete d) Pop & push 8. Max number of spanning trees in connected graph is a) 0 b) n c) 2n d) 1 9. Shell sort uses a) Quick sort b) Selection sort c) Insertion sort d) Merge sort 10. TLogical or mathematical model of a particular Organization of data is called a ____ a) Data formation b) Data Structure c) Data Configuration d) Data Arrangement 11. what will be the running time of Dijkstra's single source shortest path algorithm, if the graph G(V,E) is stored in the form of adjacency list & Binary heap is used a) None b) O(|V|2) c) O(|E| + |V| log |V|) d) O (|V| log |V|) 12. When does top value of stack changes a) At the time of deletion b) After deletion c) Before deletion d) While checking for underflow https://quizizz.com/print/quiz/66c2e18e9c3713f0d043369a 2/4 8/19/24, 2:32 PM Comp | Quizizz 13. Which if the following is levels of implementation of data structure a) Application level b) Abstract level c) Implementation level d) All 14. Which of the following not a part of ADT description? a) Both b) Data c) Operations d) None 15. Which of the following is true about the characteristics of abstract data types? A. It exports a set of operations B. It exports a type a) A - true, b-true b) a- false, b-false c) A- false, b-true d) A-true,b-false 16. Can't be designed without recursion a) fibanocci series b) tree traversal c) Tower of hanoi d) polynomial evaluation 17. which of the following has a search efficiency of O(1) a) linked list b) hash table c) tree d) heap 18. _______ is very useful when data has to be stored & retrieved in reverse order a) single linkedlist b) Stack c) doubly linkedlist d) queue 19. _____ is not a component of data structure a) operations b) storage structures c) algo d) none https://quizizz.com/print/quiz/66c2e18e9c3713f0d043369a 3/4 8/19/24, 2:32 PM Comp | Quizizz 20. ……. Is a pile in which items are added at one end and removed from the other a) doublly LL b) stack c) single LL d) queue 21. …….. level is where the model becomes compatible executable code a) implementation level b) abstract level c) application level d) interprating level 22. Inorder traversal of binary search tree will produce a) Sorted List b) None c) Reverse of Input d) Unsorted List 23. What data structure can be used to check if a syntax has balanced paranthesis ? a) Tree b) Queue c) List d) Stack https://quizizz.com/print/quiz/66c2e18e9c3713f0d043369a 4/4