Course Syllabus

Name of Instructor Aisha Yershigeshova

Secondary/ Additional
Instructors

SDU Email Address

Contact Details Office Phone Room F206

Academic Year of 2020 - 2021 Semeste 2

Study Spring r

Course Dates 18.01.2021 30.04.2021

Days Time of office Place of office

hours hours

Course Code MAT 443 Degree Cycle Bachelor

(Level)
Course Title Graph Theory
Faculty Инженер және
жаратылыстану ғылымдары
факультеті
Credits / 5 Total Department Department of Mathematics
ECTS Contact and Natural Sciences
Hours
Course Type Primary
Elective English
Language of
Instruction
Collaborativ
e Secondary Choose
Organization Language of
Instruction
Delivery Other
Location (1) Mode of Online
Delivery
Delivery
Location
(2)

"Бекітемін
"

Инженерлік және
жаратылыстану
ғылымдары факультетінің
деканы

Богданчиков А.
 Pre-Requisite Courses

Course Code Course Title

*Include the list of topics that students must know to gain an understanding of the course

Additional topics

Co-Requisite Courses

*Аn academic course required to be taken in conjunction with this course, where relevant

Course Title

Programes on which course is available

Program Title Degree

P Computer Science Bachelor
P Computing Systems and Software Bachelor
 Course Description

Over the past forty years, graph theory has been one of the most rapidly growing areas of mathematics. This course is
intended to familiarize students with the theory of graphs, including algorithmic and optimization approaches of graph
theory as well as "pure" graph theory.

Skills and Competencies

Academic Skills Subject-Specific

1 Self-study Skills
1 Application of graph
2 Programing theory
2 Constructing and
3 Working in groups programing algorithms
3 Basic graph theory
knowledge

Course Learning Outcomes

Active Verb What will be How this learning

done/produced outcome will be
achieved
1 Representation Know how graphs are used Programming tasks.
to represent the competition
2 Connecting Able to describe how graphs Relevant topics discussing
can be used to model
acquaintanceships between
people, collaboration
between researchers,
telephone calls
between telephone
numbers, and links between
websites.
3 Modelling How graphs can be used Relevant topics discussing
to model roadmaps and the
assignment of jobs to
employees of an
organization
4 Finding the shortest path Know how to solve problems Relevanttopics discussing.
such as finding the Programming tasks.
shortest path between two
cities in a transportation
network
5 Analyze and construct Know how to solve the wide Relevant topics discussing
graph algorithm variety of problems
that can be studied using
graphs
 Methods of Assessment

The University’s normative rules regarding assessment apply. See the Code of Practice on Assessments.
These norms set the boundary conditions for all instructors of University.

Assessed Components

Description Number of Points (60/100)

1 A multiple-choice questions and open 25
questions.
2 A multiple-choice questions and open 25
questions.
3 Programming tasks 10

Final Exam

Description Number of Points (total score /

40)
1 40

Proposed system of assessment by MES RK

 Reading List

Required Reading List

Type Author Year Title Publisher/W

eb site
1 Published Kenneth H. 2012 Discrete McGraw-Hill
Rosen Mathematics
and Its
Applications
Seventh
Edition
2 Published .JONATHAN L. 2004 HANDBOOK OF CRC Press
GROSS GRAPH
.lAY YELLEN THEORY

Recommended Resources (optional)

Type Author Year Title Publisher/Web
site

Other Resources (optional)

Type Author Year Title Publisher/Web
site
 Course Content - Curriculum Plan

TOPICS Activity
1 Graphs and Graph Models. Introduction to basic definitions.
Introduction.
2 Graph Terminology and Special Types Complete graphs, Cycles, Wheels, n-
of Graphs Qubes.
3 Representing Graphs and Graph Adjacent matrices, lists and tables,
Isomorphism Incident matrices.
4 Connectivity Cut vertices and edges. Vertex cut and
Edge cut.
5 Euler and Hamilton Paths Definition of Euler and Hamilton Paths
and Circuits. Necessary condition for
existence.
6 Shortest-Path Problem Dijkstra's Shortest Path algorithm
7 Midterm Exam
8 Planar Graphs Necessary condition for planarity.
Applications.
9 Graph Coloring Chromatic number. Four Color
theorem.
10 Introduction to Trees Basic defintions.
11 Applications of Trees Discussing real-life problem with trees.
12 Tree Traversal Depth-first search and
Breadth-first search algorithms.
13 Spanning Trees. Methods of finding the spanning tree.
14 Minimum Spanning Trees Methods of finding the minimum
spanning tree.
15 Endterm Exam
 Academic Integrity

Students must ensure that all work completed for this course is their own work. Any evidence of plagiarism, data
falsification, fabrication, collusion, self-plagiarism and/or other forms of academic misconduct will be penalised. Further,
information can be found in the Code of Practice on Academic Integrity.

Late/Non Submission and Attendance Policy

Academic excellence and high achievement are only possible in an environment where the highest standards of academic
honesty and integrity are maintained: students at SDU must ensure they adhere to this requirement.

Active participation is an integral part of teaching and learning at SDU. Therefore, regular class attendance is required of
all students and records of any absences are kept for each class: a student whose attendance falls below 70% will fail
the course. Students are also expected to be in class on time: poor punctuality is seen as being discourteous to the
teacher and other students, therefore repeat incidences of late arrivals are subject to a penalty.

The use of electronic devices (e.g.: computers, tablets, phones) is only permitted upon tutor instruction. Any other
activities (e.g.: texting, surfing, gaming, social emails, online shopping…etc.) are strictly forbidden during class time.
Students found to be engaged in any non-class activity may lose marks for overall participation.

Course-Specific Policy
Instructor can put a student's cumulative grade for the final exam. Instructor can make a small quiz at any lesson.
Student should be able to write a simple programming code. The instructor reserves the right to change the syllabus, if
necessary

Administrative Contacts

User Email Action Date

Aisha Yershigeshova aisha.yershigeshova Create 1/8/2021 5:10:38 PM
@sdu.edu.kz
Nail Ussembayev nail.ussembayev@sd Келісемін 1/19/2021 7:46:27
u.edu.kz PM
Andrey Bogdanchikov andrey.bogdanchikov Келісемін 1/20/2021 11:02:39
@sdu.edu.kz AM