===== Books ===== --> Algorithms and Complexity Theory# * [[aa:team | Main]] * [[aa:intro:rules|Regulament]] * [[aa:guidelines|Guidelines]] * [[aa:exam:midterm|Midterm]] * [[aa:exam:final|Examen final]] * [[aa:syllabus|Syllabus]] * Lectures: * [[aa:lecture1 | 1. Introduction]] * [[aa:lecture2 | 2. The Turing Machine]] * [[aa:lecture3 | 3. Computing]] * [[aa:lecture4 | 4. The Universal Turing Machine]] * [[aa:lecture5 | 5. Undecidable Problems]] * [[aa:lecture6 | 6. Reductions]] * Labs: * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:1&rev=1666348771 | 1. Turing Machines]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:2&rev=1666974026 | 2. Computing]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:3&rev=1666974026 | 3. Turing Reductions]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:4&rev=1668509399 | 4. More Turing Reductions]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:5&rev=1668956820 | 5. Asymptotic Notations]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:6&rev=1671618147 | 6. Recurrence]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:7&rev=1637534804 | 7. Algoritmi nedeterministi]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:8&rev=1671391590 | 8. Reduceri polinomiale]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:9&rev=1671714531 | 9. P, NP, NPC, NPH]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:10&rev=1673696630 | 10. Invarianti la ciclare]] * [[https://ocw.cs.pub.ro/ppcarte/doku.php?id=aa:lab:11&rev=1674766784 | 11. Tipuri de date abstracte]] <-- --> Formal Languages and Automata# * [[lfa:2021:sidebar | LFA 2020-2021]] * [[lfa:2022:team | Echipa ]] * [[lfa:2022:intro:rules | Regulament 2022-2023]] * [[lfa:2022:exam | Examen 2022-2023]] * [[lfa:2022:proiect | Proiect Etapa 1]] * [[lfa:2022:proiect_etapa2 | Proiect Etapa 2]] * [[lfa:2022:proiect_etapa3 | Proiect Etapa 3]] * Labs * [[lfa:2022:lab01-programming-intro | 1. Introduction to Scala/Python]] * [[lfa:2022:lab02-dfa | 2. Deterministic finite automaton]] * [[lfa:2022:lab03-dfa-regexp | 3. Regular Expressions]] * [[lfa:2022:lab04-regexp-nfa | 4. Regex to NFA]] * [[lfa:2022:lab05-mindfa | 5. Minimal DFA]] * [[lfa:2022:lab06-dfa-to-regex | 6. DFA to Regex]] * [[lfa:2022:lab07-closure-properties | 7. Closure properties]] * [[lfa:2022:lab08-the-pumping-lemma | 8. The pumping lemma]] * [[lfa:2022:lab09-cfl | 9. Context-free languages]] * [[lfa:2022:lab10-cfl_2 | 10. Context-Free Languages & Lexers]] * [[lfa:2022:lab11-cfl_3 | 11. Context-Free Languages, Regular grammars and CNF]] * [[lfa:lab11-cfprop | 12. Recap]] /* * [[lfa:2022:dictionaries | Appendix 01: Hash functions in Python]] * [[lfa:2022:lab01-programming-intro | L01: Introduction to Python and Scala]] * [[lfa-2022:lab02-dfa | L02: Deterministic finite automaton]] * [[lfa:2022:lab03-dfa-regexp | L03: Regular Expressions]] * [[lfa:2022:lab04-lexers | L04: Lexers]] * [[lfa:2022:lab06-mindfa | L06: Minimal DFA]] * [[lfa:2022:lab06-closure-properties | L07: Closure Properties]] * [[lfa:2022:lab07-the-pumping-lemma | L08: The pumping lemma]] * [[lfa:2022:lab09-cfl | L09: Context-free languages]] * [[lfa:2022:lab10-lexer | L10: Writing simple parsers]] * [[lfa:2022:lab11-cfprop | L11: Course overview]] */ /* * [[lfa:lab05-nfa-python | L05: In Review - NFA Python Implementation]] * [[lfa:lab08-push-down-automata | L08: In Review - PDA]] * [[lfa:lab09-grammars | L09: In Review - Grammars]] * [[lfa:lab10-cfl-closures| L10: In Review - CFL Closure Properties]] * [[lfa:lab11-cfl-pumping-lemma| L11: In Review - CFL Pumping Lemma]] * [[lfa:lab12| L12: In Review - Turing Machine]] * [[lfa:lab13| L13: In Review - Limbaje decidabile]] * [[lfa:lab14| L14: In Review - Limbaje nedecidabile]] */ <-- --> Programming Paradigms# * [[pp:2022:sidebar | PP 2021-2022]] * [[pp:2023:team | Team ]] * [[pp:2023:rules | Rules ]] * [[pp:2023:plagiarism | Plagiarism]] /* * [[pp:intro | C01: Introduction ]] * [[pp:rec | C02: Side-effects and recursive functions ]] * [[pp:high| C03: Higher-order functions]] * [[pp:types | C04: Types in functional programming]] * [[pp:adt | C05: Abstract datatypes]] * [[pp:polymorphism | C06: Polymorphism in functional languages]] * [[pp:c06 | C06: Parameter passing in Programming Languages]] * [[pp:c07 | C07: Lazy evaluation in Haskell]] * [[pp:lambda | C08: The Lambda Calculus]] */ * 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]] * Lecture * [[pp:2023:scala:curs02 | C02: Functii recursive]] * [[pp:2023:scala:curs03 | C03: Functii de ordin superior]] * [[pp:2023:scala:curs04 | C04: Tipuri de date functionale]] * [[pp:2023:scala:curs05 | C05: Liste]] * [[pp:2023:scala:curs06 | C06: Aplicatii cu liste]] * [[pp:2023:scala:curs07 | C07: For expressions si companion objects]] * [[pp:2023:scala:curs08 | C08: Covarianta tipurilor]] * [[pp:2023:haskell:curs09 | C09: Introducere in Haskell]] * [[pp:2023:haskell:curs10 | C10: Evaluare lenesa]] * [[pp:2023:haskell:curs11 | C11: Programare dinamica lenesa]] * [[pp:2023:haskell:curs12 | C12: Typeclasses]] * [[pp:2023:haskell:curs13 | C13: Monads]] * [[pp:2023:haskell:curs14 | C14: The Parser Monad]] * Labs * [[pp:2023:scala:ide| L00: Scala Environment Setup]] * [[pp:2023:scala:l01| L01: Recursivity in Scala]] * [[pp:2023:scala:l02| L02: High Order Functions]] * [[pp:2023:scala:l03| L03: Lists in Scala]] * [[pp:2023:scala:l04| L04: Data types in Scala]] * [[pp:2023:scala:l05| L05: Polymorphism in Scala]] * [[pp:2023:scala:l06| L06: For Expressions & More]] * [[pp:2023:haskell:l07| L07: Lambda Calculus. Intro to Haskell]] * [[pp:2023:haskell:l08| L08: Lazy Evaluation]] * [[pp:2023:haskell:l09| L09: Algebraic Data Types]] * [[pp:2023:haskell:l10| L10: Monads]] * Homework * [[pp:2023:hw1| Homework 1]] * [[pp:2023:hw2| Homework 2]] * [[pp:2023:hw3| Homework 3]] <-- --> Functional Programming# * [[fp2022 | Functional Programming 2022]] * [[fp:2023:team | Team ]] * [[fp:2023:rules | Rules ]] * [[fp:2023:plagiarism | Plagiarism ]] * [[fp2023:submission-guidelines | Submission guidelines]] * [[fp2023:hw1 | Homework 1]] * [[fp2023:hw2 | Homework 2]] * [[fp2023:hw3 | Homework 3]] * [[fp2023:hw4 | Homework 4]] --> Lecture notes# * [[fp2023:lec02 | Lec. 02: Recursive functions]] * [[fp2023:lec03 | Lec. 03: Higher-order functions]] * [[fp2023:lec04 | Lec. 04: Algebraic datatypes]] * [[fp2023:lec05 | Lec. 05: Functional vs OO decomposition]] * [[fp2023:lec06 | Lec. 06: List applications]] * [[fp2023:lec07 | Lec. 07: For expressions and matrices]] * [[fp2023:lec08 | Lec. 08: Polymorphism]] * [[fp2023:lec09 | Lec. 09: Polymorphic expressions]] <-- --> Labs# * [[fp2023:lab01 | Lab 01: Scala IDEs]] * [[fp2023:lab02 | Lab 02: Recursive functions]] * [[fp2023:lab03 | Lab 03: Higher-order functions]] * [[fp2023:lab04 | Lab 04: Algebraic Types]] * [[fp2023:lab05 | Lab 05: Functional vs OO decomposition]] * [[fp2023:lab06 | Lab 06: List applications]] * [[fp2023:lab07 | Lab 07: Matrices]] * [[fp2023:lab08 | Lab 08: Polymorphism]] <-- <--