Flowchart The flowchart is the important topic of the Computer Programming & technology. Moreover, Freestudy9 has all kind of important topic and information about the subject. The flowchart is a pictorial or graphical representation of a process. Each step in the process is represented by a different symbol and contains a short description of the […]

# Engineering Study

## Advantages and Limitations of Computer | CPU

Computer Advantages Computer Advantages is the important topic of the Computer Programming & Utilization. Moreover, Freestudy9 has all kind of important topic and information about the subject. Speed: It can calculate millions of expressions within a fraction of a second. The microsecond and nanosecond units are used to measure the speed of computers. There some […]

## Basic Terms of Entity-Relationship Model | ER Model

Entity Relationship Model Entity Relationship Model is the important topic of the Database Management System. Moreover, Freestudy9 has all kind of important topic and information about the subject. Entity An entity is a thing or object or person in the real world that is distinguishable from all another object. E.g. book, student, employee, college etc… […]

## Travelling Salesman Problem – Analysis and Design of Algorithms

Travelling Salesman Problem Travelling Salesman Problem is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. Given a graph G = (V, E), find a cycle of edges of this graph such that all of the vertices in the graph is […]

## Hamiltonian Problem – Analysis and Design of Algorithms

Hamiltonian Problem Hamiltonian Problem is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. To find a Hamiltonian cycle un graph ‘G’ is not a decision problem but is graph G Hamiltonian is a decision problem. In Hamiltonian problem graph G […]

## NP-Hard and NP-Complete Problems – Analysis and Design of Algorithms

NP-Hard and NP-Complete Problems NP-Complete Problems is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. NP-Complete The class of problems “NP-complete stands for the sub-lass od decision problems in NP that are hardest. The class NP-complete is abbreviated as NPC […]

## P and NP Problems – Introduction to NP Completeness | ADA

P and NP Problems P and NP Problems is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. P Problems The class P consists of those problems that are solvable in polynomial time. More specifically, they are problems that can be […]

## Knuth Morris Pratt Algorithm – Analysis and Design of Algorithms

Knuth Morris Pratt Algorithm Knuth Morris Pratt Algorithm is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. Knuth, Morris, and Pratt proposed a linear time algorithm for the string matching problem. A matching time of O(n) is achieved by avoiding […]

## String Matching with Finite Automata – Analysis and Design of Algorithms

String Matching with Finite Automata String Matching with Finite Automata is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. Many string-matching algorithms build a finite automaton that scans the text string T for all occurrences of the pattern P. We […]

## Rabin-Karp Algorithm – Analysis and Design of Algorithms

Rabin-Karp Algorithm Rabin-Karp Algorithm is the important topic of the Analysis & Design of Algorithm. Moreover, freestudy9 has all kind of important information and topic related to it. This algorithm makes use of elementary number-theoretic notions such as the equivalence of two numbers modulo a third number. Let us assume that Σ = {0, 1, […]