<div><span>혼자서 공부하고 있는 책에 나오는 문제인데 아무리봐도 모르겠네요... 솔루션이 없습니다 ㅜㅜ</span></div> <div><span>염치없지만 부탁드려도 될까요?? ㅠㅠ</span></div> <div><span></span> </div> <div><span>다음 배열을 이용한 원형큐에 대한 프로그램에 대해 답하시오</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">.</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">#define MAX_QUEUE_SIZE 100</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">typedef int element;</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">typedef struct{</span></div> <div><span lang="en-us" style="font-family:'바탕';"> </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">element queue[MAX_QUEUE_SIZE];</span></div> <div><span lang="en-us" style="font-family:'바탕';"> </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">int front, rear;</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">}QueueType</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">//(1)</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">int is_full(QueueType *q)</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">{ return</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">((q->rear+1)%MAX_QUEUE_SIZE</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">== q->front);}</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">void enqueue(QueueType *q, element item)</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">{ if(!is_full(q)) </span></div> <div><span lang="en-us" style="font-family:'바탕';"> </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">{q->rear=(q->rear+1)</span></div> <div><span lang="en-us" style="font-family:'바탕';"> </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">%MAX_QUEUE_SIZE;</span></div> <div><span lang="en-us" style="font-family:'바탕';"> </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">q->queue[q->rear]=item;}</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">}</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">int sum(QueueType *q)</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">{//(2) </span><span>가장 먼저 삽입된 요소의 정수와 가</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">//</span><span>장 나중에 삽입된 요소의 정수의 합을 반</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">//</span><span>환한다</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">.</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">}</span></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">(1)</span><span>의 </span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">is_full</span><span>함수에 대해여 설명하시오</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">.</span></div> <div> <p></p></div> <div> <p></p></div> <div> <p></p></div> <div><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">(2)</span><span>를 완성하시오</span><span lang="en-us" style="letter-spacing:0pt;font-family:'바탕';">.</span></div> <div> <p></p></div> <div> <p></p></div>
댓글 분란 또는 분쟁 때문에 전체 댓글이 블라인드 처리되었습니다.