B.Sc. (Computer Science) Sem 3 Discrete Mathematics 2014-15 Page 2 Question Paper - Mumbai University | munotes
Get access to whole semester resourcesSemester Pass
MU B.Sc. (Computer Science) student group
Free to join
Loading PDF...
Older exam
2014-15 - Page 3
Semester-end · Discrete Mathematics
→
Newer exam
2014-15 - Page 1
Semester-end · Discrete Mathematics
→
Questions asked in this paper
d) Write an algorithm on deleting the value in binary seach tree. Use it to
e) i)Build a binary tree for a list
connected graph and regular graph withanexample
Find the Path matrix for the following graph using Warshall’s algorithm
Define the term i) Binary tree Complete binary tree Extended bi nary
h) i)Construct a tree of the algebraic expression (X+(Y-(X+Y))) (3=(2x7))x4)
ii)Give the adjacency list and adjacency matrix of complete graph of 5
Q 3) Solve the following (any 4)
a) State the Inclusion — exclusion principle
How many positive integers not exceeding 100 are divisible by 2,3 or 57
e) i)Build a binary tree for a list
connected graph and regular graph withanexample
Find the Path matrix for the following graph using Warshall’s algorithm
Define the term i) Binary tree Complete binary tree Extended bi nary
h) i)Construct a tree of the algebraic expression (X+(Y-(X+Y))) (3=(2x7))x4)
ii)Give the adjacency list and adjacency matrix of complete graph of 5
Q 3) Solve the following (any 4)
a) State the Inclusion — exclusion principle
How many positive integers not exceeding 100 are divisible by 2,3 or 57
Read from the scan above, so a character or two may differ. The scan is the original.
Something wrong on this page? Report it and we will check it against the scan.
Quick Help
No. The full paper opens straight away, with no login and nothing to pay.
Related Resources
Something wrong with this paper? Report it.
Connected Papers
B.Sc. (Computer Science) / Sem 3 · 75 papers
Questions? Email contact@munotes.in
Done!