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.
| 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 |
Other Fourth Year Courses
- CENG 400
- CENG 411
- CENG 415
- CENG 416
- CENG 418
- CENG 421
- CENG 422
- CENG 424
- CENG 431
- CENG 432
- CENG 433
- CENG 434
- CENG 435
- CENG 436
- CENG 437
- CENG 441
- CENG 442
- CENG 443
- CENG 444
- CENG 451
- CENG 452
- CENG 461
- CENG 462
- CENG 463
- CENG 464
- CENG 465
- CENG 471
- CENG 472
- CENG 473
- CENG 482
- CENG 483
- CENG 484
- CENG 485
- CENG 486
- CENG 487
- CENG 488