L T P J C

ITA3002 Data Structures

3 0 2 0 4
Pre-requisite ITA2001 Syllabus version
1.0
Course Objectives:
1. To explore the basic knowledge of data structure used in computer systems.
2. To impart knowledge about linear and non-linear data structures.
3. To provide an exposure to find an appropriate algorithm for solving real-world problems.
Expected Course Outcomes:
1. Demonstrate knowledge of the fundamental operations and concepts related to data
structures.
2. Analyze the stack and queues concepts and their usage in a real application.
3. Develop various real time applications using linked list concepts.
4. Apply important methods in sorting to real scenarios.
5. Develop an optimal solution using tree concepts
6. Develop applications targeted for finding the shortest path using graph-based algorithms.
7. Deploy the appropriate data structures, algorithms and realization to solve simple to
complex real-world issues.

Student Learning Outcomes (SLO) 2, 8, 9,13, 18, 20

Module:1 Introduction 5 hours
Data structures – Types of Data structures –Data structure operations – Abstract data type-
Analysis of algorithms – Amortized Analysis

Module:2 Arrays 5 hours

Introduction – Characteristics of Arrays – One-dimensional Arrays – Operation with Arrays –
Two-dimensional Arrays – Multi-dimensional Arrays

Module:3 Stacks & Queues 6 hours

Stack – Definitions – Concepts – Operations on Stacks – Infix, postfix & prefix conversions -
evaluations of expressions using stack - Applications of stacks – Representation of Queue –
Insertion and Deletion Operation – Applications of Queue.

Module:4 Lists 6 hours

Lists – Linked List – Singly linked list – doubly linked list – Circular linked list –Representation
of Stacks using linked lists – Representation of Queues using linked lists– Applications of Linked
list.

Module:5 Sorting 7 hours

Bubble sort - Insertion sort – Selection sort – Quick sort – Merge sort – Radix sort – Heap sort

Module:6 Trees 7 hours

Trees – Binary Trees – Operations on Binary Trees –Traversal of a Binary Tree – Threaded
Binary Tree - Binary Search Trees (BST) – Inserting and Deleting in a BST
Module:7 Graphs 7 hours
Graphs – Representation of graph – Traversal in Graph – Spanning Trees - Prim’s and Kruskal’s
algorithm – Dijkstra’s algorithm for shortest path problem.

Module:8 Contemporary issues: 2 hours

Expert talk on Advanced Data Structure algorithms and its applications

Total Lecture hours: 45 hours

Text Book(s)
1. Ashok N. Kamthane, Introduction to Data Structures in C, 2012, Dorling Kindersley.
Reference Books
1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, Introduction to Algorithms, 2012,
PHI Learning Private Limited.
2. Clifford A. Shaffer, Data Structures and Algorithm Analysis in C++, 2012, Dover
Publications.
List of Challenging Experiments (Indicative)
1. Array based implementing of Stack and queue 4 hours
2. Linked list implementations and problems related to linked list such as 4 hours
concatenation etc.,
3. Evaluation of Expressions 2 hours
4. Sorting: 12 hours
a. Insertion sort
b. Merge sort
c. Quick sort
d. Selection sort
e. Heap sort
f. Shell sort
5. Searching: 4 hours
a. Linear search
b. Binary search
6 Binary Tree Traversals 2 hours
7 Graph Traversals 2 hours
Total Laboratory Hours 30 hours
Recommended by Board of Studies 12-6-2015
Approved by Academic Council No:37th Date 16-6-2015