Job Saarnee

# DESIGN AND ANALYSIS OF ALGORITHM STUDY MATERIAL || 99+ MOST IMPORTANT QUESTION WITH SOLUTION

Design and Analysis of Algorithm

In computer
science, a Design and Analysis of Algorithm is a One of the most important
Subject in which we learn about

How to Analysis an Algorithm

How to Design an Algorithm

In This Post we cover all important question, topic
related it along with practical approach

Table of
content

• Syllabus
• Unit wise important question
• Unit wise Video Lecture
• All data structure Program in C and Java
•  Previous year Question paper

Syllabus
brief

Unit 1:

Introduction:
Algorithms, Analyzing Algorithms, Complexity of Algorithms, Growth of
Functions, Performance Measurements, Sorting and Order Statistics – Shell Sort,
Quick Sort, Merge Sort, Heap Sort, Comparison of Sorting Algorithms, Sorting in
Linear Time

Note: Solution is
going to be provided soon

2 Marks Important
Question

Most Frequently

Video lecture of Data structure

Provided soon

Unit 2:

Structures
: Red-Black Trees, B â€“ Trees,
Binomial Heaps, Fibonacci Heaps, Tries, Skip List

2 Marks Important Question

Most Frequently

Video lecture of Data structure

Provided soon

Unit 3:

Divide and Conquer
with Examples Such as Sorting, Matrix
Multiplication, Convex Hull and Searching.

Greedy Methods
with Examples Such as Optimal Reliability Allocation, Knapsack, Minimum
Spanning Trees â€“ Primâ€™s and Kruskalâ€™s Algorithms, Single Source Shortest Paths
– Dijkstraâ€™s and Bellman Ford Algorithms.

2 Marks Important
Question

Most Frequently

Video lecture of Data structure

Provided soon

Unit 4:

Dynamic
Programming
with Examples Such as Knapsack. All Pair Shortest Paths
Warshalâ€™s and Floydâ€™s Algorithms, Resource Allocation Problem. Backtracking,
Branch and Bound with Examples Such as Travelling Salesman Problem, Graph Colouring,
n-Queen Problem, Hamiltonian Cycles and Sum of Subsets

2 marks important
question

view

Most Frequently

view

Video lecture of Data structure

Provided soon

Unit 5:

Selected Topics
Algebraic Computation, Fast Fourier Transform, String Matching, Theory of NP Completeness,
Approximation Algorithms and Randomized Algorithms

2
marks important question

view

Most Frequently

view

Video lecture of Data structure

Provided soon

All data structure program

Provided soon

Previous year Paper of

2008,2009,2010,2011,2012,2013,2014,2015,2016,2017,2018,2019

Shopping Cart