CENG 481

Theoretical Approaches in Computer Science

Turning theoretical ideas into solution sets in computer science. Integration of mathematical approaches with general problem solving techniques and computer science applications. Topics will be from Algorithms, Complexity Theory, Game Theory, Probability Theory, Graph Theory, Automata Theory, Algebra, and Cryptography.

Course Objectives

To teach the fundamentals topics and theorems of computer science. To teach the research, analyze, compare and modeling techniques of computer science. To teach the hot topic concepts, research areas and problems of computer science.

Recommended or Required Reading

The text book/books are determined by decided topics.

Learning Outcomes

1. Analyzing capability to find new requirements and problems of current application areas of computer scince

2. Defining and modelling capability of computer science hot topic research problems.

3. To have the vision and to be able to do an evaluation for the future career plans on computer science

4. To be able to apply fundamental theorems of computer science with interdisciplinary research and studies.

Topics
Introduction: related topics and introducing of course content.
Computational Complexity Theory – I
Computational Complexity Theory – II
Automata Theory
Languages and Computability
Algorithms ; Algorithm Theory
Algorithms ; Algorithm Analysis
Algorithms ; Data Structures
Algorithms ; Approximation Algorithms Medium size
Algorithms ; Graph Algorithms
Algorithms ; Numerical Analysis
Artificial Intelligence
Machine Learning
Algorithms; Computational Biology

Grading

Midterm: 20%

Homework: 20%

Presentation: 40%

Final: 20%