Scribd
Upload
15 views1 page

Assignment 3

This document outlines an assignment for the Discrete Structures course at the University of Management & Technology for Fall Semester 2024. It includes important instructions regarding submission, deadlines, and individual work, along with four specific questions that require mathematical proofs and algorithm constructions. The assignment is due on January 11, 2024, and late submissions will incur penalties.

Uploaded by

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

Assignment 3

This document outlines an assignment for the Discrete Structures course at the University of Management & Technology for Fall Semester 2024. It includes important instructions regarding submission, deadlines, and individual work, along with four specific questions that require mathematical proofs and algorithm constructions. The assignment is due on January 11, 2024, and late submissions will incur penalties.

Uploaded by

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

University of Management & Technology

Department of Artificial Intelligence


School of Systems and Technology
Fall Semester 2024
Instructor’s Name: Arshi Iftikhar Subject: Discrete Structures
Course Code CC-1041 Assignment #: 03
Total Marks 20 Assigning Date: 1 Jan, 2024
Due Date 11 Jan, 2024

Important Instructions (To be followed very strictly)


 This is an individual assignment. Attempt all questions
 There must be a cover page contain university logo and student’s complete
information.
 Assignment should be submitted in word or pdf.
 Late submission is not allowed. In case of late submission 2.5 marks will be deducted
per day.
 Assignment will only be submitted on LMS.

Question No 1. [CLO-3] <Bloom Taxonomy: C3>

n, the sum of the first 𝑛 𝑛2.


Apply the principle of mathematical induction to prove that for all
natural numbers odd numbers is

Question No 2. [CLO-3] <Bloom Taxonomy: C3>

Demonstrate that the sum of the first 𝑛 integers is given by the


n ( n+1 )
formula using mathematical induction.
2

Question No 3. [CLO-3] <Bloom Taxonomy: C3>

𝑛. Provide an example with 𝑛=5.


Illustrate the working of the recursive algorithm for calculating
the factorial of a number

Question No 4. [CLO-3] <Bloom Taxonomy: C3>

Construct a recursive algorithm to compute the n-th Fibonacci


number. Demonstrate the algorithm with n=6.

You might also like