QUESTIONS BEGIN HERE!

Similar documents
QUESTIONS BEGIN HERE!

Cycles and Simple Cycles. Paths and Simple Paths. Trees. Problem: There is No Completely Standard Terminology!

Outline. 1 Introduction. 2 Min-Cost Spanning Trees. 4 Example

, each of which is a tree, and whose roots r 1. , respectively, are children of r. Data Structures & File Management

Math 61 : Discrete Structures Final Exam Instructor: Ciprian Manolescu. You have 180 minutes.

ECE COMBINATIONAL BUILDING BLOCKS - INVEST 13 DECODERS AND ENCODERS

b. How many ternary words of length 23 with eight 0 s, nine 1 s and six 2 s?

Outline. Computer Science 331. Computation of Min-Cost Spanning Trees. Costs of Spanning Trees in Weighted Graphs

16.unified Introduction to Computers and Programming. SOLUTIONS to Examination 4/30/04 9:05am - 10:00am

Complete Solutions for MATH 3012 Quiz 2, October 25, 2011, WTT

EE1000 Project 4 Digital Volt Meter

1 Introduction to Modulo 7 Arithmetic

Paths. Connectivity. Euler and Hamilton Paths. Planar graphs.

Present state Next state Q + M N

Outline. Binary Tree

MAT3707. Tutorial letter 201/1/2017 DISCRETE MATHEMATICS: COMBINATORICS. Semester 1. Department of Mathematical Sciences MAT3707/201/1/2017

Designing A Concrete Arch Bridge

Exam 1 Solution. CS 542 Advanced Data Structures and Algorithms 2/14/2013

Decimals DECIMALS.

12/3/12. Outline. Part 10. Graphs. Circuits. Euler paths/circuits. Euler s bridge problem (Bridges of Konigsberg Problem)

5/9/13. Part 10. Graphs. Outline. Circuits. Introduction Terminology Implementing Graphs

CSI35 Chapter 11 Review

CSE 373: More on graphs; DFS and BFS. Michael Lee Wednesday, Feb 14, 2018

0.1. Exercise 1: the distances between four points in a graph

Constructive Geometric Constraint Solving

Garnir Polynomial and their Properties

CS September 2018

Graphs. Graphs. Graphs: Basic Terminology. Directed Graphs. Dr Papalaskari 1

N=4 L=4. Our first non-linear data structure! A graph G consists of two sets G = {V, E} A set of V vertices, or nodes f

1. Determine whether or not the following binary relations are equivalence relations. Be sure to justify your answers.

learning objectives learn what graphs are in mathematical terms learn how to represent graphs in computers learn about typical graph algorithms

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Graphs. CSC 1300 Discrete Structures Villanova University. Villanova CSC Dr Papalaskari

Outline. Circuits. Euler paths/circuits 4/25/12. Part 10. Graphs. Euler s bridge problem (Bridges of Konigsberg Problem)

OpenMx Matrices and Operators

The University of Sydney MATH2969/2069. Graph Theory Tutorial 5 (Week 12) Solutions 2008

# 1 ' 10 ' 100. Decimal point = 4 hundred. = 6 tens (or sixty) = 5 ones (or five) = 2 tenths. = 7 hundredths.

(2) If we multiplied a row of B by λ, then the value is also multiplied by λ(here lambda could be 0). namely

5/7/13. Part 10. Graphs. Theorem Theorem Graphs Describing Precedence. Outline. Theorem 10-1: The Handshaking Theorem

Algorithmic and NP-Completeness Aspects of a Total Lict Domination Number of a Graph

Total score: /100 points

V={A,B,C,D,E} E={ (A,D),(A,E),(B,D), (B,E),(C,D),(C,E)}

Organization. Dominators. Control-flow graphs 8/30/2010. Dominators, control-dependence. Dominator relation of CFGs

An undirected graph G = (V, E) V a set of vertices E a set of unordered edges (v,w) where v, w in V

INTEGRALS. Chapter 7. d dx. 7.1 Overview Let d dx F (x) = f (x). Then, we write f ( x)

Why the Junction Tree Algorithm? The Junction Tree Algorithm. Clique Potential Representation. Overview. Chris Williams 1.

Planar Upward Drawings

CSC Design and Analysis of Algorithms. Example: Change-Making Problem

Solutions for HW11. Exercise 34. (a) Use the recurrence relation t(g) = t(g e) + t(g/e) to count the number of spanning trees of v 1

Similarity Search. The Binary Branch Distance. Nikolaus Augsten.

Problem solving by search

Walk Like a Mathematician Learning Task:

Instructions for Section 1

Seven-Segment Display Driver

Solutions to Homework 5

Grade 7/8 Math Circles March 4/5, Graph Theory I- Solutions

CS61B Lecture #33. Administrivia: Autograder will run this evening. Today s Readings: Graph Structures: DSIJ, Chapter 12

CS 241 Analysis of Algorithms

CSE 373. Graphs 1: Concepts, Depth/Breadth-First Search reading: Weiss Ch. 9. slides created by Marty Stepp

More Foundations. Undirected Graphs. Degree. A Theorem. Graphs, Products, & Relations

COMPLEXITY OF COUNTING PLANAR TILINGS BY TWO BARS

Math 166 Week in Review 2 Sections 1.1b, 1.2, 1.3, & 1.4

Multipoint Alternate Marking method for passive and hybrid performance monitoring

CS 461, Lecture 17. Today s Outline. Example Run

CMSC 451: Lecture 2 Graph Basics Thursday, Aug 31, 2017

12. Traffic engineering

Numbering Boundary Nodes

BASIC CAGE DETAILS SHOWN 3D MODEL: PSM ASY INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY SPRING FINGERS CLOSED TOP

ECE 407 Computer Aided Design for Electronic Systems. Circuit Modeling and Basic Graph Concepts/Algorithms. Instructor: Maria K. Michael.

Using the Printable Sticker Function. Using the Edit Screen. Computer. Tablet. ScanNCutCanvas

Section 10.4 Connectivity (up to paths and isomorphism, not including)

SAMPLE PAGES. Primary. Primary Maths Basics Series THE SUBTRACTION BOOK. A progression of subtraction skills. written by Jillian Cockings

A 4-state solution to the Firing Squad Synchronization Problem based on hybrid rule 60 and 102 cellular automata

CS200: Graphs. Graphs. Directed Graphs. Graphs/Networks Around Us. What can this represent? Sometimes we want to represent directionality:

S i m p l i f y i n g A l g e b r a SIMPLIFYING ALGEBRA.

BASIC CAGE DETAILS D C SHOWN CLOSED TOP SPRING FINGERS INNER WALL TABS ARE COINED OVER BASE AND COVER FOR RIGIDITY

10/30/12. Today. CS/ENGRD 2110 Object- Oriented Programming and Data Structures Fall 2012 Doug James. DFS algorithm. Reachability Algorithms

H SERIES. Decimals. Decimals. Curriculum Ready ACMNA: 103, 128, 129, 130, 152, 154,

Round 7: Graphs (part I)

TURFGRASS DISEASE RESEARCH REPORT J. M. Vargas, Jr. and R. Detweiler Department of Botany and Plant Pathology Michigan State University

CSE303 - Introduction to the Theory of Computing Sample Solutions for Exercises on Finite Automata

Module graph.py. 1 Introduction. 2 Graph basics. 3 Module graph.py. 3.1 Objects. CS 231 Naomi Nishimura

Theorem 1. An undirected graph is a tree if and only if there is a unique simple path between any two of its vertices.

Computational Biology, Phylogenetic Trees. Consensus methods

COMP108 Algorithmic Foundations

Section 3: Antiderivatives of Formulas

Module 2 Motion Instructions

Schick CDR consumables catalogue

CSE 373: AVL trees. Warmup: Warmup. Interlude: Exploring the balance invariant. AVL Trees: Invariants. AVL tree invariants review

Chem 107: Inorganic Chemistry (40720)

TOPIC 5: INTEGRATION

ENGR 323 BHW 15 Van Bonn 1/7

b.) v d =? Example 2 l = 50 m, D = 1.0 mm, E = 6 V, " = 1.72 #10 $8 % & m, and r = 0.5 % a.) R =? c.) V ab =? a.) R eq =?

a b c cat CAT A B C Aa Bb Cc cat cat Lesson 1 (Part 1) Verbal lesson: Capital Letters Make The Same Sound Lesson 1 (Part 1) continued...

EXAMPLE 87.5" APPROVAL SHEET APPROVED BY /150HP DUAL VFD CONTROL ASSEMBLY CUSTOMER NAME: CAL POLY SLO FINISH: F 20

FSA. CmSc 365 Theory of Computation. Finite State Automata and Regular Expressions (Chapter 2, Section 2.3) ALPHABET operations: U, concatenation, *

Last time: introduced our first computational model the DFA.

Analysis for Balloon Modeling Structure based on Graph Theory

NP-Completeness. CS3230 (Algorithm) Traveling Salesperson Problem. What s the Big Deal? Given a Problem. What s the Big Deal? What s the Big Deal?

In which direction do compass needles always align? Why?

Transcription:

Points miss: Stunt's Nm: Totl sor: /100 points Est Tnnss Stt Univrsity Dprtmnt o Computr n Inormtion Sins CSCI 2710 (Trno) Disrt Struturs TEST or Sprin Smstr, 2005 R this or strtin! This tst is los ook n los nots You my NOT us lultor All nswrs must hv ox rwn roun thm. This is to i th rr (who miht not m!) Filur to o so miht rsult in no rit or nswr. I you prorm work on th k o p in this tst, init tht you hv on so in s th n riss or prtil rit to trmin. Sttmnt rrin mi misonut rom Stion 5.7 o th Est Tnnss Stt Univrsity Fulty Hnook, Jun 1, 2001: "Ami misonut will sujt to isiplinry tion. Any t o ishonsty in mi work onstituts mi misonut. This inlus plirism, th hnin o lsiyin o ny mi oumnts or mtrils, htin, n th ivin or rivin o unuthoriz i in tsts, xmintions, or othr ssin shool work. Pnltis or mi misonut will vry with th sriousnss o th ons n my inlu, ut r not limit to: r o 'F' on th work in qustion, r o 'F' o th ours, rprimn, protion, suspnsion, n xpulsion. For son mi ons th pnlty is prmnnt xpulsion." QUESTIONS BEGIN HERE! Prolms 1, 2, n rprsnt rltions ross th Crtsin prout A A whr A = {,,, }. Th rltions r rprsnt ithr s susts o A A, mtris, or irphs. For h prolm, trmin whthr th rltion is rlxiv, irrlxiv, symmtri, symmtri, ntisymmtri, n/or trnsitiv. Chk ll tht pply. ( points h) 1. R = A A rlxiv irrlxiv symmtri symmtri ntisymmtri trnsitiv 2. R = {(, ), (, ), (, ), (, ), (, ), (, ), (, ), (, )} rlxiv irrlxiv symmtri symmtri ntisymmtri trnsitiv. 0 1 1 1 0 0 0 0 0 0 rlxiv irrlxiv symmtri symmtri ntisymmtri trnsitiv

4. Th irph low rprsnts rltion R on A = {1, 2,, 4, 5}. Convrt th irph to mtrix. ( points) 1 2 5 4 5. Fill out th tl low listin th in-r n out-r o h lmnt or th rltion o th prvious prolm. ( points) In-Dr Out-Dr 1 2 4 5 For prolms 6, 7, n 8, lt A = {,,, } n B = {1, 2,, 4}. Dtrmin whthr th h o th rltions R rom A to B in ths prolms is untion. (2 points h) 6. R = A B Funtion Not untion 7. R = {(, 2), (, 1), (, 1), (, 2)} Funtion Not untion 8. R = {(, 4), (, ), (, 2), (, 1)} Funtion Not untion For prolms 9 n 10, trmin th omin n rn o th untion. In othr wors, i () =, thn wht vlus o '' mk sns or (Dom()) n wht vlus o '' mk sns or (Rn())? By th wy, pls stik to susts o rl numrs. ( points h) 9. () = + Dom() = Rn() = 10. () = (mo 5) whr is n intr Dom() = Rn() = For prolms 11 n 12, lt th univrsl st U = Z + (th st o positiv intrs). Givn th sust A, trmin th output o th ivn hrtristi or mmrship untion A. (1 point h) 11. A = {n n = vn positiv intr} A (24) = 12. A = {0, 5, 10, 15, 5n} n = 0, 1, 2, A (24) = For prolms 1 n 14, lt th mo-100 untion. Comput th output or h o th prolms. (2 points h) 1. (4) = 14. (222) =

Eh rltion R in prolms 15 throuh 17 is in on A = {,,,, }. In h s, trmin i R is root tr, n i it is, wht is th root? I thr is no root, lv tht sp lnk. ( points.) 15. R = {(, ), (, ), (, ), (, )} R is root tr R is not root tr I R is root tr, th root is: 16. R = {(, ), (, ), (, ), (, )} R is root tr R is not root tr I R is root tr, th root is: 17. R = {(, ), (, ), (, ), (, ), (, )} R is root tr R is not root tr I R is root tr, th root is: For prolms 18 throuh 24, us th root tr T shown in th iur to th riht. (2 points h) 18. Wht is th hiht o T? 19. T is n n-tr. Wht is th vlu o n? 20. List ll o th lvs o T. 21. List ll o th silins o. 22. List ll o th osprin o. 2. List ll o th snnts o. h i 24. Tru or ls: T is omplt n-tr? 25. Construt th tr o th lri xprssion (( ) + 2) ( 6). (4 points)

26. Th ollowin ouly link list rprsnts inry positionl ll tr. Construt th irph o this tr with h vrtx ll s init. (6 points) inx lt t riht 1 8 0 2 0 N 0 0 T 6 4 0 U 0 5 0 H 0 6 0 S 2 7 5 A 10 8 7 M 9 0 F 0 10 9 I 4 27. Fill in th LEFT n RIGHT rrys in th tl to th lt or th tr shown low. (6 points) o t n inx lt t riht 1 5 0 2 t 4 r 5 6 7 n 8 o 9 r 28. Us th Humn o tr shown to th riht to in th strin o 0's n 1's tht rprsnts th wor PAYDAY. (4 points) P Y 29. Us th Humn o tr shown to th riht to o th mss 11101100010111111010. ( points) A H D 0. Th xprssion shown low is writtn in Polish (prix) nottion. Evlut it to th inl intr rsult. Not tht ll o th numrs r sinl iit intrs. ( points) 4 2 6 2 1

1. Th xprssion shown low is writtn in rvrs Polish (postix) nottion. Evlut it to th inl intr rsult. Not tht ll o th numrs r sinl iit intrs. ( points) 5 4 5 + 2. List th vrtis in th orr tht thy r visit in prorr srh o th tr shown to th riht. ( points). List th vrtis in th orr tht thy r visit in n inorr srh o th sm tr rom prolm 2. ( points) i h 4. In th sp to th riht, onvrt th tr shown low to inry positionl tr. (4 points) 5. Us ny mtho you wish to trmin th miniml spnnin tr or th onnt rph shown low n to th lt. Drw th onntions o th miniml spnnin tr usin th vrtis shown to th riht. (5 points) 4 5 6 2 4