ADVANCED PROGRAMMING TECHNIQUES

EEM120

Course Code: EEM120
Semester: Second Term (Spring)
Theory+Practice: 2 + 3
ECTS: 7

Course Type

Compulsory Course

Course Level

Bachelor's Degree

Year of Study

Semester

Second Term (Spring)

ECTS

Name of Lecturer(s)

Assistant Professor Emre Öner Tartan

Learning Outcomes

At the end of this course, the students;

To gain the ability of analyzing and designing of algorithms and using existing algorithms.
To gain the ability to write generalized codes and data abstraction in software development.
To gain the ability to separating big problems in to smaller sub parts for solving.
To learn the concept behind the complexity theory and gain the ability to develop appropriate software
To gain multidiciplinary working ability.

Mode of Delivery

Face to face

Prerequisites

Yes(BİL101)

Recommended Optional Programme Components

It is recommended for the student to take BİL101 and BİL105 courses before.

Course Description

Following topics are covered in this course: Analyzing and designing of algorithms and using existing algorithms. To gain the ability to write generalized codes and data abstraction in software development Separating big problems in to smaller sub parts for solving. To learn the concept behind the complexity theory and gain the ability to develop appropriate software

Course Contents

WEEK	TOPICS
1^st Week	Introduction: Review, two dimensional arrays.
2^nd Week	Class, Data types, Abstract Data Types (ADT)
3^rd Week	Pointers. First laboratory work
4^th Week	Strings, transformations, functions.
5^th Week	Parameter Transition methods, Macros and command line arguments
6^th Week	Structs and Recursive functions
7^th Week	Bitwise operations. Second laboratory work
8^th Week	MIDTERM
9^th Week	List class, list member functions and examples, implementation of iterators and usage with lists. Examples. Third laboratory work
10^th Week	Stack data structure. Stack class, member functions. Using and working with stacks. Examples
11^th Week	Introduction to Queues. Queue class and functions. Working and using queues. Examples. Fourth laboratory work.
12^th Week	Priority queues. Working with priority queues. Member functions. Radix sort algorithm. Examples
13^th Week	Dynamic data structures. Introduction to linked lists. Linked list applications. Doubly linked lists. Circular linked lists. Examples. Fifth laboratory work
14^th Week	Trees. Binary search trees. Designing and developing trees. Tree traversal. Searching, traversing, adding deleting in tree structure

Recommended or Required Reading

Data Structures with C++ Using STL, 2/E?,William H. Ford, William R. Topp, Prentice Hall

Planned Learning Activities and Teaching Methods

Lecture
Presentation
Questions/Answers

Assessment Methods and Criteria

	Quantity	Percentage (%)
Mid-term	1	30
Quiz	4	10
Practice	6	20
Total(%)		60
Contribution of In-term Studies to Overall Grade(%)		60
Contribution of Final Examination to Overall Grade(%)		40
Total(%)		100

ECTS Allocated Based on Student Workload

Activities	Quantity	Duration (Hour)	Total Workload (Hour)
Midterm exam	1	2	2
Preparation for Quiz	3	10	30
Individual or group work	0	0	0
Preparation for Final exam	1	40	40
Course hours	5	1	5
Preparation for Midterm exam	1	30	30
Laboratory (including preparation)	6	12	72
Final exam	1	2	2
Homework	2	15	30
Total Work Load			211
Total Work Load / 30 (h)			7.03
ECTS Credit of the Course			7

Language of Instruction

Turkish

Work Placement(s)

Programme Qualifications / Learning Outcomes

	LO1	LO2	LO3	LO4	LO5
K1	X	X	X	X
K2	X	X	X	X
K3	X	X
K4	X	X	X	X
K5
K6
K7					X
K8				X	X
K9
K10
K11					X