Обсуждение:Технологии программирования (факультатив)/03.05.2023: различия между версиями
Материал из Поле цифровой дидактики
Patarakin (обсуждение | вклад) |
Patarakin (обсуждение | вклад) →Bard - links: новая тема |
||
| Строка 406: | Строка 406: | ||
} | } | ||
</graphviz> | |||
== Bard - links == | |||
<graphviz> | |||
digraph ComputerScienceOntology { | |||
node [shape=box]; | |||
// Programming Languages | |||
"ProgrammingLanguage" [label="Programming Language"]; | |||
"AssemblyLanguage" [label="Assembly Language"]; | |||
"C" [label="C"]; | |||
"C++" [label="C++"]; | |||
"Java" [label="Java"]; | |||
"Python" [label="Python"]; | |||
"JavaScript" [label="JavaScript"]; | |||
"PHP" [label="PHP"]; | |||
"Go" [label="Go"]; | |||
"Rust" [label="Rust"]; | |||
"Swift" [label="Swift"]; | |||
// Data Structures | |||
"DataStructure" [label="Data Structure"]; | |||
"Array" [label="Array"]; | |||
"List" [label="List"]; | |||
"Stack" [label="Stack"]; | |||
"Queue" [label="Queue"]; | |||
"HashTable" [label="Hash Table"]; | |||
"Tree" [label="Tree"]; | |||
"Graph" [label="Graph"]; | |||
// Algorithms | |||
"Algorithm" [label="Algorithm"]; | |||
"SortingAlgorithm" [label="Sorting Algorithm"]; | |||
"SearchingAlgorithm" [label="Searching Algorithm"]; | |||
"GraphTraversalAlgorithm" [label="Graph Traversal Algorithm"]; | |||
"DivideAndConquerAlgorithm" [label="Divide and Conquer Algorithm"]; | |||
"DynamicProgrammingAlgorithm" [label="Dynamic Programming Algorithm"]; | |||
"GreedyAlgorithm" [label="Greedy Algorithm"]; | |||
"BacktrackingAlgorithm" [label="Backtracking Algorithm"]; | |||
// Computer Science Concepts | |||
"ComputerScienceConcept" [label="Computer Science Concept"]; | |||
"AlgorithmComplexity" [label="Algorithm Complexity"]; | |||
"BigONotation" [label="Big O Notation"]; | |||
"TimeComplexity" [label="Time Complexity"]; | |||
"SpaceComplexity" [label="Space Complexity"]; | |||
"Recursion" [label="Recursion"]; | |||
"Abstraction" [label="Abstraction"]; | |||
"Encapsulation" [label="Encapsulation"]; | |||
"Inheritance" [label="Inheritance"]; | |||
"Polymorphism" [label="Polymorphism"]; | |||
"Object-OrientedProgramming" [label="Object-Oriented Programming"]; | |||
// Relationships | |||
"ProgrammingLanguage" -> "DataStructure"; | |||
"ProgrammingLanguage" -> "Algorithm"; | |||
"ProgrammingLanguage" -> "ComputerScienceConcept"; | |||
"DataStructure" -> "Algorithm"; | |||
"DataStructure" -> "ComputerScienceConcept"; | |||
"Algorithm" -> "ComputerScienceConcept"; | |||
"Algorithm" -> "DataStructure"; | |||
"Algorithm" -> "SortingAlgorithm"; | |||
"Algorithm" -> "SearchingAlgorithm"; | |||
"Algorithm" -> "GraphTraversalAlgorithm"; | |||
"SortingAlgorithm" -> "Algorithm"; | |||
"SearchingAlgorithm" -> "Algorithm"; | |||
"GraphTraversalAlgorithm" -> "Algorithm"; | |||
"DivideAndConquerAlgorithm" -> "Algorithm"; | |||
"DynamicProgrammingAlgorithm" -> "Algorithm"; | |||
"GreedyAlgorithm" -> "Algorithm"; | |||
"BacktrackingAlgorithm" -> "Algorithm"; | |||
"ComputerScienceConcept" -> "AlgorithmComplexity"; | |||
"ComputerScienceConcept" -> "BigONotation"; | |||
"ComputerScienceConcept" -> "TimeComplexity"; | |||
"ComputerScienceConcept" -> "SpaceComplexity"; | |||
"ComputerScienceConcept" -> "Recursion"; | |||
"ComputerScienceConcept" -> "Abstraction"; | |||
"ComputerScienceConcept" -> "Encapsulation"; | |||
"ComputerScienceConcept" -> "Inheritance"; | |||
"ComputerScienceConcept" -> "Polymorphism"; | |||
"ComputerScienceConcept" -> "Object-OrientedProgramming"; | |||
} | |||
</graphviz> | </graphviz> | ||
Версия от 18:39, 3 мая 2023
Computer Science Ontology (Chat GPT)
Write Computer Science Ontology in GraphViz dot language (Perplaxity)
Write Computer Science Ontology (POE - SAGE)
Put attention on differen ages of computational systems (Sage)
Bard
Bard 2
Bard - links
