Scribd
Upload
6 views

ADA Assignment1 (2)

This document is an assignment for the 4th semester students of the Computer Science and Engineering department, focusing on the Analysis & Design of Algorithms. It includes various questions related to algorithms, such as definitions, characteristics, problem-solving fundamentals, sorting algorithms, graph algorithms, and specific algorithm applications. Each question is assigned a specific mark and level of complexity.

Uploaded by

varshahajare2004
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
6 views

ADA Assignment1 (2)

This document is an assignment for the 4th semester students of the Computer Science and Engineering department, focusing on the Analysis & Design of Algorithms. It includes various questions related to algorithms, such as definitions, characteristics, problem-solving fundamentals, sorting algorithms, graph algorithms, and specific algorithm applications. Each question is assigned a specific mark and level of complexity.

Uploaded by

varshahajare2004
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

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

Assignment-1

Semester: 4th Date: 15/06/2024


Subject Name: Analysis & Design of Algorithms Subject Code: BCS401

Q. No. Questions Marks CO Level


Q1. Define an Algorithm and discuss the characteristics of an Algorithm. 5 CO1 L2

Q2. Explain fundamentals of Algorithmic Problem Solving. 5 CO1 L2


Q3. Design an algorithm for performing Sequential Search and compute best case, worst case, and 5 CO1 L3
average case efficiency.

Q4. Discuss various asymptotic efficiency classes. Explain Big-O, Big-Ω, and Big-Ɵ notations 5 CO1 L2
with examples.

Q5. Apply Selection sort and Bubble Sort for 89, 45, 68, 90, 29, 34, and 17. Also find its time 5 CO1 L3
complexity.

Q6. Consider the given graph. 5 CO4 L2

Find the weight of the minimum spanning tree using the Prim’s algorithm, starting from
vertex a.
Q7. Find minimum cost Spanning Tree for the following graph using Kruskal’s algorithm. 5 CO4 L3
Q8. Apply Floyd’s algorithm to find all pair shortest path for a given graph. Find the path matrix 5 CO4 L3
and hence find the intermediate vertices which participate in the path.

Q9. Define Transitive Closure. Find the T matrix for the graph given below. 5 CO3 L3

Q10. Apply topological sorting for the below graph. 5 CO3 L3

Q11. Discuss CoinRow and ChangeMaking problems. 5 CO2 L3

Q12. Design Insertion Sort algorithm and apply to the following array of elements 89, 5 CO2 L3
45, 68, 90, 29, 34, 17.
Q13. Apply Dijkstra’s algorithm for below graph, and find the single source shortest path. 5 CO4 L3

Prepared By
Dr. B N Veerappa Dr. Rachana P G

Professor & HOD Assistant Professor


Department of Computer Science & Engineering Department of Computer Science & Engineering
GM Institute of Technology GM Institute of Technology

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