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

Quiz Instructions

Select an option to see the correct answer instantly.

1. What happens when you add a duplicate to a set?
2. Five node splitting operations occurred when an entry is inserted into a B-tree. Then how many nodes are written?
3. A graph in which all vertices have equal degree is known as .....
4. ..... is the data structure that has collection of nodes two fields named data and link.
5. ..... is the method used by card sorter?
6. What is the maximum height of any AVL-tree with 7 nodes? Assume that the height of a tree with a single node is 0.
7. How is an array initialized in C language?
8. For an int of size 4 bites what is the size of arr[15]
9. What is a linked list in Python?
10. How do you add an element to a set?
11. What is a python dictionary?
12. Evaluate postfix expression2 3 1 * + 9-
13. Which of the following is the most appropriate data structure for reversing a string?
14. Void is ..... data type.
15. Complexity of Binary Search for an array of n numbers is
16. Consider the usual algorithm for determining whether a sequence of parentheses is balanced.The maximum number of parentheses that appear on the stack AT ANY ONE TIME when the algorithm analyzes:(()(())(())) are:
17. How do you access the third element in a list named 'my ..... list' in Python?
18. Which of the following properties are obeyed by all three tree-traversals?
19. Which value does the command 'list[3]' find?
20. Which data structure allows deleting data elements from and inserting at rear?
21. What a field does?
22. For the array:float stats[3];What is the range of the index?
23. List of data in which element can be inserted and removed at the same end is called as .....
24. In algorithm several statements appear in the same step
25. How do you create a class in Python and instantiate an object from it?
26. Which feature makes tuples useful as dictionary keys?
27. Consider the following definition in c programming language. struct node { int data; struct node next; } typedef struct node NODE; NODE *ptr; Which of the following c code is used to create new node?
28. How can you convert a list to a set in Python?
29. How many edges will a tree consisting of N nodes have?
30. Which of the following is/are property/properties of a dynamic programming problem?
31. What is the difference between a set and a frozenset in Python?
32. A set of ordered pairs where elements are known as keys or identifiers and values or content.
33. Which of the following is a correct way to declare a multidimensional array in Java?
34. Which one of these is correct about a set?
35. Pointer is ..... data type
36. How do you create a button in Tkinter that performs an action when clicked?Criterion 2:Apply reasoning to solve real-world problems in various contexts
37. What is a binary search and when is it used?
38. Storage for data defined in terms of set of operations to be performed on the data
39. Statement 1:When a node is split during insertion, the middle key is promoted to the parent as well as retained in right half-node.Statement 2:When a key is deleted from the leaf, it is also deleted from the non-leaf nodes of the tree.
40. Convert the following Infix expression to Postfix form using a stackx + y * z + (p * q + r) * s, Follow usual precedence rule and assume that the expression is legal.
41. Array is ..... data type.
42. Which of the following is the correct operator to compare two variables?
43. What is the significance of the 'self' parameter in Python class methods?
44. What are the built-in data types in Python?
45. What is the difference between a list comprehension and a generator expression in Python?
46. Which of the following application makes use of a circular linked list?
47. People have used the word ..... to mean computer information that is transmitted or stored.
48. Assertion(A):A stack is a LIFO data structureReason (R):Addition and deletion of items takes place at same end
49. Which of the following is true about a circular queue?
50. One can convert a binary tree to its mirror image by traversing it in
51. What is the time complexity of a program to reverse a linked list?
52. Which of the following highly uses the concept of an array?
53. Describe how to use filter to remove even numbers from a list.
54. Maps in Python are known as dictionaries.
55. Which of the following is NOT a basic data structure?
56. What is a set in Python and how does it differ from a list?
57. What data structure can be used to check if a syntax has balanced paranthesis?
58. In ..... data structure data items are not in sequence.
59. After performing these set of operations, what does the final list look contain? InsertFront(10); InsertFront(20); InsertRear(30); DeleteFront(); InsertRear(40); InsertRear(10); DeleteRear(); InsertRear(15); display();
60. Which of the following is true about linked list implementation of stack?