Scribd
Upload
29 views2 pages

Gujarat Technological University

This document contains instructions and questions for an exam on basic mathematics. It includes 5 questions covering topics like sets, logic, relations, functions, graphs and trees. Students are asked to perform operations on sets, prove logical statements, identify relations, perform function compositions, draw graphs and trees, and describe graph and tree traversals. They are provided 70 minutes to complete the exam.

Uploaded by

Mukesh Bhambhani
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
29 views2 pages

Gujarat Technological University

This document contains instructions and questions for an exam on basic mathematics. It includes 5 questions covering topics like sets, logic, relations, functions, graphs and trees. Students are asked to perform operations on sets, prove logical statements, identify relations, perform function compositions, draw graphs and trees, and describe graph and tree traversals. They are provided 70 minutes to complete the exam.

Uploaded by

Mukesh Bhambhani
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

Seat No.: ________ Enrolment No.

___________

GUJARAT TECHNOLOGICAL UNIVERSITY


MCA - SEMESTER– III EXAMINATION – WINTER - 2017

Subject Code: 3630001 Date: 30-12-2017


Subject Name: Basic Mathematics
Time: 10:30 am to 01:00 pm Total Marks: 70
Instructions:
1. Attempt all questions.
2. Make suitable assumptions wherever necessary.
3. Figures to the right indicate full marks.

Q.1 (a) Let U = {a,b,c,d,e,f,g,h,p,q,r} 07


X = {a,b,c,d,e}
Y = {c,d,e,f,g,h}
Z = {h,p,q,r}
Compute, XY, YZX, X-(YZ), (XY)’, X’, X’Y’, XΔY, using Venn
Diagram. (Note: XΔY = (X-Y)(Y-X)
(b) Define Tautology and Contradiction with examples. Prove that P(PQ) is 07
tautology without constructing truth table.

Q.2 (a) 0 0 1 1 0 1 07
Let A = [1 0 1] and B = [1 1 0]
0 1 1 0 0 1
Compute, AB, AB, AT, BT ,AʘB
(b) Let X = {1,2,3,4} R={<x,y> | x>y}. Draw a graph of R and also give its matrix. 07
Check whether the given relation an equivalence relation?
OR
(b) (1) Write a statement in English corresponding to the following symbolic 04
statements:
P(x) : x is integer
Q(x) : x is a rational number
R(x) : x is prime integer
1) P(5)
2) ∀x ~P(x)
3) Ǝx R(x)
4) Ǝx ~Q(x)

(2) Use a truth table to determine whether the following statement form is valid:
pq 03
pr
therefore, p  q r

Q.3 (a) Let X={ball, bed, dog, let, egg} and let the relation R be given as: R={<x,y> | x,y 07
X  xRy, if x and y contain some common letters.}
Identify a relation. Draw a graph for R and find maximal compatibility block for
the same.
(b) Let X={2,3,6,12,24,36} and the relation ≤ be such that x≤y if x divides y. draw 07
the Hasse Diagram of < x,≤ >.
OR
Q.3 (a) Let X={1,2,3}, f,g,h and s be function X to X given as 07
1
f = {<1,2>, <2,3>, <3,1>}
g = {<1,2>, <2,1>, <3,3>}
h = {<1,1>, <2,2>, <3,1>}
s = {<1,1>, <2,2>, <3,3>}
Find f·h·g, g·s, s·s, f·g, g·f
Are functions s and f invertible?
(b) Prove that : A(BC) ≡ (AB)  (AC) 07

Q.4 (a) Show that, n<2n 07


(b) Draw a flow chart to calculate n! using recursive procedure. 07
OR
Q.4 (a) (1) What is a relation? Give the properties of relation with a suitable example. 04

(2) Give example of relation which is both symmetric and anti-symmetric.


03
Q.4 (b) (1) Given S = {2,a,{3},4} 05
R = {{a}, 3, 4, 1} indicate whether the following are true or false:
1) {a}  S
2) {a,4,{3}}  S
3) R = S
4)  R
5)  {{3},4}
(2) Give the power set of the following: {x,y,z}
02

Q.5 (a) Define sub-graph. Find all sub-graphs for the given graph. 07

(b) Draw di-graph and find in-degree and out-degree of each vertex from the given 07
adjacency matrix. Use adjacency matrix, find total no. of path of length 1 and 2
between each vertex.
1 1 1
A =[1 1 1]
1 1 1
OR
Q.5 (a) Define Tree. Draw a graph of tree represented by : 07
(A(B(C(D)(E))(F(G)(H(J))))(K(L)(M(N)(P(Q)(R)))))
Obtain a binary tree corresponding to it.
(b) On a tree in the above question, perform the following traversals: 07
1. Pre-order traversal
2. Post-order traversal
3. In-order traversal

***********

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