데이터 구조 - Linked List 연산
- 최초 등록일
- 2011.06.26
- 최종 저작일
- 2010.06
- 9페이지/ 한컴오피스
- 가격 1,000원
소개글
연세대학교 데이터구조
목차
없음
본문내용
DATA STRUCTURE
HW #3
1. The main object
Practice using linked lists to calculate operations like addition, subtraction and
multiplication of the polynomial expression.
2. Strategies
(1) Get the polynomial inputs by their coefficient and exponents values.
(2) The terms with the zero coefficient which come from the calculating process
should be eliminated before they get linked.
(2) Do not use too many or unnecessary variables or functions to avoid the possibility
of misunderstanding and to do fast debugging in the case that this program has
some errors.
3. Flow chart
``
참고 자료
없음