Module 2: Linear Data Structures

Stacks, Queues, Abstract Data Types

Language Topics

  • Class pointers and instantiation
  • Dynamic Memory Allocation (stack vs. heap)
  • Using new and delete to manage heap memory
  • Pointers as function parameters
  • Pointers as class members: construction, destruction and copy
  • Linked lists and arrays
  • Stacks and queues

Textbook chapters 8, 16

Homework Assignment

Path Search

Due Thu, March 30th

Late -10% until 11:59pm, Sat 4/1. If you commit between the due date and the late date, we'll consider it a late submission.

Tue, Feb 14

Dynamic Memory

Textbook References

  • Chapter 8, sections 1-6
  • Chapter 16, section 1

Assignments

  • Finish the Exam Review questions, get checked off (due Th, 2/16)
  • Complete Self Check exercises 8.14, 8.15 (due Tu, 2/21)

Thu, Feb 16

Meet in ACSB 2.120 (lab)

Lab: Dynamic Array (due Th 2/23)

Tue, Feb 21

Exam 1 Make-up Quiz

Lab Discussion

Brief intro to linked lists

Assignments

  • Finish the Dynamic Array lab

Thu, Feb 23

Meet in ACSB 2.120 (lab)

Grade reports

Linked lists

Textbook References

  • Chapter 8, sections 8
  • Chapter 16, sections 2, 8, 16

Lab: Linked Lists (due Th 3/2)

Tue, Feb 28

Lab recap: print, find, append

Linked lists: insert and delete

Textbook References

  • Chapter 16, sections 3-4

Assignments

  • Finish the Linked List lab

Thu, Mar 2

Meet in ACSB 2.120 (lab)

Lab: Insert and Delete (due Th 3/9)

Tue, Mar 7

Meet in ACSB 2.120 (lab)

Lab: Homework Kickoff (ADT) (due Th 3/23)

The homework, which builds off this lab, will also be due Th, 3/23.

Thu, Mar 9

Module 2 Exam

Tue, Mar 21

Recap of Exam, Homework

Thu, Mar 23

Meet in ACSB 2.120 (lab)

Homework notes (lab 04 review): Queue and Stack

Lab: Exam Review (due Th 3/30)