The searching method are applicable to a number of places in current's world, may it be Internet, search engines, text pattern matching, on line enquiry, finding a record from database, etc.

The most vital application of searching is to track a specific record from a large file, efficiently and faster.

Let us discuss some applications of Searching in the world of computers.

Spell Checker

Generally this application is used in Word Processors. It is depend on a program for checking spelling that it checks and searches sequentially. That is, it employee the concept of Linear Search. The program looks up word in list of words from a dictionary. Any word which is searched into the list is supposed to be spelled correctly. Any word that isn't found is supposed to be spelled wrong.

Posted Date: 4/11/2013 5:30:58 AM | Location : United States

Ask an Expert

Related Discussions:- Applications of linear and binary search, Assignment Help, Ask Question on Applications of linear and binary search, Get Answer, Expert's Help, Applications of linear and binary search Discussions

Write discussion on Applications of linear and binary search
Your posts are moderated

Write your message here..

Related Questions

Algorithmss, calculate gpa using an algorithm calculate gpa using an algorithm

Define tree ?, A tree is a non-empty set one component of which is designat... A tree is a non-empty set one component of which is designated the root of the tree while the remaining components are partitioned into non-empty groups each of which is a subtree

Degree of node, Q. The degree of a node is defined as the number of childre... Q. The degree of a node is defined as the number of children it has. Shear show that in any binary tree, the total number of leaves is one more than the number of nodes of degree 2

Array implementation of lists, In the array implementation of the lists, we... In the array implementation of the lists, we will use the array to hold the entries and a separate counter to keep track of the number of positions are occupied. A structure will b

Explain almost complete binary tree, Almost Complete Binary Tree :-A binary... Almost Complete Binary Tree :-A binary tree of depth d is an almost whole binary tree if: 1.Any node and at level less than d-1 has two children. 2. for any node and in the tree wi

Example of pre order traversal, Example of pre order traversal: Reading of... Example of pre order traversal: Reading of a book, since we do not read next chapter unless we complete all sections of previous chapter & all its sections. Figure  : Rea

Properties of a red-black tree, Any binary search tree must contain followi... Any binary search tree must contain following properties to be called as a red-black tree. 1. Each node of a tree should be either red or black. 2. The root node is always bl

Expression trees, What are the expression trees? Represent the below writte... What are the expression trees? Represent the below written expression using a tree. Give a relevant comment on the result that you get when this tree is traversed in Preorder,

Single pointer pointing to the tail of the queue, Can a Queue be shown by c... Can a Queue be shown by circular linked list with only single pointer pointing to the tail of the queue? Yes a Queue can be shown by a circular linked list with only single p

Data structure, Ask question #Minimum 1Mark each of the following statement... Ask question #Minimum 1Mark each of the following statements as valid or invalid. If a statement is invalid, explain why. a. current ¼ list; b. temp->link->link ¼ NULL; c. trail->l