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
Explain the term totalling To add up a series numbers the subsequent type of statement must be used: Total = total + number  This literally means (new) total = (old) t

Multidimensional array: Multidimensional arrays can be defined as "arrays of arrays". For example, a bidimensional array can be imagined as a bidimensional table made of elements,

Warnock's Algorithm An interesting approach to the hidden-surface problem was presented by Warnock. His method does not try to decide exactly what is happening in the scene but

Q. Develop a representation for a list where insertions and deletions can be done at either end. Such a structure is known as a Deque (Double ended queue). Write functions for inse

Threaded Binary Tree : If a node in a binary tree is not having left or right child or it is a leaf node then that absence of child node is shown by the null pointers. The spac

Q. Describe the basic concept of binary search technique? Is it more efficient than the sequential search?         Ans : The bin ary search technique:- This tec

Explain in detail about the Ruby arrays Ruby arrays have many interesting and powerful methods. Besides indexing operations which go well beyond those discussed above, arrays h

How memory is freed using Boundary tag method in the context of Dynamic memory management? Boundary Tag Method to free Memory To delete an arbitrary block from the free li

adjacency multilist

Define Binary Tree  A binary tree T is explained as a finite set of nodes that is either empty or having of root and two disjoint binary trees TL, and TR known as, respectively