lecture 01 - Amrita

lecture 01 - Amrita - ANALYSIS AND DESIGN OF ALGORITHMS...

Info iconThis preview shows pages 1–15. Sign up to view the full content.

View Full Document Right Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: ANALYSIS AND DESIGN OF ALGORITHMS (Credit Pattern 3:1) Prepared By : Prof.P.Nagabhushan Assisted By : Mr. R. Pradeep Kumar Suggested References 1. How to solve it by Computer RG Dromey Publisher : PHI/EEE 2. Analysis of Algorithms - An Active Learning Approach Jeffrey J. Mc Connell Publisher : Narosa 3. Design and Analysis of Algorithms Anany Levitin Publisher : Pearson Education 4. Computer Algorithms E.Horowitz, S.Sahni, S.Rajashekaran Publisher : Galgotia 5. Introduction to Algorithms TH Cormen, CE Leiserson, R A Riveset Publisher : PHI/EEE Proposed Course Coverage 1. One Assignment per week which includes (30 %) Theoretical Development Practical Implementation A Minimum of 10 such assignments 1. One term-work to commence from 7 th week (20 %) An intensive work with detailed theoretical analysis , practical profiling and comparative analysis Submission of 10-12 page report by 15 th week Seminar presentation in 15 th 16 th week 1. Two tests in 7 th and 14 th week (20 %) 2. Semester End Examination 17 th week (30 %) Let us Commence. Good Luck !! Analysis and Design of Algorithms A foundation course on study of Algorithms In fact most part of Computer Science & Engineering is made up of algorithms For instance a course on System Software- Compilers and Operating Systems Advanced courses like Pattern Recognition and Image Processing, Computer Vision , Data Mining Study of Algorithms Consisting of Analysis , Design and Profiling ALGORITHMICS Prerequisites: Data Structures Programming in C ALGORITHMICS ANALYSIS SYSTEM Known INPUT Known OUTPUT Unknown? What are the outputs? How does the system perform - What is the quality in the output ? Complexity of the system to produce the output How much time does the system take to produce the output? What are the physical requirements of the system to produce the output? DESIGN SYSTEM Unknown ? INPUT Known Expected OUTPUT known What should be the system that produces the desired output from the given input? Realizing the System DESIGN SYNTHESIS problem ALGORITHM is a method to solve the problem What does this mean ? Input : Problem Output : Solution System : Problem Solver : Algorithm Algorithm PROBLEM Solution More Technically Algorithm is a precise method to be implemented on a machine to solve the problem PROBLEM SOLUTION ? Algorithm Transformation Algorithm : is a Transfer Function / Mapping Function Problem : Input Specifications . . . [ I ] Solution : Output (Results) . . . [O] I1 I2 : : O1 O2 : : [I] [O] Transfer Function or Mapping Function [O] [I] [O] = F([I]) F is the Transfer Function or Mapping Function The notion of F is abstract in this representation When F is formalized and expressed as a Sequence of Unambiguous finite steps It becomes an Algorithm Example : Solve x 2 7x + 12 = 0 Input : a = 1, b=-7, c = 12 Output : roots = x1, x2 x1 = f1(a,b,c) x2 = f2(a,b,c) F = (f1 , f2) : Algorithm f1, f2 may depend upon the nature of (a, b, c) i.e. F = (fn,f1,f2) where fn = nature(a,b,c) = discriminant function d = b 2 4ac Three different formulations for f1 and f2 exist depending upon...
View Full Document

Page1 / 123

lecture 01 - Amrita - ANALYSIS AND DESIGN OF ALGORITHMS...

This preview shows document pages 1 - 15. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online