COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 201DATA STRUCTURES3 + 23rd Semester8

COURSE DESCRIPTION
Course Level Bachelor's Degree
Course Type Compulsory
Course Objective The aim of this course is to improve students’ knowledge in algorithms, analysis, basic data structures, data abstraction and representation.
Course Content Fundamental structures such as; recursion, stacks, queues, linked lists and trees, binary trees, binary search trees, guided trees, balanced trees, multiway search trees. B-tree, processes on trees (insertion, searching, deletion, creation), algorithm analysis, sorting and searching algorithms, graphs.
Prerequisites No the prerequisite of lesson.
Corequisite No the corequisite of lesson.
Mode of Delivery Face to face

COURSE LEARNING OUTCOMES
1Explains Array, Stack and Queue concepts
2Explains linked lists
3Trees, binary trees, AVL trees
4Explains Graphs
5Explains sorting algortihms

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 01542 1 322   
LO 02542 1 322   
LO 035  23  1221 
LO 045  23  1221 
LO 055  23  1221 
Sub Total2584611 671063 
Contribution521120112110

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14570
Hours for off-the-classroom study (Pre-study, practice)14456
Assignments51050
Mid-terms11616
Final examination11616
Total Work Load

ECTS Credit of the Course






208

8

COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2018-2019 Fall1ŞEVKET UMUT ÇAKIR
Details 2018-2019 Fall2ŞEVKET UMUT ÇAKIR
Details 2018-2019 Fall3ŞEVKET UMUT ÇAKIR

Course Details
Course Code:  CENG 201 Course Title:  DATA STRUCTURES
L+P Hour : 3 + 2   Course Code : 1   Language Of Instruction: Turkish Course Semester :  2018-2019 Fall
Course Coordinator :  LECTURER ŞEVKET UMUT ÇAKIR E-Mail:  sucakir@pau.edu.tr Phone Number : 
Course Location MUH A0327, MUH A0435,
Goals : The aim of this course is to improve students’ knowledge in algorithms, analysis, basic data structures, data abstraction and representation.
Content : Fundamental structures such as; recursion, stacks, queues, linked lists and trees, binary trees, binary search trees, guided trees, balanced trees, multiway search trees. B-tree, processes on trees (insertion, searching, deletion, creation), algorithm analysis, sorting and searching algorithms, graphs.
Attendance : %
Topics
WeeksTopics
1 Review of the programmıng language to be used in the course
2 Arrays
3 Stacks
4 Queues
5 Linked lists
6 Doubly linked lists
7 Trees
8 Binary Trees
9 AVL Trees
10 B Trees
11 Graphs
12 Graphs
13 Sorting Algorithms
14 Sorting Algorithms
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam40Final Exam
Midterm Exam35Midterm Exam
Homework25Homework
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes
© 2021 PAU