May 02, 2024  
2015-2016 Catalog 
    
Catalog Navigation
  Catalog Home
  Notice to Readers
  President’s Message
  Programs of Study
  Programs by Degree Type
  Course Descriptions
  General University Requirements
  College of Business and Economics
  College of Fine and Performing Arts
  College of Humanities and Social Sciences
  College of Science and Engineering
  Fairhaven College of Interdisciplinary Studies
  Graduate School
  Huxley College of the Environment
  University Interdisciplinary Programs
  Woodring College of Education
  All-University Programs
  Extended Education
  Student Services
  University Academic Policies
  University Graduation Requirements
  Appendices
  My Portfolio
HELP
2015-2016 Catalog [ARCHIVED CATALOG]

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

CSCI 305 - Analysis of Algorithms and Data Structures I

Introduction to the analysis of algorithms and data structures in a mathematically rigorous fashion. Mathematical fundamentals, counting, discrete probability, asymptotic notation, recurrences, loop invariants. Worst-case, probabilistic and amortized analysis techniques applied to sorting algorithms and classic data structures such as heaps, trees and hash tables. Design techniques such as branch and bound, divide and conquer, will be introduced as will correctness proofs for algorithms.

Prerequisites & Notes: CSCI 241; CSCI 301.
Credits: 4
Grade Mode: Letter


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