CIS 22B
Intermediate Programming Methodologies in C++

Note: Students may receive credit for either Computer Information Systems (22A and 22B) or 27, but not both.

Prerequisites: CIS 22A

Course Description: A systematic approach to the design, construction and management of computer programs, emphasizing design, programming style, documentation, testing and debugging techniques. Strings, multidimensional arrays, structures, and classes. Pointers: their use in arrays, parameters and dynamic allocation. Introduction to linked lists.

Text required: “Intermediate Programming Methodologies in C++ zyBook” an interactive web-based book. Watch a brief overview for new students using zyBooks on what this new kind of learning material is, and how it can help them better succeed: zyBook Orientation

Learning Management System: Canvas is the online Learning Management System used at De Anza College. Our Canvas Student Guide provides you with instructions and videos on how to perform the most common tasks in Canvas: Canvas Orientation

Student Learning Outcomes: By the end of the course, students will:
  • Create algorithms, code, document, debug, and test intermediate level C++ programs.
  • Read, analyze and explain intermediate level C++ programs and their efficiency.
  • Design solutions for intermediate level problems using appropriate design methodology incorporating intermediate programming constructs including structures and objects.

Course objectives: Upon completion of the course, students will:

  • Create programs which demonstrate knowledge of manipulating data in arrays of one or more dimensions.
  • Create programs which demonstrate knowledge of memory management functions and pointer arithmetic to manipulate data in one-dimensional arrays.
  • Use C-Strings and C++ String class for Input/ Output and manipulation of strings. Create and use other functions to manipulate strings.
  • Create programs which use structures.
  • Use Object-oriented programming concepts to design applications and computer programs.
  • Define and use the basic linked list operations: Traverse, Search, Insert, Delete. Design, code, and test programs using linked lists.
Back to Top