Title: Introduction to Computer Science II

Catalog Data:
Fundamentals of programming and program design using a high-level block-structured language. To introduce multidimensional arrays, pointers, logical records, searching and sorting algorithms, binary file I/O, linked lists, and recursion.

(3 hrs. credit)

Textbook: Programming and Problem Solving in C by Hanly

Software: Microsoft Visual C++ on Lab PCs or GNU C/C++ on UNIX systems

Goals: To provide CSC students with the skills to write programs which are well structured and highly modular.

Prereq:

1. Credit in CSC 1250
2. Credit or registration in MATH 1550

Course Topics:

1. Multidimensional arrays
   • declaration, initialization, and accessing array elements
   • arrays of strings
2. Pointers
   • declaration, initialization, and the pointer operators & and *
   • pointer expressions (assignments and pointer arithmetic)
   • pointers and arrays (pointers to arrays and arrays of pointers)
   • pointers and strings (pointers to character arrays)
   • pointers to pointers (multiple indirection)
   • pointers to functions
3. Passing arguments to subroutines using call-by-reference (address)
   • passing the address of simple data types
   • passing the address of arrays (single- and two-dimensional)
   • passing the address of functions
4. Structures, unions, and user-defined variables
   • declaration of structures and referencing structure elements
   • arrays of structures
   • passing structures to and returning structures from functions
   • structure pointers and passing structures by address to functions
   • declaration of unions and referencing union elements
   • enumerations and typedef to create user-defined data types
5. Searching routines
   • linear search and binary search
6. Linear sorting algorithms
   • bubble sort, selection sort, and insertion sort
7. Binary file I/O and random file I/O
   • buffered block I/O (fread() and fwrite() functions)
   • buffered random access I/O (fseek() function)
8. Dynamic memory allocation (malloc() and calloc() functions)
9. Linked Lists (array-based and pointer-based)
10. Recursion (using arrays and linked lists)

The homework list for this course will appear here.

The list of old tests for this course will appear here.