Final

Question 1

You can directly access the nth node of a linked list. T or F?

Answer 1

False

Question 2

The dereference operator * accesses the variable to which a pointer points. T or F?

Answer 2

True

Question 3

A linked list is not fixed in size. T or F?

Answer 3

True

Question 4

When you return a dynamic array to the heap, you must include the number of elements in the array. T or F?

Answer 4

False

Question 5

Arcade Object Creation

Answer 5

Arcade myArc(“Games Ablaze”, 5);

Question 6

In a queue, a dequeue operation always removes _____ element.

Answer 6

the front

Question 7

Declare a vector [class=Student, studList]

Answer 7

vector<Student> studList;</Student>

Question 8

Which of the following statements allocates memory in the heap?

Answer 8

a = new int;

Question 9

Given a stack myData: Tom, Sam (top is Tom), what is the output after the following operations?

Push(myData, Hal)

Pop(myData)

Pop(myData)

print(Peek(myData))

Answer 9

Sam

Question 10

Linear search will compare all elements if the search key is not present. T or F?

Answer 10

True

Question 11

What is the return type for constructors?

Answer 11

None

Question 12

include <iostream></iostream>

Which XXX condition generates the following output?Not found

#include <string>
#include <vector>
using namespace std;</vector></string>

int BinarySearch(vector<int> numberList, int element, int lowVal, int highVal) {
int midVal;
if (XXX) {
midVal = (highVal + lowVal) / 2;
if (numberList.at(midVal) == element) {
return midVal;
}
else if (numberList.at(midVal) > element) {
return BinarySearch(numberList, element, lowVal, midVal - 1);
}
else {
return BinarySearch(numberList, element, midVal + 1, highVal);
}
}
else {
return -1;
}
}</int>

int main() {
vector<int> numberList(0);
int element = 20;
int matchPos;
for (int i = 0; i <= 10; ++i) {
numberList.push_back(i);
}
matchPos = BinarySearch(numberList, element, 0, numberList.size() - 1);
if (matchPos >= 0) {
cout << "Found at position " << matchPos << "." << endl;
}
else {
cout << "Not found. " << endl;
}
return 0;
}</int>

Answer 12

lowVal <= highVal

Question 13

Which XXX completes the binary search algorithm?

BinarySearch(numbers, numbersSize, key) {
mid = 0
low = 0
high = numbersSize - 1

XXX {
mid = (high + low) / 2
if (numbers[mid] < key) {
low = mid + 1
}
else if (numbers[mid] > key) {
high = mid - 1
}
else {
return mid
}
}

return -1
}

Answer 13

while (high >= low)

Question 14

Which of the following is true for overloading a class constructor?

Answer 14

The parameter types of the constructors should be different.

Question 15

Given the queue myData 12, 24, 48 (front is 12), what will be the queue contents after the following operations?

Enqueue(myData, 72)

Dequeue(myData)

Answer 15

24, 48, 72

Question 16

Heap is a region in program memory where _____.

Answer 16

the “new” operator allocates memory

Question 17

Which of the following statements is true about a class’ member function definition?

Answer 17

A function definition provides a class name, return type, arguments, and the function’s statements.

Question 18

Which of the following declaration is an accessor?

Answer 18

void GetName() const;

Question 19

Given the queue myData 12, 24, 48 (front is 12), where will the new item 72 be enqueued?
Correct!

Answer 19

After 48

Question 20

Identify the error in the following algorithm for traversing a linked list.

ListTraverse(list) {
curNode = list⇢head
while (curNode is not null) {
Print curNode’s data
curNode = list⇢head⇢next
}
}

Answer 20

The statement curNode = list⇢head⇢next should be curNode = curNode⇢next.

Question 21

Which of the following statements is true about public member functions of a class?

Answer 21

A class user can call the functions to operate on the object.

Question 22

Which statement properly frees the dynamically allocated array below?

Musketeer* musketeers = new Musketeer[8];

Answer 22

delete [] musketeers;

Question 23

The member access operator (->) is always a non-static member function. T or F?

Answer 23

True

Question 24

A member function can access the private data members, but class users cannot. T or F?

Answer 24

True

Question 25

A linked list’s head node stores _____ in the list.

Answer 25

a pointer to the first item node

Question 26

A memory leak occurs when a program allocates memory but loses the ability to access the allocated memory. T or F?

Answer 26

True

Question 27

a = [20, 10];
cout &laquo_space;“Line 3: “ &laquo_space;*(a+1) &laquo_space;endl;

Answer 27

10

Question 28

a = [20, 10];
cout &laquo_space;“Line 4: “ &laquo_space;*a+1 &laquo_space;endl;

Answer 28

21

Question 29

double primes[] = {2, 3, 5, 7, 11, 13, 17, 19};
*primes =

Answer 29

2

Question 30

double primes[] = {2, 3, 5, 7, 11, 13, 17, 19};
*primes+5 =

Answer 30

7

Question 31

double primes[] = {2, 3, 5, 7, 11, 13, 17, 19};
*(primes+5) =

Answer 31

7