COS2611 Assingment 4 marked memo 2024

UNISA  2024  COS2611-24-Y  Assessment 4

QUIZ




Started on Sunday, 15 September 2024, 8:23 PM
State Finished
Completed on Monday, 16 September 2024, 9:59 PM
Time taken 1 day 1 hour
Marks 55.00/55.00
Grade 100.00 out of 100.00

Information




This is a compulsory assessment. You have two (2) attempts to complete the assessment. The system will automatically
upload your attempts when the due date and time is reached. The due date is 27 September 2024, 23:00. Note that this is
the last day that UNISA will accept assessments - thus no extension can be given.


Remember, the due date is the last date for submission and not the day on which you should start with the assessment.
Work through Class 4 and Chapter 21 in the prescribed textbook, before you attempt the assessment.


There are 18 Quiz questions in this assessment.

There is no project in this assessment. Rather you will submit the project Exam Project Assessment - which will contribute to
your Examination Mark - more information will be published.




Question 1

Correct

Mark 1.00 out of 1.00




Which of the following statements is true regarding the std::stack, std::queue, and std::priority_queue containers in
C++?


a. std::stack and std::queue are both FIFO (First-In-First-Out) data structures.

b. std::priority_queue always retrieves the element with the highest priority first, regardless of insertion order. 

c. std::queue allows insertion and removal of elements at both ends.

d. std::stack and std::priority_queue both follow the LIFO (Last-In-First-Out) order.




Your answer is correct.

The correct answer is:
std::priority_queue always retrieves the element with the highest priority first, regardless of insertion order.

,Question 2

Correct

Mark 1.00 out of 1.00




Which of the following operations is NOT supported by the std::stack container in C++?


a. Accessing the top element

b. Inserting an element at the front 

c. Removing the top element

d. Checking if the stack is empty




Your answer is correct.
The correct answer is:
Inserting an element at the front




Question 3
Correct

Mark 6.00 out of 6.00




Match each C++ Standard Library container to its correct category:


std::vector Sequence Container 

std::map Associative Container 

std::stack Container Adapter 

std::list Sequence Container 

std::set Associative Container 

std::queue Container Adapter 



Your answer is correct.

The correct answer is:
std::vector → Sequence Container,

std::map → Associative Container,
std::stack → Container Adapter,

std::list → Sequence Container,

std::set → Associative Container,

std::queue → Container Adapter

, Question 4

Correct

Mark 2.00 out of 2.00




Consider the following statement and select the correct output of the code when executed.



std::vector<int> numbers;
numbers.push_back(5);
numbers.push_back(10);
numbers.push_back(15);
if (!numbers.empty()) {
numbers.erase(numbers.begin() + 1);
}
std::cout << "\n Remaining elements in the vector: ";
for (int num : numbers) {
std::cout << num << " ";
}


a. The code will not compile due to an error.

b. The code will compile and execute, but it will result in a runtime error.

c. The output will be: "Remaining elements in the vector: 10 15".

d. The output will be: "Remaining elements in the vector: 5 10 15".

e. The output will be: "Remaining elements in the vector: ".

f. The output will be: "Remaining elements in the vector: 5 15". 




Your answer is correct.

The correct answer is:
The output will be: "Remaining elements in the vector: 5 15".