GANPAT UNIVERSITY

FACULTY OF ENGINEERING & TECHNOLOGY

Programme Bachelor of Technology Branch/Spec. Computer Science and Business Systems
Semester II Version 1.0.0.0
Effective from Academic Year 2021-22 Effective for the batch Admitted in July 2021
Subject code 2CS201 Subject Name Data Structures And Algorithms
Teaching scheme Examination scheme (Marks)
(Per week) Lecture Practical Total CE SEE Total
(DT) (Lab.)
L TU P TW
Credit 3 0 2 - 5 Theory 40 60 100
Hours 3 0 4 - 7 Practical 30 20 50
Pre-requisites:

Objectives of the course:

1. Understand the basic terminologies of algorithm and data organization.
2. Understand the concepts of ADTs
3. Learn linear data structures – lists, stacks, and queues
4. Understand sorting, searching and hashing algorithms.
5. Learn dynamic data structures - Tree and Graph
Theory syllabus
Unit Content Hrs
Basic Terminologies and Introduction to Algorithm & Data Organisation:
Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The Big-O,
1 06
Omega and Theta notation, Programming Style, Refinement of Coding - Time-Space Trade
Off, Testing, Data Abstraction
Linear Data Structure :
2 Array, Stack, Queue, Linked-list and its types, Various Representations, Operations & 12
Applications of Linear Data Structures
Non-linear Data Structure :
Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay
3 10
Tree) and Graphs (Directed, Undirected), Various Representations, Operations & Applications
of Non-Linear Data Structures
Searching and Sorting on Various Data Structures :
Sequential Search, Binary Search, Comparison Trees, Breadth First Search, Depth First Search
4 11
Insertion Sort, Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort, Quick Sort,
Heapsort, Introduction to Hashing
File :
5 Organisation (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing 03
schemes.
Graph :
6 Basic Terminologies and Representations, Graph search and traversal algorithms and 03
complexity analysis.
Practical content
1 Towers of Hanoi using user defined stacks
 2 Reading, writing, and addition of polynomials.
3 Line editors with line count, word count showing on the screen
4 Trees with all operations
5 All graph algorithms.
6 Saving / retrieving non-linear data structure in/from a file
Text Books
1 Fundamentals of Data Structures, E. Horowitz, S. Sahni, S. A-Freed, Universities Press
2 Data Structures and Algorithms, A. V. Aho, J. E. Hopperoft, J. D. UIlman, Pearson
Reference Books
1 The Art of Computer Programming: Volume 1: Fundamental Algorithms, Donald E. Knuth.
Introduction to Algorithms, Thomas, H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein,
2
The MIT Press.
Open Data Structures: An Introduction (Open Paths to Enriched Learning), (Thirty First Edition), Pat
3
Morin, UBC Press.
Course Outcomes:
After successful completion of this course, student will be able to
CO1: Implement abstract data types for linear data structures.
CO2: Implement abstract data types for non-linear data structure.
CO3: Apply the different linear and non-linear data structures to problem solutions.
CO4: Implement the various sorting and searching algorithms.
CO5: Implement files and graph data structures for various applications.

Mapping with CO & PO

PO -1 PO -2 PO - PO -4 PO -5 PO -6 PO -7 PO -8 PO -9 PO -10 PO -11 PO -
3 12

Name of Desig
Mapping nA Impact
Values to Hard Of
Abilit Techn Latest Societ Ethical Commu Manag Life-
be used ware Engg. Team
Know y To ology Techn al Respo nicate e Long
for CO HW/S Sol. Projec
ledge Identi Proble ologie Safety nsibilit Effectiv Project Learn
W On t
fy m s issue ies ely s ing
Comp Societ
onent y.
s
1 2 3 4 5 6 7 8 9 10 11 12

CO-1 3 3 2 2 0 0 0 0 1 0 1 2

CO-2 3 2 2 2 0 0 0 0 1 0 1 2

CO-3 3 3 2 3 0 0 2 0 4 0 3 2

CO-4 2 3 2 3 0 0 2 0 2 0 2 2
CO-5 3 4 2 2 0 0 1 0 4 0 3 2

Mapping of Course Contents

Unit Skill Development Employability Entrepreneurship

1 
2  
3  
4   
5  
6   