Scribd
Upload
149 views

Business Algorithm and Data Structures For Information Systems

The course is worth 1 credit and will cover topics like algorithm analysis, sorting and searching techniques, data structures like trees and graphs implemented in R language, and algorithm design techniques. Students will learn to analyze time and space complexity, identify properties of nonlinear data structures, and apply concepts to solve real-world problems. Evaluation will include assignments, exams, and programming projects. The course aims to help students comprehend algorithms and data structures.

Uploaded by

Maduwanthan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
149 views

Business Algorithm and Data Structures For Information Systems

The course is worth 1 credit and will cover topics like algorithm analysis, sorting and searching techniques, data structures like trees and graphs implemented in R language, and algorithm design techniques. Students will learn to analyze time and space complexity, identify properties of nonlinear data structures, and apply concepts to solve real-world problems. Evaluation will include assignments, exams, and programming projects. The course aims to help students comprehend algorithms and data structures.

Uploaded by

Maduwanthan
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Indian Institute of Management Rohtak

Course Outline
Course Title : Business Algorithm and Data Structures for Information Systems
Credits : 1 (20 Sessions)
Type : Compulsory
Session Duration : 75 minutes
Term : IV
Year : 2021
Faculty : Prof. Mahamaya Mohanty

Introduction: The course covers basic algorithmic design techniques and ideas for computational
problems. It is important to choose right data structures that allow the algorithm to organize the
data efficiently. This course also introduces different types of data structures. In this course
algorithms will be implemented in R language. R is a powerful language for data analysis, data
visualization, machine learning, and statistics.

Course Objectives
The specific objectives of the course are:

1. To understand the importance of algorithm and data structures


2. To analyze the complexity of an algorithm in terms of time and space complexities
3. To identify the basic properties of non-linear data structures like graphs and trees and
model simple applications
4. To learn the practical aspects of the R language

Course Learning Outcomes


On successful completion of this course students will be able to:

1. Ability to comprehend the basics in algorithms and data structures.


2. To analyze the complexity of an algorithm in terms of time and space complexities
3. To design and implement various programming paradigms and its complexity
4. Ability to apply the concepts of trees and graphs to provide algorithmic solutions to the real
world problems

Evaluation Scheme
Assessment / Quizzes 10%
Assignment, Programming assignment 20%
Mid Term Exam 30%
Final Exam 40%

Prerequisites
Prerequisite for this course is Introduction to Programming offered in Term II. It is
continuation of this course.

1
Brief Outline
Module I: Development of Algorithms -Notations and analysis
Module Objective:
This module explains algorithms, asymptotic notations, master’s theorem and how to compute
time and space complexity of an algorithm

Module II: Sorting and Searching techniques


Module Objective:
This module explains the sorting and searching techniques such as selection, bubble, insertion,
merge, quick sort, heap sort, linear search and Binary search

Module III: Data Structures in R- Binary tree, Binary search tree, Graph
Module Objective:
This module explains the Data Structures such as binary tree, binary search tree, B- tree and graphs

Module IV: Design and analysis techniques


Module Objective:
This module explains the design techniques such as divide and conquer method, greedy
method and dynamic programming.

Text Books: -

1. T. Cormen, C. Lieserson, R. Rivest, and C. Stein, “Introductions to Algorithms”, Prentice-


Hall/India, 3rd edition, 2019.

Reference Book:

2. Dr. PKS Prakash and Achyutuni Sri Krishna Rao, “R Data Structures and Algorithms” Packt
Publishing , first edition 2016.

Special Instructions

The sessions will be of 75 minutes duration. Generally algorithm courses are among the toughest
courses. Almost every lecture is built upon material presented in several earlier lectures. A failure to
comprehend just one lecture session may get anyone out of track for the rest of the course. So students
are advised to maintain 100% attendance.

2
Session Plan

Module Session Topic and Sub-topics Reference (Book Case / Exercise /


No. No. chapter / Page numbers Assignment
from the
book/Additional
readings)
1 1-2 Introduction to Algorithms – Chapter-1-2-3 (Text Assignment
asymptotic notations and Book 1)
analysis

3 Master’s theorem Chapter-4 (Text Book Assignment


1)
2 4-5-6 Sorting algorithms: selection, Chapter- 5 (Text Book Programming
2), assignment
bubble, insertion, merge, quick
sort, heap sort Chapter-6-7 (Text Book
1),
7 Linear search and Binary search Chapter-6 (Text Book Programming
2) assignment

3 8-9-10 Data Structures such as binary Chapter-12 & 18 (Text Assignment


tree, binary search tree, Book 1) Programming
assignment
11 Data Structures -B- tree Chapter-12 & 18 (Text Programming
Book 1) assignment
12-13-14 Graph Data Structure Chapter-8 (Text Book 2) Programming
Chapter-22-23 (Text Book assignment
BFS, DFS 1)
4 15-16 Greedy Techniques Chapter-8 (Text Book 2) Programming
MST, Prims algorithm, Kruskal, Chapter-24 (Text Book assignment
1)
Dijkastra algorithm
17-18 Divide and Conquer Chapter-4 (Text Book Assignment
Strassen algorithm 1)
Dynamic programming methods Chapter-15 (Text Book
1)

19-20 Knapsack problem Chapter-9 (Text Book Assignment


Matrix chain multiplcation 1)
Programming
All pairs shortest path algorithm Chapter-8 (Text Book assignment
2)

*The Course will not tolerate plagiarism, copying or active or passive collaboration in this type of dishonest
behavior in papers written by our students. The penalty for plagiarism will be immediate failure of the course.
Furthermore, the Institute will initiate proceedings against the student that could lead to his/her expulsion from
the programme.

You might also like