CIS 26 Assignment CIS 27 Fall 2020 – Homework #6 – Page 1 of 6 Turn In: 1. Exercise #1 – Due on Tuesday, December 1, 2020 by 11:00pm Email Submission a) For the assignment, a package must be generated...

1 answer below »
The Yourname portion can stay that way, I will change it to my name later.


CIS 26 Assignment CIS 27 Fall 2020 – Homework #6 – Page 1 of 6 Turn In: 1. Exercise #1 – Due on Tuesday, December 1, 2020 by 11:00pm Email Submission a) For the assignment, a package must be generated to include the following items: - Copy of your source file (C program)—your source file MUST BE NAMED as cis27Fall2020YourNameHw6.c - Copy of output (copy and paste to the end of your program as PROGRAM_OUTPUT comment block) - Copy of Logic_Code_Output_Issues (as a separate comment block) after the “PROGRAM_OUTPUT” block. b) Emailing each package as follows, - One email message for each exercise. - The SUBJECT line of the message should have the following line: cis27Fall2020YourNameHw6.c - Attaching the source file that was created in part a). 2. Q.E.D. ***************************************************************************** CIS 27 Fall 2020 – Homework #6 – Page 2 of 6 1. Coding Assignment Exercise #1 1. Write a menu program and your program as cis27Fall2020YourNameHW6Ex1.c to have the display below, CIS 27 – Data Structures Laney College YourName Information – Assignment: HW #5 Exercise #1 Implemented by: YourName Submitted Date: 2020/12/01 Current Number of LEB available: ? Allowed Number of LEB Used: ? Remaining Number of LEB: ? ***************************** * MENU – Radix Sort * * 1. Sorting Integer Serie * * 2. Soring Fraction Series * * 3. Quit * ***************************** Select the option (1 through 3): 1 PART A Let us consider Option 1 first. 1. You are going to work with a series of INTEGERS, which are to be sorted using the Radix sort as presented in lecture/class. In this sort, the major tasks are from the operations of distribution to and retrieval from the queues.  For numbers that have only 1 digit, there is only one pass needed.  For numbers that have only 2 digits, there are only two passes needed.  For numbers that have only d digit, there are only d passes needed, etc. This radix sort is fast but it may require large amount of storage for large data set. It is a linear algorithm and does not compare data values with each other. 2. Write a sub-menu to call the function sortRadixIntYourName() to test with several series of integers provided by the user while performing the sorting. The function sortRadixIntYourName() will also display the result of the 10 queues after each pass. The display can be shown in either text form of graphic blocks. The layout of the program output is shown below. CIS 27 Fall 2020 – Homework #6 – Page 3 of 6 ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 7 Wrong Option! ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 2 Inappropriate Option! ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 1 // Appropriate details and display ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 3 // Appropriate details and display ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 2 // Appropriate details and display ************************************* CIS 27 Fall 2020 – Homework #6 – Page 4 of 6 * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 3 // Appropriate details and display ************************************* * MENU – Radix Sort Integer * * 1. Creating/Updating series * * 2. Calling sortRadixIntYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ************************************* Select the option (1 through 4): 4 Returning to Main Menu ***************************** * MENU – Radix Sort * * 1. Sorting Integer Serie * * 2. Soring Fraction Series * * 3. Quit * ***************************** Select the option (1 through 3): 2 You are asked to continue with Part B below. Part B 1. You are to devise an approach/algorithm to sort a series of Fraction objects with a sub menu below. 2. The sub-menu will call the function sortRadixFractionYourName() to test with several series of Fraction objects provided by the user. The function sortRadixFractionYourName() will also display the result of the 10 queues after each pass while performing the sorting. ****************************************** * MENU – Radix Sort Fraction * * 1. Creating/Updating series * * 2. Calling sortRadixFractionYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ****************************************** Select the option (1 through 4): 7 Wrong Option! ****************************************** * MENU – Radix Sort Fraction * * 1. Creating/Updating series * CIS 27 Fall 2020 – Homework #6 – Page 5 of 6 * 2. Calling sortRadixFractionYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ****************************************** Select the option (1 through 4): 2 Inappropriate Option! ****************************************** * MENU – Radix Sort Fraction * * 1. Creating/Updating series * * 2. Calling sortRadixFractionYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ****************************************** Select the option (1 through 4): 1 // Appropriate details and display ****************************************** * MENU – Radix Sort Fraction * * 1. Creating/Updating series * * 2. Calling sortRadixFractionYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ****************************************** Select the option (1 through 4): 3 // Appropriate details and display ****************************************** * MENU – Radix Sort Fraction * * 1. Creating/Updating series * * 2. Calling sortRadixFractionYourName() * * 3. Displaying series * * 4. Return to Previous Main Menu * ****************************************** Select the option (1 through 4): 2 // Appropriate details and display
Answered Same DayDec 01, 2021CIS 27

Answer To: CIS 26 Assignment CIS 27 Fall 2020 – Homework #6 – Page 1 of 6 Turn In: 1. Exercise #1 – Due on...

Ayush answered on Dec 08 2021
144 Votes
Answer:
/* C++ implementation to convert
infix expression to postfix*/
// Note that here we us
e std::stack
// for Stack operations
#include
using namespace std;
//Function to return precedence of operators
int prec(char c)
{
if(c == '^')
return 3;
else if(c == '*' || c == '/')
return 2;
else if(c == '+' || c == '-')
return 1;
else
return -1;
}
// The main function to convert infix expression
//to postfix expression
void infixToPostfix(string s)
{
std::stack st;
...
SOLUTION.PDF

Answer To This Question Is Available To Download

Related Questions & Answers

More Questions »

Submit New Assignment

Copy and Paste Your Assignment Here