vu cs301 Final Term - Quiz No.8
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 one of the following is NOT true regarding the skip list?
Each list Si contains the special keys + infinity and - infinity.
List S0 contains the keys of S in non-decreasing order.
Each list is a subsequence of the previous one.
List Sh contains only the n special keys.
Question 5: Which of the is NOT true regarding the maze generation?
Randomly remove walls until the entrance and exit cells are in same set.
Removing a wall is the same as doing a union operation
Remove a randomly chosen wall if the cells it separates are alreadly in same set
Do not remove a randomly chosen wall if the cells it separates are alreadly in same set.
Question 6: Which of the following can be the inclusion criteria for pixels in image segmentation.
Pixel intensity
Texture
Threshold of intensity
All of the given options
Question 9: A binary relation R over S is called an equivalence relation if it has following property(s)
Reflexivity
Symmetry
Transitivity
All of the given options
Question 10: Compiler uses which one of the following in Function calls __________.
Stack
Queue
Binary Search Tree
AVL Tree