Definition Pseudo-code is a compact and informal high-level description of a computer programming algorithm that uses the structural conventions of some programming language. Pseudocode is a kind of structured English for describing algorithms in an easily readable and modular form. This helps in describing how the system will solve the given problem. Read more…
(A) Asymptotic Notations (n→∞): Asymptotic notations are used to express the running time of an algorithm in terms of function, whose domain is the set of natural numbers N={1,2,3,…..}. Such notations are convenient for describing the worst case running time function T(n). Asymptotic notation gives the rate of growth, i.e. Read more…
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 Kevin Wayne Addison Wesley 04. Introduction to Algorithms: A Creative Read more…
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 systems. A Hash table is (related to a Hash Function) Read more…
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 demerits of Algorithm? Ques. : What is Complexity? What is Read more…
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 step-by-stepdescriptions and each step represents a particular operation leading to Read more…
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 of algorithms can be evaluated by a variety of criteria. Read more…
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 algorithm is simply a multiple of the data size(n). Generally, Read more…
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 Shortest Path-Floyed Algorithm Chain Matrix Multiplication Longest Common Subsequence (LCS) Read more…