Design and Analysis of Algorithms Unit 1 - Introduction

1. The Design and
Analysis of
Algorithms
by Anany Levitin

2. 2
CHAPTER 1: INTRODUCTIONCHAPTER 1: INTRODUCTION
 What is an Algorithm
 Steps in Designing and Implementing
an Algorithm
 Important Problem Types
 Fundamental Data Structures

3. 3
Fundamental Data
Structures
Linear data structures
 Array
 Linked list
 Stack
 Queue
Operations: search, delete, insert
Implementation: static, dynamic

4. 4
Non-linear data structures
 Graphs
 Trees : connected graph without cycles
Rooted trees
 Ordered trees
Binary trees
Graph representation: adjacency lists,
adjacency matrix
Tree representation: as graphs; binary nodes
Fundamental Data Structures

5. 5
Fundamental Data Structures
Sets, Bags, Dictionaries
 Set: unordered collection of distinct elements
Operations: membership, union, intersection
Representation: bit string; linear structure
 Bag: unordered collection, elements may be
repeated
 Dictionary: a bag with operations search, add,
delete

6. Check if you are Clear with:
 Linear Data Structures
 Non-Linear Data Structures
 Sets
 Bags
 Dictionaries
6

7. Have a SPLENDID Day..!!!
7