Course Code and Course Title Course Structure Pre-Requisite
L T P
EE102 Data Structure and Algorithms 3 0 2
Course Objective:
To study different kinds of data structures with their respective applications.
To learn applications of data structures
To apply data structures in various programs
Learn to use data structures for different programs
Course Outcome (CO):
CO1. Access different kinds of data structures with their respective applications.
CO2. Devise data structures for programs
CO3. Differentiate between static and dynamic data structures
CO4. Develop programs using different types of data structures
S. No. Content Contact
Hours
Introduction: Introduction to Algorithmic, Complexity- Time-Space Trade off.
Introduction to abstract data types, design, implementation and applications. Introduction
to List data structure. Arrays and Strings: Representation of Arrays in Memory: one
dimensional, Two dimensional and Multidimensional, Accessing of elements of array,
Unit 1 performing operations like Insertion, Deletion and Searching. Sorting elements of arrays. 10
Strings and String Operations
Stacks and Queues: Introduction to data structures like Stacks and Queues. Operations
on Stacks and Queues, Array representation of Stacks, Applications of Stacks: recursion,
Polish expression and their compilation conversion of infix expression to prefix and
postfix expression, Operations of Queues, Representations of Queues Applications of
Queues, Priority queues. Linked Lists: Singly linked lists, Representation of linked list,
Operations of Linked list such as Traversing, Insertion and Deletion, Searching,
Unit 2
Applications of Linked List. Concepts of Circular linked list and Doubly linked list and
10
their Applications. Stacks and Queues as linked list.
Trees: Basic Terminology, Binary Trees and their representation, binary search trees,
various operations on Binary search trees like traversing, searching, Insertion and
Unit 3 Deletion, Applications of Binary search Trees, Complete Binary trees, Extended binary 12
trees. General trees, AVL trees, Threaded trees, B- trees. Searching and Sorting: Linear
Search, Binary search, Interpolation Search, Insertion Sort, Quick sort, Merge sort, Heap
sort, sorting on different keys, External sorting.
Graphs: Terminology and Representations, Graphs & Multi-graphs, Directed Graphs,
Representation of graphs and their Transversal, Spanning trees, shortest path and
Unit 4 Transitive Closure, Activity Networks, Topological Sort and Critical Paths. File 10
Structure: File Organization, Indexing & Hashing, Hash Functions, Collision Resolution
Techniques.
Total 42
Suggested Books: -
S.No Name of Books/Authors/Publisher
.
1. Fundamentals of Data structures, Horowitz and Sahni, Galgotia publications, 1983
2. Data Structures, Tannenbaum, PHI, 2007( Fifth Impression)
3. An introduction to data structures and application by Jean Paul Tremblay & Pal G. Sorenson (McGraw Hill).
4. Data structure and program design in C, R.L. Kruse, B.P. Leary, C.L. Tondo, PHI, 2009( IV Impression)
5. Seymour Lipschutz Saucham’s series , data Structures, Mc, Graw Hill Publication, 2018
6. Data Structures using C by Nitin Upadhay, S K Kataria Publications, 2015
