vu cs301 Mid Term - Quiz No.12
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: In creating research questionnaires, which of the following is good advice for research specialist to follow?
Use care in the wording and ordering of questions
Questions do not have to be arranged in a logical order
Ask personal questions in the middle of the instrument
Avoid eye contact as it may confuse the respondents
Question 3: Each node in doubly link list has
1 pointer
2 pointers
3 pointers
4 pointers
Question 4: I have implemented the queue with a linked list, keeping track of a front pointer and a rear pointer. Which of these pointers will change during an insertion into an EMPTY queue?
Neither changes
Only front pointer changes.
Only rear pointer changes.
Both change.
Question 5: Which of the following is NOT a benefit of direct marketing?
Immediate response
Customer relationship building
Assists client prospecting
Greater product access and selection
Question 6: Consider te following array
23 15 5 12 40 10 7
After the first pass of a particular algorithm, the array looks like
15 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 12 23 10 7 40
Name the algorithm used
Heap sort
Selection sort
Insertion sort
Bubble sort
Question 7: By using __________ we avoid the recursive method of traversing a Tree, which makes use of stacks and consumes a lot of memory and time.
Binary tree only
Threaded binary tree
Heap data structure
Huffman encoding
Question 8: __________ is a data structure that can grow easily dynamically at run time without having to copy existing elements.
Array ()
List
Both of these
None of these
Question 9: A Compound Data Structure is the data structure which can have multiple data items of same type or of different types.Which of the following can be considered compound data structure?
Binary Search Trees
LinkLists
Arrays
All of the given options
Question 10: Which of the following statement is NOT correct about find operation:
It is not a requirement that a find operation returns any specific name, just that finds on two elements return 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 same root, 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.