CS242. Algorithms and Data Structures

Topic outline

• Select topic General

  General

  Collapse all Expand all
  • Select activity Organization matters

    

    Organization matters File
  • Select activity Examination questions

    

    Examination questions File
  • Select activity Announcements and useful information

    

    Announcements and useful information Forum
• Select topic Module 1. Introduction to algorithms and data structures

  Module 1. Introduction to algorithms and data structures
  • Select activity Lecture 01. Introduction to the course

    

    Lecture 01. Introduction to the course File
  • Select activity Lecture 02. Sorting algorithms.

    

    Lecture 02. Sorting algorithms. File
  • Select activity Assignment 1

    

    Assignment 1
  • Select activity Sample source file for assignment 1

    

    Sample source file for assignment 1
  • Select activity A series of short lectures about implementing dynamic linked lists in C++ (and C).

    

    A series of short lectures about implementing dynamic linked lists in C++ (and C). URL
  • Select activity Lecture 03. Graphs: definifions, representations, basic operations on graphs.

    

    Lecture 03. Graphs: definifions, representations, basic operations on graphs. File
  • Select activity Lecture 04. Graph traversals, part 1

    

    Lecture 04. Graph traversals, part 1 File
  • Select activity Lecture 05. Graph traversals, part 2

    

    Lecture 05. Graph traversals, part 2 File
  • Select activity Assignment 2. Graph traversals

    

    Assignment 2. Graph traversals
  • Select activity Test data for assignment 2

    

    Test data for assignment 2 File
  • Select activity Text file input/output sample

    

    Text file input/output sample
  • Select activity Sample code/project for parsing string lines and implementing DFS/BFS

    

    Sample code/project for parsing string lines and implementing DFS/BFS File
  • Select activity Lecture 06. Graph traversals, part 3

    

    Lecture 06. Graph traversals, part 3 File
  • Select activity Test 1

    

    Test 1 Assignment
• Select topic Module 2.Greedy algorithms. Divide-and-Conquer strategy.

  Module 2.Greedy algorithms. Divide-and-Conquer strategy.
  • Select activity Lecture 07. Greedy algorithms, part 1: concepts, MST, Kruskal

    

    Lecture 07. Greedy algorithms, part 1: concepts, MST, Kruskal File
  • Select activity Lecture 08. Greedy algorithms, part 2: MST, Prim's algorithm

    

    Lecture 08. Greedy algorithms, part 2: MST, Prim's algorithm File
  • Select activity Lecture 09. Divide-and-Conquer strategy. MergeSort

    

    Lecture 09. Divide-and-Conquer strategy. MergeSort File
  • Select activity Assignment 3. Merge sort.

    

    Assignment 3. Merge sort.
  • Select activity Lecture 10. Divide-and-Conquer. Multiplication

    

    Lecture 10. Divide-and-Conquer. Multiplication File
  • Select activity Assignment 4. Fast exponentiation

    

    Assignment 4. Fast exponentiation
  • Select activity Test 2

    

    Test 2 Assignment
• Select topic Module 3. Dynamic progamming

  Module 3. Dynamic progamming
  • Select activity Lecture 11. Dynamic programming: general concepts and scheme

    

    Lecture 11. Dynamic programming: general concepts and scheme File
  • Select activity Lecture 12. Edit Distance, the Longest Common Subsequence

    

    Lecture 12. Edit Distance, the Longest Common Subsequence File
  • Select activity Assignment 5. Edit distance

    

    Assignment 5. Edit distance
  • Select activity Test 3

    

    Test 3 Assignment
• Select topic Module 4. NP-hard problems

  Module 4. NP-hard problems
  • Select activity Lecture 13. NP-hard problems (concept). Travelling Salesman Problem

    

    Lecture 13. NP-hard problems (concept). Travelling Salesman Problem File
  • Select activity Assignment 6. Brute-force algorithm for TSP

    

    Assignment 6. Brute-force algorithm for TSP
  • Select activity Test data for assignment 6

    

    Test data for assignment 6 File
  • Select activity Lecture 14. Inexact algorithms

    

    Lecture 14. Inexact algorithms File
  • Select activity Test 4

    

    Test 4 Assignment