Masoud Seddighin Lab – 712

Data Structures and Algorithms Introduction

Analysis of Algorithms

Basic Data Structures

Hash, Sort More

Advanced Topics

2

Data Structures and Algorithms Introduction

(Best/Worst/Average)-case Analysis

Asymptotic Analysis 𝑂, Ω, 𝜃 notations

Recurrence Relations

Amortized Analysis

3

Analysis of Algorithms (Part 1)

Data Structures and Algorithms Introduction

Array, Stack, Queue, List

Trees Expression BST

Heap

4

Basic Data Structures (Part 2)

Data Structures and Algorithms Introduction

Hash Tables

Sort Comparison sort algorithms Lower-bound Linear sorting

Select

5

Hashing and Sorting (Part 3)

Data Structures and Algorithms Introduction

Graph Implementation DFS, BFS Shortest Paths

Disjoint sets Trie Randomized Analysis etc!

6

More Advanced Topics (Part 4)

Data Structures and Algorithms Introduction

Graph Implementation DFS, BFS Shortest Paths

Disjoint sets Trie Randomized Analysis etc!

7

More Advanced Topics (Part 4)

Data Structures and Algorithms Introduction

8

References

Data Structures and Algorithms Introduction

9

References

Data Structures and Algorithms Introduction

Homework: 0

Quiz: 3

Projects: 3

Midterm: 6

Final: 6-7

Extra: 2-3

10

Evaluation

Data Structures and Algorithms Introduction

Telegram Channel: @DS_Sedighin

Quera

Office Hours: Saturday 16-18 Monday 16-18

Email: seddighin.masood@gmail.com

TA: parhamghasemloo75@gmail.com

11

TA Sessions

Data Structures and Algorithms Introduction 12

Policies

Fraud

Data Structures and Algorithms Introduction

Induction

Recurrence relations

13

Preliminaries

Data Structures and Algorithms Introduction

Question?

14