CIS263 Course Contents
Syllabus
Download the syllabus Section 1 Section 2
Discord Server Link
Question Bank
Assignments
Extra Credit Document
Put your extra credit points here
Weekly Lecture Contents
Download weekly lecture notes from here
Lecture Links
| Week | links |
|---|---|
| Week 1 | Algorithm Analysis Part1 Part 2 Part 3 Part 4 Lecture Note |
| Week 2 | Lists Stacks Queue Part 1 Part 2 Part 3 Lecture Note |
| Week 3 | Tree Binary Tree Binary Search Tree Part1 Part 2 Lecture Note |
| Week 4 | AVL Tree Part 1 Part 2 Lecture Note B Tree Part1 Part 2 Part3 Part 4 Part5 Lecture Note |
| Week 5 | Sets and Maps video Lecture Note , Heaps and Priority Queues Part 1 Part 2 Lecture Note |
| Week 6 | Hashing Techniques Part 1 Part 2 Lecture Note |
| Week 7 | Sorting selection sort bubble sort video merge sort video quick sort video radix sort video Lecture Note Disjoint Set Class video part1 video part2 Lecture Note |
| Week 8 | Backtracking Lecture Note |
| Week 9 | Graph and Greedy Part 1 Part 2 Part 3 Part 4 Lecture Note |
| Week 10 | Graph and Greedy Part 1 Part 2 Part 3 Part 4 Huffman Coding Video Lecture Note |
| Week 11 | Dynamic Programming Part 1 Part 2 Lecture Note 0/1 Knapsack Problem Lecture Note Advanced Concepts Bellman Ford Slide |
| Week 12 | Adv. Concepts: Topological Sort video Lecture Note Adv. Concepts: Kosaraju’s Algorithm video Lecture Note |
| Week 13 | Adv. Concepts: Bloom Filters Slides Adv. Concepts: Skip List Slides |
| Week 14 | Rabin Karp String Matching Part 1 Part 2 Part 3 Lecture Note P-NP Part 1 Part 2 Part 3 Lecture Note |
| Week 15 | Rabin Karp String Matching Part 1 Part 2 Part 3 Lecture Note P-NP Part 1 Part 2 Part 3 Lecture Note |
Quiz Syllabus
| Quiz | Syllabus |
|---|---|
| Quiz 1 | Mathematical Review, Algorithm Analysis, list, stack, queue |
| Quiz 2 | Trees, Binary Trees, Binary Search Trees, AVL tree, B+ tree |
| Quiz 3 | Sets, Maps, Priority Queues, Heaps, Hashing techniques |
| Quiz 4 | Disjoint set class, Sorting algorithms, Backtracking |
| Quiz 5 | Greedy and Graph algorithms, Dijsktra, Prim, Kruskal, Dynamic Programming, LCS problem, 0/1 Knapsack problem |
| Quiz 6 | Topological Sort, Kosaraju’s algorithm, Bellman Ford, Rabin Karp String Matching, NP completeness, NP Hard problems, Skip List, Bloom Filters |
Online Coding Sessions
| Session | Topics |
|---|---|
| Session 1 | list, stack, queue |
| Session 2 | Trees, Binary Trees, Binary Search Trees, AVL tree, B+ tree |
| Session 3 | Backtracking, Sorting, disjoint set class |
| Session 4 | Greedy and Graph algorithms, Dijsktra, Prim, Kruskal, Dynamic Programming, LCS problem, 0/1 Knapsack problem |
| Session 5 | Topological Sort, Kosaraju’s algorithm, Bellman Ford, Rabin Karp String Matching, Skip List, Bloom Filters |