Stack push{

if size() = N then

throw StackFull exception

t<-t + 1

S[t]<-e

}

Stack pop{

if empty() then

throw StackEmpty exception

t<-t-1

}

enqueue{

if size() = N then

throw QueueFull exception

Q[r] <- 2

r <- (r+1) mod N

n = n+1

}

dequeue{

if empty() then

throw QueueEmpty exception

f <- (f+1) mod N

n = n-1

}

import java.io.BufferedReader;

import java.io.IOException;

import java.io.InputStreamReader;

public class One{

public static void main(String[] args){

BufferedReader inputValue = new BufferedReader(new InputStreamReader(System.in));

try{

System.out.println("BMI 계산 프로그램입니다");

System.out.print("당신의 키를 입력해주세요(cm) : ");

String myString = inputValue.readLine();

double Height = Double.parseDouble(myString);

System.out.print("당신의 체주을 입력해주세요(kg) : ");

myString = inputValue.readLine();

double Weight = Double.parseDouble(myString);

double BMI;

BMI = Weight/(Height*Height) * 10000;

String jung;

if(BMI>30){jung = "비만";}

else if(BMI>20){jung = "정상";}

else {jung = "마름";}

System.out.println("당신의 BMI는 " + BMI + "입니다.");

System.out.println("** BMI수치가 " + BMI + "면 " + jung + "상태입니다.");

}catch(IOException e){

}

}

}

singleNode 구현

{

public:

string elem;

SNode next;

}

singleNode 삽입

{

SNode* v = new SNode;

v->elem = e;

v->next = head;

head = v;

}

singleNode 제거

{

SNode* old = head;

head = old->next;

delete old;

}

singleNode add back

{

SNode* v = new SNode;

v->elem = e;

v->next = NULL;

tail->next = v;

tail = v;

}

doubleNode 구현

{

public:

string elem;

DNode* next;

DNode* prev;

}

doubleNode 삽입(v 앞에)

{

DNode* u = new DNode;

u->elem = e;

u->next = v;

u->prev = v->prev;

v->prev->next = v->prev = u;

}

doubleNode 삭제

{

DNode* u = v->prev;

DNode* w = v->next;

u->next = w;

w->prev = u;

delete v;

}

CircleNode 삽입

{

CNode* v= new CNode;

v->elem = e;

if(cursor == NULL){

v->next = v;

cursor = v;

}else{

v->next = cursor->next;

cursor->next = v;

}

}

CircleNode 삭제

{

CNode* old = cursor->next;

if(old == cursor)

cursor = NULL;

else

cursor->next = old->next;

delete old;

}