Skip to main content

Data structure and algorithm

Algorithm

An algorithm is a step-by-step procedure, which defines a set of instructions to be executed in a certain order to get the desired output. An algorithm can be implemented in more than one programming language.

Characteristics of Algorithm

  1. Unambiguous(spasht in Hindi)-Each of its steps (or phases), and their inputs/outputs should be clear and must lead to only one meaning.
  2. Input- An algorithm should have 0 or more well-defined inputs.
  3. Output- An algorithm should have 1 or more well-defined outputs and should match the desired output.
  4. Finiteness − Algorithms must terminate after a finite number of steps.
  5. Feasibility − Should be feasible with the available resources.
  6. Independent − An algorithm should have step-by-step directions, which should be independent of any programming code.
Algorithm Analysis:-

  • A Priori Analysis- This is a theoretical analysis of an algorithm.
  • A Posterior Analysis- This is an empirical analysis of an algorithm. The selected algorithm is implemented using a programming language.
---------------------------------------------------------------------------------------
Labels:

Comments

Post a Comment

Popular posts from this blog

DeadLock

What is DeadLock? if two thread executing on two different objects.  Let's assume thread t1,t2 and objects ob1 ,ob2   t1 got the lock of object ob1.   t2 got the lock of object ob2. let's assume the situation when t1 wann a execute method which is present in ob2(t2 has a lock on ob2) and  t2 wanna execute method which is present in ob1(t1 has a lock on ob1).  Note-Both methods are synchronized.     Thread t1 asked t2 to release the lock of object ob2. So that t1 can execute the method present in ob2. But t2 disagree to release the lock of object ob2 and t2 asked t1 the same thing what t1 has asked for t2 to do.t1 also disagrees with t2. Both threads not to release lock is simple stubbornness(zidd in Hindi). This is the only reason for infinite waiting which is called deadlock. Points about DeadLock: If two thread is waiting for each other forever. Such type of infinite waiting is called DeadLock. Synchronized Keyword is the only reason for the DeadLock...
Post a Comment
Read more

Deep Analysis of Algorithm(part 1)

 What is the need for speed in the algorithm? Suppose there is the software that provides lots of features including security but it takes almost 30 min to perform one task. And on the other hand, there is the software that provides you the same feature but it takes 2 min to perform one task. which one would you prefer? This is the reason why we should design an algorithm that is faster. Given two algorithms for a task, how do we find out which one is better? One naive way of doing this is – implement both the algorithms and run the two programs on your computer for different inputs and see which one takes less time. There are many problems with this approach for the analysis of algorithms. 1) It might be possible that for some inputs, the first algorithm performs better than the second. And for some inputs second performs better. 2) It might also be possible that for some inputs, the first algorithm performs better on one machine and the second works better on other machines for s...
Post a Comment
Read more

Multi-threading enhancement

java.util.concurrent.lock package{1.5 version} Problem with tradition synchronized  keyword: We are not having any flexibility to try for a lock without waiting. There is no way to specify the maximum waiting   time for a thread to get the lock whereas in tradition synchronized thread will wait until getting the lock which may cause performance problems or deadlock. In  tradition synchronized,  if a thread releases the lock then which waiting thread will get that lock we are not having control over this To overcome this problem sun organization introduces java.util.lock package in JDK 1.5v. It also provides several enhancement to the programmers.  Lock Interface: Lock object is similar to the implicit lock to execute synchronized methods or blocks. Lock interface provides more extensive operation than traditional lock(synchronized). Important methods of Lock interface: void lock() - we can use this method to acquire a lock.       Different Cases:...
Post a Comment
Read more