Scribd
Upload
213 views13 pages

Uid: Final Assignment: CSE 173: Due On Thursday: 04-06-2020

(1) The document provides instructions for a final assignment in CSE 173 that is due on April 6, 2020. It outlines guidelines for answering, submitting, and citing sources for the assignment. (2) The assignment contains 12 questions worth 5 marks each, totaling 60 marks. The questions cover topics like equivalence relations, graph theory, number theory, logic, and predicates. (3) Students are required to show their work, sign and date a code of honor pledge, and submit scanned answer sheets.

Uploaded by

Mashrur Rahman
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
213 views13 pages

Uid: Final Assignment: CSE 173: Due On Thursday: 04-06-2020

(1) The document provides instructions for a final assignment in CSE 173 that is due on April 6, 2020. It outlines guidelines for answering, submitting, and citing sources for the assignment. (2) The assignment contains 12 questions worth 5 marks each, totaling 60 marks. The questions cover topics like equivalence relations, graph theory, number theory, logic, and predicates. (3) Students are required to show their work, sign and date a code of honor pledge, and submit scanned answer sheets.

Uploaded by

Mashrur Rahman
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/ 13

UID: Final Assignment: CSE 173

Name: Due on Thursday: 04-06-2020

Answering Guideline

1. Print this file and write your answer on the printed paper, scan the answer script and
submit the scanned version. Add extra pages when the printed space is not sufficient.

2. You may consult textbooks and online sources. However, for online sources, make
sure they are authentic sources, such as they are from journal papers, conference
papers or technical notes from well-known companies (GE, ABB, etc.). If you give
online references, please mention the sources.

3. It is not allowed to consult with any person who has knowledge of this subject, including
other students of this course. You may ask question to the instructor if you do not
understand the question, but not more than that. All solutions have to be your own
work.

4. You must show all work for each problem to receive full credit.

CODE OF HONOR PLEDGE

I pledge on my honor that I have not given or received any unauthorized


assistance on this assignment.

__________________________
Signature

__________________________
Date

Page 1 of 13
Answer all the questions Marks: 12×5=60

1. Which relation on the set {1, 2, 3, 4} is an equivalence relation and contain {(1, 2), (2, 5
3), (2, 4), (3, 1)}.

Page 2 of 13
2. Find the transitive closures of the relation {(1, 1), (1,4), (2,1), (2,3), (3,1), (3, 2), (3,4), 5
(4, 2)} on the set {1, 2, 3, 4}.

Page 3 of 13
3. Prove by induction that 1 · 2 + 2 · 3+· · ·+n(n + 1) = n(n + 1)(n + 2)/3. 5

Page 4 of 13
4. Give a recursive definition of the set of positive integers not divisible by 5. 5

Page 5 of 13
5. What is the relationship between the sum of the degrees of the vertices in an 5
undirected graph and the number of edges in this graph? Explain why this
relationship holds.

Page 6 of 13
6. Determine whether the following two graphs are isomorphic. 5

Page 7 of 13
7. Determine whether the following graph has an Euler circuit or an Euler path. Does 5
this graph have a Hamilton Circuit?

Page 8 of 13
8. Prove that if a | b then, for any integer x, a | bx. 5

Page 9 of 13
9. Which pairs of the integers −11, −8, −7, −1, 0, 3, and 17 are congruent modulo 7? 5

Page 10 of 13
10. Show that ￢(p ∧ q) ∨ (￢p ∧ q) ≡ ￢p using rules. 5

Page 11 of 13
11. Show that the following hypothesis lead to the conclusion “If I do not finish writing 5
the program, then I will wake up feeling refreshed”

If you send me an e-mail message, then I will finish writing the program. If you do
not send me an e-mail message, then I will go to sleep early. If I go to sleep early,
then I will wake up feeling refreshed.

Page 12 of 13
12. Give an example of a predicate P(x, y) such that the following two statements are 5
logically equivalent:
xyP( x, y ) and xyP( x, y )

Page 13 of 13

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