Object oriented data and processes

I need assistance so I can write an object-oriented design for a system that keeps tracks of CD and DVD collection. I need the classes, associated data, and operations for the classes. Also, the pseudocode for each of the classes.

Currency Conversion

• Consolidate all the sections of the Currency Conversion development documentation: requirements, design, and testing. This application—similar to simple, practical programs on many travel or financial Web sites—includes the following elements: • Complete requirements analysis • Design • Verification • Validation and test documentation The Currency Conversion application is a menu-driven program that allows users to select one of five international currency types, input the amount of a foreign currency, and then convert the foreign currency to dollars. The program displays the equivalent dollar amount and returns the user to the menu until he or she enters another conversion or ... click for more

Data structures C++ -- Quick sort Algorithm

Use the quicksort algorithm to sort vector v. During each pass, list all exchanges of a pair of elements in the lower and upper sublist. List the ordering of the elements after each pass. int arr[] = {790, 175, 284, 581, 374, 799, 852, 685, 486, 333}; int arrSize = sizeof(arr)/sizeof(int); vectorv(arr, arr+arrSize); Please include the full program and the .exe file if the question makes sense. thank you

Discrete structures in C++

Please include the code and the .exe file. Thank you For the Graph in figure 16-28(a), replicate the trace of Dijkstra’s algorithm to find the minimum path from vertex A to F. For each step, create the list of minInfo elements in the priority queue and indicate which element is removed from the queue. Please see Graph 16-28(a) below

Discrete Structures in C++

Please see attached problem and please include the code and .exe file. For the graph in figure 16-28(a) replicate the trace of Prim’s algorithm to create a minimum-spanning tree. For each step, create the list of minInfo elements in the priority queue and indicate which vertices and edges are in the current spanning tree, along with the accumulated total weight. Please see Graph 16-28(a) below.