Scribd
Upload
189 views32 pages

Amity University, Jharkhand Ranchi: Self Work/Psda

The document outlines 9 questions about algorithms including designing algorithms for searching, sorting, solving recurrence relations, binary search trees, longest common subsequence, Huffman coding, activity selection, Rabin-Karp string matching, and complexity classes. It provides the question number, title, and page range for each of the 9 algorithm topics covered in the assignment.

Uploaded by

ABHISHEK RAJ
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
189 views32 pages

Amity University, Jharkhand Ranchi: Self Work/Psda

The document outlines 9 questions about algorithms including designing algorithms for searching, sorting, solving recurrence relations, binary search trees, longest common subsequence, Huffman coding, activity selection, Rabin-Karp string matching, and complexity classes. It provides the question number, title, and page range for each of the 9 algorithm topics covered in the assignment.

Uploaded by

ABHISHEK RAJ
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/ 32

AMITY UNIVERSITY, JHARKHAND

RANCHI

SELF WORK/PSDA

COURSE CODE: CSIT772


COURSE TITLE: Design And Analysis Of Algorithms

SUBMITTED BY: SUBMITTED TO:

NAME: PRACHI KUMARI PALLAB BANERJEE


ENROLLMENT NO: A35400719009
DEPARTMENT: MCA
SEMESTER: IV
INDEX

QUESTION QUESTION PAGE NO.


NO.

1. Searching 1-2
a) Design an Algorithm of Linear 1
Search
b) Design an Algorithm of Binary 2
Search
2. Sorting 3-8
a) Design an Algorithm of Merge 3-4
Sort and Find Its Time
Complexity.
b) Design an Algorithm of Quick Sort 5-6
and Find Its Time Complexity.
c) Design an Algorithm of Heap Sort 7-8
and Find Its Time Complexity.
3. Explain Three Method Used For 9-14
Solving Recurrence Timing
Function.
a) Substitution Method 9-12
b) Recursion Method 12-13
c) Master Theorem 13-14
4. Binary Search Tree Concept With 15-16
Insertion And Deletion Algorithm.
5. Explain LCS Determine an LCS of 17
X=<A,B,C,B,D,A> Y=<B,D,C,A,B,A>
6. Construct Huffman Code of 18-19
following sets Character And Find
Its Time Complexity Of The
Algorithm used
7. An Activity Selection Problem 20-21
8. The Rabin Karp Algorithm 22-25
9. Explain in detail NP Completeness 26-29
And Polynomial Time Verification.
a) NP Completeness 26-27
b) Polynomial Time Verification 27-29

You might also like