CMP3005 Analysis of AlgorithmsBahçeşehir UniversityDegree Programs BANKING AND INSURANCE MANAGEMENT (TURKISH)General Information For StudentsDiploma SupplementErasmus Policy StatementNational QualificationsBologna Commission
BANKING AND INSURANCE MANAGEMENT (TURKISH)
Associate TR-NQF-HE: Level 5 QF-EHEA: Short Cycle EQF-LLL: Level 5

Course Introduction and Application Information

Course Code Course Name Semester Theoretical Practical Credit ECTS
CMP3005 Analysis of Algorithms Fall 3 0 3 6
This catalog is for information purposes. Course status is determined by the relevant department at the beginning of semester.

Basic information

Language of instruction: English
Type of course: Non-Departmental Elective
Course Level: Associate (Short Cycle)
Mode of Delivery: Face to face
Course Coordinator : Dr. Öğr. Üyesi CEMAL OKAN ŞAKAR
Course Lecturer(s): Dr. Öğr. Üyesi TEVFİK AYTEKİN
Prof. Dr. NAFİZ ARICA
Dr. Öğr. Üyesi CEMAL OKAN ŞAKAR
Recommended Optional Program Components: None
Course Objectives: The objective of the course is to introduce the fundamental mathematical tools needed to analyze algorithms, basic algorithm design techniques, advanced data structures, and important algorithms from different problem domains.

Learning Outcomes

The students who have succeeded in this course;
I. Become familiar with some major advanced data structures and algorithms.
II. Become familiar with mathematical tools used in analyzing algorithms.
III. Be able to analyze the asymptotic running time of an (iterative/recursive) algorithm.
IV. Be able to make best/worst/average case analysis of algorithms.
V. Become familiar with important algorithm design paradigms.
VI. Be able to decide which data structure/algorithm among a set of possible choices is best for a particular application.
VII. Be able to recognize and distinguish efficient and inefficient algorithms.
VIII. Be able to design efficient algorithms for new problems using the techniques learned and apply/report these solutions in an intra-discipline project group.

Course Content

Introduction, asymptotic notation, empirical analysis of algorithms, designing algorithms, amortized analysis, brute force algorithms, divide and conquer algorithms, transform and conquer algorithms, space and time trade-offs, dynamic programming, greedy algorithms, advanced data structures, B-trees, Insertion and Deletion from B-trees, graphs and graph algorithms, P, NP, and NP-complete problems.

Weekly Detailed Course Contents

Week Subject Related Preparation
1) Introduction, asymptotic notation.
2) Empirical analysis of algorithms, analysis of algorithms, amortized analysis
3) Recurrences, substitution method, recursion-tree method, master method.
4) Brute Force Algorithms
5) Divide and Conquer Algorithms
6) Merge sort, quicksort, randomized quicksort, binary search
7) Transform and Conquer Algorithms: Solving systems of linear equations with Gaussian ination elimination, Balanced Search Trees, Heaps and Heapsort, Horner's Rule and Binary Exponentiation
8) Space and Time Trade-offs: Input Enhancement (Counting based sorting, string matching), Prestructuring (Hashing, Hash functions, open addressing).
9) Midterm
10) Dynamic Programming: Coin-row problem, Knapsack problem, Longest common subsequence.
11) Dynamic Programming: Knapsack problem, Longest common subsequence.
12) Greedy Algorithms: Activity selection, Huffman codes, Prim’s algorithm, Kruskal’s Algorithm
13) Single-source shortest paths: The Bellman-Ford algorithm, Dijkstra's algorithm.
14) P, NP, and NP-complete problems

Sources

Course Notes / Textbooks: Anany Levitin, The Design and Analysis of Algorithms, Pearson International Third Edition.

Cormen, T. H., Leiserson, C. E., Rivest, R. L. and Stein, C., Introduction to Algorithms (3rd Edition), MIT Press, 2009.

Sanjoy Dasgupta , Christos Papadimitriou, Umesh Vazirani, Algorithms, McGraw-Hill Education.
References: Yok - None

Evaluation System

Semester Requirements Number of Activities Level of Contribution
Quizzes 2 % 10
Project 1 % 20
Midterms 1 % 30
Final 1 % 40
Total % 100
PERCENTAGE OF SEMESTER WORK % 40
PERCENTAGE OF FINAL WORK % 60
Total % 100

ECTS / Workload Table

Activities Number of Activities Workload
Course Hours 14 42
Project 7 21
Quizzes 6 12
Midterms 5 28
Final 5 35
Total Workload 138

Contribution of Learning Outcomes to Programme Outcomes

No Effect 1 Lowest 2 Low 3 Average 4 High 5 Highest
           
Program Outcomes Level of Contribution
1) To have the ability to understand the basic concepts of Banking and Insurance and to be able to use them effectively in business.
2) To have the ability to work individually or in a team when needed on matters related to his/her profession and to follow and apply the developments in his/her sector.
3) To be equipped with the necessary knowledge to carry out the legal responsibilities and to follow the related regulations in their sector.
4) To understand the importance of banking and insurance from the point of the state’s economy and enterprises and to express this importance properly.
5) To be able to use the computer as well as the profession requires and to be able to do work, accumulate knowledge and to use this knowledge relevantly and effectively.
6) To make them gain the ability to find practical solutions for the problems of daily commercial activities and to take correct decisions.
7) To be able to take responsibilities in banking and insurance sector and more generally in the finance sector and to be qualified to start his/her own business after the legal requirements have been met.
8) To have the competency to carry out the accountancy related to banking and insurance.
9) To have the competency to build effective customer relations and to have effective communication and persuasion skills.
10) To be able to determine the accumulated knowledge druring the education in line with the cause and effect relations and to be able to have the necessary professional qualifications to know where, when and how to use his/her knowledge.