Vous êtes sur la page 1sur 4

# EE 231 Data Structures

Lecture
Schedule

Semester

## 4th, Spring 2016 (Session 2014)

Credit Hours

Three

Pre-requisite

Introduction to Computing
EE 230- Programming
Fundamentals.

Instructor(s)

Dr Kashif Javed
Ms Ifrah Saeed

Contact

kashif.javed@uet.edu.pk

Office

Office Hours

TBA

Teaching
Assistant(s)

N/A

Lab Schedule

## See the Timetable

Course
Description

The course will cover: Algorithm analyses in terms of their computing time. Various data
structures and their strengths and weaknesses. Various sorting techniques. Graphs.
Shortest-Path algorithms.

Expected
Outcomes

## Upon completion of this course, students will be able to:

to analyze and compare algorithms in terms of their computing time.
to pick and choose among various data structures, the correct one according
to their application requirement
analyze applications based on Graphs

Textbooks

Grading
Policy

REQUIRED:
Mark Allen Weiss, "Data Structures and Algorithm Analysis in C", Addison- Wesley
OPTIONAL/REFRENCES:
1. Robert Sedgewick, Algorithms in C, 3rd Edition, Pearson Education
2. Cormen, Leiserson, Rivest, Stein, Introduction to Algorithms, McGraw-Hill
Class Participation:
Quizzes:
Mid Term:
Final Term:
Total:

10
20
30
40
100

Lecture Plan

Lecture
No.

Course Contents

Textbook Ref.

Week*

Ch.1

Ch.1

## Asymptotic Analysis for analyzing Algorithms, Big Oh, Big-theta and

other asymptotic notations

Ch.2

Calculations.

Ch.2

Ch.2

## Max-Subsequence Problem (continued), Binary Search Algorithm,

Analysis of Running Time.

Ch.2

## Euclidean GCD Algorithm, Exponentiation Algorithm, Analysis of

Running time.

Ch.2

Abstract Data Types (ADT), The List ADT, Comparison of Arrays and
Linked Lists. Applications.

Ch.3

Quiz-1

Ch. 3

10

Ch. 3

11

## The Stack ADT and its implementation using Arrays.

Ch. 3

12

The Stack ADT and its implementation using Linked Lists. Stack
Applications

Ch. 3

13

Ch. 3

14

Ch. 3

15

8
Ch. 4

16

Ch. 4

17

Ch. 4

10

18

Ch. 5

10

19

Ch. 5

11

20

Hashing.

Ch. 5

11

21

## Open Addressing with quadratic probing, Rehashing and Extendible

Hashing. (continued)

Ch. 5

12

22

Ch. 5

12

Quiz-2

12

23

Ch. 6

13

24

Ch. 6

13

25

Ch. 7

14

26

Ch. 7

14

27

Ch. 7

15

28

Ch. 9

15

29

## Minimum Spanning Trees and shortest-path Algorithms.

Ch. 9

16

30

Discussion

16
Final Term Examination

Lab Schedule
Exp.
No.

Description

Week

Lab Exam 1

Mid Break

Lab Exam 2

10

11

12

10

13

Lab Exam 3

14