Scribd
Upload
5 views3 pages

DSCS QP-Comprehesive

The document outlines the comprehensive examination details for the M. Tech (Software Engineering) course at Birla Institute of Technology & Science, Pilani. It includes the course number, title, exam type, weightage, duration, and a list of nine questions covering topics such as induction proofs, set theory, graph isomorphism, recurrence relations, and algorithms. The exam is open book and requires students to answer all questions, with specific instructions on how to format their answers.

Uploaded by

Everything is Here
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
5 views3 pages

DSCS QP-Comprehesive

The document outlines the comprehensive examination details for the M. Tech (Software Engineering) course at Birla Institute of Technology & Science, Pilani. It includes the course number, title, exam type, weightage, duration, and a list of nine questions covering topics such as induction proofs, set theory, graph isomorphism, recurrence relations, and algorithms. The exam is open book and requires students to answer all questions, with specific instructions on how to format their answers.

Uploaded by

Everything is Here
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Question Paper Pattern is NOT fixed.

The paper is for reference only

Birla Institute of Technology & Science, Pilani


Work Integrated Learning Programmes Division
M. Tech (Software Engineering) at Wipro Technologies (WASE)
Comprehensive Examination

Course Number : SEWP ZC252


Course Title : DISCRETE STRUCTURES FOR COMPUTER SCIENCE
Type of Exam : Open Book No. of Pages: 2
Weightage : 60 % No. of Questions: 9
Duration : 3 Hours
Date of Exam : Session: 9:00 am – 12:00 pm
Note:
1. Please read and follow all the instructions given on the cover page of the answer script.
2. Start each answer from a fresh page. All parts of a question should be answered
consecutively.
Answer All Questions

1. Prove by induction that the sum of the squares of any six consecutive non-negative
integers always leaves a remainder of seven when divided by twelve.
[10]
2. Given arbitrary sets A, B, C, and Y prove the following statement:
[10]
[A  B  Y  C  B ]  [ ((C – A)  B) - ~Y = Y – (A  B) ]
(Note: ~ denotes set complement, thus ~Y is the complement of the set Y.)

3. By using pigeonhole principle, show that if any five numbers from 1 to 8 are chosen,
then two of them will add upto 9.
[5]
4. Determine whether the given pair of graphs is isomorphic. Exhibit an isomorphism or
provide a rigorous argument that none exists.

[5]
5. Solve the recurrence relation: b n=−3 bn −1−2b n−2 , b 1=−2 ,b 2=4. [3]
6. Let C(x) be the statement “x has a cat”, let D(x) be the statement “x has a dog” and let
F(x) be the statement “x has a ferret”. Express each of these statements in terms of C(x),

Page 1 of 3
Question Paper Pattern is NOT fixed. The paper is for reference only

D(x), F(x), quantifiers and logical connectives. Let the universe of discourse consists of all
students in your class.
[5]

a. A student in your class has a cat, a dog, and a ferret.


b. All students in your class have a cat, a dog, or a ferret.
c. Some students in your class have a cat, and a ferret but not a dog.
d. No student in your class has a cat, a dog, and a ferret.
e. For each of the three animals, cats, dogs, and ferrets there is a student in
your class who has one of these animals.
7. a:) What sequence of pseudorandom numbers is generated using the pure multiplicative
generator xn+1=3xn mod 11 with seed x0=2?
[3]

b:) Let m be a positive integer with m>1. Show that the relation R={(a,b)|a ≡ b(mod m)}
is an equivalence relation.
[3]

c:) How many divisions are required to find gcd(12345,54321) using the Euclidean
algorithm?
[3]

8. Use Kruskal’s algorithm to find a minimum spanning tree for the following weighted

graph. [3]
9. In the original Towers of Hanoi problem, add the constraint that no direct moves
between the From peg to the To peg are allowed.
[10]
a. Prove by induction, that following this new rule, will take you through every
legal configuration of the game.
b. Write a recurrence equation for the smallest number of moves it takes to
solve the problem under the new constraint.

Page 2 of 3
Question Paper Pattern is NOT fixed. The paper is for reference only

XXXXXXXXXX

Page 3 of 3

You might also like