MATHEMATICAL FOUNDATIONS OF

COMPUTER SCIENCE

Subject Code: CS303ES

Regulations : R16 - JNTUH
Class : II Year B.Tech CSE I Semester

Department of Computer Science and Engineering

BHARAT INSTITUTE OF ENGINEERING AND TECHNOLOGY
Ibrahimpatnam - 501 510, Hyderabad
 MATHEMATICAL FOUNDATIONS OF COMPUTER
SCIENCE (CS303ES)
COURSE PLANNER

I. COURSE OVERVIEW:
This course will discuss fundamental concepts and tools in discrete mathematics with
emphasis on their applications to computer science. Topics include logic and Boolean
circuits, sets, functions, relations, deterministic algorithms and randomized algorithms,
analysis techniques based on counting methods and recurrence relations, trees and graphs.
II. PRE REQUISITE:
1. Familiarity of concepts of statements logic and truth tables
2. Familiarity of concepts of sets, functions and relations
3. Counting principles, permutations and combinations
4. Basic concepts of graphs and trees

III .COURSE OBJECTIVE:

1 To introduce the concepts of mathematical logic

2 To introduce the concepts of sets, relations, and functions.
3 To perform the operations associated with sets, functions, and relations.
4 To introduce generating functions and recurrence relations.
To relate practical examples to the appropriate set, function, or relation model, and
5 interpret the associated operations and terminology in context.
To use Graph Theory for solving problems
IV. COURSE OUTCOME:

S.NO Description Bloom’s taxonomy level

Knowledge,
Ability to apply mathematical logic to solve
1 Understand(Level1,
problems
Level2)
Understand sets, relations, functions and discrete Apply, Create
2
structures (Level 3, Level 6)
Able to use logical notations to define and reason
3 about fundamental mathematical concepts such as Evaluate
sets relations and functions (Level 3)
Able to formulate problems and solve recurrence
4
relations
Able to model and solve real world problems using Analyze (Level 4)
5
graphs and trees
V. HOW PROGRAM OUTCOMES ARE ASSESSED:

Proficiency
Program Outcomes (PO) Level
assessed by
PO1 Engineering knowledge: Apply the knowledge of
Assignments,
mathematics, science, engineering fundamentals, and an
3 Tutorials, Mock
engineering specialization to the solution of complex
Tests
engineering problems.
PO2 Problem analysis: Identify, formulate, review research
literature, and analyze complex engineering problems Assignments,
reaching substantiated conclusions using first principles 3 Tutorials, Mock
of mathematics, natural sciences, and engineering Tests
sciences.
PO3 Design/development of solutions: Design solutions for
complex engineering problems and design system
Assignments,
components or processes that meet the specified needs
3 Tutorials, Mock
with appropriate consideration for the public health and
Tests
safety, and the cultural, societal, and environmental
considerations.
PO4 Conduct investigations of complex problems: Use
research-based knowledge and research methods
including design of experiments, analysis and -
interpretation of data, and synthesis of the information to
provide valid conclusions.
PO5 Modern tool usage: Create, select, and apply appropriate
techniques, resources, and modern engineering and IT
tools including prediction and modeling to complex -
engineering activities with an understanding of the
limitations.
PO6 The engineer and society: Apply reasoning informed by
the contextual knowledge to assess societal, health, safety, Assignments,
legal and cultural issues and the consequent 3 Tutorials, Mock
responsibilities relevant to the professional engineering Tests --
practice.
PO7 Environment and sustainability: Understand the impact
of the professional engineering solutions in societal and Assignments,
2
environmental contexts, and demonstrate the knowledge Tutorials,
of, and need for sustainable development.
PO8 Ethics: Apply ethical principles and commit to
professional ethics and responsibilities and norms of the 1 Assignments
engineering practice.
PO9 Individual and team work: Function effectively as an
individual, and as a member or leader in diverse teams, - --
and in multidisciplinary settings.
PO10 Communication: Communicate effectively on complex
engineering activities with the engineering community
and with society at large, such as, being able to
- --
comprehend and write effective reports and design
documentation, make effective presentations, and give
and receive clear instructions.
 Proficiency
Program Outcomes (PO) Level
assessed by
PO11 Project management and finance: Demonstrate
knowledge and understanding of the engineering and
management principles and apply these to one’s own - --
work, as a member and leader in a team, to manage
projects and in multidisciplinary environments.
PO12 Life-long learning: Recognize the need for, and have the
preparation and ability to engage in independent and life- Assignments,
2
long learning in the broadest context of technological Tutorials
change.

-:
1: Slight 2: Moderate 3: Substantial
Non
(Low) (Medium) (High)
e

VI. HOW PROGRAM SPECIFIC OUTCOMES ARE ASSESSED:

Proficiency
Program Specific Outcomes (PSO) Level assessed
by
PSO1 Software Development and Research Ability: Ability to
understand the structure and development methodologies of Lectures,
software systems. Possess professional skills and knowledge Assignme
of software design process. Familiarity and practical nts,
3
competence with a broad range of programming language and Tutorials,
open source platforms. Use knowledge in various domains to Mock
identify research gaps and hence to provide solution to new Tests
ideas and innovations.
PSO2 Lectures,
Foundation of mathematical concepts: Ability to apply the
Assignme
acquired knowledge of basic skills, principles of computing,
nts,
mathematical foundations, algorithmic principles, modeling 3
Tutorials,
and design of computer- based systems in solving real world
Mock
engineering Problems.
Tests
PSO3 Successful Career: Ability to update knowledge continuously
in the tools like Rational Rose, MATLAB, Argo UML, R
Lectures,
Language and technologies like Storage, Computing,
2 Assignme
Communication to meet the industry requirements in creating
nts
innovative career paths for immediate employment and for
higher studies.
1: Slight 2: Moderate - : None
(Low) (Medium) 3: Substantial (High)

VII. SYLLABUS:
UNIT - I
 Mathematical logic: Introduction, Statements and Notation, Connectives, Normal Forms,
Theory of Inference for the Statement Calculus, The Predicate Calculus, Inference Theory of
the Predicate Calculus.
UNIT - II
Set theory: Introduction, Basic Concepts of Set Theory, Representation of Discrete
Structures, Relations and Ordering, Functions. Algebraic Structures: Introduction, Algebraic
Systems, Semi groups and Monoids, Groups, Lattices as Partially Ordered Sets, Boolean
algebra.
UNIT – III
Elementary Combinatorics: Basics of Counting, Combinations and Permutations,
Enumeration of Combinations and Permutations, Enumerating Combinations and
Permutations with Repetitions, Enumerating Permutations with Constrained Repetitions,
Binomial Coefficients, The Binomial and Multinomial Theorems, The Principle of Inclusion
Exclusion.
UNIT – IV
Recurrence Relations: Generating Functions of Sequences, Calculating Coefficients of
generating functions, Recurrence relations, Solving recurrence relations by substitution and
Generating functions, The method of Characteristic roots, Solutions of Inhomogeneous
Recurrence Relations.
UNIT - V
Graphs: Basic Concepts, Isomorphisms and Subgraphs, Trees and their Properties,
Spanning Trees, Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs
and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four-Color Problem.
GATE SYLLABUS:
Discrete Mathematics: Propositional and first order logic. Sets, relations, functions,
partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:
counting, recurrence relations, generating functions.
IES SYLLABUS: NIL
TEXT BOOK:
1. Discrete Mathematical Structures with Applications to Computer Science, J.P.
Tremblay, R. Manohar, McGraw Hill education (India) Private Limited. (UNITS - I, II)
2. Discrete Mathematics for Computer Scientists & Mathematicians, Joe L. Mott,
Abraham Kandel, Theodore P. Baker, Pearson , 2nd ed. (Units - III, IV, V )

REFERENCES:
1. Discrete Mathematics and its Applications, Kenneth H. Rosen, 7th Edition, McGraw Hill
education (India) Private Limited.
2. Discrete Mathematics, D.S. Malik & M.K. Sen, Revised edition Cengage Learning.
3. Elements of Discrete Mathematics, C. L. Liu and D. P. Mohapatra, 4th edition, McGraw
Hill education (India) Private Limited.
4. Discrete Mathematics with Applications, Thomas Koshy, Elsevier. 5. Discrete and
Combinatorial Mathematics, R. P. Grimaldi, Pearson.

NPTEL Web Course:

1. https://onlinecourses.nptel.ac.in/noc18_ma10/announcements?force=true

NPTEL Web Course:

1. http://nptel.ac.in/courss/106106090/

NPTEL Video Course:

1. http://nptel.ac.in/courses/106106090/#

UGC-NET Syllabus
Discrete structures and graph theory, statements and logic

VIII. COURSE PLAN (WEEK -WISE):

LESSON PLAN-COURSE SCHEDULE:

Course learning
No
Week
Session

Unit

TOPIC outcomes Reference

1. Define mathematical logic

Mathematical logic Introduction T1,T2,R1
2 1 Problems Solve problems T1,T2,R1
3 Statements and Notation Define statements T1,T2,R1
4 Connectives Solve problems T1,T2,R1
5 Normal Forms Understand normal forms T1,T2,R1
6 problems Solve problems T1,T2,R1
7 2 Understand theory of T1,T2,R1
Theory of Statements Inference
statements
for the Statement Calculus,
8 The Predicate Calculus Understand predicate T1,T2,R1
9 Inference Theory of the Predicate Understand theory of T1,T2,R1
Calculus inference
10 3 problems Solve problems T1,T2,R1

Topic beyond syllabus

11 Understand basic
Basic Concepts of Set Theory T1,T2,R1
concepts of sets
12 Solve problems
problems T1,T2,R1
4
13 Representation of Discrete Understand discrete T1,T2,R1
Structures, structures
14 2 Relations and Ordering Solve problems T1,T2,R1
 15 Functions Understand functions T1,T2,R1
16 Introduction to Algebraic Understand algebraic
Systems, structures
17 Define semigroup and T1,T2,R1
Semi groups and Monoids
5 monoids
18 Groups Understand groups T1,T2,R1
19 Lattices as Partially Ordered Solve problems T1,T2,R1
Sets,
20 Boolean algebra Define Boolean algebra T1,T2,R1
BRIDGE CLASS / MOCK I
Topic beyond syllabus
21 Basics of Counting Define various methods T1,T2,R1
of counting

22 6 Problems on counting Solve problems T1,T2,R1

23 Combinations and Understand permutation T1,T2,R1
Permutations and combination
2
24 Enumeration of Combinations Solve problems on T1,T2,R1
combinations
25 Permutations Understand permutations T1,T2,R1
26 problems Solve problems on T1,T2,R1
permutations
27 Enumerating Combinations Solve problems on T1,T2,R1
7 with repetitions combinations
28 Problems Solve problems T1,T2,R1
29 Enumerating permutations with Understand repetitions T1,T2,R1
repetitions
30 problems Solve problems T1,T2,R1
31 Define circular T1,T2,R1
Circular permutations
permutation
32 Solve problems on T1,T2,R1
8
Binomial Coefficients, binomial coefficients

33 Problems Solve Problems T1,T2,R1

34 The Binomial Theorem Prove binomial theorem T1,T2,R1
I Mid Examinations
35 Problems Solve problems T1,T2,R14
36 Prove multinomial T1,T2,R1
Multinomial theorem
9 theorem
37 3 Solve problems
Problems
T1,T2,R
 1
38 Principles of inclusion and Understand principles T1,T2,R1
exclusion
39 problems Solve problems T1,T2,R1
Topic beyond syllabus
UNIT – 4
40 Generating Functions of Define generating
Sequences function T1,T2,R1
1
41 Problems Solve problems T1,T2,R1
0
42 Calculating Coefficients of Solve problems on T1,T2,R1
generating functions coefficients
43 Recurrence relations, Define recurrence relation T1,T2,R1
44 1 Solving recurrence relations by Solve problems using T1,T2,R1
1 substitution method, substitution method
45 problems Solve problems T1,T2,R1
46 Solving recurrence relations by Solve problems using T1,T2,R1
generating function generating functions
47 4problems Solve problems T1,T2,R1
48 The method of Characteristic Understand method of T1,T2,R1
roots, characteristics
49 Solutions of Inhomogeneous Solve problems on T1,T2,R1
1 Recurrence Relations homogeneous r r
50 2 Solve problems on r r T1,T2,R1
Problems
Topic beyond the syllabus
Bridge class
UNIT – 5
51 Graphs: Basic Concepts, Define graph and various
types of graphs T1,T2,R1

52 13 Isomorphism and Sub graphs Solve problems T1,T2,R1

53 Trees and their Properties, Define trees T1,T2,R1
54 Spanning Trees, Directed Define spanning trees and T1,T2,R1
Trees, directed trees
55 Binary Trees Solve problems T1,T2,R1
56 Planar Graphs Solve problems T1,T2,R1
57 14 Euler’s Formula Solve problems T1,T2,R1
58 Multigraphs and Euler Solve problems T1,T2,R1
5 Circuits
59 Hamiltonian Graphs, Solve problems T1,T2,R1
60 Chromatic Numbers, Define chromatic number T1,T2,R1
15
61 The Four-Color Problem Solve problems T1,T2,R1
62 problems Solve problems T1,T2,R1
 Topic beyond syllabus

IX. MAPPING COURSE OUTCOMES LEADING TO THE ACHIEVEMENT OF

PROGRAM OUTCOMES AND PROGRAM SPECIFIC OUTCOMES:
Program
Cours
Program Outcomes (PO) Specific
e
Outcomes (PO)
Outco
PO PO PO PO PO PO PO PO PO PO PO PO PS PS
me
1 2 3 4 5 6 7 8 9 10 11 12 O1 O2
CO1 1 3 1 - - - - - - - - - 1 -
CO2 2 2 - - - - - - - - - - 1 2
CO3 2 3 1 - 2 - - - - - - - 2 -
CO4 2 2 - 2 - 1 - - - - - - - -
CO5 1 2 - - - - - - - - - - 1 -
AVG 1.6 1.2 0.4 0.4 0.4 0.2 - - - - - - 1 0.4

QUESTION BANK: (JNTUH)

DESCRIPTIVE QUESTIONS:
UNIT-I
Short Answer – Questions

S.No Question Blooms Course

taxonomy outcom
level e
1 State which of the following sentences are Analyze 4
propositions: i) A triangle contains three lines
ii) x+2 is a positive integer
2 Prove that {(p→q) →r}↔{(~pVq)→r} is a Analyze 4
tautology.
3 Define Principal disjunctive normal form & Evaluate 5
Principal conjunctive normal form
4 Write down the following prepositions in symbolic Understand 2
form and find its negation:
“All integers are rational numbers and some
rational numbers are not integers”
5 Give an indirect proof for each of the following Apply 3
statements: i)If m is an even integer,then m+7 is an
odd integer ii)If x& y are integers such that xy is
odd,then x & y are both odd

Long Answer Questions-

S.N Questions Blooms CO
o taxonomy
level
1 a)Use De Morgan’s Law to write the negation of each Evaluate 5
statement
i.I want a car and a worth cycle
ii. My cat stay outside or it makes a mess
iii.I’ve faller and I can’t get up
iv. You study or you don’t get a good grade.
b) Are (p→q) →r and p→ (q→r) logically equivalent? Justify
your answer by using the rules of logic to simply both
expression and also by using truth tables

2 Express the formula P→Q in terms of {↑} only Apply 3

(A^ (~AvB))v~(A^B))= B
Which of the following formula is not a tautology
i)(P→Q) →(Q→R)
ii) )(P→Q) ^(Q→P)

3 Obtain principal conjuction normal form for the following Evaluate 5

4 a) What do you mean by a variable & statement function in Apply 3

predicate calculus?
b) what is a Quantifier? What are various types of quantifier?
c) show that √2 is not a rational number, using proof by
contradiction?

5 Prove using rules inference or disprove. Evaluate 5

(a) Duke is a Labrador retriever All Labrador like to swim.
Therefore Duke likes to swim.
(b) All even numbers that are also greater than
2 are prime
2 is an even number
2 is a prime
Therefore some even numbers are prime
UNIVERSE = numbers
(c) if it is hot today or raining today then it is no fun to snow
ski today
Therefore it is hot today
UNIVERSE=Days
Unit 2
Short answer questions
S.No Question Blooms CO
taxono
my
level
1 Define Poset and distributive lattice. Analyze 4
2 Consider the following relations on the A={1,2,3}, Create 6
f={(1,3),(2,3),(3,1)}
g={(1,2),(3,1)},h={(1,3),(2,1),(1,2),(3,1)} which of these are
functions?
3 Define Homomorphism & Isomorphism Analyze 4
4 Let f & g be functions from R to R defined by f(x)=ax+b and Understand 2
g(x)=1-x+x2. If (gof) (x)=9x2-9x+3 , determine a.b
5 5.Consider the sets A={a,b,c} and B={1,2,3} and the relations. Remember 1
R={(a,1),(b,1),(c,2),(c,3)} and S={(a,1),(a,2),(b,1),(b,2)}
from A to B.Determine R͞ ,S͞ ,R⋃S,R⋂S,Rc,Sc

Long Answer Questions

Question Blooms
taxonom
S. No

CO
level
1 Let A={1,2,3,4,6} and R be a relation on A defined by aRb if and Evaluate 5
only if”a” is a multiple of “b”. Represent the relation R as a
matrix and draw its digraph.
2 Let A={a,b,c,d} R be a relation on A that has the matrix M r = Apply 3
1 0 0 0
0 1 0 0
[ ]. Construct the digraph of R and list the in-
1 1 1 0
0 1 0 1
degrees and out-degrees of all vertices.
3 Let A={1,2,3} and R={(1,1),(2,2),(3,3)}. Verify that R is an Evaluate 5
equivalence relation.
4 Let A={1,2,3,4,6,8,12} on An define the partial ordering relation R Analyze 4
by aRb iff a/b.
a) Draw the Hasse diagram for R. b) Write down the relation
matrix for R.
5 Let A ={1,2,3,4,5} and Analyze 4
R={(1,1),(2,2),(3,3),(1,3),(3,4),(3,5),(1,4),(4,4),(1,5),(2,3),(2,4),
(2,5),(5,5)}. Draw the Hasse diagram for R.
UNIT-3
Short Answer Questions-
S.No Question Blooms Course
taxonomy outco
level me
1 Prove that if 30 dictionaries in a library contain a total Analyze 4
of 61327 pages, then at least one of the dictionaries
must Prove have at least 2045 pages.
2 In how many ways can we distribute 10 identical Create 6
marbles among 6 distinct containers?
3 Find the number of arrangements of the letter Evaluate 5
TALLAHASSEE which have no adjacent A’s
4 Find the no of positive integers solutions of the Understand 2
equation
x1+x2+x3=17
5 In how many ways can 20 similar books be placed on 5 Analyze 4
different shelves
Long Answer Questions-
S.No Question Blooms Course
taxonomy outco
level me
1 a) Find the value of n so that 2P(n,2)+50=P(2n,2) Evaluate 5
b)Prove that ,for all the integers n,r≥ 0,if n+1>r,then
𝑛+1
P(n+1,r)=(𝑛+1−𝑟 ) P(n,r).
2 Find the coefficient of Apply 3
(i) x9y3 in the expansion of (x+2y)12
(ii) x5 y2 in the expansion of (2x-3y)7
3 State and prove The Principle of Inclusion-Exclusion. Evaluate 5
4 Find the number of integer solutions of the equation Analyze 4
x1+x2+x3+x4+x5 = 30 under the constraints x1 >=0 for
i=1,2,3,4,5 and further x2 is even and x3 is odd.
5 In how many ways can we distribute 10 identical Analyze 4
marbles among 6 distinct containers?
UNIT-4
Short answer questions
S.No Question Blooms Course
taxon outc
omy ome
level
1 Find the sequences generated by the following functions : Create 6
i) (3+x)3 ii) 3x3+𝑒 2𝑥
2 Find the generating functions for the sequences 12,22,32…….. Create 6
3 Solve the recurrence relation an+1=4an for n≥ 0 , given that Analyze 4
a0=3.
4 The number of virus affected files in a system is 1000 (to start Analyze 4
with ) and this increases 250% every 2 hours. Use a
recurrence relation to determine the no of virus affected
files in the system after one day.
5 Find a12 if a2n+1 = 5a2n , where an>0 for n≥ 0 , given that Analyze 4
a0=2.
Long answer questions
S.No Question Blooms CO
taxon
omy
level
1 Find the sequence generated by the following functions: Evaluate 5
(i) (3+x)3 (ii) 2x2 (1-x)-1 (iii) (1-x)-1+2x3 (iv)
 (1+3x)-1/3 (v) 3x3+e2x
2 Find the generating functions for the following sequences. Analyze 4
(i)1,2,3,4,------------- (ii) 1,-2,3,-4,---------- (iii) 0,1,2,3,-------
----
3 Determine the coefficient of (i) x12 in x3(1-2x)10 (ii) x10 in (x3- Analyze 5
5x)/ (1-x)3 (iii) x5 in(1-2x)-7
4 Solve the recurrence relation an+3-3an+2+3an+1-an =3+5n for Analyze 4
n>=0
5 Find a generating function for recurrence relation a n+1-an=n2 Analyze 4
,n>=0 and a0 =1.Hence solve it.
UNIT-5
Short Answer Questions-
S. Question Blooms Course
N taxon outc
omy ome
level
1 Define directed graph and directed edge set Apply 3
2 Draw a diagram of the graph G=(V,E) where V={A,B,C,D} , Apply 3
E={(A,B),(A,C),(A,D),(C,D)}
3 Define complete bipartite graph and kuratowski’s second graph. Apply 3
4 Apply 3

5 Apply 3

Long Answer Questions-

SN Question Blooms Course
taxonomy outcome
level
1 Let D be the digraph whose vertex set is V={ v1 Apply 3
,v2,v3, v4, v5 }and the directed edge set is E={(v1,v4),(
v2,v3),( v3,v5),( v4,v2), ( v4,v4),( v4,v5),( v5,v1) } write
down a diagram of D and indicate the outdegrees and
indegrees of all vertices.
2 a)Define sub graph and spanning sub graph. Apply 3

3 How many vertices will the following graphs have if Apply 3

they caontain (i) 16 edges and all vertices of degree
4? (ii) 21 edges,3 vertices of degree 4 and other
vertices of degree 3 (iii) 12 edges , 6 vertices of
degree 3, and other vertices of degree <3 ?
OBJECTIVE QUESTIONS:
JNTUH:
UNIT-1
1The binary relat ion S = f(empt y set) on set A = {1, 2, 3} is
i. Neit her reflexive nor symmetric
ii. Symmetric and reflexive
iii. Transit ive and reflexive
iv. Transit ive and symmetric
2 Let A be a set of n(>0) elements. Let N r be the number of binary relat ions on
A and let N f be the number of funct ions from A to A.
i. Give the expression for N r in terms of n.
ii. Give the expression for N f in terms of n.
iii. Which is larger for all possible n, N r or N f ?
3 Suppose X and Y are sets and |X| and |Y| are their respect ive cardinalit ies. It
is given that there are exact ly 97 funct ions from X and Y. from this one
can conclude that
(GATE )
i. |X| =1, |Y|=97 ii. |X|=97, |Y| = 1 iii. |X|=97, |Y|=97 iv. none of
the above
4 Identify the correct translat ion into logical notation of the following
assert ion.
Some boys in the class are taller than all the girls.
Note: taller (x,y) is true if x is taller than y.
i. ($x) (boy(x) ® (y) (girl(y) Ù taller (x,y)))
ii. ($x) (boy(x) Ù (y) (girl(y) Ù taller (x,y)))
iii. ($x) (boy(x) ® (y) (girl(y) ® taller (x,y)))
iv. ($x) (boy(x) Ú (y) (girl(y) Ú taller (x,y)))
5 What is the first order predicate calculus statement equivalent to the following
?
Every teacher is liked by some student
i. (x) [teacher(x) ® $(y) [student(y) ® likes (y,x)]]
ii. (x) [teacher(x) ® $(y) [student(y) Ù likes (y,x)]]
iii. $(x) (x) [teacher(x) ® [student(y) Ù likes (y,x)]]
iv. (x) [teacher(x) Ù $(y) [student(y) ® likes (y,x)]]
UNIT-2
1 Let X, Y, Z be sets of sizes x,y and z respect ively.Let W= X*Y and E be
the set of all subsets of W. The number of funct ions from Z to E is:
 i. Z 2xy
ii. Z* 2 xy
iii. Z 2x+y
iv. 2 xyz
2 A relat ion R is defined on ordered pairs of integers as follows:(x,y) R (u,v)
if x<u and y>v.Then R is
i. Neit her a part ial order nor an eauivalence relat ion.
ii. A part ial order but a total order
iii. A total order
iv. An equivalance relat ion
3 Let f : Bg C and g: A gB be two funct ions let h = f o g. Given that h is an onto
funct ion which one of the following is TRUE?
i. f and g should both be onto funct ions.
ii. f should be onto but g need to be onto
iii. g should be onto but f need not be onto
iv. both f and g need to be onto
4 Consider the binary relat ion :
S = {(x,y) | y = x + 1 and x, y Î {0, 1, 2}}
i. {(x,y) | y > x and x, y Î {0, 1, 2}}
ii. {(x,y) | y ³ x and x, y Î {0, 1, 2}}
iii. {(x,y) | y < x and x, y Î {0, 1, 2}}
iv. {(x,y) | y £ x and x, y Î {0, 1, 2}}
5 The number of binar y relat ions on a set wit h n elements is:
i. n2 ii. 2 n iii. 2 n2 iv. None of the above
UNIT-3
1 A mult iset is an unordered collect ion of elements where elements may repeat
any number of t imes. The size of a mult iset is the number of element s in it
count ing repet it ions.
i. What is the number of mult isets of size 4 that can be constructed from n
dist inct elements so that at least one element occurs exact ly twice?
ii.How many mult isets can be constructed from n dist inct elements?
iii. None of the above

2. The number of binar y strings of n zeroes and k ones that no two ones are
adjacent is
i. n-1 C k ii. n C k iii. n C k+1 iv. None of the above

3. How many 4 digit even numbers have all 4 digit s dist inct?
i. 2240 ii. 2296 iii. 2620 iv. 4536
4. How many substrings of different lengths(non zero) can be found formed
from a character string of length n?
i. n ii. n 2 iii. 2 n iv. None of the above
5. In a room containing 28 people, there are 18 people who speak Engli sh, 15
people who
speak Hindi and 22 people who speak Kannada. 9 persons speak both English
and Hindi, 11 persons speak both Hindi and Kannada whereas 13 persons speak
both Kannda and English. How many people speak all three languages?
i. 9 ii. 8 iii. 7 iv. 6
UNIT -4
1 The solut ion to the recurrence equat ion T(2 k ) = 3 T(2 k-1 ) + 1, T(1) =1 is
i. 2 k ii. (3 k+1 -1)/2 iii. iv.
2 Express T(n) in terms of the harmonic number H n = , where T(n) sat isfies
the recurrence relat ion, T(n) = , for n ³ 1 and T(1) = 1.-----------
3 Find a solut ion to the following recurrence equat ion: T(n) = 1. -------------
4. Solve the recurrence equat ions:T(n) = T(n) = 1. -------------
5. Solve the recurrence equat ions T(n) = T(n-1) + n, T(1) = 1. -----------
UNIT -5
1. Level order traversal of a rooted tree can be done by starting from the root and
performing
i. preorder traversal (ii) in-order traversal (iii) depth first search
iv. breadth first search
2. How many perfect matchings are there in a complete graph of 6 vert ices?
i. 15 ii. 24 iii. 30 iv. 60
3. Let S be a set of n elements {1,2…..,n} and G a graph wit h 2 n vert ices, each
vertex corresponding to a dist inct subset of S. two vertices are adjacent iff the
symmetric difference of the corresponding sets has exact ly 2 elements.
Note: The symmetric difference of two sets R 1 and R 2 defined as
(R 1 |R 2 ) È (R2|R1).
i. Every vertex in G has the same degree. What is the degree of a
vertex in G?
ii. How many connected components does G have?
4.Let G be a connected undirected graph. A cut in G is a set of edges whose
removal result s in G being broken into two or more component s which are not
connected wit h each other. The size of a cut is called in cardinalit y. A min -cut of
G is a cut in G of minimum cardinalit y. Consider the following graph.
(GATE)
5. A graph is planar if a nd only if,
i. it does not contain sub graphs homomorphic to K 5 and K 3,3
ii. it does not contain sub graphs isomorphic to K 5 or K 3,3
iii. it does not contain sub graphs isomorphic to K 5 or K 3,3
iv. it does not contain sub graphs homomorphic to K 5 or K 3,3
WEBSITES:
1. www.computer.org
2. www3.intersciencewiley.com
3. www.vsppub.com
4. www.sciencedirect.com
5. www.akcejournal.org
6. www.ams.org
7. www.siam.org
8. www.maths.ise.ac.uk
EXPERT DETAILS:

Mr.Jason. Dr. K. Kumkum Mr. G. L. Reddy Dr. Anandbabu

Brown Dewan Lecturer in Professor,
Associate Depart ment of Universit y of Depart ment of
Professor, Mathemat ics, Hyderabad, Mathemat ics,
Depart ment of IIT, Madras. Depart ment in Osmania
Mathemat ics and Email: Mathemat ics, Universit y,
Statist ics kkdewan123@yahoo. Universit y of Hyderabad.
Universit y of co.in Hyderabad. Email:
Canada Email: anandb@hot mail.
Email: glrsm@uohyd.ern com
jason.brown@da et.in
l.ca

JOURNALS:
INTERNATIONAL:
1. SIAM Journals DM
2. Journal of the American Mathemat ical Society
3. AKCE Internat ional Journal of Graphs and Combinat ions
4. Discrete Mathemat ics
5. Discrete Mathemat ics and Applicat ions
6. Journal of Discrete Mathemat ical Sciences a nd cryptography
7. Journal of Graph Theory
NATIONAL:
1. Journal of Mathemat ical and Physical Sciences
2. Operat ions Research Societ y of India (OBSEARCH)
3. Journal of Discrete Mathemat ical Science, Cryptography
4. Nordic Journal of Comput ing
5. Bullet in of Calcutta Mathemat ical Societ y
6. Indian Nat ional Science Academy
7. Indian Journal of Pure and Applied Mathematics
LIST OF TOPICS FOR STUDENT SEMINARS:
a. GRAPH THEORY
b. RECURRENCE RELATIONS
CASE STUDIES / SMALL PROJECTS
a. Applications of Graph theory