Need a tutor for a female UG , CS student in UiUC, Ilinois. By Zoom, student will set up. See syllabus below.
Former exp. TA or instructor for Stanford CS 161, 154 etc highly preferred
Start - ASAP
End - Early December (12 weeks)
Contact time. 2 or 3 sessions a week. 1 hour each, but flexible
Compensation - very flexible according to experience of tutor
Immediate start is desired, as classes are ongoing
Syllabus
CS/ECE 374 covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness.
Class notes at https://ecealgo.com/
Former exp. TA or instructor for Stanford CS 161, 154 etc highly preferred
Start - ASAP
End - Early December (12 weeks)
Contact time. 2 or 3 sessions a week. 1 hour each, but flexible
Compensation - very flexible according to experience of tutor
Immediate start is desired, as classes are ongoing
Syllabus
CS/ECE 374 covers fundamental tools and techniques from theoretical computer science, including design and analysis of algorithms, formal languages and automata, computability, and complexity. Specific topics include regular and context-free languages, finite-state automata, recursive algorithms (including divide and conquer, backtracking, dynamic programming, and greedy algorithms), fundamental graph algorithms (including depth- and breadth-first search, topological sorting, minimum spanning trees, and shortest paths), undecidability, and NP-completeness.
Class notes at https://ecealgo.com/