Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
-1BLP203Data Structures3+0+035

Course Details
Language of Instruction Turkish
Level of Course Unit Associate Degree
Department / Program Computer Programming
Mode of Delivery Face to Face
Type of Course Unit Elective
Objectives of the Course One of the most basic subjects of programming is to understand data structures and algorithms defined on them.
Course Content Algorithm analysis (Big O Notation, Omega and Theta Notations), search and sorting algorithms, LinkedList, Stack data structure, Queue data structure, Trees, Huffman compression algorithm and Heap data structure, Graph algorithms.
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Instructor Zeki ÇIPLAK zeki.ciplak@gedik.edu.tr
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Algorithms and Data Structures by Kurt Mehlhorn and Peter Sanders, Springer, 2008.


Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
Veri yok

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 14 3 42
Mid-terms 1 1 1
Laboratory 14 1 14
Project 14 2 28
Final examination 1 1 1
Total Work Load   Number of ECTS Credits 4 128

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Knowledge of basic data types
2 To be able to compare algorithms with algorithm analysis and measure their performance.
3 Learning the linked list structure and developing applications with linked lists.
4 Learning the stack structure and developing applications with stacks.
5 Learning the queue data structure and developing an application with the queue data structure.
6 Fundamentally, to have knowledge about the concept of Tree and especially to be able to perform applications about Binary Search Trees.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Introduction to Java Programming Language
2 Conditional expressions, type conversions, use of basic java libraries in Java
3 Arrays and Loops in Java
4 Introduction to Collections and Classes in Java
5 Inheritance, Encapsulation, Polymorphism in Java
6 Introduction to Algorithm Analysis and Notations
7 Linkedlists
8 Stacks
9 Queues
10 Search Algorithms
11 Sort Algorithms
12 Trees
13 Huffman Tree and Heap
14 Graph Algorithms


Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10
All 4 5 4 4 2 5 3 2 2 4
C1 4 5 4 4 2 5 3 2 2 4
C2 4 5 4 4 2 5 3 2 2 4
C3 4 5 4 4 2 5 3 2 2 4
C4 4 5 4 4 2 5 3 2 2 4
C5 4 5 4 4 2 5 3 2 2 4
C6 4 5 4 4 2 5 3 2 2 4

bbb


https://obs.gedik.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=113561&curProgID=44&lang=en