Course Syllabus

CS 3333.001 – Data Structures

Fridays 9:30am-12:15pm in ECSS 2.412

Instructor: Dr. Jey Veerasamy

Office: ECSS 3.231
Office Phone: 972-883-4241
E-Mail: jeyv@utdallas.edu (only for emergencies, use email within
elearning instead)
Web Site: www.utdallas.edu/~jeyv

Office Hours: Tuesdays & Thursdays 9:45am - 11:15am

Additional hours by appointment.

TA: TBD

Course Pre-requisites, Co-requisites, and/or Other Restrictions

CS 1335 or ECS 1337 or CS 3335 or equivalent programming experience.

Course Description

CS 3333 - Data Structures (3 semester hours) Programming with basic data structures
(arrays, stacks, queues, lists, and trees) and their associated algorithms. Various sorting
and searching techniques. Fundamental graph algorithms. This course covers much of the
same material as CS 3345 without requiring the analysis of algorithms. Computer Science
majors may NOT take this course. This course may not be taken for degree credit by
students who have completed CS 2336 (C/C++). Prerequisite: CS 1335 or ECS 1337 or CS
3335 or equivalent programming experience. (3-0) Y

Student Learning Objectives/Outcomes

1. Ability to use/analyze Lists, stacks, queues, hashing, priority queues

2. Ability to use/analyze Binary search trees, Balanced binary search trees
3. Ability to use/analyze Graphs, Depth-first search, Topological ordering
4. Ability to use/analyze Breadth-first search, Dijkstra's algorithm
5. Ability to use/analyze Algorithms of Prim and Kruskal, Disjoint-set Union-Find
problem

Required Textbooks and Materials

Data Structures using C++, 2nd edition, by D.S. Malik

ISBN-10: 0324782012 ISBN-13: 978-0324782011 (1st edition will be ok too)

Software

Any C++ compiler will be ok to complete programming assignments. MS Visual C++ 2010
Express edition is free and available from Microsoft website.

Assignments & Academic Calendar (subject to change throughout the term)

Class Date Class Activity Assignment

1 January 14 Review of Syllabus

Time Complexity

2 January 21 C++ classes Read Chapter 1

3 January 28 OOD and C++ Read Chapter 2

4 February 4 Pointers and Array based Lists Read Chapter 3

Assignment 1 due

5 February 11 Standard Template Library I Read Chapter 4

Assignment 2 due

6 February 18 Linked Lists Read Chapter 5

Mid-term Exam review questions Assignment 3 due

7 February 25 Recursion Read Chapter 6

8 March 4 Mid-term Exam review Assignment 4 due

Mid-term Exam

9 March 11 Stacks Read Chapters 7 & 8

Queues

March 18 Spring Break, no class

10 March 25 Searching & hashing algorithms Read Chapter 9

11 April 1 Sorting algorithms Read Chapter 10

12 April 8 Binary Trees & B-trees Read Chapter 11

Assignment 5 due

13 April 15 Graphs Read Chapter 12

Assignment 6 due

14 April 22 Standard Template Library II Read Chapter 13

Assignment 7 due

15 April 29 Final Exam Review, Assignment 8 due

final day of class

16 May 6 @ 9:30am Final Exam (will focus on material

covered in second half)

Grading Policy

Projects and exams determine grades. All exams are closed book and closed notes. The
final grade will be composed as follows:

Quizzes 10%
Assignments 40% (8 assignments * 5% each = 40)
 Mid-term 25%
Final exam 25%

Letter grades will be assigned as follows:

98-100 A+ 92-97 A 90-91 A-

88-89 B+ 82-87 B 80-81 B-

78-79 C+ 72-77 C 70-71 C-

68-69 D+ 62-67 D 60-61 D-

Below 60 F

Assignments (tentative):

Assignment descriptions are not ready yet - you can expect each assignment to have one
programming problem, algorithm and working out an example. You can expect me to
provide partial code for complex programming assignments to attain maximum value with
minimum effort. Zip only the source files & documents and submit, unless individual
assignment description clearly asks for something else.

Programming assignments will be graded on a 100 point basis, utilizing the following
criteria:

Max Score

Source Code Overall design 40%

Comments 10%

Indentation 10%

Readability 10%

Execution Nominal cases 25%

Special cases 5%

Total 100%

Course & Instructor Policies

All exams are closed book and closed notes. Exams will focus more on concepts and less
on details. Necessary documentation will be provided to avoid the need for memorization
as much as possible. All make-up exams are scheduled during the week following the
actual exam date at the discretion of the instructor. Make-up exams are only given to
those students who coordinate the missing of an exam prior to the originally scheduled
exam date.

Course credit is only given for work assigned in the course schedule. No extra work will be
assigned nor will extra credit be given for any extra work performed by a student.
However, there is only one extra credit item in this course: Active participation in the class.
When computing the final grade towards the end of the course, instructor may assign upto
5% additional credit based on your active role in the classroom.

Class attendance is not recorded except for exam dates and times. However, 5-10 quizzes
will be given on randomly selected days. Those quizzes will typically test your
understanding of course materials covered recently & 10% of the final grade will be
determined by your performance in those quizzes. Make-up quizzes will not be given for
absentees, however one quiz with the lowest score will be dropped from consideration
when computing the final grade.

I encourage everyone to submit the assignments 1 or 2 days early. Do not wait until the
last minute to submit it. But I do understand things happen and occasionally you may not
be able to submit assignments on time. My policy is to assess 1% penalty for every 2
hours. For example, if you submit the assignment exactly 1 day later, 12% penalty will be
assessed. Late assignments will be accepted up to 4 days. You won't be able to submit it
after 4 days and your assignment grade will be set to 0. Only exception to this late policy
is serious medical condition, for which you will need to submit proof of doctor certificate.
Please do not send emails requesting for extension or penalty waiver.

Off-campus Instruction and Course Activities

No off-campus activities are scheduled.

Policies and Procedures for Students

The University of Texas at Dallas provides a number of policies and procedures designed to
provide students with a safe and supportive learning environment. Brief summaries of the
policies and procedures are provided for you at
http://provost.utdallas.edu/home/index.php/syllabus-policies-and-procedures-text
and include information about technical support, field trip policies, off-campus activities,
student conduct and discipline, academic integrity, copyright infringement, email use,
withdrawal from class, student grievance procedures, incomplete grades, access to
Disability Services, and religious holy days. You may also seek further information at
these websites:
http://www.utdallas.edu/BusinessAffairs/Travel_Risk_Activities.htm
http://www.utdallas.edu/judicialaffairs/UTDJudicialAffairs-HOPV.html
http://www.utsystem.edu/ogc/intellectualproperty/copypol2.htm
http://www.utdallas.edu/disability/documentation/index.html

These descriptions and timelines are subject to change at the discretion of the
Professor.