Scribd
Upload
105 views3 pages

Algorithm Suggestion 2021

This document contains a suggested chapter outline for a textbook on the design and analysis of algorithms. It includes 7 chapters that cover fundamental algorithm design techniques such as divide-and-conquer, greedy algorithms, dynamic programming, backtracking, and branch-and-bound. Each chapter lists topics and problems to be covered such as defining algorithm characteristics, solving recurrence relations, applications of greedy algorithms, dynamic programming examples using binary search trees, and algorithms for problems like the 8 queens and shortest paths. Contact information is provided at the end to stay connected with the algorithm community.

Uploaded by

Sajid Hossain Khan
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
105 views3 pages

Algorithm Suggestion 2021

This document contains a suggested chapter outline for a textbook on the design and analysis of algorithms. It includes 7 chapters that cover fundamental algorithm design techniques such as divide-and-conquer, greedy algorithms, dynamic programming, backtracking, and branch-and-bound. Each chapter lists topics and problems to be covered such as defining algorithm characteristics, solving recurrence relations, applications of greedy algorithms, dynamic programming examples using binary search trees, and algorithms for problems like the 8 queens and shortest paths. Contact information is provided at the end to stay connected with the algorithm community.

Uploaded by

Sajid Hossain Khan
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/ 3

Page No-01

CSE 4th Semester Suggestion-2021


Design & Analysis of Algorithm
Created by: Abu Sufiyan

Chapter 1
Introduction to algorithm

1 What is an algorithm?
2 Define the concept of Algorithm design.
3 Write down the characteristics of an algorithm.
4 What do you mean by pseudo code?
5 Mention the fundamental steps of solving an algorithm.
6 What is the difference between Algorithm and Pseudo code?
7 Describe different types of asymptotic notation with example.

8 Determine the frequency counts for all statements in the following


algorithm:
9 Explain the time space complexity of an algorithm.
10 What do you mean by performance measurement?
11 Define big "oh" (0) function.

Chapter 2
DIVIDE-AND-CONQUER
1) What is Divide and Conquer method?
2) Write down the control abstraction for the divide and conquer strategy.
3) Solve the following recurrence relation using substitution using
substitution method in which, a=1,b=2, f(n)=n and T(1)=2.

4)Write down advantages and disadvantages of binary search over linear


search algorithm.
Page No-02

Chapter 3
THE GREEDY METHOD
1. What is greedy choice property?
2. Describe the steps required to develop a greedy algorithm.
3. Describe the Components of Greedy Algorithm.
4. Write down the major Areas of Application of Greedy Algorithm.
5. Describe the general approach of greedy method using control
abstraction.
6. What is control abstraction?
7. Define a spanning tree.

Chapter 4
DYNAMIC PROGRAMMING

1 What do you mean by dynamic programming?


2 What is the difference between optimal solution and feasible solution?
3 Define A Binary Search Tree (BST)
4 Describe OBST as a dynamic programming with example.
5 Define quick sort algorithm with advantages and disadvantages.
6 Which applications are not suitable for quick short algorithm and why?

Chapter 5
BASIC TRAVERSAL AND SEARCH TECHNIQUES

1. What are the difference between linear search and binary search .
2. Write down the advantages and disadvantages of BFS and DFS
traversal algorithm.
3. Discuss optimal binary search trees problems.
4. Discuss the different traversal techniques of binary tree.
Page No-03

Chapter 6
BACKTRACKING
1 What do you mean by backtracking?
2 What are the factors that influence the efficiency of the
backtracking algorithm?
3 Write an algorithm for n-Queens problem.

4 Write down the control abstraction of LC search.


5 What do you mean by shortest path problem?
6 Write the Dijkstra’s algorithm for single sources shorten path
problem.

Chapter7
BRANCH-AND-BOUND
1)Differentiate backtracking and branch-bound method.
2)Discuss the 8 Queen problem.
3)Write down the algorithm for all pair's shortest path.
4)Write down the m-coloring algorithm.

Stay connected with us-


Admin Link : https://ww.wfacebook.com/sufiyanism/
Group Link : https://www.facebook.com/groups/nucsecommunity
Page Link : https://www.facebook.com/nucsehelpline/

You might also like