Scribd
Upload
2 views10 pages

Daa Assignment Bca III

The document outlines the assignments for the Design Analysis and Algorithms course for the Bachelor of Computer Application program, Batch 2023-24, detailing submission guidelines and deadlines for five assignments. Each assignment includes specific questions related to algorithms, sorting techniques, and graph theory. Students are required to submit handwritten assignments and scanned copies in a specified format, with penalties for discrepancies such as plagiarism.

Uploaded by

Master D
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
2 views10 pages

Daa Assignment Bca III

The document outlines the assignments for the Design Analysis and Algorithms course for the Bachelor of Computer Application program, Batch 2023-24, detailing submission guidelines and deadlines for five assignments. Each assignment includes specific questions related to algorithms, sorting techniques, and graph theory. Students are required to submit handwritten assignments and scanned copies in a specified format, with penalties for discrepancies such as plagiarism.

Uploaded by

Master D
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/ 10

SCHOOL OF ENGINEERING & IT

BACHELOR OF COMPUTER APPLICATION

BATCH 2023-24

SEMESTER 3

DESIGN ANALYSIS AND ALGORITHMS

ASSIGNMENTS

Prepared By:
Ms. Divya Paikaray
Assistant Professor
General Instructions

Students are advised to submit the assignment along with the below mentioned information
at the top Page: -

I. Student ID :- AJU/………..

II. Name of The Students :-

III. Course Name :-

IV. Contact No :-

V. E-Mail :-

2. Total 5 assignments will be given. All the Assignments are compulsory

3. Submit unit-wise Assignment.

4. Each Assignment has a separate deadline.

5. Assignment correction should be on or before the deadline.

6. Students have to use only Classmate Type Copy to Answer their Assignment in their own
handwriting.

7. Typed or Print out Assignments are not accepted.

8. After completion of the assignment, students will make a scan copy of the solution as pdf
format and afterward have to submit by google form or via mail only.

9. The Assignment pdf file name would be in the unique format of Students Registan
no_CourseName. (Ex: - AJU/210001 and Intro to CS pdf file name should be
AJU_170001_Intro_To_CS).

10. If any discrepancy such as copying/duplication from others is found in the assignment
submitted, cancellation of the entire assignment may be imposed.

11. Students should have to submit handwritten Assignments as hard copy & scanned of
the same for future reference to the course teacher as instructed.
Assignment 1

Issue Date: 6.8.2024


Last date of submission: 15.8.2024
1. What is an Algorithm? Explain with an example.
2. Differentiate between prior and posterior analysis.
3. What is asymptotic notation? Classify and explain.
4. What is Time complexity? Explain Big O with an example considering two algorithms.
5. Explain Euclid’s algorithm for GCD?
6. What is an Algorithm? How do we compare two algorithms?
7. What do you mean by complexity of algorithm? Explain.

8. If and , . Prove that is Big O .


9. Explain best, worst and average cases.
10. What is an algorithm? Write its advantages, disadvantages and characteristics.
Assignment 2

Issue Date: 15.8.2024


Last date of submission: 25.8.2024

1) What is insertion sort? Write its advantages, disadvantages, time complexity and space

Complexity.

2) Write the algorithm of insertion sort? Explain it with an example.

3) Write short notes on Divide and Conquer algorithm

4) What is the Min Max problem? Explain it with an example.

5) Explain the quick sort algorithm considering one example.

6) Explain the Merge sort algorithm considering one example.

7) Explain Strassen's Matrix multiplication algorithm considering one example.

8) Explain the linear search algorithm considering one example.

9) Explain the binary search algorithm considering one example.

10) Derive the Time Complexity of Linear Search Algorithms.

11) Differentiate among Linear, Polynomial & Exponential.

12) Sort the given Array using Quick Sort algorithm:

35, 50, 15, 25, 80, 20, 90, 45

13) Sort the given Array using Merge Sort algorithm:

6, 4, 2, 1, 9, 8, 3, 5, 10
Assignment 3

Issue Date: 26.8.2024


Last date of submission: 4.9.2024
1. What is Greedy Algorithm? Explain.What are its benefits?
2. Explain Minimum Spanning Tree & Calculate the number of all possible spanning tree
by considering one example.
3.

4. Explain Kruskal’s Algorithm with an example. Also find the Minimum Cost Spanning
Tree.
5. Explain Prim’s Algorithm with an example. Also find the Minimum Cost Spanning Tree.
6. Explain Dijkstra’s Algorithm with an example. Also find the Minimum Cost Spanning
Tree.
7. Write an algorithm for Single source shortest path. Explain with an example.
8.

9.
Assignment 4

Issue Date: 10.9.2024


Last date of submission: 18.9.2024
1. Briefly explain the n-queen problem using Backtracking. Explain its applications.

2. Briefly explain Hamiltonian cycles using backtracking.

3. What is Graph coloring? Write an algorithm for it and explain with an example

4. Write an algorithm for how Eight Queens problem can be solved using backtracking and
explain with an example.

5. Consider a set S= {5, 10, 12, 13, 15, 18} and d= 30. Solve it for obtaining the sum of the
subset.

6.
Assignment 5

Issue Date: 20.8.2024


Last date of submission: 26.9.2024
1. Explain DFS with suitable examples?

2. Find cycle in undirected Graph using DFS.

3. Types of Edges in DFS.

4.
5. What is the BFS Algorithm (Breadth-First Search)? Applications of BFS.

6. The architecture of the BFS algorithm.

7. What is DFS Algorithm (Depth-First Search)? Applications of DFS.

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