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
SEN2212	Data Structures and Algorithms II	Spring	2	2	3	7

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 :	Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR
Course Lecturer(s):	Dr. Öğr. Üyesi BETÜL ERDOĞDU ŞAKAR Dr. Öğr. Üyesi YÜCEL BATU SALMAN RA SEVGİ CANPOLAT RA MERVE ARITÜRK
Recommended Optional Program Components:	None
Course Objectives:	The objective of this course is to analyze data structures and algorithms used in software engineering in detail. After completing the course, the student will have knowledge of applying, implementing and analysis of data structures, including, trees, binary search trees, balanced search trees, heaps and graphs. Certain fundamental techniques, such as sorting, hashing and greedy algorithms are also taught.

Learning Outcomes

The students who have succeeded in this course;
The students who have succeeded in this course;
1) Describe and apply basic object oriented programming principles.
2) Implement basic data structures such as trees, binary search trees, balanced search trees, heaps and graphs.
3) Describe and implement sorting algorithms on common data structures.
4) Describe and implement searching algorithms on common data structures.
5) Implement and use hashing algorithms.
6) Implement and use greedy algorithms.
7) Choose and design data structures for writing efficient programs.

Course Content

The course content is composed of basic data structures like trees, binary search trees, balanced search trees, heaps, graphs and sorting, hashing and greedy algorithms.

Weekly Detailed Course Contents

Week	Subject	Related Preparation
1)	Introduction and Sorting Algorithms.	Sorting algorithms.
2)	Introduction to different tree structures.	Trees.
3)	Introduction to binary search trees.	Binary search trees.
4)	Implementing binary search tree using Java.	Binary search trees.
5)	Introduction to balanced trees and implementing AVL balanced tree structure using Java.	AVL trees.
6)	Using other balanced tree structure using Java.	Other balanced trees.
7)	Using heap structure and implementing them using Java.	Heap.
8)	Using heaps as priority queues. Midterm.	Heap.
9)	Analyzing and implementing hashing algorithms.	Hashing algorithms.
10)	Analyzing and implementing graph structure using Java.	Graph.
11)	Analyzing and implementing graph algorithms.	Graph algorithms.
12)	Analyzing and implementing greedy algorithms.	Greedy algorithms.
13)	Analyzing and implementing greedy algorithms. Quiz.	Greedy algorithms.
14)	Review.

Sources

Course Notes / Textbooks:	Data Structures & Problem Solving Using Java (Mark Allen Weiss) Data Structures and Algorithm Analysis in Java (Mark Allen Weiss) Data Structures and Abstractions with Java (Frank Carrano)
References:	Yok.

Evaluation System

Semester Requirements	Number of Activities	Level of Contribution
Application	4	% 10
Quizzes	1	% 10
Project	1	% 15
Midterms	1	% 25
Final	1	% 40
Total		% 100
PERCENTAGE OF SEMESTER WORK		% 45
PERCENTAGE OF FINAL WORK		% 55
Total		% 100

ECTS / Workload Table

Activities	Number of Activities	Duration (Hours)	Workload
Course Hours	14	2	28
Laboratory	14	2	28
Study Hours Out of Class	12	2	24
Project	10	2	20
Homework Assignments	2	5	10
Quizzes	5	2	10
Midterms	5	3	15
Final	10	3	30
Total Workload			165

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