Differences
This shows you the differences between two versions of the page.
| Both sides previous revision Previous revision Next revision | Previous revision | ||
|
sidebar [2025/11/11 08:02] stefan.sterea |
sidebar [2026/03/09 23:16] (current) ldaniel |
||
|---|---|---|---|
| Line 13: | Line 13: | ||
| * [[aa:lab:5|Laboratorul 5 - Analiză Probabilistă în Hashing]] | * [[aa:lab:5|Laboratorul 5 - Analiză Probabilistă în Hashing]] | ||
| * [[aa:lab:6|Laboratorul 6 - Recurențe]] | * [[aa:lab:6|Laboratorul 6 - Recurențe]] | ||
| + | * [[aa:lab:7|Laboratorul 7 - Recurențe 2]] | ||
| + | * [[aa:lab:8|Laboratorul 8 - Arbori Binari de Căutare]] | ||
| + | * [[aa:lab:9|Laboratorul 9 - Arbori Echilibrați]] | ||
| + | * [[aa:lab:10|Laboratorul 10 - Probleme "dificile"]] | ||
| + | * [[aa:lab:11|Laboratorul 11 - Reduceri Polinomiale]] | ||
| + | * [[aa:lab:12|Laboratorul 12 - Abordări practice pentru probleme NP-Complete]] | ||
| <-- | <-- | ||
| Line 20: | Line 26: | ||
| * [[lfa:2025:team | Echipa ]] | * [[lfa:2025:team | Echipa ]] | ||
| * [[lfa:2025:intro:rules | Regulament ]] | * [[lfa:2025:intro:rules | Regulament ]] | ||
| - | + | ||
| - | * Lectures | + | * Proiect |
| + | * [[lfa:2025:proiect:etapa1 | Etapa 1]] | ||
| + | * [[lfa:2025:proiect:etapa2 | Etapa 2]] | ||
| * Labs | * Labs | ||
| * [[lfa:2025:lab01 | 1. DFA ]] | * [[lfa:2025:lab01 | 1. DFA ]] | ||
| Line 30: | Line 37: | ||
| * [[lfa:2025:lab05 | 5. Minimal DFAs]] | * [[lfa:2025:lab05 | 5. Minimal DFAs]] | ||
| * [[lfa:2025:lab06 | 6. Closure properties]] | * [[lfa:2025:lab06 | 6. Closure properties]] | ||
| + | * [[lfa:2025:lab07 | 7. Pumping lemma and its complement]] | ||
| + | * [[lfa:2025:lab08 | 8. Push Down Automaton]] | ||
| + | * [[lfa:2025:lab09 | 9. Context-Free Grammars]] | ||
| + | * [[lfa:2025:lab10 | 10. Closure properties for Context-Free Languages]] | ||
| + | * [[lfa:2025:lab11 | 11. Pumping Lemma for Context-Free Languages and Recap]] | ||
| Line 65: | Line 77: | ||
| --> Programming Paradigms# | --> Programming Paradigms# | ||
| - | * [[pp:2024:sidebar | PP 2023-2024]] | + | * [[pp:2025:sidebar | PP 2025]] |
| - | * [[pp:2025:team | Team ]] | + | * [[pp:2026:team | Team ]] |
| - | * [[pp:2025:rules | Rules ]] | + | * [[pp:2026:rules | Rules ]] |
| - | * [[pp:2025:plagiarism | Plagiarism]] | + | * [[pp:2026:plagiarism | Plagiarism]] |
| * Resurse | * Resurse | ||
| Line 79: | Line 91: | ||
| * Labs | * Labs | ||
| - | * [[pp:2025:scala:l01 | L01: Recursion ]] | + | * [[pp:2026:scala:l01 | L01: Recursion ]] |
| - | * [[pp:2025:scala:l02 | L02: Higher-order functions ]] | + | * [[pp:2026:scala:l02 | L02: Higher order functions ]] |
| - | * [[pp:2025:scala:l03 | L03: Algebraic Datatype Definition ]] | + | * [[pp:2026:scala:l03 | L03: Algebraic datatype definitions ]] |
| - | * [[pp:2025:scala:l04 | L04: Lists in Scala ]] | + | |
| - | * [[pp:2025:scala:l05 | L05: Data types in Scala ]] | + | |
| - | * [[pp:2025:scala:l06 | L06: For expressions]] | + | |
| - | * [[pp:2025:l07 | L07: Lambda Calculus]] | + | |
| - | * [[pp:2025:l08 | L08: Intro to Haskell]] | + | |
| - | * [[pp:2025:l09 | L09: Lazy Evaluation]] | + | |
| - | * [[pp:2025:l10 | L10: Functors & Monads]] | + | |
| - | * [[pp:2025:l11 | L11: Classes, Applicatives and More Monads]] | + | |
| * Homeworks | * Homeworks | ||
| - | * [[pp:2025:scala:t01 | Homework 1 ]] | ||
| - | * [[pp:2025:scala:t02 | Homework 2 ]] | ||
| - | * [[pp:2025:haskell:tema3 | Homework 3 ]] | ||
| <-- | <-- | ||