Structuring Data & Building Algorithms
Sitemap

Most animations and links can be accessed using the Menu bar on homepage as well as through this file.

Supporting Materials

• Lecturer Resources: (Most Offline: contact McGraw-Hill or Author)
  • Index to Tests, Outline
  • Viewgraphs
• Reference Materials on ANSI-C Programming, Reference Materials,Links
  • About the Book...
  • About the Authors...
  • About You...
  • ANSI-C Reference Manual
  • Recommended C Style and Coding Standards
  • C Traps and Pitfalls
  • Suggested Reference Books
• Tools: Software to view animations + ANSI-C Compiler & Text Editor (Installation instructions)
• Link redirects
• ANSI-C Source Code for Examples Shown in Text Book (Index)
• Multimedia University Specific Info
• Yuan Ze University Specific Info

Main Text Support

• Key Words in English and Chinese

1: Structuring Data (Animations (right click download) & Links)

• Ch 1 Variables & Pointers
• VP Diag: Demonstration of How to View VP Diagram Animations
• 1.2.2 General: Fixed Point Addition
• 1.2.2 General: Fixed Point Multiplication
• 1.2.2 General: Floating Point Addition
• 1.2.2 General: Floating Point Multiplication
• 1.2 Formal Fixed and Floating Point Specification (Link)
• 1.3 Role Play: Pointers and Variables (+ Audio) [Chinese version]
• 1.3-0 VP Diag: 1 Variable, 1 Pointer
• 1.3-1 VP Diag: Demonstration of Pointers and Variables
• 1.4-0 VP Diag: Variables, Functions, Pointers
• 1.4-1 VP Diag: Variables, Functions – Good Style
• Ch 2 Arrays & Records
• 2.1.1 VP Diag: Array Memory Usage
• 2.1.4 VP Diag: Array Declaration
• 2.1.4-7 VP Diag: Dynamic Array Declaration
• 2.1.5 VP Diag: Array Initialization
• 2.2.4 VP Diag: Basic Records
• 2.2.5 VP Diag: Pointers and Records
• 2.2.6 VP Diag: Records and Functions
• 2.2.7 VP Diag: Other Record Members
• 2.3 VP Diag: Arrays of Records
• Ch 3 Linked Lists
• 3. Concept: Linked Lists & Trains
• 3.2 VP Diag: Linked Lists
• 3.4 Role Play: Stacks (+ Audio)
• 3.4 VP Diag: Stacks
• 3.5 VP Diag: Introduction to Push and Pop (Queue implementation)
• 3.5 Role Play: Queues (+ Audio) [Chinese version]
• 3.5 VP Diag: Queues
• Ch 4 Trees
• 4.4.1 VP Diag: Binary Tree – Linked List Implementation
• 4.4.1 Role play: Binary Tree: Linked List:Preorder Traversal
• 4.4.1 Role play: Binary Tree: Linked List:Inorder Traversal
• 4.4.1 Role play: Binary Tree: Linked List:Postorder Traversal
• 4.4.2 Concept: Binary Tree – Array Implementation w/ Index Referencing
• 4.4.2 Role play: Binary Tree – Array Implementation w/ Index Referencing – Preorder Traversal
• 4.4.2 Role play: Binary Tree – Array Implementation w/ Index Referencing – Inorder Traversal
• 4.4.2 Role play: Binary Tree – Array Implementation w/ Index Referencing – Postorder Traversal
• 4.4.3 VP Diag: Binary Tree – Array Implementation w/Index Calculation
• Ch 5 Graphs and Sets
• 5.3.1 Role Play: Graphs: Array Style Implementation
• 5.3.2+5.4.2 VP Diag: Linked List Implementation of a Graph
• 5.5.1 VP Diag: Sets: Linked List Implementation
• 5.5.2 Role Play : Sets: Bit Map implementation (+ Audio)

2: Building Algorithms (Animations + Links)

• Ch 6 Basic Techniques
• 6.1.1 Concept: Recursion, Tower of Hanoi
• 6.1.2 Role Play: Factorial, Recursive Solution (+ Audio)
• 6.1.2 Code Flow: Factorials by Recursion (Memory Allocation)
• 6.1.2 General: Factorials – Recursion and Iteration (+ Music)
• 6.1.2 VP Diag: Factorials by Recursion
• 6.1.2 VP Diag: Factorials by Iteration
• 6.1.2 Role Play: Factorial, Iterative Solution (+ Audio)
• 6.2 Concept: Mutual Recursion, Zweidrei
• 6.2 VP Diag: Mutual Recursion, Zweidrei
• 6.3 Concept: Backtracking through Maze (Overview)
• 6.3 Concept: Backtracking through Maze (Build your maze)
• 6.3 Code flow: Backtracking through Maze (Car)
• 6.3 Code flow: Backtracking through Maze (+ Audio)
• 6.3 VP Diag: Backtracking through Maze
• 6.3-4 VP Diag: Backtracking to solve 4 Queens problem
• 6.4 Concept: Look-ahead(Reversi) (Links)
•    6.4 Look-ahead ENN Published Paper Chong
•    6.4 Look-ahead ENN Published Paper Chong
• Ch 7 Key Concepts
• 7.1 Pseudo-code (Link)
• 7.3-1 VP Diag: Operation Count Example
• 7.4 Big-Oh (Link)

3: Algorithms & Data Structures in Action (Animations + Links)

• Ch 8 Searching
• 8.1.1 Role Play: Algorithm: Sequential Search. Data Structure: Array
• 8.2.1 Role Play: Algorithm: Binary Search. Data Structure: Array
• 8.2.1 VP diag: Algorithm: Binary Search. Data Structure: Array
• Ch 9 Sorting
• 9 (all) Concept: Overview of Sorting Algorithms
• 9 (all) Concept: Overview of Sorting Algorithms with Operation Count
• 9.2.1 Role Play: Selection Sort using an Array
• 9.2.2 Role Play: Insertion Sort using an Array
• 9.2.3 and 9.3.5 Concept: Bubble vs. Quick Sort
• 9.3 VP Diag: Merge Function of Merge Sort operating on a Linked List
• 9.3.5 VP Diag: Algorithm: Quick Sort 2. Data Structure: Array
• Ch 10 NP-Hard Problems
• 10 Travelling Salesman Problem Definition (Link NIST)
• 10.3 Concept: Dijkstra's Algorithm
• Carla Laffra's Java Simulation of Dijkstra's Algo (Link)

4: Theory of Computing (Animations + Links)

• Ch 11 Finite State Automata
• Ch 12 Turing Machines
• 12.3 Introductory Example (B→A) : Controller expressed as State Diagram & Tuples (w/Pseudo-Code)
• 12.4.1 Incrementer. Controller expressed as State Diagram & Tuples (w/Pseudo-Code)
• 12.4.2 Add One w/ Controller expressed as Tuples (compare Pseudo-Code)
• 12 Turing Machine Simulator (written in ANSI-C) Controllers read from files as Tuples