Course Websites

CS 374 - Intro to Algs & Models of Comp

Last offered Spring 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.

Related Faculty

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 CompAL165088LEC41100 - 1215 T R  1002 Electrical & Computer Eng Bldg Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYA65089DIS00900 - 0950 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYB65090DIS01000 - 1050 W F  1105 Siebel Center for Comp Sci Ruta Mehta
Timothy Moon-Yew Chan
Intro to Algs & Models of CompAYC65091DIS01400 - 1450 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYD65092DIS01100 - 1150 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYE65093DIS01200 - 1250 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYF65094DIS01300 - 1350 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYG65095DIS01500 - 1550 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYH65096DIS01600 - 1650 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompAYJ65097DIS01700 - 1750 W F  1105 Siebel Center for Comp Sci Timothy Moon-Yew Chan
Ruta Mehta
Intro to Algs & Models of CompBL167005LEC41530 - 1645 T R  1320 Digital Computer Laboratory Nickvash Kani
Intro to Algs & Models of CompBYA67949DIS00900 - 0950 W F  3038 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYB67951DIS01100 - 1150 W F  3038 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYC67953DIS01200 - 1250 W F  3038 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYD67955DIS01500 - 1550 W F  3038 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYE67957DIS01300 - 1350 W F  3038 Campus Instructional Facility Nickvash Kani
Intro to Algs & Models of CompBYF67959DIS01400 - 1450 W F  3038 Campus Instructional Facility Nickvash Kani