Updated Order of Lecture Topics for CCS 1300

The following is the updated order of the lecture topics to be followed in CCS 1300: Data Structures and Algorithm. Please take note of the changes in preparation for the prefinal exams.

LECTURE TOPICS 

PRELIM

I.       Software Engineering Principles and Java Classes

1.     Software Life Cycle

2.     Software Development Phase

3.     Algorithm Analysis: The Big-O Notation

4.     User Defined Classes

5.     Abstract data types

II.     Inheritance and Exception Handling

1.     Inheritance

2.     Abstract Methods and Classes

3.     Composition

4.     Exception Handling

MIDTERM

III.    Array-Based Lists

1.     Types of List Elements

2.     class ArrayListClass

3.     Unordered Lists

4.     class Vector

IV.   Linked Lists

1.     Link Lists Properties

2.     Item Insertion and Deletion

3.     Building Linked Lists

4.     Linked Lists as ADT

5.     Unordered Linked Lists

6.     Ordered Linked Lists

7.     Doubly Linked Lists

8.     Linked Lists with Header and Trailer Nodes

9.     Circular Linked Lists

V.     Stacks

1.     Stacks

2.     StackException class

3.     Implementation of Stacks as Arrays

4.     Linked Implementation of Stacks

5.     Stack as Derived from the class LinkedListClass

6.     Application of Stacks

7.     Removing Recursion

8.     class Stack

VI.   Queues

1.     Queues

2.     Queue exception class

3.     Implementation of Queues as Arrays

4.     Linked Implementation of Queues

5.     Queue Derived from the class LinkedListClass

6.     Priority Queues

7.     Application of Queues

PREFI

VII. Search Algorithms I

1.     Search Algorithms

VIII.     Sorting Algorithms

1.     Sorting Algorithms

2.     Selection Sort: Array-Based Lists

3.     Insertion Sort: Array-Based Lists

4.     Insertion Sort: Linked List-Based Lists

5.     Lower Bound on Comparison-Based Search Algorithms

6.     Quick Sort: Array-Based Lists

7.     Merge Sort: Linked List-Based Lists

8.     Heap Sort: Array-Based Lists

9.     Priority Queues(Revisited)

IX.   Recursion

1.     Recursive Definition

2.     Recursion or Iteration?

3.     Recursion and Backtracking: 8-Queens Puzzle

X.     Binary Trees I

1.     Binary Trees

2.     Binary Tree Traversal

3.     Binary Search Trees

      FINALS

XI.   Binary Trees II

1.     Nonrecursive Binary Tree Traversal Algorithms

2.     AVL (Height-Balanced) Trees

XII. Search Algorithms II

1.     Lower Bound on Comparison-Based Search Algorithms

2.     Hashing

XIII.     Graphs

1.     Introduction to Graphs

2.     Graph Definition and Notations

3.     Graph Representation

4.     Operations on Graphs

5.     Graphs as ADTs

6.     Graph Traversals

7.     Shortest Path Algorithm

8.     Minimal Spanning Tree

9.     Topological Order