Description of Individual Course Units
|
Offered By |
Graduate School of Natural and Applied Sciences |
Level of Course Unit |
Second Cycle Programmes (Master's Degree) |
Course Coordinator |
ASSOCIATE PROFESSOR ZERRIN IŞIK |
Offered to |
Computer Engineering Non-Thesis |
Course Objective |
This course aims at equipping students with knowledge and skills to identify, analyze and asess alternatives of more advanced algorithms and data structures in developing solutions to modern engineering problems. At the end of the course students should be able to recognize limits on performance of algorithms and be able to develop practically acceptable solutions to some harder engineering problems using approximation and probability methods. |
Learning Outcomes of the Course Unit |
||||||||||
|
Mode of Delivery |
Face -to- Face |
Prerequisites and Co-requisites |
None |
Recomended Optional Programme Components |
None |
Course Contents |
|||||||||||||||||||||||||||||||||||||||||||||
|
Recomended or Required Reading |
Textbook(s): Introduction To Algorithms, Third Edition, THOMAS H. CORMEN CHARLES E. LEISERSON RONALD L. RIVEST CLIFFORD STEIN, The MIT Press Massachusetts Institute of Technology Cambridge, 2009. |
Planned Learning Activities and Teaching Methods |
Assessment Methods |
||||||||||||||||||||||||||||
*** Resit Exam is Not Administered in Institutions Where Resit is not Applicable. |
Further Notes About Assessment Methods |
None |
Assessment Criteria |
To be announced. |
Language of Instruction |
English |
Course Policies and Rules |
To be announced. |
Contact Details for the Lecturer(s) |
Prof. Dr. Suleyman Sevinc |
Office Hours |
TBA in the first lecture |
Work Placement(s) |
None |
Workload Calculation |
||||||||||||||||||||||||||||||||||||||||||||||||
|
Contribution of Learning Outcomes to Programme Outcomes |
||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||||
|