# 01_DS and Algorithm_session_01

Views:

Category: Entertainment

## Presentation Description

No description available.

## Presentation Transcript

### Slide 1:

Rationale Computer science is a field of study that deals with solving a variety of problems by using computers. To solve a given problem by using computers, you need to design an algorithm for it. Multiple algorithms can be designed to solve a particular problem. An algorithm that provides the maximum efficiency should be used for solving the problem. The efficiency of an algorithm can be improved by using an appropriate data structure. Data structures help in creating programs that are simple, reusable, and easy to maintain. This module will enable a learner to select and implement an appropriate data structure and algorithm to solve a given programming problem.

### Slide 2:

Objectives In this session, you will learn to: Explain the role of data structures and algorithms in problem solving through computers Identify techniques to design algorithms and measure their efficiency

### Slide 3:

Problem solving is an essential part of every scientific discipline. Computers are widely being used to solve problems pertaining to various domains, such as, banking, commerce, medicine, manufacturing, and transport. To solve a given problem by using a computer, you need to write a program for it. A program consists of two components, algorithm and data structure. Role of Algorithms and Data Structures in Problem Solving

### Slide 4:

Role of Algorithms The word algorithm is derived from the name of the Persian mathematician Al Khwarizmi. An algorithm can be defined as a step-by-step procedure for solving a problem. An algorithm helps the user arrive at the correct result in a finite number of steps.

### Slide 5:

Role of Algorithms (Contd.) An algorithm has five important properties: Finiteness Definiteness Input Output Effectiveness

### Slide 6:

Role of Algorithms (Contd.) A problem can be solved using a computer only if an algorithm can be written for it. In addition, algorithms provide the following benefits: Help in writing the corresponding program Help in dividing difficult problems into a series of small solvable problems Make decision making a more rational process Help make the process consistent and reliable

### Slide 7:

Role of Data Structures Different algorithms can be used to solve the same problem. Some algorithms may solve the problem more efficiently than the others. An algorithm that provides the maximum efficiency should be used to solve a problem. One of the basic techniques for improving the efficiency of algorithms is to use an appropriate data structure. Data structure is defined as a way of organizing the various data elements in memory with respect to each other.

### Slide 8:

Data can be organized in many different ways. Therefore, you can create as many data structures as you want. Some data structures that have proved useful over the years are: Arrays Linked Lists Stacks Queues Trees Graphs Role of Data Structures (Contd.)

### Slide 9:

Role of Data Structures (Contd.) Use of an appropriate data structure, helps improve the efficiency of a program. The use of appropriate data structures also allows you to overcome some other programming challenges, such as: Simplifying complex problems Creating standard, reusable code components Creating programs that are easy to understand and maintain

### Slide 10:

Data structures can be classified under the following two categories: Static : Example – Array Dynamic : Example – Linked List Types of Data Structures

### Slide 11:

An array is a ___________ data structure, and a linked list is a ____________ data structure. Just a minute Answer: static, dynamic

### Slide 12:

Two commonly used techniques for designing algorithms are: Divide and conquer approach Greedy approach Identifying Techniques for Designing Algorithms

### Slide 13:

Divide and conquer is a powerful approach for solving conceptually difficult problems. Divide and conquer approach requires you to find a way of: Breaking the problem into sub problems Solving the trivial cases Combining the solutions to the sub problems to solve the original problem Identifying Techniques for Designing Algorithms (Contd.)

### Slide 14:

Algorithms based on greedy approach are used for solving optimization problems, where you need to maximize profits or minimize costs under a given set of conditions. Some examples of optimization problems are: Finding the shortest distance from an originating city to a set of destination cities, given the distances between the pairs of cities. Finding the minimum number of currency notes required for an amount, where an arbitrary number of notes for each denomination are available. Selecting items with maximum value from a given set of items, where the total weight of the selected items cannot exceed a given value. Identifying Techniques for Designing Algorithms (Contd.)

### Slide 15:

The ___________ technique involves selecting the best available option at each step. Just a minute Answer: Greedy

### Slide 16:

Recursion: Refers to the technique of defining a process in terms of itself Is used to solve complex programming problems that are repetitive in nature Is implemented in a program by using a recursive procedure or function. A recursive procedure or function is a function that invokes itself Is useful in writing clear, short, and simple programs Designing Algorithms Using Recursion

### Slide 17:

Identify the problem in the following algorithm that attempts to find the sum of the first n natural numbers: Algorithm: Sum (n) 1. s = n + Sum(n – 1) 2. Return (s) Just a minute Answer: There is no terminating condition in the given recursive algorithm. Therefore, it will call itself infinitely. The correct algorithm would be: 1. If (n = 1) Return(1) 2. s = n + Sum(n – 1) 3. Return(s)

### Slide 18:

Factors that affect the efficiency of a program include: Speed of the machine Compiler Operating system Programming language Size of the input In addition to these factors, the way data of a program is organized, and the algorithm used to solve the problem also has a significant impact on the efficiency of a program. Determining the Efficiency of an Algorithm

### Slide 19:

The efficiency of an algorithm can be computed by determining the amount of resources it consumes. The primary resources that an algorithm consumes are: Time : The CPU time required to execute the algorithm. Space : The amount of memory used by the algorithm for its execution. The lesser resources an algorithm consumes, the more efficient it is. Determining the Efficiency of an Algorithm (Contd.)

### Slide 20:

Time/Space Tradeoff: It refers to a situation where you can reduce the use of memory at the cost of slower program execution, or reduce the running time at the cost of increased memory usage. Example is data storage in compressed/uncompressed form. Memory is extensible, but time is not. Therefore, time considerations generally override memory considerations. Time/Space Tradeoff

### Slide 21:

To measure the time efficiency of an algorithm, you can write a program based on the algorithm, execute it, and measure the time it takes to run. The execution time that you measure in this case would depend on a number of factors such as: Speed of the machine Compiler Operating system Programming language Input data However, we would like to determine how the execution time is affected by the nature of the algorithm. Method for Determining Efficiency

### Slide 22:

The execution time of an algorithm is directly proportional to the number of key comparisons involved in the algorithm and is a function of n, where n is the size of the input data. The rate at which the running time of an algorithm increases as a result of an increase in the volume of input data is called the order of growth of the algorithm. The order of growth of an algorithm is defined by using the big O notation. The big O notation has been accepted as a fundamental technique for describing the efficiency of an algorithm. Method for Determining Efficiency (Contd.)

### Slide 23:

The different orders of growth and their corresponding big O notations are: Constant - O(1) Logarithmic - O(log n) Linear - O(n) Loglinear - O(n log n) Quadratic - O(n 2 ) Cubic - O(n 3 ) Exponential - O(2 n ), O(10 n ) Method for Determining Efficiency (Contd.)

### Slide 24:

According to their orders of growth, the big O notations can be arranged in an increasing order as: O(1) < O(log n) < O(n) < O(n log n) < O(n 2 ) < O(n 3 ) < O(2 n ) < O(10 n ) Graphs depicting orders of growth for various big O notations: Selecting an Efficient Algorithm

### Slide 25:

Problem Statement: You need to write an algorithm to search for a given word in a dictionary. Discuss how different algorithms and different ways of organizing the dictionary data affect the efficiency of the process. Group Discussion: Dependence of Efficiency on Selected Algorithm

### Slide 26:

In this session, you learned that: An algorithm can be defined as a step-by-step procedure for solving a problem that produces the correct result in a finite number of steps. An algorithm has five important properties: Finiteness Definiteness Input Output Effectiveness An algorithm that provides the maximum efficiency should be used for solving the problem. Summary

### Slide 27:

Data structures can be classified under the following two categories: Static Dynamic Two commonly used techniques for designing algorithms are: Divide and conquer approach Greedy approach Recursion refers to a technique of defining a process in terms of itself. It is used to solve complex programming problems that are repetitive in nature. The primary resources that an algorithm consumes are: Time : The CPU time required to execute the algorithm. Space : The amount of memory used by the algorithm for execution. Summary (Contd.)

### Slide 28:

Time/space tradeoff refers to a situation where you can reduce the use of memory at the cost of slower program execution, or reduce the running time at the cost of increased memory usage. The total running time of an algorithm is directly proportional to the number of comparisons involved in the algorithm. The order of growth of an algorithm is defined by using the big O notation. Summary (Contd.) 