-
CS/ECE 374 AL1/BL1 - Final exam review
-
- 3SAT to hamiltonian cycle - 3SAT to graph coloring - 3SAT to CSAT (and reverse too!)
CS/ECE 374 AL1/BL1 - Lecture 26 - More 3SAT to X…
-
- Cook-Levin Theorem - Reduction: 3SAT -> Subset-sum
CS/ECE 374 AL1/BL1 - Lecture 25 - 3SAT and…
-
-Sample reduction from SAT to independent set -Re-review of complexity classes -P/NP comparison to DFA/NFA -Introduction to certificate and certificate jargon
CS/ECE 374 AL1/BL1 - Lecture 24 -…
-
Basic conceptual overview of reductions Independent Sets / Cliques Intro to SAT
CS/ECE 374 AL1/BL1 - Lecture 23 - Polynomial time…
-
- Minimum Spanning Trees - Proof of MST algorithms via safe edges
CS/ECE 374 AL1/BL1 - Lecture 22 - Minimum…
-
Greedy algorithms and exchange proofs of optimality - Interval scheduling - Minimum max-lateness
ECE/CS 374 AL1/BL1 - Lecture 21 - Greedy…
-
- Bellman Ford shortest paths
ECE/CS 374 AL1/BL1 - Lecture 20 - Bellman Ford
-
- Breadth first search - Dijkstra's shortest paths algorithm
CS/ECE 374 AL1/BL1 - Lecture 19 - Breadth first…
-
Linear time algorithm for finding SCCs of G and meta-graph of SCCs.
ECE/CS 374 AL1/BL1 - Lecture 18 - Depth First…
-
- Topological Sorting - Depth First Search with Pre-/Post numbering
ECE/CS 374 AL1/BL1 - Lecture 17 - Topological…
-
- Code example of Optimal Binary Search Tree example - Parsing and the CYK algorithm
ECE/CS 374 AL1/BL1 - Lecture 16 - Yet More…
-
- Long increasing subsequence recap - Edit distance - Optimal Binary Search Tree
CS/ECE 374 AL1/BL1 - Lecture 15 - More Dynamic…
-
- Dynamic programming - Improving solution to SubsetSum - A look at the rubrics and step by step guide to dynamic programming solutions
CS/ECE 374 AL1/BL1 - Lecture 14 - Dynamic…
-
- Brute force strategies - Backtracking strategies - 8 queens, subset sum - Memoization & fibonacci
CS/ECE 374 AL1/BL1 - Lecture 13 - Backtracking
-
Quick Select explained more.
ECE/CS 374 AL1/BL1 - Lecture 11.5 - Quick Select…
-
- Karatsuba - Median of Medians and Quickselect
ECE/CS 374 AL1/BL1 - Lecture 11 - Divide and…
-
- Recursion / reduction - Towers of Hanoi - Merge sort
ECE/CS 374 AL1/BL1 - Lecture 10 - Recursion,…
-
Examples of Turing reductions, recurrence expressions, and context-free grammar
CS/ECE 374 AL1/BL1 - Lecture 9.5 - Midterm 1…
-
- Cantor's diagonalization argument - Undecidability and halting problem
CS/ECE 374 AL1/BL1 - Lecture 9 - Undecidability
-
- CFG closure properties - Turing Machines - PDAs
CS/ECE 374 AL1/BL1 - Lecture 8 - Turing Machines
-
- Context Free Grammars, parse trees
CS/ECE 374 AL1/BL1 - Lecture 7 - Context Free…
-
- Proving languages non-regular with fooling sets - Proving languages non-regular with Closure Properties - A bit about the Myhill-Nerode theorems
CS/ECE 374 AL1/BL1 - Lecture 6 - Fooling Sets
-
- Finish DFAs and product construction - NFAs
ECE/CS 374 AL1/BL1 - Lecture 4 - NFAs
-
- Closure properties of NFA - DFA<->NFA<->Regular equivalence
ECE/CS 374 AL1/BL1 Fall 20 - Lecture 5: More NFAs
-
Finish up regexes A coding example using regexp library! Start talking about DFAs
ECE/CS 374 AL1/BL1 - Lecture 3 - DFAs
-
Reviewing strings Some inductive proofs Facts about languages and a first result in computability theory Introducing regular languages / expressions
CS/ECE 374 AL1/BL1 - Lecture 2 - Strings, Regular…
-
Introduction to class! Administrative stuff Starting to discuss strings
ECE/CS 374 AL1/BL1 - Lecture 1 Intro, Strings
Search for ""
Public, Restricted and Moderated
- Managers: