vu cs301 Final Term - Quiz No.15
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 properties are satisfied by Equivalence relationship?
Reflexive, Symmetric
Reflexive, Transitive
Symmetric, transitive
Reflexive, Symmetric and Transitive
Question 3: Which of the following heap method lowers the value of key at position 'p' by the amount 'delta'?
increaseKey(p,delta)
decreaseKey(p,delta)
percolateDown(p,delta)
remove(p,delta)
Question 4: Which one of the following statement is correct?
Array size is fixed once it is created
Link List size is fixed once it is created
Binary Search Tree size is fixed once it is created
AVL Tree size is fixed once it is created
Question 5: If class A defines class B as its friend, then:
Class A can access private members of Class B
Class B can access only the public members of Class A
Class A can access only the public members of Class B
Class B can access private members of Class A
Question 8: Suppose that we have implemented a priority queue by storing the items in a heap. We are now executing a reheapification downward and the out-of-place node has priority of 42. The nodes parent has a priority of 72, the left child has priority 52 and the nodes right child has priority 62. Which statement best describes the status of the reheapification.
The reheapification is done.
The next step will interchange the two children of the out-of-place node.
The next step will swap the out-of-place node with its parent.
The next step will swap the out-of-place node with its left child.
Question 10: A complete binary tree of height 3 has between __________ nodes.
8 to 14
8 to 15
8 to 16
8 to 17
