Scribd
Upload
21 views

DMS Question Bank Unit 4_5_6

The document is a question bank covering Units 4, 5, and 6, focusing on topics in graph theory, algebraic structures, and combinatorics. It includes questions on various types of graphs, shortest path algorithms, minimum spanning trees, properties of binary trees, and group theory concepts. Additionally, it addresses combinatorial problems and recurrence relations, providing a comprehensive overview of key mathematical concepts.

Uploaded by

nisha220609
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
21 views

DMS Question Bank Unit 4_5_6

The document is a question bank covering Units 4, 5, and 6, focusing on topics in graph theory, algebraic structures, and combinatorics. It includes questions on various types of graphs, shortest path algorithms, minimum spanning trees, properties of binary trees, and group theory concepts. Additionally, it addresses combinatorial problems and recurrence relations, providing a comprehensive overview of key mathematical concepts.

Uploaded by

nisha220609
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

DMS Question Bank

(Unit 4,5 & 6)

1. Explain various types of graphs along with suitable examples.


2. Explain Eulers path, Eulers circuit and Hamiltonian path, Hamiltonian circuit with
suitable examples.
3. Explain the following terms with respect to graph theory-
a. Self-loop
b. Parallel edge
c. Isolated vertex
d. Adjacent vertex
e. Degree of a vertex
f. Indegree and outdegree
4. Explain single source shortest path algorithm (Dijkstra’s Algorithm) with suitable
examples.
5. What is a binary tree? List and explain properties of a binary tree.
6. What is a Graph? List and explain types of graphs with suitable examples.
7. Define the terms with example:
a. Eulerian Graph
b. Hamiltonian Graph
c. Planer graphs
8. For the following graph, find the shortest path using Dijkstra’s algorithm.

9. What is a minimum spanning tree? Construct a minimum spanning tree for a given graph
using Prim’s algorithm and Kruskal’s algorithm.

10. Explain the following terms with suitable examples-


1. Algebraic system
2. Semigroup
3. Monoid
4. Group
5. Abelian group
6. Cyclic group
11. Show that multiplicative group G = {1, -1, i, -i } is cyclic.
12. What is a ring? Explain various types of rings?
13. What is a group? Explain various types of groups?
14. What is algebraic structure? Explain different properties of binary operation of an
algebraic structure with suitable examples.
15. Explain Homomorphism, Automorphism and Isomorphism of a group.
16. What is lattice? Explain the properties of lattice and its operation.
17. Let A = {1, 2, 3, 4 }
R = { (1,1), (1, 2), (2, 2), (2, 4), (1,3 ), (3, 3), (3, 4), (1,4), (4, 4) }
Show that R is a Partial order relation and draw its Hasse diagram.
18. Calculate minimum hamming distance for following codes and rewrite the code using
even parity check bit.

C = { 1001, 1101, 0010, 1110 }. Also explain the group codes with examples.

19. What is permutation? Explain with suitable examples. Also explain sum rule and product
rule.
20. Explain iteration method for Linear recurrence relation with the help of suitable example.
21. Solve the following recurrence relation with iteration method.

T(P) = T(P-1) + 3, P≥1 & T(0)=2.

22. What is combinatorics? Explain sum rule, product rule and basic counting principle.
23. A student is to answer 10 out of 13 questions in an exam.
i. How many choices he has, if he must answer the first two questions.
ii. How many choices he has, if he must answer exactly three out of first five
questions.
iii. How many choices he has, if he must answer atleast three out of first five
questions.
24. Explain Isomorphism of graphs with suitable example. Also explain Bipartite graphs.
25. Prove that the set of positive integers under addition forms a monoid.
26. What is a semigroup? Let Z = {2n | n is an integer}. Show that (Z,*) is a semigroup with
respect to multiplication.
27. What is permutation?
A box contains 6 white balls and 5 black balls. Find the number of ways 4 balls can be
drawn from the box if-
a. Two must be white
b. All of them must have the same color.
28. Solve the following recurrence relation:

2an+2 - 11an+1 + 5an = 0, n ≥ 0 a0 = 2, a1= -8

You might also like