CS 374 - Intro to Algs & Models of Comp

Fall 2021

TitleRubricSectionCRNTypeHoursTimesDaysLocationInstructor
Intro to Algs & Models of CompCS374AD072090OD00900 - 0950 W F    
Intro to Algs & Models of CompCS374ADA70643DIS00900 - 0950 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADB70644DIS01000 - 1050 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADC70645DIS01100 - 1150 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADD72092DIS01200 - 1250 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADE72094DIS01600 - 1650 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADF66451DIS01300 - 1350 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADG72201DIS01700 - 1750 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADH66453DIS01400 - 1450 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374ADK66455DIS01500 - 1550 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374AL166445LEC41100 - 1215 T R  1002 Electrical & Computer Eng Bldg Jeff G Erickson
Dakshita Khurana
Intro to Algs & Models of CompCS374AL266454OLC41100 - 1215 T R    Jeff G Erickson
Dakshita Khurana
Intro to Algs & Models of CompCS374BL170641LEC41400 - 1515 T R  1404 Siebel Center for Comp Sci Nickvash Kani
Intro to Algs & Models of CompCS374BYA66446DIS00900 - 0950 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374BYB66447DIS01000 - 1050 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374BYC66448DIS01100 - 1150 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374BYD66449DIS01200 - 1250 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374BYE66450DIS01300 - 1350 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompCS374BYF66452DIS01400 - 1450 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374AD072091OD00900 - 0950 W F    
Intro to Algs & Models of CompECE374ADA70647DIS00900 - 0950 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADB70648DIS01000 - 1050 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADC70649DIS01100 - 1150 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADD72093DIS01200 - 1250 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADE72095DIS01600 - 1650 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADF66548DIS01300 - 1350 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADG72202DIS01700 - 1750 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADH66550DIS01400 - 1450 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374ADK66553DIS01500 - 1550 W F  1302 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374AL166542LEC41100 - 1215 T R  1002 Electrical & Computer Eng Bldg Jeff G Erickson
Dakshita Khurana
Intro to Algs & Models of CompECE374AL266552OLC41100 - 1215 T R    Jeff G Erickson
Dakshita Khurana
Intro to Algs & Models of CompECE374BL170642LEC41400 - 1515 T R  1404 Siebel Center for Comp Sci Nickvash Kani
Intro to Algs & Models of CompECE374BYA66543DIS00900 - 0950 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374BYB66544DIS01000 - 1050 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374BYC66545DIS01100 - 1150 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374BYD66546DIS01200 - 1250 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374BYE66547DIS01300 - 1350 W F  1111 Siebel Center for Comp Sci 
Intro to Algs & Models of CompECE374BYF66549DIS01400 - 1450 W F  1111 Siebel Center for Comp Sci 

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