A common person's faith is that a computer can do anything. It is far from truth. In realism computer can carry out only definite predefined instructions. The formal illustration of this model like a sequence of instructions is called as an algorithm, & coded algorithm, within a particular computer language is called as program. Analysis of algorithms has been an area of research into the computer science; evolution of extremely high speed computers has not diluted the requirement for the design of time-efficient algorithms.

In computer science, Complexity theory is a part of theory of computation dealing along with the resources needed during computation to solve out a specified problem. The most common resources are time (how several steps (time) does it take to solve out a problem) and space (how much memory does it take to solve out a problem). It might be noted that complexity theory differs from computability theory that deals with whether a difficulty can be solved or not through algorithms, in spite of the resources needed.

Analysis of Algorithms is field of computer science whose target is to understand the complexity of algorithms. Whereas very large amount of research work is devoted to the worst-case evaluations, the focus within these pages is methods for average-case. One can grasp easily that the focus has shifted through computer to computer programming & after that to creation of an algorithm. It is algorithm design, spirit of problem solving.

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

Ask an Expert

Related Discussions:- Analysis of algorithms, Assignment Help, Ask Question on Analysis of algorithms, Get Answer, Expert's Help, Analysis of algorithms Discussions

Write discussion on Analysis of algorithms
Your posts are moderated

Write your message here..

Related Questions

Tree structure, We would like to implement a 2-4Tree containing distinct in... We would like to implement a 2-4Tree containing distinct integer keys. This 2-4Tree is defined by the ArrayList Nodes of all the 2-4Nodes in the tree and the special 2-4Node Root w

Algorithm to delete the specific node from binary searchtree, Q. Write down... Q. Write down an algorithm to delete the specific node from binary search tree. Trace the algorithm to delete a node (10) from the following given tree. Ans. Algor

Cache simulator, how to design a cache simulator with 4-way set associative... how to design a cache simulator with 4-way set associative cache

Prims algorithm, how to implement prims algorithm dynamically how to implement prims algorithm dynamically

Define heap, HEAP  A heap is described to be a binary tree with a key i... HEAP  A heap is described to be a binary tree with a key in every node, such that  1-All the leaves of the tree are on 2 adjacent levels. 2- All leaves on the lowest leve

State about the bit string, State about the Bit String Carrier set of... State about the Bit String Carrier set of the Bit String ADT is the set of all finite sequences of bits, including empty strings of bits, which we denote λ. This set is {λ, 0

Find the optimal solution - branch and bound algorithm, Consider the follow... Consider the following 5-city traveling salesman problem. The distance between each city (in miles) is shown in the following table: (a) Formulate an IP whose solution will

Graph & optimal scheduling, You are given an undirected graph G = (V, E) in... You are given an undirected graph G = (V, E) in which the edge weights are highly restricted. In particular, each edge has a positive integer weight of either {1,2,...,W}, where W

ALGORITHM AND TRACING, WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO P... WRITE AN ALGORITHM TO CONVERT PARENTHIZED INFIX TO POSTFIX FORM ALSO TRACE ALG ON ((A+B)*C-(D-E)$F+G)

Write an algorithm to input number of passengers travelling, There are ten ... There are ten stations on a railway line: Train travels in both directions (i.e. from 1 to 10 and then from 10 to 1).  Fare between each station is $2. A passenger input