PAÜ .:. Eğitim Öğretim Bilgi Sistemi

COURSE INFORMATION

Course Code	Course Title	L+P Hour	Semester	ECTS
CENG 215	DATA STRUCTURES LABORATORY	0 + 2	3rd Semester	3

COURSE DESCRIPTION

Course Level	Bachelor's Degree
Course Type	Compulsory
Course Objective	Aim of this course is to teach students to do the application of theoretical knowledge of data structures course with a selected programming language.
Course Content	Arrays, stacks, queues, binary trees, binary search trees, AVL trees, hash functions, graphs, sorting algorithms
Prerequisites	No the prerequisite of lesson.
Corequisite	CENG 213 DATA STRUCTURES
Mode of Delivery	Face to Face

COURSE LEARNING OUTCOMES

1	Code stack and queue data structures
2	Code trees and basic tree operations like search, add and remove
3	Code hash functions
4	Code graphs and some basic graph operations
5	Code sorting algorithms

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 001	5		4	3	4	5	3		3	2	2
LO 002	5		4	3	4	5	3		3	2	2
LO 003	5		4	3	4	5	3		3	2	2
LO 004	5		4	3	4	5	3		3	2	2
LO 005	5		4	3	4	5	3		3	2	2
Sub Total	25		20	15	20	25	15		15	10	10
Contribution	5	0	4	3	4	5	3	0	3	2	2	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	2	28
Hours for off-the-classroom study (Pre-study, practice)	14	2	28
Mid-terms	1	10	10
Final examination	1	12	12
Total Work Load ECTS Credit of the Course			78 3

COURSE DETAILS

Select Year

Course Details

Course Code	Course Title	L+P Hour	Course Code	Language Of Instruction	Course Semester
CENG 215	DATA STRUCTURES LABORATORY	0 + 2	1	Turkish	2023-2024 Fall

Course Coordinator	E-Mail	Phone Number	Course Location	Attendance
Lecturer ŞEVKET UMUT ÇAKIR	sucakir@pau.edu.tr		MUH A0435	%70

Goals		Aim of this course is to teach students to do the application of theoretical knowledge of data structures course with a selected programming language.
Content		Arrays, stacks, queues, binary trees, binary search trees, AVL trees, hash functions, graphs, sorting algorithms

Topics

Weeks	Topics
1	Repetition of the language to be used
2	Stack operations
3	Doubly linked list operations
4	Binary search tree operations
5	Traversals in binary trees
6	Binary heap operations
7	Repetition of previous topics and questions
8	Binary tree rotate operations
9	Separated chain hashing operations
10	Quadratic probing hashing operations
11	Graph operations
12	Graph operations
13	Graph operations
14	Repetition of previous topics and questions

Materials

Materials are not specified.

Resources

Course Assessment

Assesment Methods	Percentage (%)	Assesment Methods Title
Final Exam	50	Final Exam
Midterm Exam	50	Midterm Exam

L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes

Prospective Student