Data Structure II (CS-3004)
rgpv bhopal, diploma, rgpv syllabus, rgpv time table, how to get transcript from rgpv, rgpvonline,rgpv question paper, rgpv online question paper, rgpv admit card, rgpv papers, rgpv scheme
RGPV notes CBGS Bachelor of engineering
Objectives
Data structures play a central role in modern computer science. In addition, data structures are essential building blocks in obtaining efficient algorithms. The objective of the course is to teach students how to design, write, and analyze the performance of programs that handle structured data and perform more complex tasks, typical of larger software projects. Students should acquire skills in using generic principles for data representation & manipulation with a view for efficiency, maintainability, and codereuse. Another goal of the course is to teach advance data structures concepts, which allow one to store collections of data with fast updates and queries.
Syllabus
UNIT 1:
Introduction –Common operations on data structures, Types of data structures, Data structures &
Programming, Program Design, Complexities, Time Complexity, order of Growth, Asymptotic
Notation.
UNIT 2:
Advanced Data Structures-Hash tables ,Heaps , Complexity , Analysis of Heap Operations , Application
of Heap , AVL tress , Insertion & Deletion in AVL tree , Red Black Trees , Properties of Red Black
trees ,Insertion & Deletion in Red Black tree .
UNIT 3:
Sorting –Need for sorting , Types of sorting algorithm-Stable sorting Algorithm, Internal & External
sorting algorithm , Outline and offline algorithm ,Sorting Techniques-Insertion , Shell , Selection ,
Merge ,Quick sort, Radix sort ,bucket sort .
UNIT 4:
Augmenting Data structures – Augmenting a red black trees, Retrieving an element with a given rank ,
Determining the rank of element ,Data structure Maintenance ,An augmentation strategy ,Interval Trees.
UNIT 5:
File structures- Basic file operations, File organization –Sequential file organization, Indexed sequential
file organization, Direct file organization. External merge sort, Multiway Merge sort, Tournament Tree
,Replacement Selection .
NOTES
- Unit 1
- Unit 2
- Unit 3
- Unit 4
- Unit 5
Books Recommended
1. Horowitz and Sahani, “Fundamentals of data Structures”,University Press
2. Trembley and Sorenson , “Data Structures”, TMH Publications
3..A. M. Tenenbaum, “Data Structures using C & C++”, Pearson Pub
4. Venkatesan , Rose, “Data Structures” Wiley India Pvt.Ltd
5. Pai; Data structure and algorithm , TMH Publications
6. T.H.Coreman,”Introduction to algorithm”,PHI.
