Course

Course Summary
Credit Type:
Course
ACE ID:
SDCM-0217
Organization's ID:
Computer Science 201
Organization:
Location:
Classroom-based
Length:
Self-paced. 20 weeks (45 hours)
Dates Offered:
Credit Recommendation & Competencies
Level Credits (SH) Subject
Lower-Division Baccalaureate 3 Computer Information Systems, Information Technology, or Computer Science
Description

Objective:

The course objective is to teach students the foundations of data structures and algorithms. Students will learn the fundamentals of the Java programming language, object-oriented design, core data structures, algorithms, trees, priority queues, text processing, and memory management.

Learning Outcomes:

  • Explain how search and sorting algorithms work
  • Explain how stacks, queues and linked lists work
  • Explain maps, graphs, and text processing
  • Define object-oriented principles of design
  • Design abstract data types
  • Analyze various algorithms using the Big-O notation
  • Explain and develop recursive algorithms
  • Explain how trees, hash tables and graphs work
  • Explain memory management

General Topics:

  • Basics of Java
  • Object-oriented design fundamentals
  • Core data structures
  • Analyzing algorithms
  • Recursion and recursive algorithms
  • Stacks, queues and lists in Java
  • List and iterator abstract data types
  • Trees in data structure
  • Priority queues in Java
  • Maps and hash tables in data structures
  • Search trees and types
  • Sorting and selection in Java
  • Text processing
  • Graph data structures
  • Memory management
Instruction & Assessment

Instructional Strategies:

  • Audio Visual Materials

Methods of Assessment:

  • Examinations
  • Quizzes

Minimum Passing Score:

70%
Supplemental Materials