1. FIRST CYCLE - BACHELOR'S DEGREE
  2. FACULTY OF ENGINEERING
  3. COMPUTER ENGINEERING DEPARTMENT
  4. 253 Computer Engineering
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
CENG 213DATA STRUCTURES3 + 03rd Semester5

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), hashing algorithms, 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
3Explains trees, binary trees, AVL trees
4Explains hash functions
5Explains graphs
6Explains sorting algorithms

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 0015 323   321 
LO 0025 333   321 
LO 00351333   321 
LO 00451333   321 
LO 00551333   321 
LO 00651333   321 
Sub Total304181718   18126 
Contribution513330003210

ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
ActivitiesQuantityDuration (Hour)Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)14342
Assignments51365
Mid-terms11111
Final examination11212
Total Work Load

ECTS Credit of the Course





130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Fall1ŞEVKET UMUT ÇAKIR
Details 2023-2024 Fall2ŞEVKET UMUT ÇAKIR


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
CENG 213 DATA STRUCTURES 3 + 0 1 Turkish 2023-2024 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Lecturer ŞEVKET UMUT ÇAKIR sucakir@pau.edu.tr MUH A0327 %60
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), hashing algorithms, algorithm analysis, sorting and searching algorithms, graphs.
Topics
WeeksTopics
1 Recalling the programming language to be used
2 Stacks and queues
3 Linked lists
4 Trees
5 Balanced trees
6 Binary heap and Huffman trees
7 2-3 and B trees
8 Hashing
9 Graphs
10 Graphs
11 Graph algorithms
12 Graph algorithms
13 Sorting algorithms
14 Sorting algorithms
Materials
Materials are not specified.
Resources
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam60Final Exam
Midterm Exam40Midterm Exam
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes