Scribd
Upload
58 views

CSIT3 RD Discrete Structures

This document provides the instructions and questions for a Discrete Structures exam. It includes 7 questions worth a total of 60 marks. Students must attempt any 5 questions. The questions cover topics like shortest path algorithms in graphs, logic and inference rules, properties of relations, proofs of validity for logical arguments, solving recurrence relations, tree traversals, and logical quantifiers and implications. Each question includes a rubric describing how marks will be allocated for concepts, declarations, and calculations.

Uploaded by

भुपेन्द्र बोहरा
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
58 views

CSIT3 RD Discrete Structures

This document provides the instructions and questions for a Discrete Structures exam. It includes 7 questions worth a total of 60 marks. Students must attempt any 5 questions. The questions cover topics like shortest path algorithms in graphs, logic and inference rules, properties of relations, proofs of validity for logical arguments, solving recurrence relations, tree traversals, and logical quantifiers and implications. Each question includes a rubric describing how marks will be allocated for concepts, declarations, and calculations.

Uploaded by

भुपेन्द्र बोहरा
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

FAR-WESTERN UNIVERSITY

Semester End Examination-2077


Discrete Structure (CSIT.212)
Faculty : Science and Technology (CSIT)
Level : Undergraduate Full Marks : 60
Semester : Third Time : 4hrs. + 1hr. upload time

k/LIffyL{n] pQ/k'l:tsfsf] lz/df k/LIff ePsf] ldlt, l;Dan gDa/, ljifosf] gfd / sf]8 gDa/ Pjd\ tnlt/ k]h
gDa/ clgjfo{ n]Vg'kg]{ 5 . pQ/k'l:tsf cknf]8 ubf{ kmfO{nsf] gfd cfˆgf] l;Djn gDa/ /fVg' kg]{ 5 .
Read the rubric carefully and answer the questions as required.

Attempt any five questions. 5×12 = 60

1. Find the shortest path between a to z in the following weighted graphs

b 6 d
3 6
1
a 1 2 z
1 3
c e
4
Rubric: Adjacent table (4 marks)
Calculation (4 marks)
Shortest path calculation (4 marks)

2. For the set of premises "If I play hockey, then I am sore the next day." "I use the whirlpool if I am
sore." "I did not use the whirlpool." What relevant conclusion can be drawn? Explain the rules of
inference used to draw the conclusion.

Rubric: Concepts and logic (4 marks)


Correct declaration (4 marks)
Calculation (4 marks)

3. Is the “divides” relation on the set of positive integers transitive? What is reflexive and
symmetric closure of the relation? R = {(a, b) | a > b} on the set of positive integers?

Rubric: Concepts and logic (4 marks)


Correct declaration (4 marks)
Calculation (4 marks)

4. Prove or disprove the validity of argument: "every living thing is a plant or an animal." "Hari's
dog is alive and it is not a plant." "All animals have heart." Hence Hari's dog has heart.

Rubric: Concepts and logic (4 marks)


Correct declaration (4 marks)
Calculation (4 marks)

P.T.O.
5. Find the solutions for
a. Find the solution to an=2an-1+an-2-2an-3 for n≥3 with a0=0 a1=6 and a2=0.
b. Prove that if n is a positive integer, then 133 divides 11n+1 + 122n−1

Rubric: Concepts and logic (4 marks)


Correct declaration (4 marks)
Calculation (4 marks )

6. Discuss the applications of tree and Find the preorder, inorder and postorder traversal of the
following tree
a

b c
f
d e
h
g

Rubric: Application (2 marks)


Each correct traversal order (2 x3=6 marks)
Each correct figure (4 marks)

7. A. What do you understand by the logical quantifiers? How would you represent the following
propositions and their negations using logical quantifiers:
i. There is a lawyer who never tells lies.
ii. All politicians are not honest.
B. What are the inverse, converse and contra positive of the implication "If today is holiday
then I will go for a movie."?

Rubric: For each Statements declaration (1 x6) = 6 marks


For each correct logical representations (1x6) = 6 marks

***

You might also like