ANSI-C Source Code
(Arranged by Chapter)

Part 1: Structuring Data

Chapter 1: Variables and Pointers

• boxFix.c fixed point calculation for a box
• boxFloat.c floating point calculation for a box
• ptrPlay.c playing with pointers
• varfunc.c changing variable w/o pointers
• varPtr.c demonstrate pointers and variables
• vpfunc.c demonstrating vars, ptrs & functions

Chapter 2: Arrays and Records

• arrAdd.c memory allocation for an array
• arrDec.c declaration of a static array
• arrDyn.c dynamic memory allocation in an array
• arrInit.c demonstrate methods of initialization
• arrRec.c arrays of records
• gravity.c calculating gravity
• recFunc.c passing records to functions
• record1.c a first program using records
• record2.c pointers, records, arrays as members
• recPtr.c pointers and record variables

Chapter 3: Linked Lists

• linkList.c create/print a simple linked list
• queue.c queue of characters implement w/linked list
• stack.c stack of characters implement w/linked list

Chapter 4: Trees

• bin3ArrI.c binary tree implemented by array indexes w/ traversal
• bin3Calc.c binary tree implemented by index calc w/ traversal
• bin3ll.c binary tree implemented by linked lists w/ traversal

Chapter 5: Graphs and Sets

• graphLis.c adjacency list implementation of a graph
• graphMat.c adjacency matrix implementation of a graph
• grLisTra.c traversing an adjacency list graph
• grMatTra.c graph traversal using adjacency matrix
• llset.c implementation of sets using an ordered linked list with head node and tail node
• bitset.c implementation of sets using linear bitmap

Part 2: Building Algorithms

Chapter 6: Basic Techniques

• factori2.c calculating factorials using iteration
• factoria.c calculating factorials using recursion
• maze.c moving through a maze using backtracking
• queen.c Solving the n-queen problem with backtracking
• othello.c lookahead demonstration (old)
• reversi.c lookahead demonstration (new)
• zweidre2.c iterative version
• zweidrei.c an example of mutual recursion

Chapter 7: Key Concepts

• complex.c example of complex algorithm
• factoria.c calculating factorials using recursion
• linear1.c check to see if studID is in a list
• linear2.c improved check for studID in list
• nested.c nested loops
• simple.c example of simple algorithm
• summer.c showing effects of algorithms
• sumsqu.c sum up squares to input number

Part 3: Algorithms and Data Structures in Action

Chapter 8: Searching

• searSeqA.c sequential search w/ array
• searSeqL.c sequential search w/ linked list
• searBinA.c binary search w/ array
• searBin3.c binary search using trees
• bin3.c binary search using trees with code to insert and delete nodes (extension to text)
• hash.c search using hash table
• hashll.c hashing demo w/ chaining to resolve collisions (extension to text)
• hashll.pdf explanation of hashing w/ chaining code (extension to text)
• rec.txt database text file used by search routines

Chapter 9: Sorting

• sort.c demonstrating sorting of char

Chapter 10: NP-Hard Problems

• brutForc.c brute-force solution to TSP
• dijkstra.c Nik's flight problem solved (Dijkstra algorithm)

Part 4: Theory of Computing

Chapter 11: Finite State Automata

Chapter 12: Turing Machines

• tmCtrl.c change first 'B' to 'A' then stop
• turing.c Turing machine simulator
• inc.tm Turing machine controller file for incrementer
• inc.tap sample input tape for incrementer
• add1.tm Turing machine controller file for Add1
• add1.tap sample input tape for Add1
• duplicat.tm Turing machine controller file for duplicator
• duplicat.tap sample input tape for duplicator