91福利社

Course Outlines
Course Outlines

Data Structures — ISTC 2050

  1. Course Description
    • Credits: 3.00
    • Lecture Hours/Week: 2.00
    • Lab Hours/Week: 2.00
    • OJT Hours/Week: 0
    • Prerequisites:
      • ISTC 1300: Introduction to Programming
    • Corequisites: None
    • MnTC Goals: None
    This course introduces the student to the theory, design, and implementation of common data structures and related algorithms. Topics include linked lists, recursion, stacks, queues, search algorithms, sorting algorithms, graphs, and binary trees. Students will write numerous programs to demonstrate comprehension of the course topics. PREREQUISITE: ISTC 1300
  2. Course Effective Dates: 8/20/07 – Present
  3. Outline of Major Content Areas
      As noted on course syllabus
  4. Learning Outcomes
    1. Define and use common Abstract Data Types (ADT)
    2. Choose the appropriate data structure for modeling a given problem.
    3. Understand complexity analysis and Big O notation.
    4. Understand recursive solutions and their applications.
    5. Compare and contrast searching and sorting algorithms.
  5. Minnesota Transfer Curriculum Goal Area(s) and Competencies
  6. Learner Outcomes Assessment
      As noted on course syllabus
  7. Special Information
      None noted