Click the Schedule Type to find available offerings of the course on the Schedule of Classes. |
CS 3500 - Theory I |
Computational machine models and their language classes. Decidability and undecidability. Data structures and efficient algorithms for fundamental computational problems. Tractability and intractability.
4.000 Credit hours 4.000 Lecture hours Grade Basis: L Dept/Computer Science Department Course Attributes: Tech Elect CS, Engr, &Sciences Restrictions: Must be enrolled in one of the following Campuses: Georgia Tech-Atlanta * Prerequisites: Undergraduate Semester level CS 1050 Minimum Grade of D and Undergraduate Semester level CS 1322 Minimum Grade of D and Undergraduate Semester level MATH 3012 Minimum Grade of D |
Return to Previous | New Search |