Generated on Tue Oct 25 10:19:18 2022

CS 343: Algorithm Design and Implementation (JSON)

Catalog description: This course introduces the basic knowledge of designing classical algorithms and implementing these algorithms using a programming language. In particular, the course teaches various data structures, including graphs and balanced binary search trees, and efficient schemes to implement these data structures. This course also teaches basic algorithm design techniques including divide-and-conquer, greedy scheme, and dynamic programming. This course covers graph algorithms, including graph traversals (depth-first search and breadth-first search), connectivity, shortest paths, and minimum spanning trees.

Prerequisites: At least a C- in C S 272, or Consent of Instructor.    (Catalog Link)

Credits: 3 (3)

Coordinator: Huiping Cao

Textbook: Algorithms, by Robert Sedgewick and Kevin Wayne, Addison-Wesley (4th edition). ISBN: 978-0-321-57351- 3.
    (also: Course handouts)

BS degree role: elective

Course Learning Objectives

  1. LO1: Be able to use and implement sorting algorithms
  2. LO2: Be able to design and implement graph algorithms
  3. LO3: Be able to design and implement algorithms using the divide-and-conquer technique
  4. LO4: Be able to design and implement algorithms using the greedy technique
  5. LO5: Be able to design and implement algorithms using the dynamic programming technique
  6. LO6: Be able to use and implement balanced search trees
  7. LO7: Be able to use and implement hashing techniques
  8. LO8: Be able to perform the run time analysis of basic algorithms using Big O notation

Course Practicum Requirements

  1. Be proficient in writing, debugging, and running Java or Python programs
  2. Be proficient in writing self-defined classes and functions using Java/Python
  3. Be proficient in utilizing other self-defined classes and functions using Java/Python
  4. Be proficient in running Java/Python program from command line tools and take arguments from command line
  5. If utilizing Java, be proficient in utilizing basic data structures such as ArrayList, Vector, and Queue
  6. If utilizing Python, be proficient in utilizing all the Python data types and Python list, tuple, set, and dictionary, and queue data structures
  7. Be proficient in utilizing Java/Python libraries for reading/writing files, getting system time, and generating random numbers

Course Topics

  1. Sorting algorithms
  2. raph algorithms (breadth-first search, depth-first search, shortest path finding, minimum spanning trees)
  3. Divide-and-conquer algorithms
  4. Greedy algorithms
  5. Dynamic programming algorithms
  6. Balanced trees
  7. Hashing

Course Improvement Decisions

(Course improvement decisions or recommendations from past assessments)

  1. none

ABET Outcome Coverage

(Provide Mapping to ABET Student Outcomes)

  1. TBD

Other Notes

(Any important notes or issues to consider)

  1. none