Subject Subject
Teaching Scheme (Hrs.) Credits Assigned
Code Name
TheoryPracticalTutorialTheoryTW/PracticalTutorial Total
Data
ECC304 03 - - 03 - - 03
Structures
Examination Scheme
Theory Marks
Subject Subject Internal assessment
Code Name End Term
Avg of Practical Oral Total
Sem. Work
Test Test Test 1
MSE Exam
1 2 and Test
2
Data
ECC304 20 20 20 20 60 - -- -- 100
Structures
Course Pre-requisites:
1. C Programming.
Course Objectives:
1. To understand basic linear and non-linear data structures.
2. To implement various operations on Arrays , linked list, stack, queue, binary tree,
and graph.
3. To study different sorting and searching techniques.
4. To analyze efficient data structures to solve real world problems.
Course Outcome:
1. Understand various linear data structures.
2. Perform operations on linear data structures.
3. Comprehend various nonlinear data structures.
4. Implement various operations on nonlinear data structures.
5. Analyze appropriate sorting and searching techniques for a given problem.
6. Apply appropriate data structure and algorithms for solving real world problems.
Module Topics Hrs.
1
No.
Introduction to Data Structures
Introduction to the theory of data structure, classification of data
structure, Data representation, Abstract data types with examples,
1. 04
Data types Recursion: Recursive definition, recursion to solve the
real life problems, Importance of data structures, Fundamental of
operations of various data structures such as array, Structure etc.
Array, Stack and Queues
Array, Stack and queue representation, Representation of a Stack
using Array, Applications of Stack – Well form-ness of Parenthesis,
2. Infix to Postfix Conversion and Postfix Evaluation Operation and 08
examples, Polish notation, stack in recursion Queue, Queue
processing, Types of Queues: Circular queues and priority queues,
Role of data structure in optimized coding.
Linked List
3. Linked list and array, Dynamic linked lists (single, doubly, circular) 06
– processing, operations, applications of linked lists.
Trees
Concept of trees, Binary tree and its representation, complete binary
tree, tree traversal algorithms, in-order, preorder, post-order, Height
4. 07
balanced tree, Expression tree, Huffman algorithm and its
applications Search Trees: Binary search tree, insertion and deletion,
AVL tree.
Graphs
Terminology, sequential and linked representation of graphs,
5. adjacency matrices, Adjacency list, adjacency multi list, graph 06
traversal: breadth first search and Depth first search, connected
component, spanning trees, minimum cost spanning tree.
Searching and Sorting
Basic searching techniques, sequential searching, bubble sort,
selection sort, insertion sort, Shell sort and Radix sort and their
6. efficiency, Quick sort and merge sort comparison, indexed 08
sequential searching, binary search, Hashing: Basics, collision
resolution and their efficiency comparison, Application of search
and indexes to solve real life applications.
Total 39
2
Text Books:
1. Reema Thareja, “Data Structure using C”, Oxford University Press, 2nd Edition, 2014
2. Tremblay, J. P., & Sorenson, P. G. (1984). An introduction to data structures with
applications. McGraw-Hill, Inc.
3. Thareja, R. (2014). Data structures using C. Oxford University Press.
4. Gilberg, R. F., Forouzan, B. A. (2004). Data Structures. United States: Cengage
Learning.
5. Balagurusamy, E. (2013). Data Structures Using C. India: McGraw-Hill Education
(India).
6. Tenenbaum, A. M. (1990). Data structures using C. Pearson Education India.
Reference Books:
1. Bhasin, H. (2015). Algorithms: Design and Analysis. India: Oxford University Press.
2. DATA STRUCTURES USING C 2E. (2006). India: Tata McGraw-Hill Education.
3. Rajasekaran, S., Sahni, S., Horowitz, E. (2008). Computer Algorithms. United States:
Silicon Press.
4. Lipschutz, S. (2014). Data Structures. India: McGraw Hill Education (India) Private
Limited. Schaum’s Outlines.
3
Subject Subject
Teaching Scheme (Hrs.) Credits Assigned
Code Name
TheoryPracticalTutorialTheoryTW/PracticalTutorial Total
Data
ECL 303 Structures - 02 - - 01 - 01
Lab
Examination Scheme
Theory Marks
Subject Subject Internal assessment
Code Name End Term
Avg of PracticalOral Total
Sem. Work
Test Test Test 1
MSE Exam
1 2 and Test
2
Data
ECL 303 Structures -- -- -- -- -- 25 25 - 50
Lab
Course Pre-requisites:
Programming in C
Course Objectives:
1. To implement different linear data structures
2. To implement different non-linear data structures
3. To get familiarized to sorting and searching algorithms
4. To solve real world problems using linear and nonlinear data structures.
Course Outcomes: At the end of the course learner will able:
1. To differentiate between primitive and non-primitive data structures.
2. To handle operations like insertion, deletion, searching and traversing on various
linear and non-linear data structures.
3. To implement different searching & Sorting algorithms
4. To apply appropriate data structure for solving real world problem.
4
Suggested List of Experiments
1. Array and Linked list implementation of Linked List ADT
2. Array and Linked list implementation of Stack ADT
3. Array and Linked list implementation of Queue ADT
4. Applications of List, Stack and Queue ADTs.
5. Implementation of Binary trees and operations of Binary trees.
6. Implementation of Binary Search Trees
7. Implementation of AVL Trees
8. Implementation of Heaps using Priority Queues.
9. Graph representation and Traversal algorithms
10. Applications of Graphs
11. Implementation of searching and sorting algorithms
12. Hashing – any two collision techniques
