vu cs301 Final Term - Quiz No.19
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 2: Which of the following statement is NOT correct?
In linked list the elements are necessarily to be contiguous
In the linked list the elements may locate at far positions in the memory
in the linked list each elements also has he address of the elements next to it
In an array the elements are contiguous
Question 4: A specific type of tree data structure in which each node has at most two subtrees, one left and one right. Binary trees are often used for sorting information; each node of the binary search tree contains a key, with values less than that key added to left subtree and values greater than that key added to the right subtree.
Bubble Sort
Secondary Tree
Binary tree
None
Question 6: A complete binary tree having "N" nodes consists of __________ Levels.
Log2 (N+1) -1
Log2 (N-1) -1
Log2 (N+1) +1
Log2 (N-1) +1
Question 7: Non-recursive calls are faster than which of the following calls?
Parameterized
Recursive
Function
Non-Function
Question 9: The total number of nodes on 10th level of a perfect binary tree are :
256
512
1024
Can't be determined
Question 10: Each node in Binary Search Tree has __________.
1 pointer
2 pointers
3 pointers
4 pointers