Data representation and storage in elementary data structures like arrays and linked lists (both singly linked lists and doubly linked lists). Abstract Data Types (ADT): Stack, Queue, Priority Queue. Comparative analysis of different implementations of ADTs (Array based and linked list based).  Binary Search Tree (including red/black trees), Heap, Efficient  Priority  Queue (Heap based).  Complexity analysis of dictionary operations (insertion/deletion/search) on ADTs. Use of data structures in the design and implementation of smart searching and sorting algorithms (Binary search, Heap sort). Graphs (Connectivity graph, Directed and Undirected graph).

• CEN 201 : Discrete Mathematics

• Navigate, organize, compile C++ projects of moderate complexity (many objects and dependencies)
• Decompose a problem into its supporting data structures such as lists, stacks, queues, trees, etc.
• Diagnose appropriate approaches or algorithms to solve problems involving graph search, tree traversal, optimization, data organization, etc., together with appropriate data structures.
• Implement classic and adapted data structures and applications.
• Analyze the efficiency of implementation choices.

1. Data Structures & Algorithms by Aho, Ullman, Hopcroft
2. C++ Plus Data Structure by Nell Dale
3. Data Structures and Their Algorithms by H. Lewis, L. Denenberg

Biweekly Quiz, Biweekly Programming Assignment, One Midterm Exam, One Final Exam