Blog

SlNo Book's Name Author's Name Publications 01. Fundamentals of Computer Algorithm Ellis Horowitz And Sartaj Sawhney — 02. Introduction to Algorithms Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest and Clifford Stein. PHI Publications. 03. Algorithms Robert Sedgewick and …

Hash Algorithm : Hash Algorithm is a Hash function that takes a string of any length and decreases it to a unique fixed length string. It is used for password validity, message & data integrity and for many other cryptographic …

Ques. :  What is an algorithm in computing? Ques. : What is the need of Algorithm? Ques. : What are the features of a good algorithm? Ques. : How an algorithm is different from Flowchart? Ques. : What are the …

Difference between Algorithm and Flowchart Slno. Algorithm Flowchart 01. A method of representing thestep-by-step logical procedure for solving a problem. Flowchart is pictorial representation of an algorithm. It is constructed using different types of boxes and symbols. 02. It describes …

Analysis of Algorithm  The field of computer science, which studies efficiency of algorithms, is known as analysis of algorithms. The time and space used by the algorithm(M) are the two main measures for the efficiency of an algorithm. The analysis …

Complexity of Algorithm The complexity of an algorithm(M) is the function f(n) which gives the running time and/or storage space requirement of the algorithm in terms of the size(n) of the input data. Mostly, the storage space required by an …

Divide & Conquer Binary search Multiplication of two n-bits numbers Quick Sort Heap Sort Merge Sort Greedy Method Knapsack (Fractional) Problem Minimum Cost Spanning Tree Kruskal‟s algorithm Prim‟s algorithm Single Source Shortest Path Problem Dijkstra’s Algorithm Dynamic Programming All Pair …

Introduction The Branch and Bound algorithm is a powerful technique for solving optimization problems that has been successfully applied to a wide range of problems. Its effectiveness/performance depends on the quality of the bounds used to prune the search space, …

Introduction It is one of the very important types of algorithms. Definition Backtracking is a general algorithmic technique that is used to solve a wide range of problems, including combinatorial optimization problems, constraint satisfaction problems, and other problems that involve …

Introduction The dynamic Programming method is a famous algorithmic principle used widely in several applications. Definition Dynamic programming is a technique for solving complex problems by breaking them down into smaller & simpler sub-problems and solving each sub-problem only once, …