Data structures and algorithms
0 likes103 views
The document contains multiple choice questions about data structures and algorithms concepts like stacks, queues, linked lists, trees, searching and sorting algorithms. Some key points covered are: - Stacks follow the LIFO principle and queues follow the FIFO principle - Abstract data types export a type and set of operations - Non-linear data structures include trees and graphs - Binary search has O(log n) time complexity and is used for searching sorted arrays - Trees can represent hierarchical relationships between elements
![IN A CIRCULAR QUEUE THE VALUE OF R WILL BE ..
A) r=r+1
B) r=(r+1)% [QUEUE_SIZE – 1]
C) r=(r+1)% QUEUE_SIZE
D) r=(r-1)% QUEUE_SIZE](https://image.slidesharecdn.com/datastructuresandalgorithms-220209045325/85/Data-structures-and-algorithms-20-320.jpg)
Data structures and algorithms
- 2. 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
- 3. 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
- 4. …………… IS NOT THE COMPONENT OF DATA STRUCTURE. A) Operations B) Storage Structures C) Algorithms D) None of above
- 5. 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
- 6. 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
- 7. ……………. 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
- 8. ………… IS VERY USEFUL IN SITUATION WHEN DATA HAVE TO STORED AND THEN RETRIEVED IN REVERSE ORDER. A) Stack B) Queue C) List D) None of the above
- 9. WHICH OF THE FOLLOWING DATA STRUCTURE CAN’T STORE THE NON-HOMOGENEOUS DATA ELEMENTS? A) Arrays B) Records C) Pointers D) Stacks
- 10. A ……. IS A DATA STRUCTURE THAT ORGANIZES DATA SIMILAR TO A LINE IN THE SUPERMARKET, WHERE THE FIRST ONE IN LINE IS THE FIRST ONE OUT. A) Queue linked list B) Stacks linked list C) Both of them D) Neither of them
- 11. WHICH OF THE FOLLOWING IS NON-LINER DATA STRUCTURE? A) Stacks B) List C) Strings D) Trees
- 12. IDENTIFY THE DATA STRUCTURE WHICH ALLOWS DELETIONS AT BOTH ENDS OF THE LIST BUT INSERTION AT ONLY ONE END. A) Input restricted dequeue B) Output restricted dequeue C) Priority queues D) Stack
- 13. WHICH OF THE FOLLOWING DATA STRUCTURE IS NON LINEAR TYPE? A) Strings B) Lists C) Stacks D) Graph
- 14. TO REPRESENT HIERARCHICAL RELATIONSHIP BETWEEN ELEMENTS, WHICH DATA STRUCTURE IS SUITABLE? A) Dequeue B) Priority C) Tree D) Graph
- 15. MATCH THE FOLLOWING. A) COMPLETENESS I) HOW LONG DOES IT TAKE TO FIND A SOLUTION B) TIME COMPLEXITY II) HOW MUCH MEMORY NEED TO PERFORM THE SEARCH. C) SPACE COMPLEXITY III) IS THE STRATEGY GUARANTEED TO FIND THE SOLUTION WHEN THERE IN ONE. A) a-iii, b-ii, c-i B) a-i, b-ii, c-iii C) a-iii, b-i, c-ii D) a-i, b-iii, c-ii
- 16. THE NUMBER OF COMPARISONS DONE BY SEQUENTIAL SEARCH IS ……………… A) (N/2)+1 B) (N+1)/2 C) (N-1)/2 D) (N+2)/2
- 17. IN ……………, SEARCH START AT THE BEGINNING OF THE LIST AND CHECK EVERY ELEMENT IN THE LIST. A) Linear search B) Binary search C) Hash Search D) Binary Tree search
- 18. STATE TRUE OR FALSE. I) BINARY SEARCH IS USED FOR SEARCHING IN A SORTED ARRAY. II) THE TIME COMPLEXITY OF BINARY SEARCH IS O(LOGN). A) True, False B) False, True C) False, False D) True, True
- 19. WHICH OF THE FOLLOWING IS NOT THE INTERNAL SORT? A) Insertion Sort B) Bubble Sort C) Merge Sort D) Heap Sort
- 20. IN A CIRCULAR QUEUE THE VALUE OF R WILL BE .. A) r=r+1 B) r=(r+1)% [QUEUE_SIZE – 1] C) r=(r+1)% QUEUE_SIZE D) r=(r-1)% QUEUE_SIZE
- 21. WHICH OF THE FOLLOWING STATEMENT IS TRUE? I) USING SINGLY LINKED LISTS AND CIRCULAR LIST, IT IS NOT POSSIBLE TO TRAVERSE THE LIST BACKWARDS. II) TO FIND THE PREDECESSOR, IT IS REQUIRED TO TRAVERSE THE LIST FROM THE FIRST NODE IN CASE OF SINGLY LINKED LIST. A) i-only B) ii-only C) Both i and ii D) None of both
- 22. THE ADVANTAGE OF …………….. IS THAT THEY SOLVE THE PROBLEM IF SEQUENTIAL STORAGE REPRESENTATION. BUT DISADVANTAGE IN THAT IS THEY ARE SEQUENTIAL LISTS. A) Lists B) Linked Lists C) Trees D) Queues
- 23. WHAT WILL BE THE VALUE OF TOP, IF THERE IS A SIZE OF STACK STACK_SIZE IS 5 A) 5 B) 6 C) 4 D) None
- 24. ………… IS NOT THE OPERATION THAT CAN BE PERFORMED ON QUEUE. A) Insertion B) Deletio C) Retrieval D) Traversal
- 25. THE PROPERTY OF BINARY TREE IS A) The first subset is called left subtree B) The second subtree is called right subtree C) The root cannot contain NULL D) The right subtree can be empty
- 26. STATE TRUE OR FALSE. I) THE DEGREE OF ROOT NODE IS ALWAYS ZERO. II) NODES THAT ARE NOT ROOT AND NOT LEAF ARE CALLED AS INTERNAL NODES. A) True, True B) True, False C) False, True D) False, False