Data Structures using C++ (BEC515C)

Data Structures using C++

Course Code BEC515C 
CIE Marks 50
Teaching Hours/Week (L: T:P: S) 2:2:0:0 
SEE Marks 50
Total Hours of Pedagogy 40 
Total Marks 100
Credits 03 
Exam Hours 03
Examination type (SEE) Theory

Module-1

UNIT-I: Software Engineering Principles And C++ Classes

Software Life Cycle, Software Development Phase, Classes.

Page No. 1-7, 17-33

OOD: Inheritance, Polymorphism, Templates

Page No. 60-78,84-112

UNIT-II: Pointers & Array based Lists

Pointer Data Type and Pointer Variables, Classes & Pointers, Inheritance Pointers &Virtual

functions, Abstract Classes & Pure Virtual functions, Array Based Lists

Page No. 131-183

Module-2

UNIT-III: Linked Lists &Stacks

Linked List, Linked List as an ADT, Unordered Linked List, ordered Linked List, Doubly Linked

Lists

Page No. 265-320

Stack: Stacks, Implementation of Stacks as Arrays , Linked Implementation of Stacks

Page No. 395-428

Module-3

UNIT-IV: Queues and Algorithms

Queue Operations, Implementation of Queues as Arrays, Linked Implementation of Queues, STL

class queue, Priority Queues, Application of Queues: Simulation.

Page No. 451-490

Search Algorithms, Hashing, Sorting Algorithms: Selection sort, Insertion sort, Shell Sort.

Module-4

UNIT-V: Binary Trees and B-Trees

Binary Trees, Binary Tree Traversal, Binary Search Trees, Binary Search Tree: Analysis, Nonrecursive Binary Tree Traversal Algorithms, Binary Tree Traversal and Functions as Parameters,

AVL (Height-Balanced) Trees, B-Trees

Module-5

UNIT-VI: Graphs

Introduction, Graph Definitions and Notations, Graph Representation, Operations on Graphs,

Graphs as ADTs, Graph Traversals, Shortest Path Algorithm, Minimum Spanning Tree,

Topological Order, Euler Circuits

Text Book:

1.D.S.Malik - Data Structures using C++2nd Edition.

Reference Book

1. Sartaj Sahni – Data Structures, Algorithms, and Applications in C++ 2nd Edition