Question 1

Which of the following is not, strictly speaking, a component of the Standard Template Library?
A) Templates
B) Generic Algorithms
C) Containers
D) Iterators

Accepted Answer

Templates are not a component of the Standard Template Library themselves, but they are used heavily by all of the other components (containers, iterators, and algorithms) to provide generic, reusable code.

Question 2

Which of the following is not a member function of the stack adapter template? For members of stack, specify any needed arguments.
A) size)
B) empty)
C) front)
D) push)
E) top)

Accepted Answer

The Stack adapter template does not have a function named "front". Instead, it has "top" function that returns a reference to the top element of the stack. "size" returns the number of elements in the stack, "empty" checks if the stack is empty or not, and "push" adds a new element to the top of the stack.

Question 3

I have an algorithm that runs in ON^1/2), where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000? A) Same time B) About 3 minutes C) About 10 minutes D) You haven't given enough information. I can't tell.

Accepted Answer

The algorithm runs in O(N^1/2), so the time is proportional to the square root of N. For N=100, the time is 1 minute. For N=1000, the time is proportional to sqrt(1000)/sqrt(100) = sqrt(10), which is approximately 3.16. Therefore, the time is about 3 minutes.

Question 4

Which of the following is not a member function of the queue adapter template? For members of queue, specify any needed arguments.
A) size)
B) empty)
C) front)
D) push)
E) top)

Accepted Answer

"top" is a member function of the "priority_queue" adapter template, not of the "queue" adapter template.

Question 5

Given the following definition for a map, which code fragment is valid?
Map<int, string> mymap;
A) mymap[3, "hello"] = 10;
B) mymap.push_backPair3, "hello"));
C) mymap[10] = "hello";
D) mymap["hello"] = 3;

Accepted Answer

This code fragment assigns the value "hello" to the key 10 in the map. Option A is invalid syntax as it tries to assign a value to a pair (3, "hello") instead of a key-value pair. Option B is invalid syntax as there is no push_backPair() function for maps. Option D is also invalid syntax as the key type in the definition of the map is int, not string.

Question 6

Which of the following does not have STL containers types?
A) Associative containers
B) Generic Functions
C) Sequence containers
D) Container adapters

Accepted Answer

STL containers are data structures that store collections of elements in a standardized way. The STL provides three main categories of containers: sequence containers, associative containers, and container adapters. Generic functions are not a type of container, but rather a category of functions that can be used with any container type.

Question 7

In which container does the position of an inserted element depend on the data, not the order of insertion?
A) Associative containers
B) Fraternal container
C) Sequence containers
D) Container adapters

Accepted Answer

Associative containers like std::map and std::set store elements in a way that the position of an inserted element depends on its key value, not the order in which it was inserted. This makes them useful for scenarios where elements need to be efficiently accessed and looked up by their keys.

Question 8

Which of the following operations do random access iterators have?
A) Prefix operator* to make available the container element for use as l-value or r-value.
B) Overloaded binary operator+ to move the place the iterator points forward by the amount added.
C) Overloaded binary operator* to multiply the iterator by a double value to move the place the iterator points by a fractional number of elements equal to the double argument.
D) Overloaded unary operator++ to move the place the iterator points forward by as many elements as the argument.

Accepted Answer

Random access iterators have the prefix operator* to make available the container element for use as l-value or r-value. The other options are either features of bidirectional or forward iterators, or they are not valid operations for any kind of iterator.

Question 9

Which of the following is an incorrect declarations of iterators for STL containers? You may assume that the proper header has been included and that a using directive makes the names from namespace std available. A) vector::iterator vecIterator; B) list::iterator listIterator; C) deque::iterator dequeIterator; D) list::iterator listIterator;

Accepted Answer

The correct declaration for a list iterator should be "list::iterator listIterator", whereas option B declares "list::iterator listIterator".

Question 10

The time to find an element is the same for a set or a map. It is A) O1) B) ON^1/2) C) Olog N) D) ON) E) ON²)

Accepted Answer

The time to find an element in both set and map is dependent on the size of the data structure. In a set, the elements are stored in a sorted order based on their values, allowing for binary search with a time complexity of O(log N). On the other hand, in a map, the elements are stored based on their keys, which are also sorted, enabling binary search. Therefore, the time complexity to find an element in both data structures is O(log N), making choice C the best option.

Question 11

I have an algorithm that runs in On²)time, where n is the size of the problem. What does "the size of the problem" mean? A) The size of the problem is the number of bytes the data occupies B) The size of the problem is the number of lines in the source code of the program. C) The size of a problem is the number of data items that the algorithm operates upon D) The size of the problem is the depth of nesting of loops in the program.

Accepted Answer

The size of the problem refers to the amount of data items that the algorithm needs to process, so option C is the best choice. Option A is incorrect because the amount of data is not always directly related to the size of the problem. Option B is incorrect because the lines of the source code do not necessarily impact the size of the problem. Option D is incorrect because the depth of nesting of loops may be related to the algorithm's runtime, but it is not an accurate measure of the size of the problem.

Question 12

Assume proper includes have been executed, but no using directive or declaration. Write a definition of an iterator for a vector of ints that is initialized to point to the first member of the vector vec.

Accepted Answer

The answer of Assume proper includes have been executed, but...

Question 13

Declare a stack template container to hold values of type double using the list container. Write the necessary include and using statements. Mention any appropriate cautions about syntax.

Accepted Answer

The answer of Declare a stack template container to hold...

Question 14

I have an algorithm that runs in ON²), where Nis the size of the problem. For N = 100, the time for the algorithm to run is 1 minute. How long does the algorithm take for N=1000? A) Same time B) 10 minutes C) 100 minutes D) 1000 minutes

Accepted Answer

The algorithm runs in O(N^2) time complexity. If N increases from 100 to 1000, the time increases by a factor of (1000/100)^2 = 10^2 = 100. Therefore, it will take 100 minutes.

Question 15

Which of the following operations do bidirectional iterators have?
A) Prefix operator* to make available the container element for use as l-value or r-value.
B) Overloaded operator+ to add an int value to the iterator to move the place the iterator points forward by the argument number of elements.
C) Overloaded operator* to multiply the iterator by an int value to move the place the iterator points by a number of elements equal to the argument.
D) Overloaded operator- to move the place the iterator points backware by a number of elements equal to the argument.

Accepted Answer

The answer of Which of the following operations do bidirectional...

Question 16

The operator * is prefixed to an iterator to
A) Multiply the element in the container
B) Extract the element in the container to assign to it only
C) Extract the element in the container to fetch its value only
D) Extract the element in the container as either an l-value or an r-value

Accepted Answer

The operator * is used to dereference the iterator to fetch the value of the element in the container. It can also be used to extract the element as an l-value or r-value depending on how it is used.

Question 17

Which of the following member functions is NOT common to the sequential containers vector, list, deque)?
A) begin)
B) rbegin)
C) rend)
D) push_front)
E) front)

Accepted Answer

The member function push_front() is only available in list and deque, but not in vector. The other functions (begin(), rbegin(), rend(), and front()) are common to all three sequential containers.

Question 18

Which of the following operations do forward iterators have?
A) Overloaded operator+ to add an int value to the iterator to move the place the iterator points forward by the argument number of elements.
B) Overloaded operator* to multiply the iterator by an int value to move the place the iterator points by a number of elements equal to the argument.
C) Overloaded operator++ to move the place the iterator points forward by one element.
D) Overloaded operator-- to move the place the iterator points backward by one element.

Accepted Answer

Forward iterators support the operation of moving the iterator forward by one element, which is achieved through the overloaded operator++. They do not support arbitrary addition or subtraction (like with operator+ or operator--) nor multiplication of the iterator by an integer.

Question 19

Suppose we have the following definition: Vector vec; // use push_back to put 10 values into vec here. Vector::iterator itr1, itr2,itr3; Itr1 = vec.begin); Itr2 = vec.begin) + 5; Itr3 = vec.end); For this iterator which of the following is incorrect? A) *iter1 B) itr2[3] C) itr3 + 3 D) itr2 - 5

Accepted Answer

itr3 is already pointing to the end of the vector, so adding 3 to it will result in undefined behavior.

Question 20

Suppose we have the following definition: Vector vec, vec1; //use push_back to put 10 values into vec Vector::iterator p = vec.begin); Vector::const_iterator q = vec.begin); Which of the following expressions is not legal? Treat the effect of these as non-cumulative. A) *p = 1; B) *q = 1; C) p = vec.end ); D) q = vec1.end);

Accepted Answer

Option A is legal as it dereferences an iterator and sets its value to 1. 
Option C is legal as it sets the iterator p to the end iterator of vec. 
Option D is legal as it sets the const_iterator q to the end iterator of vec1.

However, option B is not legal as it attempts to modify a value through a const_iterator, which is not allowed.

Quiz 18: Standard Template Library

Which of the following is not, strictly speaking, a component of the Standard Template Library?

Which of the following is not a member function of the stack adapter template? For members of stack, specify any needed arguments.

I have an algorithm that runs in ON^1/2) , where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000?

Which of the following is not a member function of the queue adapter template? For members of queue, specify any needed arguments.

Given the following definition for a map, which code fragment is valid? Map<int, string> mymap;

Which of the following does not have STL containers types?

In which container does the position of an inserted element depend on the data, not the order of insertion?

Which of the following operations do random access iterators have?

Which of the following is an incorrect declarations of iterators for STL containers? You may assume that the proper header has been included and that a using directive makes the names from namespace std available.

The time to find an element is the same for a set or a map. It is

I have an algorithm that runs in On²) time, where n is the size of the problem. What does "the size of the problem" mean?

Assume proper includes have been executed, but no using directive or declaration. Write a definition of an iterator for a vector of ints that is initialized to point to the first member of the vector vec.

Declare a stack template container to hold values of type double using the list container. Write the necessary include and using statements. Mention any appropriate cautions about syntax.

I have an algorithm that runs in ON²) , where Nis the size of the problem. For N = 100, the time for the algorithm to run is 1 minute. How long does the algorithm take for N=1000?

Which of the following operations do bidirectional iterators have?

The operator * is prefixed to an iterator to

Which of the following member functions is NOT common to the sequential containers vector, list, deque) ?

Which of the following operations do forward iterators have?

Suppose we have the following definition: Vector<int> vec; // use push_back to put 10 values into vec here. Vector<int>::iterator itr1, itr2,itr3; Itr1 = vec.begin) ; Itr2 = vec.begin) + 5; Itr3 = vec.end) ; For this iterator which of the following is incorrect?

Suppose we have the following definition: Vector<int> vec, vec1; //use push_back to put 10 values into vec Vector<int>::iterator p = vec.begin) ; Vector<int>::const_iterator q = vec.begin) ; Which of the following expressions is not legal? Treat the effect of these as non-cumulative.

Quiz 18: Standard Template Library

Which of the following is not, strictly speaking, a component of the Standard Template Library?

Which of the following is not a member function of the stack adapter template? For members of stack, specify any needed arguments.

I have an algorithm that runs in ON1/2) , where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000?

Which of the following is not a member function of the queue adapter template? For members of queue, specify any needed arguments.

Given the following definition for a map, which code fragment is valid? Map<int, string> mymap;

Which of the following does not have STL containers types?

In which container does the position of an inserted element depend on the data, not the order of insertion?

Which of the following operations do random access iterators have?

Which of the following is an incorrect declarations of iterators for STL containers? You may assume that the proper header has been included and that a using directive makes the names from namespace std available.

The time to find an element is the same for a set or a map. It is

I have an algorithm that runs in On2) time, where n is the size of the problem. What does "the size of the problem" mean?

Assume proper includes have been executed, but no using directive or declaration. Write a definition of an iterator for a vector of ints that is initialized to point to the first member of the vector vec.

Declare a stack template container to hold values of type double using the list container. Write the necessary include and using statements. Mention any appropriate cautions about syntax.

I have an algorithm that runs in ON2) , where Nis the size of the problem. For N = 100, the time for the algorithm to run is 1 minute. How long does the algorithm take for N=1000?

Which of the following operations do bidirectional iterators have?

The operator * is prefixed to an iterator to

Which of the following member functions is NOT common to the sequential containers vector, list, deque) ?

Which of the following operations do forward iterators have?

Suppose we have the following definition: Vector<int> vec; // use push_back to put 10 values into vec here. Vector<int>::iterator itr1, itr2,itr3; Itr1 = vec.begin) ; Itr2 = vec.begin) + 5; Itr3 = vec.end) ; For this iterator which of the following is incorrect?

Suppose we have the following definition: Vector<int> vec, vec1; //use push_back to put 10 values into vec Vector<int>::iterator p = vec.begin) ; Vector<int>::const_iterator q = vec.begin) ; Which of the following expressions is not legal? Treat the effect of these as non-cumulative.

I have an algorithm that runs in ON^1/2) , where n is the size of the problem. For N = 100, the time the algorithm runs is 1 minute. How long does the algorithm take for N=1000?

I have an algorithm that runs in On²) time, where n is the size of the problem. What does "the size of the problem" mean?

I have an algorithm that runs in ON²) , where Nis the size of the problem. For N = 100, the time for the algorithm to run is 1 minute. How long does the algorithm take for N=1000?