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

Quiz Instructions

Select an option to see the correct answer instantly.

1. Consider an array of integers:[10, 25, 30, 45, 50, 65, 70, 85]. If you are searching for element 10, which searching technique would be most efficient
2. In stack we can not insert an element in between the elements that are already inserted.
3. What data structure in Python follows the Last In First Out (LIFO) principle?
4. Discuss the concept of list comprehension in Python with an example.
5. The operations performed by Stack are .....
6. The ..... function is used to delete all the elements in a dictionary.
7. How do you create a tuple in Python?
8. It use pointer to link nodes.
9. What is pointer in C language?
10. What type of queue allows insertion and deletion of elements at both ends?
11. How do you create a two-dimensional list in Python?
12. Collection of dissimilar type of data item is called
13. Input/output function prototypes and macros are defined in which header file?
14. Which of the following is not a correct variable type?
15. How would you access an item in a three-dimensional array?
16. It is a method of solving problems that involves breaking a problem down into smaller and smaller sub problems until you get to a small enough problem that it can be solved trivially.
17. What is the only function all C programs must contain?
18. How do you handle exceptions in Python using try and except blocks?
19. The complexity of Binary search algorithm is
20. Stack is also called as
21. A linear list of elements in which deletion can be done from one end (front) and insertion can take place only at the other end (rear) is known as .....
22. Which of these in NOT a linear data structure?
23. What is the method to get all keys from a dictionary?
24. What method in Python is used to add an element to a set?
25. How do you iterate over the items in a tuple?
26. Number of possible ordered trees with 3 nodes A, B, C is
27. ..... technique is used by solving optimization problems
28. Which iteration method is commonly used with arrays?
29. How can you handle multiple exceptions in a single try block?
30. ..... data structures are those whose sizes and structures associated memory locations are fixed at compile time.
31. Is the syntax for the following C statement correct?:scanf("%d", input);
32. What are the different methods available for adding elements to a list in Python?
33. Which syntax correctly creates a list?
34. Consider the following two sequences:The length of longest common subsequence of X and Y is:Consider the following two sequences:X = < B, C, D, C, A, B, C >, and Y = < C, A, D, B, C, B >The length of longest common subsequence of X and Y is:
35. In linked list each node is divided into ..... parts?
36. What is the purpose of the len() function in Python?
37. In single linked list, the pointer of last node contains
38. When a pop() operation is called on an empty queue, what is the condition called?
39. In ..... data structures all elements may or may not be of same type.
40. What is the primary advantage of using a linked list over an array?
41. How can you use string comprehension in Python?
42. Which data structure in Python is best suited for implementing a queue?
43. What is a full binary tree?
44. Which of the following abstract data types can be used to represent a many to-many relation?
45. What is the function peak means?
46. In Python, which data structure can be implemented using a list with append and pop operations?
47. In Python, which data structure is used to store an ordered collection of individual items?
48. Data structure provide a means to manage huge amount of data .....
49. If I add 2 elements that are the same to a python set what will happen?
50. In Binary trees nodes with no successor are called .....
51. Efficiency of an algorithm is measured by
52. Which of the following is non-liner data structure?
53. A field or collection of fields in a record which identifies a record uniquely is called a .....
54. In one dimensional array if LB = 0 and UB = 10 then the array size is .....
55. In a stack, if a user tries to remove an element from empty stack it is called .....
56. 4 trees are B-trees of order 4. They are an isometric of ..... trees.
57. What is the purpose of keys in a dictionary?
58. Types of data structures are .....
59. Which one of the following is an application of Stack Data Structure?
60. Explain the use of the 'finally' block in exception handling.