FirstRanker Logo

FirstRanker.com - FirstRanker's Choice is a hub of Question Papers & Study Materials for B-Tech, B.E, M-Tech, MCA, M.Sc, MBBS, BDS, MBA, B.Sc, Degree, B.Sc Nursing, B-Pharmacy, D-Pharmacy, MD, Medical, Dental, Engineering students. All services of FirstRanker.com are FREE

📱

Get the MBBS Question Bank Android App

Access previous years' papers, solved question papers, notes, and more on the go!

Install From Play Store

Download AKTU B-Tech 8th Sem 2016-17 Discrete Mathematics Question Paper

Download AKTU (Dr. A.P.J. Abdul Kalam Technical University (AKTU), formerly Uttar Pradesh Technical University (UPTU) B-Tech 8th Semester (Eight Semester) 2016-17 Discrete Mathematics Question Paper

This post was last modified on 29 January 2020

AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University


Firstranker's choice

Roll www.FirstRanker.com

B. TECH.

--- Content provided by‍ FirstRanker.com ---

THEORY EXAMINATION (SEM–VIII) 2016-17

DISCRETE MATHEMATICS

Time: 3 Hours Max. Marks : 100

Note: Be precise in your answer. In case of numerical problem assume data wherever not provided.

SECTION – A

--- Content provided by FirstRanker.com ---

  1. Attempt all parts of the following question: 10 x 2 = 20

    1. What is the difference in relation and function?

    2. Define equivalence relation.

    3. --- Content provided by⁠ FirstRanker.com ---

    4. Transform following statement into symbolic form: Jack and Jill went up the hill.

    5. Define negation.

    6. Find the permutations of the set A = {1,2,3,4} taking two at a time.

      --- Content provided by​ FirstRanker.com ---

    7. There are 10 different people at a party. How many ways are there to pair them up into a collection of 5 parings ?

    8. Show that (I,+) is an abelian group.

    9. --- Content provided by⁠ FirstRanker.com ---

    10. Define cyclic group.

    11. Define Hamiltonian Path.

    12. Define Chromatic number.

      --- Content provided by⁠ FirstRanker.com ---

SECTION – B

  1. Attempt any five parts of the following questions: 5 x 10 = 50

    1. Let R be the relation on the set A of integers, defined by xRy if x - y is divisible by 4. Show that R is an equivalence relation, and describe the equivalence classes.

      --- Content provided by​ FirstRanker.com ---

    2. Show the implication

      1. (P?¬P)?Q?(Pv¬P)?R
      2. (P?Q)?Q?PvQ
    3. --- Content provided by⁠ FirstRanker.com ---

    4. Find the solution of recurrence relation an = 6an-1+11an-2-6an-3 with condition a0 = 2,a1 = 5 and a2 =15

    5. Show that (F,+,.) is a field where F is a set of all rational numbers and + and . are ordinary addition and multiplication operators.

    6. Show that number of odd degree vertices is always even.

      --- Content provided by​ FirstRanker.com ---

    7. Show that the graph shown in figure does not contain Hamiltonian Circuit.

      [Diagram description: A graph with vertices a, b, c, d, e, f, with edges connecting a-b, b-c, c-d, d-e, e-f, f-a, a-e, b-d, c-f.]

    8. Let G be a group; for fixed element x ? G, let Gx = {a?G:ax = xa} show that Gx is a subgroup of G for all x ? G.

      --- Content provided by‌ FirstRanker.com ---

    9. Determine the generating function of the numeric function ar where (i) ar = 3r +4r+1, r=0 (ii) ar =5, r=0

www.FirstRanker.com

--- Content provided by​ FirstRanker.com ---

SECTION - C

  1. Attempt any two parts of the following questions: 2 x 15 = 30

      1. Show that A?(BnC)=(A?B)n(A?C) Using Venn Diagram.

      2. Show that whether the relation (x, y) ? R, if x= y defined on the set of positive integer is partial order relation.

        --- Content provided by FirstRanker.com ---

      1. Consider an algebraic system (G,*) where G is the set of all non-zero real numbers and * is a binary operation defined by a*b= ab/4 show that (G,*) is an abelian group.

      2. Prove that if H1 and H2 are two subgroups of G, then H1nH2 is also a subgroup.

        --- Content provided by​ FirstRanker.com ---

      1. State and prove Hand Shaking Lemma.

      2. Show that maximum number of edges in a simple graph with n vertices is n(n-1)/2

        --- Content provided by⁠ FirstRanker.com ---


--- Content provided by‍ FirstRanker.com ---


This download link is referred from the post: AKTU B-Tech Last 10 Years 2010-2020 Previous Question Papers || Dr. A.P.J. Abdul Kalam Technical University