Docsity
Docsity

Prepare for your exams
Prepare for your exams

Study with the several resources on Docsity


Earn points to download
Earn points to download

Earn points by helping other students or get them with a premium plan


Guidelines and tips
Guidelines and tips

Quiz 5 in COT3100: Reflexive Relations, Quizzes of Computer Science

Information about quiz 5 in the cot3100 course, which covers reflexive relations. Students are required to attend office hours to submit their solutions during specified hours. The quiz consists of proving or disproving the reflexivity of various relations (r ∪ s, r ∩ s, r − s, and s ◦ r).

Typology: Quizzes

Pre 2010

Uploaded on 09/17/2009

koofers-user-nge
koofers-user-nge 🇺🇸

10 documents

1 / 1

Toggle sidebar

Related documents


Partial preview of the text

Download Quiz 5 in COT3100: Reflexive Relations and more Quizzes Computer Science in PDF only on Docsity! COT3100 Quiz 5 April 22, 2009 Name: This quiz is due Thursday afternoon between 1pm and 4pm. Both Young In and Bo will have extra office hours in E309 CSE building on Thursday from 1pm to 4pm, and you must turn in your solutions during TAs’ office hours. Print out this page and turn it in to the TAs. Put your name and solutions clearly on this page (and back if necessary). There are 10 points for this quiz. Problem 1 (10 pts) Suppose that R and S are reflexive relations on a set A Prove or disprove each of the following statements. 1. R ∪ S is reflexive. 2. R ∩ S is reflexive. 3. R− S is irreflexive1. 4. S ◦R is reflexive (i.e., the composition of R and S is reflexive). 1A relation R on a set A is irreflexive if for every a ∈ A, (a, a) /∈ R. 1
Docsity logo



Copyright © 2024 Ladybird Srl - Via Leonardo da Vinci 16, 10126, Torino, Italy - VAT 10816460017 - All rights reserved