Every data structure that we use in computer science has its weaknesses and strengthsHaving a full understanding of each will help make us better programmers!For this experiment, let's work with STL vectors and STL dequesFull requirements descriptions are found in the source code filePart 1Work with inserting elements at the front of a vector and a deque (30%)Part 2Work with inserting elements at the back of a vector and a deque (30%)Part 3Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%)Please make sure to put your code specifically where it is asked for, and no where elseDo not modify any of the code you already see in the template fileThis C++ source code file is required to complete this problem ```cpp#include #include void PartOne(){ // ********************************************** // ANSWER 1 // ********************************************** // a) SET UP VECTOR A WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000 // b) PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR std::vector a; // ********************************************** // ANSWER 2 // ********************************************** // a) SET UP DEQUE B WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000 // b) PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE std::deque b; // ********************************************** // c) DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY // EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN // UP TO 5 POINTS (PARTIALLY OR WHOLLY) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF // YOUR DESCRIPTION USING C++ CODE. // **********************************************}void PartTwo(){ // ********************************************** // ANSWER 3 // ********************************************** // a) SET UP VECTOR A WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000 // b) PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR std::vector a; // ********************************************** // ANSWER 4 // ********************************************** // a) SET UP DEQUE B WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000 // b) PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE DEQUE std::deque b; // ********************************************** // c) DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY // EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN // UP TO 5 POINTS (PARTIALLY OR WHOLLY) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF // YOUR DESCRIPTION USING C++ CODE

Answered: #include #include void PartOne() ( //…

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Related questions

Question

100%

Every data structure that we use in computer science has its weaknesses and strengths
Having a full understanding of each will help make us better programmers!
For this experiment, let's work with STL vectors and STL deques
Full requirements descriptions are found in the source code file

Part 1
Work with inserting elements at the front of a vector and a deque (30%)

Part 2
Work with inserting elements at the back of a vector and a deque (30%)

Part 3
Work with inserting elements in the middle, and removing elements from, a vector and a deque (40%)

Please make sure to put your code specifically where it is asked for, and no where else
Do not modify any of the code you already see in the template file

This C++ source code file is required to complete this problem

```cpp
#include <deque>
#include <vector>

void PartOne()
{
// **********************************************
// ANSWER 1
// **********************************************
// a) SET UP VECTOR A WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000
// b) PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE VECTOR
std::vector<int> a;

// **********************************************
// ANSWER 2
// **********************************************
// a) SET UP DEQUE B WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000
// b) PUT EACH ELEMENT IN THE FRONT AS YOU ADD THEM TO THE DEQUE
std::deque<int> b;

// **********************************************
// c) DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY
// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN
// UP TO 5 POINTS (PARTIALLY OR WHOLLY) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF
// YOUR DESCRIPTION USING C++ CODE.
// **********************************************
}

void PartTwo()
{
// **********************************************
// ANSWER 3
// **********************************************
// a) SET UP VECTOR A WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000
// b) PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE VECTOR
std::vector<int> a;

// **********************************************
// ANSWER 4
// **********************************************
// a) SET UP DEQUE B WITH 500000 ELEMENTS IN ORDER 1, 2, 3, 4, ..... 500000
// b) PUT EACH ELEMENT IN THE BACK AS YOU ADD THEM TO THE DEQUE
std::deque<int> b;

// **********************************************
// c) DESCRIBE WHICH OF THE TWO OPERATIONS IS FASTER THAN THE OTHER AND WHY
// EITHER USE A COMMENT, OR PRINT YOUR DESCRIPTION TO THE SCREEN
// UP TO 5 POINTS (PARTIALLY OR WHOLLY) EXTRA CREDIT IF YOU CAN SHOW EVIDENCE OF
// YOUR DESCRIPTION USING C++ CODE

Expert Solution

Trending now

This is a popular solution!

Step by step

Solved in 2 steps

SEE SOLUTION Check out a sample Q&A here

Knowledge Booster

Learn more about

Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.

Similar questions