[go: up one dir, main page]
Scribd
Upload
15 views1 page

Assignment 1

This document outlines an assignment for a course on Design and Analysis of Algorithms, due on July 19, 2025, worth a total of 20 marks. It consists of four questions that require explanations, pseudocode, or examples related to algorithm analysis, brute force methods, the Divide and Conquer paradigm, and the Decrease and Conquer strategy. Students are instructed to submit their answers in a typed document format (PDF or Word).

Uploaded by

elafhamoada
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
15 views1 page

Assignment 1

This document outlines an assignment for a course on Design and Analysis of Algorithms, due on July 19, 2025, worth a total of 20 marks. It consists of four questions that require explanations, pseudocode, or examples related to algorithm analysis, brute force methods, the Divide and Conquer paradigm, and the Decrease and Conquer strategy. Students are instructed to submit their answers in a typed document format (PDF or Word).

Uploaded by

elafhamoada
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

Design and Analysis of Algorithms

Assignment (1)

Date : 12/7/2025

Note:

• Support your answers with explanations, pseudocode, or examples where applicable.


• Submit your answers in a typed document (PDF or Word).
• Deadline: 19/7/2025
• Total Marks: 20 (5 marks per question)

1. Explain the significance of asymptotic notation in algorithm analysis. Discuss Big-O, Big-
Ω, and Big-Θ notations and explain their use in evaluating algorithm performance. Provide
one example algorithm and analyze its time complexity using Big-O.

2. Describe the brute force approach to solving problems. Then, write the brute force solution
for the travelling salesman problem, and analyze its time complexity.

3. Describe the Divide and Conquer paradigm and explain how it is used in the Merge Sort
algorithm. Provide the recurrence relation for Merge Sort and solve it to find the time
complexity.

4. Explain the Decrease and Conquer strategy. Illustrate your explanation by applying it to
compute the factorial of a number using recursion. What is the time complexity?

You might also like