Scribd
Upload
12 views

Lab 4 Tutorial

Uploaded by

neuro.ultragod
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
12 views

Lab 4 Tutorial

Uploaded by

neuro.ultragod
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

Beirut Arab University Semester: Fall 2022-2023

Faculty of Science Time: Thursday 2 – 5 PM


Mathematics and Computer Science Department Date: Oct 6, 2022
Course: CMPS345 – Discrete Structure II Dr. May Itani

Tutorial Lab 4

1. 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.

2. How many bit strings are there of length 10 begin and end with a 1?

3. How many bit strings are there of length 6 or less?

4. How many bit strings of length 7 either begin with two 0s or end with three
1s?

5. Let F be the function such that F(n) is the sum of the first n positive integers.
Give a recursive definition of F(n).

6. Recurrence Relations
a) Find a recurrence relation for the number of bit strings of length n that
contain three consecutive zeros.
b) What are the initial conditions?
c) How many bit strings of length seven contain three consecutive zeros?

7. Find a recurrence relation for the number of bit sequences of length n with
an even number of zeros.

Page | 1

You might also like