Programmazione in Java.
Preliminary: Hello, Strings.
Recursion: Factorial.
Backtracking: Dispositions, Permutations,
nQueens, QueenSimpleSolver (using objects), QueenSolver (using objects and graphic presentation).
Threads: CounterThread1, CounterThread2.
To be updated:
Classes: pairs, list_of_int, list_of_any, list_module, list_template, stacks of trees, queue_of_int, queue_module.
Search: Binary search, longestcommonsubsequence.
Sorting: bubblesort, mergesort, quicksort, heapsort_on_array.
Trees: minimal_spanning_tree of undirected graphs,
tree_depth_first_visit1 (iterative), tree_depth_first_visit2 (recursive).
Graphs: graph_depth_first_visit (or reachability in a graph) (list_module and graph1_in files needed).
Theorem Proving for Propositional Calculus.
Parser for regular languages.
Parser for context-free languages.
Preliminary: Hello, Strings.
Recursion: Factorial.
Backtracking: Dispositions, Permutations,
Queens, QueenSimpleSolver (using objects), QueenSolver (using objects and graphic presentation).
Threads: CounterThread1, CounterThread2.
Sequential Fibonacci, Parallel Fibonacci (exponential), Parallel Fibonacci (linear): 1, 2, 3.
Parallel QuickSort: 1, 2, 3.