COURSE PLAN

For
Data Structure Using C++ (CSET202)

Faculty Name: Dr Rajesh Shrivastava (Co-ordinator), Dr. Gaurav

Kumar, Dr. Kapil Juneja, Dr. Priyanka, Dr. Brijendra
Pratap Singh, Dr. Debajyoti Ghosh, Dr. Hemant
Petwal, Dr. Rajiv Kumar, Dr. Sandhya Tarwani, Dr.
Saurabh Kumar Srivastava, Dr. Vikash K. Jain, Mr.
Amit Pandey, Dr. Rajnish Kumar Chaturvedi, Dr.
Sangeeta Kumari, Dr. Divya Kumari
Course Type: : Core

Semester and Year: : IIIrd Semester (IInd Year)

L-T-P: : 3-1-4

Credits: :6

Department: : SCSET

Course Level: : UG (BTech)

School of Computer Science Engineering and Technology

Bennett University
Greater Noida, Uttar Pradesh
 CSET202 – Data Structure Using C++
Course Type - Core L-T-P Format 3-1-4 Credits – 6
COURSE SUMMARY
C++ OOPS Concepts, Pointers, Structures, Asymptotic Analysis, Arrays, Searching, Recursion,
Sorting, Linked List, Stacks, Queues, Trees, Binary Search Trees, Heaps, Priority Queues, Hashing,
Graphs, Height Balanced Trees: AVL Trees, RB Trees, B Trees, B+ Trees, Disjoint Sets, van Emde
Boas Tree.

COURSE-SPECIFIC LEARNING OUTCOMES (CO)

CO1: Articulate the design, use and associated algorithms of fundamental and abstract data structures
CO2: Examine various searching and sorting techniques based on complexity analysis for applicative
solutions.
CO3: Demonstrate hands-on experience on implementing different data structures
CO4: Build optimized solutions for real-word programming problems using efficient data structures.

DETAILED SYLLABUS
Module 1 (Contact hours: 10)
Why Data Structures, First C++ Program, Execution Cycle of C++ Program, OOPs Concepts, C++
Inheritance, Multiple inheritance, Friend Function, Run-time Polymorphism, Time Complexity:
Asymptotic Analysis, Big- Omega, Big-Theta, Big-Oh Notation, Handling Arrays, Insertion,
Deletion, Traversal, Linear Search, Recursion, Binary Search, Tower of Hanoi, Sorting, Bubble Sort,
Selection Sort, Insertion Sort, Merge Sort, Shell Sort, Counting Sort.

Module 2 (Contact hours: 10)

C++ Pointers, Structures and Unions, Linked List, Singly Linked List Implementation, Singly Linked
List Traversal, Searching, Insertion, Deletion, Polynomial Handling, Circular Linked List, Traversal,
Insertion, Deletion, Stacks, Traversal, Insertion, Deletion, Infix to Postfix Conversion, Post-fix
Expression Evaluation, Deques, Queues, Simple Queue Insertion, Deletion, Traversal, Circular
Queue Insertion, Deletion, Traversal.

Module 3 (Contact hours: 11)

Tree Data Structures, Height, Complete, Full, Perfect Trees, Binary Search Trees, Pre-Order, In-
Order, Post- Order, BST Searching, BST Insertion, BST Deletion, Heaps, Min-Max Heaps, HeapSort,
Hashing, Hash Functions, Hash Tables, Hashing Collision Resolution Strategies: Separate Chaining,
Open Addressing, Double Hashing, Graphs, Different Types of Graphs, Graphs Representations,
Incidence Matrix, Adjacency Matrix, Graphs Traversals: BFS, DFS, Topological Sort.

Module 4 (Contact hours: 11)

Height Balanced Trees: AVL Trees, Balanced Factor, Rotations, Insertion, Deletion, Red Black
Trees, Insertion, Deletion, B Trees, Insertion, Deletion, B+ Trees, Insertion, Deletion, Disjoint Sets,
Path Compression, Union Finding Algorithm, van Emde Boas Tree.
 STUDIO WORK / LABORATORY EXPERIMENTS:

The laboratory of Data structures is designed to provide a practical exposure to the students about the
concepts and topics taught in the classroom sessions. Implementing the learnt concepts using C++
will help the students to have a better understanding of the subject.

TEXTBOOKS/LEARNING RESOURCES:
1. John Carey,Shreyans Doshi and Payas Rajan, C++ Data Structures Algorithm Design Principles
(1st ed.), Packt Publishing, 2019. ISBN 9781838827919.
2. Yashavant Kanetkar, Data Structures Through C++ (1st ed.), Cengage Learning, 2019. ISBN
9789388511360.

REFERENCE BOOKS/LEARNING RESOURCES:

1. Yang hu, Algorithms C++ (1st ed.) (3rd ed.), Cengage Learning, 2020. ISBN 9798676695750.

ASSESSMENT COMPONENT:

Components of Course Evaluation Percentage

Distribution
Certification 10
End Term Examination 35
Lab Continuous Evaluation 20
Project Evaluation 25
Tutorial Evaluation 10