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

Quiz Instructions

Select an option to see the correct answer instantly.

1. In ..... data structure, the data items are arranged in a linear sequence.
2. Heap exhibits the property of a binary tree?
3. There is an extra element at the head of the list called a .....
4. Which syntax correctly creates a tuple?
5. How do you determine the time complexity of a recursive algorithm?
6. #include int main() { int arr[5]={10, 20, 30, 40, 50}; printf("%d", arr[5]); return 0; }
7. What method would you use to convert a string to lowercase in Python?
8. The elements of a linked list are stored
9. What happens if you try to access a key that does not exist in a dictionary?
10. Which function is used to drop missing values from a DataFrame in Pandas?
11. ..... specifies how we enter data into our programs and what type of data we enter.
12. What data structure is best suited for implementing undo functionality in a text editor?
13. How many edges are present in the complete graph of n vertices?
14. Explain the concept of recursion with an example.
15. What type of structure is this in Python?shopping=[["tomato", "rice", "cheese", "milk"], ["soap", "masks", "detergent"]]
16. Which is not a linear data structure?
17. Which of these is not a data structure?
18. In preorder traversal of a binary tree the second step is .....
19. What is the significance of the 'import' statement in Python modules?
20. A Kind of tree where every node in a tree can have at most two children.
21. How do you instantiate an array in Java?
22. Which of the following problems can be solved using 2 pointers on linked list?
23. Maximum degree of any vertex in a simple graph of vertices n is
24. Linked list data structure offers considerable saving in .....
25. If two trees have same structure and but different node content, then they are called
26. Ordered collection of data items of the same type referred to collectively by a single name
27. In a B+ tree, both the internal nodes and the leaves have keys.
28. What is the position of the name 'Paula' in the following list:names = ["Paul", "Pranav", "Paula", "Prea"]
29. What is a data structure used to store multiple items in Python?
30. Surbhi wants to implement a particular data structure using a static array. She uses the concept of circular list to implement the data structure, because this allows her to efficiently use all fields of the array. Which data structure is Surbhi implementing?
31. In this type of data structures, data values of different types are grouped, as in structures and classes. Refer to .....
32. Which of the following is a linear data structure?
33. Consider a singly linked list of the form where F is a pointer to the first element in the linked list and L is the pointer to the last element in the list. The time of which of the following operations depends on the length of the list?
34. What is Big O notation and why is it important?
35. Who was the developer of c language?
36. What punctuation is used to signal the beginning and end of code blocks?
37. The data structure which expands and shrinks as per demand is called:
38. While implementing Stack using list when we want to delete element we must use pop function as .....
39. If for an algorithm time complexity is given by O(1) then complexityof it is:
40. D.S . stands for
41. The depth of a complete binary tree is given by
42. Which of the following data structure works on the principle of First Come First Serve?
43. Assertion (A):Application of stack is to reverse a word.Reason (R):The ordering principle is LIFO.
44. The indirection operator is represented by
45. In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
46. What happens if you attempt to pop from an empty stack?
47. When malloc() returns NULL value, it means
48. Which of the following is used to declare, construct, and initialize an array?
49. Main Operations in Queue are Called
50. What method would you use to remove a key from a dictionary?
51. How are arrays indexed?
52. Which one of the following is an application of Queue Data Structure?
53. What method can you use to get all the values from a dictionary?
54. A variant of linked list in which last node of the list points to the first node of the list is?
55. What methods can be used to access values in a dictionary?
56. Searching of any element in a data structure can be done in 2 ways ..... and .....
57. Whoose responsibility is to choose the right data structure?
58. A Balanced Tree has equal number of items on each subtree.
59. What is the primary advantage of using functions in programming according to the fundamental principles of software development?
60. Inserting an element is .....