Lecture 11234567890qwertyuiodfghjdfgh.pptx

lecture 1

1. Introduction Lecture 01 Aqsa Noreen

2. Terminologies Algorithm Design: Method for designing efficient algorithm. Algorithm Analysis: Analysis of resources usage of given algorithm .(time & space)

3. What do we study this subject? Efficient algorithm lead to efficient programs. Efficient program sell better. Efficient programs makes better used of hardware. Programmer who write efficient programs are preferred.

4. Course Objectives The main goal of the course is to develop tools and techniques that aid in designing correct and efficient algorithms for computational problems and analyzing their correctness and running time

5. introduction Definition: An algorithm is a finite sequence of well-defined instructions, typically used to solve a problem or perform a computation. Algorithms are essential in programming and are used to manipulate data structures and manage tasks in software.

6. Designing of an algorithm

7. Properties of an Algorithm It should take zero or more input . It should produce at least one output. It should terminate after a finite time. An algorithm should be efficient and flexible. It should be less memory space as much as possible. Each step in the algorithm must be easily understood

8. How to analyzed the algorithm? Algorithm efficiency can be measured by two aspects 1: Time complexity: ( given in term of frequency count) Instruction take time. How fast does the algorithm perform? What effect its runtime?

9. How to analyzed the algorithm? 2: space complexity: ( amount of memory required) Data structure take space. What kind of data structure can be used? How does choice of data structure effect the runtime?

10. . Thank You