Books
Algorithms and Complexity Theory
Main
Regulament
Lectures:
TBA
Labs:
Laboratorul 1 - Text editor
Laboratorul 2 - Notații asimptotice și analiză amortizată
Laboratorul 3 - Analiză Amortizată și TDA-uri
Laboratorul 4 - Inducție structurală
Laboratorul 5 - Analiză Probabilistă în Hashing
Laboratorul 6 - Recurențe
Laboratorul 7 - Recurențe 2
Laboratorul 8 - Arbori Binari de Căutare
Laboratorul 9 - Arbori Echilibrați
Laboratorul 10 - Probleme "dificile"
Laboratorul 11 - Reduceri Polinomiale
Laboratorul 12 - Abordări practice pentru probleme NP-Complete
Formal Languages and Automata
LFA 2024-2025
Echipa
Regulament
Proiect
Etapa 1
Etapa 2
Labs
1. DFA
2. Programming introduction - Python
3. RegEx
4. RegEx -> NFA
5. Minimal DFAs
6. Closure properties
7. Pumping lemma and its complement
8. Push Down Automaton
9. Context-Free Grammars
10. Closure properties for Context-Free Languages
11. Pumping Lemma for Context-Free Languages and Recap
Programming Paradigms
PP 2025
Team
Rules
Plagiarism
Resurse
Scala Environment
Scala Cheatsheet
Haskell Environment
Ghid de utilizare Hoogle
Haskell Cheatsheet
Labs
L01: Recursion
L02: Higher order functions
L03: Algebraic datatype definitions
L04: Lists in Scala
Homeworks
Functional Programming
Functional Programming 2024
Team
Rules
Plagiarism
Lecture notes
TBA
Labs
Lab 01: Scala IDEs
Lab 02: Recursion
Lab 03: Higher-order functions
Lab 04: Type definitions
Lab 05: Functional vs OO decomposition
Lab 06: List applications
Lab 07: Matrices
Homework
Submission Guidelines
Homework 1: Sets as functions
Homework 2: Sets as trees
Homework 3: Five-in-a-row