|Name||Algorithms and Methods of Programming|
|Status||Compulsory/Courses of Limited Choice|
|Level and type||Undergraduate Studies, Academic|
|Field of study||Computer Science|
|Academic staff||Jurijs Lavendels, Gints Jēkabsons|
|Credit points||2.0 (3.0 ECTS)|
The aim of the course is to develop algorithmzation skills, practical software development.Topics covered by the course include: Definition of algorithm. Parts of algorithm theory. Algorithms and software. Communication and synchronization between running algorithms..
Goals and objectives
of the course in terms
of competences and skills
|The results are achived providing: academic knowledge on parts of algorithm theory, properties and development, formal language theory, generative grammar,lexical analysis,implementation of recursion in development of a number software.|
Students are able to independently study the grammatical qualities and develop their own grammar and determine which forms of analysis can be implemented in the software - A test in which the student develops grammar, for example, a grammar that treats arithmetical operations as a priority.
Students can use compilers specific algorithms for other tasks. - Homework in which the student performs, for example, the inclusion and retrieval of data in symbol tables.
Students can compare the performance of different types of analyzers. - Homework, in which the student evaluates the performance of analyzers in the analysis of the magnitude of the number of operations to be performed.
|Course prerequisites||Programming languages, operating systems|