At the end of this course, the students; 1) Will be able to learn about the basic data structures and algorithms that is used computer programs, 2) Will be able to use appropriate data structures to develop computer programs, 3) Will be able to design and develop basic algorithms.
MODE OF DELIVERY
Face to face
PRE-REQUISITES OF THE COURSE
No
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
There is no recommended optional programme component for this course.
COURSE DEFINITION
To give students the data types and structure that are used in computer applications and to ensure that they can design basic algorithm structures. For this purpose enhance student skills in concepts such as control structures, loops, operators, functions, arrays, lists, tree structures and algorithm.
COURSE CONTENTS
WEEK
TOPICS
1st Week
Declarations, operators, basic data structures
2nd Week
Program control structures and loop structure
3rd Week
Functions
4th Week
Arrays
5th Week
Pointers
6th Week
Structures
7th Week
Unions
8th Week
Mid-term
9th Week
File Handling
10th Week
Bitwise operations
11th Week
Linked lists , stacks, queues, trees
12th Week
Algorithm complexity
13th Week
Sorting algorithms
14th Week
Basis of charts
RECOMENDED OR REQUIRED READING
1) Lecture Notes 2) Vatansever, F. (2011). Algoritma Geliştirme ve Programlamaya Giriş. Ankara: Seçkin Yayıncılık. 3) Çölkesen, R. (2011). Algoritma Geliştirme ve Veri Yapıları. Ankara : Papatya Yayıncılık. 4) Mehlhorn , K. & Sanders, P.(2010) Algorithms and Data Structures: The Basic Toolbox. Germany: Springer
PLANNED LEARNING ACTIVITIES AND TEACHING METHODS
Lecture,Practice,Other
ASSESSMENT METHODS AND CRITERIA
Quantity
Percentage(%)
Mid-term
1
20
Assignment
5
25
Quiz
1
5
Total(%)
50
Contribution of In-term Studies to Overall Grade(%)
50
Contribution of Final Examination to Overall Grade(%)
50
Total(%)
100
LANGUAGE OF INSTRUCTION
Turkish
WORK PLACEMENT(S)
No
KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
