Pamukkale University
University is the guide to life
Welcome to PAU;
Prospective Student
Our Students
Our Staff
TR
Information Package & Course Catalogue
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
FIRST CYCLE - BACHELOR'S DEGREE
FACULTY OF ECONOMICS & ADMINISTRATIVE SCIENCES
MANAGEMENT INFORMATION SYSTEMS DEPARTMENT
220 MANAGEMENT INFORMATION SYSTEMS (Evening Classes))
Course Information
Course Learning Outcomes
Course's Contribution To Program
ECTS Workload
Course Details
Print
COURSE INFORMATION
Course Code
Course Title
L+P Hour
Semester
ECTS
YBS 201
DATA STRUCTURES AND ALGORITHMS
3 + 1
3rd Semester
5
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
Explains trees, binary trees and AVL trees
4
Explains Graphs
5
Explains sorting and searching 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 001
5
4
5
5
5
5
LO 002
1
1
1
1
1
1
5
5
5
5
5
5
LO 003
4
4
3
5
5
4
LO 004
5
5
5
5
4
4
LO 005
4
4
4
5
3
3
Sub Total
1
1
1
1
1
1
23
22
22
25
22
21
Contribution
0
0
0
0
0
0
5
4
4
5
4
4
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
4
56
Hours for off-the-classroom study (Pre-study, practice)
14
3
42
Assignments
2
5
10
Mid-terms
1
8
8
Final examination
1
14
14
Total Work Load
ECTS Credit of the Course
130
5
COURSE DETAILS
Select Year
All Years
2023-2024 Fall
2022-2023 Fall
2021-2022 Fall
2020-2021 Summer
2020-2021 Fall
2019-2020 Summer
2019-2020 Fall
2018-2019 Fall
2017-2018 Fall
2016-2017 Fall
Course Term
No
Instructors
Details
2019-2020 Fall
3
ERKAN 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
3
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
Weeks
Topics
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
Resources
Resources Language
Weiss, M. A., Data Structures ad Algorithm Analysis in Java, 3rd Ed., Pearson Education, 2012
English
Yıldız O. T., C && Java ile Veri Yapılarına Giriş, Boğaziçi Üniversitesi Yayınevi, 2013
Türkçe
Course Assessment
Assesment Methods
Percentage (%)
Assesment Methods Title
Final Exam
60
Final Exam
Midterm Exam
40
Midterm Exam
L+P:
Lecture and Practice
PQ:
Program Learning Outcomes
LO:
Course Learning Outcomes
{1}
##LOC[OK]##
{1}
##LOC[OK]##
##LOC[Cancel]##
{1}
##LOC[OK]##
##LOC[Cancel]##
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