ASAKITEC 2620 3'0 Introduction to Data Structures

1
AS/AK/ITEC 2620 3.0 Introduction to Data
Structures

• Professor S. Chen
• http//www.atkinson.yorku.ca/sychen

2
Lecture 1a

• Syllabus and Introduction
• Course description, Labs, Textbooks
• Evaluation and Marking scheme
• Suggested readings

3
Lecture 1b

• Searching Arrays
• Linear search
• Binary search
• Best, Worst, and Average cases
• Exercises 3.14

4
Lecture 2a

• Non-recursive Sorting Algorithms
• Selection sort
• Insertion sort
• Best, Worst, and Average cases

5
Lecture 2b

• Analysis of non-recursive algorithms
• Estimation
• Complexity analysis
• Big-Oh notation
• Exercises 3.3, 3.9

6
Lecture 3a

• Estimation of non-recursive algorithms
• Best, Worst, and Average cases
• How many times?
• What does it cost?
• Exercises 3.9, 8.12

7
Lecture 3b

• Maintaining data records
• Inserting into sorted arrays
• Dynamic data structures
• Linked-lists
• Exercises 4.10, 8.4

8
Lecture 4a

• Multiple pointers
• Doubly linked-lists
• Binary trees
• Binary search trees
• Exercises 5.16

9
Lecture 4b

• Recursion
• Divide and Conquer
• Linear and Binary recursion
• Tree traversals
• Exercises 5.18, 5.19

10
Lecture 5a

• Recursive sorting algorithms
• Achieving leverage
• Quicksort
• Mergesort
• Exercises 8.8, 8.16

11
Lecture 5b

• Programming project 1
• Find
• Insert
• Delete

12
Lecture 6a

• Analysis of recursive algorithms
• Recurrence relations
• Quicksort, Mergesort
• Best, Worst, and Average cases
• Exercises 14.11

13
Lecture 6b

• Estimation of recursive algorithms
• How many times?
• What does it cost?

14
Lecture 7a

• Basic Datatypes I
• Encapsulation, Interfaces, and APIs
• Stacks
• Stack-based recursion
• Exercises 4.3, 4.18

15
Lecture 7b

• Midterm Review
• Short answer
• Complexity analysis and estimation
• Linked structures
• Recursion

16
Lecture 8a

• Basic Datatypes II
• Queues
• Priority queues
• Heaps
• Exercises 4.15, 4.16

17
Lecture 8b

• Concepts vs. Implementations
• Heaps
• Complete binary trees
• Heapsort
• Exercises 5.20, 5.21

18
Lecture 9a

• Indirect problems
• Decision trees
• Breadth-first search
• Depth-first search
• Exercises 7.4, 7.5

19
Lecture 9b

• Two-player search trees
• Minimax search
• Alpha-beta pruning
• Humans vs. computers

20
Lecture 10a

• Programming project 2
• A Little Artificial Intelligence
• Using Classes, Algorithms, and Data Structures
• The Game

21
Lecture 10b

• Defining languages
• Grammars
• Sentences
• Derivations

22
Lecture 11a

• Parse trees
• Parsing
• Ambiguity
• Languages
• Exercises 5.6

23
Lecture 11b

• Graph Algorithms
• Definitions, representations, analysis
• Shortest paths
• Minimum-cost spanning trees
• Exercises 7.7, 7.17

24
Lecture 12a

• Hashing
• Hash functions
• Collisions and Clustering
• Deletions
• Exercises 10.12, 10.14

25
Lecture 12b

• Final Exam Review
• Basic datatypes
• Linked structures
• Grammars
• Graphs
• Hash tables