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
Example which cause problems for some hidden-surface algorithms Some special cases, which cause problems for some hidden-surface algorithms, are penetrating faces and cyclic ov

A  BST is traversed in the following order recursively: Right, root, left e output sequence will be in In Descending order

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

An AVL tree is a binary search tree that has the given properties: The sub-tree of each of the node differs in height through at most one. Each sub tree will be an AVL tre

Linear search is not the most efficient way to search an item within a collection of items. Though, it is extremely simple to implement. Furthermore, if the array elements are arra

Comp are two functions n 2    and  2 n  / 4  for distinct values of n.   Determine When s ec on d function b ec om es l a r g er th an f i r st functi

I=PR/12 numbers of years : Interest Rate up to 1 years : 5.50 Up to 5 years : 6.50 More than 5 year : 6.75 please design an algorithm based on the above information

This notation bounds a function to in constant factors. We say f(n) = Θ(g(n)) if there presents positive constants n 0 , c 1 and c 2 such that to the right of n 0 the value of f

Consider the file " search_2013 ". This is a text file containingsearch key values; each entry is a particular ID (in the schema given above). You are tosimulate searching over a h

Q. Define a sparse matrix. Explain different types of sparse matrices? Show how a triangular array is stored in memory. Evaluate the method to calculate address of any element ajk