Scribd
Upload
34 views2 pages

Assignment BCS401

The document outlines the assignment questions for the BCS401 course on Analysis and Design of Algorithms for the 2023-2027 batch at Jyothy Institute of Technology. It includes six problem statements related to algorithm design, covering topics such as cost minimization for cuts, library access in cities, word search in grids, Sudoku solving, graph coloring, and finding pairs with minimum absolute difference. The assignment is issued on May 20, 2025, and is due on May 30, 2025, with a total of 10 marks available.

Uploaded by

mamathmamatha.k2345
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
34 views2 pages

Assignment BCS401

The document outlines the assignment questions for the BCS401 course on Analysis and Design of Algorithms for the 2023-2027 batch at Jyothy Institute of Technology. It includes six problem statements related to algorithm design, covering topics such as cost minimization for cuts, library access in cities, word search in grids, Sudoku solving, graph coloring, and finding pairs with minimum absolute difference. The assignment is issued on May 20, 2025, and is due on May 30, 2025, with a total of 10 marks available.

Uploaded by

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

Jyothy Charitable Trust®

Jyothy Institute of Technology


Tataguni, off Kanakapura road, Bengaluru-560082
Approved by The All India Council for Technical Education (AICTE) - New Delhi;
Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
Department of Artificial Engineering & Machine learning

ASSIGNMENT QUESTIONS 2024-25 EVEN SEMESTER

Batch 2023– 2027


Year/Semester/Section 2nd Year/4th Sem

Course Code – Title BCS401 Analysis and Design of Algorithms

Name of the Course


Dr. Manjunath H R Associate Professor
In charge

Assignment No: 01 Total marks:10


Date of Issue:20 May 2025 Date of Submission: 30 May 2025
Sl. Course RBT
Assignment Questions Marks
No Outcomes Level
Problem Statement 1 L3 10
CO3
You are given a board of size M x N that you want to cut into 1x1
squares. You can make horizontal and vertical cuts. Each cut has a
cost associated with it:

1. horizontalCuts[] = costs of horizontal cuts

verticalCuts[] = costs of vertical cuts

Each time you make a cut, it multiplies the cost by the number of
segments it [Link] goal is to minimize the total cost of
cutting the board into 1x1 squares.
Problem Statement 2 L2
CO4
You’re given:n cities and m roads between them.

Building a library in any city costs c_lib.


2.
Repairing a road between two cities costs c_road.

Goal: Ensure every city has access to a library, either directly or via
roads connecting to a city with a [Link] the minimum total cost
to do this
3. Problem statement 3 CO4 L2

A 2D board of characters and a string word.

Task:
Jyothy Charitable Trust®
Jyothy Institute of Technology
Tataguni, off Kanakapura road, Bengaluru-560082
Approved by The All India Council for Technical Education (AICTE) - New Delhi;
Affiliated to VisvesvarayaTechnological University(VTU), Belagavi;
Department of Artificial Engineering & Machine learning

Return True if the word exists in the grid.


The word can be constructed from letters of sequentially adjacent
cells, where adjacent cells are horizontally or vertically neighboring.
The same letter cell may not be used more than once.
Problem Statement 4 CO2 L2

You are given a 9x9 grid of characters, where:

4.  Digits '1' to '9' represent filled cells


 The character '.' represents empty cells

Your task is to fill the empty cells to form a valid Sudoku solution.
You may assume that the given board has one unique solution.
Problem Statement 5

Given:

 A graph with N vertices.


 An integer M (the maximum number of colors allowed).
CO5
5. Goal: Assign colors (from 1 to M) to each vertex such that no two
adjacent vertices have the same color.

Constraints

 You cannot assign the same color to adjacent nodes.


 Use only colors in the range [1, M].

Problem statement 6
CO1
6. Given an unsorted array of distinct integers, find all pairs of elements
such that the absolute difference between them is minimum. Return
these pairs in ascending order.

Note: All Questions Compulsory

Course In charge DAEC HOD

You might also like