Data Structures

Hussein Suleman

1997

---

Course Outline

• Introduction
• Basic Data Types
• Classes and Object-Oriented Programming
• Collection Classes
• Complexity of Algorithms
• Lists
• Stacks
• Queues
• Memory and Pointers (3)
• Recursion (2)
• Linked Lists (10)
• Single
• Double
• Circular
• Stack
• Queue
• C++ Concepts (5)
• Constructors/Destructors
• Inheritance
• Polymorphism
• Templates
• Trees (5)
• Advanced Data Structures (10)
• Heap
• AVL Trees
• Priority Queues
• Graphs
• Sorting and Searching (10)
• Bubble, Insertion, Selection, Quick, Merge, Heap, Radix, Tree, Tournament
• Linear, Binary, Hash, Dictionary

Practicals

• Practical One: Program Syntax Checker
  due : 4pm 28 February 1997
• Practical Two: Object-Oriented Programming
  due : 4pm 7 March 1997
• Practical Three: Abstraction
  due : 4pm 17 March 1997
• Practical Four: Circular Queue Buffers
  due : 4pm 24 March 1997
• Practical Five: Singly Linked List
  due : 4pm 14 April 1997
• Practical Six: Circular Doubly Linked List
  due : 4pm 22 April 1997
• Practical Seven: Inheritance and Polymorphism
  due : 12am (midnite) 28 April 1997
• Practical Eight: Binary Search Trees
  due : 12am (midnite) 13 May 1997
• Practical Nine/Ten: Hybrid Data Structures
  due : 12am (midnite) 28 May 1997
• Practical Eleven: Hash Tables
  due : 12am (midnite) 5 June 1997

Sample Programs

Tutorials

• Tutorial One (24 March)
• Tutorial Two (20 May)