Menu
PAU Home Page
Menu
Information Package & Course Catalogue
FIRST CYCLE - BACHELOR'S DEGREE
.
FACULTY OF ENGINEERING
.
COMPUTER ENGINEERING DEPARTMENT
.
253 Computer Engineering (2014)
Course Information
|
Course Learning Outcomes
|
Course's Contribution To Program
|
ECTS Workload
|
Course Details
COURSE INFORMATION
Course Code
Course Title
L+P Hour
Semester
ECTS
CENG 201
DATA STRUCTURES
3 + 2
3rd Semester
8
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
1
Explains Array, Stack and Queue concepts
2
Explains linked lists
3
Trees, binary trees, AVL trees
4
Explains Graphs
5
Explains sorting algortihms
COURSE'S CONTRIBUTION TO PROGRAM
PO 01
PO 02
PO 03
PO 04
PO 05
PO 06
PO 07
PO 08
PO 09
PO 10
PO 11
PO 12
LO 01
5
4
2
1
3
2
2
LO 02
5
4
2
1
3
2
2
LO 03
5
2
3
1
2
2
1
LO 04
5
2
3
1
2
2
1
LO 05
5
2
3
1
2
2
1
Sub Total
25
8
4
6
11
6
7
10
6
3
Contribution
5
2
1
1
2
0
1
1
2
1
1
0
ECTS ALLOCATED BASED ON STUDENT WORKLOAD BY THE COURSE DESCRIPTION
Activities
Quantity
Duration (Hour)
Total Work Load (Hour)
Course Duration (14 weeks/theoric+practical)
14
5
70
Hours for off-the-classroom study (Pre-study, practice)
14
4
56
Assignments
5
10
50
Mid-terms
1
16
16
Final examination
1
16
16
Total Work Load
ECTS Credit of the Course
208
8
COURSE DETAILS
Select Year
All Years
2018-2019 Fall
2017-2018 Fall
2016-2017 Fall
2015-2016 Fall
2014-2015 Fall
2013-2014 Fall
2012-2013 Fall
2011-2012 Fall
2010-2011 Fall
2009-2010 Fall
2008-2009 Fall
Course Term
No
Instructors
Details
2018-2019 Fall
1
ŞEVKET UMUT ÇAKIR
Details
2018-2019 Fall
2
ŞEVKET UMUT ÇAKIR
Details
2018-2019 Fall
3
Ş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
Weeks
Topics
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 Methods
Percentage (%)
Assesment Methods Title
Final Exam
40
Final Exam
Midterm Exam
35
Midterm Exam
Homework
25
Homework
L+P:
Lecture and Practice
PQ:
Program Learning Outcomes
LO:
Course Learning Outcomes
Home Page
About University
Name And Address
Acedemic Authorities
General Discription
Academic Calendar
General Admission Requirements
Recognition of Prior Learning
General Registration Procedures
ECTS Credit Allocation
Academic Guidance
Information For Students
Cost Of Living
Accommodation
Meals
Medical Facilities
Facilities for Special Needs Students
Insurance
Financial Support for Students
Student Affairs
Learning Facilities
International Programs
Language Courses
Internships
Sports Facilities and Leisure Activities
Student Associations
Practical Information for Mobile Students
Degree Programmes