Cs270 module 4 midterm exam (data structures (grantham university)

1. The link to download
CS270 Module 4 Midterm Exam (Data
Structures (Grantham University)
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).
A) hemp
B) hash table
C) heap
Points Earned: 2.5/2.5
2.
A linked list is a collection of ____.
A) addresses
B) classes
C) nodes
Points Earned: 0.0/2.5
3.
The structured design approach is also known as ____.
A) top-down design
B) object design
C) bottom-up design
Points Earned: 2.5/2.5

2. 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.
A) True
B) False
Points Earned: 2.5/2.5
5.
____ iterators are forward iterators that can also iterate backward over the
elements.
A) Output
B) Bidirectional
C) Input
Points Earned: 2.5/2.5
6.
A list is ordered if its elements are ordered according to some criteria.
A) True
B) False
Points Earned: 0.0/2.5
7.
The analysis of algorithms enables programmers to decide which algorithm to
use for a specific application.
A) True
B) False
Points Earned: 2.5/2.5
8.

3. The number of key comparisons in a sequential search depends on the value
of the search item.
A) True
B) False
Points Earned: 2.5/2.5
9.
A precondition is a statement specifying the condition(s) that must be true
before the function is called.
A) True
B) False
Points Earned: 2.5/2.5
10.
The header node is placed at the ____ of a list.
A) end
B) middle
C) beginning
Points Earned: 2.5/2.5
11.
The copy constructor automatically executes when, as a parameter, an object
is passed by value.
A) True
B) False
Points Earned: 2.5/2.5
12.
When the destructor ____ the queue, it deallocates the memory occupied by
the elements of the queue.
A) allocates

4. B) destroys
C) instantiates
Points Earned: 2.5/2.5
13.
The expression vecList.front() moves an element to the front of the vector.
A) True
B) False
Points Earned: 2.5/2.5
14.
We can traverse a singly linked list backward starting from the last node.
A) True
B) False
Points Earned: 2.5/2.5
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 ____.
A) base class constructors
B) private data members of the base class
C) data members in its own class
Points Earned: 2.5/2.5
16.
The expression vecCont.empty() empties the vector container of all elements.
A) True
B) False
Points Earned: 2.5/2.5

5. 17.
The components of a class are called the ____ of the class.
A) objects
B) members
C) operators
Points Earned: 2.5/2.5
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.
A) two
B) three
C) null
Points Earned: 2.5/2.5
19.
The syntax for accessing a class (struct) member using the operator -> is
____.
A) pointerVariableName&->classMemberName
B) pointerVariableName.classMemberName
C) pointerVariableName->classMemberName
Points Earned: 2.5/2.5
20.
If the list is stored in an array, we can traverse the list in either direction using
an ____.
A) increment variable
B) index variable
C) interface variable

6. Points Earned: 2.5/2.5
21.
With the help of the ____, two values can be combined into a single unit and,
therefore, can be treated as one unit.
A) class double
B) class tuple
C) class unit
D) class pair
Points Earned: 2.5/2.5
22.
The deque class is a type of container adapter.
A) True
B) False
Points Earned: 2.5/2.5
23.
The operation ____ reinitializes the stack to an empty state.
A) init
B) alloc
C) initializeStack
Points Earned: 2.5/2.5
24.
In the random probing method, the ith slot in the probe sequence is ____.
A) (h(X) % ri) + HTSize
B) (h(X) % HTSize) + ri
C) (h(X) + HTSize) % ri

7. D) (h(X) + ri) % HTSize
Points Earned: 2.5/2.5
25.
The binary search algorithm uses the ____ technique to search the list.
A) divide-and-divide
B) conquer-and-resign
C) divide-and-conquer
Points Earned: 2.5/2.5
26.
To define new classes, you create new ____ files.
A) friend
B) header
C) placeholder
Points Earned: 2.5/2.5
27.
To remove, or pop, an element from the stack ____.
A) incrementstackTop by 1
B) decrementstackTop by 1
C) invertstackTop
Points Earned: 2.5/2.5
28.
Every call to a recursive function requires the system to allocate memory for
the local variables and formal parameters
A) True
B) False

8. Points Earned: 2.5/2.5
29.
A technique in which one system models the behavior of another system is
called ____.
A) referencing
B) simulation
C) bench testing
Points Earned: 2.5/2.5
30.
Because a queue is an important data structure, the Standard Template
Library (STL) provides a class to implement queues in a program.
A) True
B) False
Points Earned: 2.5/2.5
31.
The derived class can redefine public member functions of a base class.
A) True
B) False
Points Earned: 0.0/2.5
32.
Containers are class templates.
A) True
B) False
Points Earned: 2.5/2.5
33.
Containers are essentially used ____.

9. A) to update objects that are part of a given set of elements
B) to manipulate data
C) to manage objects of a given type
Points Earned: 2.5/2.5
34.
In breadth first traversal, starting at the first vertex, the graph is traversed as
little as possible.
A) True
B) False
Points Earned: 2.5/2.5
35.
If the list is stored in a linked list, we can traverse the list in only one direction
starting at the first node because the links are only in one direction.
A) True
B) False
Points Earned: 2.5/2.5
36.
Default arguments can be used with an overloaded operator.
A) True
B) False
Points Earned: 2.5/2.5
37.
In a shallow copy, two pointers of different data types point to the same
memory.
A) True
B) False

10. Points Earned: 2.5/2.5
38.
In a ____, customers or jobs with higher priority are pushed to the front of the
queue.
A) false queue
B) priority queue
C) free queue
D) double queue
Points Earned: 2.5/2.5
39.
The statement vecList.push_back(elem) deletes the element elem from the
vector.
A) True
B) False
Points Earned: 2.5/2.5
40.
The use of a queue structure ensures that the items are processed in the
order they are received.
A) True
B) False
Points Earned: 2.5/2.5