推 PikaRen:應該是12k+1吧 08/07 22:01
推 ceo890710:那請問12K+1是為什麼呢..上面已解答的都懂了~感恩! 08/07 22:26
※ 引述《ceo890710 (Drinking)》之銘言：
: 98台大資工- Tru or False
: (d) The Hasse diagram for a total ordering is a chain
照定義 應該是true
: (e) It is possible that there are multiple topological orders for
: a partially ordered set
topological sort排出來的順序不唯一
應該也是true
: 想問這兩個選項..
: -----------------------------------------------------------------
: 98中山資工
: Let R be the relation on A={1,2,3,4,5,6,7},where the directed graph
: associated with R consists of the two components,each a directed cycle
: ,shown below.Find all integers n's such that 1<n<30 and R^n = R
: 1 → 2 5
: ↑ ↓ ↗ ↘
: 4 ← 3 7 ← 6
: 這題解答部分是寫 R^(12k) 不太懂這個地方..
看不太懂..
不過單純回答R^(12k)
我想應該是正方形要走4次 三角形要走3次
才會走到出發點
我想12是4*3來的
: ------------------------------------------------------------------
: 97清大資工
: Let S be the set of all strings of English letters.consider the
: following relations on S and determine whether
: (a)R1 = {(a,b)|a and b have no letters in common} is reflexive or not
: 我想問這個選項..no letters in common是指什麼樣的字..
令 a = "special"
(a,a) = ("special", "special") 這兩個string有相同
根據relation的定義 不滿足reflexive
: ------------------------------------------------------------------
: 97政大資科
: Let A be the set of all bit strings of length 11. Define an equivalence
: relation R on A with the condition that xRy iff bits x and y have the same
: number of 1's.Then
: (b)The quotient set A/R has ____ equivalence classes
: 我想問其中A/R是代表什麼..
: 不好意思問題有點多..希望高手能給小弟我一些指教 謝謝:)
不知道跟98中山跟97政大要怎麼解..
--
※ 發信站: 批踢踢實業坊(ptt.cc)
◆ From: 140.118.110.186
※ 編輯: mqazz1 來自: 140.118.110.186 (08/07 21:53)