vu cs301 Final Term - Quiz No.14
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: Local variables defined inside function body are __________ automatically at the end of function execution.
created
destroyed
incremented
decremented
Question 2: Which of the following statement is true about find(x) operation :
A find(x) on element x is performed by returning exactly the same node that is found.
A find(x) on element x is performed by returning the root of the tree containing x.
A find(x) on element x is performed by returning TRUE.
A find(x) on element x is performed by returning the whole tree itself containing x
Question 4: Consider te following array
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 5 12 23 10 7 40
Name the algorithm used
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 5 12 23 10 7 40
Name the algorithm used
Heap sort
Selection sort
Insertion sort
Bubble sort
Question 5: In simple implementation of stack, isFull() method is used due to __________.
Limitation of array
Strength of array
Linked list connectivity
Complexity of linked list
Question 6: What will be postfix expression of the following infix expression?
Infix Expression : a+b*c-d
Infix Expression : a+b*c-d
ab+c*d-
abc*+d-
abc+*d-
abcd+*-
Question 7: Which of the following is correct about AVL Tree?
It is identical to BST except height of the left and right subtrees can differ by at least 1.
It is identical to BST except height of the left and right subtrees must differ by at least 1.
It is not identical to BST, it is totally different kind of tree.
It is identical to BST except height of the left and right subtrees can differ by at most 1.
Question 8: Mergesort makes two recursive calls. Which statement is true after these recursive calls finish, but before the merge step?
Elements in the first half of the array are less than or equal to elements in the second half of the array.
None of the given options
The array elements form a heap
Elements in the second half of the array are less than or equal to elements in the first half of the array.
Question 9: In singly linked list a node consists of two parts:
Object and structure
Two pointers
Two objects
Object and pointer
Question 10: If Ahmad is cousin of Ali and Ali is cousin of Asad then Ahmad is also cousin of Asad. This statement has the following property
Reflexivity
Symmetry
Transitivity
All of the given