|
Theoretical Computer Science; Languages: regular expressions, context-free grammars, recursive definitions; Automata: finite automata (deterministic and non-deterministic), conversion from grammars to automata, transition graphs, push-down automata; problem-solving: understanding and developing algorithms; Implementing algorithms to apply language definitions and to simulate automaton: iteration, nested iteration, arrays, multidimensional arrays, scope of variables, ststic methods, defining classes, creating objects, defining and calling instance methods and constructors, parament passing recursion, simple searching and sorting algorithms.
|