CMPUT272 Lecture Notes - Lecture 18: Binary Relation, Cross Product, Injective Function

36 views3 pages

apricotzebra879

4 Dec 2014

School

University of Alberta

Department

Computing Science

Course

CMPUT272

Professor

Lorna Stewart

For unlimited access to Class Notes, a Class+ subscription is required.

Document Summary

A1 ai i w = y b) a c) ((a, b), c) An n-ary relation on the cross product of n sets is a subset of a1 an. R +)^2 r = {(x, y) | x r, 1r5, 1 n. A binary relation from a to b is a funcion a!bf (a1, _) (a2, _) (there is no other (a2, _) ) (an, _) f: a -> b (a, b) f} Examples of functions: f: {1, 2, 3} -> {p, q} f = {(1,q), (2,q), (3,q)} (ok) f = {(1,p), (2,p), (3,p)} (ok) f = -> -> a1,a2 a1 = a2 aka, a, a1 f(a1) a1,a2 a1 = a2. |a| ba |b| correspondance (aka, bijection, bijective) if. A function f: a -> b is one-to-one f is 1-1 and onto. |a| = |b| if they have the same domain, co-domain, and set of ordered pairs. A function f: a -> b are equal if and only.

Related Questions

3. As seen in Assignment #5 of EECS1520, Excel can be used to simulate physiological processes like thyroxine conversion in the liver. In these simulations the value of the time dependent variables, like the amount of thyroxine in the liver, is often defined using the value of the same variable from an earlier time step. This type of relation where each further term of the sequence is defined as a function of the preceding terms is called: a) backward relation b) Forward relation c) Recurrence relation x d) Bidirectional relation e) None of the above

29. Consider the Cocktail Sort (code 4) algorithm described in the appendix. What is the fewest number of lines of code that would have to be added, removed, or changed in order for this algorithm to sort from largest to smallest? (A) Everything inside the second for loop. (B) 3 (C) 1 (D) 2 (E) Everything inside both for loops. Binary answers For the following questions you are to use your choices as they were the representation of a binary number. More precisely, A = 24, B = 23, C = 22, D = 21, and E = 20 position in a base 2 number. For example if you wanted to answer the number 23, you would translate it first as base 2 number, which is 10111, you would blacken A, C, D and E.2 Lets look at this process on your answer sheet, we have these 5 circle you can blacken. Normally you only pick one, here you might have to blacken more than one! @ ® © D ® Following the previous example, the answer we want to input is 23, its binary representation is 10111, hence the circle you would blacken are the following:

34. Which line of code would you add to the Graph.java (code 5) on line 18 to pick two random nodes from your array of nodes? These will then be connected to each other. N.B. Math.random() returns a real number (double) between 0 and 1. (A) GraphNode nodel = graph[ (int) (Math.random() *n)]; GraphNode node2 = graph[ (int) (Math.random() *n)]; (B) GraphNode nodel = graph[ (int) Math.random() *n); GraphNode node2 = graph [ (int) Math.random() *n); (C) GraphNode nodel = graph [Math.random() *n]; GraphNode node2 = graph [Math.random() *n]; (D) int pos = (int) Math.random() *n; GraphNode nodel = graph [pos]; GraphNode node2 = graph [pos]; (E) int pos = (int) (Math.random() *n); GraphNode nodel = graph [pos]; GraphNode node2 = graph [pos];

CMPUT272 Lecture Notes - Lecture 18: Binary Relation, Cross Product, Injective Function

Document Summary

Get access

Related Documents

CMPUT272 Lecture Notes - Lecture 20: Coimage, Cross Product, Binary Relation

CMPUT272 Lecture Notes - Lecture 4: Codomain, Boolean Expression, Boolean Function

CMPUT272 Lecture Notes - Lecture 1: Royal Institute Of Technology, Brix, Injective Function

Related Questions