Scribd
Upload
20 views6 pages

EMTH136

The document outlines the structure and instructions for the EMTH136 Discrete Structures exam, which consists of 20 multiple choice questions and 6 descriptive questions divided into four sections. Each section has specific time limits and rules regarding navigation and answer submission, including the requirement to scan and upload answers immediately. The exam is proctored, requiring permissions for location and camera usage, and is recorded throughout the duration.

Uploaded by

cap0anuj
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
20 views6 pages

EMTH136

The document outlines the structure and instructions for the EMTH136 Discrete Structures exam, which consists of 20 multiple choice questions and 6 descriptive questions divided into four sections. Each section has specific time limits and rules regarding navigation and answer submission, including the requirement to scan and upload answers immediately. The exam is proctored, requiring permissions for location and camera usage, and is recorded throughout the duration.

Uploaded by

cap0anuj
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/ 6

COURSE CODE: EMTH136

COURSE NAME: DISCRETE STRUCTURES


Time Allowed: 02:00 hrs. Max. Marks: 70

Read all the instructions carefully

1. There are 20 multiple choice and 3 descriptive questions in this exam.


2. Section - 1: contain(s) 20 question(s) and each question carries 2 mark(s). Each question in this
section has a time limit of 2 minutes. Once you go to next question, you can never come back to
the previously seen question in this section.
3. Section - 2: contain(s) 2 descriptive question(s) and each question carries 10 mark(s). Attempt any
1 question within 26 minutes in this section. You can navigate between the 2 questions in this
section.
4. Section - 3: contain(s) 2 descriptive question(s) and each question carries 10 mark(s). Attempt any
1 question within 27 minutes in this section. You can navigate between the 2 questions in this
section.
5. Section - 4: contain(s) 2 descriptive question(s) and each question carries 10 mark(s). Attempt any
1 question within 27 minutes in this section. You can navigate between the 2 questions in this
section.
6. You can skip a question if you do not know the answer by clicking on the Next button.
7. A correctly answered question will score the allocated mark.
8. Skipping a question without answering will result in 0 marks for that question
9. The entire exam is recorded along with all your actions during the exam.
10. Do not try to leave the test window during the exam.
11. Since this is a proctored exam, you will have to provide permissions to share your location,
webcam, microphone (and screen if the proctor demands).
12. Make sure to use the latest Chrome browser on Android, Windows, Linux, Mac OS. For iOS
devices, use only Safari browser.
Instructions for DESCRIPTIVE questions requiring SCAN & UPLOAD
13. Make sure to upload your scans immediately after you answer every question. Do NOT wait till the
end to avoid panic at the end.
14. The exam time is inclusive of time for scanning & uploading answers.
15. If using laptop + mobile for the exam, click on Open Test on laptop and click on Scan & Upload
on mobile.
16. If using laptop + mobile for the exam, when scanning and uploading from mobile, ensure that the
correct question is open on the laptop.
17. When clicking on Camera button on a smart phone for scanning and uploading, you have 2
camera applications available to scan the answer: your phone's native camera and an alternative
Low Memory Camera. Click on the Low Memory Camera in case your browser shows an error
due to low memory.
18. If you are using only mobile phone to take the exam, then click on “Open Test” button to start the
exam and click on "Camera" button under each question to scan the answer sheets.
Click Finish only after completion of the Exam.

Page | 1
Section 1: Attempt All the Questions
1. What will be the output (Truth values) of compound proposition (p → q) → (q → p) for the input truth
values T, T of p and T, F of q?

A. T, F
B. F, T
C. T, T
D. F, F

2. A compound proposition that is neither a tautology nor a contradiction is called ___________

A. Contingency
B. Equivalence
C. Condition
D. Inference

3. Which one of the following compound propositions is the logical equivalent to the ¬(p → q)?

p ∧ ¬q
p∧q
A.
B.
C. p→q
D. q→p

4. Which one of the following is the logical equivalent to the p ∨ (p ∧ q)?

A. p
B. q
C. ¬p
D. ¬q

5. The Converse of the statement “If you are lucky, then you will get a ticket.”

A. If you are lucky then you will get a ticket.


B. If you are not lucky then you will not get a ticket.
C. If you will get a ticket then you are lucky.
D. If you are respected then you are honest.

6. The contapositive of the statement “If you are honest, then you are respected.”

A. If you are honest then he is not respected.


B. If you are not respected then you are not honest.
C. If you are not honest then you are not respected.
D. If you are respected then you are honest.

7. Which one of the following is a proposition?

A. How are you?


B. What time is it?
C. India is in Europe.
D. 4+x=10

8. What will be the Truth values of the statement p ↔ ¬p for the Truth values T, F of p?
A. T, F
B. F, T
C. T, T
D. F,F

Page | 2
9. Two graphs are said to be isomorphic if
A. Only the number of vertices in both graphs are equal
B. Only the number of edges in both graphs are equal
C. Only the number of the degree sequences in both graphs are equal
D. There exists a one to one on to edge-preserving mapping vertices set of both the graphs

10. A graph that contains multiple edges between any pair of different vertices is called___
A. a simple graph
B. a multigraph
C. a loop
D. a Pseudo graph

11. A graph that contains a single edge between every pair of different vertices is called___
A. a simple graph
B. a multigraph
C. a loop
D. a Pseudo graph

12. Which of the following is true?


A. A graph may contain no edges but at least one vertex
B. A graph may contain many edges and no vertices
C. A graph may contain no edges and no vertices
D. A graph may contain no vertex but at least one edge

13. Let G be a connected planar simple graph with 10 edges and 7 vertices then the total
number of bounded regions in a planar representation of G?
A. 5
B. 6
C. 7
D. 8

14. Consider the following weighted graph then which edge can be chosen very first to draw
the minimum spanning tree by Prim’s algorithm.

A. Edge c-d
B. Edge a-b
C. Edge a-e
D. Edge b-d

15. Consider the following weighted graph then which edge can be chosen very first to draw
the minimum spanning tree by Prim’s algorithm.

Page | 3
A. Edge e-f
B. Edge a-d
C. Edge h-i
D. Edge c-f

16. The following graph becomes the minimum spanning tree if__?

A. Edge c-b can be removed


B. Edge d-b can be removed
C. Edge d-e can be removed
D. Edge e-f can be removed

17. The weight of the minimum spanning tree in the following graph

A. 40
B. 50
C. 60
D. 70

18. Consider the following rooted tree then what is the root node?

A. Node a
B. Node u
C. Node b
D. Node c
19. Let T be a full 3-ary tree with 3 internal vertices then the total number of vertices in T is
____?
A. 10
B. 5
C. 6
D. 7

Page | 4
20. Which of the following graphs is/are trees?

A. Only A
B. Only B
C. Both A and B
D. Neither A nor B

Section 2: Attempt any one question out of two


1. Make a truth table for the compound statement A→ (A→ B). If A→ (A→ B) is false, then what

Define a Tautology. Check whether (a ∧ b) → (F) is a tautology.


are the truth values of A, B?
2.
Section 3: Attempt any one question out of two
1. Check whether C 3and K 3 are isomorphic? Here C3 denotes the cycle graph of three
vertices and K 3 denotes the complete graph of 3 vertices.
2. Find the in-degree and out-degree of all the vertices in the following graph.

Section 4: Attempt any one question out of two


1. Find the minimum spanning tree corresponding to the following graph using Kruskal’s
algorithm.

Page | 5
2. Answer the following questions based on the tree given below

(a) Find the root node (vertex).


(b) Identify the parent of h .
(c) Identify the siblings of q .
(d) Which are the internal vertices?
(e) Which are the leaves?

------------------------------END OF QUESTION PAPER--------------------------------------

Page | 6

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