vu cs301 Final Term - Quiz No.17
vu cs301 Data Structures Quiz
This quiz belongs to book/course code vu cs301 Data Structures of vu organization. We have 40 quizzes available related to the book/course Data Structures. This quiz has a total of 10 multiple choice questions (MCQs) to prepare and belongs to topic Final Term. NVAEducation wants its users to help them learn in an easy way. For that purpose, you are free to prepare online MCQs and quizzes.
NVAEducation also facilitates users to contribute in online competitions with other students to make a challenging situation to learn in a creative way. You can create one to one, and group competition on an topic of a book/course code. Also on NVAEducation you can get certifications by passing the online quiz test.
Question 1: Which of the following possible operation are performed on Table ADT?
Insert, Remove
Find, Remove
Insert, Find
Insert, Find, Remove
Question 2: Select the FALSE statement binary tree.
Every binary tree has at least one node.
Every non-empty tree has exactly one root node.
Every node has at most two children.
Every non-root node has exactly one parent.
Question 3: Avl tree takes maximum __________ time to search an element.
1.44 Log2n
Log2(n+n)
Log2(n+1)+1
1.88 Log2n
Question 5: To reduce inventory management costs, many companies use a system where they carry only small inventories of parts or merchandise, often only enough for a few days of operation refers to which of the following concepts?
Just-in-time logistics
Limited inventory logistics
Economic order quantity
Supply chain management
Question 6: Which of the following is not true regarding the maze generation?
Randomly remove walls until the entrance and exit cells are in the same set.
Removing a wall is the same as doing a union operation.
Remove a randomly chosen wall if the cells it separates are already in the same set.
Do not remove a randomly chosen wall if the cells it separates are already in the same set.
Question 7: Union is a __________ time operation.
Constant
Polynomial
Exponential
None of the given options
Question 8: Which of the following statement statement is true about dummy node of threaded binary type?
This dummy node never has a value
This dummy node has always some dummy values
This dummy node has either no value or some dummy value
This dummy node has always some integer value
Question 9: Which operation of queue data structure is used to get front element from the queue and then remove it from the queue?
enqueue()
dequeue()
front()
remove()