Data Structures Using Python
13 Questions
| Total Attempts: 21
.
Questions and Answers
- 1.A datastructure has well defined[Blank],[Blank]and[Blank]
- 2.A STACK data structure is also called
- A.
FIFO
- B.
LIFO
- C.
FILO
- D.
LILO
- 3.LIFO stands for
- A.
Last in fast out
- B.
Last in first out
- C.
Last in final out
- D.
Last in find out
- 4.In stack, Insertion and deletion take place at[Blank]
- 5.Two major operations in a stack are [Blank] and [Blank]
- 6.HOW TO CREATE AN EMPTY STACK
- A.
STACK= LIST
- B.
STACK = [ ]
- C.
STACK = NULL
- D.
STACK = ()
- 7.FIRST ELEMENT IN THE STACK WILL BE[Blank]
- 8.Which method in python is used to implement stack and queue
- 9.Which list function is used to add a new element to the stack?
- 10.In a queue, an element is deleted from [Blank] side
- 11.In a queue, an element is inserted at [Blank] end
- 12.Which function is used to delete an element from a queue[Blank]
Questions: 13 | Attempts: 21 | Last updated: Jun 9, 2020
-
Sample QuestionA STACK data structure is also called
Questions: 30 | Attempts: 138 | Last updated: Oct 19, 2015
-
Sample QuestionThe inorder and preorder traversal of a binary tree are d, b, e, a, f, c, g and a, b, d, e, c, f, g respectively. The postorder traversal of the binary tree is:
How much do you know about Data Frames? Attempt this basic Python quiz to test your knowledge!
Questions: 6 | Attempts: 25 | Last updated: Apr 9, 2020
-
Sample QuestionName the most popular open-source Python library used for doing data analysis.
Back to top