Discuss Data Structures

CS 270 Data Structures Module 4 Midterm Exam

1.A ____ is a list in which each element contains a key, such that the key in the element at position k in the list is at least as large as the key in the element at position 2k + 1 (if it exists) and 2k + 2 (if it exists).

1. A) hemp
2. B) hash table
3. C) heap

2.A linked list is a collection of ____.

1. A) addresses
2. B) classes
3. C) nodes

3.The structured design approach is also known as ____.

1. A) top-down design
2. B) object design
3. C) bottom-up design

4.Operations, such as finding the height, determining the number of nodes, checking whether the tree is empty, tree traversal, and so on, on AVL trees cannot be implemented the same way they are implemented on binary trees.

1. A) True
2. B) False

5.____ iterators are forward iterators that can also iterate backward over the elements.

1. A) Output
2. B) Bidirectional
3. C) Input

6.A list is ordered if its elements are ordered according to some criteria.

1. A) True
2. B) False

7.The analysis of algorithms enables programmers to decide which algorithm to use for a specific application.

1. A) True
2. B) False

8.The number of key comparisons in a sequential search depends on the value of the search item.

1. A) True
2. B) False

9.A precondition is a statement specifying the condition(s) that must be true before the function is called.

1. A) True
2. B) False

10.The header node is placed at the ____ of a list.

1. A) end
2. B) middle
3. C) beginning

11.The copy constructor automatically executes when, as a parameter, an object is passed by value.

1. A) True
2. B) False

12.When the destructor ____ the queue, it deallocates the memory occupied by the elements of the queue.

1. A) allocates
2. B) destroys
3. C) instantiates

13.The expression vecList.front() moves an element to the front of the vector.

1. A) True
2. B) False

14.We can traverse a singly linked list backward starting from the last node.

1. A) True
2. B) False

15.When you declare a derived class object, this object inherits the members of the base class, but the derived class object cannot directly access the ____.

1. A) base class constructors
2. B) private data members of the base class
3. C) data members in its own class

16.The expression vecCont.empty() empties the vector container of all elements.

1. A) True
2. B) False

17.The components of a class are called the ____ of the class.

1. A) objects
2. B) members
3. C) operators

18.In a doubly linked list, some of the operations require modification from how they were implemented for a regular linked list, because of the ____ pointer(s) in each node.

1. A) two
2. B) three
3. C) null

19.The syntax for accessing a class (struct) member using the operator -> is ____.

1. A) pointerVariableName&->classMemberName
2. B) pointerVariableName.classMemberName
3. C) pointerVariableName->classMemberName

20.If the list is stored in an array, we can traverse the list in either direction using an ____.

1. A) increment variable
2. B) index variable
3. C) interface variable

21.With the help of the ____, two values can be combined into a single unit and, therefore, can be treated as one unit.

1. A) class double
2. B) class tuple
3. C) class unit
4. D) class pair

22.The deque class is a type of container adapter.

1. A) True
2. B) False

23.The operation ____ reinitializes the stack to an empty state.

1. A) init
2. B) alloc
3. C) initializeStack

24.In the random probing method, the ith slot in the probe sequence is ____.

1. A) (h(X) % ri) + HTSize
2. B) (h(X) % HTSize) + ri
3. C) (h(X) + HTSize) % ri
4. D) (h(X) + ri) % HTSize

25.The binary search algorithm uses the ____ technique to search the list.

1. A) divide-and-divide
2. B) conquer-and-resign
3. C) divide-and-conquer