1_COP 4530 Exam 1 practice quiz

Please wait - loading…

Question 1 of 40

Write a traversal loop for an fsu::Vector object v .

Select one of the following:

for (size_t i = 0; i <= size; ++i) { /* whatever */ }
for (size_t i = 0; i < v.Size(); ++i) { /* whatever */ }
for (size_t i = 0; i < size; ++i) { /* whatever */ }
None of the other choices
for (size_t i = 0; i <= v.Size(); ++i) { /* whatever */ }

Explanation

Question 2 of 40

To find a pointer max to the largest element in the array a we can use the following generic
algorithm call (there are size elements in a)

Select one of the following:

None of the other choices
max = fsu::g_max_element ( a, a + size );
max = fsu::g_max_element ( a.Begin() );
max = fsu::g_max_element (a);
max = fsu::g_max_element ( a.Begin(), a.End() );

Explanation

Question 3 of 40

Consider the following implementation of an fsu::List operation:

Select one of the following:

Empty
Size
Reverse
Clear
Includes
None of the other
choices

Explanation

Question 4 of 40

Consider the following code implementing an fsu::List operation:

Select the missing line of code from the choices below.

Select one of the following:

newLink->prev_ = location;
newLink->prev_ = location->next_;
newLink->next_ = location->prev_;
None of the other choices
newLink->prev_ = location->prev_;

Explanation

Question 5 of 40

This is an illustration of a vector of characters to be used in answering the question:
element: B D F F F H K Q W Y
index: 0 1 2 3 4 5 6 7 8 9

What is the return value of the call upper_bound('F') ?

Select one of the following:

Explanation

Question 6 of 40

Declare a vector object widgetVector with elements of type Widget, size 15, and

initial element values equal to ZED.

Select one of the following:

fsu::Vector<Widget> widgetVector (15,ZED);
WidgetVector widgetVector (15,ZED);
fsu::Vector<Widget>(15,ZED) widgetVector;
None of the other choices
fsu::Vector<Widget(15,ZED)> widgetVector;

Explanation

Question 7 of 40

Which of the following are required (but often only implictly given) components of an algorithm?
Selected

Select one or more of the following:

Body: A recipe or set of instructions for a computation
Assumptions: Things that are assumed to be true prior to executing the body
Outcomes: Things that are true after executing the body (assuming the
assumptions)
RunTime Estimate: Statement of the runtime of the algorithm body, in
asymptotic notation, as a function of input size
RunSpace Estimate: Statement of the algorithm runspace requirements, in
asympotic "+" notation, as a function of input size
Correctness Proof: THEOREM. If the assumptions hold and the algorithm body
is executed then the outcomes are true.
RunTime Proof: THEOREM. If the assumptions hold then the asserted runtime
estimates are correct.
RunSpace Proof: THEOREM. If the assumptions hold then the asserted

Explanation

Question 8 of 40

Necessary components in a recursive function implementation are (select all that apply):

Select one or more of the following:

A recursive call: in which the function itself is called, either directly or indirectly
A base case: in which no recursive call is made and the process terminates
normally in a return
The use of a stack as part of the algorithm
A dimensional reduction: an assignment of a local variable to itself
with smaller variable

Explanation

Question 9 of 40

The following represents output from the call d.Dump() from
the fsu::Deque<char> object d:

What is the result of the following output statement?
std::cout << d[5];

Select one of the following:

Explanation

Question 10 of 40

Select the most appropriate statement for the asymptotic runtime for
the binary_search algorithm with input size n.

Select one of the following:

O(log n)
Θ(log n)
O(n)
Θ(n)

Explanation

Question 11 of 40

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

PushFront(t)
PushBack(t)
Insert(i,t)
[n] (bracket operator)
SetSize(n)
Front()
Back()
Begin()

Explanation

Question 12 of 40

To copy the elements from an fsu::Deque<> d to an fsu::Vector<> v we can use the
following generic algorithm call:

Select one of the following:

fsu::g_copy (d.Begin(), d.End(), v.Begin(), v.End());
fsu::g_copy (d.Begin(), d.End(), v.Begin());
None of the other choices
fsu::g_copy (d.Begin(), d.End(), v, v + d.Size);
fsu::g_copy (d.Begin(), d.End(), v);

Explanation

Question 13 of 40

Select a minimal set of operations that distinguish fsu::List from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

PushBack(t)
PushFront(t)
Insert(i,t)
[n] (bracket operator)
SetSize(n)
Front()
Back()
Begin()

Explanation

Question 14 of 40

Select the answer that best describes the asymptotic runtime of the operation
fsu::List::PushBack(t)
Here t is an item of type fsu::List::ValueType and n is the size of the list.

Select one of the following:

O(1)
Amortized
O(1)
O(n)
Amortized
O(n)

Explanation

Question 15 of 40

The following represents output from the call d.Dump() from
the fsu::Deque<char> object d:

What is the result of the following output statement?
std::cout << d;

Select one of the following:

None of the other
choices
G H I J A B
C D E F G
C D E F
G H I J A B C

Explanation

Question 16 of 40

You are given the declaration
fsu::List<fsu::String> L;
Write a client program fragment that inserts the strings"Help", "I", "May", "You" into L (in this
order) so that
L.Display(std::cout, ' ');
results in the sentence "May I Help You".

Select one of the following:

L.PushFront("Help");
L.PushFront("I");
L.PushFront("May");
L.PushFront("You");
L.PushBack("Help");
L.PushFront("I");
L.PushFront("May");
L.PushBack("You";);
L.PushFront("Help");
L.PushBack("I");
L.PushFront("May");
L.PushBack("You");
None of the other
choices
L.PushBack("Help");
L.PushBack("I");
L.PushBack("May");
L.PushFront("You");

Explanation

Question 17 of 40

Using a data stack to evaluate the postfix expression
1 2 3 + 4 5 6 + * + +
what is the best representation of the stack during the evaluation?

Select one of the following:

Explanation

Question 18 of 40

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

PushBack(t)
PushFront(t)
Insert(i,t)
[n] (bracket operator)
SetSize(n)
Front()
Back()
Begin()

Explanation

Question 19 of 40

The following represents data of type char stored in a vector:

With the initial search range for lower_bound underscored. Which if the following represents the
search range after ONE iteration of the loop body in lower_bound(H) ?

Select one of the following:

None of the other choices

Explanation

Question 20 of 40

Declare an fsu::List object L with elements of type fsu::String.

Select one of the following:

fsu::List<fsu::String> L;
L = fsu::List<fsu::String>;
None of the other choices
fsu::List L<fsu::String>;
L = new fsu::List<fsu::String>;

Explanation

Question 21 of 40

Select the most appropriate statement of the asymptotic runtime for
the sequential_search algorithm with input size n.

Select one of the following:

O(log n)
Θ(log n)
O(n)
Θ(n)

Explanation

Question 22 of 40

This is an illustration of a vector of characters to be used in answering the question:
What is the return value of the call lower_bound('F') ?

Select one of the following:

Explanation

Question 23 of 40

Consider the following code implementing an fsu::List operation:

Select the missing line of code from the choices below.

Select one of the following:

newLink->prev_ = location->prev_;
newLink->prev_ = location;
None of the other choices
newLink->prev_ = location->next_;
newLink->next_ = location->prev_;

Explanation

Question 24 of 40

Select the answer that best describes the asymptotic runtime of the operation
fsu::Deque:: bracket operator [i]
Here i is an item of type size_t and n is the size of the deque.

Select one of the following:

O(1)
Amortized
O(1)
O(n)
Amortized
O(n)

Explanation

Question 25 of 40

The following illustrates the contents of the control stack S during a depth-first search of a tree
[tree3], beginning at vertex R = root and searching for the vertex X = goal. (Search left before
right, beginning at the root.) The search process is started but not complete.

Select one of the following:

None of the other
choices

Explanation

Question 26 of 40

An abstract data type [ADT] consists of the following (select all that apply):

Select one or more of the following:

A set of operations on the data
Axioms, or rules, governing the way operations
interact
An implementation in a modern programming
language
Theorems, or provable behaviors derived from the
axioms
A collection of data of some type T

Explanation

Question 27 of 40

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

PushBack(t)
PushFront(t)
Insert(i,t)
[n] (bracket operator)
SetSize(n)
Front()
Back()
Begin()

Explanation

Question 28 of 40

The adaptor template defining fsu::Stack <T , C > defines an implementation of ADT
Stack by re-defining the user interface of the container C. Which of the operations listed below
must C possess for this adaptation to compile? (Check all that apply.)

Select one or more of the following:

PushBack(t)
PopBack()
PushFront(t)
PopFront()

Explanation

Question 29 of 40

Select a minimal set of operations that distinguish fsu::List from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

PushBack(t)
PushFront(t)
Insert(i,t)
[n] (bracket operator)
SetSize(n)
Front()
Back()
Begin()

Explanation

Question 30 of 40

The adaptor template defining fsu::Queue <T , C > defines an implementation of ADT
Queue by re-defining the user interface of the container C. Which of the operations listed
below must C possess for this adaptation to compile? (Check all that apply.)

Select one or more of the following:

PushBack(t)
PopFront()
PushFront(t)
PopBack()

Explanation

Question 31 of 40

Which of the following are optional (but very desirable) components of an algorithm?

Select one or more of the following:

Body: A recipe or set of instructions for a computation
Assumptions: Things that are assumed to be true prior to executing the body
Outcomes: Things that are true after executing the body (assuming the
assumptions)
RunTime Estimate: Statement of the runtime of the algorithm body, in asymptotic
notation, as a function of input size
RunSpace Estimate: Statement of the algorithm runspace requirements, in
asympotic "+" notation, as a function of input size
Correctness Proof: THEOREM. If the assumptions hold and the algorithmn body is
executed then the outcomes are true.
RunTime Proof: THEOREM. If the assumptions hold then the asserted runtime
estimates are correct.
RunSpace Proof: THEOREM. If the assumptions hold then the asserted runspace
estimates are correct.

Explanation

Question 32 of 40

Select the answer that best describes the asymptotic runtime of the operation
fsu::List::PushBack(t)
Here t is an item of type fsu::List::ValueType and n is the size of the list.

Select one of the following:

O(1)
Amortized
O(1)
O(n)
Amortized
O(n)

Explanation

Question 33 of 40

Select the most appropriate statement of the asymptotic runtime for
the sequential_search algorithm with input size n.

Select one of the following:

O(log n)
Θ(log n)
O(n)
Θ(n)

Explanation

Question 34 of 40

Select the answer that best describes the asymptotic runtime of the operation

fsu::List:: Destructor
Here n is the size of the list.

Select one of the following:

O(1)
Amortized
O(1)
O(n)
Amortized
O(n)

Explanation

Question 35 of 40

Select the answer that best describes the asymptotic runtime of the operation

fsu::Vector::PushBack(t)
Here t is an item of type fsu::Vector::ValueType and n is the size of the vector.

Select one of the following:

O(1)
Amortized
O(1)
O(n)
Amortized
O(n)

Explanation

Question 36 of 40

This is an illustration of a vector of characters to be used in answering the question:
What is the return value of the call lower_bound('Z') ?

Select one of the following:

Explanation

Question 37 of 40

Suppose the fsu::Deque<> d has elements in sorted order and we wish to
insert the element x in correct order in d. The following generic algorithm call
returns an iterator to the last correct location to insert x:

Select one of the following:

i = fsu::g_upper_bound(d.Begin(), d.End(), x);
i = fsu::g_upper_bound(d, x);
None of the other choices
i = fsu::g_lower_bound(d, x);

Explanation

Question 38 of 40

This is an illustration of a vector of characters to be used in answering the question:
What is the return value of the call upper_bound('X') ?

Select one of the following:

Explanation

Question 39 of 40

Declare a Deque object d with elements of type String.

Select one of the following:

fsu::Deque < char > d;
d = new fsu::Deque< char >;
fsu::Deque< char , fsu::List < char >>
d;
None of the other choices
d fsu::Deque < char >;

Explanation

Question 40 of 40

Suppose that we know Algorithm A has runtime Θ(n 2 ), where n is a measure of input
size. Which of the following statements is also true? (Check all that apply.)(Not sure if this one is correct)

Select one or more of the following:

A has runtime Θ(3n^2 +
7n).
A has runtime Ω(n^2 ).
A has runtime O(n^2 ).
A has runtime Θ(n^3 ).

Explanation

Check answer

["https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374759/desktop_9de02c4c-b888-4929-aa99-405fb6a10af0.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374760/desktop_f7e3e3f7-d127-47d2-adc9-09c812bd8bce.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374765/desktop_6132b597-8f0b-40d8-81bf-4263f89f570e.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374771/desktop_a785b83b-69fd-4eaf-9dbe-bb8c990fb546.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374775/desktop_df8f02b0-6715-4b93-9576-7f05cd7d3f93.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374778/desktop_6a37b1cb-f65e-4cb6-9cbc-18e4e018518f.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374779/desktop_bfa05355-4353-417d-8e19-b6a7ec116b1a.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374782/desktop_19991559-b9df-439d-8d1e-1e375a4e6d64.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374793/desktop_86dd8c57-7e08-4c84-bfa9-11c01850b0b2.jpeg","https://cdn.goconqr.com/uploads/multiple_choice_question/image/3374795/desktop_56bb3aa9-c67f-4a69-bba2-4db837388a7c.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486404/desktop_13bd4fac-380b-4e88-8a9c-5bf131fa95c4.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486405/desktop_e93bd8a1-70bd-4390-949d-9a8be209bc79.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486406/desktop_823b44b0-4cc9-4ac5-9717-116eec26f670.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486407/desktop_1bdcbe19-aed6-4392-9249-bd41392753fb.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486416/desktop_b5c4fbbf-d7be-42d5-be37-4c4929fdfbe2.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486417/desktop_93c79ffe-8f7f-4fbc-8559-16a058043e44.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486418/desktop_a707e4cd-ec0a-4249-a284-2eeb3fe13e54.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486419/desktop_e93f2aef-30c0-40f1-88e2-0321109afb78.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486448/desktop_b1627dcf-95e2-459c-8b23-aa41e4144865.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486449/desktop_c96dea80-13ae-43d4-8e6a-d7b23638e390.jpeg","https://cdn.goconqr.com/uploads/quiz_answer/image/9486450/desktop_6006bf3d-2e1f-4859-8c61-7bfc7bc77a0a.jpeg"]

	Created by E S almost 8 years ago

	Copied by Tracy Dash almost 8 years ago

accumulation of practice exam questions

1_COP 4530 Exam 1 practice quiz

Question 1 of 40

Write a traversal loop for an fsu::Vector object v .

Select one of the following:

Explanation

Question 2 of 40

To find a pointer max to the largest element in the array a we can use the following generic algorithm call (there are size elements in a)

Select one of the following:

Explanation

Question 3 of 40

Consider the following implementation of an fsu::List operation:

Select one of the following:

Explanation

Question 4 of 40

Consider the following code implementing an fsu::List operation: Select the missing line of code from the choices below.

Select one of the following:

Explanation

Question 5 of 40

This is an illustration of a vector of characters to be used in answering the question: element: B D F F F H K Q W Y index: 0 1 2 3 4 5 6 7 8 9 What is the return value of the call upper_bound('F') ?

Select one of the following:

Explanation

Question 6 of 40

Declare a vector object widgetVector with elements of type Widget, size 15, and initial element values equal to ZED.

Select one of the following:

Explanation

Question 7 of 40

Which of the following are required (but often only implictly given) components of an algorithm? Selected

Select one or more of the following:

Explanation

Question 8 of 40

Necessary components in a recursive function implementation are (select all that apply):

Select one or more of the following:

Explanation

Question 9 of 40

The following represents output from the call d.Dump() from the fsu::Deque<char> object d: What is the result of the following output statement? std::cout << d[5];

Select one of the following:

Explanation

Question 10 of 40

Select the most appropriate statement for the asymptotic runtime for the binary_search algorithm with input size n.

Select one of the following:

Explanation

Question 11 of 40

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential containers. (Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

Explanation

Question 12 of 40

To copy the elements from an fsu::Deque<> d to an fsu::Vector<> v we can use the following generic algorithm call:

Select one of the following:

Explanation

Question 13 of 40

Select a minimal set of operations that distinguish fsu::List from other fsu:: sequential containers. (Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

Explanation

Question 14 of 40

Select the answer that best describes the asymptotic runtime of the operation fsu::List::PushBack(t) Here t is an item of type fsu::List::ValueType and n is the size of the list.

Select one of the following:

Explanation

Question 15 of 40

The following represents output from the call d.Dump() from the fsu::Deque<char> object d: What is the result of the following output statement? std::cout << d;

Select one of the following:

Explanation

Question 16 of 40

You are given the declaration fsu::List<fsu::String> L; Write a client program fragment that inserts the strings"Help", "I", "May", "You" into L (in this order) so that L.Display(std::cout, ' '); results in the sentence "May I Help You".

Select one of the following:

Explanation

Question 17 of 40

Using a data stack to evaluate the postfix expression 1 2 3 + 4 5 6 + * + + what is the best representation of the stack during the evaluation?

Select one of the following:

Explanation

Question 18 of 40

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential containers. (Here i is an iterator, t is a container element, and n is an integer.)

Select one or more of the following:

Explanation

Question 19 of 40

The following represents data of type char stored in a vector: With the initial search range for lower_bound underscored. Which if the following represents the search range after ONE iteration of the loop body in lower_bound(H) ?

Select one of the following:

Explanation

Question 20 of 40

Declare an fsu::List object L with elements of type fsu::String.

To find a pointer max to the largest element in the array a we can use the following generic
algorithm call (there are size elements in a)

Consider the following code implementing an fsu::List operation:

Select the missing line of code from the choices below.

This is an illustration of a vector of characters to be used in answering the question:
element: B D F F F H K Q W Y
index: 0 1 2 3 4 5 6 7 8 9

What is the return value of the call upper_bound('F') ?

Declare a vector object widgetVector with elements of type Widget, size 15, and

initial element values equal to ZED.

Which of the following are required (but often only implictly given) components of an algorithm?
Selected

The following represents output from the call d.Dump() from
the fsu::Deque<char> object d:

What is the result of the following output statement?
std::cout << d[5];

Select the most appropriate statement for the asymptotic runtime for
the binary_search algorithm with input size n.

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

To copy the elements from an fsu::Deque<> d to an fsu::Vector<> v we can use the
following generic algorithm call:

Select a minimal set of operations that distinguish fsu::List from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

Select the answer that best describes the asymptotic runtime of the operation
fsu::List::PushBack(t)
Here t is an item of type fsu::List::ValueType and n is the size of the list.

The following represents output from the call d.Dump() from
the fsu::Deque<char> object d:

What is the result of the following output statement?
std::cout << d;

You are given the declaration
fsu::List<fsu::String> L;
Write a client program fragment that inserts the strings"Help", "I", "May", "You" into L (in this
order) so that
L.Display(std::cout, ' ');
results in the sentence "May I Help You".

Using a data stack to evaluate the postfix expression
1 2 3 + 4 5 6 + * + +
what is the best representation of the stack during the evaluation?

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

The following represents data of type char stored in a vector:

With the initial search range for lower_bound underscored. Which if the following represents the
search range after ONE iteration of the loop body in lower_bound(H) ?

Select the most appropriate statement of the asymptotic runtime for
the sequential_search algorithm with input size n.

This is an illustration of a vector of characters to be used in answering the question:
What is the return value of the call lower_bound('F') ?

Consider the following code implementing an fsu::List operation:

Select the missing line of code from the choices below.

Select the answer that best describes the asymptotic runtime of the operation
fsu::Deque:: bracket operator [i]
Here i is an item of type size_t and n is the size of the deque.

The following illustrates the contents of the control stack S during a depth-first search of a tree
[tree3], beginning at vertex R = root and searching for the vertex X = goal. (Search left before
right, beginning at the root.) The search process is started but not complete.

Select a minimal set of operations that distinguish fsu::Deque from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

The adaptor template defining fsu::Stack <T , C > defines an implementation of ADT
Stack by re-defining the user interface of the container C. Which of the operations listed below
must C possess for this adaptation to compile? (Check all that apply.)

Select a minimal set of operations that distinguish fsu::List from other fsu:: sequential
containers.
(Here i is an iterator, t is a container element, and n is an integer.)

The adaptor template defining fsu::Queue <T , C > defines an implementation of ADT
Queue by re-defining the user interface of the container C. Which of the operations listed
below must C possess for this adaptation to compile? (Check all that apply.)

Select the answer that best describes the asymptotic runtime of the operation
fsu::List::PushBack(t)
Here t is an item of type fsu::List::ValueType and n is the size of the list.

Select the most appropriate statement of the asymptotic runtime for
the sequential_search algorithm with input size n.

Select the answer that best describes the asymptotic runtime of the operation

fsu::List:: Destructor
Here n is the size of the list.

Select the answer that best describes the asymptotic runtime of the operation

fsu::Vector::PushBack(t)
Here t is an item of type fsu::Vector::ValueType and n is the size of the vector.

This is an illustration of a vector of characters to be used in answering the question:
What is the return value of the call lower_bound('Z') ?

Suppose the fsu::Deque<> d has elements in sorted order and we wish to
insert the element x in correct order in d. The following generic algorithm call
returns an iterator to the last correct location to insert x: