Data Structures

Introduction to Data Structures. 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. Introduction to Linked Lists, array-based implementation of Linked Lists. A pointer-based implementation of Linked lists. A pointer-based implementation of Stacks and Queues. Linked implementation of sparse polynomials. 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.

Objectives

not available

Prerequisites

not available

Syllabus

Introduction to Data Structures. 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. Introduction to Linked Lists, array-based implementation of Linked Lists. A pointer-based implementation of Linked lists. A pointer-based implementation of Stacks and Queues. Linked implementation of sparse polynomials. 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.