C++ Developer - Standard Template Library (STL) - Part 1

What are the three broad categories of data and functionality offered in the STL?

• Loops, Conditions, and Arrays

• Containers, Iterators, and Algorithms

• Functions, Classes, and Objects

• Variables, Constants, and Functions

Which type of STL container organizes data so that it is accessible by a special key value?

• Algorithms

• Iterators

• Associative Containers

• Sequence Containers

What is the main characteristic of a stack in terms of data access?

• Random Access

• Last In, First Out

• First In, First Out

• Sequential Access

What is the primary function of a priority queue?

• To sort elements in ascending order

• To store elements in a fixed order

• To retrieve the element with the greatest value

• To allow random access to elements

In the context of STL, what does the term 'deque' refer to?

• A priority queue

• A doubly-ended queue

• A type of stack

• A type of map

What is the purpose of the 'push' and 'pop' operations in a stack?

• To sort elements

• To search for elements

• To add and remove elements from the top

• To add and remove elements from the middle

In the coding example, what is the purpose of the 'store reverse' function?

• To sort the elements in a stack

• To store characters in reverse order in a stack

• To find the length of a string

• To print elements of a stack

Which of the following is a characteristic of a queue?

• Last In, First Out

• Bidirectional Access

• First In, First Out

• Random Access

What is the main difference between a stack and a queue?

• A stack is LIFO, while a queue is FIFO

• A stack is FIFO, while a queue is LIFO

• A stack is used for sorting, while a queue is not

• A stack allows random access, while a queue does not

In the queue project challenge, which method is used to check if the queue is empty?

• empty()

• checkEmpty()

• isEmpty()

• clear()