Edit this page Backlinks This page is read only. You can view the source, but not change it. Ask your administrator if you think this is wrong. ===== Books ===== --> Algorithms and Complexity Theory# * [[aa:team | Main]] * [[aa:intro:rules|Regulament]] * Lectures: * TBA * Labs: * [[aa:lab:1|Laboratorul 1 - Text editor]] * [[aa:lab:2|Laboratorul 2 - Notații asimptotice și analiză amortizată]] * [[aa:lab:3|Laboratorul 3 - Analiză Amortizată și TDA-uri]] * [[aa:lab:4|Laboratorul 4 - Inducție structurală]] <-- --> Formal Languages and Automata# * [[lfa:2024 | LFA 2024-2025]] * [[lfa:2025:team | Echipa ]] * [[lfa:2025:intro:rules | Regulament ]] * Lectures * Labs * [[lfa:2025:lab01 | 1. DFA ]] * [[lfa:2025:lab02 | 2. Programming introduction - Python ]] * [[lfa:2025:lab03 | 3. RegEx]] * [[lfa:2025:lab04 | 4. RegEx -> NFA]] /* * [[lfa:2024:c01 | 1. ???]] * Proiect * [[lfa:2024:proiect | Etapa 1]] * [[lfa:2024:proiect:etapa2 | Etapa 2]] * Labs * [[lfa:2024:lab01 | 1. DFA intro]] * [[lfa:2024:lab02 | 2. Programming introduction - Python]] * [[lfa:2024:lab03 | 3. Regular Expressions]] * [[lfa:2024:lab04 | 4. Regex Representation in Python]] * [[lfa:2024:lab05 | 5. Regex to NFA to DFA conversions]] * [[lfa:2024:lab06 | 6. DFA Minimisation]] * [[lfa:2024:lab07 | 7. Closure properties]] * [[lfa:2024:lab08 | 8. Pumping lemma]] * [[lfa:2024:lab09 | 9. Push Down Automata]] * [[lfa:2024:lab10 | 10. Context-Free Grammars]] * [[lfa:2024:lab11 | 11. Closure properties for Context-Free Languages]] */ /* * [[lfa:2023:proiect | Proiect ]] * [[lfa:2023:proiect_coding_style | Coding Style ]] * [[lfa:2023:bonus | Bonus ]] */ <-- --> Programming Paradigms# * [[pp:2024:sidebar | PP 2023-2024]] * [[pp:2025:team | Team ]] * [[pp:2025:rules | Rules ]] * [[pp:2025:plagiarism | Plagiarism]] * Resurse * [[pp:scala-environment | Scala Environment]] * [[https://docs.scala-lang.org/cheatsheets/ | Scala Cheatsheet]] * [[pp:haskell-environment | Haskell Environment]] * [[pp:hoogle | Ghid de utilizare Hoogle]] * [[https://drive.google.com/file/d/1n6_OGQzsFin35DBabWFnbIUyv66cR68B/view | Haskell Cheatsheet]] * Labs * [[pp:2025:scala:l01 | L01: Recursion ]] * [[pp:2025:scala:l02 | L02: Higher-order functions ]] * [[pp:2025:scala:l03 | L03: Algebraic Datatype Definition ]] * [[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 * [[pp:2025:scala:t01 | Homework 1 ]] * [[pp:2025:scala:t02 | Homework 2 ]] * [[pp:2025:haskell:tema3 | Homework 3 ]] <-- --> Functional Programming# /* * [[fp2022 | Functional Programming 2022]] * [[fp2023 | Functional Programming 2023]] */ * [[fp2024 | Functional Programming 2024]] * [[fp:2025:team | Team ]] * [[fp:2025:rules | Rules ]] * [[fp:2025:plagiarism | Plagiarism ]] --> Lecture notes# * TBA <-- --> Labs# * [[fp2025:lab01 | Lab 01: Scala IDEs]] * [[fp2025:lab02 | Lab 02: Recursion]] * [[fp2025:lab03 | Lab 03: Higher-order functions]] * [[fp2025:lab04 | Lab 04: Type definitions]] * [[fp2025:lab05 | Lab 05: Functional vs OO decomposition]] * [[fp2025:lab06 | Lab 06: List applications]] * [[fp2025:lab07 | Lab 07: Matrices]] <-- --> Homework * [[fp2025:submission-guidelines | Submission Guidelines]] * [[fp2025:hw1 | Homework 1: Sets as functions]] * [[fp2025:hw2 | Homework 2: Sets as trees]] * [[fp2025:hw3 | Homework 3: Five-in-a-row]] <-- <--