Scribd
Upload
39 views1 page

Mca 1 Sem Discrete Mathematics mcc103 2018

This document appears to be an exam for a Discrete Mathematics course, covering topics like: 1) Definitions for terms like tautology, symmetric closure, inference rule, equivalence class, and partial order relation. 2) Graph theory concepts like Eulerian and Hamiltonian graphs. 3) Tree traversal methods like preorder and postorder. 4) Group codes and properties of groups. 5) Questions involving mathematical induction, transitive closures of relations, recurrence relations, minimal spanning trees, shortest path algorithms, and lattice properties. Notes are also requested on graph search methods, Hasse diagrams, and cosets.

Uploaded by

Suganthi I
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
39 views1 page

Mca 1 Sem Discrete Mathematics mcc103 2018

This document appears to be an exam for a Discrete Mathematics course, covering topics like: 1) Definitions for terms like tautology, symmetric closure, inference rule, equivalence class, and partial order relation. 2) Graph theory concepts like Eulerian and Hamiltonian graphs. 3) Tree traversal methods like preorder and postorder. 4) Group codes and properties of groups. 5) Questions involving mathematical induction, transitive closures of relations, recurrence relations, minimal spanning trees, shortest path algorithms, and lattice properties. Notes are also requested on graph search methods, Hasse diagrams, and cosets.

Uploaded by

Suganthi I
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/ 1

http://www.bputonline.

com

Registration No:

Total Number of Pages: 01 MCA


MCC103
1st Semester Back Examination 2017-18
DISCRETE MATHEMATICS
BRANCH : MCA
Time: 3 Hours
Max Marks: 70
Q.CODE : B914
Answer Question No.1 which is compulsory and any five from the rest.
The figures in the right hand margin indicate marks.

Q1 Answer the following questions: (2 x 10)


a) Define tautology. Give one example of a statement which is tautology.
b) What do you mean by symmetric closure?
c) What do you mean by inference rule ?
d) Define equivalence class.
e) Define partial order relation.
f) Define Euler& Hamiltonians graph.
g) What do you mean by Preorder & postorder traversal?
h) Define group code.
i) If a tree has n vertices, how many edges it has?
j) Show that (a.b)-1=b-1 a-1.

Q2 Shaw that 2 > , n>=10 by Mathematical Induction. (10)


Q3 Find the transitive closure of relation (10)
R={(a,b),(b,a),(b,c),(c,d) ,(b,b)}

Q4 Solve the recurrence relations (10)


an=4an +5an ,a1=2, a2=6

Q5 Describe kruskal Algorithms for minimal spanning tree . (10)

Q6 Describe the single source shortest path by Dijkstra Algorithms. (10)


Give example.

Q7 Let L be a lattice. Then for any a, b ɛ L,show that; (10)


(i) a˅(a˅b)=a
(ii)a˅(a˅b)=a

Q8 Write notes about (TWO) : (5 x 2)


a) BFS&DFS.
b) Hasse diagram.
c) Coset.

http://www.bputonline.com

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy