Office: Computer Science Building, 4.227, tel: 972-883-2364 Email: besp@utdallas.edu Class hours: Mon Wed 11:00-12:15 pm ECSS 2.306 Office hours: Tuesday 1:00-3:00pm, or by appointment. Anytime electronically. Class web page: https://webct.utdallas.edu Teaching assistant: TBA.
Course objectives: To develop important skills in the design, analysis, and
implementation of efficient algorithms and data structures, and their applications.
Prerequisites: CS 5303 Computer Science I, CS 5333 Discrete Structures
Textbook: Data Structures and Algorithms in C++ by M. T. Goodrich, R.
Tamassia, D. M. Mount. Recommended Introduction to Algorithms by Cormen, Leiserson and Rivest, reading: McGraw-Hill, 1991
Course Outline: 1. Introduction
2. Analysis Tools 3. Stacks, Queues, and Recursion 4. Vectors, Lists, and Sequences 5. Search Trees 6. Priority Queues 7. Sorting, Sets, and Selection 8. Graph algorithms
Grading: Homeworks 20%, Midterm exam 40%, Final exam 40%.
A UTD ID must be presented in order to turn in any exam.
Collaborating/Cheating: Do not assume that working together is allowed! You are to
perform all assignments/projects independently. Allowing another person to view your work, drafted or completed, is academic dishonesty, regardless of intent. Do not allow anyone to see your work.
Plagiarism: Copying passages verbatim from another writer's work and
presenting them as one's own work constitutes plagiarism. If passages/sentences are copied verbatim, they must be put in quotation marks and properly footnoted.
Academic Honesty: Scholastic dishonesty will not be tolerated. Students who
violate University rules on scholastic dishonesty are subject to disciplinary penalties, including the possibility of failure in the course and dismissal from the University. Since dishonesty harms the individual, all students, and the integrity of the University, policies on scholastic dishonesty will be strictly enforced. For more information on Academic Dishonesty see: http://www.utdallas.edu/student/slife/dishonesty.html