
Explanation of Solution
Pseudo code:
//define a function reverse()
Procedure reverse()
//declare required variables
INT a[20],b[20],n.
//prompt the user to enter the number of elements
PRINT Enter the no: of elements:
//get the number of elements
GET n
//iterate a FOR loop
FOR i=0 to i<n
//prompt the use to enter the elements
PRINT Enter the elements
//get the values
GET a[i]
//iterate a FOR loop
FOR i=0 to i<n
//reverse the element
b[n-1-i]=a[i]
//iterate a FOR loop
FOR i=0 to i<n
//prompt the reversed elements
PRINT b[i]
Explanation:
The above pseudo code is used to create a function that takes an array of integers and reverse its order. In the procedure,
- Declare the procedure “reverse()”.
- Declare the variables and arrays.
- Print the user to enter the number of elements.
- Get the number of elements.
- Iterate a “for” loop up to “i<n”.
- Print to the user to enter the elements.
- Get the values to “a[i]”.
- Iterate a “for” loop up to “i<n”.
- Reverse the elements.
- Iterate a “for” loop up to “i<n”.
- Print the elements.
C++ function:
void reverse()
{
//declare the required variables
int a[20],b[20],n;
//prompt the user to enter the number of elements
cout<<"Enter the no: of elements:";
//scan for the value
cin>>n;
//iterate a for loop
for(int i=0;i<n;i++)
{
//prompt the user to enter the elements
cout<<"Enter the"<<i<<" element:";
//scan for the values
cin>>a[i];
}
//iterate a for loop
for(int i=0;i<n;i++)
{
//Reversing the elements
b[n-1-i]=a[i];
}
//iterate a for loop
for(int i=0;i<n;i++)
{
//Display of reversed elements
cout<<b[i]<<"\n";
}
}
Explanation:
The above program code is used to create a function that takes an array of integers and reverse its order. In the procedure,
- Declare the function “reverse()”.
- Declare the variables and arrays.
- Print the user to enter the number of elements.
- Get the number of elements.
- Iterate a “for” loop up to “i<n”.
- Print to the user to enter the elements.
- Get the values to “a[i]”...
Want to see the full answer?
Check out a sample textbook solution
Chapter 1 Solutions
Data structures and algorithms in C++
- Don't use chatgpt or any other AIarrow_forwardGiven a relation schema R = (A, B, C, D, E,G) with a set of functional dependencies F {ABCD BC → DE B→ D D→ A}. (a) Show that R is not in BCNF using the functional dependency A → BCD. (b) Show that AG is a superkey for R (c) Compute a canonical cover Fc for the set of functional dependencies F. Show your work. (d) Give a 3NF decomposition of R based on the canonical cover found in (c). Show your work. (e) Give a BCNF decomposition of R using F. Show your work.arrow_forwardThe following entity-relationship (ER) diagram models a database that helps car deal- ers maintain records of customers and cars in their inventory. Construct a relational database schema from the ER diagram. Your set of schemas should include primary-key and foreign-key constraints and you should ensure there are no redundant schemas. has_model model modelID name vehicle has_vehicle VIN dealer_ID brand name has_available_option has_option has_dealer options options_ID specification dealer dealer ID name customer_ID owned_by customer customer ID namearrow_forward
- A relation schema R = (A, B, C, D, E) with a set of functional dependencies F= {D A CAB} is decomposed into R₁ = (A, B, C) and R2 = (C, D, E). (a) Is this a lossless-join decomposition? Why or why not? (b) Is the decomposition dependency preserving? Why or why not?arrow_forwardNo chatgpt pleasearrow_forwardPlease help draw alu diagraarrow_forward
- 1. Level the resources (R) for the following network. Show exactly which activity is being moved at each cycle and how many days it is being moved. Show all cycles required to utilize the free float and the back float. B H 3 3 L 2 0-0-0 A C F G K N P Q T 0 3 2 2 1 2-2-2 7R 8R 4R 6R 4R 2R 5R 4R D 1 2R 2 M 000 4R 2 4R 1 2 3 4 B5 B BE B 5 5 7 D 2003 C NO C MBSCM В H 5 2 F 7 7 8 SH2F80 5 Н Н 6 7 7L3G4+ 6H2G4 J 4 4 14 8 L K 00 36 9 10 11 12 13 14 15 P 2 Z+ N N 4 4 Z t 2334 4 Σ + M M 4 +arrow_forward2. Perform resource allocation for the following project. Resource limits are 6 labors and 2 helpers. Legend: Activity Dur Resources G H 2 3 2L 1H 2L OH A 1 3L 1H + B D F J K 3 4 6 2 4 4L 2H 3L OH 4L 1H 2L 2H 4L 2H C E 2 2 I 1 2L 1H 3L 1H 5L 1Harrow_forwardNeed Java method please. Thank you.arrow_forward
- Need Java method please. Thank you.arrow_forward3. Write two nested loops to generate the following output. (Note: There is one space between each number, and any extra line shown is intentional.) 12 10 8 6 18 15 12 24 20 30 2 3 3 6 48 12 5 10 15 20 6 12 18 24 30arrow_forwardWrite in verilog coding languagearrow_forward
Database System ConceptsComputer ScienceISBN:9780078022159Author:Abraham Silberschatz Professor, Henry F. Korth, S. SudarshanPublisher:McGraw-Hill Education
Starting Out with Python (4th Edition)Computer ScienceISBN:9780134444321Author:Tony GaddisPublisher:PEARSON
Digital Fundamentals (11th Edition)Computer ScienceISBN:9780132737968Author:Thomas L. FloydPublisher:PEARSON
C How to Program (8th Edition)Computer ScienceISBN:9780133976892Author:Paul J. Deitel, Harvey DeitelPublisher:PEARSON
Database Systems: Design, Implementation, & Manag...Computer ScienceISBN:9781337627900Author:Carlos Coronel, Steven MorrisPublisher:Cengage Learning
Programmable Logic ControllersComputer ScienceISBN:9780073373843Author:Frank D. PetruzellaPublisher:McGraw-Hill Education





