Home  »  Faculty of Economics and Administrative Sciences »  Program of Technology and Knowledge Management

COURSE UNIT TITLECOURSE UNIT CODESEMESTERTHEORY + PRACTICE (Hour)ECTS
DATA STRUCTURES AND ALGORITHMS TKM109 First Term (Fall) 3 + 0 6

TYPE OF COURSE UNITCompulsory Course
LEVEL OF COURSE UNITBachelor's Degree
YEAR OF STUDY1
SEMESTERFirst Term (Fall)
NUMBER OF ECTS CREDITS ALLOCATED6
NAME OF LECTURER(S)Associate Professor Nurcan Alkış Bayhan
LEARNING OUTCOMES OF THE COURSE UNIT At the end of this course, the students;
1) Design and analyze simple algorithms.
2) Describes and analyzes elementary sorting algorithms
3) Understand and restate the fundamentals of basic data structures.
4) Comprehend basic ADTs such as stacks, queues, and trees
5) Develops skills in implementations of basic data structures.
MODE OF DELIVERYFace to face
PRE-REQUISITES OF THE COURSENo
RECOMMENDED OPTIONAL PROGRAMME COMPONENT
COURSE DEFINITIONThis course covers various data structures, models and algorithms based on the C programming language. It is a course for programmers or software developers of all levels who develop programs / software, design software for the business world, and want to model mathematical and engineering problems in the computer environment. Data Structures and Algorithms course aims to provide students with the skills of programming at the introductory level, setting up algorithms and understanding its logic.
COURSE CONTENTS
WEEKTOPICS
1st Week Introduction
2nd Week Algorithmic approach and C language
3rd Week Data structures and data models
4th Week Algorithmic Program Design and Flow Charts
5th Week Sorting Algorithms
6th Week Sorting Algorithms
7th Week Searching Algorithms
8th Week Midterm
9th Week Linked Lists and Applictions
10th Week Stack stucture
11th Week Queue Structure
12th Week Tree Data Model
13th Week Tree Data Model Applications
14th Week Evaluation
RECOMENDED OR REQUIRED READINGVeri yapıları ve algoritmalar, Rifat Çölkesen, PapatyaBilim
Data Structures Using C and C++ (2nd Edition), Yedidyah Langsam, Moshe J. Augenstein, Aaron M. Tenenbaum, Prentice Hall
PLANNED LEARNING ACTIVITIES AND TEACHING METHODSLecture,Problem Solving
ASSESSMENT METHODS AND CRITERIA
 QuantityPercentage(%)
Mid-term130
Assignment210
Quiz420
Total(%)60
Contribution of In-term Studies to Overall Grade(%)60
Contribution of Final Examination to Overall Grade(%)40
Total(%)100
ECTS WORKLOAD
Activities Number Hours Workload
Midterm exam12,52,5
Preparation for Quiz4832
Individual or group work14228
Preparation for Final exam12525
Course hours14342
Preparation for Midterm exam12020
Laboratory (including preparation)
Final exam12,52,5
Homework2816
Quiz428
Total Workload176
Total Workload / 305,86
ECTS Credits of the Course6
LANGUAGE OF INSTRUCTIONTurkish
WORK PLACEMENT(S)No
  

KEY LEARNING OUTCOMES (KLO) / MATRIX OF LEARNING OUTCOMES (LO)
LO1LO2LO3LO4LO5
K1  X   X   X   X  
K2    X      
K3  X        
K4         
K5  X   X   X    
K6         
K7         
K8         
K9         
K10         
K11         
K12         
K13         
K14  X   X      
K15  X         X