History and Basics of TOC

History The concept and roots of TOC originated in the 1930s/early 20th century during the “Crisis in Foundations of Mathematics,” when pioneering logicians like Kurt Gödel, Alonzo Church, and Alan Turing independently tackled Hilbert’s Entscheidungsproblem (decision problem).  Modern TOC started …

Loading

Reference Books AI

Slno Books Name Publications Author/Writer 1. Artificial Intelligence TMH E.Rich & K. Knight 2. Introduction to Artificial Intelligence Pearson E. Charnaik 3. Introduction to Artificial Intelligence & Expert Systems PHI Dan. W. Patterson 4. Principle of Artificial Intelligence Narosa Publication …

Loading

Reference Books algo

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 …

Loading

Miscellaneous Topics algorithm

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 …

Loading

Difference Between Algo

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 …

Loading

Analysis/Efficiency of Algorithm

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 …

Loading

Complexity and its Type

Link for Complexity Notations Complexity of Algorithm Introduction Complexity simply means difficulties in a process. Definition Algorithm complexity is a measure of the resources required by an algorithm as a function of input size to solve a problem. The two …

Loading

Examples of Algorithm

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 …

Loading