12
MCS-31 – Block – 1 Introduction To Algorithmics Unit-1 Elementary Algorithmics By Kirit A. D. (MBA, PMP, ITIL, MCTS, Six Sigma Black Belt) 03/20/2022 1

MCS-031 Block 1 Unit 1 Elementary Algorithmics

Embed Size (px)

Citation preview

Page 1: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 1

MCS-31 – Block – 1 Introduction To Algorithmics

Unit-1 Elementary Algorithmics

ByKirit A. D.

(MBA, PMP, ITIL, MCTS, Six Sigma Black Belt)

Page 2: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 2

Content

• Example of an algorithm• Problems and Instances• Characteristics of an algorithm• Problems, Available tools & Algorithms• Building Blocks of Algorithms• Outline of Algorithmics

Elem

enta

ry A

lgor

ithm

ics

Page 3: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 3

Example of An Algorithm

• Variable = Expression• Find GCD• Euclid’s Algorithm for Finding GCD of Two

Natural Numbers m & n

Elem

enta

ry A

lgor

ithm

ics

Page 4: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 4

Problems And InstancesEl

emen

tary

Alg

orith

mic

s

Where a, b, c may be any real numbers except the restriction that a ≠ 0

Now, if we take a = 3, b = 4 and c = 1

X = -1/3 or -1

Page 5: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 5

Characteristics Of An Algorithm

• Finiteness• Definiteness• Inputs• Output• Effectiveness

Elem

enta

ry A

lgor

ithm

ics

Page 6: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 6

Problems, Available Tools & Algorithms

• Multiplication 150 x 12• Standard• Counting 150 twelve times• ‘la russe method’

Elem

enta

ry A

lgor

ithm

ics

Page 7: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 7

Building Blocks of Algorithms

• Variable expression• Direct sequencing ie. Writing of the

instructions, one after the other on successive lines, or even on the some line if there is enough space on a line and separated by some statement separator, by semi-colons and in the order of intended execution

• Procedure and RecursionElem

enta

ry A

lgor

ithm

ics

Page 8: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 8

Outline of Algorithmics

• The problem, which has at least one algorithmic solution, is called algorithmic or computable problem.• Divide and conquer• Dynamic programming• The greedy approach• Backtracking• Branch and bound• Searches and traversalsEl

emen

tary

Alg

orith

mic

s

Page 9: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 9

Outline of Algorithmics

• Some of the problem types, enumerated below• Sorting problems• Searching problems• Linear programming problems• Number-theory problems• String processing problems• Graph problems• Geometric problems• Numerical problems

Elem

enta

ry A

lgor

ithm

ics

Page 10: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 10

Outline of Algorithmics

• Understanding the Problem• Analyzing the problem• Capabilities of the computer system• Approximate v/s exact solution• Choice of appropriate data structures• Choice of appropriate design technology• Specification methods for algorithms• Proving correctness of an algorithm• Analyzing and algorithm• Coding he algorithm

Elem

enta

ry A

lgor

ithm

ics

Page 11: MCS-031 Block 1 Unit 1 Elementary Algorithmics
Page 12: MCS-031 Block 1 Unit 1 Elementary Algorithmics

04/17/2023 12

THANK YOU