CS 291
Introduction to Data Structures (c++)


Required Text:

	Deitel & Deitel, C++  How To Program, 3rd Edition,Prentice Hall, 2001


Course Outline:

1)	Review of Arrays and Functions
		One-dimensional
		Two-dimensional
		Passing to a function
		Recursion
			- examples: fibonocci sequence, computing factorials

2)	Pointers amd Strings
		Variable Declarations
		Pointer Operators
			address operator
			indirection operator
		Calling functions by reference
		Pointer Arithmetic
		Pointers and arrays
		Function pointers
		Character strings
		String functions
		Sequential File I/O
		
3)	Structures
		Declarations  - the key word struct
		Accessing Structure Members
			member operator
			structure pointer operator
		Implementations

4)	Simple Classes and Abstract Data Types
		Implementing a class in C++
		Public and Private class members
		Constructors and Destructors
		Examples and implementations
		
5)	Data Structurs
		Constructing the Stack Data structure
			Postfix notation
			Algorithm to evaluate a postfix expression
			Algorithm to convert from infix to postfix notation
		Constructing the Linked-List Data Structure
		Constructing a Queue Data Structure
		Constructing a Binary Tree
		Examples and implementations 

Bibliography:

1.)  Oualline, S., Pratical C++ Programming, O’Reilly & Associates, 1995.

2.)  Kernighan, B. W. and Ritchie, D. M., The C Programming Language, 2nd Ed., Prentice 
	Hall, 1988.

3.)  Weiss, M. A., Data Structures & Algorithm Analysis in C++, 2nd Ed., Addison Wesley, 
	1999.

4.)  Irvine, K. R.,  C++ and Object-Oriented Programming, Prentice Hall, 1997.