Oct 23, 2024  
2010-2011 Graduate Catalog 
    
Catalog Navigation
  Catalog Home
  ARCHIVED CATALOGS (1902-2008)
  University Mission
  SU Catalog User Guide
  Academic Calendar
  Graduate Programs
  Course Descriptions
  General Information
  Admission Policies
  Tuition and Fees
  Financial Aid
  Student Consumer Information and Disclosures
  FERPA Annual Notice to Students
  Academic Regulations
  Nonacademic Regulations
  College of Arts and Sciences
  Albers School of Business and Economics
  School of Law
  College of Education
  College of Nursing
  College of Science and Engineering
  School of Theology and Ministry
  Special Academic Programs
  Center for Service and Community Engagement
  Culture and Language Bridge Program
  Education Abroad
  University Governance
  University Administration
  Student Governance
  Faculty
  Accreditation and Memberships
  Discipline Codes
  My Portfolio
HELP
2010-2011 Graduate Catalog [ARCHIVED CATALOG]

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

SEGR 503 - Data Structures and Algorithms

3
Basic strategies of algorithm design: top-down design, divide and conquer, average and worst-case complexity, asymptotic costs, simple recurrence relations. Choice of appropriate data structures such as arrays, stacks, queues, trees, heaps, graphs, hash tables, etc. Applications to sorting and searching. Introduction to discrete optimization algorithm: dynamic programming, greedy algorithms. Prerequisite: SEGR 501.

Academic Level: Graduate
Instructional Method: Lecture
School: College of Science & Engineering


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