Scribd
Upload
5 views5 pages

Dev DAA Assignment

This document is an assignment from the TECHNO INSTITUTE OF HIGHER STUDIES for the course on Design and Analysis of Algorithms, submitted by a BCA student to their professor. It includes various algorithm-related questions and topics such as sorting algorithms, complexity analysis, and data structures. The document also contains an acknowledgment section and a bibliography with references used for the assignment.

Uploaded by

eeeitsdevhere
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
5 views5 pages

Dev DAA Assignment

This document is an assignment from the TECHNO INSTITUTE OF HIGHER STUDIES for the course on Design and Analysis of Algorithms, submitted by a BCA student to their professor. It includes various algorithm-related questions and topics such as sorting algorithms, complexity analysis, and data structures. The document also contains an acknowledgment section and a bibliography with references used for the assignment.

Uploaded by

eeeitsdevhere
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
You are on page 1/ 5

TECHNO INSTITUTE OF HIGHER STUDIES

Affiliated to University of Lucknow

Assignment

on

DESIGN AND ANALYSIS OF ALGORITHM


(BCA-502)

Batch : 2022–25
Session : 2024–25

BCA 3rd Year 5th Semester

Submitted by: Submitted to:

Dev Manikant Shukla Mr. Kaushik Agarwal


BCA 3rd Year 5th Sem Assistant Professor
Roll No. : 2211774040019 Department of Computer Science
TABLE OF CONTENTS

Sr. Content Page Signature


No. No.
1. Write an algorithm for sorting which runs in
linear time to sort positive & negative integers
with help of an array which counts the
occurrences of elements in an array.
2. Why do we call Merge Sort as stable sort but
not Quick Sort? Justify with example.
3. What is BEST, WORST, AVERAGE CASE in
Algorithms Complexity?
4. Design an algorithm to sort the numbers using
min-heap approach?
5. What is divide and Conquer Technique of
Sorting? Explain Merge sort to achieve
descending order?
6. Explain Greedy method with Example.
7. Explain dynamic approach for Knapsack
Problem?
8. Describe Fibonacci Heap and Extract-min
function for any Fibonacci heap.
9. Explain single source shortest path algorithm for
any graph which contains negative weights.
Also justify if can answer the negative weight
cycle.
10. Explain B-Tree Insertion and deletion with
cases in detail?
Acknowledgement

I would like to express my special thanks of gratitude to Mr. Kaushik Agarwal


the subject teacher as well as our principal who gave me the golden opportunity
to do this wonderful assignment on the topic Design And Analysis of
Algorithm which also helped me in doing a lot of Research and I came to know
about so many new things I am really thankful to them.

Secondly, I would also like to thank my parents and friends who helped me a lot
in finalizing this assignment within the limited time frame.
Bibliography

Internet References :
i) https://www.fanshawec.ca/adc1-design-analysis-of-algorithms/next
ii) https://ebooks.lpude.in/management/mba/term_1/
DENG401_DESIGN_AND_ANALYSIS_OF_ALGORITHMS.pdf

Books References :
i) Jon Kleinberg and Éva Tardos, “Algorithm Design”, Pearson.
ii) Michael T Goodrich and Roberto Tamassia, “Algorithm Design: Foundations,
Analysis, and Internet Examples”, Wiley.
iii) Harry R. Lewis and Larry Denenberg, “Data Structures and Their
Algorithms”, Harper Collins.

You might also like