Algorithms and Data Structures - Part 1
Pluralsight
Course Summary
A look at the core data structures and algorithms used in day-to-day applications.
-
+
Course Description
In this course we will look at the core data structures and algorithms used in everyday applications. We will discuss the trade-offs involved with choosing each data structure, along with traversal, retrieval, and update algorithms. This is part 1 of a two-part series of courses covering algorithms and data structures. In this part we cover linked lists, stacks, queues, binary trees, and hash tables.
-
+
Course Syllabus
Algorithms and Data Structures 1: Linked List- 42m 33s
—Introduction 1m 4s
—Node Chains 2m 23s
—Code: Node Chains 5m 6s
—Linked List 0m 41s
—Add Items 4m 5s
—Remove Items 1m 54s
—Enumerate 1m 32s
—Code: Singly Linked List 11m 16s
—Doubly Linked List 1m 54s
—Code: Doubly Linked List 8m 30s
—Modern Implementations 2m 57s
—Summary and References 1m 11sAlgorithms and Data Structures: Stack- 30m 26s
—Introduction 1m 6s
—Push & Pop 2m 46s
—Stack (Linked List) 2m 45s
—Code: Stack (Linked List) 1m 34s
—Stack (Array) 1m 39s
—Code: Stack (Array) 4m 32s
—Postfix Calculator 3m 35s
—Demo: Postfix Calculator 3m 29s
—Demo: Undo 6m 29s
—Other Implementations 1m 48s
—Summary and Reference 0m 43sAlgorithms and Data Structures 1: Queue- 32m 8sAlgorithms and Data Structures: Binary Trees- 44m 14sAlgorithms and Data Structures: Hash Tables- 44m 27s
This course is listed under
Open Source
, Development & Implementations
, Data & Information Management
and Telecommunications
Community
Related Posts:
