Find the best tutors and institutes for MCA Coaching

Find Best MCA Coaching classes

Please select a Category.

Please select a Locality.

No matching category found.

No matching Locality found.

Outside India?

Search for topics

Algorithms L1 (Introductory)

Santosh Kumar
14/09/2018 0 0

Why Algorithms?
Modelling the Problem: Modeling is the art of formulating our application regarding precisely described, well-understood problems. Proper modelling is the key to applying algorithmic design techniques to real-world problems. Adequate modelling can eliminate the need to design or even implement algorithms, by relating our application to what has been done before.

Five Representative Problems

- Interval Scheduling
- Weighted Interval Scheduling
- Bipartite Matching
- Independent Set
- Competitive Facility Location

What are Algorithms?
An algorithm is more than a branch of computer science. It is the core of computer science, and, in all fairness, can be said to be relevant to most of science, business, and technology. The very nature of algorithm renders it particularly applicable to those disciplines that benefit from the use of computers, and these are fast becoming an overwhelming majority.
Logic + Control= Algorithm &, Data Structures + Algorithms= Program
An algorithm is a finite sequence of step by step, discrete, clear instructions for solving a particular problem, has input data, and is expected to produce output data, and each instruction can be carried out in a finite amount of time in a deterministic way.
Features of Algorithm:
(A) Input { One or, More}
(B) Output {Zero or, More}
(C) Finiteness { Termination}
(D) Definiteness { Precise definite each step}
(E)Effectiveness
The modern meaning of algorithm is quite similar to that of Recipe, Process, Methods, techniques, Procedure and Routine. An algorithm is a sequence of unambiguous instructions for solving problem, i.e. for obtaining a required output for any legitimate input in a finite amount of time.
A computer program is an implementation of one or more algorithms.

Good Algorithm: - Correctness, Time and Space Efficiency.
Better algorithm:-Lower bonds, Optimality.
Running time T(n): - It is an initial time for efficient execution of an algorithm.
Best case | Lower Bound: - The target is the first element of the array, Make one comparison.
Worst case | Upper Bound:-The target is not in the array or, the aim is at the last position in the collection. Make n comparison in either case.
Average case | Tight Bound:- (Best case+ worst case)/2 = (n+1)/2

0 Dislike
Follow 3

Please Enter a comment

Submit

Other Lessons for You

BTech Student
INTEGRATED CIRCUITS Unit Topic Lectures Analog Integrated circuit Design: an overview: Current Mirrors using BJT and MOSFETs, Simple current Mirror, Base current compensated current Mirror, Wilson and...

Explain The Working Of JVM
1. when we execute the java file, JVM is loaded into memory.2. In JVM, first class loader starts which loads the class into memory, i.e. it divides the code intoRuntime Memory Area.3. Runtime memory consists...

Rahul Kasgar | 09/04/2018

1 0
0

Gerund, Infinitive, Participle
1. Consider the following examples: i. The frightened cat scratched my eye. ii. Running seems tiresome at first. iii. Sometimes I like to swing and sometimes I like to slide at the park.. In...

Dr R. | 24/02/2018

0 0
0

How To Write An Assignment?
Instructions for writing the Assignment: It should contain minimum of 7 pages to maximum of 10 pages. Write all the topics with clear headings, sub headings and points with serial numbers 1,2,3,4,5...

Prof Zahoorullah S Md | 16/01/2018

0 0
0

How To Prepare For Viva Voce Of Lab Experiments/Project Presentations?
Instruction to B.Tech/M.Tech/B.Pharm/M.Pharm/M.Sc/B.Sc/MBBS/BDS/MDS/LLB/LLM students on Lab/Project Viva voce: No tension, only attention. Prepare for viva as if the examiner is an expert in your project/lab...

Prof Zahoorullah S Md | 12/01/2018

0 0
0

Find Best MCA Coaching classes?

Find Now »

UrbanPro.com is India's largest network of most trusted tutors and institutes. Over 25 lakh students rely on UrbanPro.com, to fulfill their learning requirements across 1,000+ categories. Using UrbanPro.com, parents, and students can compare multiple Tutors and Institutes and choose the one that best suits their requirements. More than 6.5 lakh verified Tutors and Institutes are helping millions of students every day and growing their tutoring business on UrbanPro.com. Whether you are looking for a tutor to learn mathematics, a German language trainer to brush up your German language skills or an institute to upgrade your IT skills, we have got the best selection of Tutors and Training Institutes for you. Read more