daa@unit-1[introduction] daa 1 unit details · 3 a write an algorithm to find the sum of individual...
TRANSCRIPT
DAA@Unit-1[INTRODUCTION]
Page 1 of 36bphanikrishna.wordpress.com
DAA 1ST UNIT DETAILS
UNIT I :Introduction: Algorithm, Pseudo code for expressing algorithms, Performance Analysis-Space complexity,Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and Little ohnotation ,Probabilistic analysis, Amortized analysis
set III B.Tech. II Semester Regular Examinations, April/May -2013
1 a Define an algorithm. What are the different criteria that satisfy the algorithm?
b Explain how algorithms performance is analysed? Describe Asymptotic notation?
2 a What are the different techniques to represent an algorithm. Explain.
b Give an algorithm to solve the towers of Hanoi problem.
3 a Write an algorithm to find the sum of individual digits of a given number.
b Explain the different looping statements used in pseudo code conventions.
4 a What is meant by recursion. Explain with example, the direct and indirect recursivealgorithms.
b List the advantages of pseudo code convention over flow charts.
set III B.Tech. II Semester Supplementary Examinations, January -2014
1 a Define the terms “Time complexity” and “Space complexity” of algorithms.Give a notation for expressing such a complexity and explain the features of such anotation.
b Explain in detail about Recursive algorithms with neat examples.
2 a Write an algorithm to find the sum of first n integers and Derive its timecomplexity.
b Explain in detail about Amortized and Probabilistic analysis.
3 a Define Omega notation. Explain the terms involved in it. Give an Example.
b Explain the usefulness of the following functional operations on sets.(i) MIN (ii) DELETE (iii) FIND (iv) UNION (v) INSERT
4 a Define Recursive algorithm. Explain in detail about Towers of Hanoi Algorithm withexample.
b Show that 9n3 + 12n4 + 100n22n = O(100n22n)
set III B.Tech. II Semester Regular/Supplementary Examinations, May/June -2014
1 a Explain in brief about Asymptotic Notations with examples
2 a Explain about Amortized analysis
bProve 3n3+ 2n2= O(n)3 ; 3n !=O(2n )
3 a Define time and space complexity. Describe different notations used to represent thesecomplexities.
b Describe about Order of Growth with time function.
4 a How the performance can be analyzed ? Explain with the example.
b What is Randomizer? Give Cons and Pros
DAA@Unit-1[INTRODUCTION]
Page 2 of 36bphanikrishna.wordpress.com
set1
2
3
4
DAA@Unit-1[INTRODUCTION]
Page 3 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 4 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 5 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 6 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 7 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 8 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 9 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 10 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 11 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 12 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 13 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 14 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 15 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 16 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 17 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 18 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 19 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 20 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 21 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 22 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 23 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 24 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 25 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 26 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 27 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 28 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 29 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 30 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 31 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 32 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 33 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 34 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 35 of 36bphanikrishna.wordpress.com
DAA@Unit-1[INTRODUCTION]
Page 36 of 36bphanikrishna.wordpress.com