All Creations

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

Basics of Logic gates and more

in this clip, you can find the basics of gates(AND,OR,NOT,NOR,NAND,XOR etc)and also much more.

Advanced DBMS

find notes on Query optimisation,Query processing,Data Mining,KD,Market Basket Analysis,Apriori FP Growth K-mean.

Theory of computation

topics-Design PDA CFG to CNF Simplification of CFG-Part 1 Simplification of CFG-Part 2 Simplification of CFG-Part 3 NFA to DFA NFA with null transitions to NFA without null transitions Minimization of DFA Mealy to Moore Moore to Mealy

K-maps(Karnaugh map)

K-maps explained in detail.

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 ..

Complexity of algorithm

what does complexity mean for a program? find out in this clip.