DAA JNTUH PPTS UNIT WISE

DAA UNIT WISE PPTS

πŸ‘‰ UNIT -1 : 

In this ppt , I  have covered the following toipics and discussed in the youtube video link UNIT1 :
1. Algorithm ?
2. Performance analysis of an algorithm ?
3. Asymptotic notations ?
4. Divide and conquer approach ?
5. Binary search ?
6. Merge Sort ?
7. Quick Sort ?


  • you can find the important questions also by going to our Youtube channel or important questions section 

πŸ‘‰ UNIT -4:

Following topics discussed in the full video , link

00:00 introduction
01:03 greedy method
5:34 characteristics
6:29 Applications
7:01 Job Sequencing
18:10 SSSP Algorithm
21:36 Dijkstra's Algorithm
36:05 Tree Traversal techniques
43:52 Minimum spanning tree
48:35 Prim's Algorithm
52:46 Kruskal's Algorithm
1:00:00 Graph traversal techniques


πŸ‘‰ UNIT 2 :

YOUTUBE LINK:

Introduction 00:00
Dis-joint set & operations 00:10
Backtracking 13:53
Sum of subsets 20:05
N-Queens Problem 26:43
Graph coloring 34:37
Priority Queue 38:39
Heap sort 45:00

SUBSCRIBE To @CodingFataka Youtube channel for more content like this . 

 

Comments

Popular posts from this blog

FIOT UNIT WISE NOTES | JNTUH R18 | CODINGFATAKA

Important questions of DAA JNTUH R22

Machine Learning Important Questions JNTUH R22

Important Questions Of ATCD JNTUH R22 | CodingFataka

STM Hand Written Notes JNTUH | Software Testing methodologies Notes | CodingFataka