Data Structures : 2CSE302

Learning Outcomes: 
• Differentiate between the types of Data Structures.
• Select an appropriate data structure for solving typical computing problems.
• Apply sorting and searching algorithms to the small and large data sets.
Syllabus: 
Unit NoTopics
1

INTRODUCTION TO DATA STRUCTURE:

Data Management concepts, Data types – primitive and non-primitive, Types of Data Structures- Linear & Non Linear Data Structures.

2

LINEAR DATA STRUCTURE

Array: Operations, RMO and CMO  representation

Stack:  Concepts and representation, Operations, Applications. Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi.

Queue: Concept and Representation, Operations, Types viz. simple, circular, priority, double ended. Applications of queue.

Linked List: Concept and Representation.

Operations: Insertion at beginning, at the end and at any point, Deletion at the beginning, at the end and at any point.

Types of Linked lists: Singly Linked List, Doubly Linked list, Circular linked list, Linked implementation of Queue. Applications and Advantages of Linked Lists.

3

NONLINEAR DATA STRUCTURE:

Tree: Definitions and Concepts, Representation of binary tree, Binary tree traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search trees, Conversion of General Trees To Binary Trees, Applications Of Trees- Some balanced tree mechanism, e.g. AVL trees, 2-3 trees

4

GRAPH:

Basic Concept of Graph Theory and its Properties, Matrix Representation Of Graphs, Elementary Graph operations, Breadth First Search, Depth First Search, Spanning Trees, Minimum spanning tree- Prims and Kruskal Algorithm

5

SORTING& SEARCHING:

Performance Analysis and Management - Time and space analysis of algorithms – Average, best and worst case analysis. Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort, Insertion sort, Heap Sort. Searching – Sequential Search and Binary Search

6

HASHING :

Hashing function, Collision Resolution Techniques.

Text Books: 
Name : 
Fundamentals of Data Structures in C++
Author: 
Horowitz
Sartaj Sahani
Name : 
Data Structure Using C
Author: 
by Reema Thareja
Publication: 
Oxford Higher
Reference Books: 
Name: 
Data Structures using C & C++
Author: 
By Ten Baum
Publication: 
– Prenctice-Hall
Name: 
Fundamentals of Computer Algorithms
Author: 
by Horowitz
Sahni,Galgotia
Publication: 
Pub. 2001 ed
Name: 
Data Structures: A Pseudo-code approach with C
Author: 
By Gilberg&Forouzan
Publication: 
Thomson Learning
Name: 
An Introduction to Data Structures with Applications
Author: 
by Jean-Paul Tremblay
Paul G. Sorenson
Publication: 
Tata McGraw Hill
Syllabus PDF: 
AttachmentSize
PDF icon DS.pdf223.4 KB
branch: 
CBA
BDA
MA
Cyber Security
Course: 
2018
Stream: 
B.Tech