Syllabus for B. Tech.
I Year II semester
Computer Science and Engineering
Code:101CS01 DATA STRUCTURES AND C++
L T P/D C
3 1 - 3
UNIT – I
Introduction to data structures: Abstract data type(ADT), Stacks and Queues circular
queues and their implementation with arrays.Stack applications: infix to post fix
conversion, postfix expression evaluation. Applications of queues.
UNIT – II
Singly linked lists, doubly linked lists, circular list and their operations, representing
stacks and queues with linked lists.
UNIT – III
Trees- Binary tress, terminology, representation, traversals, Minimal Spanning trees.
Graphs- terminology, representation, graph traversals (dfs & bfs).
UNIT – IV
Searching - Linear and binary search methods.
Sorting - Bubble sort, selection sort, Insertion sort, Quick sort, merge sort.
UNIT – V
Introduction to c++ programming-object oriented programming concepts, Structured
Vs OOP.
Classes and objects-class definition, Objects, class scope and accessing members,
access functions and utility functions.
UNIT – VI
Constructors-default constructor, parameterized constructor, constructor initialization
list, copy constructor. Destructors, Static class members this pointer, friend functions
and classes, Dynamic memory management with operators new and delete.
Overloading-function overloading, Operator overloading, restrictions on operator
overloading, overloading unary and binary operators, type conversion, templates,
inheritance.
TEXT BOOKS
1.Data Structure Through C by Yashavant Kanetkar.
2.The complete reference C++ By Herb Schildt.
3. Data Structures, A pseudocode Approach with C by Richard F. Gilberg & Behrouz
A. Forouzan.
REFERENCES
1. Alfred V. Aho, Jeffrey D. Ullman, John E. Hopcroft. Data Structures and
Algorithms. Addison Wesley, 1983.
2. Data Structures using c Aaron M.Tenenbaum , Yedidyah Langsam,Moshe J
Augenstein.
3. Introduction To Data Structures In C By Kamtane