|
ÀÎÇÏ´ë µ¥ÀÌÅͱ¸Á¶ 5ÁÖÂ÷ Homework02 infix, postfix / 1. Problem definition 2. Algorithm and simple code description(function¡¯s role) 3. Results and results screen 4. Conclusion / 1. Problem definition ¹®Á¦ Á¤ÀÇ´Â µ¥ÀÌÅͱ¸Á¶¿¡¼ ÁßÀ§ Ç¥±â¹ý(infix)°ú ÈÄÀ§ Ç¥±â¹ý(postfix)ÀÇ ÀÌÇØ¿Í È°¿ë¿¡ Áß¿äÇÑ ±âÃʸ¦ Çü¼ºÇÑ´Ù. ÁßÀ§ Ç¥±â¹ýÀº ÀϹÝÀûÀ¸·Î ¿ì¸®°¡ ¼öÇп¡¼ »ç¡¦ |
|
|
|
|
|
ÀÎÇÏ´ë µ¥ÀÌÅͱ¸Á¶ 3ÁÖÂ÷ Homework01 ÇϳëÀÌÀÇ Å¾ / 1. Please create a program that shows the implement of Hanoi tower by using the recursion. 2. Calculate the time complexity. 3. If 64 disks are in Hanoi Tower, How many times should I move disks / 1. Please create a program that shows the implement of Hanoi tower by using the recursion. print(f`{source} ¡¦ |
|
|
|
|
|
ÀÎÇÏ´ë µ¥ÀÌÅͱ¸Á¶ 9ÁÖÂ÷ Homework3 Maxheap / 1. Problem definition 2. Algorithm and simple code description(function¡¯s role) 1) How to solve the problem(Algorithm) 2) Simple code description(function¡¯s role) 3. Results and results screen 4. Conclusion / 1. Problem definition ÃÖ´ë Èü(Max Heap)Àº ¿ÏÀü ÀÌÁø Æ®¸®ÀÇ ÀÏÁ¾À¸·Î, °¢ ³ëµå°¡ ±× ÀÚ½Ä ³ëµåµé¡¦ |
|
|
|
|
|
Åë½ÅÀÌ·Ð2 Homework3 ¸¸Á¡°úÁ¦ / 1. °¢ Åë½Å¿¡ ´ëÇÑ ÃÖÀû ¼ö½Å±â¸¦ C code·Î ±¸ÇöÇÏ°í, bit error rate¸¦ ±¸ÇϽÿÀ. 2. BPSK¿Í DS/BPSKÀÇ BER °ü°è¸¦ ÀÌ·ÐÀûÀ¸·Î ¼³¸íÇϽÿÀ. / 1. °¢ Åë½Å¿¡ ´ëÇÑ ÃÖÀû ¼ö½Å±â¸¦ C code·Î ±¸ÇöÇÏ°í, bit error rate¸¦ ±¸ÇϽÿÀ. 0; // ¼ö½ÅµÈ ½ÅÈ£°¡ ¾ç¼ö¸é 1, À½¼ö¸é 0} double calculate_ber(int transmitted_bits, int received_bits, int num_bi¡¦ |
|
|
|
|
|
Åë½ÅÀÌ·Ð2 Homework2 ¸¸Á¡°úÁ¦ / 1. °¢ Åë½Å¿¡ ´ëÇÑ signal space¸¦ ±×¸®°í, ÃÖÀû ¼ö½Å±â¸¦ C code·Î ±¸ÇöÇÏ°í, °¢ ¹æ¹ý¿¡ ´ëÇÑ bit error rate¸¦ ±¸ÇϽÿÀ. 2. BPSK#1, BPSK#2, BPSK#3ÀÇ BER °ü°è¸¦ ÀÌ·ÐÀûÀ¸·Î ¼³¸íÇϽÿÀ. 3. BPSK#1°ú QPSKÀÇ BER °ü°è¸¦ ÀÌ·ÐÀûÀ¸·Î ¼³¸íÇϽÿÀ. / 1. °¢ Åë½Å¿¡ ´ëÇÑ signal space¸¦ ±×¸®°í, ÃÖÀû ¼ö½Å±â¸¦ C code·Î ±¸ÇöÇÏ°í, °¢ ¹æ¹ý¿¡ ´ëÇÑ bi¡¦ |
|
|
|
|
|
1. ¹®Á¦ Á¤ÀÇ ·Îº¿°øÇÐÀº ´Ù¾çÇÑ ±â¼úÀû µµÀü°úÁ¦¸¦ Æ÷ÇÔÇÏ°í ÀÖÀ¸¸ç, ÀÌ·¯ÇÑ µµÀü°úÁ¦¸¦ ÇØ°áÇϱâ À§ÇÑ ¿¬±¸¿Í °³¹ßÀº Áß¿äÇÏ´Ù. À̹ø °úÁ¦¿¡¼´Â.. / 1. ¹®Á¦ Á¤ÀÇ 2. °á°ú 3. ÀÌ·Ð ¹è°æ 4. °á·Ð 5. Appendix A. Program Source Code 6. Appendix B. µ¥ÀÌÅÍ (u, u_dot) / 1. ¹®Á¦ Á¤ÀÇ ·Îº¿°øÇÐÀº ´Ù¾çÇÑ ±â¼úÀû µµÀü°úÁ¦¸¦ Æ÷ÇÔÇÏ°í ÀÖÀ¸¸ç, ÀÌ·¯ÇÑ µµÀü°úÁ¦¸¦ ÇØ°áÇϱâ À§ÇÑ¡¦ |
|
|
|
|
|
1. ¹®Á¦ Á¤ÀÇ ¹®Á¦ Á¤ÀÇ´Â ·Îº¿°øÇÐ °úÁ¦ÀÇ ÇÙ½ÉÀûÀÎ ºÎºÐÀ¸·Î, ¼öÇàÇØ¾ß ÇÒ °úÁ¦°¡ ¹«¾ùÀÎÁö ¸íÈ®È÷ ±Ô¸íÇÏ´Â °úÁ¤ÀÌ´Ù. ÀÌ ´Ü°è¿¡¼´Â ·Îº¿ ½Ã.. / 1. ¹®Á¦ Á¤ÀÇ 2. °á°ú 3. ÀÌ·Ð ¹è°æ 4. °á·Ð 5. Appendix A. Program Source Code 6. Appendix B. µ¥ÀÌÅÍ / 1. ¹®Á¦ Á¤ÀÇ ¹®Á¦ Á¤ÀÇ´Â ·Îº¿°øÇÐ °úÁ¦ÀÇ ÇÙ½ÉÀûÀÎ ºÎºÐÀ¸·Î, ¼öÇàÇØ¾ß ÇÒ °úÁ¦°¡ ¹«¾ùÀÎÁö ¸íÈ®È÷ ±Ô¸íÇÏ´Â °úÁ¤ÀÌ¡¦ |
|
|
|
|
|
Á¶¼±´ëÇб³ 2022-1Çбâ ÄÄÇ»ÅÍ ³×Æ®¿öÅ© homework1 / 1. ¹°¸®Ãþ Physical Layer 2. µ¥ÀÌÅÍ ¸µÅ©Ãþ Data Link Layer 3. ³×Æ®¿öÅ© Ãþ Network Layer 4. Àü¼ÛÃþ Transport Layer 5. ÀÀ¿ëÃþ Application Layer / 1. ¹°¸®Ãþ Physical Layer ¹°¸®ÃþÀº ÄÄÇ»ÅÍ ³×Æ®¿öÅ©ÀÇ OSI ¸ðµ¨¿¡¼ °¡Àå ³·Àº °èÃþÀ¸·Î, µ¥ÀÌÅÍ Àü¼ÛÀÇ ¹°¸®Àû Ãø¸éÀ» ´ã´çÇÏ´Â Áß¿äÇÑ ¿ªÇÒÀ» ÇÑ´Ù. ÀÌ °èÃþÀº Àü¼Û ¸Å¡¦ |
|
|
|
|
|
¼¼Á¾´ëÇб³ ELP1 homework assignment 4 / 1. Instructions / 1. Instructions ÀÌ °úÁ¦ÀÇ ÁöħÀº ÁÖ¾îÁø ÁÖÁ¦¸¦ öÀúÈ÷ ºÐ¼®ÇÏ°í À̸¦ ¸íÈ®ÇÏ°Ô Ç¥ÇöÇÏ´Â °ÍÀ» ¸ñÇ¥·Î ÇÑ´Ù. ÇлýµéÀº ¸ÕÀú ÁÖÁ¦¸¦ Á¤È®È÷ ÀÌÇØÇÏ°í ±×¿¡ ´ëÇÑ ±íÀÌ ÀÖ´Â ÀÚ·á Á¶»ç¸¦ ÁøÇàÇØ¾ß ÇÑ´Ù. ÁÖÁ¦¿Í °ü·ÃµÈ ´Ù¾çÇÑ ÀڷḦ Ž»öÇÏ¸é¼ ÇÊ¿äÇÑ Á¤º¸¿Í ÀڷḦ ¼öÁýÇÏ´Â °úÁ¤ÀÌ ÇʼöÀûÀÌ´Ù. ÀÌ °úÁ¤¿¡¼ ½Å·ÚÇÒ ¼ö ¡¦ |
|
|
|
|
|
[Public Sector Problem-Solving Theories]homework assignment 2 / 1) freeing 2) facilitating 3) simulating 4) subsidies 5) taxes 6) establishing rules 7) supplying goods through nonmarket mechanisms 8) providing insurance and cushions / 1) freeing FreingÀº °ø°ø ºÎ¹®¿¡¼ ¹®Á¦¸¦ ÇØ°áÇϱâ À§ÇÑ Áß¿äÇÑ Á¢±Ù ¹æ½ÄÀ¸·Î, ±âÁ¸ÀÇ Á¦¾àÀ» Á¦°ÅÇÏ°í »õ·Î¿î »ç°í¸¦ ¡¦ |
|
·¹Æ÷Æ® >
±âŸ  | 
7p age   | 
3,000 ¿ø
|
|
|
|
|