GITAM University CS Data Structures Syllabus

GITAM University CS Data Structures Syllabus

 

 

 

UNIT – I
Data representation: introduction, linear lists, formula based representation, indirect addressing, simulating pointers, comparisons and applications. Arrays, matrices, special and sparse matrices, single linked list, double linked list, circular linked list.
UNIT – II
Stacks: definitions, operations and applications, array and linked representation of stacks. Queues: definitions and operations. Array and linked representation of queues. Applications.
UNIT – III
Trees: definitions and properties, representation of binary trees, operations. Binary tree traversal. AVL trees and operations on AVL trees, B+ trees, operations on B+ trees and applications.
UNIT – IV
Searching & Sorting: merge sort, quick sort, selection sort, heap sort. Complexity analysis. Sequential search, binary search. Various types of hashing.
UNIT – V
Graphs: definitions and representation of graphs. Graph search methods. Applications.
Text Books:
1. Data Structures. Algorithms and Applications in C++, S.Sahani, Tata Mc-Graw Hill.
2. Date Strctures using C and C++, Yedidyah Langsam, MosheJ Augenstein Aaron M. Tenenbaum, Publisher: Prentice Hall India
Reference books:
1. Seymour Lipschutz (Schaum?s Outline series). McGraw-Hill
2. Sartaz Sahani McGraw – HillS.K. Srivatsava, Deepli Srivatsava. BPB Publications.

Leave a Comment