Course Information
SemesterCourse Unit CodeCourse Unit TitleT+P+LCreditNumber of ECTS CreditsLast Updated Date
4BBM202ALGORITHMS3+0+03406.09.2024

 
Course Details
Language of Instruction English
Level of Course Unit Bachelor's Degree
Department / Program COMPUTER ENGINEERING
Type of Program Formal Education
Type of Course Unit Compulsory
Course Delivery Method Face To Face
Objectives of the Course The goal of this course is to teach student how to develop algorithms in order to solve the complex problems in the most efficient way.
Course Content Analysis of algorithms, sorting, searching, graph algorithms, and string processing
Course Methods and Techniques Lecture, Problem Solving
Prerequisites and co-requisities ( BBM201 ) and ( BBM204 ) and ( BBM203 )
Course Coordinator None
Name of Lecturers Associate Prof.Dr. Adnan Özsoy
Assistants None
Work Placement(s) No

Recommended or Required Reading
Resources Algorithms, 4th Edition, R. Sedgewick and K. Wayne, Addison-Wesley Professional, 2011
Course Notes 1. Horowitz E., Sahni S., Anderson S.,””Fundamentals of Data Structures in C”, Computer Scince Press, New York, 1993
2. Horowitz E., Sahni S., Mehta D.,”Fundamentals of Data Structures in C++”, Computer Scince Press, New York, 1995


Planned Learning Activities and Teaching Methods
Activities are given in detail in the section of "Assessment Methods and Criteria" and "Workload Calculation"

Assessment Methods and Criteria
In-Term Studies Quantity Percentage
Midterm Exam 2 % 55
Attendance 1 % 5
Final examination 1 % 40
Total
4
% 100

 
ECTS Allocated Based on Student Workload
Activities Quantity Duration Total Work Load
Course Duration 14 3 42
Hours for off-the-c.r.stud 12 1 12
Preparation for Midterm Exam 2 20 40
General Exam Preparation 1 26 26
Total Work Load   Number of ECTS Credits 4 120

 
Course Learning Outcomes: Upon the successful completion of this course, students will be able to:
NoLearning Outcomes
1 The students are expected to develop a foundational understanding and knowledge of key concepts that underly important algorithms in use on computers today.
2
3
4
5
6
7
8

 
Weekly Detailed Course Contents
WeekTopicsStudy MaterialsMaterials
1 Analysis of Algorithms
2 Elementary Sorting Algorithms
3 Quicksort and Heapsort
4 Elementary Search Algorithms, Binary Search Trees
5 Balanced Trees
6 First Midterm Exam
7 Hashing, Search Applications
8 Undirected Graphs, Directed Graphs
9 Minimum Spanning trees
10 Second Midterm Exam
11 Shortest Path
12 String Sorting
13 Substring Search
14 Data Compression
15 Final Exam Preparation
16 Final Exam

 
Contribution of Learning Outcomes to Programme Outcomes
P1 P2 P3 P4 P5 P6 P7 P8 P9 P10 P11 P12
All 4 4 4 4 3 3 3 4 3 3 2
C1
C2
C3
C4
C5
C6
C7
C8

  Contribution: 1: Very Slight 2:Slight 3:Moderate 4:Significant 5:Very Significant

  
  https://bilsis.hacettepe.edu.tr/oibs/bologna/progCourseDetails.aspx?curCourse=2687579&lang=en