Pages

Thursday, 21 April 2016


Data Structures and Algorithms in C++


This is an introductory course about algorithms and data structures. C++ is the programming language used in the course. The basics of this language will be reviewed before more difficult concepts are explored. VTC author and expert Dima Kassab will examine many topics, including: data design and implementation, primitive data structures (such as arrays and records), classes, templates, sorted and unsorted array-based lists, linked lists, doubly linked lists, stacks, queues, and binary search trees. To begin learning today, simply click on the movie links.

Introduction

About This Course
About Algorithms and Data Structures
Resources

Installation

Installing C++ IDE
Installing C++ Compiler
Other Compilers
C++ Program Structure

C++ Language Basics

Algorithms vs. Programs
Variables pt. 1
Variables pt. 2
If Then Statement
If Then Else Statement
While Loop
For Loop
Functions
Library Functions

Data Design and Implementation

Abstraction and Information Hiding
Program Design
Data Structures
Records
Arrays
Class Specification pt. 1
Class Specification pt. 2
Class Implementation
Class Objects
Object Parameters

Lists

List Data Type
Unsorted List Specification pt. 1
Unsorted List Specification pt. 2
Unsorted List Implementation pt. 1
Unsorted List Implementation pt. 2
Unsorted List Implementation pt. 3
Unsorted List Example
Sorted List Specification
Sorted List Implementation pt. 1
Sorted List Implementation pt. 2
Sorted List Implementation pt. 3
Sorted List Example

Linked Lists

Unsorted Linked List Specification
Unsorted Linked List Implementation pt. 1
Unsorted Linked List Implementation pt. 2
Unsorted Linked List Implementation pt. 3
Unsorted Linked List Implementation pt. 4
Unsorted Linked List Implementation pt. 5
Unsorted Linked List Example
Sorted Linked List Implementation pt. 1
Sorted Linked List Implementation pt. 2
Sorted Linked List Example
Doubly Linked List Specification
Doubly Linked List Implementation pt. 1
Doubly Linked List Implementation pt. 2
Doubly Linked List Example

Stacks and Queues

Stack Data Type
Array Based Stack Specification
Array Based Stack Implementation
Array Based Stack Example
Stack as a Linked Structure pt. 1
Stack as a Linked Structure pt. 2
Queue Data Type
Array Based Queue Specification
Array Based Queue Implementation pt. 1
Array Based Queue Implementation pt. 2
Array Based Queue Example
Queue as a Linked Structure pt. 1
Queue as a Linked Structure pt. 2
Templates pt. 1
Templates pt. 2

Binary Search Trees

Binary Trees Structure
Binary Search Trees
Specification
Implementation: Constructor / Destructor
Implementation: MakeEmpty
Implementation: CountNodes
Implementation: RetrieveItem
Implementation: InsertItem
Implementation: DeleteItem pt. 1
Implementation: DeleteItem pt. 2
Implementation: GetPredecessor
Implementation: PrintTree
Implementation: ResetTree pt. 1
Implementation: ResetTree pt. 2
Implementation: PreOrder
Implementation: InOrder
Implementation: PostOrder
Implementation: GetNextItem
Example

Conclusion

Review pt. 1
Review pt. 2

Credits

About the Author

No comments:

Post a Comment