El Camino College - Division of Mathematical Sciences

Computer Science 2
Introduction to Data Structures
5 units; 4 hours lecture; 3 hours lab

Catalog Description Course Objectives and Methods of Evaluation
Outline of Subject Matter Planned Instructional Activities

Grading Method: Letter

Associate Degree Credit --- Transfers to CSU and Transfers to UC

Prerequisite: Computer Science 1 with a minimum grade of C or equivalent.

Recommended preparation: Mathematics 190

Catalog Description:
This course includes a thorough coverage of pointer variables, functions pointers, and structures and classes with member functions. Students will learn elementary data structures concepts, including stacks, queues, linked lists, dynamic memory allocation, recursion, binary trees, sorting and searching algorithms, efficiency considerations, and general top-down program design and object oriented programming methods.

Course Objectives and Methods of Evaluation:
  1. Course objectives (list the major objectives stated as student outcomes in behaviorally measurable terms.)
    1. Utilize pointer variables, function-pointers, and the dynamic allocation of memory to create versatile programs.
    2. Use structures and classes to implement and manipulate the following data structures in static and dynamic form: stacks, queues, linked lists, and binary trees.
    3. Apply recursive techniques to lists, trees, and sorting.
    4. Implement searching algorithms.
    5. Implement sorting algorithms.
    6. Evaluate structures and algorithms with respect to efficiency of implementation and manipulation.
    7. Apply C++ language facilities and general top-down program design and object oriented methods to a variety of computer laboratory problems.
  1. Methods of Evaluation - Associate Degree Credit Course
    1.  Substantial writing assignments, including:
      1. The course primarily involves skill demonstrations or problem solving.
    2. Computational or non-computational problem-solving demonstrations, including:
      1. exam
      2. homework problems
      3. Write computer programs

Return to the top of the page.

Outline of Subject Matter
 

Approximate Time

Major Topic

11 hours

 Pointers variables, function pointers, dynamic memory allocation.

19 hours

 Built-in C++ data structures, addressing, information hiding, abstract data types, strings and dynamic arrays, applications.

15 hours

 Classes, overloading functions, overloading operators.

9 hours

 Stacks, their implementation and manipulation using static storage techniques and applications.

11 hours

 Linked lists, their implementation and manipulation using static, storage techniques and applications.
8 hours Queues, their implementation and manipulation using static storage techniques and applications.
11 hours Recursion, applications to stacks, queues, trees, sorting, and linked lists.
13 hours Binary trees, implementation and manipulation using static and dynamic storage and applications.
9 hours Sorting and efficiency consideration.
9 hours Searching and applications.

11 hours

Examinations.

Total:

126 Hours

Return to the top of the page.

Planned Instructional Activities:

Lectures, computer laboratory, and individual assistance.

Entrance Skills and Knowledge:

List the required skills and/or knowledge without which a student would be highly unlikely to receive a grade of A, B, C, or Credit (or for Health and Safety, would endanger self or others) in the Target Course.
  1. Analyze and solve procedural programming problems
  2. Solve problems requiring iteration and selection structures in C++
  3. Solve problems requiring single and multidimensional arrays in C++
  4. Solve problems requiring structures in C++
Return to the top of the page.
 
Source of information: Course Outline of Record dated November, 2001


 Last Updated On: 4/20/06