GEDB029: Basis and Practice in Programming (Fall 2018)
|9/12||Data Types & Basic I/O||Exercise||Exercise 1|
|9/19||Conditional Statement||Exercise||Exercise 2|
|10/10||Repetitive Statement||Exercise||Exercise 3|
|10/31||Arrays & Pointers||Exercise||Exercise 2|
|11/7||Multi-Dimensional Arrays & Strings||Exercise||Exercise 2|
|11/14||Pointers II||Exercise||Exercise 1|
|11/21||Structures & Linked-List||Exercise||Exercise 0|
|11/28||File I/O||Exercise||Exercise 0|
|12/5||Data Structures||Exercise||Exercise 0|
|12/10||Course summary (Mon. 13:30 ~ 14:45)|
|12/17||Final exam (Mon. 12:00 ~ at 400202)|
Homework 1 (Due: 10/16 23:59)
- (10/11) Problem 2: Sample I/O has been fixed. '1' is not a prime number.
- (10/14) Problem 2: C and D are always different.
Homework 2 (Due: 11/13 23:59)
- (11/08) Problem 1: If you need to change several parts, try replacing them from the left. If B is created by replacing B in A, then it must be replaced again.
Homework 3 (Due: 11/27 23:59)
Team Project (Due: 12/11 23:59)
- (12/02) To be used as a buffer in a scanf function, limit the length of the key to a maximum of 100 characters. However, each key must be stored in a minimal amount of space through dynamic allocation.