O'Reilly logo

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

Data Structures and Algorithms in C++

Video Description

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.

Table of Contents

  1. Introduction
    1. About This Course 00:02:55
    2. About Algorithms and Data Structures 00:03:49
    3. Resources 00:04:54
  2. Installation
    1. Installing C++ IDE 00:03:42
    2. Installing C++ Compiler 00:03:35
    3. Other Compilers 00:04:01
    4. C++ Program Structure 00:04:27
  3. C++ Language Basics
    1. Algorithms vs. Programs 00:06:01
    2. Variables pt. 1 00:05:35
    3. Variables pt. 2 00:06:19
    4. If Then Statement 00:05:19
    5. If Then Else Statement 00:03:12
    6. While Loop 00:07:00
    7. For Loop 00:06:28
    8. Functions 00:06:33
    9. Library Functions 00:04:16
  4. Data Design and Implementation
    1. Abstraction and Information Hiding 00:03:27
    2. Program Design 00:04:21
    3. Data Structures 00:03:39
    4. Records 00:04:59
    5. Arrays 00:06:43
    6. Class Specification pt. 1 00:03:41
    7. Class Specification pt. 2 00:04:28
    8. Class Implementation 00:06:09
    9. Class Objects 00:04:53
    10. Object Parameters 00:04:26
  5. Lists
    1. List Data Type 00:03:38
    2. Unsorted List Specification pt. 1 00:03:42
    3. Unsorted List Specification pt. 2 00:03:57
    4. Unsorted List Implementation pt. 1 00:04:23
    5. Unsorted List Implementation pt. 2 00:06:01
    6. Unsorted List Implementation pt. 3 00:04:45
    7. Unsorted List Example 00:04:19
    8. Sorted List Specification 00:04:36
    9. Sorted List Implementation pt. 1 00:05:00
    10. Sorted List Implementation pt. 2 00:04:21
    11. Sorted List Implementation pt. 3 00:04:39
    12. Sorted List Example 00:03:49
  6. Linked Lists
    1. Unsorted Linked List Specification 00:06:23
    2. Unsorted Linked List Implementation pt. 1 00:03:11
    3. Unsorted Linked List Implementation pt. 2 00:03:17
    4. Unsorted Linked List Implementation pt. 3 00:05:22
    5. Unsorted Linked List Implementation pt. 4 00:06:16
    6. Unsorted Linked List Implementation pt. 5 00:03:00
    7. Unsorted Linked List Example 00:03:55
    8. Sorted Linked List Implementation pt. 1 00:03:05
    9. Sorted Linked List Implementation pt. 2 00:06:13
    10. Sorted Linked List Example 00:04:56
    11. Doubly Linked List Specification 00:03:56
    12. Doubly Linked List Implementation pt. 1 00:04:28
    13. Doubly Linked List Implementation pt. 2 00:03:42
    14. Doubly Linked List Example 00:03:58
  7. Stacks and Queues
    1. Stack Data Type 00:03:38
    2. Array Based Stack Specification 00:02:52
    3. Array Based Stack Implementation 00:04:50
    4. Array Based Stack Example 00:04:27
    5. Stack as a Linked Structure pt. 1 00:02:43
    6. Stack as a Linked Structure pt. 2 00:06:16
    7. Queue Data Type 00:02:51
    8. Array Based Queue Specification 00:03:46
    9. Array Based Queue Implementation pt. 1 00:05:29
    10. Array Based Queue Implementation pt. 2 00:06:23
    11. Array Based Queue Example 00:06:25
    12. Queue as a Linked Structure pt. 1 00:03:34
    13. Queue as a Linked Structure pt. 2 00:05:14
    14. Templates pt. 1 00:04:01
    15. Templates pt. 2 00:05:04
  8. Binary Search Trees
    1. Binary Trees Structure 00:04:42
    2. Binary Search Trees 00:04:14
    3. Specification 00:05:40
    4. Implementation: Constructor / Destructor 00:04:12
    5. Implementation: MakeEmpty 00:04:20
    6. Implementation: CountNodes 00:04:53
    7. Implementation: RetrieveItem 00:05:12
    8. Implementation: InsertItem 00:05:40
    9. Implementation: DeleteItem pt. 1 00:04:22
    10. Implementation: DeleteItem pt. 2 00:05:59
    11. Implementation: GetPredecessor 00:03:30
    12. Implementation: PrintTree 00:03:01
    13. Implementation: ResetTree pt. 1 00:05:22
    14. Implementation: ResetTree pt. 2 00:02:55
    15. Implementation: PreOrder 00:03:24
    16. Implementation: InOrder 00:03:10
    17. Implementation: PostOrder 00:04:39
    18. Implementation: GetNextItem 00:05:15
    19. Example 00:06:29
  9. Conclusion
    1. Review pt. 1 00:03:57
    2. Review pt. 2 00:05:55
  10. Credits
    1. About the Author 00:01:28