Solve of question paper subject Design and Analysis of Algorithms(btech computer science)

my online exam want to solve question paper for me have bidder full knowledge of below topic.
Unit 1
Introduction
Review of elementary data structures, analysing algorithms, asymptotic notation,
recurrence relations, hash tables, Binary search trees.
Sorting and Order Statistics
Heapsort, Priority queues,Quicksort, Sorting in linear time, medians and order statistics,
dynamic order statistics.
Unit 2
Advanced Design and analysis Techniques
Dynamic programming – Elements, Matrix-chain multiplication, longest common
subsequence, optimal polygon traingulation, Greedy algorithms- Elements , activityselection problem, Huffman codes, task scheduling problem.
Advanced data Structures
Operations in B-Trees, Binomial heaps, Fibonacci heaps, data structures for disjoint sets,
strings.
Unit 3
Graph Algorithms
Review of graph algorithms, topological sort, strongly connected components,minimum
spanning trees- Kruskal and prims,Single source shortest paths, relaxation, Dijkstras
algorithm, Bellman- Ford algorithm, Single source shortest paths for directed acyclic
graphs, difference constraints and shortest paths, All pairs shortest paths- shortest paths
and matrix multiplication, Floyd-Warshall algorithm, Johnsons algorithm.
Unit 4
Flow and Sorting Networks
Flow networks, Ford- Fulkerson method, Maximum bipartite matching, Sorting
Networks, Comparison network, The zero- one principle, Bitonic sorting network,
merging network