0% found this document useful (0 votes)
30 views2 pages

March 2022

The document is an exam for a Discrete Mathematics course. It contains 8 questions testing concepts in propositional logic, sets, functions, sequences, algorithms, proofs by induction, recursion, probability, and graphs. Students are required to answer any 5 of the 8 questions, with each question worth 15 marks.

Uploaded by

Manoj Kumar
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
0% found this document useful (0 votes)
30 views2 pages

March 2022

The document is an exam for a Discrete Mathematics course. It contains 8 questions testing concepts in propositional logic, sets, functions, sequences, algorithms, proofs by induction, recursion, probability, and graphs. Students are required to answer any 5 of the 8 questions, with each question worth 15 marks.

Uploaded by

Manoj Kumar
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

Code No: 154AQ R18

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD


JN
B. Tech II Year II Semester Examinations, March - 2022
DISCRETE MATHEMATICS
(Common to CSE, IT, ITE)
Time: 3 Hours Max. Marks: 75
TU
Answer any five questions
All questions carry equal marks
---
1.a) Construct a truth table for each of these compound propositions.
H
i) 𝑝 → ¬𝑝 ii) 𝑝 ↔ ¬𝑝 iii) 𝑝 ∧ 𝑞 → 𝑝 ∨ 𝑞 iv) (𝑞 → ¬𝑝) ↔ (𝑝 ↔ 𝑞)
b) Show that if p, q, and r are compound propositions such that p and q are logically
equivalent and q and r are logically equivalent, then p and r are logically equivalent.[8+7]
U
2.a) Suppose that the domain of the propositional function P (x) consists of the integers -2, -1,
se
0, 1, and 2. Write out each of these propositions using disjunctions, conjunctions, and
negations.
i) ∃𝑥¬𝑃(𝑥) ii) ∀𝑥¬𝑃(𝑥) iii) ¬∃𝑥𝑃 𝑥 iv) ¬∀𝑥 𝑃(𝑥)
dP
b) Translate each of these statements into logical expressions using predicates, quantifiers
and logical connectives.
i) Something is not in the correct place.
ii) All tools are in the correct place and are in excellent condition.
a
iii) Everything is in the correct place and in excellent condition.
iv) Nothing is in the correct place and is in excellent condition.
pe
v) One of your tools is not in the correct place, but it is in excellent condition. [7+8]

3.a) Determine whether each of these statements is true or false:


rs
i) 𝑥 ∈ {𝑥} ii) 𝑥 ⊆ {𝑥} iii) 𝑥 ∈ {𝑥} iv) 𝑥 ∈ { 𝑥 } v)∅ ⊆ {𝑥}
b) Let A and B be sets. Show that: i) 𝐴 ∩ 𝐵 ⊆ 𝐴 ii) 𝐴 ∩ 𝐵 − 𝐴 = ∅
c) Suppose that the universal set is U = {1, 2, 3, 4,5,6,7,8,9,10}each of these sets can be
represented with bit strings where the ith bit in the string is 1 if i is in the set and 0
M
otherwise. Find the set specified by each of these bit strings.
i) 11 1100 1111 ii) 01 0111 1000 iii) 10 0000 0001 [5+5+5]
ar
4.a) Determine whether each of these functions is a bijection from R to R
i)𝑓 𝑥 = −3𝑥 + 4 ii)𝑓 𝑥 = −3𝑥 2 + 7
ch
iii)𝑓 𝑥 = (𝑥 + 1)/(𝑥 + 2) iv)𝑓 𝑥 = 𝑥 5 + 1
b) Consider these functions from the set of students in a discrete mathematics class.
Under what conditions is the function one-to-one if it assigns to a student his or her
20
i) mobile phone number ii) student identification number.
iii) final grade in the class iv) home town.
c) List the first 10 terms of each of these sequences.
2
i) the sequence obtained by starting with 10 and obtaining each term by subtracting 3
from the previous term
2
ii) the sequence whose nth term is the sum of the first n
positive integers
iii) the sequence whose nth term is 3𝑛 − 2𝑛
iv) the sequence whose nth term is ⌊ 𝑥⌋
v) the sequence whose first two terms are 1 and 5 and each succeeding term is the sum of
the two previous terms. [5+5+5]
5.a) Describe an algorithm that takes as input a list of n integers and finds the number of
JN
negative integers in the list.
b) In this problem, to establish a big-O relationship, find witnesses C and k such that
|𝑓 (𝑥)| ≤ 𝐶|𝑔(𝑥)|whenever x > k. Determine whether each of these functions is O(x).
i) 𝑓 𝑥 = 5 log 𝑥 ii) 𝑓 𝑥 = ⌈𝑥/2⌉
TU
c) Suppose that an element is known to be among the first four elements in a list of
32 elements. Would a linear search or a binary search locate this element more rapidly?
[5+5+5]
H
6.a) Let P (n) be the statement that 12 + 22 + · · · + 𝑛2 = 𝑛(𝑛 + 1)(2𝑛 + 1)/6 for the
positive integer n.
i) What is the statement P (1)?
U
ii) Show that P (1) is true, completing the basis step of the proof.
iii) What is the inductive hypothesis?
se
iv) What do you need to prove in the inductive step?
v) Complete the inductive step, identifying where you use the inductive hypothesis
b) Give a recursive definition of the:
dP
i) the set of even integers
ii) the set of positive integers congruent to 2 modulo 3.
iii) the set of positive integers not divisible by 5
c) Give a recursive algorithm for finding the sum of the first n positive integers. [5+5+5]
a
7.a) Which is more likely: rolling a total of 8 when two dice are rolled or rolling a total of 8
pe
when three dice are rolled?
b) Find the probability that a family with five children does not have a boy, if the sexes of
children are independent and if a boy and a girl are equally likely.
rs
c) Suppose that 8% of all bicycle racers use steroids, that a bicyclist who uses steroids tests
positive for steroids 96% of the time, and that a bicyclist who does not use steroids tests
positive for steroids 9% of the time. What is the probability that a randomly selected
bicyclist who tests positive for steroids actually uses steroids? [5+5+5]
M
8.a) How can a graph that models e-mail messages sent in a network be used to find electronic
ar
mail mailing lists used to send the same message to many different e-mail addresses?
b) For each undirected graph that is not simple, find a set of edges to remove to make it
simple. [8+7]
ch
20
2
---ooOoo---
2

You might also like