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
Define Strictly Binary Tree Strictly Binary Tree: - If each non leaf node in binary tree has non empty left and right sub-trees , then the tree is known as a strictly binary t

Write a program for reversing the Linked list

Illumination of wire frame The colour or shade that a surface appears to the human eye depends primarily on three  factors : Colour and strength of incoming illumination

implement multiple stacks in a single dimensional array. write algorithm for various stack operation for them

Q. Explain the complexity of an algorithm?  What are the worst case analysis and best case analysis explain with an example.

I am looking for assignment help on the topic Data Structures. It would be great if anyone help me.

explain quick sort algorithm

Simulation is the process of making an abstract model of a real world situation in order to be aware of the effect of modifications and alterations and the effect of introducing nu

Ask question #explain it beriflyMinimum 100 words accepted#

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