Algorithms andData Structures CSE 2320

Fall 2001Syllabus

 

Instructor:           Dr.J Carter M Tiernan NH 330          x3855

                              tiernan@cse.uta.edu                   Web:TBD

Catalog Description andCourse Objective:     Design and analysis ofalgorithms with an emphasis on data structures.  Approaches to analyzing lower bounds on problems and upperbounds on algorithms.  Classicalalgorithm design techniques including algorithms for sorting, searching, andother operations on data structures such as hash tables, trees, graphs,strings, and advanced data structures, dynamic programming and greedy approaches.

Prerequisites:     C++Programming (CSE 1325) and Discrete Structures (CSE 2315)

Textbook:            Cormen,Leiserson, Rivest, and Stein, Introduction to Algorithms, 2nd edition.

General requirements: This course will include various programmingassignments as well as possible additional paper assignments andpresentations.  There will be fourtests, three during the semester and one comprehensive final.

 

Grading:              Assignments                         50%

                              SemesterTests                      10%each

                              FinalExam                            20%

Make up tests must be arranged in advance and will be scheduled at the discretion of theinstructor. 

CHEATINGon exams, PLAGIARISM, or COLLUSION will not be tolerated. 

Assignments:  All labs and otherassignments are due at the beginningof the class on the due date. Assignments turned in later than the beginning of class will be countedlate.  A 10 point per day latepenalty will be assessed and no assignments will be accepted later than oneweek after the due date.  [Extenuatingcircumstances may be considered.] All assignments must be typewritten or computer printed.  Figures may be hand drawn if necessarybut must be neat and legible. Assignment due dates will be given when assignments are made. 

Grading Policy:  Foreach assignment, the appropriate documentation, code, if any, and/or results,if any, should be turned in. Assignments will be graded on the basis of 100 points total perassignment.  Preferreddocumentation style will be discussed in class.

Grading issues:  Requestsfor re-evaluation of assignments are limited to seven (7) calender days afterthe assignment is returned.  Everyassignment submitted for regrading must be given to the instructor in itsentirety and will be completely regraded. Papers will not be re-evaluated in the classroom.

Miscellaneous:  If yourequire accommodation based on disability, I would like to meet with you in theprivacy of my office during the first week of the semester to ensure that youare appropriately accommodated.

Ethics and Academic Integrity:

      AStatement of Ethics will be provided for you to read, sign, return, andfollow.  Violators of the ethicscode will be reported to the Vice-President for Academic Affairs and penaltieswill be levied as described in the Statement of Ethics.


 

Tentative Schedule:  [Subject to change as required]  The schedule below gives the anticipated plan for the summersemester.  It is NOT necessarilyexactly what will happen. Schedules may change based on the class’s rate of progress.  If you need to plan around certaindates, come talk to me about those dates.

 

Day

Date

 

Chapter #s

And Titles

Assignments and Misc.

M

Aug.

27

Ch. 1, 2

Role of Algorithms, Getting Start.

 

W

 

29

Ch. 3, 4

Growth of Functions, Recurrences

Lab 1 assigned

M

Sept.

3

 

 

LABOR DAY holiday

W

 

5

Ch. 4, 5

-, Prob. Analysis

 

M

 

10

Ch. 6

Heapsort

Lab 1 due/Lab 2 assigned

W

 

12

Ch. 7

Quicksort

Census day

M

 

17

Ch. 8, 9

Sorting in Linear Time, Stats

 

W

 

19

Review

 

Lab 2 due/Lab 3 assigned

M

Sept.

24

Test 1

 

 

W

 

26

Ch. 10, 11

Elem. Data Structures, Hash Tables

 

M

Oct.

1

Ch. 11, 12

-, Binary Search Trees

 

W

 

3

Ch. 13, 14

Red-Black Trees, Augmenting

Lab 3 due/Lab 4 assigned

F

 

5

 

 

Last day to drop w/  'W'

M

 

8

Ch. 15

Dynamic Programming

 

W

 

10

Ch. 16, 17

Greedy,  Amortized

 

M

 

15

Review

 

Lab 4 due/Lab 5 assigned

W

Oct.

17

Test 2

 

 

F

 

19

 

 

Midsemester

M

 

22

Ch. 18

B- Trees

 

W

 

24

Ch. 19, 20

Binomial Heaps, Finonacci Heap

 

M

 

29

Ch. 20, 21

-, Disjoint Sets

Lab 5 due/Lab 6 assigned

W

 

31

Ch. 22

Elem. Graph Alg.

 

M

Nov.

5

Ch. 23, 24

Min. Span Tree, Single-source Path

 

W

 

7

Ch. 24, 25

-, All-pairs Path

 

M

 

12

Ch. 26

Max Flow

 

W

 

14

Review

 

Lab 6 due/Lab 7 assigned

F

 

16

 

 

Last day to drop or withdraw

M

Nov.

19

Test 3

 

 

W

 

21

Ch. 29 intro, 29.1, 29.2, 31.1, 34.1

Selected Topics

 

R to

S

 

22-25

 

 

THANKSGIVING holidays

M

 

26

Ch. 30.1, 30.2, 28.1

Selected Topics

 

W

 

28

Ch. 35

Approx. Alg.

Lab 7 due

M

Dec.

3

Review

 

 

W

 

5

Review

 

 

M

Dec.

10

Final Exam

11:00 - 1:30