도도의 초록누리

 덧셈

1

2

3

 뺄셈

3

1

2

 곱셈

4

2

8

 나눗셈

8

2 

4

 덧셈의 예(Example of addition)

 문제)

 1

 3

 2

 단계1)

 4

 2

 결과)

 2

 뺄셈의 예(Example of Subtraction)

 문제)

 1

 3

 2

 단계1)

-2

 2

 결과)

-4

 곱셈의 예(Example of Multiplication)

 문제)

3

 2

6

 단계1)

 6

6

 결과)

0

 나눗셈의 예(Example of Division)

 문제)

8

 2

6

 단계1)

 4

6

 결과)

-2

1

x

 0

0

1

x

 1

1

1

x

 2

2

1

x

 3

3

1

x

 4

4

1

x

 5

5

1

x

 6

6

1

x

 7

7

1

x

 8

8

1

x

 9

9

 2

x

 0

 0

 2

x

 1

 2

 2

x

 2

 4

 2

x

 3

 6

 2

x

 4

 8

 2

x

 5

 10

 2

x

 6

 12

 2

x

 7

 14

 2

x

 8

 16

 2

x

 9

 18

3

x

 0

0

3

x

 1

3

3

x

 2

6

3

x

 3

9

3

x

 4

12

3

x

 5

15

3

x

 6

18

3

x

 7

21

3

x

 8

24

3

x

 9

27

 이게 어떻게 되냐면요.

 지수(Pow)를 실제 적용한 예

 * 표기(Expression)
  

 * 표현 의미(Meaning of Expression)

 - 방정식을 구성하고 있는 예

 x

 y

 1

 2

 2

 3

 4

 40 

 170115-ex-figure1.pptx

 170115-ex-figure1.odp

 170115-ex-figure1.ppt

 1. 수학에 있어서 기초가 되는 방정식에 대해서

  쉽게 단순하게 x 에 무엇이 들어가느냐?

   왜냐하면,

 2. 수학에 있어서 기초가 되는 부등식에 대해서

  쉽게 단순하게 x 에 무엇이 들어가느냐?

  실제로는 x = 1도 됩니다.

  왜냐하면, 3 이하면 됩니다.

 abstract interface Queue{

       abstract void Push( Object x );

       abstract Object pop();

       abstract boolean isEmpty();

 }

 Queue Interface ADT

 
class LinkedNode{
        private Object data;
        private LinkedNode next;
 
        public void setData(Object x)
        {
             this.data = x;
        }

       public void setNext(LinkedNode node)
       {
             this.next = node;
       }

       public Object getData()
       {
            return this.data;
       }

       public LinkedNode getNext()
       {
            return this.next;
       }
}

LinkedNode ADT

 abstract interface Queue{

       abstract void Push( Object x );

       abstract Object pop();

       abstract boolean isEmpty();

 }

 class LinkedNode{
        private Object data;
        private LinkedNode next;
 
        public void setData(Object x)
        {
             this.data = x;
        }

       public void setNext(LinkedNode node)
       {
             this.next = node;
       }

       public Object getData()
       {
            return this.data;
       }

       public LinkedNode getNext()
       {
            return this.next;
       }
}

 class LinkedQueue implements Queue{

          private LinkedNode front;
          private LinkedNode rear;
 
          public LinkedQueue(){
                 this.front = null;
                 this.rear = null;
          }
 
          public void push(Object x){
  
                 LinkedNode newNode = new LinkedNode();

                 newNode.setData( x );
                 newNode.setNext( null );

                 if( isEmpty() )
                 {
                       this.front = newNode;
                       this.rear = newNode;  
                 }
                 else{
                       this.rear.setNext ( newNode );
                       this.rear = newNode;
                 }

          }

          public Object pop(){
   
                 if ( isEmpty() )
                       return null;
  
                 Object data = front.getData();
   
                 LinkedNode prevnode = front;
                 front = front.getNext();
 
                 prevnode = null;
                 return data;
         }

         public Object peak(){
  
                if ( isEmpty() )
                        return null;
                else
                        return front;

         }

         public boolean isEmpty(){
  
                if(front == null)
                        return true;
                else
                        return false;  

          }
 
          public void viewOfAll()
          {
                LinkedNode current = this.front;
  
                System.out.println("출력 ---------");
 
                while ( current != null )
                {
                         System.out.println( current.getData() );
                         current = current.getNext();
                 }

           }

 }

 
public class LinkedQueueProgram{
 
         public static void main(String args[])
         {
                 LinkedQueue queue = new LinkedQueue();
                 queue.push("1번");
                 queue.push("2번");
                 queue.push("3번");
                 queue.viewOfAll();

                 queue.pop(); 
                 queue.viewOfAll();
 
                 queue.push("1번");
                 queue.viewOfAll();

         }
}

 LinkedQueueProgram.java

 abstract interface Queue{

      abstract void push ( Object x ) ;

      abstract Object pop ( ) ;

      abstract boolean isEmpty ( );

      abstract Object peak ( ) ;

 }

 Queue의 ADT

 public class ArrayQueue implements Queue{

      private int front;

      private int rear;

      private int count;

      private int queuesize;

      private Object[] itemArray;

      public ArrayQueue()

      {

               this.front = 0;

               this.rear = 0;

               this.count = 0;

               this.queueSize = 10;

               this.itemArray = new Object [ this.queueSize ];

      }

 } 

 배열 큐 - Circular Queue 구현 - 기본 Instance Variable, Constructor

 rear = ( rear + 1 ) % n

 itemArray[rear] = x ;

 front = ( front + 1 ) % n

 Object data = itemArray ( front );

 
abstract interface Queue{
 
        abstract boolean isEmpty();
        abstract void push(Object x);
        abstract Object pop();
        abstract Object peak(); 
}

class ArrayQueue implements Queue{

         private int front;
         private int rear;
         private int count;
         private int queueSize;
         private int increment;
         private Object[] itemArray;
 
         public ArrayQueue( )
         {
                 this.front = 0;
                 this.rear = 0;
                 this.count = 0;
                 this.increment = 5;
                 this.queueSize = 5;

                 itemArray = new Object[queueSize];
          }

          private void queueFull()
          {
  
                 int prevQueueSize = queueSize;
                 queueSize += increment ;
  
                 Object[] prevItemArr = itemArray.clone();
                 itemArray = new Object[queueSize];
  
                 int i = 0;

                 while( i < prevQueueSize )
                 {
                         itemArray[i] = prevItemArr[front];
                         front = (front + 1) % prevQueueSize;
   
                         i++;
                 }

                 front = 0;
                 rear = count;
        }
 
        public boolean isEmpty(){
                 return (count == 0) ? true : false ;
        }

        public void push(Object x){
  
                 if ( ( count + 1 ) ==  queueSize )
                        queueFull();

                 rear = ( rear + 1 ) % queueSize;
                 itemArray[ rear ] = x;
  
                 count++;

        }

        public Object pop(){

                if( isEmpty() )
                       return null;
  
                front = (front + 1) % queueSize;
                Object item = itemArray[front];
                itemArray[front] = null;
  
                count--;

                return item;
         }
 
          public Object peak(){
  
               if( isEmpty() )
                       return null;
               else
                       return itemArray[front];

          }

           public void viewOfAll( String label )
           {
                   System.out.println ( "\n\n[" + label + "]/-----실험결과" );
    
                   for ( Object x : itemArray )
                  {
                            System.out.println ( x );   

                   }

            }

             public int getCount()
             {
                     return this.count;
             }
 }

 public class QueueProgram{

             public static void main(String args[])
             { 

                     ArrayQueue queue = new ArrayQueue();
  
                     queue.push("1번");
                     queue.push("2번");
                     queue.push("3번");
                     queue.push("4번");
                     queue.viewOfAll("1번");

                     queue.pop();
                     queue.viewOfAll("2번");

                     queue.push("5번");
                     queue.viewOfAll("3번");

                     queue.push("6번");
                     queue.viewOfAll("4번");

                     queue.pop();
                     queue.viewOfAll("5번");

                     queue.pop();
                     queue.viewOfAll("6번");

                     queue.push("7번");
                     queue.viewOfAll("7번");

                     queue.push("8번");
                     queue.viewOfAll("8번");

                     queue.pop();
                     queue.viewOfAll("9번");

                     queue.pop();
                     queue.viewOfAll("11번");

                     queue.push("9번");
                     queue.viewOfAll("12번");

                     queue.push("10번");
                     queue.viewOfAll("13번");

                     queue.push("11번");
                     queue.viewOfAll("14번");

                     queue.push("12번");
                     queue.viewOfAll("15번");
 
         }

}

 QueueProgram.java

/*      
       Data Structure Circular Linked List - rootnode만 이용
       2015. 4. 25
       James
*/ 

class Node

{
        private Object data;
        private Node prev;
        private Node next;

        // Getter
        public Object getdata()
        {
             return this.data;
        }

        public Node getprev()
        {
             return this.prev;
        }

        public Node getnext()
        { 
             return this.next;
        }
 

        // Setter
        public void setdata(Object data)
       {
             this.data = data;
       }

       public void setprev(Node prev)
       {
             this.prev = prev;
       }

       public void setnext(Node next)
       {
             this.next = next;
       }
} 

class LinkedList{

       private Node headnode;
       private long length;
 
       public LinkedList(){
              this.headnode = null;
              this.length = 0;
       }

       public void insert(Object data)
       {
              Node createnode = new Node();  

              createnode.setdata(data);
              createnode.setprev( createnode );
              createnode.setnext( createnode );
  
              if ( this.headnode == null )
              {
                       this.headnode = createnode;
              }
              else
              { 
                      Node firstnode = this.headnode.getnext();   
   
                      // 현재 기억하고 있는 이전 노드 설정
                      createnode.setprev ( this.headnode );

                      // 맨 마지막 노드 처음 위치 지정
                      createnode.setnext ( firstnode );

                      // 현재 노드 -> node 삽입 (Next)
                      this.headnode.setnext( createnode );
   
                      // 현재 노드 -> 다음 노드로 이동
                      this.headnode = this.headnode.getnext();

                      // 맨 처음 노드 마지막 위치 지정
                      firstnode.setprev( this.headnode );
              }

              this.length++;
  
 }
 
 public void remove(Object data)
 {
             Node currentnode = this.headnode.getnext();
             boolean check = false;  

             long cnt = 0;  
  
             // 데이터 검색
             while ( cnt < length )
             {
                       if( currentnode.getdata() == data)
                       {    
                               check = true;
                               break;
                       }

                       currentnode = currentnode.getnext();
   
                       cnt++;
             }

              // 3가지 기준 (맨 처음 자료, 중간 자료, 맨 마지막 자료)
              if ( check == true )
              {
                      Node firstnode = this.headnode.getnext();
                      Node lastnode = this.headnode;
  
                      // 맨 처음 자료
                      if ( currentnode == firstnode )
                      { 
                                // 다음 주소가 firstnode와 일치시
                                if ( this.headnode.getnext ( ) == firstnode ){

                                        Node prevnode = firstnode.getprev();
                                        Node nextnode = firstnode.getnext();
     
                                        firstnode = nextnode;
                                        firstnode.setprev ( prevnode ) ;
                                        this.headnode.setnext ( firstnode ) ;
                               }
                               else
                                        this.headnode = this.headnode.getnext ( ) ; 
                      }

                     // 중간 자료 판별
                     if ( currentnode != firstnode && currentnode != lastnode )
                     {
                               Node prevnode = currentnode.getprev ( ) ;
                               Node nextnode = currentnode.getnext ( ) ;

                               currentnode = prevnode ;
                               currentnode.setnext ( nextnode ) ;
                               nextnode.setprev ( prevnode ); 
                     }

                      // 마지막 자료 판별
                      if ( currentnode == lastnode && this.headnode != null )
                      {
                               Node prevnode = currentnode.getprev ( ) ;

                        
                               prevnode.setnext ( firstnode ) ;
                               firstnode.setprev ( prevnode ) ;
     
                               currentnode = null ;

                               this.headnode = prevnode;
                      }
 
                      this.length--;

                }  

        }
  
        public void view()
        {
                  Node currentnode = this.headnode.getnext();
    
                  long cnt = 1;

                  while ( cnt <= length )
                  {
                           System.out.println( "번호:" + cnt + ", Data:" + currentnode.getdata() ) ;
   
                           currentnode = currentnode.getprev() ;
                           cnt++;
                  } 
         }
 
         public long getlength()
         {
                  return this.length;
         }

          public Node getnode()
          {
                  return this.headnode;
          }

}

public class Ds{

         public static void main(String args[])
        {
             LinkedList list = new LinkedList();

             list.insert("야호1"); 
             list.view();

             list.remove("야호1");
             System.out.println( list.getlength() ) ;
             list.view();
       }

} 

 Ds.java

 빨강색으로 친 아이콘을 클릭합니다. (새 토렌트 만들기)

 새 토렌트 만들기 -> 파일 추가

                           -> 폴더 추가

 곰돌이.mp3를 선택하겠습니다. (예제)

 결론은 만들기를 클릭하면, .torrent파일이 생성됩니다.

 토렌트 파일은 .torrent을 저장(S)을 클릭하면 실제 파일을 생성할 수 있습니다.

 파일 배포를 위한 상태가 되었는지 확인해보시기 바랍니다.

 아까 만든 파일을 배포하면, 파일을 배포할 수 있게 됩니다.