Choose filters to find knowledge
Design and analysis of algorithms(topic-wise)(ADA)
The Attatchment includes topics of design and analysis of algorithms, such as -Introduction, Complexity of algo, Asymptotic Notation, Finding function in asymptotic notation, Master's Theorem, Finding Complexity, Divide and Conquer intro, Intro to Greedy, Knapsack, Job Sequencing, Minimum Cost Spanning tree, Prims Algo, Kruskal algo, 0/1 Knapsack, Travelling Salesperson, Multistage Graph, Back Tracking, N Queen, M colorability and 15 puzzle
Quine-McCluskey Method(qm method)
The Quine–McCluskey algorithm is a method used for minimization of Boolean functions that was developed by Willard V. Quine and extended by Edward J. McCluskey. It is functionally identical to Karnaugh mapping, but the tabular form makes it more efficient for use in computer algorithms, and it also gives a deterministic ..