Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS Credits
3BİL201Data Structures3+0+035

Course Details
Language of Instruction Turkish
Level of Course Unit Bachelor's Degree
Department / Program Computer Engineering
Mode of Delivery Face to Face
Type of Course Unit Compulsory
Objectives of the Course The objective of this course unit is to discuss the problems of data structures that are used in programming languages, to acquire skills in designing in C, represent data in memory, studey declaration in C-based programming languages, and use complex data structures to solve practical problems.
Course Content Primitive and complex data structures, arrays, representation arrays in memory, multidimentional arrays, records, linked lists, stacks and queues, representation stacks and queues using arrays and linked lists, graphs, trees, binery trees, problems of sorting and searching.
Course Methods and Techniques
Prerequisites and co-requisities None
Course Coordinator None
Name of Lecturers Asist Prof. Şerife Esra Dinçer
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Sahni S. "Data Structures, Algorithms , and Applications in C++", McGraw-hill, 2005.
Lectures, Question-Answer, Project.
Bir grup projesi
Vize ve Final Sınavları

Course Category
Mathematics and Basic Sciences %0
Engineering %10
Engineering Design %10
Social Sciences %0
Education %0
Science %0
Health %0
Field %80

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
In-Term Studies Quantity Percentage
Mid-terms 1 % 20
Project 1 % 20
Final examination 1 % 60
Total
3
% 100

 
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 2 2
Practice 14 2 28
Laboratory 14 2 28
Project 1 10 10
Final examination 1 2 2
Total Work Load   Number of ECTS Credits 5 154

Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 Acquire skills for examining data structures, concepts and related topics.
2 Apply data structures by using C-based programming languages.
3 Use data structures for solving engineering problems.
4 Design linked lists, queues and staks.
5 Construct a tree structure.


Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Intruduction. Data structures and algorithms, Primitive data structures.
2 Arrays and pointers. Representation arrays in memory, declaration in C, and application.
3 Multidimentional arrays.
4 Dynamic data allocation.
5 Linear structures and linked lists, Functions to operate on linked lists.
6 Stacks, Operations on stacks, Practical applications.
7 Review.
8 Midterm exam.
9 Queues, Representation queues as arrays and as linked lists, applications.
10 Double linked lists, Circular lists, Operational functions, Trees and tree-like structures, Representation using linked list principles.
11 Binary trees, Binary tree representation of arithmetical expressions.
12 Traversal functions on binery trees.
13 Representation linear lists as binary trees. Sorting and searching algorithms.
14 Review.


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

bbb


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