Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YBS 201DATA STRUCTURES AND ALGORITHMS3 + 13rd 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), 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 and AVL trees
4Explains Graphs
5Explains sorting and searching algortihms

COURSE'S CONTRIBUTION TO PROGRAM
PO 01PO 02PO 03PO 04PO 05PO 06PO 07PO 08PO 09PO 10PO 11PO 12
LO 001      545555
LO 002111111555555
LO 003      443554
LO 004      555544
LO 005      444533
Sub Total111111232222252221
Contribution000000544544

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

ECTS Credit of the Course






130

5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2019-2020 Fall2ERKAN YEŞİL


Print

Course Details
Course Code Course Title L+P Hour Course Code Language Of Instruction Course Semester
YBS 201 DATA STRUCTURES AND ALGORITHMS 3 + 1 2 Turkish 2019-2020 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Lecturer ERKAN YEŞİL eyesil@pau.edu.tr İİBF B0213 %70
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.
Topics
WeeksTopics
1 Review of the programmıng language to be used in the course
2 Stacks and Queues
3 Linked Lists
4 Doubly Linked Lists
5 Trees
6 Balanced Trees
7 B Trees
8 Heap Trees
9 Priority Queues
10 Hash Functions
11 Graphs
12 Graphs
13 Sorting Algorithms
14 Sorting Algorithms
Materials
Materials are not specified.
Resources
ResourcesResources Language
Weiss, M. A., Data Structures ad Algorithm Analysis in Java, 3rd Ed., Pearson Education, 2012English
Yıldız O. T., C && Java ile Veri Yapılarına Giriş, Boğaziçi Üniversitesi Yayınevi, 2013Türkçe
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