Course Description :

This introduction to the fundamentals of data structures explores abstract concepts, considers how those concepts are useful in problem solving, explains how the abstractions can be made concrete by using a programming language, and shows how to use the C language for advanced programming and how to develop the advanced features of C++.

KEY TOPICS: Covers the C++ language, featuring a wealth of tested and debugged working programs in C and C++. Explains and analyzes algorithms — showing step- by-step solutions to real problems.

Course Objectives:

Upon successful completion of this course, students will have demonstrated the ability to:

* Understand operator Overloading, inline Code
* Familiarize oneself with STL Container Classes
* Realize the importance of C++ pointers.
* Creating Classes using dynamic memory
* Creating a List container, with or without iterators
* Implement a Stack with or without the STL stack class
* Implement a Queue with or without the STL queue class.
* Create Linked Lists and Doubly Linked Lists
* Create Binary Trees and Tree structures in general

Course Topics:

* Classes: creating using dynamic memory
* C++ STL classes: a general overview
* Inheritance and Polymorphism
* Recursive Thinking and Reasoning
* Stacks: As Arrays and Linked Lists
* Queues: As Arrays and Linked Lists
* Linked Lists
* Binary Trees