0% found this document useful (0 votes)
10 views2 pages

Marh 3

This document is an examination paper for a B.Tech Mathematics III course, detailing various mathematical problems across five units. Topics include logical formulas, set theory, combinatorics, recurrence relations, and graph theory. Each unit contains multiple questions that require problem-solving and theoretical understanding in mathematics.

Uploaded by

vakademahadev206
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
0% found this document useful (0 votes)
10 views2 pages

Marh 3

This document is an examination paper for a B.Tech Mathematics III course, detailing various mathematical problems across five units. Topics include logical formulas, set theory, combinatorics, recurrence relations, and graph theory. Each unit contains multiple questions that require problem-solving and theoretical understanding in mathematics.

Uploaded by

vakademahadev206
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

Search

0 ratings · 56 views · 2 pages


Mathematical Foundations of
Computer Science July 2023
Read more Type yo

Download
Type your text

Type your text

Code No: R2021054 R20 SET - 1


V IL A S R A O D E S H M U K H F O U N D A T IO N
D R B A B A S A HE B A M B E D K A R T EC HN OLOGY U N IV E R S IT Y, L ON E R E
R E G U L A R A N D S E M IS T E R E X A M IN A T ION -2 0 25
Course: B TECH Semister: IV
Branch : Electrical Engineering
Time: 3 hours Max. Marks: 70

DATE : 11/08/2025 Subject Name: MATHMATICS. III

Type your text


UNIT.I
1 a) Obtain POS of the following formulas [7M]
(i)(P ΛQ ΛR) V (~P ΛRΛQ) V(~P Λ~Q Λ~R)
b) Express the following statements using quantifiers. Then construct the negation [7M]
of the statement i) Every bird can fly ii) Some birds can talk
Or
2 a) Define well formed formula? Write in brief about well defined formulas. [7M]
b) Obtain POS of the following formulas: [7M]
(i)(P ΛQ ΛR) V (~P ΛRΛQ) V(~P Λ~Q Λ~R) (ii) PV(~P→(QV(~Q→R)))
UNIT-II
3 a) For any two sets A and B Prove the following Identity A-(A∩B) = A-B [7M]
b) Let A=(6,12,18,24,36,72), a ≤ b if and only if a divides b. Draw Hasse diagram [7M]
for it and prove that it is a lattice, but not a distributive lattice.
Or
4 a) If A={1,2,3,4} and P={{1,2},{3},{4}} is a partition of A. Find the equivalence [7M]
relation determined by P.
b) Draw the Hasse diagram for X={2,3,6,24,36,48} and relation ≤ be such that x≤y, [7M]
if x divides y
UNIT-III
5 a) A group of 8 scientists is composed of 5-psychologists and 3-sociologists, in [7M]
how many ways can a committee of 5 be formed that has 3- psychologists and 2-
sociologists.
b) How many ways can we distribute 14 indistinguishable balls in 4 numbered [7M]
boxes so that each box is non empty?
Or
6 a) Find the number of arrangements of the letters of MISSISSIPPI . [7M]
b) Out of 12 employees a group of four trainees is to be sent for software testing [7M]
and QA training of one month. (i) In how many ways a group of the four
employees be selected? (ii) what if there are two employees who refuse to go
together for training

1 of 2

|''|''|||''|'''|||'|

Ad Download to read ad-free

Code No: R2021054 R20 SET - 1

UNIT-IV
7 a) Solve the recurrence relation an-7an-1+12an-2 =0 for n≥2 where a0=1, a1=2. [7M]
b) Solve the recurrence relation using generating function an-6an-1=0 for n≥1 [7M]
wherea0=1.
Or
8 a) Find the general expression for a solution to the recurrence relation [7M]
an-5an-1+6an-2 =n(n-1) for n≥2
b) What is an nth order linear homogenous recurrence relation with constant [7M]
coefficients? Give examples.
UNIT-V
9 a) Draw binary search tree for the list : 2,1,5,6,8,9,7,3,4. [7M]
b) Find the chromatic number of the following i) Cn ii) Kn iii) Km,n [7M]

Or
10 a) Discuss in brief about BFS and DFS of a graph. [7M]
b) State and prove Euler’s formula for a plane connected graph. [7M]

2 of 2

|''|''|||''|'''|||'|

Share this document

You might also like


PDF No ratings yet
That Time I Got Reincarnated As
A Slime, Vol. 10

456 pages

PDF No ratings yet


Mathematical Foundations of
Computer Science Question
Paper
1 page

PDF No ratings yet


B.Tech II Year I Semester (R15)
Regular Examinations
November/December 2016
17 pages

PDF No ratings yet


New Microsoft Word Document

21 pages

PDF 100% (1)


r059210502 Mathematical
Foundation of Computer Science

11 pages

PDF No ratings yet


R.V. College of Engineering,
Bangalore

4 pages

PDF No ratings yet


Honda Hornet 2.0 - Owner's
Manual

1 page

PDF No ratings yet


(DMGT) Question Bank Answers

3 pages

PDF No ratings yet


Mathematical Foundation of
Computer Science Jan2007
r059210502
10 pages

PDF No ratings yet


AC65

3 pages

PDF No ratings yet


Mathematical Foundations of
Computer Science March 2021

5 pages

PDF 100% (1)


Download

47 pages

Show more

About Support
About Scribd, Inc. Help / FAQ

Everand: Ebooks & Accessibility


We and our 10 IAB TCF partners store and access
Audiobooks
Purchase
information on your device for the followinghelp
SlideShare
purposes: store and/or access information on a
AdChoices
device, advertising and content measurement,
Join our team!
audience research, and services development,
Contact usadvertising, and personalised
personalised Social content.
Personal data may be processed to do the following:
Instagram
use precise geolocation data and actively scan
Legal
Facebook
device characteristics for identification. Our third
Terms
party IAB TCF partners may store and access
information on your device such as IP Pinterest
address and
Privacy
device characteristics. Our IAB TCF Partners may
process this personal data on the basis of legitimate
Copyright
interest, or with your consent. You may change or
Cookie Preferences
withdraw your preferences at any time by clicking on
the
Docookie icon
not sell ororshare
link; however,
my as a consequence,
you may not information
personal see relevant ads or personalized content.
Our website may use these cookies to:
Measure the audience of the advertising on
Get our free
our website, apps
without profiling
Display personalized ads based on your
navigation and your profile
Personalize our editorial content based on
your navigation
Allow you to share content on social networks
Documents
or platforms present on our website
Send you advertising based on your location
We take content rights seriously. Learn more in our FAQs
or report
Privacy infringement here.
Policy
Third Parties
Language: English
Copyright © Customize Your Choices
2025 Scribd Inc.

Overview AcceptFind
All in PDF Rela

Continue Without Accepting


Download

You might also like