UrbanPro
true

Take MCA Coaching from the Best Tutors

  • Affordable fees
  • 1-1 or Group class
  • Flexible Timings
  • Verified Tutors

Search in

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

Lets Talk About Software Design-patterns
What are Design Patterns? Design Pattern is a used and tested solution for a known problem. In simple words, you can say a general reusable solution to a commonly occurring problem within a given context...

Abhinaw Tripathi | 31/05/2021

1 0
0

DBMS - SQL - Any/All
All - Operator SELECT empno, sal FROM emp WHERE sal > ALL (1999, 2999, 3999); Output of Above query is same as below query SELECT empno, sal FROM emp WHERE sal > 1999 AND sal > 2999...

Radhe Shyam | 02/04/2021

0 0
0


Estimation of Water and Wastewater Flow
Before designing the proper waterworks project, it is essential to determine the quantity of water that is required daily. This involves the determination of the population and the rate of demand. The...

Sandip Nandi | 28/05/2020

0 0
0

Overloading in JAVA
When a class contains more than one method with the same method name but different argument types, then it is called Overloading. Methods are said to be Overloaded methods. Also, know as Compile time...

Swati S. | 19/05/2020

0 0
0
X

Looking for MCA Coaching Classes?

The best tutors for MCA Coaching Classes are on UrbanPro

  • Select the best Tutor
  • Book & Attend a Free Demo
  • Pay and start Learning

Take MCA Coaching with the Best Tutors

The best Tutors for MCA Coaching Classes are on UrbanPro

Book a Free Demo

UrbanPro.com is India's largest network of most trusted tutors and institutes. Over 55 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 7.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