ADVERTISING
Bachelor	TR-NQF-HE: Level 6	QF-EHEA: First Cycle	EQF-LLL: Level 6

Course Introduction and Application Information

Course Code	Course Name	Semester	Theoretical	Practical	Credit	ECTS
CMP3005	Analysis of Algorithms	Spring	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:	Bachelor’s Degree (First Cycle)
Mode of Delivery:	Face to face
Course Coordinator :	Assist. Prof. CEMAL OKAN ŞAKAR
Course Lecturer(s):	Assist. Prof. TEVFİK AYTEKİN Prof. Dr. NAFİZ ARICA Assist. Prof. 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 be able to apply theoretical concepts related to mass communication, consumer behavior, psychology, persuasion,sociology, marketing, and other related fields to understand how advertising and brand communication works in a free-market economy.	2
2)	To be able to critically discuss and interpret theories, concepts, methods, tools and ideas in the field of advertising.	2
3)	To be able to research, create, design, write, and present an advertising campaign and brand strategies of their own creation and compete for an account as they would at an advertising agency.	2
4)	To be able to analyze primary and secondary research data for a variety of products and services.	2
5)	To be able to develop an understanding of the history of advertising as it relates to the emergence of mass media outlets and the importance of advertising in the marketplace.	2
6)	To be able to follow developments, techniques, methods, as well as research in advertising field; and to be able to communicate with international colleagues in a foreign language. (“European Language Portfolio Global Scale”, Level B1)	2
7)	To be able to take responsibility in an individual capacity or as a team in generating solutions to unexpected problems that arise during implementation process in the Advertising field.	3
8)	To be able to understand how advertising works in a global economy, taking into account cultural, societal, political, and economic differences that exist across countries and cultures.	2
9)	To be able to approach the dynamics of the field with an integrated perspective, with creative and critical thinking, develop original and creative strategies.	2
10)	To be able to to create strategic advertisements for print, broadcast, online and other media, as well as how to integrate a campaign idea across several media categories in a culturally diverse marketplace.	2
11)	To be able to use computer software required by the discipline and to possess advanced-level computing and IT skills. (“European Computer Driving Licence”, Advanced Level)	2
12)	To be able to identify and meet the demands of learning requirements.	2
13)	To be able to develop an understanding and appreciation of the core ethical principles of the advertising profession.	2