vu cs301 Mid Term - Quiz No.10

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 Mid 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: Once a product prototype is developed, it is ready for. Which one of the following steps best describe this statement of the new product development?

Commercialization

Idea screening

Concept development

Test marketing

Question 2: A tree is an AVL tree if

Any one node fulfills the AVL condition

At least half of the nodes fulfill the AVL condition

All the nodes fulfill the AVL condition

None of the given options

Question 3: Consider the following function: void test_a(int n) { cout << n << " "; if (n>0) test_a(n-2); } What is printed by the call test_a(4)?

0 2

0 2 4

4 2 0

2 4

Question 4: A binary search tree should have minimum of one __________ node/s at each level.

One

Two

Three

Four

Question 5: Which of the following statement is correct about union:

To perform Union of two sets, we merge the two trees by making the root of one tree point to the root of the other.

To perform Union of two sets, we merge the two trees by making the leaf node of one tree point to the root of the other.

To perform Union of two sets, merging operation of trees in not required at all.

None of the given options.

Question 6: Which of the following is a non linear data structure?

Linked List

Stack

Queue

Tree

Question 7: Which of the following statement is correct?

A Threaded Binary Tree is a binary tree in which every node that does not have a left child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its PREOREDR successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its INORDER successor.

A Threaded Binary Tree is a binary tree in which every node that does not have a right child has a THREAD (in actual sense, a link) to its POSTORDER successor.

Question 8: Linked lists are collections of data items "lined up in a row", insertions and deletions can be made only at the front and the back of a linked list.

TRUE

FALSE

Question 9: Provide more quality products and services without variation in the quality refers to which of the following marketing functions?

Standardizing and grading

Transporting

Storing

Selling

Question 10: In a selection sort of n elements, how many times the swap function is called to complete the execution of the algorithm?

n-1

n log n

n^2