M.Tech. (Evening) (CST) II Semester
DATA STRUCTURES WITH C++
Course Code : EPECS 203 Category : CE
Credits: 4 Hours : 4 per week
Department: CSE
UNIT I
Introduction
Object oriented programming concepts, Overview of C++ classes, pointers, parameters passing. Data Representation: Linear lists, formula based representation, indirect addresses, simulating pointers, Arrays, matrices, Basics of time complexity
UNIT II
Linked Lists, Stacks And Queues
Single Linked Lists, Double Linked Lists, Circular Lists Operations and Applications, Array and linked representation of stacks Queues: Definitions and operations, Array and linked representation of queues. Circular Queues, Dequeues, Priority Queue, 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 And 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, Spanning Tree ,Minimum Spanning Tree, Prim’s Algorithm, Kruskal’s Algorithm.
Text Book:
1. Data Structures, Algorithms and Applications in C++, S Sahani, Tata McGraw Hill.
2. Data Structures using C and C++ , Yedidyah Langsam, MosheJ Augenstein,
aaron M Tenenbaum , Prentice Hall India.
3. Data Structures & Algorithm Analysis in C++, Mark Allen Weiss. Second
Edition, Pearson Edition. Asia.
Reference Books:
1. Data Structures & Algorithm in C++, Adam Drozdek. Vikas publication House.
2. Data Structure, Algorithm and OOP, Gregory L. Heileman (Tata McGraw Hill Edition)