Slides.Progs, Teofilo F. Gonzalez UCSB

This material may only be used for UCSB CMPSC 60 Summer 2009 and you may print the slides for that purpose.

Arrays (outside).
Output for Arrays (outside).
Functions.
Output for Functions.
Pointers (Seg fault).
Output for Pointers (Seg fault).
More Pointers (memory leak).
Output for More Pointers (memory leak).
More Pointers (unions and increase).
Output for More Pointers (unions and increase).
Single List (create and print).
Output for Single List.
Parameter passing.
Parameter passing output.

C++ Math functions.
Input/output.
boolean and <<
Input/output.
new and delete <<
Input/output.
List in C++ ( linked list (main) )
List in C++ (linked list .h file)
List in C++ (Input/output)

Wrong Copy Constructor 7/21/2009 output 7/21/2009
Wrong Copy Constructor using pointers 7/21/2009 output 7/21/2009
Correct Copy Constructor 7/21/2009 output 7/21/2009
Correct = Operator 7/21/2009 output 7/21/2009
Overloading << and >> 7/23/2209 output 7/23/2209
Overloading + 7/23/2209 output 7/23/2209
Inheritance Constructors 1 Output Inheritance Constructors 1
Inheritance Constructors 2
Output Inheritance Constructors 2
Templates 1 (int and double)
Templates 1
Templates 2 (pointers to int (one))
Templates 2
Templates 3 (pointers to int (array))
Templates 3
Templates 4 (pointers to int stacks)
Templates 4
Templates 5 (pointers to int stack (var size))
Templates 5

STL CODE

Stack STL
Output Stack STL
Queue STL
Output Queue STL
List STL
Output List STL
Vector STL
Output Vector STL
Map STL
Output Map STL

Shell Script 1
Output Shell Script 1
Shell Script 2
Output Shell Script 2
Shell Script 3
Output Shell Script 3
Shell Script 4
Output Shell Script 4
Shell Script 5
Output Shell Script 5
Shell Script 6
Output Shell Script 6
Shell Script 7
Output Shell Script 7
Shell Script 8
Output Shell Script 8
Shell Script 9
Output Shell Script 9
Shell Script 10
Output Shell Script 10
Shell Script 11
Output Shell Script 11
Shell Script 12
Output Shell Script 12
Shell Script 13
Output Shell Script 13
Shell Script shel

Binary Search Trees

Original code for link lists with first and last, and without header nodes.
Similar to the previous one except that the names of the lists are allocated dynamically rather than statically.
Same as original one but now we have an appropriate destructor and a copy constructor.
Same a previous one but now we have overloaded the assignment operator = (works for one =, but not two or more (s = t = m).
Same as before but we overloaded << and >>.
Overloading + and using list iterator.
Overloading + and using list iterator and s = t = m works too!

Ads
Population
clock

Total number of visitors to this page, since 6/27/2001, is