bursa bayan escort bursa bayan escort- escort bayan konya- escort bayan mersin- şahin k porno- bursa escort- liseli ifşa porno- seks hikayeleri Mühendislik Mimarlık Fakültesi - Bolumderslericerik Muhendislik
Course unit title Level of course unit Course unit code Type of course unit L+R C ECTS
Algorithm Design and Analysis BIM-302 Compulsory 6 3 6

Description of course unit

Prerequisites and course requisities BM-203
Language of instruction Turkish
Coordinator
Lecturer(s)
Teaching assitant(s)
Mode of delivery Face to face
Course objective Learn the asymptotic notations used in modelling the runtime of algorithms, understand the importance of divide and conquer approach, model the runtime of sorting algorithms, learn the concepts of median and order statistics, model the runtime of procedures belonging to heap and priority queue data structures, analyse the sorting algorithms having linear runtime, learn the dynamic programming approaches and Greedy algorithms, analyse amortised analysis and its applications.
Course description

Course contents

1- Introduction: Algorithm design, algorithm analysis
2- Asymptotic notation
3- Divide and conquer approach
4- Sorting algorithms
5- Sorting algorithms
6- Median and order statistics
7- Heap, priority queue data structures
8- Sorting in linear time
9- Dynamic programming approaches
10- Dynamic programming approaches
11- Greedy algorithms: activity selection problem, Huffman codes
12- Greedy algorithms: task scheduling problem
13- Amortised analysis
14- Review
15-
16-
17-
18-
19-
20-

Learning outcomes of the course unit

1- Gains a powerful knowledge in the area of algorithm design and analysis.
2- Understands the rationale in development of asymptotic notations.
3- Learns the benefits of using divide and conquer approach in designing algorithms.
4- Can model the runtime of any sorting algorithm.
5- Learns the concepts of median and order statistics.
6- Can model the runtime of procedures belonging to heap and priority queue data structures.
7- Understands the circumstances where sorting process runs in linear time.
8- Understands the rationale in development of dynamic programming approaches and Greedy algorithms.
9- Learns the amortised analysis and its applications.
10-