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

Quiz Instructions

Select an option to see the correct answer instantly.

1. ..... is neither an algorithm nor a program.
2. The post fix form of (A + B) *C is
3. Which one of the following is the process of inserting an element in the stack?
4. What is the purpose of using sets in Python? Provide an example.
5. How many edges are in a tree?
6. List some common methods available for strings in Python.
7. The data type keyword NOT supported in C Language is:
8. Give syntax to create a node for Single linked list?
9. Can We Implement Stack Using Queue Data structure
10. If the front pointer in a circular queue is at index 0 and the rear pointer is at index n-1, what is the length of the queue?
11. Tree is a specific form of .....
12. If l=[23, 4, 56, 78] and top=len(l)-1 what would be l[top]?
13. Undo/Redo is implemented using .....
14. What does the .values() function do in Python Dictionaries?
15. Which of the following is not the type of queue?
16. If the size of the stack is 10 and we try to add the 11th element in the stack then the condition is known as .....
17. Which of the following operations is performed more efficiently by doubly linked list than by singly linked list?
18. What will happen if you try to add a duplicate item to a set?
19. In stack insertion and deletion can take place only at one end call the ..... of the stack.
20. What will be the output of the following code:if x > 10:print('High') else:print('Low')?
21. What method in Python is used to sort elements in a list in ascending order?
22. Which of the following is true about the memory allocation for arrays?
23. In a list l=[2, 5, 8, 1] after pop an element what would be len(l)
24. Consider a job scheduling problem with 4 jobs J$_{1}$, J$_{2}$, J$_{3}$, J$_{4}$ and with corresponding deadlines:( d$_{1}$, d$_{2}$, d$_{3}$, d$_{4}$) = (4, 2, 4, 2). Which of the following is not a feasible schedule without violating any job schedule?
25. Which statement determine whether a map contains the value "Pre-final" with the PF identifier?