
Write a function named firstLast2 that takes as input an array of integers and an integer that specifies how many entries are in the array. The function should return true if the array starts or ends with the digit 2. Otherwise it should return false. Test your function with arrays of different length and with the digit 2 at the beginning of the array, end of the array, middle of the array, and missing from the array.

Definition of function “firstLast2()”
Program Plan for “firstLast2()” function:
- The function “firstLast2()” should declared before it defined in a program.
- Define the function with its argument.
- One argument is to get array values and another one is to define the size of the array.
- Using “if…else” condition, check the array beginning and end value “2” or not.
- If the condition is true, return “true” to calling function.
- Otherwise return “false” to calling function.
Program Plan for testing code:
- Include the appropriate headers into program.
- Define the “firstLast2()” function.
- Define the “main()” method.
- Initialize the arrays with a value “2” at starting, ending, and middle position of arrays.
- Call the “firstLast2()” function with resultant value using “if…else” condition.
- Print the appropriate statement on screen.
Program Description:
The following C++ program to define the “firstLast2()” function with a testing method.
Explanation of Solution
Function definition:
//Function definition with bool type
bool firstLast2(int arr[],int size)
{
//Condition
if(arr[0]==2||arr[size-1]==2)
{
/*Return true to calling Function*/
return true;
}
//Else statement
else
{
/*Return false to calling Function*/
return false;
}
}
Testing code:
//Include the appropriate headers
#include <iostream>
using namespace std;
//Function definition with bool type
bool firstLast2(int arr[],int size)
{
//Condition
if(arr[0]==2||arr[size-1]==2)
{
/*Return true to calling Function*/
return true;
}
//Else statement
else
{
/*Return false to calling Function*/
return false;
}
}
//Main method
int main()
{
/*Initialization of arrays with different length*/
int a1[5]={2,5,6,5,1};
int a2[4]={5,6,1,2};
int a3[7]={6,4,5,2,5,1,1};
int a4[3]={6,5,1};
/*Condition to check first array*/
if(firstLast2(a1, 5))
{
/*Print statement for true block*/
cout<<"The array contains a value 2 either at beginning and end of the array\n";
}
//Else statement
else{
/*Print statement for false block*/
cout<<"The array does not contains a value 2 either at beginning and end of the array\n";
}
/*Condition to check second array*/
if(firstLast2(a2, 4))
{
/*Print statement for true block*/
cout<<"The array contains a value 2 either at beginning and end of the array\n";
}
//Else statement
else{
/*Print statement for false block*/
cout<<"The array does not contains a value 2 either at beginning and end of the array\n";
}
/*Condition to check third array*/
if(firstLast2(a3, 7))
{
/*Print statement for true block*/
cout<<"The array contains a value 2 either at beginning and end of the array\n";
}
//Else statement
else{
/*Print statement for false block*/
cout<<"The array does not contains a value 2 either at beginning and end of the array\n";
}
/*Condition to check fourth array*/
if(firstLast2(a4, 3))
{
/*Print statement for true block*/
cout<<"The array contains a value 2 either at beginning and end of the array\n";
}
//Else statement
else{
/*Print statement for false block*/
cout<<"The array does not contains a value 2 either at beginning and end of the array\n";
}
}
Output:
The array contains a value 2 either at beginning and end of the array
The array contains a value 2 either at beginning and end of the array
The array does not contains a value 2 either at beginning and end of the array
The array does not contains a value 2 either at beginning and end of the array
Want to see more full solutions like this?
Chapter 7 Solutions
Problem Solving with C++ plus MyProgrammingLab with Pearson eText-- Access Card Package (9th Edition)
Additional Engineering Textbook Solutions
Degarmo's Materials And Processes In Manufacturing
Database Concepts (8th Edition)
Electric Circuits. (11th Edition)
Starting Out with C++ from Control Structures to Objects (9th Edition)
Thinking Like an Engineer: An Active Learning Approach (4th Edition)
Java: An Introduction to Problem Solving and Programming (8th Edition)
- As a database administrator of a large manufacturing organization, you are in charge of their website database that handles suppliers, parts, catalog, customers, and payments of delivered items. The following relations are part of the large database: Supplier(SID, Sname, Saddress, Stelephone)Customer(CID, Cname, Caddress, Ctelephone)Part(PID, Pname, Pmodel, Pcolor)Catalog(SID, PID, Price) (The Catalog relation lists the prices charged for parts by Suppliers). Because the application is web-based and the database is accessed by many users, you want to increase the concurrency usage without compromising the data quality. For each of the following transactions, state the minimum SQL isolation level you would use in order to avoid any conflict problems in them. Please explain your choice. A transaction that adds a new part to a supplier’s catalog. A transaction that increases the price that a supplier charges for a part. A transaction that determines the total number of items for a given…arrow_forwardPlease no AI! Or if you do use AI, Check the work please! Thank you!arrow_forward(Dynamic Programming.) Recall the problem presented in Assign- ment 3 where given a list L of n ordered integers you're tasked with removing m of them such that the distance between the closest two remaining integers is maxi- mized. See Assignment 1 for further clarification and examples. As it turns out there is no (known) greedy algorithm to solve this problem. However, there is a dynamic programming solution. Devise a dynamic programming solution which determines the maximum distance between the closest two points after removing m numbers. Note, it doesn't need to return the resulting list itself. Hint 1: Your sub-problems should be of the form S(i, j), where S(i, j) returns the maximum distance of the closest two numbers when only considering removing j of the first i numbers in L. As an example if L [3, 4, 6, 8, 9, 12, 13, 15], then S(4, 1) = 2, since the closest two values of L' = [3,4,6,8] are 6 and 8 after removing 4 (note, 8-6 = = 2). = Hint 2: For the sub-problem S(i, j),…arrow_forward
- (Dynamic Programming.) A group of friends is visiting a number of attractions located along a highway, starting at kilometre 0, placed at distances ɑ1 < A2 < ···arrow_forward(Greedy Algorithms) Describe an efficient algorithm that, given a set {x1, x2, . . ., xn} of points on the real line, determines the smallest set of unit-length closed intervals that contains all of the given points. Argue that your algorithm is correct.arrow_forwardWhat does the value of the top variable indicate in this ArrayStack implementation? What will happen if we call pop on this stack? What value will be returned, and what changes will occur in the array and the top variable? 3. If we push the value "echo" onto the stack, where will it be stored in the array, and what will be the new value of top? 4. Explain why index 0 contains the string "alpha" even though top is currently 3. 5. What would the state of the stack look like (values in the array and value of top) after two consecutive pop 0 operations?arrow_forward
- Please solve and show all work. Suppose there are four routers between a source and a destination hosts. Ignoring fragmentation, an IP datagram sent from source to destination will travel over how many interfaces? How many forwarding tables will be indexed to move the datagram from the source to the destination?arrow_forwardPlease solve and show all work. When a large datagram is fragmented into multiple smaller datagrams, where are these smaller datagrams reassembled into a single large datagram?arrow_forwardPlease solve and show all steps. True or false? Consider congestion control in TCP. When the timer expires at the sender, the value of ssthresh is set to one-half of the last congestion window.arrow_forward
- Please solve and show all work. What are the purposes of the SNMP GetRequest and SetRequest messages?arrow_forwardPlease solve and show all steps. Three types of switching fabrics are discussed in our course. List and briefly describe each type. Which, if any, can send multiple packets across the fabric in parallel?arrow_forwardPlease solve and show steps. List the four broad classes of services that a transport protocol can provide. For each of the service classes, indicate if either UDP or TCP (or both) provides such a service.arrow_forward
- C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage LearningEBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENTProgramming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
- Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage LearningMicrosoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr




