# Course Websites

## CS 374 - Intro to Algs & Models of Comp

### Last offered Fall 2022

#### Official Description

Analysis of algorithms, major paradigms of algorithm design including recursive algorithms, divide-and-conquer algorithms, dynamic programming, greedy algorithms, and graph algorithms. Formal models of computation including finite automata and Turing machines. Limitations of computation arising from fundamental notions of algorithm and from complexity-theoretic constraints. Reductions, undecidability and NP-completeness. Course Information: Same as ECE 374. Prerequisite: One of CS 173, MATH 213; CS 225.

#### Learning Goals

 Be able to design regular expressions, finite automata or conftext free languages from a given language specification . (1), (3), (6) Be able to prove that a given language is not regular (3)(6) Be able to analyze the asymptotic running time of an algorithm via sums and recurrences (3)(6) Model an algorithmic problems via graphs and apply appropriate graph algorithm to yield a solution (1)(3)(6) Given problem specification, design efficient algorithms via techniques such as recursion, divide and conquer, dynamic programming and greedy (1)(3)(6) Be able to prove the correctness of an algorithm by induction or via reductions (3)(6) Prove NP-hardness via polynomial-time reductions from known NP-hard problems (3)(6) Prove a language undecidable via reduction from known undecidable problems such as Halting. (3)(6)

#### Topic List

LANGUAGES and AUTOMATA

• Strings and languages
• Finite automata (DFA, NFA) and regular expressions
• Context free grammars and languages

ALGORITHMS

• Recursion, Divide and conquer, Backtracking
• Dynamic programming
• Greedy
• Basic graph algorithms: reachability, BFS, DFS, shortest paths, MST, modeling via graphs

NP Completness

• Polynomial-time reductions, P, NP, NP-Complete, NP-Hard

Turing Machines (TMs)

• Universal TM, RAM, decidability, undecidability, Church-Turing thesis

#### Required, Elective, or Selected Elective

Required

TitleSectionCRNTypeHoursTimesDaysLocationInstructor
Intro to Algs & Models of CompADA70643DIS00900 - 0950 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADB70644DIS01000 - 1050 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADC70645DIS01100 - 1150 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADD72092DIS01200 - 1250 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADE72094DIS01300 - 1350 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADF66451DIS01400 - 1450 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADG72201DIS01500 - 1550 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADH66453DIS01600 - 1650 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADK66455DIS01700 - 1750 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompADL75939DIS01800 - 1850 W F  1105 Siebel Center for Comp Sci Sariel Har-Peled
Intro to Algs & Models of CompAL166445LEC41100 - 1215 T R  0027/1025 Campus Instructional Facility Sariel Har-Peled
Intro to Algs & Models of CompBL170641LEC41230 - 1345 T R  1404 Siebel Center for Comp Sci Nickvash Kani
Intro to Algs & Models of CompBYA66446DIS00900 - 0950 W F  4101 Materials Science & Eng Bld Nickvash Kani
Intro to Algs & Models of CompBYB66447DIS01000 - 1050 W F  4039 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYC66448DIS01100 - 1150 W F  140 Burrill Hall Nickvash Kani
Intro to Algs & Models of CompBYD66449DIS01200 - 1250 W F  140 Burrill Hall Nickvash Kani
Intro to Algs & Models of CompBYE66450DIS01300 - 1350 W F  106B3 Engineering Hall Nickvash Kani
Intro to Algs & Models of CompBYF66452DIS01400 - 1450 W F  106B3 Engineering Hall Nickvash Kani