CS 5333: Discrete Structures

CS 5343 - Algorithm Analysis and Data Structures
Spring 2007 Course Syllabus
MW 12:30 p.m. - 1:45 p.m. ECSS2.311
Course Homepage: http://www.utdallas.edu/~rxk011000/TEACH/S0753343/

Catalog Statement: Formal specifications and representation of lists, arrays, trees, graphs, multilinked structures, strings and recursive pattern structures. Analysis of associated algorithms. Sorting and searching, file structures. Relational data models. Prerequisites: CS 5303, CS 5333.

Textbook: "Data Structures and Algorithms in JAVA" by M. T. Goodrich, R. Tamassia, 4th edition, John Wiley 2006.

Course Content:
- Lists (Chapter 3, 6)
- Recursion (Chapter 3)
- Algorithm Analysis Tools (Chapter 4)
- Stacks and Queues (Chapter 5)
- Trees and Search Trees (Chapter 7, 10)
- Priority Queues (Chapter 8)
- Sorting, Sets and Selection (Chapter 11)
- Graphs and Graph Algorithms(Chapter 13)
- Other topics from text as time permits.
Points: 2 Quizzes: 10 points each; 2 Projects: 10 points each; 2 Exams: 30 points each.
Grade Determination: 95-100: A+; 90-94: A; 85-89: A- etc. (5-point steps down to <= 50: F)

Tentative Exam Schedule:

Test Date and Time Duration

1 12:30 pm Wednesday, February 28 75 minutes

2 11:00am Wednesday, April 25 120 minutes
Student Responsibilities:
- Regular class attendance has a strong correlation to good performance.
- I take academic honesty seriously -- so should you.
- The purpose of your being here is to LEARN! Never forget that.