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 Interfaces in Ruby Recall that in object-oriented programming, an interface is a collection of abstract operations that cannot be instantiated. Even though Ruby i

Full Binary Trees: A binary tree of height h that had 2h -1 elements is called a Full Binary Tree. Complete Binary Trees: A binary tree whereby if the height is d, and all of

Data records are stored in some particular sequence e.g., order of arrival value of key field etc. Records of sequential file cannot be randomly accessed i.e., to access the n th

1)    The set of the algorithms whose order is O (1) would run in the identical time.  True/False 2)    Determine the complexity of the following program into big O notation:

Consider the digraph G with three vertices P1,P2 and P3 and four directed edges, one each from P1 to P2, P1 to P3, P2 to P3 and P3 to P1. a. Sketch the digraph. b. Find the a

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

5. Implement a stack (write pseudo-code for STACK-EMPTY, PUSH, and POP) using a singly linked list L. The operations PUSH and POP should still take O(1) time.

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

The operations of the Symbol ADT The operations of the Symbol ADT are the following. a==b-returns true if and only if symbols a and bare identical. a symbol bin Unico

What is Algorithm A finite sequence of steps for accomplishing some computational task. An algorithm should Have steps which are simple and definite enough to be done