|
Algorithms and Complexity |
|
ALG COMP |
| CLASS CODE: |
CS 306 |
CREDITS:
3
|
| DIVISION: |
PHYSICAL SCIENCE & ENGINEERING |
| DEPARTMENT: |
ELECTRICAL & COMPUTER ENGINEERING |
| GENERAL EDUCATION: |
This course does not fulfill a General Education requirement. |
|
| CATALOG DESCRIPTION: |
Theory and application of languages and algorithms. Topics include algorithmic analysis; greedy, divide and conquer, back-tracking, branch and bound, and dynamic programming type algorithms; automata; languages and grammars; parsing techniques. |
| DESCRIPTION: |
This course builds upon the underlying mathematical concepts discussed in CS 236 by providing examples of their application. The course also introduces automata, grammars, the relational data model, graphs and trees. Many of the concepts taught in this class are prerequisites for future classes in compilers, databases and networks. |
| TOPICS: |
Trees, relational data model, graphs, automata theory and applications, grammers and parsing techniques. |
| OBJECTIVES: |
|
| REQUIREMENTS: |
Access to computers in the Linux computer lab is required to complete homework assignments. Class attendance is required but is not necessarily part of the grade. Each student is required to read assigned portions of the textbook(s). |
| PREREQUISITES: |
CS 235 and CS 236 |
| OTHER: |
|
| EFFECTIVE DATE: |
August 2002 |
>>PRINT