- 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
- Objectives
- 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 acquainted with the basic elements of combinatorics - permutations, variations, combinations, partitions, compositions.
- 2
- get acquainted with the meaning of graph, types of graphs and apply this knowledge in solving various problems and apply them to programming.
- 3
- to get acquainted with the concept of roads and circuits and connectivity, in order to apply them to phenomena and problems in the field of computer science.
- 4
- get acquainted with the Euler and Hamiltonian Graph and their application in programming.
- 5
- get acquainted with the problem of the shortest path and its application in programming.
- 6
- get acquainted with isomorphic graphs.
- Quantity Percentage Total percent
- Midterms
- 1 30% 30%
- Quizzes
- 0 0% 0%
- Projects
- 1 30% 30%
- Term projects
- 0 0% 0%
- Laboratories
- 0 0% 0%
- Class participation
- 0 0% 0%
- Total term evaluation percent
- 60%
- Final exam percent
- 40%
- Total percent
- 100%
- Quantity Duration (hours) Total (hours)
- Course duration (including exam weeks)
- 16 4 64
- Off class study hours
- 14 3 42
- Duties
- 1 15 15
- Midterms
- 1 10 10
- Final exam
- 1 15 15
- Other
- 0 0 0
- Total workLoad
- 146
- Total workload / 25 (hours)
- 5.84
- ECTS
- 6.00