Discrete Structure and Optimization MCA paper Nov 2021

  • Subject Code: - PGCA 1917
  • Subject Name: - Discrete Structure and Optimization
  • Date of Examination: - Nov 2021
  • Class: - MCA 1st
  • Exam Mode: - Online

Instructions to Candidates

  1. Attempt any FIVE question(s), each question carries 14 marks.

QUESTIONS

    1. Prove the following : X ∩ (Y ⋃ Z) = (X ∩ Y) ⋃ (X ∩ Z)
    2. How many symmetric relations will there be on a set of three elements?
    2.
  2. Investigate the function f (x) = x2 + 3x + 2 for increasing and decreasing function in its entire domain.
    3.
  3. Prove that the set {0,1,2} forms a field with respect to addition and multiplication modulo 3.
    4.
    1. Simplify the following Boolean functions using the Karnaugh map: F = x'y'z' + x'yz' + xyz' + xy' z'
    2. Find the number of diagonals of a polygon having n sides.
    5.
  5. Prove that every group of prime order is cyclic.
    6.
    1. In how many ways can 5 boys and 5 girls be arranged in a round table so that 2 girls are not seated together?
    2. Solve the following recurrence relations: ar = 6ar–1 – 8ar–2, given that a0 = 4 and a1 = 10
    7.
  7. Prove that in a graph G the number of vertices having an odd degree is always even.
    8.
    1. A graph G is disconnected if and only if its vertex set V is partitioned into two nonempty, disjoint subsets V1 and V2 such that there exists no edge in G whose one end vertex is in V1 and the other is in V2.
    2. Define a regular graph and a complete graph. Draw a regular graph that is also complete.
    9.

ANSWERS:

Q1.

Top

Comments

Post a Comment

Popular posts from this blog

Discrete Structures & Optimization MCA paper Dec 2020

Image
Subject Code : - PGCA 1917 Subject Name : - Discrete Structures & Optimization Date of Examination : - December 2020 Class : - MCA 1st Instructions to Candidates Section A   is Compulsory consisting of TEN questions carrying TWO marks each. Section B & C have FOUR questions each. Attempt any FIVE questions from SECTION B & C carrying TEN marks each. Select at least TWO questions from SECTION B & C SECTION-A What are ordered pairs? Write the concept of Hashing Functions? Discuss rings in discrete structure. What is meant by isomorphic in graph theory? Give an example of a Finite graph. Write about the principle of Inclusion. Define an undirected graph. What is the Indegree of the graph? What is the use of the Karnaugh Map? What do you mean by chromatic number? SECTION-B Give the properties of relations and functions? Prove that a graph G with e=v-1 that has no circuit is a tree. How eulerian chains and cycles are related to a connected graph? Let ...
Read more

Advanced Database Management System MCA Paper Dec 2020

Image
Subject Code : - PGCA 1953 Subject Name : - Advanced Database Management System Date of Examination : - December 2020 Class : - MCA 1st Instructions to Candidates Section A  is Compulsory consisting of TEN questions carrying TWO marks each. Section B & C  have FOUR questions each. Attempt any FIVE questions from  SECTION B & C  carrying TEN marks each. Select at least TWO questions from  SECTION B & C SECTION-A What do you mean by redundancy & how can it be avoided? What is the difference between the strong entity and weak entity set? Discuss the four data allocation strategies in the case of Distributed Databases. What is Relational Calculus? What is a NoSQL database? List any 2 NoSQL databases. Differentiate between a super key and a candidate key. What is Multivalve dependence? What is Spatial Database? Differentiate between 2-tier and 3-tier client-server architecture of database systems. List the different activities of a Database Administra...
Read more