Presenting Data (Part1)
Presenting Data (Part2)
Script Control (Part 1)
Script Control (Part 2)
Creating Functions
2015년 5월 30일 토요일
2015년 5월 27일 수요일
[C++ Take-home final exam] Due: June 11)
20 %of final exam
(Note: Written final exam (80%) + Take-home exam (20%) = Final exam (100%))
pdf
(Note: Written final exam (80%) + Take-home exam (20%) = Final exam (100%))
__ ___ __ .ama , ,d888a ,d88888888888ba. ,88"I) d a88']8i a88".8"8) `"8888:88 " _a8' .d8P' PP .d8P'.8 d) "8:88:baad8P' ,d8P' ,ama, .aa, .ama.g ,mmm d8P' 8 .8' 88):888P' ,d88' d8[ "8..a8"88 ,8I"88[ I88' d88 ]IaI" d8[ a88' dP "bm8mP8'(8'.8I 8[ d88' `" .88 ,88I ]8' .d'.8 88' ,8' I[ ,88P ,ama ,ama, d8[ .ama.g [88' I8, .d' ]8, ,88B ,d8 aI (88',88"8) d8[ "8. 88 ,8I"88[ ]88 `888P' `8888" "88P"8m" I88 88[ 8[ dP "bm8m88[.8I 8[ ]88, _,,aaaaaa,_ I88 8" 8 ]P' .d' 88 88' ,8' I[ `888a,. ,aadd88888888888bma. )88, ,]I I8, .d' )88a8B ,d8 aI "888888PP"' `8""""""8 "888PP' `888P' `88P"88P"8m"
..--------------------.. |``--------------------''| | | | ,,,;;;;;;,,, | | ,;;;;;;;;;;;;;;;;, | | ;;;;;;;;;;;;;;;;;;;; | | ;;;;;;;;;''' _ '';;; | | _'''_ _ (_' | ` | | |_) |_ |_) ._) | | | .| |_ | ..... | | :::.. ...::::::::: | | :::::::::::::::::::: | | '::::::::::::::::' | | '''::::::''' | | | | | ';----..............----;' '--------------------'
2015년 5월 26일 화요일
[Final Exam Date] June 15 (Mon)
Final exams for C++, Unix Morning and Afternoon classes will be taken on June 15 (Mon), 2015. The same classroom and class hour are for the exams
Keep up with your study!!
Keep up with your study!!
2015년 5월 20일 수요일
[C++] Hint for Homework 12
\ \ __ \ \ | \ > Pretty Difficult >------| \ ______ / / --- \_____/**|_|_\____ | / / \_______ --------- __>-} /----------------------------------/ / \_____|_____/ | * | {O}template< typename NODETYPE >
bool List< NODETYPE >::removeFromFront( NODETYPE &value )
{
if ( isEmpty() ) // List is empty
return ?????; // delete unsuccessful
else
{
ListNode< NODETYPE > *tempPtr = firstPtr; // hold tempPtr to delete
if ( firstPtr == lastPtr )
no nodes remain after removal;
else
point to previous 2nd node
// return data being removed
delete tempPtr; // reclaim previous front node
return true; // delete successful
} // end else
} // end function removeFromFront
--------------------------------------------------------------------------------------------------
template< typename NODETYPE >
bool List< NODETYPE >::removeFromBack( NODETYPE &value )
{
if List is empty
return ???; // delete unsuccessful
else
{
ListNode< NODETYPE > *tempPtr = lastPtr; // hold tempPtr to delete
if List has one element
no nodes remain after removal
else
{
ListNode< NODETYPE > *currentPtr = firstPtr;
// locate second-to-last element
while ( currentPtr->nextPtr != lastPtr )
move to next node;
remove last node
this is now the last node
} // end else
return value from old last node
reclaim former last node
return ???
} // end else
} // end function removeFromBack
2015년 5월 19일 화요일
[C++, Unix Systems] No more homework will be assigned by this week (May, 25)
Have a nice weekend ^.^*
__________________________________________________ | _____________________________ | | [1] [2] _____________________________ [_][_][_] | | [3] [4] [_][_][_] [_][_][_][_] [_][_] [_][_][_] | | [5] [6] [][][][][][][][][][][][][][_] [1][2][3] | | [7] [8] [_][][][][][][][][][][][][][] [4][5][6] | | [9][10] [__][][][][][][][][][][][][_] [7][8][9] | | [11][12] [___][][][][][][][][][][][__] [__][0][] | | [_][______________][_] | |__________________________________________________|
[Unix] Homework 10 (Due: May 26)
pdf
Just make your shell script simple!!. Don't think about this homework too much.
It is just one piece of homework
- docx file format will not be given. Use previous homework template!!)
Just make your shell script simple!!. Don't think about this homework too much.
It is just one piece of homework
- docx file format will not be given. Use previous homework template!!)
_______________ |*\_/*|________ | ___________ | ||_/-\_|______ | | | | | | | | | | | 0 0 | | | | 0 0 | | | | - | | | | - | | | | \___/ | | | | \___/ | | | |___ ___| | | |___________| | |_____|\_/|_____| |_______________| _|__|/ \|_|_.............._|________|_ / ********** \ / ********** \ / ************ \ / ************ \ -------------------- --------------------
[C++] Homework 12 (Due: May 26)
pdf
- docx file format will not be given. Use previous homework template!!)
- You can find several sources related to linked list algorithms using Googling!!. But I want you to do this homework for yourself..
- docx file format will not be given. Use previous homework template!!)
- You can find several sources related to linked list algorithms using Googling!!. But I want you to do this homework for yourself..
! ! ! ! ! ! ! . ! ! . ! ^^^^^^^^^ ^ ^ ^ ^ (0) (0) ^ ^ "" ^ ^ *************** ^ ^ * * ^ ^ * /\ /\ /\ * ^ ^ * * ^ ^ * /\ /\ /\ /\ * ^ ^ * * ^ ^ * * ^ ^ * * ^ ^ * * ^ ^* * ^ ^ * * ^ ^ * * ^ ^ * ) ( * ^ ^^^^^^^^ ^^^^^^^^^
2015년 5월 11일 월요일
[C++] Homework 11 (Due Date: May 18, 2015)
2015년 5월 7일 목요일
[Unix] Homework 9 - UDP Chatting (May 13)
2015년 5월 5일 화요일
피드 구독하기:
글 (Atom)