Download presentation

Presentation is loading. Please wait.

1
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.1 TDDB57 – DALG-C Examination Requirements

2
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.2 Overview: Complexity Analysis [G&T] 4.2 ; Fö 1-2 ; Le1 Stacks and Queues [G&T] 5.1, 5.2; Fö 3 ; Le2 ADTMap&Dictionary, Hashing, Skip Lists [G&T] 9.1-9.4.1; Fö 4; Le 2 Trees, Search Trees, [G&T] 7.1-7.3;10.1-10.4; Fö 5-7;Le3 Priority Queues, Heaps, Union/Find [G&T]8.1-8.3, 11.6.2; Fö7;Le3 Sorting and Selection [G&T] 3.1.2,11.1-11.5,11.7; Fö 8-10 ; Le 4 Graphs [G&T] 13.1-13.4; Fö 11 ; Le 5 [G&T]: Goodrich and Tamassia 4 th edition [Le] : on-line lektion’s material [Fö]: on-line slides

3
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.3 Complexity Analysis: Order Notation: O, , –[G&T] 4.2.3-4.2.4; Definitions and intuitions of asymptotic analysis; Analysis of algorithms, recurrence equations –[G&T] 4.25, 6.1.5, 11.1.5; Finding complexity of given iterative/recursive algorithms Cases: worst case, expected, amortized analysis

4
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.4 Stacks and Queues: Stack –ADT [G&T] 5.1.1 –Implementations [G&T] 5.1.2, 5.1.3 –Applications [G&T] 5.1.4 Queue –ADT[G&T] 5.2.1 –Implementations [G&T] 5.2.2, 5.2.3 Which of the algorithms discussed in the course use stacks or/and queues ?

5
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.5 Trees: Basic Terminology [G&T] 7.1.1 ADT Tree/binary Tree and its implementation [G&T] 7.1.2 –7.1.3, 7.2, 7.3.1, 7.3.3-7.3.6 Binary Search trees [G&T] 10.1 Particular attention: representation of trees operations on BSTs

6
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.6 Maps and Dictionaries: ADTMap, ADT Dictionary [G&T] 9.1, 9.3 Implementations ADT Map/Dictionary: –Simple list-based [G&T] 9.1.1, 9.3.1 –Hash tables/collision handling (chaining, open addressing, double hashing) [G&T] 9.2.1-9.2.2,9.2.4-9.2.5, 9.2.7, 9.3.2 –Ordered Search Tables/Binary Search [G&T] 9.3.3 –Skip Lists [G&T] 9.4.1 Illustrating execution of ADT operations in these implementations

7
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.7 Special Search Trees: AVL Trees [G&T] 10.2 Splay Trees [G&T] 10.3.1-10.3.2 Multi-way Search Trees, (a,b) trees [G&T] 10.4 B-trees [G&T] 14.3.2 examples showing execution of look-up, insert and delete operations on AVL-trees, Splay trees, (2,3) trees

8
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.8 Priority Queues ADT Prority Queue [G&T] 8.1 Implementations: –Lists [G&T] 8.2.1,8.2.2 –Heap [G&T] 8.3.1-8.3.3 show execution of ADT Priority Queue operations in different implementations; variants of heaps

9
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.9 Sorting and Selection (1) Aspects of Sorting [Fö] 8.3-8.5 Comparison based sorting algorithms –(Linear) Insertion Sort [G&T] p.333 –(Straight) Selection Sort [G&T] p.332 –Quick Sort [G&T] 11.2 –Heap Sort [G&T] 8.3.5-8.3.6 –Merge Sort [G&T] 11.1.1-11.1.3 Lower bound [G&T] 11.3 illustrate steps of a sorting algorithm for given input, discuss stability of a given algorithm, discuss complexity

10
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.10 Sorting and Selection (2) Bucket Sort [G&T] 11.4.1 Radix Sort [G&T] 11.4.2 Selection [G&T] 11.7 show steps of a sorting/selection algorithm for given input, discuss complexity

11
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.11 Graphs 1 ADT Graph [G&T] 13.1 Representing graphs –adjacency list [G&T] 13.2.1-13.2.2 –adjacency matrix [G&T] 13.2.3 Graph traversals and applications –Depth-first Search [G&T] 13.3.1 –Bredth-first Search [G&T] 13.3.3 Directed graphs –Basics/traversals [G&T] 13.4.1 –Strong connectivity [G&T] 13.4.1 –Topological ordering on DAGs [G&T] 13.4.3 show data structures representing a given graph, illustrate on examples basic graph algorithms

12
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.12 Graphs 2 Shortest Paths [G&T] 13.6 –The problem –Dijkstra’s Algorithm –Principles of its implementation; complexity Minimum Spanning Trees –The problem –Kruskal’s Algorithm –Principles of its implementation; complexity illustrate the algorithms on examples

13
TDDB57 DALG-C, DALG Exam Requirements Jan Maluszynski - HT 2006DALG-C.13 Algorithm Paradigms Divide and Conquer [G&T] 11.1.1 Prune and Search [G&T] 11.7.1 Dynamic Programming [G&T] 12.5 also p.146, Greedy Method [G&T] 12.4 Show and illustrate examples of algorithms following each of the patterns

Similar presentations

© 2020 SlidePlayer.com Inc.

All rights reserved.

To make this website work, we log user data and share it with processors. To use this website, you must agree to our Privacy Policy, including cookie policy.

Ads by Google