Dec 26, 2024  
2013-2014 Undergraduate Bulletin 
    
  Catalog Home
  Degree and Certificate Programs
  Academic and Religious Calendars
  Resources
  General Information
  Admission of Students
  Student Financial Assistance
  Academic Regulations
  University Studies
  College of Arts and Sciences
  Barney School of Business
  College of Education, Nursing and Health Professions
  College of Engineering, Technology, and Architecture
  Hartford Art School
  The Hartt School
  Hillyer College
  Athletics
  University Faculty, Administration, and Board of Regents
  Courses
  Tuition and Fees
HELP
2013-2014 Undergraduate Bulletin [ARCHIVED BULLETIN]

CS 220 - Data Structures


3 credit(s)
The study of linear lists (stacks, queues); static versus dynamic allocation; garbage collection; sparse matrices; prefix, postfix, and infix formulas; recursion and recursive algorithms; trees (binary and other representations of trees, traversal of trees); hashing; searching; sorting (bubblesort, quicksort, heapsort, mergesort); analysis of algorithms in terms of time and space complexity; graphs (representation of graphs, topological sorting, reachability, critical path algorithm).
Prerequisite(s): CS 115  (minimum grade of C).
Laboratory fee.


Click here for Fall 2024 course scheduling information.

Click here for Spring 2025 course scheduling information.