u{W4RSITY OF CALCUTTA
I{ o tifi catio nNo. C SN A5 I 20?A
It is notified for information of a1i concerned that the Syndicate in its meeting
held on 08.12.2021 (vide Item No.46), approved & confirmed the new revised
syllabus for "Bio-Mathematics (MTNIA-DSE-A-5-1-TIUTU) and " Boolean
Alge.bra & Automata Theory (MTMA-DSE-B-5-1-TIVTU)" , both taught at
Semester-5 of Mathematics-Honours. (vide CSR/12/2018, dt. 04.6.2018)
Courses of Studies under CBCS, in this University, as laid down in the
acccmpanying pamphlet.
The above will take effect from Odd-Semester examination,2022.
,/11
,V' 1"'--
4\n2-1')
e*-/2,/ Z-/--_--
SENATE HOUSE Prof.(Dr.) Debasis Das
KOLKATA-7OO 073 Registrar
The 22nd February, 2022
Bio-Math ematics sYllabus
T Tnit-1 [25 classes]
process: an overview'
r"*Iathematieal bioiogy and the modeling
models: Malthus model - deduction' analytic
Simple single-species continuous population
solution, behavior of population size as t
+ co' limitations'
of popuiation size aS + co for
Logistic moclel: formulation, analyic solution, behavior '
different initial population size, carrying capacity'
G onrp ertz model: deduction, analyic s olution'
-
moclels: Autonomous ftrst order differential equations
Qualitative analysis of coltiluous
steady states (or fixed points or stationary points or
equilibrium points)' Biological
interpretatic.rn of steady states. Stability and asymptotic
stability of a steady state' Geometrical
analysis. Linearizati on an d stabi I ity anal ysi s'
logistic model and other single-
stability analysis of the steady states of the Maithus model,
species models.
1)' stability
Auee effecr: Basic idea and discussion with the model #, = '*(r - il G -
analysis of steadY states.
harvesting' constant-effort
Harvesti,g problerr,s of a single natural population: Constant-yield
harvesting.
model: Necessity and application'
Non-dimc*sionalisation and repararnetrisation in a
Biti.rrcation: Saddle-node, transcritical and pitchfork
bifi:rcations in one-dimensional case'
- deduction, analysis of steady states,
lnsect outbreak model: The spruce budworm model
presence of saddle-node bifurcation'
Unit-2 [30 classes]
Interacting populations: Predator-prey systems and Lotka-Volterra
model - deduction'
analytic solution'
of continuons modcls: Two-dimensionar nonlinear systems
- steady
euaritative anarysis
states, nullclines. T inearisation ancl stability anarysis
of a steady state, Routh-Hurwitz criteria'
meaningiul steady states of Lotka-
Steady states and rinear stability analysis of biorogicarly
Voltena predator-PreY model.
Diffsrent rypes of functional responses - Ho[ing rlpe -I, q m growths.
Improved predator-prey model introducing rhe logistic growtb term for the prey
and. other
predator-prey models, their steady stares and linear stability analysis.
Periodic solutions and lirait c,vcies: Statemenr of Poi::care-Bend.ixson rheorem, Bendixson,s
negative criterion, Dulac criteion, Hopf biflrrcation and.I{opf bii.ucation theorem (statement
only). Examples in the context of biological scenario.
The cirern.ostat: Bacterial growth in a chemostat. Michaelis-Menten kinetics. Formulation
of
model and steady states.
Populations in competition: Lotka-Volterra competition model, steady
states a1d. linear
stability analysis.
Epidemic models: Basic terminologies.
SI, Kerma'ck-McKendrick SIR, SIRS moclels: Formulation of the models.
Basic reproduction.
number.
Unit-3
[15 classes]
Discrete single-species mociels: Linear models, growth models, decay
mod.els, discrete
logistic model.
overview of nonlinear ditference equations: Steady states and linear stability analysis.
Graphical solution cf difference equations - cobwebbing.
Systerns of trvo clilferenoe ecluaticlr:.s: Concepts of steady states and.linear stability
analysis.
Disorete predator-prey rno d el : Mo d.el formulation.
Flost-p arasitoid sys tems : Nicholson-B ailey mo del- formulatio n.
Stability of cliscrere nonlinear systems: Linear stability analysis of biologically meaningful
steady states of discrete predator-prey model and Nicholson-Baitrey model.
Reference:
L.E. Kesher, Marhematical Models in Biology, SIAM'
1988'
tl]
Biology, Springer, 1993'
t2] l. D. Murray, Mathematical
Springer-Verlag, 1990'
t3] Y.C. Fung, Biomechanics,
and J. Wu,.Mathematical Epidemiology, Springer'
2008'
[4] F. Braler, P.V.D. Driessche
Cambridge University Press, 2001'
i5] M. I(ot, Elements of Mathematical Ecology,
Models in PopulationBiology aud
t6l F.l3rauer and c. castillo-chavez, Mathematical
Epidemiolo gY, SPringer, 2Q12.
Perseus Books, 1994.
i7] s. H. strogatz, Nonlinear Dynamics and chaos,
t8] N.F. Britton, Essential Mathematical
Biology, Springer, 2003.
I
' DSE-B-.1 BOOLEAN ALGEBRA AND AUTOMATA THEORY MTMA SEM V
UNIT 1
o Mathematical prellminaries: Set theory (Russell's paradox and a brief introduction
to the
axiomatic approach toset theory), Relations (including transitive and reflexive-transitive
closure needed for derivations), Mapping, Basics of Graph Theory (up to Tree
and Rooted
Tree, needed for drawing transition diagram and parse trees).
UNIT 2
o Definition, examples and basic properties of ordered sets, maps between ordered
sets,
duality principle, lattices as ordered sets, lattices as algebraic structures,
sublattices,
products and homomorphisms, definition, examples and properties
of modular and
distributive lattices, a brief introduction to Hasse diagram.
UNIT 3
o Boolean algebras, Boolean polynomials and their minimal and maximal
forms, Karnaugh
diagrams, relation between lattice and Boolean algebra, Logic gates,
switching circuits and
their applications.
UNIT 4
Alphabet, strings and their properties (union, concatenation etc.),
languages and different
types of grammars (a short introduction to chomsky Hierarchy).
Finite state Machine (transition table, transition diagram, input/output
strings-definitions
and examples).
Regular language and Regular Expression, closure properties of
Regular language (emphasis
should be given to different examples), Pumping Lemma (statement
and its applications).
Finite Automata: Difference between FSM and FA, Deterministic
and non-deterministic
finite automata and their relations with regular language and regular
expression,
acceptance/rejection of differ:ent strings by finite automata, conversion
of DFA to NDFA
(examples).
UNIT 5
r Context Free Grammar (CFG) and Pushdown Automata (pDA):
CFG, parse trees and their
applications in detecting ambiguities in CFG, PDA and languages
accepted by pDA,
Deterministic and Non-deterministic PDA, properties of Context
Free Language (CFL),
chomsky Normal Form and conversion of cFG to cNF, properties
of cFL and closure
properties, pumping Lemma for cFL (statement and
its applications).
UNIT 6
o A short introduction to Philosophy of Mathematics and historical background
of Turing
Machines (TM) (students should learn the role of mathematicians
in
constructing anAbstract Machine as an Algebraic Structure, which came earlier
rhan the computers used todaY).
lntroductionto concept of Algorithm in the context of attempts to solve Hilbert's
tenth problem (proposed in lCM, 1900).
o TM as a model of computation, variants of TM and their equivalence.
I Recr.rrsive and Recu rsively Enu m erable Languages.
Undecidability, Sotvability and Computability: Undecidable problems about Turing
Mactrine (TMJ and CFGs, Post Correspondence Problem and application of PCP
through examples, Halting Problem,
PROPOSED MARKS DISTRIBUTIoN FOR THEoRY (Full marks - 65)
a MCQ: Ttris section should cover the whole syllabus(20).
t 1 question is to be answered out of 2 questions from UNIT 1,1 question out of 2
from UNIT 2 and 1 question out of 2 from UNIT 3, each question should carry 4
'marks.
I 2 questions out of 3 from UNIT 4, each carrying 7 marks;
a 2 questions out of 3 from UNIT 5, each carrying Smarkst
a 1 question out of 2 from UNIT 6, each carrying 7 marks;
0 Total marks from UNIT 3, 4,5,6 should be 33.
