Scribd
Upload
4 views1 page

Analysis and Design of Algorithms (BCS401) Question Bank: Module-1

The document is a question bank for the Analysis and Design of Algorithms course (BCS401), covering two modules. Module 1 includes questions on algorithms, sorting techniques, recursive algorithms, and string matching, while Module 2 focuses on exhaustive search, divide and conquer strategies, matrix multiplication, and optimization problems. Each question prompts students to design algorithms, analyze their efficiency, and apply them to specific examples.

Uploaded by

UNNATI SAXENA
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
4 views1 page

Analysis and Design of Algorithms (BCS401) Question Bank: Module-1

The document is a question bank for the Analysis and Design of Algorithms course (BCS401), covering two modules. Module 1 includes questions on algorithms, sorting techniques, recursive algorithms, and string matching, while Module 2 focuses on exhaustive search, divide and conquer strategies, matrix multiplication, and optimization problems. Each question prompts students to design algorithms, analyze their efficiency, and apply them to specific examples.

Uploaded by

UNNATI SAXENA
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/ 1

Analysis and Design of Algorithms (BCS401)

Question Bank
Module-1
1. What is an algorithm?
2. Explain asymptotic notations with examples.
3. Explain different aspect in designing and analyzing an algorithm with neat diagram.
4. Design recursive algorithm for computing factorial of a positive number and analyze the efficiency of algorithm.
5. Explain different aspect in designing and analyzing an algorithm with neat diagram.
6. Design a selection sort algorithm to sort n numbers and apply this algorithm to sort the following numbers in ascending
order. 80, 40, 60, 90, 20, 30 and 10.
7. Design a 2 X 2 matrix multiplication non-recursive algorithm with example and analyze the time efficiency.
8. Explain brute-force string matching algorithm with example.
9. Explain the general plan for analyzing the time efficiency of recursive algorithm with an example.
10. Design a bubble sort algorithm to sort n numbers and apply this algorithm to sort the following numbers in ascending order.
80, 40, 60, 90, 20, 30 and 10.
Module-2
1. Define Exhaustive Search.
2. Explain the concept of divide and conquer. Design an algorithm for merge sort and derive its time complexity.
3. Explain Strassen’s matrix multiplication and derive its time complexity.
4. Explain how exhaustive search can be applied to traversing salesman problem to find shortest Hamiltonian circuit of the
given graph.

5. Explain Multiplication of Large Integers and derive its time complexity.


6. Design a quick sort algorithm to sort n numbers and apply this algorithm to sort the following numbers in ascending order.
25, 75, 45, 15, 26 and 30.
7. Apply the source removal method to solve the topological sorting problem for the following digraphs.

8. Apply exhaustive method to obtain an optimal solution to the knapsack problem given W=10, w1 = 7, w2 = 3, w3 = 4 and w4
= 5, v1 = 42, v2 = 12, v3 = 40 and v4 = 25. Find total profit earned.
9. Design binary tree traversals using recursive algorithm and analyze the algorithm efficiency.
10. Explain brute-force string matching algorithm with example.

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