DD1338 HT21 L9 Graph traversals Three Types of Memory

(8:3)

DD1338 HT21 L7 Accounting Method of Analysis

(4:33)

DD1338 HT21 L5 Common ADTs and Data Structures

(11:39)

DD1338 HT21 L4 Proof by Induction

(3:31)

DD1338 HT21 L5 SLL Operations and Complexity

(9:2)

DD1338 HT21 L4 Analysis of Mergesort, long

(16:32)

DD1338 HT21 L3 Operation cost for iSortA worst case

(5:24)

DD1338 HT21 L10 Partition routine in Quicksort

(18:49)

DD1338 HT21 L8 Height of a Tree

(5:39)

DD1338 HT21 L7 Linear Probing and Separate Chaining

(3:54)

DD1338 HT21 L9 Graph terminology Paths, Cycles and Components

(3:16)

DD1338 HT21 L7 Growth of dynamic tables

(5:55)

DD1338 HT21 L3 Operation cost for searchA worst case

(2:18)

DD1338 HT21 L10 Quicksort improvements 4 Cut off to Insertion sort

(2:13)

DD1338 HT21 L1 Order of Growth

(3:48)

DD1338 HT21 L4 Proof by Example

(1:35)

DD1338 HT21 L9 Graph traversals Breadth first Search BFS

(5:32)

DD1338 HT21 L7 What are collisions?

(2:28)

DD1338 HT21 L9 Graph algorithms Counting Components

(6:21)