S-Q Course Book

Daniel J. Ellard

 
• Contents
• Course Information
  • Course Guidelines
  • Homework Guidelines
• Weiss Chapter 2 Notes
  • Definitions
  • Finding the Big-O of a Function
  • Big-O Notation and Algorithm Analysis
• Sparse Arrays
  • A Troublesome Property of C Arrays
  • Linked List Representation
  • An Implementation
  • How Space-Efficient Are Sparse Arrays?
  • A Note About Software Engineering
  • Exercises
• Matrix Operations
  • Terms and Definitions
  • Matrix Addition and Multiplication
  • Faster Matrix Multiplication Algorithms
  • Operations on Sparse Matrices
  • Exercises
• Tries
  • Tries as an Abstract Data Type
  • Tries as a Data Structure
  • Implementing Tries
  • Reducing Memory Requirements: Eliminating Nodes
  • Reducing Memory Requirements: Smaller Nodes
  • More Trie Operations
  • Exercises
• I/O of Data Structures
  • An Introduction
  • Arrays
  • Strings and String Fields
  • Binary Trees
  • Exercises
• The Monte Carlo Method
  • Randomized Algorithms and Probability
  • Monte Carlo Simulation
  • Monte Carlo Integration
  • Exercises
• String Searching
  • The General Problem
  • The Rabin-Karp Algorithm
  • The Knuth-Morris-Pratt Algorithm
  • The Boyer-Moore Algorithm
  • Exercises
• Sparse Arrays Revisited
  • Hash Tables
  • Binary Search Trees
  • Exercises
• Pointers and Malloc
  • Memory and Pointers
  • Arrays and Pointers in C
  • Dynamic Memory Allocation
  • Dynamically Allocating Arrays
• Data Representation
  • Representing Integers
  • Representing Characters
  • Representing Programs
  • Memory Organization
  • Exercises
• About this document ...