vu cs301 Final Term - Quiz No.1
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: it will be efficient to place stack elements at the start of the list because insertion and removal take __________ time.
Variable
Constant
Inconsistent
None of the above
Question 2: New items are added at the __________ of the stack.
Bottom
Middle
Top
Center
Question 4: An alternative name for the same object. A "nickname".
Alias
Array
Ancestor
Argument
Question 5: Searching of an element in an AVL tree take minimum __________ time (where n is number of nodes in AVL tree)
Log2(n+1)
Log2(n+1) -1
1.44 Log2n
1.66 Log2n
Question 6: Which of the following statement is NOT true about find operation :
It is not a requirement that a find operation returns any specific name, just that finds on two elementsreturn the same answer if and only if they are in the same set.
One idea might be to use a tree to represent each set, since each element in a tree has the sameroot, thus the root can be used to name the set.
Initially each set contains one element.
initially each set contains one element and it does not make sense to make a tree of one node only.
Question 7: A binary tree of N nodes has __________.
Log10N Levels
Log2 N levels
N/2 Levels
NX2 Levels
Question 8: next() method of List class is used to:
Moves current position backward one element
Moves the "current" pointer to two steps after the last elementof the array
Moves the current position forward one element
Moves the "current" pointer to two steps before the last element of the array
Question 10: Ahmad is cousin of Ali and Ali is also cousin of Ahmad"
Reflexivity
Symmetry
Transitivity
All of the given
