None
Course Number:
CSCI 4270
Approved Starting Semester:
Paper Form (Before Curriculog, Approved before 2017)
Course Title:
Algorithm Design and Analysis
Course Description (Bulletin Description):
Algorithm design techniques and computational complexity analysis. Divide-and-conquer, dynamic programming, greedy approach, backtracking, branch-and-bound, complexity theory, P and NP problems.
Prerequisite:
CSCI 3250
Co-requisite:
None
Pre/Co-requisite::
None
Dual-Listed:
None
Course Objectives (Course-level Student Learning Outcomes):
N.A. (Paper Form)
Topics Covered (In Outline/Calendar):
N.A. (Paper Form)
Student Learning Outcomes:
- Analyze a complex computing problem and to apply principles of computing and other relevant disciplines to identify solutions. (SLO1)
- Design, implement, and evaluate a computing-based solution to meet a given set of computing requirements in the context of the program’s discipline. (SLO2)
- Apply computer science theory and software development fundamentals to produce computing-based solutions. (SLO6-CS)
Course Coordinator:
Dr. SamadiDana
Instructor-in-charge:
Dr. SamadiDana
Previous Professors:
Dr. Nicholas Coleman, Dr. James Church, Dr. SamadiDana
Technologies / Skills:
Algorithm theories
Textbook(s):
Spring/Summer 2026
Title: FOUNDATIONS OF ALGORITHMS
Edition: 5TH 15
Author: NEAPOLITAN
Publisher: JONES+BART
ISBN: 9781284049190
========================================
Go back to choose another course