chap8.PDF

Similar documents
int main(void) int a; int b; a=3; b=a+5; printf("a : %d \n", a); printf("b : %d \n", b); a b 3 a a+5 b &a(12ff60) &b(12ff54) 3 a 8 b printf(" a : %x \

untitled

ๆญฏ7์žฅ.PDF

chap7.PDF

ๆญฏ9์žฅ.PDF


๋น„ํŠธ์™€๋ฐ”์ดํŠธ ๋น„ํŠธ์™€๋ฐ”์ดํŠธ ๋น„ํŠธ (Bit) : 2์ง„์ˆ˜๊ฐ’ํ•˜๋‚˜ (0 ๋˜๋Š” 1) ๋ฅผ์ €์žฅํ• ์ˆ˜์žˆ๋Š”์ตœ์†Œ๋ฉ”๋ชจ๋ฆฌ๊ณต๊ฐ„ 1๋น„ํŠธ 2๋น„ํŠธ 3๋น„ํŠธ... n๋น„ํŠธ 2^1 = 2๊ฐœ 2^2 = 4๊ฐœ 2^3 = 8๊ฐœ... 2^n ๊ฐœ 1 ๋ฐ”์ดํŠธ๋Š” 8 ๋น„ํŠธ 2 2

<4D F736F F F696E74202D20C1A63132B0AD20B5BFC0FB20B8DEB8F0B8AEC7D2B4E7>

Microsoft PowerPoint - Chapter_09.pptx

: 1 int arr[9]; int n, i; printf(" : "); scanf("%d", &n); : : for(i=1; i<10; i++) arr[i-1] = n * i; for(i=0; i<9; i++) if(i%2 == 1) print

03แ„Œแ…กแ†ผ.แ„‰แ…ณแ„แ…ขแ†จ.key

Line (A) รฅ j a k= i k #define max(a, b) (((a) >= (b))? (a) : (b)) long MaxSubseqSum0(int A[], unsigned Left, unsigned Right) { int Center, i; long Max

0. ํ‘œ์ง€์—์ด๋ฆ„๊ณผํ•™๋ฒˆ์„์ ์œผ์‹œ์˜ค. (6) 1. ๋ณ€์ˆ˜ x, y ๊ฐ€ integer type ์ด๋ผ๊ฐ€์ •ํ•˜๊ณ ๋‹ค์Œ๋นˆ์นธ์— x ์™€ y ์˜๊ณ„์‚ฐ๊ฒฐ๊ณผ๊ฐ’์„์ ์œผ์‹œ์˜ค. (5) x = (3 + 7) * 6; x = 60 x = (12 + 6) / 2 * 3; x = 27 x = 3 * (8 / 4

untitled

K&R2 Reference Manual ๋ฒˆ์—ญ๋ณธ

Microsoft PowerPoint - chap11-ํฌ์ธํ„ฐ์˜ํ™œ์šฉ.pptx

Microsoft PowerPoint - ch10 - ์ด์ง„ํŠธ๋ฆฌ, AVL ํŠธ๋ฆฌ, ํŠธ๋ฆฌ ์‘์šฉ pm0600

; struct point p[10] = {{1, 2, {5, -3, {-3, 5, {-6, -2, {2, 2, {-3, -3, {-9, 2, {7, 8, {-6, 4, {8, -5; for (i = 0; i < 10; i++){ if (p[i].x > 0 && p[i

๊ธฐ์ดˆ์ปดํ“จํ„ฐํ”„๋กœ๊ทธ๋ž˜๋ฐ

๋ณธ ๊ฐ•์˜์— ๋“ค์–ด๊ฐ€๊ธฐ ์ „

untitled

11์žฅ ํฌ์ธํ„ฐ


3. 1 ํฌ์ธํ„ฐ๋ž€ 3. 2 ํฌ์ธํ„ฐ๋ณ€์ˆ˜์˜์„ ์–ธ๊ณผ์‚ฌ์šฉ 3. 3 ๋‹ค์ฐจ์›ํฌ์ธํ„ฐ๋ณ€์ˆ˜์˜์„ ์–ธ๊ณผ์‚ฌ์šฉ 3. 4 ์ฃผ์†Œ์˜๊ฐ€๊ฐ์‚ฐ 3. 5 ํ•จ์ˆ˜ํฌ์ธํ„ฐ

ํ”„๋กœ๊ทธ๋žจ์„ ํ•™๊ต ๋“ฑ์ง€์—์„œ ์กฐ๊ธˆ์ด๋ผ๋„ ๋ฐฐ์šด ์‚ฌ๋žŒ๋“ค์„ ์œ„ํ•œ ํ”„๋กœ๊ทธ๋ž˜๋ฐ ๋…ธํŠธ ์ž…๋‹ˆ๋‹ค. ์ € ์—ญ์‹œ ๊ทธ ์‚ฌ๋žŒ๋“ค ์ค‘ ํ•˜๋‚˜ ์ž…๋‹ˆ๋‹ค. ์ค‘๊ณ ๋“ฑํ•™๊ต ์‹œ์ ˆ ํ•™๊ต ๋„์„œ๊ด€, ์ƒˆ๋กœ ์ƒ๊ธด ์‹œ๋ฆฝ ๋„์„œ๊ด€ ๋“ฑ์„ ๋‹ค๋‹ˆ๋ฉฐ ์ฑ…์„ ๋ณด ๊ณ  ์ •๋ฆฌํ•˜๋ฉฐ ์–ด๋Š์ •๋„ ๋…ํ•™์œผ๋ฅด ๊ณต๋ถ€ํ•˜๊ธด ํ–ˆ์ง€๋งŒ, ์ž์ฃผ ์•ˆํ•˜๋‹ค ๋ณด๋ฉด ๊ธˆ๋ฐฉ ์žŠ์–ด

chap10.PDF

C++-ยฟรยบยฎร‡ร˜ยผยณ10ร€รฅ

์ค‘๊ฐ„๊ณ ์‚ฌ

4.18.๊ตญ๊ฐ€์ง 9๊ธ‰_์ „์‚ฐ์ง_์ปดํ“จํ„ฐ์ผ๋ฐ˜_์†๊ฒฝํฌ_ver.1.hwp

Microsoft PowerPoint - ch09 - ์—ฐ๊ฒฐํ˜•๋ฆฌ์ŠคํŠธ, Stack, Queue์™€ ์‘์šฉ pm0100

Cํ”„๋กœ-3์žฅc03้€žํ’š

C ์–ธ์–ด ํ”„๋กœ๊ทธ๋ž˜๋ฐŠ ๊ณผ์ œ ํ’€์ด

13์ฃผ-14์ฃผproc.PDF

C ํ”„๋กœ๊ทธ๋ž˜๋ฐŠ ๊ฐœ์š”

Chapter 4. LISTS

untitled

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

์ด๋ฒˆ์žฅ์—์„œํ•™์Šตํ• ๋‚ด์šฉ ๋™์ ๋ฉ”๋ชจ๋ฆฌ๋ž€? malloc() ์™€ calloc() ์—ฐ๊ฒฐ๋ฆฌ์ŠคํŠธ ํŒŒ์ผ์„์ด์šฉํ•˜๋ฉด๋ณด๋‹ค๋งŽ์€๋ฐ์ดํ„ฐ๋ฅผ์œ ์šฉํ•˜๊ณ ์ง€์†์ ์œผ๋กœ์‚ฌ์šฉ๋ฐ๊ด€๋ฆฌํ• ์ˆ˜์žˆ์Šต๋‹ˆ๋‹ค. 2

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

Microsoft PowerPoint - chap13-์ž…์ถœ๋ ฅ๋ผ์ด๋ธŒ๋Ÿฌ๋ฆฌ.pptx

์Šฌ๋ผ์ด๋“œ 1

untitled

chap 5: Trees

Microsoft PowerPoint - ch07 - ํฌ์ธํ„ฐ pm0415

Microsoft PowerPoint - chap10-ํ•จ์ˆ˜์˜ํ™œ์šฉ.pptx

A Hierarchical Approach to Interactive Motion Editing for Human-like Figures

chap7.key

5.แ„‰แ…ณแ„แ…ขแ†จ(แ„€แ…กแ†ผแ„‹แ…ดแ„Œแ…กแ„…แ…ญ).key

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

Infinity(โˆž) Strategy

[ ๋งˆ์ดํฌ๋กœํ”„๋กœ์„ธ์„œ 1] 2 ์ฃผ์ฐจ 3 ์ฐจ์‹œ. ํฌ์ธํ„ฐ์™€๊ตฌ์กฐ์ฒด 2 ์ฃผ์ฐจ 3 ์ฐจ์‹œํฌ์ธํ„ฐ์™€๊ตฌ์กฐ์ฒด ํ•™์Šต๋ชฉํ‘œ 1. C ์–ธ์–ด์—์„œ๊ฐ€์žฅ์–ด๋ ค์šดํฌ์ธํ„ฐ์™€๊ตฌ์กฐ์ฒด๋ฅผ์„ค๋ช…ํ• ์ˆ˜์žˆ๋‹ค. 2. Call By Value ์™€ Call By Reference ๋ฅผ๊ตฌ๋ถ„ํ• ์ˆ˜์žˆ๋‹ค. ํ•™์Šต๋‚ด์šฉ 1 : ํ•จ์ˆ˜ (Functi

์œค์„ฑ์šฐ์˜ ์—ดํ˜ˆ TCP/IP ์†Œ์ผ“ ํ”„๋กœ๊ทธ๋ž˜๋ฐ

Microsoft PowerPoint - ch08 - ๊ตฌ์กฐ์ฒด (structure) am0845

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

์ œ 14 ์žฅํฌ์ธํ„ฐํ™œ์šฉ ์œ ์ค€๋ฒ” (JUNBEOM YOO) Ver ๋ณธ๊ฐ•์˜์ž๋ฃŒ๋Š”์ƒ๋Šฅ์ถœํŒ์‚ฌ์˜ PPT ๊ฐ•์˜์ž๋ฃŒ ๋ฅผ๊ธฐ๋ฐ˜์œผ๋กœ์ œ์ž‘๋˜์—ˆ์Šต๋‹ˆ๋‹ค.

< E20C6DFBFFEBEEE20C0DBBCBAC0BB20C0A7C7D12043BEF0BEEE20492E707074>

Microsoft PowerPoint - chap03-๋ณ€์ˆ˜์™€๋ฐ์ดํ„ฐํ˜•.pptx

์ปดํŒŒ์ผ๋Ÿฌ

<BBE7B6FBB9E B0A1C0BBC0DBBEF7C1DF2E696E6464>

C++ Programming

Microsoft PowerPoint - chap12-๊ณ ๊ธ‰๊ธฐ๋Šฅ.pptx

๋ชฉ์ฐจ ํฌ์ธํ„ฐ์˜๊ฐœ์š” ๋ฐฐ์—ด๊ณผํฌ์ธํ„ฐ ํฌ์ธํ„ฐ์˜๊ตฌ์กฐ ์‹ค๋ฌด์‘์šฉ์˜ˆ์ œ C 2

<322EBCF8C8AF28BFACBDC0B9AEC1A6292E687770>

ร€ยฉยตยตยณร—ร†ยฎยฟรทร‡รยทรŽยฑร—ยทยกยนร–4ร€รฅ_รƒร–รยพ

<443A5C4C C4B48555C B3E25C32C7D0B1E25CBCB3B0E8C7C1B7CEC1A7C6AE425CBED0C3E0C7C1B7CEB1D7B7A55C D616E2E637070>

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

(Asynchronous Mode) ( 1, 5~8, 1~2) & (Parity) 1 ; * S erial Port (BIOS INT 14H) - 1 -

Microsoft PowerPoint - 8ร€รร‚ยฐ_ร†รทร€รŽร…ร.ppt

13 ์ฃผ์ฐจ๋ฌธ์ž์—ด์˜ํ‘œํ˜„๊ณผ์ž…์ถœ๋ ฅ


Microsoft PowerPoint C-๊ตฌ์กฐ์ฒด

Microsoft PowerPoint - 3ร€รร‚ยฐ_ยบยฏยผรถยฟร ยปรณยผรถ.ppt

4. 1 ํฌ์ธํ„ฐ์™€ 1 ์ฐจ์›๋ฐฐ์—ด 4. 2 ํฌ์ธํ„ฐ์™€ 2 ์ฐจ์›๋ฐฐ์—ด 4. 3 ํฌ์ธํ„ฐ๋ฐฐ์—ด 4. 4 ํฌ์ธํ„ฐ์™€๋ฌธ์ž๊ทธ๋ฆฌ๊ณ ํฌ์ธํ„ฐ์™€๋ฌธ์ž์—ด

C ํ”„๋กœ๊ทธ๋ž˜๋ฐŠ ๊ฐœ์š”

Chapter 4. LISTS

6์ฃผ์ฐจ.key

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

Microsoft PowerPoint - 07_(C_Programming)_(Korean)_Composite_Data_Types

1 ์žฅ C ์–ธ์–ด๋ณต์Šต ํ‘œ์ค€์ž…์ถœ๋ ฅ๋ฐฐ์—ดํฌ์ธํ„ฐ๋ฐฐ์—ด๊ณผํฌ์ธํ„ฐํ•จ์ˆ˜ const์™€ํฌ์ธํ„ฐ๊ตฌ์กฐ์ฒด์ปดํŒŒ์ผ๋Ÿฌ์‚ฌ์šฉ๋ฐฉ๋ฒ• C++ ํ”„๋กœ๊ทธ๋ž˜๋ฐ์ž…๋ฌธ

Lab 4. ์‹ค์Šต๋ฌธ์ œ (Circular singly linked list)_ํ•ด๋‹ต.hwp

, ( ),, ( ), 3, int kor[5]; int eng[5]; int Microsoft Windows 4 (ANSI C2 ) int kor[5] 20 # define #define SIZE 20 int a[10]; char c[10]; float

(Microsoft Word - \301\337\260\243\260\355\273\347.docx)

Microsoft PowerPoint - lab14.pptx

Microsoft PowerPoint - chap02-Cํ”„๋กœ๊ทธ๋žจ์‹œ์ž‘ํ•˜๊ธฐ.pptx

Chapter_06

๋ชฉ์ฐจ ๋ฐฐ์—ด์˜๊ฐœ์š” ๋ฐฐ์—ด์‚ฌ์šฉํ•˜๊ธฐ ๋‹ค์ฐจ์›๋ฐฐ์—ด ๋ฐฐ์—ด์„์ด์šฉํ•œ๋ฌธ์ž์—ด๋‹ค๋ฃจ๊ธฐ ์‹ค๋ฌด์‘์šฉ์˜ˆ์ œ C 2

1์žฅ. ์œ ๋‹‰์Šค ์‹œ์Šคํ…œ ํ”„๋กœ๊ทธ๋ž˜๋ฐ ๊ฐœ์š”

Let G = (V, E) be a connected, undirected graph with a real-valued weight function w defined on E. Let A be a set of E, possibly empty, that is includ

<4D F736F F F696E74202D20C1A63137C0E520B5BFC0FBB8DEB8F0B8AEBFCD20BFACB0E1B8AEBDBAC6AE>

<443A5C4C C4B48555C B3E25C32C7D0B1E25CBCB3B0E8C7C1B7CEC1A7C6AE425CC0E7B0EDB0FCB8AE5C53746F636B5F4D616E D656E74732E637070>

OCaml

Javascript.pages

๊ตฌ์กฐ์ฒด์ •์˜ ์ž๋ฃŒํ˜• (data types) ๊ธฐ๋ณธ์ž๋ฃŒํ˜• (primitive data types) : char, int, float ๋“ฑ๊ณผ๊ฐ™์ด C ์–ธ์–ด์—์„œ์ œ๊ณตํ•˜๋Š”์ž๋ฃŒํ˜•. ์‚ฌ์šฉ์ž์ •์˜์ž๋ฃŒํ˜• (user-defined data types) : ๋‹ค์–‘ํ•œ์ž๋ฃŒํ˜•์„๋ฌถ์–ด์„œ๋ชฉ์ ์—๋”ฐ๋ผ์ƒˆ๋กœ์šด์ž๋ฃŒํ˜•์„

Infinity(โˆž) Strategy

Poison null byte Excuse the ads! We need some help to keep our site up. List 1 Conditions 2 Exploit plan 2.1 chunksize(p)!= prev_size (next_chunk(p) 3

chap01_time_complexity.key

Lab 3. ์‹ค์Šต๋ฌธ์ œ (Single linked list)_ํ•ด๋‹ต.hwp

<4D F736F F F696E74202D20C1A63134C0E520C6F7C0CEC5CD5FC8B0BFEB>

PowerPoint ํ”„๋ ˆ์  ํ…Œ์ด์…˜

Transcription:

8 Hello!! C

2

3

4

struct - {...... }; struct jum{ int x_axis; int y_axis; }; struct - {...... } - ; struct jum{ int x_axis; int y_axis; }point1, *point2; 5

struct {....... } - ; struct{ int x_axis; int y_axis; }point1, *point2; struct - - ; struct jum point1, *point2; 6

Case I. struct number{ doouble real; double imaginary; }; struct number x1; x1.real = 2.0; x1.imaginary = 3.0; 7

[ 8-1] #include <stdio.h> main(){ struct people{ char name; int height; int weight; } data_1,data_2; data_1.name='a'; data_1.height=170; data_1.weight=70; data_2.name='b'; data_2.height=165; data_2.weight=55; printf("data_1.name=%c data_1.height=%d data_1.weight=%d\n", data_1.name,data_1.height,data_1.weight) ; 8

[ 8-1] printf("data_2.name=%c data_2.height=%d data_1.weight=%d\n", data_2.name,data_2.height,data_2.weight) ; } [ ] data_1.name=a data_1.height=170 data_1.weight=70 data_2.name=b data_2.height=165 data_2.weight=55 9

[ 8-2] #include <stdio.h> struct profile { char name[20]; char address[20]; char telephone[20]; char birthday[20]; } data={"han","seoul","361-2528","75/03/10" }; main(){ printf("name address telephone birthday\n"); printf("%s %s %s %s\n", data.name,data.address,data.telephone,data.birthday); } [ ] name address telephone birthday HAN SEOUL 361-2528 75/03/10 10

[ 8-3] #include <stdio.h> struct profile { char name[20]; char address[20]; char telephone[20]; char birthday[20]; } ; main(){ struct profile data={"han","seoul","361-2528","75/03/10" }; printf("name address telephone birthday\n"); printf(" %s %s %s %s\n", data.name,data.address,data.telephone,data.birthday); } [ ] name address telephone birthday HAN SEOUL 361-2528 75/03/10 11

[ 8-4] #include <stdio.h> #include <string.h> struct profile { char name[20]; char address[20]; char telephone[20]; char birthday[20]; } ; 12

[ 8-4] main(){ struct profile data; strcpy(data.name,"han"); strcpy(data.address,"seoul"); strcpy(data.telephone,"361-2528"); strcpy(data.birthday,"75/03/10"); printf("name address telephone birthday\n"); printf("%s %s %s %s\n", data.name,data.address,data.telephone,data.birthday); } 13

Case II -> struct number{ doouble real; double imaginary; }; struct number *x2; (*x2).real x2->real (*x2).imaginary x2->imaginary 14

[ 8-5] #include<stdio.h> #include<string.h> [ ] main(){ Product name is pencil struct product { Color is white,and cost is $3 char name[20]; char color[20]; int cost; } a,*pnt ; pnt=&a; strcpy(pnt->name,"pencil"); strcpy(pnt->color,"white"); pnt->cost = 3; printf("product name is %s\n",pnt->name); printf("color is %s,and cost is $%d\n", pnt->color,pnt->cost); } 15

[ 8-6] #include<stdio.h> struct hello{ char *pnt1; char *pnt2; char *pnt3; } greeting ; main(){ int x; printf("input'1'if morning,'2'if afternoon,'3'if evening \n"); scanf("%d",&x); greeting.pnt1 = "Good morning"; greeting.pnt2 = "Good afternoon"; greeting.pnt3 = "Good evening"; 16

[ 8-6] if(x==1) printf("%s",greeting.pnt1); else if(x==2) printf("%s",greeting.pnt2); else if(x==3) printf("%s",greeting.pnt3); else printf("error"); } [ ] Input'1'if morning,'2'if afternoon,'3'if evening 1 Good morning 17

[ 8-7] #include <stdio.h> main() { struct number{ int x; int y; }; struct number a[5], *pnt; pnt = a; int i; for(i=0 ;i<5 ;i++) printf("pnt+%d 's address is %p and it points to %p\n", i,&pnt+i,pnt+i); } 18

[ 8-7] [ ] pnt+0 's address is 1669:0FFC and it points to 1669:0FE8 pnt+1 's address is 1669:1000 and it points to 1669:0FEC pnt+2 's address is 1669:1004 and it points to 1669:0FF0 pnt+3 's address is 1669:1008 and it points to 1669:0FF4 pnt+4 's address is 1669:100C and it points to 1669:0FF8 19

:. struct jum{ int x_axis; int y_axis; }; /* */ struct rectangle{ struct jum point1; struct jum point2; }; 20

[ 8-8] #include<stdio.h> struct dot { int x; int y; }; struct square { struct dot topleft; struct dot bottomrgt; } rectangle; long area; main(){ printf("input the x coordinate of top left: "); scanf("%d",&rectangle.topleft.x); printf("input the y coordinate of top left: "); 21

[ 8-8] scanf("%d",&rectangle.topleft.y); printf("input the x coordinate of bottom right: "); scanf("%d",&rectangle.bottomrgt.x); printf("input the y coordinate of bottom right: "); scanf("%d",&rectangle.bottomrgt.y); area=(rectangle.bottomrgt.x - rectangle.topleft.x) * (rectangle.topleft.y - rectangle.bottomrgt.y); printf("the area of the rectangular form is %ld\n",area); } [ ] Input the x coordinate of top left: 2 Input the y coordinate of top left: 6 Input the y coordinate of bottom right: 8 Input the y coordinate of bottom right: 3 The area of the rectangular form is 18 22

[ 8-9] #include<stdio.h> main(){ struct dot{ int x; int y; struct dot *pnt; } dot1 ; dot1.pnt = & dot1 ; printf("address of dot1 is %p\n",&dot1); printf("dot1.pnt points to itself (%p)\n",dot1.pnt); printf("address of dot1.pnt is %p\n",&dot1.pnt); } [ ] address of dot1 is 166D:0FF8 dot1.pnt points to itself (166D:0FF8) address of dot1.pnt is 166D:0FFC 23

. struct s_tag{ union u_tag{ int x; int x; int y; int y; char *p; char *p; s_val; u_val; }; }; 24

u_val.p u_val.x s_val.x u_val.y. s_val.p s_val.y. 25

[ 8-10] /* */ #include <stdio.h> union number{ int x; int y; } ex1; struct num{ int x; int y; } ex2; main(){ ex1.x = 1234; ex1.y = 4321; 26

[ 8-10] printf("union member variable = %d\n", ex1.x); ex2.x = 1234; ex2.y = 4321; printf("struct member variable = %d\n",ex2.x); } [ ] union member variable = 4321 struct member variable = 1234 27

struct person{ char name[20]; char sex; int age; }; /* p */ /* p */ void display1(struct person p) { printf("%s : %c : %d \n", p.name, p.sex, p.age); } 28

[ 8-11] #include <stdio.h> struct person{ char name[20]; char sex; int age; }; void display(struct person p) /* person p */ { printf("%s : %c : %d \n", p.name, p.sex, p.age); } 29

[ 8-11] main() { struct person people={ "Chan Ho Park", 'm', 26 }; } printf("\n name sex age \n"); display(people); [ ] name sex age Chan Ho Park : m : 26 30

[ 8-12] #include <stdio.h> [ ] struct person{ name sex age char name[20]; Chan Ho Park : m : 26 char sex; int age; }; void display(struct person *p){ printf("%s : %c : %d \n", p->name, p->sex, p->age); } main(){ struct person people={ "Chan Ho Park", 'm', 26 }; printf("\n name sex age \n"); display(&people); } 31

[ 8-13] #include<stdio.h> struct marks { int math; int phys; int biol; } temp = {0,0,0}; marks funct(int math, int phys,int biol); void main(void){ struct marks point ; int a,b,c,i,t; printf("input total number of tests : "); scanf("%d",&t); for(i=0;i<t;i++) { printf("input marks in math, %d th test : ",i+1); scanf("%d",&a); 32

[ 8-13] printf("input marks in physics, %d th test : ",i+1); scanf("%d",&b); printf("input marks in biology, %d th test : ",i+1); scanf("%d",&c); point=funct(a,b,c); /* */ } printf("*****************************************\n"); printf("average marks in math : %d\n",point.math/t); printf("average marks in physics : %d\n",point.phys/t); printf("average marks in biology : %d\n",point.biol/t); } marks funct(int math, int phys,int biol) { temp.math = math + temp.math; temp.phys = phys + temp.phys; temp.biol = biol + temp.biol; return temp; } 33

[ 8-13] [ ] Input total number of tests : 2 Input marks in math, 1 th test : 60 Input marks in physics, 1 th test : 70 Input marks in biology, 1 th test : 90 Input marks in math, 2 th test : 50 Input marks in physics, 2 th test : 80 Input marks in biology, 2 th test : 100 ***************************************** average marks in math : 55 average marks in physics : 75 average marks in biology : 95 34

( linear linked list ) ( binary tree structure ) 35

( linear linked list ) :, struct linked_list{ char *p; struct linked_list *next; }; head struct linked_list{ char ch; struct linked_list *backward; struct linked_list *forward; }; p p p p 0 head 0 0 36

( binary tree structure ) struct binary{ char *p; struct binary *left; struct binary *right; }; p left child right child p p p p p p 37

struct node{ char *name; char sex; int age; struct node *next; }; struct node *head; struct node *p; for(p=head; p->next!=null; ){ p=p->next; p->next=&d; d.next = NULL; } 38

p->next = q->next; q->next = p; q ( ) q->next q ( ) q->next->next p 39

p->next = p->next->next; p p->next->next p p->next 40

int struct - { : ;..... : ; }; struct int_num{ unsigned field1: 2; unsigned fiedl2: 4; unsigned field3: 8; }num; 41

int unsigned 0 16 ".(dot) 42

han.code MSB LSB 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1 0 han.final han.medial han.initial han.flag on :, off : 43