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

Quiz Instructions

Select an option to see the correct answer instantly.

1. How do you insert a new node at the beginning of a singly linked list in Python?
2. In Queue we can not insert an element in between the elements that are already inserted but we can delete it.
3. How many null pointers exists in a circular linked list?
4. In circular linked list, insertion of node requires modification of?
5. What is the way to increment the rear end of a circular queue?
6. What is the main difference between a list and a tuple in Python?
7. Compression techniques can be used on the keys to reduce both space and time requirements in a B-tree.
8. It is used to implement an associative array, a structure that can map keys to values.
9. How many nodes does a full binary tree with n leaves contains?
10. The elements in a queue are added at one end called .....
11. Which is a Linear data structure?
12. Which of the following data structure is linear type?
13. The disadvantage in using a circular linked list is .....
14. What is the syntax for creating a dictionary in Python?
15. A linked list is a collection of
16. Consider an undirected graph with weighted edges, where the weights represent the cost of traversal between nodes. You are tasked with finding the path between two nodes with the minimum total cost. Which traversal algorithm is more suitable for this scenario?
17. What is list comprehension in Python?
18. To perform level-order traversal on a binary tree, which of thefollowing data structure will be required?
19. The operation to arrange all elements in required order is called:
20. How are String represented in memory in C?
21. For 'Calculating Surface Area and Volume' activity, what type of function design would be most appropriate?
22. Which method is used to view the first few rows of a DataFrame?
23. The number of elements in the adjacency matrix of a graph having 7 vertices is
24. Which syntax correctly creates a dictionary?
25. You are given pointers to first and last nodes of a singly linked list, which of the following operations are dependent on the length of the linked list?