作者查詢 / Transfat
作者 Transfat 在 PTT [ Grad-ProbAsk ] 看板的留言(推文), 共799則
限定看板:Grad-ProbAsk
看板排序:
全部NBA4252Gossiping1969WomenTalk1182Grad-ProbAsk799ONE_PIECE427Boy-Girl351Isayama335NTU308MuscleBeach207CoC117movie112BrawlStars88graduate70studyabroad51Soft_Job46sex44Beauty41C_Chat35Militarylife26BhiteCat25ClashRoyale25Tennis21Olympics_ISG17NTUcourse16Lakers15Raptors14BLAZERS12TokyoGhoul12Tech_Job11CareerPlan10HatePolitics10Cavaliers9joke9EAseries8FITNESS7AfterPhD6LeBronJames6marriage6Teacher5FuMouDiscuss4Hawks4Kings4CrossStrait3CVS3HBL3Hornets3Nuggets3PingTung3Salary3Spurs3StupidClown3UTAH-JAZZ3Wizards3car2ChicagoBulls2Civil2feminine_sex2Grizzlies2LaClippers2MiamiHeat2NBAEasyChat2NTU-Exam2PttHistory2specialman2Stock2Tainan2TKU_EE_92C2b04902xxx1Baseball1basketballTW1biker1Bucks1Celtics1CourtBasketB1Design1Douhuamei1Examination1FJU1G-S-WARRIORS1Golden-Award1GRE1home-sale1IA1Japan_Travel1KoreaStar1KSU1L_TalkandCha1Learn_Buddha1LineGames1LoveLive1Marginalman1MenTalk1MLB1MobileComm1Nets1NTUHistory021PublicIssue1PublicServan1rent-exp1SanFrancisco1SENIORHIGH1SmashBros1SMSlife1soul1SP2_Basket1SportLottery1StephenCurry1studyteacher1Taoyuan1WorkinChina1<< 收起看板(110)
13F推: 我覺得gary跟gouya講的是同一件事吧?02/06 17:38
14F→: gary說的意思是在G中拿一個元素當H的generator,在證明封02/06 17:39
16F→: gouya一開始就假設H是循環子群,再證明元素個數相等,02/06 17:40
17F→: gary可能少證一步元素個數要相等,才可以說H=G,G is cyc02/06 17:41
18F→: lic02/06 17:41
19F→: 沒錯~02/06 17:41
23F推: 對,而且H的生成元一定可以從G中拿02/06 17:51
25F推: 你看錯字了嗎><02/06 17:56
1F推: 應該也要測7^2, 7^4,不過用看的就知道不是餘1 ?02/06 12:48
8F推: 我覺得b是對的,除非把題目改成TLB miss,那就會在IF和EX02/06 12:43
20F推: 還是data memory是在EXE stage計算physical address,然02/06 13:38
21F→: 後在mem stage在DM中看有無page fault,所以raised in02/06 13:38
22F→: memory stage, but raised by EXE stage ?02/06 13:38
5F推: 這題我會選欸,他沒有說vector不能是zero vector吧02/06 06:52
8F推: 4-2我選a吧,re-hashing我印象中是最慢的方式,真的不得02/05 20:35
9F→: 以才會re-hashing,chaining雖然linked-list可以連很多,02/05 20:36
10F→: 不過說unlimited似乎不太好02/05 20:36
2F推: false吧,function不可以沒對到東西02/05 16:15
1F推: 2.shortest path tree是指經過最短路徑,MST是指weight02/05 15:28
2F→: 和最小,但路徑(經過的邊數)不一定會是最少的02/05 15:29
3F→: 1.用decision tree,每次分支下去可以分成m種(degre=m)02/05 15:29
4F→: 所以總共有N個leaf,樹高最高就log_m N02/05 15:30
5F→: 3.Greedy的性質其中一項是要能夠切成沒有overley的subpr02/05 15:31
6F→: oblem,不過Heap Sort不符合這個性質(我覺得)02/05 15:31
3F推: 你就看哪個寫在前面吧,with respect to E and F, 就是02/04 19:22
4F→: E到F02/04 19:22
1F推: 第二題應該是已經假設linked-list已經sorted好,再outpu02/04 11:57
2F→: t出來,才會是O(n)02/04 11:57
6F推: 我是會假設已經sorted好欸,因為課本上也是寫O(n) //沒02/04 12:32
7F→: 記錯的話02/04 12:32
8F推: 沒錯~02/04 15:03
10F推: 可是他是two-level, memory access要兩次,indirect 定02/04 22:46
11F→: 址不是還要再加兩次嗎?02/04 22:46