CANKIRI KARATEKIN UNIVERSITY Bologna Information System


  • Course Information
  • Course Title Code Semester Laboratory+Practice (Hour) Pool Type ECTS
    Algorithms and Data Structures II BİL202 SPRING 3+0 C 6
    Learning Outcomes
    1- model software based problems
    2- select the most suitable algorithms
    3- understand graph theory and using it in problem solving
    4-use data models in engineering applications
    5- learn state machines and text analysis
    Prerequisites -
    Language of Instruction Turkish
    Responsible Assist.Prof.Dr. Seda ŞAHİN
    Instructors -
    Assistants -
    Resources K1-Gonnet, G. H., (1984) Handbook Algorithms and Data Structure, Addision-Wesley Pub., 1984. K2-Çölkesen, R., Data Structure and Algorithms, Papatya Publishing House, İstanbul, 1999. K3-Çölkesen, R., Algorithm Development and Data Structures, Papatya Publishing House, İstanbul, 2011.
    Supplementary Book -
    Goals to model the problems encountered, selecting the most appropriate algorithms and data models.
    Content Classification of data structures and data models and their basic properties, Summarizing data models: linked list, trees, graphs, state machine data models, State machine data model and sample applications, Word search and application in the text with the state machine. Development of state machine application in a programming language, Introduction to graph theory and representation of graphs: Neighborhood matrix, Graph types and retention of graphs; sample applications, The examination of problems such as graf coloration, shortest path algorithm, path tree, Graf coloring and solving the problem of assignment assignment without overlap, Shortest path algorithms: Dijkstra algorithm behavior, implementation and application of Dijkstra algorithm on the map, Shortest path tree algorithms: Analysis and application of Kruskla algorithm, Calculation of execution time and complexity of algorithms. Big O notation, Compression algorithms and programs, Huffman coding tree and sample application: Frequency of characters usage and Huffman tree creation, Application development and grammar analysis algorithms on Probability Theory
    Çankırı Karatekin Üniversitesi  Bilgi İşlem Daire Başkanlığı  @   2017 - Webmaster