- 1.¼ö¾÷¸ñÇ¥:
-
- ¼öÇкоߵé Áß¿¡¼µµ ¾ÆÁÖ ¾î·Á¿î
°³³äµéÀÇ ÀÌÇØ ¾øÀÌ ¹®Á¦µéÀ» ÀÌÇØÇÒ ¼ö ÀÖ°í,
- ¿ì¸®ÀÇ ÀÏ»ó»ýÈ° Áß¿¡¼µµ ½±°Ô
Á¢ÇÒ ¼ö ÀÖ´Â ¿µ¿ªÀÌ´Ù.
- ÀÌ·¯ÇÑ ÀÌÀ¯·Î ÀÎÇÏ¿© ÀÌ»ê¼öÇÐÀº
ÃʵîÇб³ ¼öÇкÎÅÍ °íµîÇб³ ±³À°¿¡ À̸£±â±îÁö °è¼Ó ´Ù·ç¾îÁö´Â
ºÐ¾ßÀÌ´Ù.
- µû¶ó¼ Áߵ»ç·Î¼ ÇʼöÀûÀ¸·Î
È®½ÇÇÑ ÀÌÇØ°¡ ÇÊ¿äÇÏ´Ù.
- ÀÌ»ê¼öÇÐÀº ÄÄÇ»ÅͽýºÅÛ(computer
system)°ú ±íÀÌ ¿¬°üµÇ¾î ´Ù·ç´Â ³»¿ëÀÌ ¸¹À¸³ª
- ¿ì¸®´Â ÁÖ·Î Á¶ÇÕ·Ð(combinatorics)À»
ÁÖ·Î ´Ù·ê °èȹÀÌ´Ù.
- ƯÈ÷ ÀÌ»ê¼öÇп¡¼´Â ½ÇÁ¦·Î ¹®Á¦¸¦
Ç® ¼ö ÀÖ´Â ´É·ÂÀ» ±â¸£´Â °ÍÀÌ Áß¿äÇϹǷÎ
- ÁÖ 3½Ã°£ °ÀÇ Áß¿¡¼ 30ºÐÀ» ¿¬½À¹®Á¦
Ç®ÀÌ, Åä·Ð ¹× MapleÀ» ÀÌ¿ëÇÑ ÄÄÇ»ÅÍ ½Ç½ÀÀÇ ½Ã°£À¸·Î °®°íÀÚ
ÇÑ´Ù.
-
- 2.¼ö¾÷³»¿ë:
-
- Basic Counting Principle, The
Principle of Inclusion-Exclusion, Graphs, Generating Functions,
Recurrence Relations,
- The Polya Theory of Counting
-
- 3.¼ö¾÷¹æ¹ý ¹× ÀÚ·áÁ¦½Ã:
-
- ÁÖ 4½Ã°£ Áß¿¡¼ 3½Ã°£Àº °ÀǸ¦
ÁÖ·Î ÇÏ°í 1½Ã°£Àº ¹®Á¦Ç®ÀÌ, Åä·Ð ¹× Maple ÇÁ·Î±×·¥À» ÀÌ¿ëÇÑ
ÄÄÇ»ÅÍ ½Ç½ÀÀ» ÇÑ´Ù.
- Àü³²´ëÇб³ °¡»ó´ëÇÐÀ» ÀÌ¿ëÇÏ¿©
°úÁ¦¹°À» Á¦ÃâÇϵµ·Ï ÇÑ´Ù.
-
- 4.Æò°¡°èȹ:
- Ãâ ¼® : 10Á¡
- Áß°£Æò°¡ : 40Á¡
- ±â¸»Æò°¡ : 40Á¡
- °úÁ¦¹° ¹× ¹ßÇ¥ : 10Á¡
- ÃÑÁ¡ 100Á¡ ¸¸Á¡À¸·Î »ó´ëÆò°¡ ÇÑ´Ù.
-
- 5.±³Àç ¹× ºÎ±³Àç:
- ±³
Àç: Applied Combinatorics with Problem Solving by
Jackson & Thoro
- ºÎ±³Àç:
Introductory Combinatorics Third Edition, by Richard A.
Brualdi
- Applied
Combinatorics by Alan Tucker
- Foundations
of Applied Combinatorics by Edward A. Bender & S. Gill
Williamson
-
-
- 6.ÁÖº°¼ö¾÷°èȹ:
- Á¦ 1ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Foundations of Applied Combinatorics by Edward A. Bender
& S. Gill Williamson
- Á¦ 1±³½Ã: Section
1.1 Deduction
- Á¦ 2±³½Ã: Section
1.2 Induction
- Á¦ 3±³½Ã: Section
1.3 Sets and Relations
-
- Á¦ 2ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Foundations of Applied Combinatorics by Edward A. Bender
& S. Gill Williamson
- Á¦ 1±³½Ã: Section
1.4 Functions
- Á¦ 2±³½Ã: Section
2.1 Sequential Counting
- Á¦ 3±³½Ã: Section
2.2 Case-by-Case Counting
-
- Á¦ 3ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Foundations of Applied Combinatorics by Edward A. Bender
& S. Gill Williamson
- Á¦ 1±³½Ã: Section
2.3 Selections
- Á¦ 2±³½Ã: Section
2.4 Selections with Unlimited Repetition
- Á¦ 3±³½Ã: Section
2.5 Binomial Coefficients
-
- Á¦ 4ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Foundations of Applied Combinatorics by Edward A. Bender
& S. Gill Williamson
- Á¦ 1±³½Ã: Section
2.6 Permutations of Nondistinct Objects
- Á¦ 2±³½Ã: Section
3.1 The Union of Overlapping Sets
- Á¦ 3±³½Ã: Section
3.2 Counting Restricted Arrangements
-
- Á¦ 5ÁÖ :
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
3.3 Distributions
- Á¦ 2±³½Ã: Section
5.1 Graphs Models
- Á¦ 3±³½Ã: Section
5.2 Paths and Connectedness
-
- Á¦ 6ÁÖ :
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
5.3 Circuits and Cycles
- Á¦ 2±³½Ã: Section
5.3 Circuits and Cycles
- Á¦ 3±³½Ã: Section
5.4 Planar Graphs
-
- Á¦ 7ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
5.5 Graphs Colorings
- Á¦ 2±³½Ã: Section
5.5 Graphs Colorings
- Á¦ 3±³½Ã: Áß°£°í»ç
-
- Á¦ 8ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
7.1 Generating Function Models
- Á¦ 2±³½Ã: Section
7.2 Calculating Coefficients
- Á¦ 3±³½Ã: Section
7.2 Calculating Coefficients
-
- Á¦ 9ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
7.3 Partitions
- Á¦ 2±³½Ã: Section
7.4 Exponential Generating Functions
- Á¦ 3±³½Ã: Section
7.4 Exponential Generating Functions
-
- Á¦ 10ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
8.1 Recurrence Relation Models
- Á¦ 2±³½Ã: Section
8.1 Recurrence Relation Models
- Á¦ 3±³½Ã: Section
8.2 Homogeneous Linear Relations
-
- Á¦ 11ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
8.3 Nonhomogeneous Linear Recurrence Relations
- Á¦ 2±³½Ã: Section
8.3 Nonhomogeneous Linear Recurrence Relations
- Á¦ 3±³½Ã: Section
9.1 Symmetry Groups and Burnside's Theorem
-
- Á¦ 12ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
9.2 The Cycle Index
- Á¦ 2±³½Ã: Section
9.2 The Cycle Index
- Á¦ 3±³½Ã: ¹®Á¦Ç®ÀÌ
-
- Á¦ 13ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
6.1 Breadth First Search
- Á¦ 2±³½Ã: Section
6.1 Breadth First Search
- Á¦ 3±³½Ã: ¹®Á¦Ç®ÀÌ
-
- Á¦ 14ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
6.2 Trees
- Á¦ 2±³½Ã: Section
6.2 Trees
- Á¦ 3±³½Ã: ¹®Á¦Ç®ÀÌ
-
- Á¦ 15ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Section
6.3 Tree Algorithms
- Á¦ 2±³½Ã: Section
6.3 Tree Algorithms
- Á¦ 3±³½Ã: ¹®Á¦Ç®ÀÌ
-
- Á¦ 16ÁÖ:
- ±³Àç:
Applied Combinatorics with Problem Solving by Jackson &
Thoro
- ºÎ±³Àç:
Applied Combinatorics by Alan Tucker
- Á¦ 1±³½Ã: Á¾ÇÕ
Á¤¸®
- Á¦ 2±³½Ã: ¹®Á¦Ç®ÀÌ
- Á¦ 3±³½Ã: ±â¸»°í»ç
-
|