Binary Relations (4B) Young Won Lim 5/15/17
|
|
- Wendy Fisher
- 6 years ago
- Views:
Transcription
1 Binry Reltions (4B)
2 Copyright (c) Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version.2 or ny lter version published by the Free Softwre Foundtion; with no Invrint Sections, no Front-Cover Texts, nd no Bck-Cover Texts. A copy of the license is included in the section entitled "GNU Free Documenttion License". Plese send corrections (or suggestions) to youngwlim@hotmil.com. This document ws produced by using OpenOffice nd Octve.
3 Crtesin Product Crtesin product A B of the sets A = { x, y, z } nd B = {, 2, } Reltions (4B)
4 Crtesin Coordintes Crtesin coordintes of exmple points Reltions (4B) 4
5 Reflexive Reltion Exmples Reltions (4B) 5
6 Symmetric Reltion Exmples Reltions (4B) 6
7 Anti-Symmetric Reltion Exmples Reltions (4B) 7
8 Trnsitive Reltion Exmples Reltions (4B) 8
9 Reflexive Reltion x (x, x) R Reltions (4B) 9
10 Symmetric Reltion x, y [ (x, y) R ( y, x) R ] symmetric symmetric symmetric symmetric symmetric symmetric Reltions (4B) 0
11 Not Symmetric Reltion { x, y [ (x, y) R ] [ ( y, x) R ] } x, y { [ (x, y) R ] [ ( y, x) R ] } x, y { [ (x, y) R ] [ ( y, x) R ] } x, y [ (x, y) R ] [ ( y, x) R ] x, y [ (x, y) R ] [ ( y, x) R ] counter exmple not symmetric not symmetric not symmetric Reltions (4B)
12 Anti-symmetric Reltion x, y [( (x, y) R ( y, x) R ) x = y ] nti-symmetric nti-symmetric nti-symmetric not nti-symmetric nti-symmetric nti-symmetric Reltions (4B) 2
13 Not Anti-symmetric Reltion x, y [ (x, y) R ( y, x) R ] [ x = y ] x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x = y ]} x, y { [ (x, y) R ( y, x) R ] [ x y ]} counter exmple not nti-symmetric not nti-symmetric not nti-symmetric Reltions (4B)
14 Equivlent Anti-symmetric Reltion x, y [ (x, y) R ( y, x) R ] [ x = y ] x, y [ x y ] [ (x, y) R ( y, x) R ] No symmetric reltion is llowed neither symmetric nor nti-symmetric Reltions (4B) 4
15 Reflexive, Symmetric, Anti-symmetric x (x, x) R x, y [ (x, y) R ] [ ( y, x) R ] x, y [ (x, y) R ( y, x) R ] [ x = y ] Reflexive Also, symmetric (no reltion for (x, y) where x y) Also, nti-symmetric (no reltion for (x, y) where x y) not symmetric not nti-symmetric nti-symmetric symmetric Reltions (4B) 5
16 Reltion Exmples R {(,), (2, b), (,), (, b)} R 2 {(, x), (, y), (b, y), (b, z)} 2 b x y z Reltions (4B) 6
17 Composite Reltion Exmples R {(, ), (2, b), (, ), (,b)} R 2 {(, x), (, y), (b, y), (b, z)} 2 b x y z 2 x y z R 2 R {(, x), (, y), (2, y), (2, z), (, x), (, y), (, z)} Reltions (4B) 7
18 Composite Reltion Exmples R {(, ), (2, b), (, ), (,b)} R 2 {(, x), (, y), (b, y), (b, z)} R 2 R {(, x), (, y), (2, y), (2, z), (, x), (, y), (, z)} 2 b x y z 2 x y z b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 x y z ] 2 [ 0 ][ A A 2 = 0 0 ] [ 0 0 = 2 0 Reltions (4B) 8
19 Mtrix of Reltion R {(, ), (2, b), (, ), (,b)} R 2 {(, x), (, y), (b, y), (b, z)} b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 R 2 R {(, x), (, y), (2, y), (2, z), (, x), (, y), (, z)} x y z ] 2 [ 0 ][ A A 2 = 0 0 ] [ 0 0 = 2 0 Reltions (4B) 9
20 Composite Reltion Properties R {(, ), (2, b), (, ), (,b)} R 2 {(, x), (, y), (b, y), (b, z)} R 2 R {(, x), (, y), (2, y), (2, z), (, x), (, y), (, z)} b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 x y z ] 2 [ 0 ][ A A 2 = 0 0 ] [ 0 0 = 2 0 (i, k) R 2 R ik of A A x y z Reltions (4B) 20
21 Sufficient Prt [ 0 ][ A A 2 = 0 0 ] [ 0 = 0 0 j 2 ] j b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 i s b t b u v i su+tv su = tv = i {, 2, } j {x, y, z} s {0, } t {0, } su+tv 0 (s = ) (u = ) (t = ) (v = ) u {0, } v {0, } (i,) R (, j) R 2 (i, b) R (b, j) R 2 (i, j) R 2 R (i, j) R 2 R Reltions (4B) 2
22 Necessry Prt [ 0 ][ A A 2 = 0 0 ] [ 0 = 0 0 j 2 ] j b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 i s b t b u v i su+tv i {, 2, } j {x, y, z} s {0, } t {0, } u {0, } v {0, } (i, j) R 2 R (i,) R (, j) R 2 (i, b) R (b, j) R 2 (s = ) (u = ) su = (t = ) (v = ) tv = su+tv 0 Reltions (4B) 22
23 Necessry Prt [ 0 ][ A A 2 = 0 0 ] [ 0 = 0 0 j 2 ] j b [ 0 A = 2 0 ] x y z [ A 2 = 0 ] b 0 i s b t b u v i su+tv i {, 2, } j {x, y, z} s {0, } t {0, } u {0, } v {0, } su+tv 0 nonzero(i, j) th element of A A 2 (i, j) R 2 R Reltions (4B) 2
24 Trnsitivity Test Exmples R {(,), (b,b), (c,c), (d,d), (b, c), (c, b)} R R {(,), (b,b), (c,c), (d,d), (b,c), (c, b)} A = b c d b c d [ ] A A = [ ][ ] 0 0 = b c d b c d [ ] Reltions (4B) 24
25 Trnsitivity Test A = 2 4 [ 2 4 ] A 2 = 2 4 [ ] [ e ] b c d 2 f g 4 h = 2 4 [ 2 4 ] nonzero (i, j) th element of A 2 nonzero (i, j) th element of A e = (2,) R (,2) R b f = c g = d h = (2,2) R (2,2) R (2,) R (,2) R (2, 4) R (4,2) R (2,2) R Reltions (4B) 25
26 Binry Reltions nd Digrphs A = {0,,2,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B) 26
27 Reflexive Reltion A = {0,,2,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B) 27
28 Symmetric Reltion A = {0,,2,,4, 5,6} R A A R = {(,b) b (mod )} R = [ ] Reltions (4B) 28
29 Trnsitive Reltion A = {0,,2,,4, 5,6} 0 R A A R = {(,b) b (mod )} RR = [ ] Reltions (4B) 29
30 Equivlence Reltion A = {0,,2,,4, 5,6} R A A R = {(,b) b (mod )} Equivlence Reltion Reflexive Reltion & Symmetric Reltion & Trnsitive Reltion Reltions (4B) 0
31 Equivlence Clss A = Z + = {0,,2,, 4,5, 6, } R A A R = {(,b) b (mod )} {0,, 6, 9, } [0] [] {, 4, 7, 0, } [] [] {2, 5, 8,, } [2] [2] Reltions (4B)
32 References [] [2]
Relations (3A) Young Won Lim 3/15/18
Reltions (A) Copyright (c) 05 08 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version. or ny lter version published
More informationFunctor (1A) Young Won Lim 8/2/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationFunctor (1A) Young Won Lim 10/5/17
Copyright (c) 2016-2017 Young W. Lim. Permission is grnted to copy, distribute nd/or modify this document under the terms of the GNU Free Documenttion License, Version 1.2 or ny lter version published
More informationAccessibility (1A) Young Won Lim 8/22/13
Accessibility (1A) Copyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationClass (1A) Young Won Lim 9/8/14
Class (1A) Copyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationDay06 A. Young W. Lim Mon. Young W. Lim Day06 A Mon 1 / 16
Day06 A Young W. Lim 2017-09-18 Mon Young W. Lim Day06 A 2017-09-18 Mon 1 / 16 Outline 1 Based on 2 Introduction C Program Control Young W. Lim Day06 A 2017-09-18 Mon 2 / 16 Based on "C How to Program",
More informationUNIT 11. Query Optimization
UNIT Query Optimiztion Contents Introduction to Query Optimiztion 2 The Optimiztion Process: An Overview 3 Optimiztion in System R 4 Optimiztion in INGRES 5 Implementing the Join Opertors Wei-Png Yng,
More informationa(e, x) = x. Diagrammatically, this is encoded as the following commutative diagrams / X
4. Mon, Sept. 30 Lst time, we defined the quotient topology coming from continuous surjection q : X! Y. Recll tht q is quotient mp (nd Y hs the quotient topology) if V Y is open precisely when q (V ) X
More informationMA1008. Calculus and Linear Algebra for Engineers. Course Notes for Section B. Stephen Wills. Department of Mathematics. University College Cork
MA1008 Clculus nd Liner Algebr for Engineers Course Notes for Section B Stephen Wills Deprtment of Mthemtics University College Cork s.wills@ucc.ie http://euclid.ucc.ie/pges/stff/wills/teching/m1008/ma1008.html
More informationDay06 A. Young W. Lim Wed. Young W. Lim Day06 A Wed 1 / 26
Day06 A Young W. Lim 2017-09-20 Wed Young W. Lim Day06 A 2017-09-20 Wed 1 / 26 Outline 1 Based on 2 C Program Control Overview for, while, do... while break and continue Relational and Logical Operators
More informationFunctions (4A) Young Won Lim 5/8/17
Functions (4A) Copyright (c) 2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationIf you are at the university, either physically or via the VPN, you can download the chapters of this book as PDFs.
Lecture 5 Wlks, Trils, Pths nd Connectedness Reding: Some of the mteril in this lecture comes from Section 1.2 of Dieter Jungnickel (2008), Grphs, Networks nd Algorithms, 3rd edition, which is ville online
More informationTheory of Computation CSE 105
$ $ $ Theory of Computtion CSE 105 Regulr Lnguges Study Guide nd Homework I Homework I: Solutions to the following problems should be turned in clss on July 1, 1999. Instructions: Write your nswers clerly
More informationFunctions (4A) Young Won Lim 3/16/18
Functions (4A) Copyright (c) 2015 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationIn the last lecture, we discussed how valid tokens may be specified by regular expressions.
LECTURE 5 Scnning SYNTAX ANALYSIS We know from our previous lectures tht the process of verifying the syntx of the progrm is performed in two stges: Scnning: Identifying nd verifying tokens in progrm.
More informationPolymorphism Overview (1A) Young Won Lim 2/20/18
Polymorphism Overview (1A) Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More information1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order).
Exercises Exercises 1. Represent each of these relations on {1, 2, 3} with a matrix (with the elements of this set listed in increasing order). a) {(1, 1), (1, 2), (1, 3)} b) {(1, 2), (2, 1), (2, 2), (3,
More informationLEX5: Regexps to NFA. Lexical Analysis. CMPT 379: Compilers Instructor: Anoop Sarkar. anoopsarkar.github.io/compilers-class
LEX5: Regexps to NFA Lexicl Anlysis CMPT 379: Compilers Instructor: Anoop Srkr noopsrkr.github.io/compilers-clss Building Lexicl Anlyzer Token POern POern Regulr Expression Regulr Expression NFA NFA DFA
More informationNUMERICAL METHODS & OPTIMISATION
For updted version, plese click on http://ocw.ump.edu.my NUMERICAL METHODS & OPTIMISATION Prt I: s Rihn Edros Fculty of Engineering Technology rzhirh@ump.edu.my Chpter Description Aims Apply numericl methods
More informationEulerian Cycle (2A) Young Won Lim 4/26/18
Eulerian Cycle (2A) Copyright (c) 2015 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationChapter 4 Fuzzy Graph and Relation
Chpter 4 Fuzzy Grph nd Reltion Grph nd Fuzzy Grph! Grph n G = (V, E) n V : Set of verties(node or element) n E : Set of edges An edge is pir (x, y) of verties in V.! Fuzzy Grph ~ n ( ~ G = V, E) n V :
More informationCOMPUTER EDUCATION TECHNIQUES, INC. (MS_W2K3_SERVER ) SA:
In order to lern which questions hve een nswered correctly: 1. Print these pges. 2. Answer the questions. 3. Send this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following
More informationFile Manager Quick Reference Guide. June Prepared for the Mayo Clinic Enterprise Kahua Deployment
File Mnger Quick Reference Guide June 2018 Prepred for the Myo Clinic Enterprise Khu Deployment NVIGTION IN FILE MNGER To nvigte in File Mnger, users will mke use of the left pne to nvigte nd further pnes
More informationRAM (1A) Young Won Lim 11/12/13
RAM (1A) Young Won Lim 11/12/13 opyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More information9.5 Equivalence Relations
9.5 Equivalence Relations You know from your early study of fractions that each fraction has many equivalent forms. For example, 2, 2 4, 3 6, 2, 3 6, 5 30,... are all different ways to represent the same
More informationUnit 5 Vocabulary. A function is a special relationship where each input has a single output.
MODULE 3 Terms Definition Picture/Exmple/Nottion 1 Function Nottion Function nottion is n efficient nd effective wy to write functions of ll types. This nottion llows you to identify the input vlue with
More informationReducing a DFA to a Minimal DFA
Lexicl Anlysis - Prt 4 Reducing DFA to Miniml DFA Input: DFA IN Assume DFA IN never gets stuck (dd ded stte if necessry) Output: DFA MIN An equivlent DFA with the minimum numer of sttes. Hrry H. Porter,
More informationMemory Arrays (4H) Gate Level Design. Young Won Lim 3/15/16
Arrays (4H) Gate Level Design Young Won Lim 3/15/16 Copyright (c) 2011, 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationIntroduction to Algebra
INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh
More informationProcessors. Young W. Lim. May 9, 2016
Processors Young W. Lim May 9, 2016 Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationCSE 401 Midterm Exam 11/5/10 Sample Solution
Question 1. egulr expressions (20 points) In the Ad Progrmming lnguge n integer constnt contins one or more digits, but it my lso contin embedded underscores. Any underscores must be preceded nd followed
More informationHow to Design REST API? Written Date : March 23, 2015
Visul Prdigm How Design REST API? Turil How Design REST API? Written Dte : Mrch 23, 2015 REpresenttionl Stte Trnsfer, n rchitecturl style tht cn be used in building networked pplictions, is becoming incresingly
More informationClass (1A) Young Won Lim 11/20/14
Class (1A) Copyright (c) 2011 2014 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationBinary Search Tree (3A) Young Won Lim 6/6/18
Binary Search Tree (A) //1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationPointers (1A) Young Won Lim 11/1/17
Pointers (1A) Copyright (c) 2010-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationStructure (1A) Component
Component Copyright (c) 2012 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationTiny CPU Data Path (2B) Young Won Lim 5/2/16
Tiny CPU Data Path (2B) Copyright (c) 24-26 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version.2 or any later
More informationApplications of Pointers (1A) Young Won Lim 12/26/17
Applications of (1A) Copyright (c) 2010-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any
More informationDay05 A. Young W. Lim Sat. Young W. Lim Day05 A Sat 1 / 14
Day05 A Young W. Lim 2017-10-07 Sat Young W. Lim Day05 A 2017-10-07 Sat 1 / 14 Outline 1 Based on 2 Structured Programming (2) Conditions and Loops Conditional Statements Loop Statements Type Cast Young
More informationIntroduction to Computer Engineering EECS 203 dickrp/eecs203/ CMOS transmission gate (TG) TG example
Introduction to Computer Engineering EECS 23 http://ziyng.eecs.northwestern.edu/ dickrp/eecs23/ CMOS trnsmission gte TG Instructor: Robert Dick Office: L477 Tech Emil: dickrp@northwestern.edu Phone: 847
More informationAbout the Finite Element Analysis for Beam-Hinged Frame. Duan Jin1,a, Li Yun-gui1
Advnces in Engineering Reserch (AER), volume 143 6th Interntionl Conference on Energy nd Environmentl Protection (ICEEP 2017) About the Finite Element Anlysis for Bem-Hinged Frme Dun Jin1,, Li Yun-gui1
More informationPointers (1A) Young Won Lim 1/5/18
Pointers (1A) Copyright (c) 2010-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationPointers (1A) Young Won Lim 1/9/18
Pointers (1A) Copyright (c) 2010-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationCSCE 531, Spring 2017, Midterm Exam Answer Key
CCE 531, pring 2017, Midterm Exm Answer Key 1. (15 points) Using the method descried in the ook or in clss, convert the following regulr expression into n equivlent (nondeterministic) finite utomton: (
More informationFPGA Configuration (1C) Young Won Lim 12/1/13
(1C) Young Won Lim 12/1/13 Copyright (c) 2011-2013 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationGAS Tutorial - 4. Sections & Relocation
GAS Tutorial - 4. Sections & Relocation Young W. Lim 2016-03-01 Tue Young W. Lim GAS Tutorial - 4. Sections & Relocation 2016-03-01 Tue 1 / 22 Outline 1 Sections and Relocation Young W. Lim GAS Tutorial
More informationA Sudoku Solver (1A) Richard Bird Implementation. Young Won Lim 11/15/16
A Sudoku Solver (1A) Richard Bird Implementation Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License,
More informationSOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES
SOME EXAMPLES OF SUBDIVISION OF SMALL CATEGORIES MARCELLO DELGADO Abstrct. The purpose of this pper is to build up the bsic conceptul frmework nd underlying motivtions tht will llow us to understnd ctegoricl
More informationCHAPTER 8. Copyright Cengage Learning. All rights reserved.
CHAPTER 8 RELATIONS Copyright Cengage Learning. All rights reserved. SECTION 8.3 Equivalence Relations Copyright Cengage Learning. All rights reserved. The Relation Induced by a Partition 3 The Relation
More informationZenoss Service Impact Installation and Upgrade Guide for Resource Manager 5.x and 6.x
Zenoss Service Impct Instlltion nd Upgrde Guide for Resource Mnger 5.x nd 6.x Relese 5.3.1 Zenoss, Inc. www.zenoss.com Zenoss Service Impct Instlltion nd Upgrde Guide for Resource Mnger 5.x nd 6.x Copyright
More informationASTs, Regex, Parsing, and Pretty Printing
ASTs, Regex, Prsing, nd Pretty Printing CS 2112 Fll 2016 1 Algeric Expressions To strt, consider integer rithmetic. Suppose we hve the following 1. The lphet we will use is the digits {0, 1, 2, 3, 4, 5,
More informationBinary Search Tree (3A) Young Won Lim 6/2/18
Binary Search Tree (A) /2/1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More information2 b. 3 Use the chain rule to find the gradient:
Conic sections D x cos θ, y sinθ d y sinθ So tngent is y sin θ ( x cos θ) sinθ Eqution of tngent is x + y sinθ sinθ Norml grdient is sinθ So norml is y sin θ ( x cos θ) xsinθ ycos θ ( )sinθ, So eqution
More informationCMPSC 470: Compiler Construction
CMPSC 47: Compiler Construction Plese complete the following: Midterm (Type A) Nme Instruction: Mke sure you hve ll pges including this cover nd lnk pge t the end. Answer ech question in the spce provided.
More informationPower Set of a set and Relations
Power Set of a set and Relations 1 Power Set (1) Definition: The power set of a set S, denoted P(S), is the set of all subsets of S. Examples Let A={a,b,c}, P(A)={,{a},{b},{c},{a,b},{b,c},{a,c},{a,b,c}}
More informationAssignment 4. Due 09/18/17
Assignment 4. ue 09/18/17 1. ). Write regulr expressions tht define the strings recognized by the following finite utomt: b d b b b c c b) Write FA tht recognizes the tokens defined by the following regulr
More informationStained Glass Design. Teaching Goals:
Stined Glss Design Time required 45-90 minutes Teching Gols: 1. Students pply grphic methods to design vrious shpes on the plne.. Students pply geometric trnsformtions of grphs of functions in order to
More informationpdfapilot Server 2 Manual
pdfpilot Server 2 Mnul 2011 by clls softwre gmbh Schönhuser Allee 6/7 D 10119 Berlin Germny info@cllssoftwre.com www.cllssoftwre.com Mnul clls pdfpilot Server 2 Pge 2 clls pdfpilot Server 2 Mnul Lst modified:
More informationAlgorithms (7A) Young Won Lim 4/10/17
Algorithms (7A) Copyright (c) 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationProcessors. Young W. Lim. May 12, 2016
Processors Young W. Lim May 12, 2016 Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version
More informationBinary Search Tree (2A) Young Won Lim 5/17/18
Binary Search Tree (2A) Copyright (c) 2015-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or
More informationUNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS 1 COMPUTATION & LOGIC INSTRUCTIONS TO CANDIDATES
UNIVERSITY OF EDINBURGH COLLEGE OF SCIENCE AND ENGINEERING SCHOOL OF INFORMATICS INFORMATICS COMPUTATION & LOGIC Sturdy st April 7 : to : INSTRUCTIONS TO CANDIDATES This is tke-home exercise. It will not
More informationAlgorithms (7A) Young Won Lim 4/18/17
Algorithms (7A) Copyright (c) 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationDefinition of Regular Expression
Definition of Regulr Expression After the definition of the string nd lnguges, we re redy to descrie regulr expressions, the nottion we shll use to define the clss of lnguges known s regulr sets. Recll
More informationMidterm I Solutions CS164, Spring 2006
Midterm I Solutions CS164, Spring 2006 Februry 23, 2006 Plese red ll instructions (including these) crefully. Write your nme, login, SID, nd circle the section time. There re 8 pges in this exm nd 4 questions,
More informationCISC 1400 Discrete Structures
CISC 1400 Discrete Structures Chapter 4 Relations CISC1400 Yanjun Li 1 1 Relation A relation is a connection between objects in one set and objects in another set (possibly the same set). age is a relation
More informationCS 441 Discrete Mathematics for CS Lecture 24. Relations IV. CS 441 Discrete mathematics for CS. Equivalence relation
CS 441 Discrete Mathematics for CS Lecture 24 Relations IV Milos Hauskrecht milos@cs.pitt.edu 5329 Sennott Square Equivalence relation Definition: A relation R on a set A is called an equivalence relation
More information12-B FRACTIONS AND DECIMALS
-B Frctions nd Decimls. () If ll four integers were negtive, their product would be positive, nd so could not equl one of them. If ll four integers were positive, their product would be much greter thn
More informationHaskell Overview II (2A) Young Won Lim 8/9/16
(2A) Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationMisrepresentation of Preferences
Misrepresenttion of Preferences Gicomo Bonnno Deprtment of Economics, University of Cliforni, Dvis, USA gfbonnno@ucdvis.edu Socil choice functions Arrow s theorem sys tht it is not possible to extrct from
More information1 Drawing 3D Objects in Adobe Illustrator
Drwing 3D Objects in Adobe Illustrtor 1 1 Drwing 3D Objects in Adobe Illustrtor This Tutoril will show you how to drw simple objects with three-dimensionl ppernce. At first we will drw rrows indicting
More informationDay02 A. Young W. Lim Sat. Young W. Lim Day02 A Sat 1 / 12
Day02 A Young W. Lim 2017-10-07 Sat Young W. Lim Day02 A 2017-10-07 Sat 1 / 12 Outline 1 Based on 2 Introduction (2) - Basic Elements Basic Elements in C Programming Young W. Lim Day02 A 2017-10-07 Sat
More informationOverview (1A) Young Won Lim 9/14/17
Overview (1A) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationTixeo compared to other videoconferencing solutions
compred to other videoconferencing solutions for V171026EN , unique solution on the video conferencing field Adobe Connect Web RTC Vydio for High security level, privcy Zero impct on network security policies
More informationAgilent Mass Hunter Software
Agilent Mss Hunter Softwre Quick Strt Guide Use this guide to get strted with the Mss Hunter softwre. Wht is Mss Hunter Softwre? Mss Hunter is n integrl prt of Agilent TOF softwre (version A.02.00). Mss
More information5 Regular 4-Sided Composition
Xilinx-Lv User Guide 5 Regulr 4-Sided Composition This tutoril shows how regulr circuits with 4-sided elements cn be described in Lv. The type of regulr circuits tht re discussed in this tutoril re those
More informationOverview (1A) Young Won Lim 9/9/17
Overview (1A) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationFunction Overview (1A) Young Won Lim 10/23/17
Function Overview (1A) Copyright (c) 2010 2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or
More informationUnit #9 : Definite Integral Properties, Fundamental Theorem of Calculus
Unit #9 : Definite Integrl Properties, Fundmentl Theorem of Clculus Gols: Identify properties of definite integrls Define odd nd even functions, nd reltionship to integrl vlues Introduce the Fundmentl
More informationWelch Allyn CardioPerfect Workstation Installation Guide
Welch Allyn CrdioPerfect Worksttion Instlltion Guide INSTALLING CARDIOPERFECT WORKSTATION SOFTWARE & ACCESSORIES ON A SINGLE PC For softwre version 1.6.6 or lter For network instlltion, plese refer to
More informationGAS Tutorial - 6. Expression
GAS Tutorial - 6. Expression Young W. Lim 2016-03-03 Wed Young W. Lim GAS Tutorial - 6. Expression 2016-03-03 Wed 1 / 15 Outline 1 Expressions Young W. Lim GAS Tutorial - 6. Expression 2016-03-03 Wed 2
More informationLCI/USB LonWorks Commissioning Interface
Works Commissioning Interfce Importnt: Retin these instructions CONTENTS 1 Unpcking... 1 2 Storing... 1 3 Instlltion... 1 4 Uninstlling the USB Drivers... 8 5 Disposl... 8 1 UNPACKING Instlltion Instructions
More informationMonoid (4A) Young Won Lim 8/12/17
Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationA Tautology Checker loosely related to Stålmarck s Algorithm by Martin Richards
A Tutology Checker loosely relted to Stålmrck s Algorithm y Mrtin Richrds mr@cl.cm.c.uk http://www.cl.cm.c.uk/users/mr/ University Computer Lortory New Museum Site Pemroke Street Cmridge, CB2 3QG Mrtin
More informationVariables (2D) Young Won Lim 3/28/18
Variables (2D) Copyright (c) 2014-2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationHaskell Overview II (2A) Young Won Lim 8/23/16
(2A) Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationAlgorithms Bubble Sort (1B) Young Won Lim 4/5/18
Algorithms Bubble Sort (1B) Young Won Lim 4/5/18 Copyright (c) 2017 2018 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationOverview (1A) Young Won Lim 9/25/17
Overview (1A) Copyright (c) 2009-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationMemory (1A) Young Won Lim 9/7/17
(1A) Copyright (c) 21-26 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationMid-term exam. Scores. Fall term 2012 KAIST EE209 Programming Structures for EE. Thursday Oct 25, Student's name: Student ID:
Fll term 2012 KAIST EE209 Progrmming Structures for EE Mid-term exm Thursdy Oct 25, 2012 Student's nme: Student ID: The exm is closed book nd notes. Red the questions crefully nd focus your nswers on wht
More informationCS412/413. Introduction to Compilers Tim Teitelbaum. Lecture 4: Lexical Analyzers 28 Jan 08
CS412/413 Introduction to Compilers Tim Teitelum Lecture 4: Lexicl Anlyzers 28 Jn 08 Outline DFA stte minimiztion Lexicl nlyzers Automting lexicl nlysis Jlex lexicl nlyzer genertor CS 412/413 Spring 2008
More informationPIA INQUIRY QUESTIONS LEASED DARK FIBER AND SPECIAL CONSTRUCTION
PIA INQUIRY QUESTIONS LEASED DARK FIBER AND SPECIAL CONSTRUCTION IMPORTANT: The rules for evluting the cost effectiveness of drk fier nd self provisioning options re strict, ever evolving, nd re explined
More informationA Sudoku Solver Pruning (3A)
A Sudoku Solver Pruning (3A) Richard Bird Implementation Copyright (c) 2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation
More informationGHCi: Getting started (1A) Young Won Lim 5/26/17
GHCi: Getting started (1A) Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationAlignment of Long Sequences. BMI/CS Spring 2012 Colin Dewey
Alignment of Long Sequences BMI/CS 776 www.biostt.wisc.edu/bmi776/ Spring 2012 Colin Dewey cdewey@biostt.wisc.edu Gols for Lecture the key concepts to understnd re the following how lrge-scle lignment
More informationBinary Search Tree (3A) Young Won Lim 6/4/18
Binary Search Tree (A) /4/1 Copyright (c) 2015-201 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2
More informationMonad Background (3A) Young Won Lim 11/20/17
Copyright (c) 2016-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version published
More informationPointers (1A) Young Won Lim 1/14/18
Pointers (1A) Copyright (c) 2010-2017 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later
More informationFile (1A) Young Won Lim 11/25/16
File (1A) Copyright (c) 2010-2016 Young W. Lim. Permission is granted to copy, distribute and/or modify this document under the terms of the GNU Free Documentation License, Version 1.2 or any later version
More informationBasic Geometry and Topology
Bsic Geometry nd Topology Stephn Stolz Septemer 7, 2015 Contents 1 Pointset Topology 1 1.1 Metric spces................................... 1 1.2 Topologicl spces................................ 5 1.3 Constructions
More information