CBS1003 Data Structures and Algorithms L T P J C

2 0 2 0 3
Pre-requisite NIL Syllabus version
1.0
Course Objectives:
a. Analyze the asymptotic performance of algorithms.
b. Explore the linear and non-linear data structures and their applications.
c. Perform searching and sorting using various techniques and organizing files.

Expected Course Outcome:

After completion of this course, students will be able to:
1. Realize the basic terminologies in data structures.
2. Idealize the features of linear data structures and their applications.
3. Explicate trees and their types with their applications.
4. Demonstrate various types of graphs and their applications in real world.
5. Choose appropriate sorting technique for the given problem.
6. Select the best methods for the solutions that involve searching.
7. Organize data using files and understand various access methods.

Student Learning Outcomes (SLO): 2, 6, 14

2. Having a clear understanding of the subject related concepts and of contemporary issues
6. Having an ability to design a component or a product applying all the relevant standards and
with realistic constraints
14. Having an ability to design and conduct experiments, as well as to analyze and interpret data
Module:1 BASIC TERMINOLOGIES and 3 hours
INTRODUCTION TO ALGORITHM &
DATA ORGANIZATION
Algorithm specification, Recursion, Performance analysis, Asymptotic Notation - The Big-O,
Omega and Theta notation, Programming Style, Refinement of Coding - Time-Space Trade Off,
Testing, Data Abstraction

Module:2 LINEAR DATA STRUCTURES 4 hours

Array, Stack, Queue, Linked-list and its types, Various Representations, Operations &
Applications of Linear Data Structures

Module:3 NON-LINEAR DATA STRUCTURES-I 5 hours

Trees (Binary Tree, Threaded Binary Tree, Binary Search Tree, B & B+ Tree, AVL Tree, Splay
Tree) and applications

Module:4 NON-LINEAR DATA STRUCTURES-II 6 hours

Graphs (Directed, Undirected), Various Representations, Operations (search and traversal
algorithms and complexity analysis) & Applications of Non-Linear Data Structures

Module:5 SEARCHING AND SORTING ON 6 hours

VARIOUS DATA STRUCTURES
Sequential Search, Binary Search, Breadth First Search, Depth First Search, Insertion Sort,
Selection Sort, Shell Sort, Divide and Conquer Sort, Merge Sort, Quick Sort, Heap Sort,
Introduction to Hashing

Module:6 FILE 4 hours

Organisation (Sequential, Direct, Indexed Sequential, Hashed) and various types of accessing
schemes.

Module:7 Recent Trends 2 hours

Total Lecture hours: 30 hours

Text Book(s)
1. E Horowitz and S Sahni, “Fundamentals of Data Structures”, Second Edition, Galgotia
Booksource, 2008.
2. Alfred V. Aho, John E. Hopperoft, Jeffrey D. UIlman, “Data Structures and Algorithms”,
First Edition, Pearson Publishers, 1983.
Reference Books
1. Knuth Donald E , “Art of Computer Programming: Fundamental Algorithms Volume 1 -
Fundamental Algorithms”, Third Edition, Pearson Publishers, 2011.
2. Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, “Introduction to
Algorithms”, Third Edition, PHI Publishers, 2009.
3. Pat Morin , “Open Data Structures: An Introduction (Open Paths to Enriched Learning)”, 31st
ed. Edition, UBC Press, 2013.
Mode of Evaluation: CAT / Assignment / Quiz / FAT / Project / Seminar
List of Challenging Experiments (Indicative)
1. Towers of Hanoi using user defined stacks. 2 hours
2. Reading, writing, and addition of polynomials. 2 hours
3. Line editors with line count, word count showing on the screen. 2 hours
4. Trees with all operations. 6 hours
5. All graph algorithms. 8 hours
6. Saving / retrieving non-linear data structure in/from a file 10 hours
Total Laboratory Hours 30 hours
Mode of assessment:
Recommended by Board of Studies
Approved by Academic Council No.56 Date 24.09.2019