skip to main content

CS 374 - Intro to Algs & Models of Comp

Fall 2020

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Intro to Algs & Models of CompCS374ADA70643OD00900 - 0950 W F    
Intro to Algs & Models of CompCS374ADB70644OD01000 - 1050 W F    
Intro to Algs & Models of CompCS374ADC70645OD01100 - 1150 W F    
Intro to Algs & Models of CompCS374ADD72092OD01200 - 1250 W F    
Intro to Algs & Models of CompCS374ADE72094OD01600 - 1650 W F    
Intro to Algs & Models of CompCS374ADF66451OD01300 - 1350 W F    
Intro to Algs & Models of CompCS374ADG72201OD01700 - 1750 W F    
Intro to Algs & Models of CompCS374ADH66453OD01400 - 1450 W F    
Intro to Algs & Models of CompCS374ADK66455OD01500 - 1550 W F    
Intro to Algs & Models of CompCS374AL166445OLC41100 - 1215 T R    Sariel Har-Peled
Intro to Algs & Models of CompCS374BL170641OLC41400 - 1515 T R    Andrew Miller
Nickvash Kani
Intro to Algs & Models of CompCS374BYA66446OD00900 - 0950 W F    
Intro to Algs & Models of CompCS374BYB66447OD01000 - 1050 W F    
Intro to Algs & Models of CompCS374BYC66448OD01100 - 1150 W F    
Intro to Algs & Models of CompCS374BYD66449OD01200 - 1250 W F    
Intro to Algs & Models of CompCS374BYE66450OD01300 - 1350 W F    
Intro to Algs & Models of CompCS374BYF66452OD01400 - 1450 W F    
Intro to Algs & Models of CompECE374ADA70647OD00900 - 0950 W F    
Intro to Algs & Models of CompECE374ADB70648OD01000 - 1050 W F    
Intro to Algs & Models of CompECE374ADC70649OD01100 - 1150 W F    
Intro to Algs & Models of CompECE374ADD72093OD01200 - 1250 W F    
Intro to Algs & Models of CompECE374ADE72095OD01600 - 1650 W F    
Intro to Algs & Models of CompECE374ADF66548OD01300 - 1350 W F    
Intro to Algs & Models of CompECE374ADG72202OD01700 - 1750 W F    
Intro to Algs & Models of CompECE374ADH66550OD01400 - 1450 W F    
Intro to Algs & Models of CompECE374ADK66553OD01500 - 1550 W F    
Intro to Algs & Models of CompECE374AL166542OLC41100 - 1215 T R    Sariel Har-Peled
Intro to Algs & Models of CompECE374BL170642OLC41400 - 1515 T R    Andrew Miller
Nickvash Kani
Intro to Algs & Models of CompECE374BYA66543OD00900 - 0950 W F    
Intro to Algs & Models of CompECE374BYB66544OD01000 - 1050 W F    
Intro to Algs & Models of CompECE374BYC66545OD01100 - 1150 W F    
Intro to Algs & Models of CompECE374BYD66546OD01200 - 1250 W F    
Intro to Algs & Models of CompECE374BYE66547OD01300 - 1350 W F    
Intro to Algs & Models of CompECE374BYF66549OD01400 - 1450 W F    

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

Last updated

3/26/2019by Elsa Gunter