U E D R , A S I H C RSS

새싹교실/2011/데미안반

1.

3/163/233/303/314/74/275/45/115/185/256/8
O O O O O O O O O O O
O O O O O O O O X O O
O O O O O O O O O O

2.1. 1회(3/16)

  • - 10:00 ~ 12:00

2.1.1.

  • C
  • C &



/* Hello.c */
#include <stdio.h>
int main(void) 
{
  printf("Hello, World!\n");
  return 0;
}

2.1.2. QnA

  • ?
    • ApplicationDB
      core
      . (3-1학) . (4-1학) . , C ㅎㅎ
  • ; ?
    • ; , printf("Hello World"); .
  • C low-level , ?
    • ...
  • printf ?
    • , 해하 .
  • C B A ?
    • A : ALGOL . ( ) 포트ForTran 항하 . ALGOL Algorithm Language , . 하 ALGOL C (ALGOL-like programming language) . 크! 클:)
  • .obj 파 ?
    • ㅠㅠ Visual Studio . 010100 하 16 .

2.1.3.

  • - C . %d .
    . .
  • - . A ㅎㅎ . scanf . PPT , :)
  • - C 해 할 ^^ ~.

2.2. 2회(3/23)

  • : 10:00 ~ 12:00

2.2.1.

  • , - printf, scanf
  • redirection




#include <stdio.h> //printf 함 
int main(void)
{
  int val1 = 4;
  int val2 = 2;

  printf("  : %d\n", val1+val2);
  printf("  : %d\n", val1-val2);

  return 0;


#include <assert.h> //assert 함 
int main(void)
{
  int val1 = 4, val2 = 2;
  val1 += 3;
  val2 *= 2;
  assert(val1 == 7); //val1 7   ,    
  assert(val2 == 4); //val2 4   ,    

  return 0;
}
  • ,

#include <assert.h> //assert 함 
int main(void)
{
  int val = 10;

  assert(val++ == 10); //val++한  10  .   
  assert(++val == 12); //++val한  12  .   

  return 0;
}


#include <assert.h> //assert 함 
int main(void)
{
  int val1 = 10;
  int val2 = 12;

  assert(val1 <= val2); //val2 val1  .   

  return 0;
}


#include <assert.h> //assert 함 
int main(void)
{
  int val1 = 10;
  int val2 = 12;

  assert(val1 < val2 && val2 == 12); //val2 val1, val2 12  .   
  assert(val1 > val2 || val2 != 11); //val2 val1, val2 11  .   

  return 0;
}

2.2.2.

  • val1 val2 , , .
  • assert(val1 == 7); assert(val1 != 7); 행해.
  • -= , /= , %= 한 assert(val1 == 7); assert함 .
  • .
  • >= , != ( val3 ).
  • (float) 2 (scanf), , (assert)

2.2.3.



#include <stdio.h>

int main()
{
	int val1 = 4;
	int val2 = 2;
   
	printf ("%d\n",val1*val2);
	
	system("pause");

	return 0;
}
#include <stdio.h>

int main()
{
	int val1 = 4;
	int val2 = 2;

	printf ("%d\n", val1/val2);

	system("pause");

	return 0;
}
#include <stdio.h>

int main()
{
	int val1 = 3;
	int val2 = 2;

	printf("%d\n", val1%val2);

	system("pause");

	return 0;

}
#include <assert.h>

int main()
{
	int val1 = 4, val2 = 2;
	val1 += 3;
	val2 *= 2;
	assert(val1 != 7);//printf      assert  .
	assert(val2 != 4);// ~
//   행하    74    ???
	return 0;
}
#include <assert.h>

int main()
{
	int val1 = 10, val2 = 8;
	val1 -= 3;
	val2 /= 2;
	assert(val1 != 7);
	assert(val2 != 4);

	return 0; //      (  )
}
#include <assert.h>

int main()
{
	int val1 = 4, val2 = 2;
	val1 %= 3;
	val2 %= 2;
	assert(val1 != 1);
	assert(val2 != 0);

	return 0; //  ;;
}
#include <assert.h>
int main()
{
	int val = 15;

	assert(--val == 14);
	assert(val-- == 14);

	system("pause");

	return 0;
}
#include <assert.h>

int main()
{
	int val1 = 13;
	int val2 = 12;
	int val3 = 13;

	assert(val1 >= val2);
	assert(val1 != val3);

	return 0; //       ;;  main()  void  
	//    void ???
}
#include <assert.h>

int main()
{
	float val1,val2;

	scanf("%d %d", &val1, &val2);

	assert(val1 < val2 && val2 == 12);
	assert(val1 < val2 || val1 != 11);

	return 0; //           .
	//  float  ???
	//  int   ???
}

2.2.4. QnA

  • assert ?

#include <assert.h>
int main()
{
	int val1 = 10, val2 = 8;
	val1 -= 3;
	val2 /= 2;
	assert(val1 != 7);
	assert(val2 != 4);

	return 0;
}
  • assert val1 7 ! val2 4 ! . 하 val1 7, val2 4 . assert != . == , != .
  • int main(void) void ?
    • void !! , .

2.2.5.

  • - printf scanf 해 할 . .^^
  • - printf scanf . ..
  • - 4 6 , 히 6 . 11 12 ㅠㅠ printf scanf , - . .(?!) , . , .

2.3. 3회(3/30)

  • - 11:00 ~ 12:00

2.3.1.

  • #define ?
    • 행파

    • (Symbolic)

    • ?



PPT :)

2.3.2. QnA

  • 2 , ?
    • 2 2 . 0000 0010 형태 1000 0010 , 2 형태 1111 1110 ! . 2-2 0 , 2+(-2)형태 0000 0010 1111 1110 해 0000 0000 . ㅠㅠㅋ

2.3.3.

  • - . #include<stdio.h>
. int, char . .^^
  • - . const define . .
형/ . 평 .
.
char, int, float, double .
  • - 1 , 학 . . , ! ㅋㅋ

2.4. 4회(3/31)

  • - 18:00 ~ 19:00

2.4.1.


    • while

#include <stdio.h>
int main()
{
  int i = 1;
  while(i<=10)
  {
    printf("%d \n",i);
    i++;
  }
  return 0;
}
  • do~while

#include <stdio.h>
int main()
{
  int i = 1;
  do
  {
    printf("%d \n",i);
    i++;
  }while(i<=10);
  return 0;
}
  • for

#include <stdio.h>
int main()
{
  int i;
  for(i=1; i<=10; i++)
  {
    printf("%d \n",i);
  }
  return 0;
}

    • for

#include <stdio.h>
int main()
{
  int i, j;
  for(i=0; i<2; i++)
  {
     printf("j for  i=%d\n",i);
     for(j=0; j<3; j++)
     {
        printf("  for! j=%d\n",j);
     }
     printf("j for  i=%d\n",i);
  }
  return 0;
}

2.4.2.

  • - printf for while or do while . .
  • - . for while, do while .
while .
. .
  • - , . . @ㅁ@;; ... ㅠㅠ !하 ㅋㅋ ... .. ㅋㅋㅋㅋㅋㅋㅋ !!(?!) 합하 ㅠㅠㅠㅠㅋ

2.5. 5회(4/7)

  • - 18:30 ~ 20:30

2.5.1.

  • if, else if, else
  • switch, break, continue
  • if, switch, while 활

#include <stdio.h>
#include <stdlib.h>
int main()
{
	int choice=0;//int형    화
	char day;//char형  
	while(1)
	{
		printf(" \n");
		printf(" (1: 2: 3: 4: 0:) ");
		do
		{
			scanf("%d",&choice);//  
			switch(choice)
			{
			case 1:
				printf(", ");
				break;
			case 2:
				printf(", ");
				break;
			case 3:
				printf(", ");
				break;
			case 4:
				printf(", ");
				break;
			case 0:
				printf("() .\n");
				break;
			default:
				printf(", ");
				break;
			}
		}while(choice != 0);

		printf(" .\n");
		printf("    (1: 2:PC 3:) ");
		scanf("%d",&choice);// 
		switch(choice)
		{
		case 1:
			printf(" .");
			break;
		case 2:
			printf("PC .");
			break;
		case 3:
			printf(" .");
			break;
		default:
			printf("     .");
			break;
		}

		printf("     .\n");
		printf(" ?(y:yes n:no) ");
		fflush(stdin);// . '\n'  .
		scanf("%c",&day);//'%c'  .
		if(day == 'n')
		{
			printf("  .\n");
			break;
		}
		system("pause");//
		system("cls");//clear screen
	}
}


#include <stdio.h>
int main()
{
	int i,j,h;
	for(i=1;i<=10;i++)//10 
	{
		for(j=1;j<=i;j++)// 
		{
			printf("*");
		}
		printf("\n");
	}
	return 0;
}

2.5.2.

  • h .
(ex)h=5 형태.
*****
****
***
**
*
  • h O .
(ex)h=5 형태.
    O
   OO
  OOO
 OOOO
OOOOO

2.5.3.



#include <stdio.h>

int main()
{
	int i,j;

	for(i=1;i<=5;i++)
	{
		for(j=5;i<=j;j--)
			printf("*");
		printf("\n");
	}
	return 0;
}
#include<stdio.h>

int main()
{
	int i,j,h;

	scanf("%d",&h);

	for(i=0;i<h;i++)
	{
		for(j=1;h-i>j;j++) 
			printf(" ");
		for(j=0;i>=j;j++)
			printf("o");
		
	printf("\n");
	}
	return 0;
}//한    ㅇㅅㅇ    ㅋ?

2.5.4. QnA

  • .
    • .

2.5.5.

  • - if ^^ if 한 switch :)
  • - . if .
.
  • - if,for,while,switch , 행하. i+=2 , continue 행해. . ~ㅁ~

2.6. 6회(4/27)

  • - 10:00 ~ 11:30

2.6.1.

  • rand() up-down

#include <stdio.h>
#include <stdlib.h> //srand, rand
#include <time.h> //time
int main()
{
	int num, i;
	srand((unsigned)time(NULL));  
	printf("%u\n",(unsigned)time(NULL));
	for(i=0; i<10;i++){
		num=rand()%5;
		printf("%d ",num);
	}
	return 0;
}

2.6.2.



#include <stdio.h>
#include <stdlib.h> //srand, rand
#include <time.h> //time
int main()
{
	int num,i,min=0,max=99;
	srand((unsigned)time(NULL));
	num=rand()%100;

	
	while(1){
		scanf("%d",&i);
		if(num>i){
			printf("up\n");
			if(min<i){
				min=i;
				}
			printf("%d %d \n",min,max);	
		}else if(num<i){		
			printf("down\n");
			if(max>i){
				max=i;
				}
			printf("%d %d \n",min,max);
		}else break;
	}
	

	return 0;

}



#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main()
{
	int n,a,min=0,max=99;

	srand((unsigned)time(NULL));
	n = rand()%100;
	

	while(1)
	{
		scanf("%d",&a);
		if(a<n){
			if(a>min) min=a;
			printf("up (%d<n<%d)\n",min,max); 
		}
		else if(a>n){
			if(max>a) max=a;
			printf("down (%d<n<%d)\n",min,max);
		}
		else
			break;
	
	}
	return 0;
}


2.6.3.

  • 1~9 .


3 * 5 => // 13 ( )
.
3 * 5 => // 15 ( )
.
?(y: yes, n: no) => n
7 * 9 => // 63 ( )
.
?(y: yes, n: no) => y

2.6.4.



#include <stdio.h>
#include <stdlib.h>
#include <time.h>
int main()
{
	int a,b,c,i;
	srand((unsigned)time(NULL));
	while(1){a=(rand()%9)+1;
	b=(rand()%9)+1;
	printf("%d*%d=",a,b);

	while(1){
		scanf("%d",&i);
		if(i==a*b) break;
		else printf("\n");
	}
	printf(".\n");
	printf("?(0:quit 1:continue)\n");
	scanf("%d",&c);
	if(c==0) break;
	else system("cls");
	}
	return 0;
}

*
#include <stdio.h>
#include <stdlib.h>
#include <time.h>

int main()
{
	int n,m,a;
	char d,y='y';

	srand((unsigned)time(NULL));
	
	
	while(1)
	{
		n = rand()%9+1;
		m = rand()%9+1;	
		
		while(1)
		{
		printf("%d*%d=?",n,m);
		scanf("%d",&a);
		
		if(n*m==a) 
		{
			printf("%d*%d => // %d\n\n?(y: yes, n: no)",n,m,a);
			fflush(stdin);
			scanf("%c",&d);

			if(d==y) 
			{
				printf(" => y\n"); 
				exit(0);
		    }
			else printf(" => n\n");
			break;
		}
		else
		{
			printf("%d*%d => // %d ( )\n.)",n,m,a);
		}
		}
	}
	
	return 0;
}

2.6.5.

  • - ^srand rand up down .^
  • - rand srand . .
  • - while, if, break, continue 통해 .

2.7. 7회(5/4)

  • - 10:30 ~ 12:30

2.7.1.


    • 4
  • variable
    • global, local, static, register
  • call by value

2.7.2.

  • - ^ static .^ 하 C . 히 Recursive function 확한 통하 . 항 .
  • - . . .
  • - 함 형태 환형 4 . , . . factorial gcd .

2.8. 8회(5/11)

  • - 11:00 ~ 12:00

2.8.1.


  • hw2

2.8.2.

  • - 한 . !? ! . 확한 -. 확한 3학 divide&conquer ...<< 간단히 설명하자면 한번에 풀기 힘드니까 나눠서 풀자는 내용입니다.
  • -
  • -

2.9. 9회(5/18)

  • - 10:00 ~ 11:00

2.9.1.

  • Function Call Stack
    • , stack stack . LIFO(Last In First Out) ..



  • 1
    • :
    • 형:
    • :

    • (null) .
    • (null) : \0 ( 0)
    • (null)


      • Printf함 통해 .

2.9.2.

  • (2): . .


#include <stdio.h>

int main()
{
	char array[20],max;
	int i;
	scanf("%s", &array);
	max=array[0];
	for(i=0;i<20;i++){
		if(array[i+1]>array[i]) max=array[i+1];
		if(array[i]==NULL) break;
						
	}
	printf("%c", max);

	return 0;
}

2.9.3.

  • - (?) . .
  • -
  • - . 2 .

2.10. 10회(5/25)

  • - 10:30 ~ 11:30

2.10.2.

  • - 해 평 히 한 . :) 해 할 .!!! . ㅋㅋ
    • ~ㅁ~ㅋㅋ 40 !ㅋㅋ -
  • - 2 한 행 . sort search ... ! /ㅁ/ ㅎㅎ

2.11. 11회(6/8)

  • - 10:30 ~ 12:00

2.11.1.


  • ?

2.11.2.

  • - ... 한해 . .. ;ㅅ; 3 , .. , . ㅠㅠ

  • !! 한편 . ~ -
    • ㅎㅎ 히 하 ㅋㅋㅋ -


Valid XHTML 1.0! Valid CSS! powered by MoniWiki
last modified 2021-02-07 05:29:43
Processing time 0.1302 sec