CIS4930/5930 - Problem Solving - Spring 2026 - Schedule

DateTopicResourcesHomework
Week 101/08Logistics. Review of algorithm analysis: big-Oh and selection sort, Big-Omega and lower bound for comparison-based sorting. Logistics    Scribe 0   Slide 1
Week 201/13Review of algorithm analysis, continued: How to obtain lower and upper bounds via integration. Some basics of algorithm design. Scribe 0   Scribe 1
01/15Some basics of algorithm design, continued. Scribe 1
Week 301/20Practice to prepare for Quiz 1. Basics of algorithm design, continued: Binary-search-like algorithms Scribe 1Writing exercise is up
01/22Basics of algorithm design, continued: Binary-search-like algorithm. Quiz 1Scribe 1
Week 401/27Basics of algorithm design, continued: Using binary search for optimization. Scribe 1Writing exercise due
01/29Writing workshop
Week 502/03Divide-and-conquer: Recursion-tree method and Counting InversionSlide 2    Scribe 2
02/05Divide-and-conquer: Practice recursion-tree method. Wrap up Counting Inversion. Slide 2    Scribe 2
Week 602/10Master Theorem. Practice: Finding Majority. Slide 3    
02/12Divide-and-conquer: Maximum Subarray, Local Minimum in 2D. Slide 2    Scribe 2Hw1  is up
Week 702/17Quiz 2
02/19
Week 802/24
02/26Hw1 due
Week 903/03
03/05
Week 1003/10
03/12
Week 1103/17Springbreak
03/19Springbreak
Week 1203/24
03/26
Week 1303/31
04/02
Week 1404/07
04/09
   Week 15      04/14
    04/16
   Week 16    04/21
    04/23