Quiz June 03 2004 Section 3.4 6.1 6.2 (only beginning)

Slides:



Advertisements
Similar presentations
Fall 2002CMSC Discrete Structures1 Now it’s Time for… RecurrenceRelations.
Advertisements

Every edge is in a red ellipse (the bags). The bags are connected in a tree. The bags an original vertex is part of are connected.
22C:19 Discrete Structures Induction and Recursion Spring 2014 Sukumar Ghosh.
section 6.2 Solving Recurrence Relations
Appendix B Solving Recurrence Equations : With Applications to Analysis of Recursive Algorithms.
Copyright © Zeph Grunschlag, Solving Recurrence Relations Zeph Grunschlag.
Recurrence Relations Reading Material –Chapter 2 as a whole, but in particular Section 2.8 –Chapter 4 from Cormen’s Book.
Lecture 19 Exam: Tuesday June14 4-6pm Overview. Disclaimer The following is a only study guide. You need to know all the material treated in class.
Quiz April Sections 1.6,1.7,1.8. Quiz: Apr. 21 ’05: pm 1. Consider the following sets: Provide the following sets using set-builder.
Chapter 9 Recurrence Relations and Generating Functions.
Solve for the unknown:. Answer: Describe part 3 in the graph below. Include details about time, speed, direction and distance.
Lecture 19 Exam: Tuesday June15 4-6pm Overview. General Remarks Expect more questions than before that test your knowledge of the material. (rather then.
Lecture Recursive Definitions. Fractals fractals are examples of images where the same elements is being recursively.
TRIVIA Click for Question What kind of matrix contains the coefficients and constants of a system of linear equations? An augmented matrix Click for:
Recurrence Relations Reading Material –Chapter 2 as a whole, but in particular Section 2.8 –Chapter 4 from Cormen’s Book.
1 Section 9.2 Tree Applications. 2 Binary Search Trees Goal is implementation of an efficient searching algorithm Binary Search Tree: –binary tree in.
1 Linear Recurrence Relations Part I Jorge Cobb The University of Texas at Dallas.
Applied Discrete Mathematics Week 9: Relations
7.2 Solving Recurrence Relations. Definition 1 (p. 460)- LHRR-K Def: A linear homogeneous recurrence relations of degree k with constant coefficients.
Jessie Zhao Course page: 1.
Copyright © Cengage Learning. All rights reserved. CHAPTER 5 SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION.
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
Section 5.3. Section Summary Recursively Defined Functions Recursively Defined Sets and Structures Structural Induction.
Trees. Containers we have studied so far are linear. To represent nonlinear, i.e. hierarchal data we use trees. Nonlinear Containers root node leaf edge.
Chapter 8 With Question/Answer Animations 1. Chapter Summary Applications of Recurrence Relations Solving Linear Recurrence Relations Homogeneous Recurrence.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
Recurrence Relation. Outline  What is a recurrence relation ?  Solving linear recurrence relations  Divide-and-conquer algorithms and recurrence relations.
Proofs, Recursion and Analysis of Algorithms Mathematical Structures for Computer Science Chapter 2.5 Copyright © 2006 W.H. Freeman & Co.MSCS SlidesProofs,
15.1 CompSci 102© Michael Frank Today’s topics Recurrence relationsRecurrence relations –Stating recurrences –LiHoReCoCo Reading: Sections Reading:
Module #17: Recurrence Relations Rosen 5 th ed., §
Solving Second-Order Recursive Relations Lecture 36 ½ Section 8.3 Wed, Apr 19, 2006.
Module #1 - Logic 1 Based on Rosen, Discrete Mathematics & Its Applications. Prepared by (c) , Michael P. Frank and Modified By Mingwu Chen Recurrence.
Objective : Solving systems of linear equations by graphing System of linear equation two or more linear equations How do I solve linear systems of equations?
Advanced Counting Techniques CSC-2259 Discrete Structures Konstantin Busch - LSU1.
7.2 Solving Linear Recurrence Relations Some of these recurrence relations can be solved using iteration or some other ad hoc technique. However, one important.
Warm Up 9/2. Homework Questions Announcements Quiz Friday HW 2.4 pg. 206 #’s even, even.
CSE 2813 Discrete Structures Solving Recurrence Relations Section 6.2.
Agenda Lecture Content:  Recurrence Relations  Solving Recurrence Relations  Iteration  Linear homogenous recurrence relation of order k with constant.
Recurrence Relations. Outline Recurrence relationsSolving recurrence relationsRecurrence and Divide-and-conquer algorithmsGenerating functions
Section 6.7 Financial Models. OBJECTIVE 1 A credit union pays interest of 4% per annum compounded quarterly on a certain savings plan. If $2000 is.
Section 5.7 Financial Models. A credit union pays interest of 4% per annum compounded quarterly on a certain savings plan. If $2000 is deposited.
Section 3.4 – Zeros of a Polynomial. Find the zeros of 2, -3 (d.r), 1, -4.
Functions. Objectives: Find x and y intercepts Identify increasing, decreasing, constant intervals Determine end behaviors.
Money Quiz!!!!. Write the question number and the answer in your maths book. How much money is shown? 1.
Money Quiz!!!!. Write the question number and the answer in your maths book. How much money is shown? 1.
Homogeneous Linear Recurrences To solve such recurrences we must first know how to solve an easier type of recurrence relation: DEF: A linear recurrence.
Solving Linear Homogeneous Recurrence Relations ICS 6D Sandy Irani.
Recursive Definitions and Structural Induction ICS 6D Sandy Irani.
1 Lecture Outline for Recurrences Already Covered: Recursive definition of sequences Recursive definition of sets Recursive definition of operations Recursive.
Discrete Math For Computing II. Contact Information B. Prabhakaran Department of Computer Science University of Texas at Dallas Mail Station EC 31, PO.
1 10 Section 8.1 Recursive Thinking Page 409
CMSC Discrete Structures
Proofs, Recursion and Analysis of Algorithms
A0=0 a1=2 an a2=6 an-1 a3=12 a4=20 a2 a1 a0.
ALGEBRA II HONORS/GIFTED - SECTION 4-6 (Completing the Square)
Section 4.7 Solving Quadratic Equations by Completing the Square
The Linear Correlation Coefficient
Today (2/23/16) Learning objectives:
Solving Quadratic Equations by Completing the Square
Functions AII.7 cdf 2009.
CMSC Discrete Structures
Σ 2i = 2 k i=0 CSC 225: Proof of the Day
CMSC Discrete Structures
Recurrence Relations Discrete Structures.
1.7 - Exploring Linear Systems
Recurrence Relations.
Recurrence Relations Rosen 5th ed., §6.2 5/22/2019
ICS 253: Discrete Structures I
Generating Function and Applications
Presentation transcript:

Quiz June Section (only beginning)

Quiz June 03: pm 1) Consider the following tree: a) Is this a rooted tree? Is this a extended binary tree? Is this a full binary tree? b) The basis step for constructing full binary trees starts with a single vertex. Construct all possible full binary trees at the next step using their recursive definition. 2) A bank offers the following deal: Each year the bank will give you 4% interest on the amount in your account, but in addition to that it will offer you 2% interest on the amount that was in your account a year ago. a) Write a recurrence relation that describes how much money there will be in your account in future years given you know the amount at year t=1 and t=2. 3) Determine if the following recurrence relations are 1) linear, 2) homogeneous, 3) have constant coefficients and 4) determine their degree.

Quiz answers 1) Consider the following tree: a) Is this a rooted tree? yes Is this a extended binary tree? yes Is this a full binary tree? no b) The basis step for constructing full binary trees is a single vertex. Construct all possible full binary trees at step 1 using their recursive definition. 2) A bank offers the following deal: Each year you the bank will give you 4% interest on the amount in your account, but in addition to that it will offer you 2% interest on the amount that was in your account a year ago. a) Write a recurrence relation that describes how much money there will be in your account in future years given you know the amount at year t=1 and t=2. B[t]=B[t-1]+0.04*B[t-1]+0.02*B[t-2]=1.04B[t-1]+0.02B[t-2] 3) Determine if the following recurrence relations are 1) linear, 2) homogeneous, 3) have constant coefficients and 4) determine their degree. degree 1, linear, inhomogeneous, const, coeff. degree 2, nonlinear, homogeneous, const coeff. degree 1, linear, homogeneous, coeff, depend on n.