Scribd Logo
Upload

Welcome to Scribd!

  • 48 views

    A23ah MFCS R15

    Uploaded by

    J.vamshi Krishna
    This document contains the questions from a supplementary exam for a B.Tech II Year I Semester course in Mathematical Foundations of Computer Science. It has two parts, with Part A containing 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 10 marks each, with each question covering material from one of the 6 units of the course. The questions test concepts like logical equivalences, relations, groups, permutations, recurrence relations, graph algorithms, and graph isomorphism.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd

    A23ah MFCS R15

    Uploaded by

    J.vamshi Krishna
    48 views2 pages
    This document contains the questions from a supplementary exam for a B.Tech II Year I Semester course in Mathematical Foundations of Computer Science. It has two parts, with Part A containing 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 10 marks each, with each question covering material from one of the 6 units of the course. The questions test concepts like logical equivalences, relations, groups, permutations, recurrence relations, graph algorithms, and graph isomorphism.

    Original Title

    A23AH-MFCS-R15

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    This document contains the questions from a supplementary exam for a B.Tech II Year I Semester course in Mathematical Foundations of Computer Science. It has two parts, with Part A containing 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 10 marks each, with each question covering material from one of the 6 units of the course. The questions test concepts like logical equivalences, relations, groups, permutations, recurrence relations, graph algorithms, and graph isomorphism.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    48 views2 pages

    A23ah MFCS R15

    Uploaded by

    J.vamshi Krishna
    This document contains the questions from a supplementary exam for a B.Tech II Year I Semester course in Mathematical Foundations of Computer Science. It has two parts, with Part A containing 10 short answer questions worth 2 marks each. Part B contains 5 long answer questions worth 10 marks each, with each question covering material from one of the 6 units of the course. The questions test concepts like logical equivalences, relations, groups, permutations, recurrence relations, graph algorithms, and graph isomorphism.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Download as pdf or txt
    You are on page 1of 2

    R 15

    Code No: A23AH


    B V R AJ U IN S T IT U T E O F T E C H N O L O G Y , N AR S A P U R
    (UGC - AUTONOMOUS)
    B.Tech II Year I Semester Supplementary Examinations, Feb 2022
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
    (COMMON TO CSE & IT)
    Time: 3 Hours Max Marks: 70
    Note: This Question Paper contains two Parts A and B
    Part A is compulsory which carries 20 marks. Answer all questions in Part A at one place only.
    Part B Consists of 10 questions. Answer any five (one full question from each unit). Each question
    carries10 marks and may have a, b, c as sub questions.
    PART – A (10x2 = 20 Marks)
    1. a) Define Tautology and give one example. 2M BL1 CO1
    b) Give Description on free and bound variables. 2M BL1 CO1
    c) What is an equivalence relation? 2M BL1 CO2
    d) R:A→A and given A={1,2,3,4} R={(1,2),(2,3),(4,2),(3,3),(1,1)} find inverse relation of R.
    2M BL3 CO2
    e) Define Group and Sub group with examples. 2M BL1 CO3
    f) Discuss the relations in fuzzy sets. 2M BL1 CO3
    g) How many different strings of length 4 can be formed using the letters of the word FLOWER?
    2M BL3 CO4
    h) Describe the Principles of Inclusion – Exclusion. 2M BL1 CO4
    i) Define the Isomorphism with example. 2M BL1 CO6
    j)Define Hamiltonian Multi Graphs with example. 2M BL1 CO6
    PART – B (5x10 = 50 Marks)
    2. a).Prove the logical equivalences for following:
    i)(¬PΛ(¬QΛR))V(QΛR)V(PΛR) ⇔R 4M BL5 CO1
    ii) ¬(PΛQ)→ (¬PV(¬PVQ) ⇔(¬PVQ). 3M BL5 CO1
    b) Explain the terms of Tautological equivalence, Duality Law with suitable examples?
    3M BL2 CO1
    OR
    3. a) Find the principal disjunctive normal form of P→{(P→Q) Λ¬ (¬QV¬P)} 5M BL3 CO1
    b) Prove or disprove using rules of inference. 5M BL5 CO1
    • Duke is a Labrador retriever.
    • All Labrador retriever like to swim
    • Therefore Duke likes to swim.
    ***
    4. a) Define the relation ⊂ on Z × Z by (a, b) ⊂ (c, d) if and only if a ≤ c and b ≤ d. Then
    i) Prove that ⊂ is a partial ordering but not a total ordering. 3M BL5 CO2
    ii) Prove that ⊂ is a lattice ordering on Z × Z. 3M BL5 CO2
    b) Let A={1,2,3,4} and R={(1,1),(1,2),(2,1),(2,2),(3,4),(4,3),(3,3),(4,4)}
    be relation on A. Verify whether R is an equivalence relation 4M BL3 CO2

    OR
    5. a) Determine whether the relation is reflexive, symmetric, anti-symmetric and transitive.
    Let A={1,2,3,4} and R={(1,1),(1,2),(1,3),(2,3) ,(3,1),(2,4) (4,4)}
    find whether R is equivalent? If yes find the partition of A induced by R. 6M BL1 CO2
    b) Draw the Hasse diagram representing the partial ordering {(a, b)| a divides b} on
    { 2, 3, 6, 12, 24, 36 }. 4M BL3 CO2
    ***
    6 a) If o is an operation on Z defined by x o y=x+y+2 prove that ( z, o) is an abelian group .
    5M BL5 CO3
    b) Describe the Operations and applications on Fuzzy Sets 5M BL2 CO3
    OR
    7.a) Prove that G={1,2,3,4,5,6,7} is a finite abelian group of order 7 under multiplication modulo 8.
    4M BL5 CO3
    b) Define fuzzy set and Applications of Fuzzy Set Theory 6M BL2 CO3
    ***
    8. a) Find the number of distinguishable permutations of the letters in the words:
    i) STRUCTURES ii) ENGINEERING 6M BL3 CO4
    b) Define Pigeonhole Principles and its Application. 4M BL1 CO4
    OR
    9. a) Solve the recurrence relation by substitution method an = an-1 + n, n ≥ 1 where ao = 2.
    5M BL3 CO3
    b) Find a generating function for the recurrence relation an+2 - 3an+1+2an=0, n≥0, and a0=1,a1=6.
    Hence solve the relation. 5M BL3 CO3

    ***
    10. a) Using Prims algorithm find a minimal spanning tree for the weighted graph given below:
    6M BL3 CO5

    b) Write an algorithm for BFS with example 4M BL2 CO5

    OR
    11. a) Define isomorphism Show that the following graphs are Isomorphic 6M BL1,2 CO6

    b) Discuss about Eulerian graph with example. 4M BL2 CO6

    ***

    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