Design & Analysis of Algorithms

Introduction:

An algorithm is a set of rules for carrying out calculation either by hand or on a machine. It is a finite step-by-step procedure to achieve a required with a sequence of computational steps that transform the input into the output.

Sequences of operations performed on data that have to be organized in data structures with reference to the abstraction of a program to be executed on a physical machine is called an algorithm.

Objective:

Students has to understand and perform the proper designs of any algorithm and understand the designs that inhibit the algorithms in order to run the programs that are required in the laboratory.

This lab deals with the two important ways to characterize the effectiveness of an algorithm are its space complexity and time complexity.

Equipments:

  • Hardware:
  • CPU: Pentium Dual Core E5400 @2.70GHz
  • RAM: DDR3 2 GB
  • OS: Windows 7 Ultimate (32 Bit)
  • HDD: 320 GB
  • Software:
    • C++ Builder IDE (Integrated Development Environment) vXE7 (21)

Industrial Prospect:

An algorithm is an effective method that can be expressed within a finite amount of space and time and in a well-defined formal language for calculating a function.

This laboratory deals with the students’ ability to properly understand the deign and aspects of an algorithm and accurately rule out the analysis behind the algorithm itself as Algorithm design is identified and incorporated into many solution theories of operation research, such as dynamic programming and divide-and-conquer.