In 2017, I recorded a series of video walkthroughs for students taking SNHU's CS-260 Data Structures and Algorithms (C++) course.
CS-260 Lesson 1 Up-To-Speed, part 1
This assignment is designed to quickly get up to speed with the C++ language and the development environment you will be using throughout this course. We will build a simple console program that uses a menu to enable testing of the logic you will complete.
CS-260 Lesson 2 Up-To-Speed, part 2
This assignment is designed to quickly get up to speed with the C++ language and the development environment you will be using throughout this course. We will build a simple console program that uses a menu to enable testing of the logic you will complete. . Note that I forgot to enable screen sharing until 7:00 minute mark.
CS-260 Lesson 3 Linked Lists
This assignment is designed to explore linked lists so you will implement a singly linked-list to hold a collection of bids loaded from a CSV file. We will build a simple console program that uses a menu to enable testing of the logic you will complete.
CS-260 Lesson 4 Sorting Algorithms
This assignment is designed to explore sorting algorithms by implementing both a selection sort and quicksort of a vector of bids loaded from a CSV file. We provide a starter console program that uses a menu to enable testing of the sort logic you will complete. It also allows you to pass in the path to the bids CSV file to be loaded, enabling you to try both files. Includes a demo of using the debugger when a bug is encountered.
CS-260 Lesson 5 Hash Tables with Chaining
A walkthrough of implementing a hash table using a chaining algorithm to handle collisions.
CS-260 Lesson 6 Binary Search Tree
A walkthrough of implementing a binary search tree in C++ using recursion and simple while loops for different operations.