vu cs301 Final Term - Quiz No.3
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: A queue is a data structure where elements are __________.
inserted at the back and removed from the front
inserted and removed from the top.
inserted at the front and removed from the back.
inserted and removed from both ends.
Question 2: get() method of list class is used to:
Get element from the last position
Get element from the first position
Get element from the middle position
Get element at the given position
Question 3: 5+3*2/(6-3)
3
5
7
10
Question 4: In __________, a programmer uses two pointers in the node, i.e. one to point to next node and the other to point to the previous node.
Linked list
Doubly-linked list
Array
Structure
Question 6: BinarySearchTree() is a __________.
Constructor
Destructor
Switch case
Template method call
Question 7: In threaded binary tree the NULL pointers are replaced by the
preorder successor or predecessor
inorder successor or predecessor
inorder successor or predecessor
NULL pointers are not replaced
Question 8: If there are 100 elements in a heap, and 100 deleteMin operation are performed, will get __________ list.
Sorted
Unsorted
Nonlinear
None of the given
Question 9: Searching an element in an AVL tree takes maximum __________ time (where n is number of nodes in AVL tree).
Log2(n+1)
Log2(n+1) -1
1.44 Log2n
1.66 Log2n
Question 10: The binary tree is the maximum level of its leaves (also called the depth).
Level
Width
Height
None of the given
