COURSE SYLLABUS

ADVANCED DATA STRUCTURES

1	Course Title:	ADVANCED DATA STRUCTURES
2	Course Code:	BMB3013
3	Type of Course:	Optional
4	Level of Course:	First Cycle
5	Year of Study:	3
6	Semester:	5
7	ECTS Credits Allocated:	5
8	Theoretical (hour/week):	3
9	Practice (hour/week) :	0
10	Laboratory (hour/week) :	0
11	Prerequisites:
12	Recommended optional programme components:	None
13	Language:	Turkish
14	Mode of Delivery:	Face to face
15	Course Coordinator:	Dr. Ögr. Üyesi CEYDA NUR ÖZTÜRK
16	Course Lecturers:
17	Contactinformation of the Course Coordinator:	ceydanur@uludag.edu.tr
18	Website:
19	Objective of the Course:	To teach the design of data structures such as trees, sets, maps, heaps, and graphs and their use for the purposes of searching, sorting, traversal, compression, and indexing. To examine the proposed solutions to some practically encountered computational problems with appropriate data structures and algorithms. To enable development of applications with C++ language in this context.
20	Contribution of the Course to Professional Development

Learning Outcomes:

1	Being able to program C++ applications which involve the examined data structures;;
2	Being able to decide the appropriate data structure and algorithm to solve a problem efficiently;;
3	Being able to compute space and time complexities at elementary level;;
4	Being able to randomly access data elements using various hashing techniques;;
5	Being able to accelerate searches with indexing methods;;
6	Being able to model complex problems with graphs;;
7	Being able to use efficient algorithms that manipulate the examined data structures;;
8	Having knowledge about searching, sorting, traversal, and compression algorithms;;
9	Being able to distinguish between the different techniques that are used in algorithms;;

22	Course Content:

Week	Theoretical	Practical
1	Basic data structures and operations, Introduction to complexity analysis
2	C++ programming: pointers, reference variables, classes
3	C++ programming: templates, overloading, standard template library
4	Binary search trees, AVL trees, Red black trees
5	B trees, B* trees, B+ trees
6	Hashing techniques, Static and dynamic collision resolution methods
7	Extendible hashing, Linear hashing
8	Indexing methods, Spatial indexing, K-d trees
9	Heaps, d-heaps, Leftist heaps, Skew heaps
10	Graphs, Graph traversal, Shortest path algorithms
11	Topological sort, Networks, Minimum spanning trees
12	Disjoint sets and union find, Exact and approximate string matching algorithms
13	Searching and sorting algorithms, internal and external approaches
14	Compression algorithms, Review of algorithm design techniques

23	Textbooks, References and/or Other Materials:	1. Drozdek, A., Data structures and algorithms in C++, 2013, 4th Edition, Cengage Learning, ISBN-13: 9781133608424. 2. Weiss M., Data structures and algorithm analysis in C++, 2014, 4th Edition, Pearson Education, ISBN-13: 9780132847377.
24	Assesment

TERM LEARNING ACTIVITIES	NUMBER	PERCENT
Midterm Exam	1	10
Quiz	0	0
Homeworks, Performances	5	30
Final Exam	1	60
Total	7	100
Contribution of Term (Year) Learning Activities to Success Grade		40
Contribution of Final Exam to Success Grade		60
Total		100
Measurement and Evaluation Techniques Used in the Course	programming assignments, written exams
Information

ECTS / WORK LOAD TABLE

CONTRIBUTION OF LEARNING OUTCOMES TO PROGRAMME QUALIFICATIONS

LO: Learning Objectives

PQ: Program Qualifications

Contribution Level:

1 Very Low

2 Low

3 Medium

4 High

5 Very High