¸ê®Æµ²ºc
|
|
|
|
¡i§@ªÌ¡j |
¤ýPüL
©µ¦ù¾\Ū
|
¡i®Ñ¸¹¡j |
51MM045108 |
¡i¾A¥Î¡j |
¸êºÞ©Ò¡D¸ê¤u©Ò¡D¹q¾÷©Ò
|
¡i¥Xª©ªÀ¡j |
°ªÂI¤å¤Æ |
¡i¥Xª©¡j |
2023/4 |
¯S»ù¡G540¤¸ ( ©w»ù 600 )
|
|
|
|
|
|
|
§@ªÌ²¾ú
¡D°ªÂI¬ã¨s©Ò¡B°ª¤W°ª´¶¦Òµ¥½Òµ{±M¥ôÁ¿®v
¡D±Ð¾Ç½Òµ{²[»\pºâ¾÷·§½×¡Bµ{¦¡³]p¡B¸ê®Æµ²ºc¡Bºtºâªk¡B§@·~¨t²Î¡B³q°Tºô¸ôµ¥¡A¤G¤Q¾l¦~±Ð¾Ç¸gÅç
¡D´¿¥ô»Ê¶Ç¤j¾Ç±M¥ô°Æ±Ð±Â¡B«ä¬ìCisco CCNA©MCCNPºØ¤l±Ð®v
¡DÀ³¥ÎUnity 3D¹CÀ¸¤ÞÀº¡A¶}µoµêÀÀ¹ê¹Ò(VR)À³¥Î»PÂX¼W¹ê¹Ò(AR)À³¥Î
¥»®Ñ¯S¦â
¥»®Ñ¤D°ªÂI¦W®v¤ýP?¨Ì¦h¦~±Ð¾Ç¸gÅç¤Î¬ã¨s©Ò¸ÕÃDÁͶեþ·s¼¶¼g¡A¤º®e²[»\«×¥þ±¥B¿Ä¤J³Ì·sºtºâªkÆ[©À»P®Ä¯à¤ÀªR¤èªk¡C
¥»®Ñ¾A¦X³ø¦Ò¸ê°T©Ò¡B¸êºÞ©Ò¡B¹q¾÷©Ò¤Î¬ÛÃö¨t©Òªº¦Ò¥Í¨Ï¥Î¡A¤º®e¸g¹L¨t²Î¤Æ¾ã²z¡A¨Ã¨Ì³¹¸`¤ÀÃþÂk¯Ç¥X¦U³¹¸`nÂI¡Aºë¿ï¥X¨ã¥Nªí©Ê»P«n©Ê¤§¬ã¨s©Ò¸ÕÃD¡]·s¼W¦Ü112¦~¡^¡A¨CÃD¬Ò»²¥H¸ÔºÉ¸ÑªR¡A´Á¯à¨ó§U¦Ò¥Í¡A¥H¸ûµu®É¶¡´x´¤¦Ò¸ÕªºnÂI¡Aºt½m¨ã¦³¥Nªí©Êªº¸ÕÃD¡A¥H¹F¨Æ¥b¥\¿¤§®Ä¡C
¥þ®Ñ¤À¬°¤Q¤@³¹¡A¥H´`§Çº¥¶i¤è¦¡¡A±j½Õ¦U³¹©RÃD«ÂI¡A¬[ºc¼h¦¸¤À©ú¡Aªþ¤W½d¨Ò¸ÔºÉ¸ÑªR¡A¨ÏŪªÌ¦b¬ãŪ®É²Ïîڰò¡A±q®e±¹ï¦UÃþ¸ÕÃD¡C
|
|
Chapter 1¡@ºü¡@½×(Introduction) Chapter 2¡@°}¡@¦C(Arrays) Chapter 3¡@Ãìµ²¦ê¦C(Linked Lists) Chapter 4¡@°ïÅ|»P¦î¦C(Stacks and Queues) Chapter 5¡@»¼¡@°j(Recursion) Chapter 6¡@¾ð(Trees) Chapter 7¡@°ï¿nµ²ºc»PÀu¥ýÅv¦î¦C(Heap Structures and Priority Qurues) Chapter 8¡@¹Ï¡@§Î(Graphs) Chapter 9¡@¾ðª¬·j´Mµ²ºc(Searching Tree Structures) Chapter 10¡@±Æ§Çªk(Sorting) Chapter 11¡@·j´Mªk(Searching)
|
|