Akademik Dersler - Tanıtım


Code - Course Title	BİM213 - Data Structures and Algorithms
Course Type	Required Courses
Language of Instruction	İngilizce
Laboratory + Practice	2+2
ECTS	5.5
Course Instructor(s)	DOKTOR ÖĞRETİM ÜYESİ SELCAN KAPLAN BERKAYA
Mode of Delivery	The mode of delivery of this course is face to face.
Prerequisites	There is no prerequisite or co-requisite for this course.
Courses Recomended	Computer Programming I-II
Required or Recommended Resources
Recommended Reading List	Cormen, T. H., Leiserson, C. E., Rivest, R. L., & Stein, C. (2022). Introduction to algorithms. MIT press.
Assessment methods and criteria	1 Midterm Exam, 1 Final Exam, Homeworks, Project, Quizzes. 2 midterms, 1 final
Work Placement	Students are required to do 2 projects
Sustainability Development Goals	Quality Education , Industry, Innovation and Infrastructure

Weeks	Topics
Week - 1	Introduction to Data Structures. Algorithm Analysis Techniques. Asymptotic Notations
Week - 2	Arrays and Simple Sorting Algoritms: Bubble Sort, Selection Sort, Insertion Sort
Week - 3	Recursive Algoritm Design and Analysis
Week - 4	Abstract Data Types Arrays and Contiguous Allocation
Week - 5	Linked Lists and Dynamic Allocation
Week - 6	Linked Lists
Week - 7	Stacks and Queues
Week - 8	Application of Stacks and Queues: Expression Evaluation
Week - 9	Introduction to Trees, Binary Trees - Representation and Traversal
Week - 10	Binary Search Trees
Week - 11	AVL Trees
Week - 12	Splay Trees
Week - 13	B-Trees
Week - 14	Hash Table

Assessment Method and Passing Requirements
	Quamtity	Percentage (%)
1.Midterm Exam	1	30
Homework	1	20
Final Exam	1	50
Toplam (%)		100