Scribd
Upload
5 views

Tutorial Recursion

The document is a tutorial for a course on Discrete Structures, specifically focusing on sequences and summations. It includes problems requiring the evaluation of recursively defined functions and the creation of recursive definitions for various sequences. The tutorial is designed for a duration of 2 hours and requires students to attempt all questions.

Uploaded by

vukenhlanhla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
5 views

Tutorial Recursion

The document is a tutorial for a course on Discrete Structures, specifically focusing on sequences and summations. It includes problems requiring the evaluation of recursively defined functions and the creation of recursive definitions for various sequences. The tutorial is designed for a duration of 2 hours and requires students to attempt all questions.

Uploaded by

vukenhlanhla
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

CSI131 Discrete Structures 1

Tutorial Sequences and Summations


DURATION: 2 HOURS
Attempt all questions.

1. Find f (1), f (2), f (3), and f (4) if f (n) is recursively defined by f (0) =
1, and for n = 0, 1, 2, · · · .

(a) f (n + 1) = f (n) + 2.
(b) f (n + 1) = 3f (n).
(c) f (n + 1) = 2f (n) .

2. Find f (2), f (3), f (4), and f (5) if f (n) is recursively defined by f (0) =
−1, f (1) = 2 and for n = 0, 1, 2, · · · .

(a) f (n + 1) = f (n) + 3f (n − 1).


(b) f (n + 1) = 3f (n)2 − 4f (n − 1)2 .
f (n−1)
(c) f (n + 1) = f (n)
.

3. Give a recursive definition of the sequence {an }, n = 1, 2, 3, · · · if .

(a) an = 6n.
(b) an = 2n + 1.
(c) an = 10n .
(d) an = 5.
(e) an = 4n − 2.
(f) an = n(n + 1).
(g) an = n2 .

You might also like