CS/B.

TECH(N)/EVEN/SEM-4/4408/2022-2023/1028
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL
Utech Paper Code: BS-B401/BSC 401/8SC401/BSCA01 Biology
UPID :004408

Time Allotted:3 Hours Full Marks :70

The Figures in the margin indicate full marks.
Candidate are required to give their answers in their own words as far as practicable
Group-A (Very Short Answer Type Question)
1. Answer any ten of the following : |1x 10 =10]
0) Discuss how the classification system has undergone several changes over a period of time.
() The process of transfer of hereditary character from one generation to another is known as.......?
(n) Name the Vitamins whose deficiency cause i) rickets ii) scurvy
(M) Define enzymes with suitable example.
(M Name the enzyme that transcribes hnRNA in eukaryotes.
(VI) How many essential amino acids are in the nature?
(VIn) What are imperfect fungi?
(V) Asudden change in the gene which is heritable from one generation to other is known as
(3 Why carbohydrates are generally optically active?
(X) Name few of the enzyme secreted by pancreas?
(x) Diatoms are also called 'pearls of the ocean'. Why?
(XI) Which of the following process is an exception of
A. Mutation
Mendel Law?
B. Variation
C. Cloning
D. Linkage

Group-B (Short Answer Type Question)

Answer any three of the following :
2. (5x3 =15 |
Differentiate between aminotelic, uricoteliec, ureotelic organisms
3 Differentiate between Meiosis and Mitosis
4. Differentiate between prokaryotic and eukaryotic cell
(5]
5. Explain Epistasis with suitable example. [5
6 In catalyzed reactions, the formation of the enzyme-substrate complex is the first step. Explain the other
[5)
steps untilthe formation of the product.

Group-C (Long Answer Type Question)

Answer any three of the following: [15 x3 = 45 ]
7. Give characteristics of E.coli, S. cerevisiae, D. Melanogaster as model organisms [15 ]
8. explain the Hierarchy of DNA structure- from single stranded to double helix to nucleosomes (15]
9. How will you convey that Biology is as important a scientific discipline as Mathernatics, Physics and (15]
Chemistry
10. Give characteristics of C. elegance, A. Thaliona, M. musculus as model organisms (151
11. Explain how competitive, un competitive and non competitive inhibitors act on km and vmax. |15)

*** END OF PAPER ***

 MAULANA ABUL KALAM AZAD UNIVERSlTY OF TECHNOLOGY, WEST
cs/B.TECH(N)/EVEN/SEM-4/4416/2022-2023/028
BENGAL
of Algorithms
402/PCCCS404 Design & Analysis
Paper Code:ES-CS401/PCC-CS 404/PCC-CS404/PCC-CSD
UPID: 004416

Full Marks :70

Time Altotted: 3 Hours
marks.
The Figures in the margin indicate full
words as far as practicable
Condidate ore required to give their answers in their own
Group-A (Very Short Answer Type Question)
1 Answer ary ten of the following:
[1x 10 =10]
State TruejFalse: Approximation algorithm guaranties the best quality of solution.
State True/False:O(logn) > O(n)
(h4) What is the time complexity of Knapsack algorithm using Greedy method?
(N) State True/ False: Adiacency matrix and Path Matr0X are same.
(V) State True/ False: Ordered searching algorithm is a Polynomial Algorithm.
(v) State True/False: Brute Force method gives the best quality of solution.
(vH) State True/ False: Travelling Salesman Problem is a Non-Polynomial problem.
fVM} Name one heuristic method of searching.
( Best case time complexity of Binary search algorithm is
0 The time complexity of Floyd's algorithm is
tX9 Backtracking follows traversal technique.
(X} What is spanning tree?

Group-B (Short Answer Type Question)

Answer any three of the following : (5 x3 = 15 ]
Write down an algorithm to solve the Job Sequencing with Deadline Problem using Greedy method. What
is the tirme complexity of your algorithm?
2. Find the maximurn flow of the following network. Mention each step clearly. [5)

18
5 18

15
27

4 6
6
24
2 3
10

4. Write down an algorithn in Greedy method to find the minimum

spanning tree by Prim's algorithm. What (5)
is the time complexity of your algorithm?
S. (al State Cook's Theorem,
(b) Define Clique with example. (S)

6. Define the following terms!

(i) Brute Force Algorithm [S)

1/3
 (ii)Approximation Algorithm
Group-C (Long Answer Type Question)
Answer any three of the following : [15 x3 = 45 ]
7. (a) Find the minimum spanning tree using Prim's method from the following graph.
Mention each step [61
clearly.

,2
1,6
16
I6,5 4,7
1654 37
25
18 16543 2
12
l6S43 2 7 1

(b) Write an algorithm to find all

solutions of N-Queens problem using backtracking. [4)
(c) What is the time complexity of your
algorithm? [1]
id) Write an algorithm to find all pairs shortest path
using Floyd's method. [41
8. (a) Write down an algorithm of Quick Sort.
(b) Der ive the best, worst and average case time [5]
complexity of your algorithm. [2+3+5 ]
9. (a) Find the minimum number of scalar
operation needed to multiply the matrices A1, A2, A3 and A4
having dimensions 30x35, 35x15, 15x5 and 5x10respectively. (5]
(b) Write down an algorithm using Greedy method to find
minimum spanning tree by Krushkal's [5]
algorithm.
(c) Find the time complexity of your algorithm.
(d) Differentiate between Backtracking and Branch and Bound. [3]
10. la) Find the transitive closure of vertex A from the following graph: [21
[31

{b) Define the following terms: (12 ]

() Directed graph
(ii)Undirected graph
2/3
 tij th-Degree and Out Degree
{iv)Complete Graph
(v) Articulation Point
(vi) Bridge
11. (a) Differentiate between recursion and iteration.
(b) Find the time complexity of the following
recurrence relations using Master 's Theorem

()
T) =2T-log n

(c) (c) Define little omega

notation. Explain with an example.
END OF PAPER ***
 CS/B.TECH(N)/EVEN/SEM-4/4407/2022-2023/1028
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY,WEST BENGAL
Paper Code:PCC- CS401/PCC-CS401/PCCCS 401/PCCCS401 Discrete Mathematics
UPID :004407

Time Allotted: 3 Hours Full Marks :70

The Fiqures in the margin indicate full marks.
Candidote are required to give their answers in their own words as far as practicable
Group-A (Very Short Answer Type Question)
1. Answer any ten of the following : [1x 10 =10)
0 What is a cycle in a graph?
Which law of inference states that "if Aimplies B, and Bimplies C, then Aimplies c"?
A) What do youmean by the symmetric difference of setAand B?
JN) How many reflexive relations are possible on a set with n elements?
What do you mean by a 'relation'?
AV) What is a spanning tree in a graph?
(v) Write the Absorption lawS in respect of SET Theory ?
A) Write the contrapositive of p -> ~g.
What is the inverse of p -> "q?
"K6 is a planar graph." State TRUE or FALSE
(X1) What is Cantor's diagonal argument?
Jt) Write the De Morgan's laws of SET
operations.
Group-B (Short Answer Type Question)
Answer any three of the following [Sx3 = 15]
. What is an inverse function? How do you obtain
inverse of a function? Explain with example. (5]
5. Five speakers A, B, C, D and E speak in a meeting one after the other. Find the
before B.
probability thatAspeaks

A. Prove by induction: n +n is even where n is apositive integer. (5]

3. There are 5 white balls, 4 red balls, and 3 blue balls in a box. If you draw 2 balls at random from the box,
what is the probability that both balls are either white or red?
6. In how many ways can you invite one or more of your five friends to your birthday party?
Group-C (Long Answer Type Question)
Answer any three of the following : (15 x 3 = 45]
7. a) Define a SET with proper examples according to the classical set theory. What are the different set [7)
9perations usually performed - explain with examples.
What do you mean by finite and infinite sets ? Also, explain the concepts of finite countable sets,
infinite countable sets and infinite uncountable sets with proper examples.
[2+6)
8. (a) How many non-negative integral solutions are there of the equation x1 +x2 +x3 +x4 =20? [7]
(b) Show that number of prime numbers is infinite.
[8]
9 (a) Show that universalquantifier distributes over conjunction andexistential quantifíer distributes over [8]
disjunction.
(D) Brown, Jones and Smith are suspected of income tax evasion. They testify under oath as follows: [7]
Brown: Jones ís guiltyand Smith is innocent
Jones: If Brown is guilty, then so is smithX
Smith: Iam innocent, but at least one of the others is guilty.
Assuming everyone told the truth. Who is/are guilty/innocent? Sa (nivB)
10 a) What do you mean by Eulerian and Hamiltonian walks? (SAn)(shmB (5]
o) What is Vertex Colouring and Colouring of Edges in graph theory ? [5]
Define Minimal Spanning tree (MST) with an example. [5]
11. (a) What is abipartite graph? How do you determine if a graph is bipartite or not? [5)
12
(b) Showthat trees are bipartite graphs.
(c) Determine the chromatic polynomial of Kn
*** FND OF PAPER ***
 MAULANA ABUL KALAM AZAD UNIVERSITYCs/B. TECH(N)/EVEN/SEM-4/4825/2022-2023/1028
OF TECHNOLOGY, WEST BENGAL
Paper Code: PCCAIML 402
Optimization Techniques
UPID:004825
Time Aliotted:3 Hours
Full Marks :70
The Fiqures in the margin
Candidote are required to give their answers inindicate full marks.
their own words as far as practicable
Group-A (Very Short Answer Type Question)
1. Answer any ten of the folowing:
[1x 10= 10 )
Consider the following LPP.
Maximize (Z) = CX
Subject to
AX <B
X>0
IWrite the dual of the LPP. Take C=(1 2). B =(2
and X = (r y.
Consider the following model.
Maximize (Z) = 0.2.r 0.3y
Subject to
0.6: + 4y < 12
4r + 2y<9

Is the above model a linear programming nodel or o1-linear programuing odel! Give
Iff is a jpusynomial aud g is a uioomial. then what can we say about the characteristie of ?
Name tWO methods by whi ch Integer linear
programming prob lem can be solved.
I A {{ry+y= 6} a ovex t.Justity with teaois

What type of algorithm genetic algorithus are?

esttt WLih the alxne thier parts ia vwpluw"
Which of the following is a non-Convex set?

1/3
 Conside the followg ne progranning problem. Group-C (Long Answer Type Question)
Answer any three of the following: [15 x3 =45 )
Maximize (Z) = 2r + 3y
Sub ject to 7. (a) |)efine convex set. 131
y>l-x (b) Prve that intertion of two CoINCK ts is aiso a convex set (5]
rsl+y (c) Prove that the t of al convex combinatios of a fhnite nsber of ponts is n coex st
80 (a) What is the significance of dual sinplex nethod DBriely explain couputational procoxlnre [61
Is the solution of the given L.P.P imte, infeasible or unbounded? of dual simplex algorithm.
(9)
IaRTangr method of ndeterminl multiphers is one of the metlhods by which von can deal 0) Use dual simplex method to solve L.PP
with NLPP. What is the nvcessary and suticieut conditios in this case?
Maximize (Z) = -2r - 3s -:
Hor do we deal with artificial variables in lincar programming problem? Subject to
2.r +y + 2:>3
Group-B (Short Answer Type Question) 3r +2y+ > 1
Answer any three of the following [5x3= 15 ) T y. >0.
Food X cOntans uits of vitainin A and 7units of vitamin B per gran and costs 12p./gin. (5) 9. a) Deine extrene poiut. (31
Food Ycotaius 8 wits ani 12 units of Aand Bper graum rspectively and costs 201p./gm. II S be the et of all fensible autions of Ax = b. x > 0 ar if x s ninimze th
The daidy rquremeuts of vitamun Aand B are at least 100 units and 120 nits respectively. objective function =x, then x* alo maxinizes the function =(-ox er S
Forniate the abuve as an liwar progranning problenn to uninimize the cost. (Explain clearly rtc Sh that X= {(:z)lt,Sl, r.z >1) s ot a coex set
how cio xon formulate the objeetive function, coust raints and also explain why do vou consiler I61
the docision vanabs as TION-negative)! 10. (a) Find the basic feasible solutions of the following set of equatioIs: 8)
(5)
Consider the following L.P.P.

Maximize (Z) =2r + 3y 2.r + 3y -+41 =8

Subject to T-2y +6: - 7t = -3
and z.y. .t > 0
2r +3y < 12
T, y > 0 (b) (7!
Show that the feasible solution r = l. y= 1 and =0 and = 4to the svstem
(a) Drav tie gapli and uark tbe coumn fcasible rgion (b) Fiud the corner ponts and t+yt =2
ealnate te valae of the objetive fucthou at the corner poiuts. (c) Show that this L.P.P lhas Ity- 3:=2
inhnite solutios atnall.
[5)
2r + 4y 3:-t= 4 and r.y..t> 0
Sup rar a truutaiug tir usE of outs wl:i satistv the constrant r+2y <5
bikker fou PrA that tie cstreted st is a
uf ngiven LP Wrte dnu be iu 11. (a) Pyove that the dual of the dual is the primal L.PP. 5)

Find the dstal of the folloxing licar programning probem. Also verify that the dual of the [5)
(b) Solve the following L.P.P
dnal is the priaal. Thr primal problenn is

Miaime (Z)=-0r-8y + 10: Maximize (Z) = 2.r + 3y +

Subjert to
Subject to
2r -: 1 -3r +2y + 3:=8
--3r + Ay + 2: =7
a0u (5)
6 Obtain the nevesary ad suiciet CodniHLs fo the optimun solution of he ollowiing
linear prograuming prole.
|2
27t 39 ** END OF PAPER **

Sabjest to the eotTAM

7

23 313
 CS/B.TECH(N)/EVEN/SEM-4/4421/2022-2
WEST BENGAL
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY,
Sciences
Paper Code: MC 401/MCA01 Environmental
UPID: 004421
Full Marks :70
Time Allotted:3 Hours
The Figures in the margin indcate full marks.
own words as for as practicable
Condidate are required to give their answers in their
Group-A (Very Short Answer Type Question) [1x 10= 10]
1. Answer any ten of the following:
of ecosystem?
W What do you mean by Abiotic component
(9) Define the term Lithosphere.
(H) Define the term hydrosphere.
(V) What do you mean by soil pollution?
(V) What is the unit of measurement of sOund?
enacted in which year?
(V) The Environment (Protection) Act was
(V) What do youmean by anthropogenic waste?
(VIH) What are the major types of ecosystem?
(D9 What is greenhouse effect?
(X) Define the term COD.
(X1) What is acid rain?
(Xi1) Who developed the concept of ecological pyramid?
Group-B (Short Answer Type Question) [5x3 = 15 ]
Answer any three of the following :
[5)
2. Discuss about the phosphate cycle with diagram. (5]
3.^ Write a short note about green house effect. [5]
interaction.
4. Write ashort note about different types of human environment
(5)
5Write a brief note about ecological pyramid. (5]
measures for the control of air pollution.
6 . Write a brief note about standard control and
Group-C (Long Answer Type Question)
Answer any three of the following: [15 x3= 45]
(3+6+6 ]
7. Ja What do you mean by Ecosystem?
(b) What are the component of Ecosystem?
(c Write down the oxygen cycle with diagram.
(3+6+6]
8. faWhat is global warming?
6) How dose green house gases cause global warming?
tc) What are the adverse effect of global warming?
9. a. Write a brief note about sustainable development. [6+3+3-+3
Defne the terms: Total Fertility Rate, Total Mortality Rate, and Age Pyramid.
cycle?
10. (a) What is biogeochemical [3+6+6 ]
Ibl Discuss about the carbon and nitrogen cycle with diagram.
1 What is dissolve oxygen? What is ts 1mportance as water quality parameter? [4+11 ]
*** END OF PAPER * **
 CS/B.TECH(N)/EVEN/SEM-4/4252/2022-2023/1022
MAULANA ABUL KALAM AZAD UNIVERSITY OF TECHNOLOGY, WEST BENGAL
es Paper Code : PCCAIDS401/PCCAIML 401/PCCAItALAO1 Artticial inteiyene
UMD:004202
Full Marks :70
Time Allotted: 3 Hours
The Figures in the morgin indicote full marks.
Candidote are required to aive their answer in their own words as far as proctiCable

Group-A (Very Short Answer Type Question)

1. Answer any ten of the following :
|1x 10 =10
() What is a semantíc network?
A What is the full form of CNF in predicate logic?
) What is the process of analyzíng the relatíonshios between sertences in a tert caeo?
What is PEAS?
What is Local Maxina?
wt What is knowledge representation?
AM What is Heuristíc Function?
Which type of reasoning in Al involves rnaking the hest gyess based or incornplete information?
What ís the purpose of an existentíial quantifier( )inpredicate iogic?
(09 Inductive learning is a type of learning where
A) What are some common algoríthns used to build Alfor Tic-Tac-Toe?
I ) what is the goal of Aipha-Beta pruning?
Group-B (Short Answer Type Question)
Answer any three of the following : 15x3 = 15 ]
2. What are the components of a state space search problern? (5
3 What is a heuristic function in the context of searching in A? (5)
List down the characteristícs of an intelligent agent. (5
.What are some limitations of searching in Al? [5)
6 Explain the steepest hill climbing algorithm.
Group-C (Long Answer Type Question)
Answer any three of the following : (15 x3 45|
7 Write the A* algorithm and explain it witha 8 puzzíe problerm (15)
8. (a) Write the following in apredicate logic: For allxand y, if x is aparent of y then y is a child of . (4)
(b) List the two levels of knowledge representation. {3
(c) Outline any three methods to select an initial structure knaledge representation. í41
(d) Classify the matching techniques applied between the current state and the preconditions ot the (41
rules.
9. a)What are the challenges and opportunities in designing reinforcerment learning agents? {51
(b) Howcan agents in Al adapt to changing evironments and evolving tasks? (51
interactiors?
(c) How can agents in Af systems earn from human feedback and
10, (a) Explaín each of the following with an example: (8
4)Constraint graph
(i)Constraint satisfaction problem
(b) Explain graph colouring in context of CSP. [71
11ta) what is Breadth First Search? 21
Eb) Write the algorithm of BFS. (5]
A Implement BFS on the given graph and explain it.