Scribd
Upload
4 views4 pages

Solution Final Discrete Structures

This document is an end-term examination paper for the Discrete Structures course at the National University of Modern Languages Islamabad. It includes various questions related to mathematical concepts such as sequences, relations, functions, graph theory, and scheduling problems. The exam consists of two main questions with multiple parts, each requiring detailed solutions and examples.

Uploaded by

babardiscord
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
4 views4 pages

Solution Final Discrete Structures

This document is an end-term examination paper for the Discrete Structures course at the National University of Modern Languages Islamabad. It includes various questions related to mathematical concepts such as sequences, relations, functions, graph theory, and scheduling problems. The exam consists of two main questions with multiple parts, each requiring detailed solutions and examples.

Uploaded by

babardiscord
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

Roll No.

_________________

NATIONAL UNIVERSITY OF MODERN LANGUAGES ISLAMABAD


FACULTY OF ENGINEERING & COMPUTING
DEPARTMENT OF COMPUTER SCIENCE
END-TERM EXAMINATION – FALL 2024 – BSAI-1 (MORNING)

Subject: Discrete Structures SSIS-111 Instructor: Zunaira Sajid


Allowed Time: 03 Hours Total Marks: 50

Instructions: -
i. Attempt all questions and return the question paper with the answer sheet.
ii. Clearly mention the question number before attempting it.

QUESTION 1 [CLO-2, C2, PLO-3]


Part 1: [05+05+05 Marks]
i. Solve ∑2𝑖=0 ∑3𝑗=0 𝑖 2 𝑗 3 . (180)
ii. Consider the sequence 7, 21, 63, 189, 567, …
Check the value of 8th term of the sequence. Also find the sum of first 15 terms of the sequence.

iii. Identify the least number of area codes needed to guarantee that the 25 million phones in a
state can be assigned distinct 10-digit telephone numbers? (Assume that telephone numbers are
of the form NXX-NXX-XXXX, where the first three digits form the area code, N represents a
digit from 2 to 9 inclusive, and X represents any digit.)

Part 2: [10 Marks]


Compare a relation and a function. Give example using an arrow diagram for the following.
i. A function which is one-one but onto.
ii. A function which is onto but not one-one.
iii. A function which is neither one-one nor onto.
iv. A function which is both one-one and onto.

QUESTION 2 [CLO-3, C3, PLO-2]

Part 1: [05+05+05 Marks]

i. Demonstrate in a group of 15 people, is it possible for each person to have exactly 3 friends?

Page 1 of 4
ii. Find Hamiltonian circuit in the following graph. Is there an Euler circuit?

iii. Use appropriate way to find the chromatic number of the given graph

Page 2 of 4
Part 2: [04+03+03 Marks]

i. Prepare the schedule for final exams at a university so that no student has two exams at the same
time? Graph is given for reference (with vertices representing courses and with an edge between
two vertices if there is a common student in the courses they represent.)

ii. Show that an undirected graph has an even number of vertices of odd degree.

iii. Define the following using example.


a) Complete Bipartite graph

Page 3 of 4
1. Wheel

b) Rooted Tree

Page 4 of 4

You might also like