Scribd
Upload
36 views2 pages

DMS Final Assessment 01

The document provides instructions for a final assessment in discrete mathematical structures for computer science students. It lists 5 questions to attempt that cover topics like predicates and quantifiers, mathematical induction, counting techniques, equivalence relations, and graph theory. Students are instructed to show their work, submit answers in PDF format with their registration number and name, and to ask for clarification on any questions. The assessment is worth a total of 30 marks and is to be submitted online through a Google Form.

Uploaded by

Maeeda Aqeel Visiting Teacher
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
36 views2 pages

DMS Final Assessment 01

The document provides instructions for a final assessment in discrete mathematical structures for computer science students. It lists 5 questions to attempt that cover topics like predicates and quantifiers, mathematical induction, counting techniques, equivalence relations, and graph theory. Students are instructed to show their work, submit answers in PDF format with their registration number and name, and to ask for clarification on any questions. The assessment is worth a total of 30 marks and is to be submitted online through a Google Form.

Uploaded by

Maeeda Aqeel Visiting Teacher
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/ 2

Final Assessment Spring 2021

Department: Computer Science Program: BSCS Semester/Section: CS 3-A, B

Course Code & Name: CSC 1201 Discrete Mathematical Structures Duration: 2 hrs

Instructor: Dr. Tazeen Athar Total Marks: 30

Date: 7th June, 2021 Submission Mode: Online

Important Instructions:

Read all assessment carefully and then ask for the questions.

 Students are required to Submit/turn in their Assessments on Google Form only. Assessment
submitted through any other Mode will not be considered submitted and will not be marked.
 Students are required to turn in the assessment in a pdf file.
 The name of file must be Registration Number_Name.
 Answers copied or submitted of unasked question may result in zero marks for the question.
 Write your Reg.No._Name & Page No. on every sheet.
 Sheets should be turned in in order and scanned. Do not upload pictures of your sheets.

-------------------------------------------------------------------------------------------------------------------------------
Attempt all questions: Write all steps while solving

Q1(a) Express the statement using predicates, quantifiers and conditional connectives.
“In every online class few students have connectivity issue and they do not join the class.”

(b) Data are transmitted over a particular Ethernet network in blocks of 1500 bytes. How
many blocks are required to transmit the 784 kilobytes of data over this Ethernet network?

(c) Find ∑350 2


𝑘=150 𝑘 . (1.5+1+2.5=05 Marks)

Q2(a) For which positive integers 𝑛 is 3𝑛 + 4 ≤ 2𝑛 ? Prove the inequality using mathematical
induction.

(b) Given the following information about a computer program, find the mistake in the
program using rules of inference.
i. There is an undeclared variable or there is a syntax error in the first five lines.
ii. If there is a syntax error in the first five lines, then there is a missing semicolon or a
variable name is misspelled.
iii. There is not a missing semicolon.
iv. There is not a misspelled variable name. (5+2.5=7.5 Marks)

Page 1 of 2
Q3 Solve the following using counting techniques. (1+2+2=05 Marks)
(a) The landline telephone numbers in the phone system in Islamabad city consist of seven
digits, with the first digit not equal to zero. How many different numbers can be assigned
in this system?
(b) There are 12 signs of the zodiac. How many people are needed to guarantee that at least
six of these people have the same sign?
(c) How many bit strings of length 10 contain at least five 0s?

Q4 Let 𝑆 be the set of students enrolled in a BSCS program in a university. A relation 𝑅 is


defined on 𝑆 as follows:
“For all 𝑝, 𝑞 ∈ 𝑆, 𝑝 𝑅 𝑞 ⇔ 𝑝 and 𝑞 𝑎𝑟𝑒 𝑒𝑛𝑟𝑜𝑙𝑙𝑒𝑑 𝑖𝑛 𝑎 𝑠𝑎𝑚𝑒 𝑠𝑒𝑐𝑡𝑖𝑜𝑛.”
Determine whether the given relation is an equivalence relation or not? If yes, mention
the partition of the set 𝑆 and write the equivalence classes. (05 Marks)

Q5(a) Two simple graphs are given with the following adjacency matrices.
0 0 0 1 0 1 1 1
𝐺 = [0 0 1 1] , 𝐻 = [1 0 1 0].
0 1 0 1 1 1 0 0
1 1 1 0 1 0 0 0
Determine whether 𝐺 and 𝐻 are isomorphic to each other? Give reason(s).

(b) Draw the Depth First Search and Breadth First Search spanning trees rooted at 3 for the
graph given below. (5+2.5=7.5 Marks)

***END***

Page 2 of 2

You might also like