Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

C + + homework: Do not use vector or printf. Only use Pointer, Array, Dynamic memory allocation, function, iostream. - Write a function that accepts

C++ homework: Do not use vector or printf. Only use Pointer, Array, Dynamic memory allocation, function, iostream.
- Write a function that accepts pointer array
- if the number is palindrome.
1) count how many even number there are within those palindrome numbers ?
- Print out those even digits , and their number of repetitions
-Print out the smallest even number with highest repetitions
2) Count how many odd numbers there are within those palindrome number ?
- Print out those odd digits and their numbers of repetitions
- Print out the smallest odd number with the hight repetitions ?
- Follow the exact example from the photo
-------
(2) QuitEnter an integer for option + ENTER: 1How many integers? 4Enter integer #1: -23932Enter integer #2: -294257Enter integer #3: 7524257Enter integer #4: 34643Calling displayPalindromeDigitInfoFL() with argu
Address of an array of integers: 0012F400
Size of the array: 4
While displayPalindromeDigitInfoFL() is runnin
There is/are 3 Palindrome number(s) of
-23932
7524257
34643
Only with Palindrome number(s)-
There is/are 3 unique even digit(s) of
2 seen 4 time(s)
4 seen 3 time(s)
6 seen 1 time(s)
Conditioned on largest occurrence -
CIS 25 Spring 2024- Homework #4- Page 10 of The smallest unique even digit isConditioned on largest occurrence -The smallest unique odd digit is3 seen 4 time(s) with2 time(s) in -239322 time(s) in 34643
image text in transcribed

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access with AI-Powered Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image

Step: 3

blur-text-image

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Students also viewed these Databases questions