Class 12 Computer Science Chapter 1 Data Structures Using Python Quiz 30 (25 MCQs)

Quiz Instructions

Select an option to see the correct answer instantly.

1. Are python lists ordered?
2. B-tree of order n is a order-n multiway tree in which each non-root node contains .....
3. What is a nested data structure in Python?
4. For the 'Removing VOWELS' activity that uses 'char()' and 'Operator(+=)', what is the most logical sequence of operations?
5. What is the result of pop(x) operation on the stack?
6. What is the result of slicing a list using [2:5]?
7. Process of inserting an element in stack is called .....
8. How can you use comprehension to create a set from a list?
9. Which data structure is the collection of nodes?
10. In algorithm assignment operation is performed using the symbol .....
11. In the 'Finding Sum of Array' activity, why would you use len() function within your custom function?
12. Which of the following statement about binary tree is CORRECT?
13. ..... operation removes the element from the top of the stack.
14. In the following list, which item has the index number 3?["John", "Harry", "Jesse", "John", "Jairus", "Hamza"]
15. Which one of the following node is considered the top of the stack if the stack is implemented using the linked list?
16. Which traversal of a binary tree visits nodes in the following order:left, right, root?
17. If node N is a terminal node in a binary tree then its .....
18. Can sets contain duplicate elements?
19. For a given graph G having v vertices and e edges which is connected and has no cycles, which of the following statements is true?
20. What would be the output after performing the following operations in a Deque?Insertfront(10); Insertfront(20); Insertrear(30); Insertrear(40); Deletefront(); Insertfront(50); Deleterear(); Display();
21. How do you create a set in Python and what are its unique properties?
22. Traversing each and every record exactly once is called .....
23. Which of the following data structure is non linear type?
24. The operation of visiting each element in the list is known as .....
25. A normal queue, if implemented using an array of size MAX ..... SIZE, gets full when?