|
|
CIS 15BGIntermediate Problem Solving in C
Note:
Students may receive credit for either Computer Information Systems 15AG an 15BG, or Computer Information Systems 26A, but not both.
Prerequisites:
CIS 15AG
Advisory:
English Writing 211 and Reading 211 (or Language Arts 211), or English as a Second Language 272 and 273
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, and structures. Pointers: their use in arrays, parameters, and dynamic allocation. Introduction to linked lists.
Text required:
Computer Science: A Structured Programming Approach Using C by Behrouz A. Forouzan & Richard F. Gilberg, third edition, Thomson 2006.
Other requirements:
Use CodeLab, a web-based learning system. http://www.turingscraft.com
Useful Links:
To test your proficiency in C before enrolling in this class, go to
http://puma.deanza.fhda.edu/distribute/
and choose the first folder: _ Review CIS 15 AG
Student Learning Outcomes:
By the end of the course, students will:
- Read, analyze and explain intermediate level C programs.
- Design solutions for intermediate level problems using appropriate design methodology incorporating intermediate programming constructs.
- Create algorithms, code, document, debug, and test intermediate level C programs.
Course objectives:
Upon completion of the course, students will:
- Use software engineering principles to choose between design and programming options and to optimize the design and programming process.
- Create programs which demonstrate the knowledge of pointer manipulation and their use in passing parameters.
- 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 the string Input/ Output functions and some of the string manipulation functions. Create and use other functions to manipulate strings.
- Create programs which use structures.
- Define and use the basic linked list operations: Traverse, Search, Insert, Delete. Design, code, and test programs using linked lists.
|
|
|
