Analysis of algorithms, Data Structure & Algorithms

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







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
Related Questions
whate is meant by the term heuristic

Q. Write down an algorithm to add an element in the end of the circular linked list.        A n s . Algo rithm to Add the Element at the End of Circular Linked Lists

#question bubble sort..

Explain the array and linked list implementation of stack

Explain the representations of graph. The different ways of representing a graph is: Adjacency list representation : This representation of graph having of an array Adj of

Q. Explain Dijkstra's algorithm for finding the shortest path in the graph given to us.  Ans: The Dijkstra's algorithm: This is a problem which is concerned with finding

A B-tree of minimum degree t can maximum pointers in a node T pointers in a node.

The quick sort algorithm exploit design technique Divide and Conquer

There are three kinds of tree traversals, namely, Postorder , Preorder and Inorder. Preorder traversal: Each of nodes is visited before its children are visited; first the roo

What are the properties of an algorithsm?