CANKIRI KARATEKIN UNIVERSITY Bologna Information System


  • Course 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-explains the concepts of asymptotic complexity and computational complexity
    2-designs programs by using connection lists
    3-uses the difference between stack and queue data structure
    4-selects the sorting algorithms according to big O notation
    5- learns the traveling methods of binary trees
  • ECTS / WORKLOAD
  • ActivityPercentage

    (100)

    NumberTime (Hours)Total Workload (hours)
    Course Duration (Weeks x Course Hours)14342
    Classroom study (Pre-study, practice)14684
    Assignments0000
    Short-Term Exams (exam + preparation) 1021020
    Midterm exams (exam + preparation)3011010
    Project2011010
    Laboratory 0000
    Final exam (exam + preparation) 4011212
    0000
    Total Workload (hours)   178
    Total Workload (hours) / 30 (s)     5,93 ---- (6)
    ECTS Credit   6
  • Course Content
  • Week Topics Study Metarials
    1 Introduction to data structures R1-Chapter-1
    2 Complexity analysis R1-Chapter-2
    3 Connected lists R1-Chapter-3
    4 Duplex, cyclic linked lists R1-Chapter-3
    5 Stack R1-Chapter-3
    6 Queue R1-Chapter-3
    7 Search and sort algorithms R1-Chapter-7
    8 Binary trees R1-Chapter-4
    9 Graph data structure R1-Chapter-9
    10 STL library R2-Chapter-5
    11 Hashing R1-Chapter-5
    12 Example applications R1-Chapter-12
    13 Subject examples and repetition R3-Chapter-2
    14 Repetition R3-Chapter-3
    Prerequisites -
    Language of Instruction Turkish
    Responsible Asst. Prof. Dr. Seda ŞAHİN
    Instructors -
    Assistants -
    Resources R1.Weiss, M.A. (2006), Data Structures and Algorithm Analysis in C++, 3rd Edition, Addison Wesley Inc, Boston. R2.Kruse, R.L. (1986). Data structures and program design in C. 2nd Edition, Prentice-Hall, New Jersey. R3.Cormen, T. H. (2001). Introduction to Algorithms 2nd. MIT Press, USA.
    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
  • Program Learning Outcomes
  • Program Learning Outcomes Level of Contribution
    1 To be able to apply mathematics, science and engineering theories and principles to Computer Engineering problems. 5
    2 To have the ability to define, model, and solve problems related to Computer Engineering. 5
    3 To be able to design and conduct experiments, as well as to analyze and interpret data. 4
    4 To be able to design and analyze a process for a specific purpose within technical and economical limitations. -
    5 To be able to use modern techniques and calculation tools required for engineering applications. -
    6 To have the awareness of professional liabilities and ethics. -
    7 To be able to get involved in interdisciplined and multidisciplined team work. 4
    8 To be able to declare his/her opinions orally or written in a clear, concise and brief manner. -
    9 To improve him/herself by following the developments in science, technology, modern issues, and know the importance of lifelong learning. -
    10 To be able to evaluate engineering solutions for the global and social problems especially for the health, safety, and environmental problems. -
    11 To have knowledge about of contemporary issues. 5
    Çankırı Karatekin Üniversitesi  Bilgi İşlem Daire Başkanlığı  @   2017 - Webmaster