Scribd
Upload
182 views2 pages

DS

This document outlines the objectives and units of a course on data structures. The objective is to learn a program-independent view of data structures, their representations, and operations in the context of algorithms. The 5 units cover linear and non-linear data structures like arrays, stacks, queues, trees, and graphs. Additional topics include searching structures like AVL trees and priority queues, sorting algorithms, and searching/indexing methods like hashing. The course aims to increase knowledge of using data structures in algorithm design.

Uploaded by

ryu447
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
182 views2 pages

DS

This document outlines the objectives and units of a course on data structures. The objective is to learn a program-independent view of data structures, their representations, and operations in the context of algorithms. The 5 units cover linear and non-linear data structures like arrays, stacks, queues, trees, and graphs. Additional topics include searching structures like AVL trees and priority queues, sorting algorithms, and searching/indexing methods like hashing. The course aims to increase knowledge of using data structures in algorithm design.

Uploaded by

ryu447
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DATA STRUCTURES 3 0 0 3

OBJECTIVE

Learning program independent view of data structures, including its
representation and operations performed on them, which are then linked to
sorting, searching and indexing methods to increase the knowledge of usage of
data structures in algorithmic perspective.

UNIT I LINEAR DATA STRUCTURES 11

Abstract Data Types - Asymptotic Notations: Big-Oh, Omega and Theta Best,
Worst and Average case Analysis: Definition and an example Arrays and its
representations Stacks and Queues Linked lists Linked list based
implementation of Stacks and Queues Evaluation of Expressions Linked list
based polynomial addition.

UNIT II NON-LINEAR DATA STRUCTURES 9

Trees Binary Trees Binary tree representation and traversals Threaded
binary trees Binary tree representation of trees Application of trees: Set
representation and Union-Find operations Graph and its representations
Graph Traversals Connected components.

UNIT III SEARCH STRUCTURES AND PRIORITY QUEUES 9

AVL Trees Red-Black Trees Splay Trees Binary Heap Leftist Heap

UNIT IV SORTING 8

Insertion sort Merge sort Quick sort Heap sort Sorting with disks k-way
merging Sorting with tapes Polyphase merge.

UNIT V SEARCHING AND INDEXING 8

Linear Search Binary Search - Hash tables Overflow handling Cylinder
Surface Indexing Hash Index B-Tree Indexing.



TOTAL : 45

TEXT BOOKS:

1. Ellis Horowitz and Sartaj Sahni, Fundamentals of Data Structures,
Galgotia Book Sorce, Gurgon, 1976.
2. Gregory L. Heilman, Data Structures, Algorithms and Object Oriented
Programming, Tata Mcgraw-Hill, New Delhi, 2002.

REFERENCES:

1. Jean-Paul Tremblay and Paul G. Sorenson, An Introduction to Data
Structures with Applications, Second Edition, Tata McGraw-Hill, New
Delhi, 1991.
2. Alfred V. Aho, John E. Hopcroft and Jeffry D. Ullman, Data Structures &
Algorithms, Pearson Education, New Delhi, 2006.

You might also like