Αποτελέσματα Αναζήτησης
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.
25 Ιαν 2022 · 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.
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.
There are two independent sections of CS/ECE 374 this semester. This is the web site for Section A (formally: lecture section AL1 and lab sections AY*). Section B, taught by Nickvash Kani, has a separate site on Canvas. The class is full! There is no waiting list this semester.
Send Page to Printer. Print this page. Download Page (PDF) The PDF will include all information unique to this page. 2024-2025 Catalog (PDF) A copy of the full 2024-2025 catalog.
Regular weekly schedule. All listed times are in the Chicago time zone. Lectures Section A: Tue Thu 11:00-12:15 Section B: Tue Thu 14:00-15:15 Review Session Fri morning, 09:00-10:30 18:00-19:30 Labs Pay attention to if the lab is on TR (Tuesday/Thursday) or WF (Wednesday/Friday).
Instructions for printing, copying, and scanning in the Siebel Center. This article lists all shared printers within the Siebel Center for Computing Science, as well as methods to connect to them. When selecting a printer to use, make sure to check your chosen options in the print dialogue (single/doublesided, color/B&W, staples).
