- Code
- CMP 226
- Name
- Graph Theory and Algorithms
- Semester
- 4
- Lecture hours
- 2.00
- Seminar hours
- 0.00
- Laborator hours
- 2.00
- Credits
- 3.00
- ECTS
- 6.00
- Description
-
The course content includes: Basic knowledge of combinatorics – permutations, variations, combinations, partitions, compositions; the intuitive meaning of graph; definition of graph; roads and circuits; Euler's graph and Hamilton's graph; shortest path problem; isomorphic graphs; operations with graphs; planar graphs.
- Objectives
-
Get to know the basic elements of combinatorics - permutations, variations, combinations, partitions, compositions Get to know the meaning of graphs, the types of graphs, and apply this knowledge in solving different problems and apply them in programming. Familiarize with the concept of roads and circuits and connectivity, with the aim of applying them to phenomens and problems from the field of social sciences. To become familiar with Euler's and Hamilton's Graph and their application in programming. To become familiar with the shortest path problem and its application in programming. To be familiar with isomorphic graphs.
- Java
- Tema
- 1
- The concept of graph and some accompanying notions
- 2
- Eulerian cycles
- 3
- Cycle and co-cycle spaces
- 4
- Stacks, their main properties
- 5
- Queues, their main properties
- 6
- Trees, edges with minimal weight
- 7
- Vertex Coloring
- 8
- Semi Final Exam
- 9
- Matching
- 10
- Hamiltonian cycles
- 11
- Binary Trees
- 12
- Binary Stacks
- 13
- Balanced Trees
- 14
- Splay Trees
- 15
- General Review
- 16
- Final Exam
- 1
- Get to know the basic elements of combinatorics - permutations, variations, combinations, partitions, compositions
- 2
- Get to know the meaning of graphs, the types of graphs, and apply this knowledge in solving different problems and apply them in programming.
- 3
- Familiarize with the concept of roads and circuits and connectivity, with the aim of applying them to phenomens and problems from the field of social sciences.
- 4
- To become familiar with Euler's and Hamilton's Graph and their application in programming.
- 5
- To become familiar with the shortest path problem and its application in programming.
- 6
- To be familiar with isomorphic graphs.
- Quantity Percentage Total percent
- Midterms
- 1 40% 40%
- Quizzes
- 0 0% 0%
- Projects
- 0 0% 0%
- Term projects
- 0 0% 0%
- Laboratories
- 0 0% 0%
- Class participation
- 1 10% 10%
- Total term evaluation percent
- 50%
- Final exam percent
- 50%
- Total percent
- 100%
- Quantity Duration (hours) Total (hours)
- Course duration (including exam weeks)
- 16 4 64
- Off class study hours
- 14 6 84
- Duties
- 0 0 0
- Midterms
- 1 1 1
- Final exam
- 1 2 2
- Other
- 0 0 0
- Total workLoad
- 151
- Total workload / 25 (hours)
- 6.04
- ECTS
- 6.00