JAYAWANTI BABU FOUNDATION’S

METROPOLITAN INSTITUTE OF TECHNOLOGY AND MANAGEMENT (MITM)

DEPARTMENT OF COMPUTER ENGINEERING

UNIT TEST –I

Sub: Discrete Structures and Graph Theory Year : 2023 Sem: III
Date:06/09/2023 Time:1hr Max.Marks:20
Instruction: Attempt any two questions out of three.

i) Prove using mathematical induction. [CO1] [10]

n ( 3 n+1 )
2+5+8+……+(3n-1)=
Q.No.01 2
ii)Explain the following terms with suitable example. [CO2]
a) Partition set b) Power set
i) Let A{1,2,3,4,5} and let R={(1,1),(1,3),(1,4),(2,2),(2,5),(3,1),(3,3),(3,4), [CO3] [10]
(4,1),(4,3),(4,4),(5,2),(5,5)}.Check if R is a equivalence relation. Justify your answer.
Q.No.02
ii) Construct truth table and check if the following statement is tautology. [CO1]
(P Q) (~Q ~P)
i) What is transitive closure? Find the transitive closure of R using Warshall’s [10]
algorithm where A={1,2,3,4,5} and R={(x,y)|x-y=+-1} [CO3]
Q.No.03
ii)Let A be a set of integers , let R be a relation on A×A defined by (a,b) R(c,d) if and
only if a+b=b+c. Prove that R is an equivalence relation [CO3]

JAYAWANTI BABU FOUNDATION’S

METROPOLITAN INSTITUTE OF TECHNOLOGY AND MANAGEMENT (MITM)

DEPARTMENT OF COMPUTER ENGINEERING

UNIT TEST –I

Sub: Discrete Structures and Graph Theory Year : 2023 Sem: III
Date:06/09/2023 Time:1hr Max.Marks:20
Instruction: Attempt any two questions out of three.

i) Prove using mathematical induction. [CO1] [10]

n ( 3 n+1 )
2+5+8+……+(3n-1)=
Q.No.01 2
ii)Explain the following terms with suitable example. [CO2]
a) Partition set b) Power set
i) Let A{1,2,3,4,5} and let R={(1,1),(1,3),(1,4),(2,2),(2,5),(3,1),(3,3),(3,4), [CO3] [10]
(4,1),(4,3),(4,4),(5,2),(5,5)}.Check if R is a equivalence relation. Justify your answer.
Q.No.02
ii) Construct truth table and check if the following statement is tautology. [CO1]
(P Q) (~Q ~P)
Q.No.03 i) What is transitive closure? Find the transitive closure of R using Warshall’s [10]
algorithm where A={1,2,3,4,5} and R={(x,y)|x-y=+-1} [CO3]
ii)Let A be a set of integers , let R be a relation on A×A defined by (a,b) R(c,d) if and
 only if a+b=b+c. Prove that R is an equivalence relation [CO3]

JAYAWANTI BABU FOUNDATION’S

METROPOLITAN INSTITUTE OF TECHNOLOGY AND MANAGEMENT (MITM)

DEPARTMENT OF COMPUTER ENGINEERING

UNIT TEST –I

Sub: Machine Learning Year : 2023 Sem: VII

Date:06/09/2023 Time:1hr Max.Marks:20
Instruction: Attempt any two questions out of three.
i) Define Machine learning. Explain the core idea behind machine learning. [CO1] [10]
Q.No.01
ii)Explain regression line ,Scatter plot, Error in prediction and Best fitting line [CO2]
i) Explain why decision tree are used. Also draw a sample decision tree and explain its [10]
Q.No.02 parts. [CO2]
ii) Explain supervised learning and unsupervised learning. [CO1]
i) Explain linear regression along with an example. [CO2] [10]
ii)Calculate the entropy of the following distribution. [CO3]
Fruit Color Count
Q.No.03 Yellow 10
Red 5
Green 15
Orange 5

JAYAWANTI BABU FOUNDATION’S

METROPOLITAN INSTITUTE OF TECHNOLOGY AND MANAGEMENT (MITM)

DEPARTMENT OF COMPUTER ENGINEERING

UNIT TEST –I

Sub: Machine Learning Year : 2023 Sem: VII

Date:06/09/2023 Time:1hr Max.Marks:20
Instruction: Attempt any two questions out of three.
i) Define Machine learning. Explain the core idea behind machine learning. [CO1] [10]
Q.No.01
ii)Explain regression line ,Scatter plot, Error in prediction and Best fitting line [CO2]
i) Explain why decision tree are used. Also draw a sample decision tree and explain its [10]
Q.No.02 parts. [CO2]
ii) Explain supervised learning and unsupervised learning. [CO1]
Q.No.03 i) Explain linear regression along with an example. [CO2] [10]
ii)Calculate the entropy of the following distribution. [CO3]
Fruit Color Count
Yellow 10
Red 5
Green 15
Orange 5