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
A binary tree in which if all its levels except possibly the last, have the maximum number of nodes and all the nodes at the last level appear as far left as possible, is called as

Q. Write down the algorithm which does depth first search through an un-weighted connected graph. In an un-weighted graph, would breadth first search or depth first search or neith

Enumerate about the Data structure An arrangement of data in memory locations to signify values of the carrier set of an abstract data type. Realizing computational mechanis

Normal 0 false false false EN-IN X-NONE X-NONE MicrosoftInternetExplorer4

One of the best known methods for external sorting on tapes is the polyphase sort. Principle: The basic strategy of this sort is to distribute ordered initial runs of predetermi

Technique for direct search is    Hashing is the used for direct search.

Djikstra's algorithm (named after it is discovered by Dutch computer scientist E.W. Dijkstra) resolves the problem of finding the shortest path through a point in a graph (the sour

Data array A has data series from 1,000,000 to 1 with step size 1, which is in perfect decreasing order. Data array B has data series from 1 to 1,000,000, which is in random order.

D elete a specific Node from Double Linked List as follows DELETEDBL(INFO, FORW, BACK, START, AVAIL,LOC) 1. [Delete Node] Set FORW [ BACK [LOC]]:= FORW[LOC]& BACK [FORW[

A graph is a mathematical structure giving of a set of vertexes (v1, v2, v3) and a group of edges (e1, e2, e3). An edge is a set of vertexes. The two vertexes are named the edge en