# Prezentacje

Prezentacje w zespołach dwuosobowych.

**Czas prezentacji:** 10 minut + 3 minuty na pytania.

Slajdy do prezentacji (maksymalnie 5 slajdów) proszę przesłać mailowo przed zajęciami.

## **Wyszukiwanie w tekście**

* 7 stycznia 2020 r. - grupy 103, 105
* 14 stycznia 2020 r. - grupa 102

| Lp. | Temat prezentacji                                                                                            | Grupa 102 | Grupa 103 | Grupa 105 |
| --- | ------------------------------------------------------------------------------------------------------------ | --------- | --------- | --------- |
| 1   | [algorytm Knutha-Morrisa-Pratta](https://en.wikipedia.org/wiki/Knuth%E2%80%93Morris%E2%80%93Pratt_algorithm) | -         | -         | *wolny*   |
| 2   | [algorytm Boyera-Moore'a](https://en.wikipedia.org/wiki/Boyer%E2%80%93Moore_string-search_algorithm)         | -         | -         | -         |
| 3   | [algorytm Rabina-Karpa](https://en.wikipedia.org/wiki/Rabin%E2%80%93Karp_algorithm)                          | -         | -         | *wolny*   |
| 4   | [algorytm Aho-Corasick](https://en.wikipedia.org/wiki/Aho%E2%80%93Corasick_algorithm)                        | -         | *wolny*   | *wolny*   |
| 5   | [algorytm *bitap* (*shift-and*)](https://en.wikipedia.org/wiki/Bitap_algorithm)                              | -         | *wolny*   | *wolny*   |

## Algorytmy grafowe

* 21 stycznia 2020 r. - grupy 103, 105
* 28 stycznia 2020 r. - grupa 102

| Lp. | Temat prezentacji                                                                       | Grupa 102 | Grupa 103 | Grupa 105 |
| --- | --------------------------------------------------------------------------------------- | --------- | --------- | --------- |
| 1   | [algorytm Prima](https://en.wikipedia.org/wiki/Prim%27s_algorithm)                      | -         | -         | -         |
| 2   | [algorytm Kruskala](https://en.wikipedia.org/wiki/Kruskal%27s_algorithm)                | -         | *wolny*   | -         |
| 3   | [algorytm Bellmana-Forda](https://en.wikipedia.org/wiki/Bellman%E2%80%93Ford_algorithm) | -         | *wolny*   | -         |
| 4   | [algorytm Dijkstry](https://en.wikipedia.org/wiki/Dijkstra%27s_algorithm)               | -         | -         | -         |
| 5   | [algorytm A\*](https://en.wikipedia.org/wiki/A*_search_algorithm)                       | -         | -         | -         |


---

# Agent Instructions: Querying This Documentation

If you need additional information that is not directly available in this page, you can query the documentation dynamically by asking a question.

Perform an HTTP GET request on the current page URL with the `ask` query parameter:

```
GET https://pw.karolpiczak.com/dydaktyka/2019z-aisdi-cwiczenia/prezentacje.md?ask=<question>
```

The question should be specific, self-contained, and written in natural language.
The response will contain a direct answer to the question and relevant excerpts and sources from the documentation.

Use this mechanism when the answer is not explicitly present in the current page, you need clarification or additional context, or you want to retrieve related documentation sections.