Скачать или смотреть CISS 350 CISS350 CISS/350 Course All Weeks 1 2 3 4 5 6 7 Tutorials ExTutorials.Com

CISS 350 CISS350 CISS/350 - All Weeks - Week 1 - Week 2 - Week 3 - Week 4 - Week 5 - Week 6 - Week 7 - An Original And A++ Work - Using Visual Studio 2010 C++
http://extutorials.com/index.php?rout...

Week 1: Data Design and Implementation

Write, run, and test a C++ program to simulate the operation of a grocery store checkout system. Your program should first build a data structure to contain information on all the products available in the store. Then the program should print the cash register receipt for each customer...

Week 2: Sorted and Unsorted Lists

Your assignment is to write a program for a computer dating service. Each client gives you his or her name, phone number, and a list of interests. It is your job to maintain lists of men and women using the service and to match up the compatible couples. You will find more details about the assignment, including the inputs, outputs, and deliverables in the course environment...

Week 3: Stacks & Queues

The local medical clinic has decided to automate its scheduling services. You have been assigned to design the initial version of the schedules. The basic functions that the clinic has in mind are doctor check-in and check-out and patient check-in and check-out.

A doctor checks in by telling the scheduler his or her name, an examination room number, and a medical specialty code. Each doctor has a favorite room. The scheduler checks to see whether the room is free. If so, it assigns this doctor to the room; if not, it rejects the request with a message, and the doctor can try again to check in. When a doctor checks out, the examination room is freed...

Week 4: Lists Plus

List plus Using Visual Studio C++ 2010 Of the three variations of linked lists (circular, with header and trailer nodes, and doubly linked),
which would be most appropriate for each of the following applications and why?...

Week 5: Programming with Recursion

A toy that many children play with is a base with three pegs and five disks of different diameters. The disks begin on one peg, with the largest disk on the bottom and the other four disks added on in order of size. The idea is to move the disks from the peg they are on to another peg by moving only one disk at a time and without ever putting a larger disk on top of a smaller one. This child's toy is actually an example of a classic mathematical puzzle called the Towers of Hanoi problem...

Week 6: Binary Search Tree

Your assignment is to write a program for a police department that has collected a database of information on various suspects for a given crime. (Luckily for you, the department is only investigating one crime at a time.) Each suspect has a set of attributes, such as shifty eyes, a limp, or a parrot on his shoulder. The maximum number of such attributes for any suspect is 6. Your program accepts commands to manipulate the database in order to narrow down the list of suspects, in the hope of pinpointing the villain...

Week 7: Priority Queues, Heaps, Graphs, and Sets

Your assignment is to write and compare two implementations of a priority queue whose highest priority element is the one with the smallest key value. The elements have the following declarations:

The first implementation uses a minimum heap. You need to modify the heap operations to keep the minimum, rather than maximum, element in the root. The comparison function should compare key fields.
The second implementation uses a linear linked list, whose elements are ordered by key value...