CANKIRI KARATEKIN UNIVERSITY Bologna Information System

Course Information

Course's Contribution to Prog.

ECTS- Workload Calculation Tool

Program Information

Course Title | Code | Semester | Laboratory+Practice (Hour) | Pool | Type | ECTS |

Algorithms and Data Structures I | BİL201 | FALL | 3+0 | C | 6 |

Learning Outcomes | 1-explain the concepts of asymptotic complexity and computational complexity 2-design programs by using connection lists 3-use the difference between stack and queue data structure 4-select the sorting algorithms according to big O notation 5- learn the traveling methods of binary trees 6-apply the shortest path finding algorithm on graphs 7-use STL library 8- learn Hashing methods |

Prerequisites | - |

Language of Instruction | Turkish |

Coordinator | Assist. Prof. Dr. Seda ŞAHİN |

Instructors |
1-)Doktor Öğretim Üyesi Seda Şahin |

Assistants | - |

Resources | K1-M.A. Weiss, Data Structures and Algorithm Analysis in C++, 3rd Edition, Addison Wesly Inc., 2006. K2-Kruse, Tondo, Leung, Data Structures & Program Design in C, 2nd Edition, Prentice-Hall, 1997. K3-Cormen, Introduction to Algorithms, 2.Ed. MIT Press, 2001. K4-Gilles Brassard, Paul Bratley. Fundamentals of algorithmics. Prentice Hall, 1996. K5-Malik D. S., C++ Programming: Program Design Including Data Structures, International Edition, 6th Edition (International Edition), Cengage Learning., 2013. |

Supplementary Book | - |

Goals | to understand, analyze and apply the basic data types used in computer science. |

Content | Introduction to data structures, Complexity analysis, Connected lists, Duplex, cyclic linked lists, Stack, Queue, Search and sort algorithms, Binary trees, Graph data structure, STL library, Hashing, Example applications, Repetition |

Çankırı Karatekin Üniversitesi Bilgi İşlem Daire Başkanlığı @
2017 - Webmaster