DSGT Sample Ques Bank (CSE-DS)

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING IN
ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

ACADEMIC YEAR 2022-23
QUESTION BANK
Class/Sem: Second Year/III Course Name: DSGT (CSC302)
MODULE I- Logic
1. Prove using mathematical

Induction- 2+5+8+….+(3n-
1)=n(3n+1)/2
2. Construct truth tables to determine whether each of the following is a tautology, a
contradiction or a contigency.
a) P (q  p)
b) (p Λ q) Λ ~ (p V q)
3. Prove ~ (p V (~ p Λ q)) and ~ p Λ ~ q are logically equivalent by developing a series of
logical equivalences.
4. Compute the truth table of the
statement a. (p->q)<->(~q-
>~p)
b. p Λ(q V r)
5. Show that – ((PVQ) ^ ~ (~P ^ (~QV ~R)) V (~P ^ ~Q)V(~P ^ ~R)) is a tautology.
6. Show that n3+2n is divisible by 3 for all n>=1.

7. Prove by Induction-1+2+3+….+n=(n(n+1))/2 for all natural number values of n.
MODULE II-Relations & Functions
1. Define reflexive closure & Symmetric closure of a relation. Also find reflexive and
symmetric closure of R.
A={1,2,3,4} R={(1,1),(1,2),(1,4),(2,4),(3,1),(3,2),(4,2),
(4,3),(4,4)}
2. Let f:RoR, where f(x)=2x-1 and f-1(x)= (x+1)/2. Find (fof-1)(x).
3. Let A={a1, a2,a3,a4,a5} and let R be a relation on A whose matrix is
MR=
Find Transitive closure MR∞ using Warshall's Algorithm.

4. Let A={1,2,3,4,5}. A relation R is defined as aRb iff a<b. Compute R2 & R∞ .
5. Define the terms-Subset, Proper subset, disjoint sets, partitions of set, Power set ,
Equivalence relation, .
6. Using Venn diagrams, prove De Morgan’s laws.
7. Let A={1,4,7,13} and R=((1,4),(4,7),(7,4),(1,13)}.Find Transitive Closure using
Warshall’s Algo.
8. 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),(4,1),
(4,3),(4,4),(5,2),(5,5)}. Check if R is an equivalence relation. Justify your answer. Find
Equivalences classes of A.
9. Let A={1, 2, 3, 4} & let R={(1, 2),(2, 3),(3, 4),(2, 1)}.Find Transitive Closure of R
using Warshall’s Algorithm.
10. Let A={11, 12, 13, 14} & let R={(11, 12),(12, 13),(13,1 4),(12, 11)}.Find Transitive
Closure of R using Warshall’s Algorithm.
11. Given A={1, 2, 3, 4} & B={x, y, z}.Let R be the following relation from A to B.
R={(1, y),(1, z),(3, y), (4, x), (4, z)}
i. Determine the matrix of the
relation i.Draw the arrow diagram of
R.
ii. Find the inverse relation R-1 of R
iii. Determine the Domain & Range of R.
12. Check whether relation is reflexive, irreflexive, symmetric, antisymmetric, transitive.

R1={(1, 1),(1, 2),(2, 1),(2, 2),(3, 3),(4, 3),(3, 4),(4, 4)}
R2={(1, 3),(1, 1),(3, 1),(1, 2),(3, 3,(4, 4)}
MODULE III- Posets & Lattice
1. Define Lattice. Check if following diagram is Lattice or not.
2. Draw the Hasse diagram of D36.

3. Draw the Hasse diagram of the poset A={2, 3, 6, 12, 24, 36, 72} under the relation of
divisibility.
4. Draw the Hasse diagram of the following sets under the partial order relation divides
and indicate which are chains. A. A={2,4,12,24} B={2,4,8,16,32}
5. Let A = {a,b,c}. Draw Hasse Diagram for (p(A), ⊆)
6. Draw the Hasse diagram for divisibility on the set i. {1, 2, 3, 4, 5, 6, 7, 8} ii. {1, 2, 3,
4, 5, 7, 11,13}
MODULE IV- Counting
1. Explain Extended pigeonhole principle. How many friends must you have to
guarantee that at least 5 of them will have birthdays in same month.
2. In a group of 6 boys & 4 girls, 4 children are to be selected. In how many different
ways can they be selected such that at least one boy should be there?
3. In a survey of 60 people, it was found that 25 read Newsweek magazine, 26 read
Time & 26 read Fortune. Also, 9 read both Newsweek & Fortune, 11 read both Newsweek &
Time, 8 read both Time & Fortune, 8 read no magazine at all.
a. Find the no. of people who read all 3 magazines.
b. Fill the correct no. of people in each of eight regions of fig. below. Here, N, T, F
denote set of people who read Newsweek, Time & Fortune resp.
c. Determine the no. of people who read exactly one magazine.
4. How many numbers must be selected from the set {1, 2, 3, 4, 5, 6} to guarantee that
at least one pair of these numbers add up to 7?
5. Find how many integers between 1 & 60 are not divisible by 2, nor by 3 & nor by 5?
6. Solve ar-7ar-1+10ar-2=6+8r. Given a0=1,a1=2
7. A survey on a sample of 25 new cars being sold of a local auto dealer was conducted to
see which of three popular options air conditioning A, Radio R & popular windows W were
already installed. The survey found
15 had air conditioning,
12 had Radio
11 had Power windows,
5 had air conditioning & Power windows,
9 had air conditioning & Radio,
4 had Radio & Power windows, 05
had all three options.
Find the number of cars having
a. Only one of these options.
b. Radio & Power windows, but not air conditioning.
c. None of these options.
MODULE V- Algebraic Systems
1. Prove that set G={1,2,3,4,5,6} is a finite abelian group of order 6 with respect to
multiplication modulo 7.
2. Consider the (3,5) group encoding function defined by
e(000)=00000
e(010)=01001
e(100)=1001
1
e(110)=1101
0
e(001)=0011
0
e(011)=0111
1
e(101)=1010
1
e(111)=1100
0
Decode the following words relative to a maximum likelihood decoding function.
3. Let G be a group. Prove that the identity element e is unique.
MODULE VI- Graph Theory
1. Determine whether following Graphs are isomorphic or not.
2. Define Eular path & Hamiltonian path.

i. Determine Eular cycle & path in graph(a).
ii. Determine Hamiltonian cycle & path in graph(b).
3. Determine whether fol. Graphs are isomorphic or not.

4. Determine whether following Graph is planar.
5. Use Nearest Neighbor method to find out Hamiltonian circuit for graph shown in
fig. Starting vertex a.
6. Let H={[0]6,[3]6}. Find the Left & Right cosets in Z6. Is H a normal subgroup of
group Z6?
Subject In-charge HOD

Prof. Mitrakshi Patil Prof Shraddha Subhedar

DSGT Sample Ques Bank (CSE-DS)

Uploaded by

Copyright:

Available Formats

DSGT Sample Ques Bank (CSE-DS)

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

DSGT Sample Ques Bank (CSE-DS)

Uploaded by

Copyright:

Available Formats

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING IN

ARTIFICIAL INTELLIGENCE AND MACHINE LEARNING

1. Prove using mathematical

4. Compute the truth table of the

6. Show that n3+2n is divisible by 3 for all n>=1.

MODULE II-Relations & Functions

Find Transitive closure MR∞ using Warshall's Algorithm.

12. Check whether relation is reflexive, irreflexive, symmetric, antisymmetric, transitive.

1. Define Lattice. Check if following diagram is Lattice or not.

2. Draw the Hasse diagram of D36.

MODULE IV- Counting

MODULE V- Algebraic Systems

MODULE VI- Graph Theory

1. Determine whether following Graphs are isomorphic or not.

2. Define Eular path & Hamiltonian path.

3. Determine whether fol. Graphs are isomorphic or not.

Subject In-charge HOD

You might also like