๐Ÿ“Certificate/Engineer Information Processing

[์ •๋ณด์ฒ˜๋ฆฌ๊ธฐ์‚ฌ] ์‹ค๊ธฐ ํ”„๋กœ๊ทธ๋ž˜๋ฐ์–ธ์–ด 3๋ฌธ์ œ (25)

Sun A 2024. 10. 5. 22:55

1๏ธโƒฃ [SQL]

2021.2ํšŒ

๋‹ค์Œ์€ Inner Join์„ ํ•˜๊ธฐ ์œ„ํ•œ SQL์ด๋‹ค. ๋นˆ์นธ์— ๋“ค์–ด๊ฐˆ ๋ฌธ๊ตฌ๋ฅผ ์ ์œผ์‹œ์˜ค.

SELECT .... FROM ํ•™์ƒ์ •๋ณด a JOIN ํ•™๊ณผ์ •๋ณด b (   A   ) a.ํ•™๊ณผ = b.(   B   )
(A) ON
(B) ํ•™๊ณผ

* JOIN ํ‚ค์›Œ๋“œ 

- ์กฐ๊ฑด์‹์„ ์ด์šฉํ•˜๋Š” ๊ฒฝ์šฐ : ON

- ๊ณตํ†ต ์นผ๋Ÿผ์„ ์ด์šฉํ•˜๋Š” ๊ฒฝ์šฐ : USING

 

2๏ธโƒฃ [C์–ธ์–ด]

2021.2

๋‹ค์Œ์€ C์–ธ์–ด์— ๊ด€ํ•œ ์†Œ์Šค์ฝ”๋“œ์ด๋‹ค. ์‹คํ–‰ ๊ฒฐ๊ณผ๊ฐ’์„ ์ž‘์„ฑํ•˜์‹œ์˜ค.

int mp(int base, int exp);
int main(){
   int res;
   res = mp(2,10);
   printf("%d",res);
   return 0;
}

int mp(int base, int exp) {
   int res = 1;
   for(int i=0; i < exp; i++){
      res = res * base;
   }
   
   return res;
}
1024

for(int i =0, i < 10, i ++)

base ๊ฐ’์ด 2์ธ๋ฐ for ๋ฐ˜๋ณต๋ฌธ์˜ res = res*base ๋ฅผ ๋ณด๋ฉด exp ๋ณด๋‹ค ์ž‘์€ ๋งŒํผ ๋ฐ˜๋ณตํ•˜์—ฌ 2๋ฅผ ๊ณฑํ•œ๋‹ค.

1 * 2

2 * 2

4 * 2 = 2 * 2 * 2

...

์ด ๋ฐฉ์‹๋Œ€๋กœ ํ•˜๋Š” ๊ฒƒ์€ 2๋ฅผ ๋ช‡ ๊ฐœ ๊ณฑํ•˜๋ƒ๋ฅผ ๊ตฌํ•˜๋Š” ๊ฒƒ์ด๋‹ค. ์ด 10๋ฒˆ ๊ณฑํ•˜๋Š” ๊ฒƒ์ด๊ธฐ ๋•Œ๋ฌธ์— 2^10์˜ ๊ฐ’์„ ๊ตฌํ•˜๋ฉด ๋œ๋‹ค.

1024

 

3๏ธโƒฃ [C์–ธ์–ด]

2024.2

๋‹ค์Œ C์–ธ์–ด๋กœ ๊ตฌํ˜„๋œ ํ”„๋กœ๊ทธ๋žจ์„ ๋ถ„์„ํ•˜์—ฌ ๊ทธ ์‹คํ–‰ ๊ฒฐ๊ณผ๋ฅผ ์“ฐ์‹œ์˜ค.

#include 

struct node {
	int n1;
	struct node *n2;
};

int main() {
	struct node a = {10, 0};
	struct node b = {20, 0};
	struct node c = {30, 0};

	struct node *head = &a;
	a.n2 = &b;
	b.n2 = &c;

	printf("%d", head -> n2 -> n1);

        return 0;
}
20

์‰ฝ๊ฒŒ ์ž‘์„ฑํ•˜๋ฉด head์˜ ์ฃผ์†Œ๊ฐ’์ด a๊ฐ€ ๋˜๋Š”๋ฐ a์˜ n2์—๋Š” b์˜ ์ฃผ์†Œ๊ฐ’์ด ๋“ค์–ด๊ฐ„๋‹ค.

= {10, {20, 0}} (๋‚ด๊ฐ€ ์•Œ์•„๋ณด๊ธฐ ์‰ฝ๊ฒŒ ์ ์€ ๊ฒƒ)

๊ทธ ๋‹ค์Œ b์˜ n2์—๋Š” c์˜ ์ฃผ์†Œ๊ฐ’์ด ๋“ค์–ด๊ฐ€๊ธฐ ๋•Œ๋ฌธ์— ์ตœ์ข…์ ์œผ๋กœ ์•„๋ž˜์™€ ๊ฐ™๋‹ค

= {10, {20, {30, 0}}}

์—ฌ๊ธฐ์„œ printํ•ด์•ผํ•˜๋Š” ๊ฐ’์€ head์˜ n2์˜ n1 ๊ฐ’

head์˜ n2๋Š” {20, {30, 0}}

์—ฌ๊ธฐ์„œ n1์€ 20