NATIONAL INSTITUTE OF TECHNOLOGY

JAMSHEDPUR, JHARKHAND-831014
DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING
SPRING SEMESTER 2016-2017
Course Handout
Date: 02/01/2017
Course No. : EC404
Course Title : Data Structure
Instructor In-charge : Vaibhav Soni

Course Description:
Introduction to Data Structure, Arrays, Linked-Lists, Stacks, Queues, Recursion, Trees, Graphs, Searching,
Sorting.
Scope:
To study the fundamental design, analysis, and implementation of basic data structures and algorithms.
To promote the Principles for good program design, especially the uses of data abstraction & modular
program composition.
To study basic concepts in the specification and analysis of programs.
To solve problems using data structures such as linear lists, stacks, queues, hash tables, binary trees,
heaps trees, binary search trees, and graphs and writing programs for these solutions.

Objectives:
The main objective of this course is to introduce structures for storing, retrieving and manipulating data.
The techniques for designing data structures and their appropriateness to a given scenario will be discussed
in this course.
At the end of this course a student will be able to IDENTIFY Linear versus Nonlinear data structures.
At the end of this course a student will be able to DETERMINE the complexity of algorithms and
analyze their performance issues.
At the end of this course a student will be able to SHOW HOW data structures map onto physical
memory.
At the end of this course a student will be able to PERFORM different operations on various data
structures.
At the end of this course a student will be able to COMPARE different implementations of the same
data structure.

Text Books
T1. Reema Thareja, Data Structure Using C, Oxford University Press, 2011.
T2. Ellis Horowitz, Sartaj Sahini & Rajasekaran, Data Structure, Galgotia Publications.
Reference Books
R1. D. Samanta, Classic Data Structures, PHI Publications, 2nd Edition.
R2. Tanaenbaum A.S. Langram, M.J. Augestein, Data Structures using C Pearson Education, 2004.
R3. Data Structures and Algorithm Analysis in C, Addison Wesley, Second Edition, Pearson Education,
2008.
R4. Ellis Horowitz, Sartaj Sahini & Rajasekaran, Fundamental of Algorithms, Galgotia Publications.
Course Plan
Lecture Learning Objective Topic to be covered Refer to
No Chapter
1-2 Introduction to Data Structure, Data Structure Types Data Structure T1 4.1 4.3
(i.e. Linear and Non-linear), Abstract Data Type, Overview R1 2
Operations and applications.
3-5 Introduction to algorithm, Time/ Space Complexity, Introduction, T2 1.5
Asymptotic notations Algorithm Analysis R4 1.2 1.3
Criteria
6-8 Arrays: Operations, Multidimensional Array, Array T1 5
Memory Representation, Applications T2 4
9-14 Link List: Operations, Various Types (Circular Link List Data T1 8
Linked List, Doubly Linked List and Circular Structure T3 3
Doubly Linked List), Applications, Memory
Management
15-18 Stack: Memory Representation, Implementation Stack Data Structure T1 9.1-9.10
using arrays and linked-list, Operations, Various T2 6.1 6.9
Types, Applications
19-22 Queue: Memory Representation, Implementation Queue Data Structure T1 9.11 9.18
using arrays and linked-list, Operations, Various T2 6.10 6.13
Types, Applications
23-30 Tree: Binary Tree; Definition, Properties, Tree Tree Data structure T1 10, 11, 12
traversal, Types of Binary tree, Expression tree, T2 7.1-7.12
BST, Heap tree, AVL Tree, B tree, B+ tree
29-33 Graphs: Definition Terminologies, Representation in Graph Data Structure T1 13.1 13.8
memory, operations, graph traversal methods: BFS, T2 8.1-8.7
DFS, MST, Kruskals, Prims and Dijkstra's
algorithms
36-38 Hashing, Searching, Data Modification Hashing Techniques T1 15.2 15.4
T2 9.8 - 9.9
39-42 Sorting Methodologies and its various algorithms: Sorting Techniques T1 14.1 14.9
Bubble sort, insertion sort, selection sort, merge sort, T2 9.1 - 9.7
quick sort, heap sort, shell sort, radix sort.

Evaluation Scheme
EC No. Evaluation Component Duration Weightage Date & Time Nature of
Component
1. Test 1 60 Min 20% Closed Book
2. Test 2 60 Min 20% Closed Book
3 End Sem Exam 3 Hrs 40% Closed Book
4. Assignment 10% Take Home
6. Surprise Quizzes 10 Min 10% Close Book

Chamber Consultation Hour: Tuesday, 03:00 05:00 Hrs

Notices: All notices regarding the course will be mailed to the students to their Email-Ids.

Instructor In-Charge

Data Structure (EC404)