Course: CS242. Algorithms and Data Structures

Topic outline

General

Collapse all Expand all
- File
  
  Organization matters File
- File
  
  Examination questions File
- Forum
  
  Announcements and useful information Forum
Module 1. Introduction to algorithms and data structures
- File
  
  Lecture 01. Introduction to the course File
- File
  
  Lecture 02. Sorting algorithms. File
- Assignment
  
  Assignment 1
- File
  
  Sample source file for assignment 1
- URL
  
  A series of short lectures about implementing dynamic linked lists in C++ (and C). URL
- File
  
  Lecture 03. Graphs: definifions, representations, basic operations on graphs. File
- File
  
  Lecture 04. Graph traversals, part 1 File
- File
  
  Lecture 05. Graph traversals, part 2 File
- Assignment
  
  Assignment 2. Graph traversals
- File
  
  Test data for assignment 2 File
- File
  
  Text file input/output sample
- File
  
  Sample code/project for parsing string lines and implementing DFS/BFS File
- File
  
  Lecture 06. Graph traversals, part 3 File
- Assignment
  
  Test 1 Assignment
Module 2.Greedy algorithms. Divide-and-Conquer strategy.
- File
  
  Lecture 07. Greedy algorithms, part 1: concepts, MST, Kruskal File
- File
  
  Lecture 08. Greedy algorithms, part 2: MST, Prim's algorithm File
- File
  
  Lecture 09. Divide-and-Conquer strategy. MergeSort File
- Assignment
  
  Assignment 3. Merge sort.
- File
  
  Lecture 10. Divide-and-Conquer. Multiplication File
- Assignment
  
  Assignment 4. Fast exponentiation
- Assignment
  
  Test 2 Assignment
Module 3. Dynamic progamming
- File
  
  Lecture 11. Dynamic programming: general concepts and scheme File
- File
  
  Lecture 12. Edit Distance, the Longest Common Subsequence File
- Assignment
  
  Assignment 5. Edit distance
- Assignment
  
  Test 3 Assignment
Module 4. NP-hard problems
- File
  
  Lecture 13. NP-hard problems (concept). Travelling Salesman Problem File
- Assignment
  
  Assignment 6. Brute-force algorithm for TSP
- File
  
  Test data for assignment 6 File
- File
  
  Lecture 14. Inexact algorithms File
- Assignment
  
  Test 4 Assignment