Generate an object-oriented design for a system that keeps tracks of your CD and DVD collection.

Generate an object-oriented design for a system that keeps tracks of your CD and DVD collection. • Identify each of the classes, associated data, and operations for the classes. • Generate the pseudocode for each of the classes. • Draw a GUI that will create the objects and provide access to each object’s processing methods ...continues

This question deals with pseudo code for an action that is performed commonly. Also the objects used in this object oriented approach are to be identified.

Identify one task you perform regularly, such as cooking, mowing the lawn, or driving a car • Write a short, structured design (pseudocode only) that accomplishes this task. • Think about this task in an object-oriented way, and identify the objects involved in the task.

Algorithm - Four prospectors with only one lantern must walk through a mineshaft.

Four prospectors with only one lantern must walk through a mineshaft. At most, two prospectors can travel together and any prospector in the shaft must be with the lantern. The prospectors, named Andrews, Blake, Johnson, and Kelly, can walk through the shaft in one minute, two minutes, four minutes, and eight minutes, respecti ...continues

IPO chart using pseudocode

A contractor needs a program that calculates and displays the volume of a rectangular pool of constant depth. Complete an IPO chart for this problem. Use pseudocode in the Processing column.

Psuedocoding and Tracing

Attached is a problem that involves Psuedocoding and Tracing that I need help with. Tracing • Perform a trace process on the program below showing your work. Document the trace in a grid. Be thorough in your answers. Pseudocode • Transform the Java code below into pseudo-code. Be thorough in your answers. Comments ...continues

C++ programs

Please see the attached file.

How can I increase the efficiency in this algorithm?

I have an algorithm called MinDistance that determines the distance between the two closest elements in an array. I need to make it more efficient. Here is the algorithm, written in pseudocode: MinDistance(A[0...n-1] dmin <-- infinity for i <--- 0 to n - 1 do for j <--- 0 to n - 1 do if i does not equal j a ...continues

Java - Reading from an Input file - Sparse Matrices - Transpose

My assignment is to test which algorithm is more efficient in transposing a matrix: a Naive or Fast Sparse algorithm. I need to construct functions for reach algorithm that call from an input file, which is a sparse Matrix. A text file called M5x5.mat looks like this. 5 5 11 0 3 297 1 0 230 1 4 291 2 0 390 ...continues

C++ Array

Please see the attached file.

Programming - Cat.java Class File

I need some help with writing this program. In the attached document are all the instructions also a sample of the program to be edited. Hopefully that helps, I'm just at the point to where I'm not understanding. Thanks in advance.