Обсуждение:Технологии программирования (факультатив)/03.05.2023: различия между версиями

Материал из Поле цифровой дидактики
← Предыдущая правкаСледующая правка →

Patarakin (обсуждение | вклад)

7 групп участника
19 752 правки
→Bard 2: новая тема
Строка 309: Строка 309:
   "Algorithm" -> "ComputerScienceConcept";
   "Algorithm" -> "ComputerScienceConcept";
}
}
</graphviz>
== Bard 2 ==
<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"];
  "D" [label="D"];
  "Haskell" [label="Haskell"];
  "Lisp" [label="Lisp"];
  "Scheme" [label="Scheme"];
  "Prolog" [label="Prolog"];
  "Ruby" [label="Ruby"];
  "Lua" [label="Lua"];
  "MATLAB" [label="MATLAB"];
  "R" [label="R"];
  "Julia" [label="Julia"];
  "Kotlin" [label="Kotlin"];
  "F#" [label="F#"];
  "OCaml" [label="OCaml"];
  "Scala" [label="Scala"];
  "Elixir" [label="Elixir"];
  "Erlang" [label="Erlang"];
  "Golang" [label="Golang"];
  "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"];
  "Heap" [label="Heap"];
  "Trie" [label="Trie"];
  "SegmentTree" [label="Segment Tree"];
  "SkipList" [label="Skip List"];
  "BloomFilter" [label="Bloom Filter"];
  "LRUCache" [label="LRU Cache"];
  "AVLTree" [label="AVL Tree"];
  "RedBlackTree" [label="Red Black Tree"];
  "B-Tree" [label="B-Tree"];
  "B+Tree" [label="B+Tree"];
  // 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"];
  "BubbleSort" [label="Bubble Sort"];
  "SelectionSort" [label="Selection Sort"];
  "InsertionSort" [label="Insertion Sort"];
  "MergeSort" [label="Merge Sort"];
  "QuickSort" [label="Quick Sort"];
  "HeapSort" [label="Heap Sort"];
  "BinarySearch" [label="Binary Search"];
  "LinearSearch" [label="Linear Search"];
  "BreadthFirstSearch" [label="Breadth First Search"];
  "DepthFirstSearch" [label="Depth First Search"];
  "Dijkstra'sAlgorithm" [label="Dijkstra's Algorithm"];
  "BellmanFordAlgorithm" [label="Bellman Ford Algorithm"];
  "A*Algorithm" [label="A* 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-
</graphviz>
</graphviz>

Версия от 18:34, 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

Diagrams error (with dot command): Error: /tmp/diagrams_in52832cfe01fa.dot: syntax error in line 90 scanning a quoted string (missing endquote? longer than 16384?) String starting:"Object-

Источник — http://digida.mgpu.ru/index.php?title=Обсуждение:Технологии_программирования_(факультатив)/03.05.2023&oldid=9743