1. FIRST CYCLE - BACHELOR'S DEGREE
  2. FACULTY OF ECONOMICS & ADMINISTRATIVE SCIENCES
  3. ECONOMETRICS DEPARTMENT
  4. 211 ECONOMETRICS
Course Information Course Learning Outcomes Course's Contribution To Program ECTS Workload Course Details
Print

COURSE INFORMATION
Course CodeCourse TitleL+P HourSemesterECTS
YBS 201DATA STRUCTURES AND ALGORITHMS3 + 13rd Semester5,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 EKNM 111 PRACTICING BASIC INFORMATION TECHNOLOGY
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
Data not found.

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

ECTS Credit of the Course





143

5,5
COURSE DETAILS
 Select Year   


 Course TermNoInstructors
Details 2023-2024 Fall1METE OKAN ERDOĞAN


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 1 Turkish 2023-2024 Fall
Course Coordinator  E-Mail  Phone Number  Course Location Attendance
Lecturer METE OKAN ERDOĞAN meteokan@pau.edu.tr İİBF C0012 %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 Introduction to Data Structures
2 Stacks and Queues
3 Linked Lists
4 Doubly Linked Lists
5 Trees
6 Balanced Trees
7 Binary Search Trees
8 Heap Trees
9 Priority Queues
10 Hash Functions
11 Graphs
12 Graph Operations
13 Sorting Algorithms
14 Sorting Algorithms
Materials
Materials are not specified.
Resources
ResourcesResources Language
Veri Yapıları ve Algoritmalar, R. Çölkesen, Papatya Bilim, 2019.Türkçe
Course Assessment
Assesment MethodsPercentage (%)Assesment Methods Title
Final Exam50Final Exam
Midterm Exam40Midterm Exam
Homework10Homework
L+P: Lecture and Practice
PQ: Program Learning Outcomes
LO: Course Learning Outcomes