methodological_instructions (22)

  • doc
  • 02.05.2020
Публикация на сайте для учителей

Публикация педагогических разработок

Бесплатное участие. Свидетельство автора сразу.
Мгновенные 10 документов в портфолио.

Иконка файла материала methodological_instructions (22).doc

Methodological Instructions

Theme: Algorithms on graphs 

Aim: Implementation of search algorithms on graphs to solve the practical tasks

Assessment criteria

Knowledge

·     Know what is a graph

 

Comprehension

·     Understand the structure of graphs

·        Describe the application of different types of graphs

 

Language objectives

Learners able to …

• State what is graph

• Describe the purpose of graphs and its application in Computer Science

Vocabulary and terminology specific to the subject:

Undirected graph, directed graph, nodes, path, root, vertex

Useful expressions for dialogs and letters:

Well, in directed graph there are … .

For example, every vertex has its own position and could be connected   … .

Obviously, the path between graphs’  … .

 

Theory

  In computer science, graphs are used to represent networks of communication, data organization, computational devices, the flow of computation, etc.

 For instance, the link structure of a website can be represented by a directed graph, in which the vertices represent web pages and directed edges represent links from one page to another.

·                  Undirected graph - a graph that doesn’t have a particular direction for edges.

·                  Directed graph - a graph in which edges have a particular direction.

·                  Connected graph - a graph where there is no unreachable vertex. There must be a path between every pair of vertices.

·                  Disconnected graph - a graph where there are unreachable vertices. There is not a path between every pair of vertices.

·                  Finite graph - a graph with a finite number of nodes and edges.

·                  Infinite graph - a graph where an end of the graph in a particular direction(s) extends to infinity.

 

 

П. Questions for self-assessment.

What is the graph in Computer Science?

State kinds of graph

Visual Aids and Materials links.

  1. Slides
  2. https://medium.freecodecamp.org/i-dont-understand-graph-theory-1c96572a1401

 

 

 

 

Students' Practical Activities:

Students must be able:

·        Describe the application of different types of graphs

 


Скачано с www.znanio.ru

Посмотрите также