Scribd
Upload
31 views

Report Combinatorics and Graphs

This document provides instructions for the final assignment in a Combinatorics and Graphs course. It outlines formatting requirements for the report and lists the required contents, including an acknowledgement, table of contents, list of references, and answers to 5 questions. It also includes a self-evaluation form for students to assess their own work. The assignment requires applying concepts like the minimum spanning tree algorithm, Newton's binomial theorem, and graph theory to problems involving the student's ID number.

Uploaded by

Cường Nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
31 views

Report Combinatorics and Graphs

This document provides instructions for the final assignment in a Combinatorics and Graphs course. It outlines formatting requirements for the report and lists the required contents, including an acknowledgement, table of contents, list of references, and answers to 5 questions. It also includes a self-evaluation form for students to assess their own work. The assignment requires applying concepts like the minimum spanning tree algorithm, Newton's binomial theorem, and graph theory to problems involving the student's ID number.

Uploaded by

Cường Nguyễn
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

COMBINATORICS AND GRAPHS

Faculty of Information Technology

REPORT FINAL ASSIGNMENT OF COMBINATORICS AND GRAPHS


1. Preparation:
1.1. Format
- The dimension of the report should be in A4 size.
- Single spacing should be used for typing the general text. The general text shall be
typed in the Font style “Times New Roman” and Font size 12.
- Top edge: 35 mm
- Bottom edge: 30 mm
- Left side: 40 mm
- Right side: 25 mm
1.2. Contents
- Cover Page & Title Page
- Acknowledgement
- Table of Contents
- List of Symbols, Abbreviations and Nomenclature
- List of Tables
- List of Figures
- Abstract
- Contents
- List of References
- Table and figures
1.3. List of References
The listing of references should be typed 4 spaces below the heading “REFERENCES”
in alphabetical order in single spacing left – justified. The reference material should be
listed in the alphabetical order of the first author. The name of the author/authors should
be immediately followed by the year and other details. A typical illustrative list given
below.
REFERENCES
1. Ariponnammal, S. and Natarajan, S. (1994) „ Transport Phonomena of Sm Sel – X
Asx‟, Pramana – Journal of Physics Vol.42, No.1, pp.421-425.
2. Barnard, R.W. and Kellogg, C. (1980) „ Applications of Convolution Operators to
Problems in Univalent Function Theory‟, Michigan Mach, J., Vol.27, pp.81–94.
3. Shin, K.G. and Mckay, N.D. (1984) „Open Loop Minimum Time Control of
Mechanical Manipulations and its Applications‟, Proc.Amer.Contr.Conf., San Diego,
CA, pp. 1231-1236.
2. Content: Answer the following questions.
COMBINATORICS AND GRAPHS
Faculty of Information Technology

Question 1. (2 marks) Let S  1, 2,..., m  1000 . Where m is the last 2 digits of your student
ID.For example, if your student ID is 51900754 then S  1, 2,..., m  1000 . Find the number of
integers in S which are divisible by 5 or 17.

Question 2.(2 marks) Solve an  7an 1  10an  2  0 given that a0  2 and a1  m , where m is
the last 2 digits of your student ID. For example, if your student ID is 51900754 then a1  54.

Question 3.(2 marks) Construct the minimum spanning tree for the given graph using Kruskal’s
Algorithm.

Where m is the last 2 digits of your student ID. For example, if your student ID is 51900754 then
the valid graph is

.
Question 4.(1.5 marks) Let G be a connected planar simple graph with m  50 vertices and
2m  100 edges, where m is the last 2 digits of your student ID.For example, if your student ID
is 51900754 then the graph must have 104 vertices and 208 edges. Find the number of regions in
G.
COMBINATORICS AND GRAPHS
Faculty of Information Technology

Question 5.(1.5 marks) The Newton’s Binomial theorem has a lot of applications. One
application of the theorem is to helps explore probability in an organized way. For example,
consider the genetic problem:
Suppose two hybrid green peas (Gg) are cross-bred. Answer the following questions.
a. Construct a Punnett squares.
b. What are the probabilities of each genotype (GG, Gg, gg) in the first generation of
offspring?
c. If two random individuals in that first generation are cross-bred, show that the genotype
probabilities remain the same in the next generation.
COMBINATORICS AND GRAPHS
Faculty of Information Technology

SELF-EVALUATION FORM
You need to evaluate your self according to the below form. This self reference only,
your final result may not equal this result.
Please evaluate yourself in the "Self-evaluation" column. If the score of a requirement
is low, students should state the reason in the column “Reason(s)”, for example not
understanding the goal, not having enough time, not being able to do it, and not being
interested.
Requirements Score/10 Level 1 Level 2 Level 3 Self- Reason(s)
0 score 1/2 score Full score evaluation
In right 1.0 Wrong Some In right
format format. errors. format and
and outlines,
outlines. no error.
Question 1 2.0 No content. Partial Fully
answered, answered,
some no error.
errors.
Question 2 2.0 No content. Partial Fully
answered, answered,
some no error.
errors.
Question 3 2.0 No content. Partial Fully
answered, answered,
correct no error.
formulas.
Question 4 1.5 No content. Partial Fully
answered, answered,
some no error.
errors.
Question 5 1.5 No content. Partial Fully
answered, answered,
some no error.
errors.
Total 10.0 Result

If you are caught for any type of cheating, you will face the oral test.

You might also like