Slides

Introduction

• Analysis of Algorithms
  We will define what means to be fast for an algorithm. First step, define a language independant formalism for algorithms, that is called Pseudo-Code, then we will present a way to measure the efficiency of an algorithm expessed in pseudo-code.
  Handshout (4 pages on 1 page)
  Slides
  

Flat Data Structures (lists and arrays)

• Stacks
  Data Structure for handling elements in a LIFO way (Last In First Out).
  Handshout (4 pages on 1 page)
  Slides
  
• Queues
  This Data Structure gives the possibility to store elements in a FIFO way (first in first out). This is particularily usefull for implementing a buffer.
  Handshout (4 pages on 1 page)
  Slides
  
• Linked Lists
  Data can be stored in a growable data structure (unlike arrays) for which the memory is dynamically allocated.
  Handshout (4 pages on 1 page)
  Slides
  
• Lists
  This abstraction layer permits to profit of the power of the Linked List but allows an implementation using arrays.
  Handshout (4 pages on 1 page)
  Slides
  
• Sequences
  Handshout (4 pages on 1 page)
  Slides
  
• Merge Sort
  Handshout (4 pages on 1 page)
  Slides
  

Trees

• Trees
  Handshout (4 pages on 1 page)
  Slides
  
• Heaps
  Handshout (4 pages on 1 page)
  Slides
  
• Priority Queues
  Handshout (4 pages on 1 page)
  Slides
  
• AdaptablePQ
  Handshout (4 pages on 1 page)
  Slides
  
• Dictionary
  Handshout (4 pages on 1 page)
  Slides
  
• Binary Search Trees
  Handshout (4 pages on 1 page)
  Slides
  
• AVL Trees
  Handshout (4 pages on 1 page)
  Slides
  

Miscelaneous

• Hash Tables
  Handshout (4 pages on 1 page)
  Slides
  
• Collection Framework
  Slides
  

Graphs

• Graphs
  Handshout (4 pages on 1 page)
  Slides
  
• Depth First Search
  Handshout (4 pages on 1 page)
  Slides
  
• Breadth First Search
  Handshout (4 pages on 1 page)
  Slides
  
• Digraphs
  Handshout (4 pages on 1 page)
  Slides
  
• Shortest Path
  Handshout (4 pages on 1 page)
  Slides
  
• Minimum Spaning Tree of a Graph
  Handshout (4 pages on 1 page)
  Slides
  
• Program Graph
  Handshout (4 pages on 1 page)
  Slides
  

Algorithmic Strategies

• Divide And Conquer
  Handshout (4 pages on 1 page)
  Slides
  
• Dynamic Programming
  Handshout (4 pages on 1 page)
  Slides
  
• Greedy Algorithms
  Handshout (4 pages on 1 page)
  Slides
  
• Union Find
  Handshout (4 pages on 1 page)
  Slides
  

TarGZ of the entire course: