WALCHAND INSTITUTE OF TECHNOLOGY, SOLAPUR
Second Year B.Tech (Computer Science & Engineering) Semester-III
22CSU3CC3T : DATA STRUCTURES
Teaching Scheme Examination Scheme
Lectures:3 Hrs/Week,3 Credits ESE:60 Marks
Practical:2 Hrs/Week,1 Credits ISE:40 Marks
ICA:25 Marks
POE: 50 Marks
---------------------------------------------------------------------------------------------------------------------
Introduction:
This course introduces various data structures like searching sorting, stack, queue, linked list,
trees, graphs and hashing techniques. Course includes implementation of various operations of
these data structures and some applications.
---------------------------------------------------------------------------------------------------------------------
Course prerequisites:
This course requires prior knowledge of any basic programming language.
---------------------------------------------------------------------------------------------------------------------
Course Objectives:
1. To introduce students to various data structures.
2. To develop programming skills to implement and analyze linear and nonlinear data
structures.
3. To identify and apply the suitable data structure for problem solving.
---------------------------------------------------------------------------------------------------------------------
Course Outcome:
Students will be able to
1. Describe linear and non-linear data structures.
2. Implement abstract data structures.
3. Analyze and Implement Tree and Graph data structures.
4. Identify appropriate usage of data structures for a given problem.
---------------------------------------------------------------------------------------------------------------------
UNIT 1: Introduction to Data Structures & Stack (07)
What is Data Structure, types of data structures – static, dynamic, primitive, non-primitive, linear,
non-linear.
Stack: Definition, representation, operations, implementation, applications like conversion of
polish notations, evaluation of postfix expressions.
UNIT 2: Queues (05)
Definition, representation, operations, Implementation of Linear Queue, Circular Queue,
Priority Queue
--------------------------------------------------------------------------------------------------------------------------------------------------------
Walchand Institute of Technology S.Y.B.Tech (CSE) Syllabus wef 2022-23 Page 8
UNIT 3: Lists (08)
Definition, representation, operations, Types of Lists: Singly Linked List, Doubly Linked List,
Circular Linked List, stack using linked list, queue using linked list, application of linked list:
addition and subtraction of two polynomials.
SECTION –II
UNIT 4: Trees (09)
Definition, traversal, linked implementation, operations on Binary Trees and Binary Search
Trees, Introduction to Threaded Binary Trees, Multiway Trees, B trees, B+ trees.
UNIT 5: Height Balanced Trees (06)
AVL Trees: Definition, height of an AVL Tree, insertion, deletion of node in AVL Trees, Single
andDouble rotation of AVL Trees.
UNIT 6: Graphs (07)
Definition, undirected and directed graphs, graph terminologies, computer representation of
graphs, graph traversal methods: Depth First Search and Breadth First Search.
---------------------------------------------------------------------------------------------------------------------
Internal Continuous Assessment (ICA):
ICA shall consist of minimum 15 practical assignment problems based on all above topics in line
withcourse outcome. Practical problem statements should cover all topics mentioned in syllabus.
---------------------------------------------------------------------------------------------------------------------
Text Books:
1. Data Structure and Program Design in C by Robert Kruse/C.L.Tonda/Bruce Leung second
edition, Pearson Education, Prentice Hall.
2. Data Structures: A Pseudo Approach with C. by Richard.F.Gilberg & Behrouz A. Forouzan,
second edition, Cengage Learning
3. Data Structure using C and C++ by Rajesh.K.Shukla,Wiley Publication
----------------------------------------------------------------------------------------------------------------
Reference Books:
1. Data Structures using C and C++, second edition by Yedidyah Langram, Moshe J,
Augensteen,Aason. M. Tanenbaum.
2. Data Structures and Algorithms by Prof. Maria S. Rukadikar, Shroff Publications.
3. Data Structures Through C in Depth by S.K. Shrivastava, Deepali Shrivastava, BPB
Publications
4. Fundamentals of Data Structures, Sartaj Sahni, University Press
5. Data Structures through C,Yashwant Kanetkar, BPB Publications
--------------------------------------------------------------------------------------------------------------------------------------------------------
Walchand Institute of Technology S.Y.B.Tech (CSE) Syllabus wef 2022-23 Page 9
