May 16, 2024  
2019-2020 Undergraduate Bulletin 
    
Catalog Navigation
  Bulletin Home
  Academic Calendar
  The University
  Admission
  Student Financial Assistance
  Fees and Expenses
  Undergraduate Academic Information and Policies
  Student Life
  Student Policies
  Honors Program
  USI Athletics
  Academic Programs
  Course Descriptions
  Romain College of Business
  College of Liberal Arts
  College of Nursing and Health Professions
  Pott College of Science, Engineering and Education
  Outreach and Engagement
  University Division
  Core 39
  University Faculty
  Other University Offices and Services
  Student Handbook and Code of Student Behavior
  Bulletin User Guide
  Archived Publications
  My Portfolio
HELP
2019-2020 Undergraduate Bulletin [ARCHIVED PUBLICATION]

Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)

CS 311 - Data Structures and Analysis of Algorithms

Credits: 3

This course introduces students to data structures such as lists, trees (including binary and multi-way trees), heaps, stacks, queues, and graphs. Students will learn concepts of algorithmic complexity, time and space analysis of recursive and non-recursive algorithms, including graph and sorting algorithms, and different algorithm design techniques. The course also introduces concepts of NP-completeness.

Prerequisite(s): CS 215  and either CS 301  or CS 358  

Term(s) Offered: Fall


Check course availability in Spring 2024

Check course availability in First Summer 2024

Check course availability in Second Summer 2024

Check course availability in Fall 2024



Facebook this Page (opens a new window)
Tweet this Page (opens a new window)
Add to Portfolio (opens a new window)