ADITYA INSTITUTE OF TECHNOLOGY AND MANAGEMENT, TEKKALI
(AN AUTONOMOUS INSTITUTION)
Assignment-2 Subject: Mathematical Foundation in computer science (MFCS)
Semester-II-I (Common to CSE &IT) Max. Marks: 5M Subject code: 23CST202
S.NO Question CO’s Cognitive
Level
Batch-I
1 Determine whether (P(S),⊆) is a lattice or not if S={a, b, c} where P(S) is a power set of S. CO 3 Apply
.
2 (i). Define adjacency matrix and incidence matrix of a graph. Obtain the incidence matrix CO 4 Apply
and adjacency matrix of the following graph.
(ii). State Handshaking theorem. Identify the number of edges in a graph with 14 vertices
each of degree 6.
3 (i). Construct the minimum spanning tree (MST) for the given graph using Prim’s CO5 Apply
Algorithm. Also find its minimum cost.
4 7 11
12 1−X −X + X
(ii).Find the coefficient of X in .
( 1−X )5
Batch-II
1 Write various types of Lattices. CO 3 Apply
2 (i).Examine that whether the graphs G and H are isomorphic. CO 4 Apply
(ii). State Handshaking theorem. Identify the number of edges in a graph with 10 vertices
each
of degree 4.
3 (i). Solve Fibonacci relation F n+2=F n+1 + F n for n ≥ 0given F 0=0 , F1 =1 CO5 Apply
(ii). Find the generating functions for the following sequences
(a). 0, 1, 2, 3, 4,. . . . (b)12 ,22 , 32 ,. . . . .
Batch-III
1 . Determine whether ( P(S),⊆) is a lattice or not if S={a, b, c}where P(S) is a power set of S. CO 3 Apply
2 (i). Define Eulerian graph and Hamilton graph. Check whether the following graphs are CO 4 Apply
Eulerian graph and Hamilton graph or not?
(I i). State Handshaking theorem. Identify the number of edges in a graph with 8 vertices
each of degree 3.
3 (i). Use Kruskal’s algorithm to find a minimum spanning tree of the weighted graph and CO3 Apply
find its minimum cost.
(ii).Determine the coefficient of (i) x 12 in x 3 ( 1−2 x )10
(ii) x 15 in ( 1+ x )4 / ( 1−x ) 4
Batch-IV
1 Define Lattice and their properties. CO 3 Apply
2 (i).State the necessary conditions for the graphs to become Isomorphic. Identify whether th CO 4 Apply
following graphs are Isomorphic or not.
(ii). State Handshaking theorem. Identify the number of edges in a graph with 12 vertices
each of degree 4.
3 n
(i).Solve non-homogeneous recurrence relation a n−5 an−1 + 4 an−2=2 for n ≥ 2 CO5 Apply
when a 0=3 , a 1=4
(ii).Find the generating functions for the following sequences
( a)12 ,22 , 32 ,. . . . . (b) 0, 2, 6, 12, 20, 30, 42, . . .
CO-PO & PSO Mapping
CO 3 4 5
PO 1, 2, 3, 4,12 1, 2, 3, 4,12 1, 2, 3, 4,12
PSO 1,2,3 1,2,3 1,2,3
