Data Structures and Algorithms

Course number: 
CIS 3223
Semester: 
Fall 2015
Instructors:
Name E-mail Office location
Anthony Hughes anthony.hughes@temple.edu
Science Education and Research Center (SERC), 344
Prerequisites: 

Restrictions: 

Must be enrolled in one of the following Fields of Study (Major, Minor, or Concentration): 
      Computer & Information Science 
      Computer Science 
      Mathematics & Comp Sci w/Teach 
      Mathematics/Computer Science 
May not be enrolled in one of the following Campuses:      
      Japan 

Prerequisites: 

(  Course or Test: CIS 2166 
Minimum Grade of C- 
May not be taken concurrently.  )
and
(  Course or Test: CIS 2168 
Minimum Grade of C- 
May not be taken concurrently.  )
and
(  Course or Test: MATH 1042 
Minimum Grade of C- 
May not be taken concurrently.  )
or
(  Course or Test: MATH 1942 
Minimum Grade of C- 
May not be taken concurrently.  )
or
(  Course or Test: MATH 1951 
Minimum Grade of C- 
May not be taken concurrently.  )
or
(  Course or Test: MATH 2043 to 3080 
Required Courses: 1 
Minimum Grade of C- 
May be taken concurrently.  )
or
(  MA07 Y 
May not be taken concurrently. )

Textbooks: 
Algorithms
Sanjoy Dasgupta, Christos Papadimitriou, Umesh Vazirani
McGraw Hill
ISBN 978-0-07-352340-8 -- ISBN 0-07-352340-8
Topics covered: 
  • Big-O notation
  • Algorithms with numbers
  • Divide-and-conquer algorithms 
  • Decompositions of graphs
  • Paths in graphs
  • Greedy algorithms
  • Dynamic programming
  • Linear programming and reductions
  • NP-complete problems

 

Course goals: 

This course provides students with an introduction to the development and application of algorithms in computer science.  Concepts covered in the class:

  • Comparative analysis of algorithms and data structures.
  • Data structures include heaps, priority queues, binary and general trees, binary search trees, and graphs.
  • Algorithms include heapsort, topological sort, breadth-first search, depth-first search, shortest path algorithms, and Greedy algorithms. 
     
Attendance policy: 
Attendance to all meetings of the class is mandatory
Accomodations for Students with Disabilities: 
Any student who has a need for accommodation based on the impact of a documented disability, including special accommodations for access to technology resources and electronic instructional materials required for the course, should contact me privately to discuss the specific situation by the end of the second week of classes or as soon as practical. If you have not done so already, please contact Disability Resources and Services (DRS) at 215-204-1280 in 100 Ritter Annex to learn more about the resources available to you. I will work with DRS to coordinate reasonable accommodations for all students with documented disabilities. (http://www.temple.edu/studentaffairs/disability/accommodations/).
Student and Faculty Academic Rights and Responsibilities: 
Freedom to teach and freedom to learn are inseparable facets of academic freedom. The University has a policy on Student and Faculty and Academic Rights and Responsibilities (Policy #03.70.02) which can be accessed through the following http://policies.temple.edu/PDF/99.pdf.