# Data Structures (2130702)

## Teaching Scheme (in Hours)

Theory Tutorial Practical Total
4 0 4 8

Subject Credit :  8

Theory
ESE (E)
Theory
PA (M)
Practical
ESE Viva (V)
Practical
PA (I)
Total
0

## Syllabus Content

###### Unit-1:  Introduction to Data Structure

Data Management concepts, Data types - primitive and non-primitive, Performance Analysis and Measurement (Time and space analysis of algorithms-average, best and worst case analysis), Types of Data Structures - Linear & Non Linear Data Structures.

###### Unit-2:  Linear Data Structure

Array: Representation of arrays, Applications of arrays, sparse matrix and its representation
Stack: Stack-Definitions & Concepts, Operations On Stacks, Applications of Stacks, Polish Expression, Reverse Polish Expression And Their Compilation, Recursion, Tower of Hanoi
Queue: Representation Of Queue, Operations On Queue, Circular Queue, Priority Queue, Array representation of Priority Queue, Double Ended Queue, Applications of Queue

###### Unit-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, eg. AVL trees, 2-3 trees, Height Balanced, Weight Balance,
Graph: Matrix Representation Of Graphs, Elementary Graph operations,(Breadth First Search, Depth First Search, Spanning Trees, Shortest path, Minimal spanning tree )

###### Unit-4:  Hashing and File Structures

Hashing: The symbol table, Hashing Functions, Collision-Resolution Techniques,
File Structure: Concepts of fields, records and files, Sequential, Indexed and Relative/Random File Organization, Indexing structure for index files, hashing for direct files, Multi-Key file organization and access methods.

###### Unit-5:  Sorting & Searching

Sorting: Bubble Sort, Selection Sort, Quick Sort, Merge Sort
Searching: Sequential Search and Binary Search

## Reference Books

Sr. Title Author Publication Amazon Link
1 An Introduction to Data Structures with Applications Jean-Paul Tremblay & Paul Sorenson Publisher-Tata McGraw Hill
2 Data Structures using C & C++ Ten Baum Prenctice-Hall International
3 Fundamentals of Computer Algorithms Horowitz, Sahni Galgotia Pub.
4 Fundamentals of Data Structures in C++ Sartaj Sahani
5 Data Structures: A Pseudocode Approach with C Gilberg Cengage Learning

## Course Outcome

After learning the course the students should be able to:

1. Differentiate primitive and non primitive structures.
2. Design and apply appropriate data structures for solving computing problems.
3. Apply sorting and searching algorithms to the small and large data sets.

### BE (CE) ⇒ Semester: 3

Darshan Institute of Engineering & Technology is a leading institute offering undergraduate (B.E.), postgraduate (M.E.) and Diploma programs in engineering.

## Our Contacts

At Hadala, Rajkot - Morbi Highway,
Gujarat-363650, INDIA

(+91) 97277 47310
(+91) 97277 47311