Web viewWrite control abstraction for divide and conquer strategy. Give the recurrence relation for...

1
DAA University question for unit 1 (2012 Pattern) 1. Explain in brief Amortized analysis. Find Amortized cost with respect to stack operations. 2. Solve the recurrence relation T(n)=2T(n/2)+n 2 ? 3. Solve the recurrence relation T(n)=8T(n/2)+n 2 ? 4. Define Big O,Omega and Theta Notation. 5. What are different problem solving strategies. 6. Consider the recurrence: T(n)=O(n) T(1)=Θ(1) Show that above recurrence is asymptotically bound by Θ(n) 7. State whether the following functions are CORRECT or INCORRECT and justify your answer. i) 3n+2=O(n) ii) 100n+6=O(n) iii) 10n 2 +4n+2=O(n 2 ) 8. 9. 10. Explain how divide and conquer method 11. Write control abstraction for divide and conquer strategy. Give the recurrence relation for the same and solve this recurrence relation. 12. Explain different strategies to find running time complexities of algorithm. 13. What are different time complexities. 14. What is meant by Best case, Average case and Worst case.

Transcript of Web viewWrite control abstraction for divide and conquer strategy. Give the recurrence relation for...

Page 1: Web viewWrite control abstraction for divide and conquer strategy. Give the recurrence relation for the same and solve this recurrence relation

DAA University question for unit 1 (2012 Pattern)

1. Explain in brief Amortized analysis. Find Amortized cost with respect to stack operations.2. Solve the recurrence relation T(n)=2T(n/2)+n2 ?3. Solve the recurrence relation T(n)=8T(n/2)+n2 ?4. Define Big O,Omega and Theta Notation.5. What are different problem solving strategies. 6. Consider the recurrence:

T(n)=O(n)T(1)=Θ(1)Show that above recurrence is asymptotically bound by Θ(n)

7. State whether the following functions are CORRECT or INCORRECT and justify your answer.i) 3n+2=O(n)ii) 100n+6=O(n)iii) 10n2 +4n+2=O(n2)

8.

9.

10. Explain how divide and conquer method 11. Write control abstraction for divide and conquer strategy. Give the recurrence relation for

the same and solve this recurrence relation.12. Explain different strategies to find running time complexities of algorithm.13. What are different time complexities.14. What is meant by Best case, Average case and Worst case.

A Master Theorem for Discrete Divide and Conquer Recurrences · 4 · M. Drmota and W. Szpankowski recurrence are crucial. We also prove in Theorem 7 of Section 6 that the phrase length

A Master Theorem for Discrete Divide and Conquer Recurrences · 4 · M. Drmota and W. Szpankowski recurrence are crucial. We also prove in Theorem 7 of Section 6 that the phrase length

The Power of Tarski’s Relation Algebra on Trees1/35 The Power of Tarski’s Relation Algebra on Trees Jelle Hellings1 Yuqing Wu2 Marc Gyssens1 Dirk Van Gucht3 1 Hasselt University

The Power of Tarski’s Relation Algebra on Trees1/35 The Power of Tarski’s Relation Algebra on Trees Jelle Hellings1 Yuqing Wu2 Marc Gyssens1 Dirk Van Gucht3 1 Hasselt University

Parton Distributions and the Relation to LHC and Higgs Physics · 2012. 2. 17. · Parton Distributions and the Relation to LHC and Higgs Physics Robert Thorne February 15th, 2012

Parton Distributions and the Relation to LHC and Higgs Physics · 2012. 2. 17. · Parton Distributions and the Relation to LHC and Higgs Physics Robert Thorne February 15th, 2012

The dynamic relation between State, Entreprises, and Citizens to achieve energy national goals

The dynamic relation between State, Entreprises, and Citizens to achieve energy national goals

Data Structures – LECTURE 3 Recurrence equations

Data Structures – LECTURE 3 Recurrence equations

Divide and conquer algorithms and software for large ...saad/PDF/Rice.pdf · for large Hermitian eigenvalue problems Yousef Saad ... ä Used in commercial package NASTRAN ... ä Restart

Divide and conquer algorithms and software for large ...saad/PDF/Rice.pdf · for large Hermitian eigenvalue problems Yousef Saad ... ä Used in commercial package NASTRAN ... ä Restart

RECURRENCE RELATIONS AND THE ALGEBRAIC IRRATIONALITY … · two solutions of an appropriate three-term recurrence relation. In the case of ζ(3) the equivalent criterion (Theorem

RECURRENCE RELATIONS AND THE ALGEBRAIC IRRATIONALITY … · two solutions of an appropriate three-term recurrence relation. In the case of ζ(3) the equivalent criterion (Theorem

Relation Between Frequency Response and Impulse Response

Relation Between Frequency Response and Impulse Response

Investigation of the Relation Between ( τ and Operatic ... · PDF fileInvestigation of the Relation Between (τ e) min and Operatic Sing-ing with Different Vibrato Styles ... concert

Investigation of the Relation Between ( τ and Operatic ... · PDF fileInvestigation of the Relation Between (τ e) min and Operatic Sing-ing with Different Vibrato Styles ... concert

Report on Greek Activities in relation to Systematic ...

Report on Greek Activities in relation to Systematic ...

The Power of Tarski’s Relation Algebra on Treesjhellings.nl/files/foiks2018_1_slides.pdf1/35 The Power of Tarski’s Relation Algebra on Trees Jelle Hellings1 Yuqing Wu2 Marc Gyssens1

The Power of Tarski’s Relation Algebra on Treesjhellings.nl/files/foiks2018_1_slides.pdf1/35 The Power of Tarski’s Relation Algebra on Trees Jelle Hellings1 Yuqing Wu2 Marc Gyssens1

Λόγος as relation: considerations between Heidegger and ... · relation, I will introduce the Categories, the first text of the Aristotelian Organon. This is the first place

Λόγος as relation: considerations between Heidegger and ... · relation, I will introduce the Categories, the first text of the Aristotelian Organon. This is the first place

Databases - Relational Algebra II...In relational algebra, the quotient relation Q = A=B of two relations A and B is the maximal relation such that Q B A: (GF Royle, N Spadaccini 2006-2010)

Databases - Relational Algebra II...In relational algebra, the quotient relation Q = A=B of two relations A and B is the maximal relation such that Q B A: (GF Royle, N Spadaccini 2006-2010)

AN OVERVIEW OF INFINITE ERGODIC THEORYaaro/book/overview.pdf · measures. The topics to be discussed include invariant measures, recurrence, ergodic theorems, pointwise dual ergodicity,

AN OVERVIEW OF INFINITE ERGODIC THEORYaaro/book/overview.pdf · measures. The topics to be discussed include invariant measures, recurrence, ergodic theorems, pointwise dual ergodicity,

The Einstein relation for random walks on Galton …The Einstein relation for random walks on Galton–Watson trees Ofer Zeitouni Weizmann Institute and University of Minnesota Joint

The Einstein relation for random walks on Galton …The Einstein relation for random walks on Galton–Watson trees Ofer Zeitouni Weizmann Institute and University of Minnesota Joint

Divide and conquer algorithms and software for large ...saad/PDF/Rice.pdf · Divide and conquer algorithms and software for large Hermitian eigenvalue problems Yousef Saad Department

Divide and conquer algorithms and software for large ...saad/PDF/Rice.pdf · Divide and conquer algorithms and software for large Hermitian eigenvalue problems Yousef Saad Department

QUANTITATIVE RECURRENCE PROPERTIES IN CONFORMAL ITERATED FUNCTION … · 2018. 11. 9. · QUANTITATIVE RECURRENCE IN CONFORMAL IFS 3 We are particularly interested in the properties

QUANTITATIVE RECURRENCE PROPERTIES IN CONFORMAL ITERATED FUNCTION … · 2018. 11. 9. · QUANTITATIVE RECURRENCE IN CONFORMAL IFS 3 We are particularly interested in the properties

Chapter 5 Stress–Strain Relation

Chapter 5 Stress–Strain Relation

Trans PS Ch3 - documents.epfl.ch · Teneur en eau volumique ... Relation θ-w d w w ρ θ= ρ ρ d: masse volumique du sol sec ρ w: masse volumique de l’eau. Relation teneur en

Trans PS Ch3 - documents.epfl.ch · Teneur en eau volumique ... Relation θ-w d w w ρ θ= ρ ρ d: masse volumique du sol sec ρ w: masse volumique de l’eau. Relation teneur en

Moment Curvature Relation (6-10)

Moment Curvature Relation (6-10)