logo Use CA10RAM to get 10%* Discount.
Order Nowlogo
(5/5)

Implement the function int mainMenu()

INSTRUCTIONS TO CANDIDATES
ANSWER ALL QUESTIONS

Task One

Implement the function int mainMenu().

This function is called from the main function. It should print out the main menu of the program, it looks like figure 1 below.

Figure 1

It then accepts the user’s choice, which is an integer from 1 to 6. Depending on the choice of the user, it should call the appropriate function(s) and pass any values it needs to it. The following choices should run the following functions and do the following actions before and after running the functions:

 

Choice Function To Call Before Calling It (do this in After Calling It (do

mainMenu) this in mainMenu)

1 int isPrime(int number) Ask the user to input a If the number was

number and pass it to the prime, print “X is

function as an argument. prime”, if the number

was not prime

(composite), print “X

is not prime”.

Replace X with the

number when you

print it.

e.g., “5 is prime”.

2 void primesInRange(int

rangeEnd) Ask the user to input the

range to print primes until Do nothing

and pass it to the function as

an argument.

3 int sieve(int numbers[], int

arraySize) Ask the user to input the

range to generate and print Call the

primesInRangeSieve

primes until and create an function and pass the

array that has the size of the prepared array to it.

range, then pass the array and

its size to the function as

arguments.

3 int primesInRangeSieve (int numbers[], int arraySize) Call the sieve function to prepare the numbers array, then pass it to this function

along with its size so that the Do nothing

function can print the prime

numbers from it.

4 void flipImageVertically(int rows, int columns, int image[rows][columns]) Extract the number of rows and the number of columns of the image using the helper

functions extractImageRows Call the drawImageFromFile function to draw and

display the image

and extractImageColumns, after this function

then create an array with the flipped it.

extracted dimensions, use

readImageFromFile to read

the image from the file and

fill it in the array then pass

the filled array to this

function along with the

dimensions.

 After each choice from 1 to 5, mainMenu should return 0 to the main function. If the user chooses 6 (Exit) the function should return 1 to the main function so it could exit. Any other choice should print “Invalid Choice” and return 0. Check the implementation for the main function if you need to.

 

Task Two

Implement the function int isPrime(int number).

This function checks whether an integer is a prime number or not. A prime number is defined as: a number that is greater than 1 and has only 2 divisors: 1 and itself. For example, 2, 5, 7, 11, 73, and 97 are all prime numbers. The opposite of a prime number is a composite number, which is a number that can be formed by multiplying a prime number with another number (e.g., 28 is the product of 7 and 4 or 2 and 14).

The function accepts one integer as a parameter, the number that will be checked for primality. It returns 1 if the number is prime, or 0 if the number is not composite.

Please note that this function does not print anything. All printing should be done in the

mainMenu function as explained in Task 1.

Task Three

Implement the function void primesInRange(int rangeEnd).

This function accepts one parameter rangeEnd and prints all the prime numbers from 1 up until rangeEnd. It should use the isPrime function to determine whether a number is prime or not.

For example, if rangeEnd is 35, the function will print all the prime numbers less than or equal to 35:

Figure 3

The function does not return anything. It prints the numbers directly, separated by commas.

 

(5/5)
Attachments:

Related Questions

. Introgramming & Unix Fall 2018, CRN 44882, Oakland University Homework Assignment 6 - Using Arrays and Functions in C

DescriptionIn this final assignment, the students will demonstrate their ability to apply two ma

. The standard path finding involves finding the (shortest) path from an origin to a destination, typically on a map. This is an

Path finding involves finding a path from A to B. Typically we want the path to have certain properties,such as being the shortest or to avoid going t

. Develop a program to emulate a purchase transaction at a retail store. This program will have two classes, a LineItem class and a Transaction class. The LineItem class will represent an individual

Develop a program to emulate a purchase transaction at a retail store. Thisprogram will have two classes, a LineItem class and a Transaction class. Th

. SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 1 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

. Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of Sea Ports. Here are the classes and their instance variables we wish to define:

1 Project 2 Introduction - the SeaPort Project series For this set of projects for the course, we wish to simulate some of the aspects of a number of

Ask This Question To Be Solved By Our ExpertsGet A+ Grade Solution Guaranteed

expert
Um e HaniScience

693 Answers

Hire Me
expert
Muhammad Ali HaiderFinance

955 Answers

Hire Me
expert
Husnain SaeedComputer science

680 Answers

Hire Me
expert
Atharva PatilComputer science

652 Answers

Hire Me
June
January
February
March
April
May
June
July
August
September
October
November
December
2025
1950
1951
1952
1953
1954
1955
1956
1957
1958
1959
1960
1961
1962
1963
1964
1965
1966
1967
1968
1969
1970
1971
1972
1973
1974
1975
1976
1977
1978
1979
1980
1981
1982
1983
1984
1985
1986
1987
1988
1989
1990
1991
1992
1993
1994
1995
1996
1997
1998
1999
2000
2001
2002
2003
2004
2005
2006
2007
2008
2009
2010
2011
2012
2013
2014
2015
2016
2017
2018
2019
2020
2021
2022
2023
2024
2025
2026
2027
2028
2029
2030
2031
2032
2033
2034
2035
2036
2037
2038
2039
2040
2041
2042
2043
2044
2045
2046
2047
2048
2049
2050
SunMonTueWedThuFriSat
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
1
2
3
4
5
00:00
00:30
01:00
01:30
02:00
02:30
03:00
03:30
04:00
04:30
05:00
05:30
06:00
06:30
07:00
07:30
08:00
08:30
09:00
09:30
10:00
10:30
11:00
11:30
12:00
12:30
13:00
13:30
14:00
14:30
15:00
15:30
16:00
16:30
17:00
17:30
18:00
18:30
19:00
19:30
20:00
20:30
21:00
21:30
22:00
22:30
23:00
23:30