Data structures and algorithms in C++
Data structures and algorithms in C++
2nd Edition
ISBN: 9780470460443
Author: Goodrich
Publisher: WILEY
bartleby

Concept explainers

Expert Solution & Answer
Book Icon
Chapter 1, Problem 8C

Explanation of Solution

Program code:

//include the required header files

#include<iostream>

#include<vector>

//use std namespace

using namespace std;

//define main() function

int main()

{

//create vector a

vector<int> a;

//create vector a

vector<int> b;

//create vector a

vector<int> c;

//declare required integer variables

int n1,n2;

int inp;

int count;

//prompt the user to enter the number of elements

cout << "Enter number of elements in first vector:" << endl;

//scan for the value

cin >> n1;

//prompt the user to enter the number

cout << "Enter numbers:" ;

//iterate a for loop

for (int i = 0; i<n1; i++)

{

//scan for the values

cin >> inp;

//push in to the vector

a.push_back(inp);

}

//prompt the user to enter the number of elements

cout << "Enter number of elements in second vector:" << endl;

//scan for the value

cin >> n2;

//prompt the user to enter the number

cout << "Enter numbers:";

//iterate a for loop

for (int i = 0; i<n2; i++)

{

//scan for the values

cin >> inp;

//push in to the vector

b.push_back(inp);

}

//iterate a for loop

for(int i = 0; i < a.size(); i++)

{

//multiply the elements

inp = a[i] * b[i];

//push to the stack c

c.push_back(inp);

}

//iterate a for to get the numbers

for(int i = 0; i < a.size(); i++)

{

//print the values in stack c

cout<<c[i]<<" ";

}

//return 0

return 0;

}

Explanation:

The above program creates two STL vectors of integer values and multiplies the corresponding elements of the vectors and save the resulted elements to a new vector...

Blurred answer
Students have asked these similar questions
the nagle algorithm, built into most tcp implementations, requires the sender to hold a partial segment's worth of data (even if pushed) until either a full segment accumulates or the most recent outstanding ack arrives. (a) suppose the letters abcdefghi are sent, one per second, over a tcp connection with an rtt of 4.1 seconds. draw a timeline indicating when each packet is sent and what it contains.
Just need some assistance with number 3 please, in C#
How do we find the possible  final values of variable x in the following program.   Int x=0; sem  s1=1, s2 =0;   CO P(s2); P(s1); x=x*2; V(s1); // P(s1); x=x*x; V(s1); // P(s1); x=x+3; V(s2); V(s1); Oc

Chapter 1 Solutions

Data structures and algorithms in C++

Knowledge Booster
Background pattern image
Computer Science
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
SEE MORE QUESTIONS
Recommended textbooks for you
Text book image
Database System Concepts
Computer Science
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:McGraw-Hill Education
Text book image
Starting Out with Python (4th Edition)
Computer Science
ISBN:9780134444321
Author:Tony Gaddis
Publisher:PEARSON
Text book image
Digital Fundamentals (11th Edition)
Computer Science
ISBN:9780132737968
Author:Thomas L. Floyd
Publisher:PEARSON
Text book image
C How to Program (8th Edition)
Computer Science
ISBN:9780133976892
Author:Paul J. Deitel, Harvey Deitel
Publisher:PEARSON
Text book image
Database Systems: Design, Implementation, & Manag...
Computer Science
ISBN:9781337627900
Author:Carlos Coronel, Steven Morris
Publisher:Cengage Learning
Text book image
Programmable Logic Controllers
Computer Science
ISBN:9780073373843
Author:Frank D. Petruzella
Publisher:McGraw-Hill Education