vu cs301 Final Term - Quiz No.7
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: __________ only removes items in reverse order as they were entered.
Stack
Queue
Both of the given
None of the given
Question 2: __________ is the stack characteristic but __________ was implemented because of the size limitation of the array.
isFull(),isEmpty()
pop(), push()
isEmpty() , isFull()
push(),pop()
Question 3: If a tree has 20 edges/links, then the total number of nodes in the tree will be:
19
20
21
Can't be determined
Question 4: Which of the given option is NOT a factor in Union by Size:
Maintain sizes (number of nodes) of all trees, and during union.
Make smaller tree, the subtree of the larger one.
Make the larger tree, the subtree of the smaller one.
Implementation: for each root node i, instead of setting parent[i] to -1, set it to -k if tree rooted at i has k nodes.
Question 5: Suppose there are a set of fruits and a set of vegetables. Both sets are __________ sets.
Disjoint
Subsets
Whole
Equal
Question 6: Which of the following algorithm is most widely used due to its good average time
Bubble sort
insertion sort
quick sort
merge sort
Question 9: Stack and Queue can be implemented using __________.
Singly Link List
Binary Tree
Binary Search Tree
AVL Tree
Question 10: What is the formula of approixation for the depth of a heap with n nodes?
log (base 2) of n
The number of digits in n (base 10 )e,g 145 has three digit
The square root of n
n