COP 3502 - Computer Science I - Spring 2011

Sample Programs for Computer Science I

Strings
Files
- Reading Grades
- Average Temperature
- Simple Encoding
Arrays and Files
- Reading and Processing Exam Grades
Structures
Dynamic Memory Allocation for 1-D Arrays
- lottery.c
- lottery.in
Dynamic Memory Allocation for 2-D Arrays (Arrays of Strings)
- arrayallocation.c
- arrayallocation2.c
- arrayallocation3.c (Not recommended!!!)
- arrayallocation4.c (Not recommended!!!)
Basic searching and sorting
- sort.c
Linked Lists
- linkedlist1.c (Add to End)
- linkedlist2.c (Add to Front)
- linklist.c (Several Functions)
- circularlinklist.c (Insertion)
- doublelinklist.c (Insertion)
Linked List of Linked Lists
- cd.c
Recursion
- recursion.c (first two recursion lectures)
- towers.c (Towers of Hanoi)
- mysqrt.c (Square Root Computation)
- basconv.c (Base Conversion)
- permute.c (Generating Permutations)
- permute2.c (Permutations with trace data)
- iterperm.c (Iterative Permutation)
- minesweeper.c (Text Minesweeper)
- Golf Fine Example
  - golf.c
  - golf.txt
Determining Run-Time Experimentally
- timesort.c
- arraysum.c
Stacks and Queues
- stack.c (Array Implementation of a Stack)
- stackll.c (Linked List Implementation of a Stack)
- queue.c (Array Implementation of a Queue)
- queuell.c (Linked List Implementation of a Queue)
Binary Trees
- bintree.c
Advanced Sorting and Selection
Hash Tables
- hashtable.c
- htablelinear.c
Heaps and Heap Sort
- heap.c
Backtracking
- eightqueens.c
Min-Max Trees
- tttcomp.c (Computer Tic-Tac-Toe Player)
Miscellaneous
- bitwise.c
- buyset.c