Code | DSP202 |

Name | Discrete Structures of Computer Science |

Status | Compulsory/Courses of Limited Choice |

Level and type | Undergraduate Studies, Academic |

Field of study | Computer Science |

Faculty | |

Academic staff | Jānis Grundspeņķis, Judīte Ciekure, Raisa Smirnova, Vita Šakele |

Credit points | 3.0 (4.5 ECTS) |

Parts | 1 |

Annotation |
During their studies students acquire the practical applications of discrete mathematics concepts, graph algorithms and mathematical foundations of data base. Students acquire the properties of binary relations by detailed examination of equivalence and ordering. Students acquire key elements of graph theory, ways of graph representations. Theoretical knowledge has to be used by practical calculations with shortest path algorithm; algorithm for minimal spanning tree and algorithm for maximum flow problem. The course also observes basic concepts of relational database, operations of relational algebra and basics elements of Structured Query Language (SQL).. While studying the subject students have to work out course work; they have to write a program that solves the defined task by using algorithms and concepts given in lectures.. |

Goals and objectives of the course in terms of competences and skills |
The goal of the course is to get skills of practical applications of such concepts of Discrete Mathematics as relations, mappings and ordering, so that at the end of the course students will be able to analyse properties of relations and to create mappings with various properties. After the course a student has to understand concepts of Graph theory, know graph representations and has to be able to apply the following graph algorithms: Dijkstra’s algorithm, Prim’s algorithm and Ford-Fulkerson algorithm. Students have to understand basic concepts of relational database, have to be able to implement relational operations with data base tables and to form query for the relational database. |

Learning outcomes and assessment |
Students are able to to analyse properties of relations and to use special types of relations for description of real problems. - Students are able to pass the test “Equivalence” and correctly answer the questions of the 1st section of the theoretical part of examination. Students are able to show graph representations. - Students are able to pass a practical work “Graph representations”and correctly answer the questions of the 3rd section of the theoretical part of examination. Students are able to apply graph algorithms. - Students are able to do 3 home works and correctly answer the questions of the 3rd section of the theoretical part of examination and solve the 2nd task of the practical part of examination. Students are able to determine different types of mapping and to create mappings with various properties. - Students are able to do practical work “Mapping” and correctly answer the questions of the 2nd section of the theoretical part of examination. Students are able to apply the tree traversal algorithms to obtain prefix, postfix notation and to calculate its value. - Students are able to accomplish practical work “Trees” and correctly answer the questions of the 4th section of the theoretical part of examination. Students are able to apply operations of relational algebra and to form query for relational database. - Students are able to accomplish practical work “Databases and relations” and correctly answer the questions of the 5th section of the theoretical part of examination and solve the 1st task of the practical part of exam |

Course prerequisites | Fundamental concepts of set theory: set, subset, set operations (union, intersection, difference). |

[Extended course information PDF]