Search results for 'DBM 381 Week 5 Learning Team Patient Record System Final presentation.'

INF 231 Week 5 Assignment Final Project Dollars to Coins CPP

The Final Project consists of building an executable monetary conversion program to be submitted by the final day of the course.

Focus of the Project For the program, you will write a utility that converts dollars to coins.
It is a simple program that must have the following:
• Multiple outputs to the screen
• At least one input
• The use of integers and strings
• Looking or repetition with Do..While, If..Else
• Must have some output text to show correct value of coins that would be converted from the dollars.
• Code must include comments explaining your reason for the code section or what the code is doing
• Code must compile
• Whole dollars only. If value is less than 1 or 0, the program should break or exit.

Turn in your source code (.cpp file) to your instructor with your filename including your first and last name and your compiled executable.

Towers of Hanoi C Program

Every budding computer scientist must grapple with certain classic problems, and the Towers of Hanoi is one of the most famous of these. Legend has it that in a temple in the Far East, priests are attempting to move a stack of disks from one peg to another.

The initial stack had 64 disks threaded onto one peg and arranged from bottom to top by decreasing size. The priests are attempting to move the stack from this peg to a second peg under the constraints that exactly one disk is moved at a time, and at no time may a larger disk be placed above a smaller disk. A third peg is available for temporarily holding the disks. Supposedly the world will end when the priests complete their task, so there is little incentive for us to facilitate their efforts.

Illustration of Towers of Hanoi
Let us assume that the priests are attempting to move the disks from peg 1 to peg 3. We wish to develop an algorithm that will print the precise sequence of disk-to-disk peg transfers.

If we were to approach this problem with conventional methods, we would rapidly find ourselves hopelessly knotted up in managing the disks. Instead, if we attack the problem with recursion in mind, it immediately becomes tractable. Moving n disks can be viewed in terms of moving only n – 1 disks (and hence the recursion) as follows:

Move n – 1 disks from peg 1 to peg 2, using peg 3 as a temporary holding area.
Move the last disk (the largest) from peg 1 to peg 3.
Move the n – 1 disks from peg 2 to peg 3, using peg 1 as a temporary holding area.
The process ends when the last task involves moving n = 1 disk, i.e., the base case. This is accomplished by trivially moving the disk without the need for a temporary holding area.

Write a program to solve the Towers of Hanoi problem. Use a recursive function with four parameters:

The number of disks to be moved
The peg on which these disks are initially threaded
The peg to which this stack of disks is to be moved
The peg to be used as a temporary holding area
Your program should print the precise instructions it will take to move the disks from the starting peg to the destination peg.
For example, to move a stack of three disks from peg 1 to peg 3, your program should print the following series of moves:

1 → 3 (This means move one disk from peg 1 to peg 3.)
1 → 2
3 → 2
1 → 3
2 → 1
2 → 3
1 → 3

Warehouse App Management System C Program

Part A Introduction
Your friend owns a frozen food warehouse which keeps wholesale food items in a gigantic freezer at -24C. Orders arrive daily from supermarkets and restaurants by email and are “picked” and placed on pallets before being shipped to the customer.
Your friend explains that the company is using off the shelf software to successfully manage the delivery side of the business. He explains that he needs a way to monitor and communicate the pallet picking jobs to the employees.

He is interested in having an app developed so that he can assign, manage and monitor the progress of the picking operations. His employees with smart phones will see what pallets (orders) are assigned to them and then update them when completed.

As a first step, he wishes to analyse data regarding pallet picking jobs and employee information to see how efficiently his company is performing. You are required to implement (using the C programming language) a prototype management system for the frozen food store. Make use of techniques covered in the course material: functions, file handling, dynamic memory allocation, data structures and sorting algorithms.

The Warehouse App Management System (WAMS) will have 2 important files: one file to record information about the employees and another file to record information about the pallets picked by the employees. The picker’s name and number are kept on file. Each pallet (job) will have an employee’s number, job number, customer name, date (and time) due and a date (and time) completed on file. You can use a dummy date and time for the date and time completed information. An employee can have many picking jobs assigned to him.

WAMS should provide functions to add employees and jobs, view employee information, sort employee information by name, view job information by date, sort job information by location, and view job information by employee.

Create a C program to implement the functions described below. Note that you may add your own utility-style functions in addition to each of the functions required. Note also that the program should be contained in one file only (i.e. no header files or multiple source files). Document your code by including comments throughout, for example, document functions with header comments. (Comments contained just before the function definition.) Your system should include a user manual containing instructions on how to run the WAMS as well as pseudo code or flowcharts for each function.
[70 marks]

Function 1: display_menu
When the application is started, use this function to print a list of options to the user using a numbered list. When the user selects an option, the system performs the required action, and returns to the menu waiting for the user to select another option. Include an option to exit the system.

Your main menu system might resemble the following:
1. Add an Employee
2. Add a job
3. View all employee information
4. Sort employee information by name
5. View job information by date and time due
6. Sort job information by customer
7. Sort job information by date and time due
8. Set job as completed
9. View job information by employee
10. Exit

Function 2: load_data
This function is automatically called when the program is started. It reads employee and job information from files. If the files do not exist, notify the user, create the files and display the main menu. Once a file is open, data is read into an array of structs by dynamically creating sufficient memory for each entry read from the file.

Define a struct to represent the information for an employee, containing the following fields:
• Number (int)
• Employee (char[])

Define a struct to represent the information for a job, containing the following fields:

• Employee number (int)
• Job Number (int)
• Customer (char([])
• Due date/time (appropriate object)
• Completed Time (appropriate object)

Function 3: add_new_employee
When the user selects the “add new employee” menu item, prompt them for the data for the new employee. Append the new employee to the array of current employees and notify the user that the new record has been added successfully.

Function 4: add_new_job
When the user selects the “add new job” menu item, prompt them for the new job information. Append the new job to the array of current jobs and notify the user that the new record has been added successfully.

Function 5: view_employee
When the user selects the “view employees” option, this function prints a list of all employee information on record. Make sure that the employee information is in a report with headers, not simply a list of raw information.

Function 6: sort_employee
Give the user the option to sort employees by name. Store the sorted information and notify the user of the name of the file. This function displays the employee, number, sorted by employee. Make a copy of the original array of employees to perform the sorting function. Make sure that the employee information is in a report with headers, not simply a list of raw information.

Function 7: view_job_information_time_due
When the user selects the “View job information by date and time due” menu option, this function prompts the user for a job number. It then displays the date/time (in a human-readable format), the employee number, the customer and the time completed. Make sure that the information is in a report with headers, not simply a list of raw information.

Function 8: sort_job_information_by_customer
When the user selects the “sort job information by customer” menu options, this function display all jobs sorted by customer. Store the sorted information and notify the user of the name of the file. Make a copy of the original array of jobs to perform the sorting function. Make sure that the job information is in a report with headers, not simply a list of raw information.

Function 9: set_job_completed
When the user selects the “Set job as completed” menu options, prompt them for the job number. Then find the corresponding job and set the date and time completed variable to the current date and time. Store the updated information and notify the user of the name of the file.

Function 10: view_job_information_by_employee
When the user selects the “view job information by employee” menu option, this function displays each employee and the job number of the jobs that they have in the database. Make sure that the information is in a report with headers, not simply a list of raw information.

Function 11: save_data
This function is called when the user chooses to exit the system. Open all data files and write out the information contained in the respective arrays.

Part B - Modification
What other set of requirements could be implemented as part of WAMS to improve its functionality toward a real-time app? Choose one requirement (e.g. Print a list of recently completed jobs or print the most urgent unfinished job.), provide a definition, flowchart or pseudo code, and a suitable implementation to be included as part of the overall system. Amend the employee and/or job structures accordingly, to handle any extra information.
[30 marks]