Objectives of algorithms, Data Structure & Algorithms

After learning this, you will be able to:

  • understand the concept of algorithm;
  • understand mathematical foundation underlying the analysis of algorithm;
  • to understand several asymptotic notations, like theta notation, Big O notation and omega (big O, Θ, ? ) for analysis of algorithms;
  • understand several notations for describing the complexity of algorithm;
  • describe the complexity of several well known algorithms, and
  • Learn the technique to calculate time complexity of algorithm.
Posted Date: 4/4/2013 5:36:39 AM | Location : United States







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

Write discussion on Objectives of algorithms
Your posts are moderated
Related Questions
A queue is a, FIFO (First In First Out) list.

Determine the Disjoint of division method A polygon is disjoint from the viewport if the x- and y-extents of the polygon do not overlap the viewport anywhere. In this case; reg

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.

Determination of Time Complexity The RAM Model The random access model (RAM) of computation was devised through John von Neumann to study algorithms. In computer science,

Complexity is the rate at which the needed storage or consumed time rise as a function of the problem size. The absolute growth based on the machine utilized to execute the program

There are three typical ways of recursively traversing a binary tree. In each of these, the left sub-trees & right sub-trees are visited recursively and the distinguishing feature

Algorithm for insertion of any element into the circular queue: Step-1: If "rear" of the queue is pointing at the last position then go to step-2 or else Step-3 Step-2: make

How sparse matrix stored in the memory of a computer?

explain quick sort algorithm

For the Oscillating sort to be applied, it is necessary for the tapes to be readable in both directions and able to be quickly reversed. The oscillating sort is superior to the po