LectureNotes.in works best with JavaScript, Update your browser or enable Javascript
×
Time can be your best friend and your worst enemy depending on whether you use it or waste it.
--Your friends at LectureNotes
Close
Lecture
Notes
Home
Explore
Engineering and Technology
Electrical Engineering
Computer Science Engineering
Electronics and Instrumentation Engineering
Information Technology Engineering
Electronics and Telecommunication Engineering
Electrical and Electronics Engineering
Chemical Engineering
Civil Engineering
Mechanical Engineering
Master of Computer Application
Placement Preparation
Quantitative Aptitude
Logical Reasoning
Verbal Ability
Verbal Reasoning
View All
Discover More
All Classrooms
New
Latest Uploads
Video Tutorials
Question Sets
Lab Manuals
Upload
LCA
New
Prime
New
Search
Register/Login
Note for Design And Analysis Of Algorithm - DAA By Animesh Dutta
Design And Analysis Of Algorithm - DAA
Note
Computer Science Engineering
17 Topics
14118 Views
330 Offline Downloads
Uploaded 1 year ago
Add
Add to Favourite
Add to classroom
Report
Home
Design And Analysis Of Algorithm
Note By Animesh Dutta
Touch here to read
Page-1
Note for Design And Analysis Of Algorithm - DAA By Animesh Dutta
Analysis of algorithm - ( 1 - 5 )
Insertion sort algorithm - ( 6 - 7 )
Divide & Conquer - ( 8 - 9 )
Master Theorem for D&C - ( 10 - 12 )
Recursive tree method - ( 13 - 13 )
Quick sort - ( 14 - 14 )
Merge sort - ( 15 - 18 )
Greedy Algorithm - ( 19 - 19 )
Fractional knapsack problem - ( 20 - 21 )
Activity selection problem - ( 22 - 22 )
Event scheduling problem - ( 23 - 23 )
Heap sort - ( 24 - 27 )
Huffman code - ( 28 - 30 )
Matrix chain multiplication - ( 31 - 36 )
Longest common subsequence - ( 37 - 39 )
0/1 knapsack - ( 40 - 41 )
Graph - BFS - ( 42 - 43 )
Topic:
1
Go To Page:-
/ 43
Next Page
Previous Page
Next Topic
Previous Topic
Animesh Dutta
1
2
3
4
5
0
User(s)
Download Offline
Download PDF
Order Printed Copy
Share it with your friends
Topics ( 17 )
Analysis of algorithm
1
Insertion sort algorithm
6
Divide & Conquer
8
Master Theorem for D&C
10
Recursive tree method
13
Quick sort
14
Merge sort
15
Greedy Algorithm
19
Fractional knapsack problem
20
Activity selection problem
22
Event scheduling problem
23
Heap sort
24
Huffman code
28
Matrix chain multiplication
31
Longest common subsequence
37
0/1 knapsack
40
Graph - BFS
42
View All Topic
Leave your Comments
Post Comment
Amaresh Swain
2 months ago
0
0
i want a tutor in Bhubaneswar to guide me in Competitive Programming .I am just in class 10th and Preparing for International olympiad in Informatics(IOI) ,codechef handle amr7 .email amaresh7503@gmail.com
Animesh Dutta
1 year ago
0
1
Anyone having any doubt regarding notes, please contact me.
Text from page-1
Scanned by CamScanner
Text from page-2
Scanned by CamScanner
Text from page-3
Scanned by CamScanner
Text from page-4
Scanned by CamScanner
Next Page
Suggested Materials
Suggested Subjects
Java Programming
Software Engineering
Industrial Management
Communication Systems
Topic(s)
01
Pages: 5
Topic 1
Analysis of algorithm
02
Pages: 2
Topic 2
Insertion sort algorithm
03
Pages: 2
Topic 3
Divide & Conquer
04
Pages: 3
Topic 4
Master Theorem for D&C
05
Pages: 1
Topic 5
Recursive tree method
06
Pages: 1
Topic 6
Quick sort
07
Pages: 4
Topic 7
Merge sort
08
Pages: 1
Topic 8
Greedy Algorithm
09
Pages: 2
Topic 9
Fractional knapsack problem
10
Pages: 1
Topic 10
Activity selection problem
11
Pages: 1
Topic 11
Event scheduling problem
12
Pages: 4
Topic 12
Heap sort
13
Pages: 3
Topic 13
Huffman code
14
Pages: 6
Topic 14
Matrix chain multiplication
15
Pages: 3
Topic 15
Longest common subsequence
16
Pages: 2
Topic 16
0/1 knapsack
17
Pages: 2
Topic 17
Graph - BFS
Login
Register
Search
Lecture
Notes
Home
Prime
New
LCA
New
Course
Upload
Video material
Classrooms
New
Placement Preparations
Latest Uploads
Contact Us
Lecture
Notes
Login
Register
Recovery
Report
""
0
Readers Online
Leave your Comments
Amaresh Swain
2 months ago 00Animesh Dutta
1 year ago 01