Scribd
Upload
9 views

DAA lab

The document outlines the course structure for the Design and Analysis of Algorithm Laboratory for B. Tech. Computer Engineering students, detailing objectives, outcomes, and evaluation schemes. Students are expected to implement various algorithm design strategies and submit assignments in a specified format. The document also includes guidelines for laboratory conduction and a suggested list of assignments.

Uploaded by

SYCOC143 Shivraj Lawhare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
9 views

DAA lab

The document outlines the course structure for the Design and Analysis of Algorithm Laboratory for B. Tech. Computer Engineering students, detailing objectives, outcomes, and evaluation schemes. Students are expected to implement various algorithm design strategies and submit assignments in a specified format. The document also includes guidelines for laboratory conduction and a suggested list of assignments.

Uploaded by

SYCOC143 Shivraj Lawhare
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Program: B. Tech.

(Computer Engineering) Semester: V

Course: Design and Analysis of Algorithm Laboratory Code: BCE5412

Teaching Scheme Evaluation Scheme

Practical Tutorial Credit Hours TW PR OR Total

02 - 01 02 25 50 - 75
Prior knowledge of
Data Structure and Algorithms, Advance Data Structure
is essential.

Course Objectives:
1. To apply various design strategies of algorithms.
2. To develop time and space efficient algorithms.
3. To compare different strategies and find exact solutions.
4. Decide a suitable design strategy to solve a real-world problem.
Course Outcomes:
After learning the course, the students will be able to:
1. Implement different problem solving strategies to solve computational problems.
2. To analyze, and compare algorithms
3. Implement search algorithms for finding solutions to different search problems.
4. Design and Implement time and space efficient algorithms.
5. Find the optimal solution to a problem by analyzing the it’s performance.
6. Develop an application to provide a solution to a selected problem by developing problem solving
ability.
Guidelines for Students:
1. The laboratory assignments are to be submitted by students in the form of a journal.
2. Each assignment write-up should have Title, Objectives, Outcomes, Theory- Concept in brief, data
description, conclusion, and assessor's sign.
3. Program codes with sample output of all performed assignments should be submitted.

Guidelines for Laboratory/Term Work Assessment:


1. Continuous assessment of laboratory work is done based on the overall performance and laboratory
performance of the students.
2. Each laboratory assignment assessment should assign grade/marks based on parameters with
appropriate weightage.
3. Suggested parameters for overall assessment as well as each laboratory assignment assessment
include- timely completion, performance, innovation, efficiency, punctuality and neatness.

Guidelines for Laboratory Conduction


1. Recommended Tools for the implementation of above assignments: Python, Java etc.
2. For mini project, select a real world application in the group of 3-4 students and formulate a
problem statement for application to be developed.
3. Student groups are required to continue same problem statement throughout all the assignments in
order to design and develop an application as a part of mini project. Further assignments will be
useful for students to develop an application.
4. Student should perform any 6 assignments out of 8

TY BTech (Computer Engineering), PCCoE Pune Page 16


Suggested List of Assignments
Assignment
Assignment Title
No.
Write a program to compute square of 20-digit large integer numbers using divide and
1.
conquer strategy.
Consider the scheduling problem. n tasks to be scheduled on single processor. Let d1,
2. ...,dn be deadline and p1,….pn be the profit of each task to execute on single processor is
known. The tasks can be executed in any order but one task at a time and each task take 1
unit of time to execute. Design a greedy algorithm for this problem and find a schedule or
sequence of jobs that gives maximum profit.
You have a business with several offices; you want to lease phone lines to connect them up
3. with each other; and the phone company charges different amounts of money to connect
different pairs of cities. You want a set of lines that connects all your offices with a
minimum total cost. Solve the problem by Floyd-Warshall algorithm.
You have been given a network of ‘N’ nodes from 1 to ‘N’ and ‘M’ edges. For each edge,
you are given three values (ui, vi, wi) where “ui” and “vi” denote the nodes and “wi”
4. denotes an integer value which represents the time taken by a signal to travel from “ui” to
“vi”. Now, you are supposed to find the time which a signal takes to travel from a given
node ‘K’ to all nodes. If it is impossible for all nodes to receive the signal then print -1.
Implement the given Network Delay Time using Dijkstra’s algorithm.
A classic problem that can be solved by backtracking is called the Knight's tour Problem.
It is a problem in which we are provided with a NxN chessboard and a knight. For a
person who is not familiar with chess, the knight moves two squares horizontally and one
5. square vertically, or two squares vertically and one square horizontally. In this problem,
there is an empty chess board, and a knight starting from any location in the board, our
task is to check whether the knight can visit all of the squares in the board or not. When It
can visit all of the squares, then place the number of jumps needed to reach that location
from the starting point.
Let there be N students and N clubs. Any student can be assigned to any club, incurring
6. some cost that may vary depending on the student club assignment. It is required to
allocate all clubs by assigning exactly one student to each club and exactly one club to
each agent in such a way that the total cost of the assignment is minimized. Implement
club assignment problem using Branch and bound.
7. Mini-Project

Text Books:

1. Thomas H Cormen and Charles E.L Leiserson, “Introduction to Algorithms”, The MIT Press; 4th
edition, April 5, 2022, ISBN-13: 978-0262046305
2. Jon Kleinberg, Eva Tardos, “Algorithm Design”, Pearson, 2nd edition, 2013, ISBN-13:
978-1292023946.
3. Horowitz, Sahani, “Fundamentals of computer Algorithms”, Galgotia. 2Nd Edition, 1998.ISBN
81-7515-257- 5
Reference Books:

1. Michael T. Goodrich, Roberto Tamassia, “Algorithm Design: Foundations, Analysis and Internet
Examples”, Wiley, ISBN 978-81-265-0986-7
2. Gilles Brassard, Paul Bratley, “Fundamentals of Algorithmics”, PHI, ISBN 978-81-203-1131-2.

TY BTech (Computer Engineering), PCCoE Pune Page 17

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy