Christ1m

[CODE] template <class T> class Stack // an abstract stack base class { public: Stack() {} virtual void pop() = 0; // all pure virtual T top() const = 0; virtual void push(const T& t) = 0; virtual unsigned int size() const = 0; }; [/CODE] [CODE] template <class T> …

I have this following code. It runs. Im trying to implement remove, sort, and find functions in to this program but I do not know how to. I need some ideas. Find - User inputs the song title. If it finds the song title, it will displays the given info …

The book Im using. Pg 108 - 124 Objects Abstraction, Data Structures and Design using C++ Author: Elliot Koffman and Paul Wolfgang I have a problem with this code. All of these errors are occurring in the Phone_Directory.cpp. It is in, getline, << , out. .......functions... I tried getting these …

Okay. This problem is from "Objects,Abstraction,Data Structures and Design using C++" by Elliot Koffman and Paul Wolf Gang pg127. #2 Implement an array- based program application that manages a collection of DVDs. The data for each DVD will consist of a title , a category, running time, year of release, …

The book Im using. Pg 108 - 124 Objects Abstraction, Data Structures and Design using C++ Author: Elliot Koffman and Paul Wolfgang I copied the example from the book, but the code is not working. I got a lot of errors in Phone_Directory.cpp. I dont know what to do [CODE] …

If I have 4 person. How do I create a function that can determine the oldest person below? Person p1("JAck","Spice","48); Person p2("Burn","Side",53); Person p3("Leppy","Doopy",20); Person p4("Jimmy", "Dean", 32); I need someone to help me explain how "for" loops work.

Create a Person class to represent a person's contact information. Your Person class must consist of the following: PRIVATE members: string firstName,lastName; birthDate //you get to choose the data type, but the type you choose must be able to maintain a // 1 day resolution PUBLIC members: 1. Default constructor …

Consider the following program segment: i := 0; s := 0; while i<N do begin s := s + (2*i)+1; i := i + 1; end; a.) What is the loop invariant, i.e., what assertion, if initially true at the top of the loop, will remain true when execution reaches …

All 4 parts to this question concern the assertion P = {x=2**K & N>K} and one of 4 different assignment statements. You are to supply the missing assertions Q1, Q2, Q3, and Q4. Note that Q1 and Q2 should be the weakest preconditions for P with respect to the given …

First write the method publi static lp append(lp head1, lp head2) It takes two lists and puts them together -- first the elements of head1, then the elements of head2. If head1 is empty, the answer is head2. Otherwise, use a recursive call to append head1.rest to head2. Now use …