Videos
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++ (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)
- 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
C++ Programming: From Problem Analysis to Program...Computer ScienceISBN:9781337102087Author:D. S. MalikPublisher:Cengage Learning
EBK JAVA PROGRAMMINGComputer ScienceISBN:9781337671385Author:FARRELLPublisher:CENGAGE LEARNING - CONSIGNMENT
Programming Logic & Design ComprehensiveComputer ScienceISBN:9781337669405Author:FARRELLPublisher:Cengage
Programming with Microsoft Visual Basic 2017Computer ScienceISBN:9781337102124Author:Diane ZakPublisher:Cengage Learning
Microsoft Visual C#Computer ScienceISBN:9781337102100Author:Joyce, Farrell.Publisher:Cengage Learning,
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr