Scribd
Upload
2 views

[IT3102]-Computational Complexity and Algorithm

The document outlines the course structure for T.Y. B.Tech in Information Technology at Rajarshi Shahu College of Engineering for the academic year 2021-2022, focusing on Computational Complexity and Algorithms. It details the teaching and examination schemes, course objectives, outcomes, and contents covering various algorithmic strategies such as brute force, divide and conquer, dynamic programming, backtracking, and branch and bound. Additionally, it includes laboratory assignments and recommended textbooks for further study.

Uploaded by

noreply051204
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

[IT3102]-Computational Complexity and Algorithm

The document outlines the course structure for T.Y. B.Tech in Information Technology at Rajarshi Shahu College of Engineering for the academic year 2021-2022, focusing on Computational Complexity and Algorithms. It details the teaching and examination schemes, course objectives, outcomes, and contents covering various algorithmic strategies such as brute force, divide and conquer, dynamic programming, backtracking, and branch and bound. Additionally, it includes laboratory assignments and recommended textbooks for further study.

Uploaded by

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

RAJARSHI SHAHU COLLEGE OF ENGINEERING

TATHAWADE, PUNE-33
(An Autonomous Institute Affiliated to Savitribai Phule Pune University, Pune)

T. Y. B. Tech (Department of Information Technology)


Academic Year 2021-2022 Semester -V
[IT3102]: Computational Complexity and Algorithm

Teaching Scheme: Credits: Examination Scheme:


TH : 03 Hours/Week TH : 03 In Sem. Evaluation : 15 Marks
LAB : 02 Hours/Week LAB : 01 Mid Sem. Exam : 25 Marks
End Sem. Exam : 60 Marks
Lab Exam : 50 Marks
Course Prerequisites: Fundamentals of Data Structures, Data Structures and Files
Course Objectives:
To analyze performance of algorithms
To choose the appropriate data structure and algorithm for a specified application
To understand how the choice of data structures and algorithm impacts the performance of
programs
To solve problems using algorithms such as the greedy method, divide and conquer, dynamic
programming, backtracking and branch and bound.
To understand the concepts of solvable and non-solvable problems

Course Outcomes: After successful completion of the course, students will able to-
CO1: Design algorithm for various computing problems.
CO2: Critically analyze the different algorithm design techniques for a given problem.
CO3: Modify existing algorithm to improve efficiency.
CO4: To illustrate different problems using Backtracking.
CO5: To compare different methods of Branch and Bound strategy
CO6:To explore the concept of P, NP, NP-complete, NP-Hard and parallel algorithms
Course Contents
UNIT-I Introduction 07 Hours
Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity, Time
complexity, Asymptotic Notation, Analysis of Algorithm: Efficiency- Analysis framework,
asymptotic notations big O, theta and omega. Analysis Framework ,Mathematical Analysis

UNIT-II Brute Force And Divide-And-Conquer 07 Hours

Dr. Ram Joshi Dr. Rakesh K. Jain


BoS Chairman& Director
Dean of Academics
Page 12 of 57
Brute Force method

Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Finding
Max-

UNIT-III Dynamic Programming And Greedy Techniques 07 Hours


General strategy, Principle of optimality, 0/1 knapsack Problem, Bellman-Ford Algorithm, Multistage
Graph problem, Optimal Binary Search Trees, Travelling Salesman Problem.

Greedy Method: General method, Applications -

UNIT-IV Backtracking 07 Hours


General method, Recursive backtracking algorithm, Iterative backtracking method. 8-Queen problem,
Sum of subsets, Graph coloring, Hamiltonian Cycle , 0/1 Knapsack Problem
UNIT-V Branch And Bound 07 Hours
The method, Control abstractions for Least Cost Search, Bounding, FIFO branch and bound, LC
branch and bound, 0/1 Knapsack problem LC branch and bound and FIFO branch and bound
solution, Traveling sales person problem
UNIT-VI Computational Complexity 07 Hours
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard and

Lab Contents
Guidelines for Assessment

/assignments performance of student. Each lab practical/assignment assessment will assign grade/marks based
on parameters with appropriate weightage. Suggested parameters for overall assessment as well as each lab
assignment assessment include- timely completion, performance, innovation, efficient codes, punctuality and
neatness.
List of Laboratory Assignments
1 Write a program to implement Quick sort algorithm for sorting a list of integers in ascending
order
2 Implement Merge sort algorithm for sorting a list of integers in ascending order.
3 Write a program to find Maximum and Minimum element in an array using Divide and
Conquer strategy
4 Write a program to implement Bellman-Ford Algorithm using Dynamic Programming.
5 Write a program to solve the travelling salesman problem and to print the path and the cost
using Dynamic Programming.

Dr. Ram Joshi Dr. Rakesh K. Jain


BoS Chairman& Director
Dean of Academics
Page 13 of 57
6 Find Minimum Cost Spanning Tree of a given connected undirected graph using Kruskal's
algorithm.
7
8 Write a recursive program to find the solution of placing n queens on chessboard so that no
two queens attack each other using Backtracking.
9 Write a program to solve the travelling salesman problem and to print the path and the cost
using Branch and Bound.
10 Write a recursive program to find the solution of placing n queens on chessboard so that no
two queens attack each other using Backtracking.
11 Write a program to solve the travelling salesman problem and to print the path and the cost
using Branch and Bound.
Text Books:
T1. Fundamentals of Computer Algorithms, Ellis Horowitz, SatrajSahni and Rajasekharam,Galgotia
publications pvt. Ltd.
T2. Design and Analysis Algorithms - Parag Himanshu Dave, Himanshu Bhalchandra Dave
Publisher: Pearson
T3. Horowitz and Sahani, Fundamentals of computer Algorithms, Galgotia, ISBN 81-7371-612-9
Reference Books:
R1. Thomas H Cormen and Charles E.L Leiserson, Introduction to Algorithm, PHI, ISBN:81-203-
2141-3.
R2. R. C. T. Lee, SS Tseng, R C Chang, Y T Tsai, Introduction to Design and Analysis of
Algorithms, A Strategic approach, Tata McGraw Hill, ISBN-13: 978-1-25-902582-2. ISBN-10:
1-25-902582-9.
R3. Anany Levitin, Introduction to the Design & Analysis of Algorithm, Pearson, ISBN 81- 7758-
835-4.
R4. Steven S Skiena, The Algorithm Design Manual, Springer, ISBN 978-81-8489-865-1.
R5. George T. Heineman, Gary Pollice, Stanley Selkow, Algorithms in a Nutshell, A Desktop Quick

R6. Michael T. Goodrich, Roberto Tamassia, Algorithm Design: Foundations, Analysis and Internet
Examples, Wiley India, ISBN: 9788126509867

Dr. Ram Joshi Dr. Rakesh K. Jain


BoS Chairman& Director
Dean of Academics
Page 14 of 57

You might also like