Thanks to visit codestin.com
Credit goes to www.scribd.com

Scribd
Upload
147 views2 pages

Discrete Structures Syllabus

This document provides information about the CS 5343 course taught by Dr. Neeraj K Gupta in Spring 2016. The course will meet on Tuesdays and Thursdays from 5:30-6:45am in ECSS 2.203. The course covers analysis of algorithms including stacks, queues, trees, graphs and advanced sorting techniques. The goals are to understand algorithm analysis and learn techniques for designing efficient algorithms. The required text is "Data Structures and Algorithms in C++" and there will be homework assignments, a midterm exam worth 30%, and a final exam worth 40% of the overall grade.

Uploaded by

anon_212297292
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
147 views2 pages

Discrete Structures Syllabus

This document provides information about the CS 5343 course taught by Dr. Neeraj K Gupta in Spring 2016. The course will meet on Tuesdays and Thursdays from 5:30-6:45am in ECSS 2.203. The course covers analysis of algorithms including stacks, queues, trees, graphs and advanced sorting techniques. The goals are to understand algorithm analysis and learn techniques for designing efficient algorithms. The required text is "Data Structures and Algorithms in C++" and there will be homework assignments, a midterm exam worth 30%, and a final exam worth 40% of the overall grade.

Uploaded by

anon_212297292
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 2

Course

Professor
Term
Meetings

CS 5343
Dr.Neeraj K Gupta
Spring 2016
T and Th 5:30-6:45am ECSS 2.203

Professors Contact Information


Office Phone 972 883 4656
Office Location ECSS 3.207
Email Address [email protected]
Wed 1:00PM - 2:00 PM
Office Hours
Thu 2:30 AM - 3:30 PM
Other Information Course materials available on elearning
TAs Contact Information
Name:
Office Location:
Email Address:
Office Hours:
General Course Information
Pre-requisites, Corequisites, & other
restrictions

CS 5303 Computer Science I, CS 5333 Discrete Structures


Prerequisite will be strictly enforced.

Topics: Analysis of algorithms. Stacks, queues, and trees, including Btrees. Heaps, hashing, and advanced sorting techniques. Graphs,
algorithms on graphs
Study efficient algorithms for a number of fundamental problems, learn
techniques for designing algorithms, prove correctness and analyze
running times.
1. Ability to understand asymptotic notations, recurrences, algorithm
analysis
Learning Outcomes 2. Ability to use/analyze Lists, stacks, queues, hashing, priority queues
3. Ability to use/analyze Binary search trees, balanced binary search trees
4. Ability to use/analyze Graphs, Depthfirst search, Topological ordering
5. Ability to use/analyze Breadthfirst search, Dijkstra's algorithm
6. Ability to use/analyze Algorithms of Prim and Kruskal, Disjointset
UnionFind problem
Required Texts & Data Structures and Algorithms in C++ by M. T. Goodrich, R. Tamassia,
Materials D. M. Mount.
Course Description

Suggested Texts,
Readings, &
Materials

Recommended papers may be provided during the semester.

Assignments & Academic Calendar


[Topics, Reading Assignments, Due Dates, Exam Dates]

Exams: There will be two exams: a midterm and a final. The exams will be closed book and the
final exam is comprehensive.

Assignments: Homework will be assigned during the semester.


Course Policies
The grade each student earns from this class will be based on the following table.
Midterm
Final
Assignments
Grading (credit)
Criteria

Make-up Exams
Extra Credit
Late Work
Class Attendance
Classroom
Citizenship
Other Misc.
Items
UT Dallas
Syllabus Policies
and Procedures

30%
40%
30%

Total
100%
A Bonus for class participation. Class room exercises will be given. I will call a
student at random from class roster to present the exercise. By end of semester each
student will have an equal opportunity to answer.
ALL WORK MUST BE INDIVIDUAL WORK. Cases of cheating will be forwarded
to the Judicial Affairs office.
Only by consent of instructor under severe reasons.
None
Not allowed
I do not check for class attendance, but given the difficulty of the topics it is
obviously necessary.
Please participate and ask questions during class. It tends to slow down the pace and
make the lectures more enjoyable.

Please bring your photo ID to each exam

The information contained in the following link constitutes the Universitys policies
and procedures segment of the course syllabus.
Please go to http://go.utdallas.edu/syllabus-policies for these policies.

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

You might also like