Data Structures

The goal of this course is to introduce students to the fundamental data structures as Abstract Data Types (ADT) , to show the usefulness of these structures in problem solving as well as show how these abstract concepts can be implemented using a programming language. The course focuses both on the abstract model and its implementation so that the students can learn about the abstract concepts of data structures, as well as their implementation and applications.

Objectives

not available

Prerequisites

not available

Syllabus

-- Introduction to Data Structures, Abstract Data Type (ADT) -- Basic data types (integer, real, character, boolean) -- ADT array, record, set. -- Stacks, basic operations, implementing stacks with arrays and records, application of stacks. -- Queues, basic operations, implementing Queues with arrays and records, application of Queues. -- Lists, basic operations, sequential storage implementation of Lists. -- Linked Lists,a pointer-based implementation of Linked Lists. A pointer-based implementation of Stacks and Queues, applications. -- Binary Trees, basic operations. A pointer-based implementation of Binary Trees. A recursive implementation of Binary trees. Application of Binary Trees: Huffman Codes. -- Hashing, open probing, Chaining. -- B-Trees. AVL Trees, basic operations.