This document contains the questions from a Discrete Computational Structure exam given in September 2016. It has two parts:
Part A contains 4 multiple choice questions asking students to find intersections of sets, compose relations, define partially ordered sets, and list sublattices.
Part B contains 2 longer form questions, asking students to show that a given relation is an equivalence relation, draw its graph, and draw a diagram of a partially ordered set defined by set inclusion and define the meet and join operations.
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
0 ratings0% found this document useful (0 votes)
46 views1 page
CS201 Model
This document contains the questions from a Discrete Computational Structure exam given in September 2016. It has two parts:
Part A contains 4 multiple choice questions asking students to find intersections of sets, compose relations, define partially ordered sets, and list sublattices.
Part B contains 2 longer form questions, asking students to show that a given relation is an equivalence relation, draw its graph, and draw a diagram of a partially ordered set defined by set inclusion and define the meet and join operations.
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/ 1
COLLEGE OF ENGINEERING, CHERTHALA
FIRST SERIES EXAMINATION SEPTEMBER 2016
CS201 : Discrete Computational Structure
Time:2hrs Maximum Marks:40
PART A (Answer all questions and each carries 5 marks)
1. Given A = {x|x is an integer and 1 x 15}, B = {3, 4, 5, 15, 17} and C =
{1, 2, 3, ...}, f ind A B, A C, and A (B C) Draw the Venn Diagrams also. 2. Let R and S are the two relations on set A = {1, 2, 3....10} R = {hx, 2xi |x A} and S = {hx, yi |y is an integer such that y%3 = 1} Find R S, R S R and R R1 3. Define a Partially ordered set with an example. Give two HD which are partially ordered set but not lattice. 4. Write all the sublattices of the lattice D24 .
PART B (Answer all questions and each carries 10 marks)
1. Let A = {1, 2, 3....., 10} and R = {hx, yi |x + y is divisible by 3}
Show that R is an equivalence relation. Draw the graph of R. 2. Let the sets S0 , S1 , ......S7 be given by S0 = {a, b, c, d, e, f } S1 = {a, b, c, d, f } S2 = {a, b, d, e, f } S3 = {a, b, c, d} S4 = {a, b, c, d, e, f } S5 = {a, d} S6 = {a, b} S7 = {a} Draw the diagram of hL, i where L = {S0 , S1 , ......S7 } What are the operations of meet and join?