Department of Computer Science

Computer Science 1321
Examination One Review Topics
Spring Semester 1998

The first examination of the semester will cover chapters 1-3, 4.1 and 
4.2 of the textbook. Please read this material if you haven't done so
before. Specifically, the exam will cover the following topics:

1. Arrays
	one dimensional
	two dimensional
	automatic allocation
	dynamic allocation
		malloc
		calloc
		realloc
		free
		sizeof
	array input
	array output
	arrays and pointers
2. Structures
	typedef
	pointers to structures
		(*ptr).sm
		ptr->sm
	arrays of structures
	structures containing arrays
	structures containing structures
	structure input
	structure output
3. Stacks
	theory and definitions
		push
		pop
		empty
	C implementation of Stacks
		push
		pop
		empty
		full 
	Applications of stacks
		postfix evaluation	
		infix to postfix conversion
		recursion
		infix, prefix and postfix evaluation (by hand)
4. Recursion
	recursion defined
	C implementation of recursion
	Applications and examples
		factorial
		exponents
		products
		gcd
		combinations
		fibonacci
		recursive loops
		array sums
		array max
		array min
	recursive definitions
5. Queues
	theory and definitions
		arrive()
		serve()
		empty
	C implementation of queues
		array?
		structure?
		linked list?
6. Introduction to Linked Lists
	dynamic implementation
	insertion into a linked list