Data Structure Using C (BVOC 2nd SEM)

SYLLABUS

BVNSD 2.1

Unit 1:

Representation of Single and Multidimensional Arrays; Sparse Arrays– Lower and Upper Triangular Matrices and Tridiagonal Space Matrices with Vector Representation.

Unit 2:

Stack, Queues, Singly Linked List, Doubly Linked List, Circular Linked Lists, Implementing Pointers and Objects, Representing Rooted Trees.

Unit 3:

Heap Sort, Quick Sort, Counting Sort, Radix Sort, Bucket Sort, Median and Order Statistics.

Unit 4:

Introduction and Terminology; Traversal of Binary Trees; Recursive Algorithms for Tree Operations such As Traversal, Insertion, Deletion; Binary Search Tree; B-Tree; Indexing with Binary Search Trees. Direct Address

Tables, Hash Tables, Hash Functions, Open Addressing.

Text Books:

1. Fundamentals of Data structures Using C: Horwitz and Sahni (Silicon Press)

2. Data Structures & Algorithms: R.S.Salaria (KhannaPublishers)

3. Data Structures using C and C++: Langsam, Augenstein, and Tenenbaum (PHI)

4. Introduction to Algorithms: Thomas H. Coreman, Charles E.Leiserson and Ronald L. Rivest (MIT

Press)