Difference between TOC in DFA and NFA Slno Similarities 1. Both are transition functions of automata. 2. Both have same power. 3. Slno DFA NFA/NDFA 1. Stands for “Deterministic Finite Automata”. Stands for “Non-deterministic Finite Automata”. 2. No empty string transitions occurs in DFA. Empty string transitions may also possible. Read more…
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 Nils J. Nilson 5. Artificial Intelligence Pearson Luger
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…
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, as well as the problem’s structure of the problem being Read more…