1. Data Structures

Prerequisite: 102

This course will cover basic data structures that are often used when writing applications in the real world. Students will learn how linked lists, queues, hashtables, and trees work using the GLib library.

Students will work through the following chapters and perform the exercises. Questions may be asked of the mentor as well as the community on IRC.

1.1. Topics

These need to be organized into chapters. Feel free to add topics.

• Big-O notation
• Linked-List (singly and doubly)
• Arrays
  • Generic
  • byte arrays
  • pointer arrays

• HashTable

  • Open HashTable

  • Closed HashTable

• Queues
  • Double ended w/ linked-list
• Trees
  • Binary search tree
  • Red/black tree
• Bitarray
• Circular buffer
• LRU/MRU

1.2. Chapter 1

1.3. Chapter 2

1.4. Chapter 3

1.5. Chapter 4

1.6. Chapter 5

1.7. Chapter 6

1.8. Chapter 7

1.9. Chapter 8

1.10. Chapter 9

1.11. Chapter 10