vu cs301 Final Term - Quiz No.6
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: A*B/C+D-E
A B / C * D + E -
A B * C / D + E -
A B * C + D E / -
A B + C D / + E -
Question 2: A simple sorting algorithm like selection sort or bubble sort have a wrost case of
O(1) time because all lists take the same amount of time to sort
O(n) time because it has to perform n swaps to order the list.
O(n2 ) time because sorting 1 element takes O(n) time - After 1 pass through the list, either of thesealgorithms can guarantee that 1 element is sorted.
O(n3 ) time, because the worst case has really random input which takes longer to sort.
Question 3: Compiler usees which one of the following to evaluate a mathematical equation
Binary Tree
Binary Search Tree
Parse Tree
AVL Tree
Question 4: Publics including workers, managers, volunteers and the board of directors show which of the following publics?
Citizen-action publics
Local publics
General publics
Internal Publics
Question 6: Insertion in a linked list can be done at
Front only
Back only
Somewhere in middle only
Front, Back and somewhere in the middle
Question 8: The difference between the binary tree and a binary search tree is that:
a binary search tree has two children per node whereas a binary tree can have none, one, or twochildren per node
in binary search tree nodes are inserted based on the values they contain
in binary tree nodes are inserted based on the values they contain
none of these
Question 9: In tree, the search operation is __________ as compared to the linked list.
Very fast
not fast
equally time-taken
very slow
