Books
Algorithms and Complexity Theory
Main
Regulament
Guidelines
Lectures:
Introduction and Turing Machines
Computing
Labs:
Math recap
Turing Machines
Computing
Turing Reductions
More Turing Reductions
Notații Asimptotice
Probleme "Dificile"
Reduceri polinomiale
P, NP, NPC, NPH
Recurențe
Analiză Amortizată
TDA-uri și inducție structurală
Formal Languages and Automata
LFA 2022-2023
Echipa
Regulament
Lectures
1. ???
Labs
1. Programming introduction - Python
2. DFA and Regex intro
3. Regex practice
4. Regex to DFA
5. DFA minimisation
6. DFA to Regex
7. Closure properties
8. Pumping lemma
9. Context-Free Languages
10. CFG to PDA; Lexers
Proiect
Coding Style
Bonus
Programming Paradigms
PP 2022-2023
Team
Rules
Plagiarism
Resurse
Scala Environment
Scala Cheatsheet
Haskell Environment
Ghid de utilizare Hoogle
Haskell Cheatsheet
Lecture
Labs
L00: Scala Environment Setup
L01: Recursivity in Scala
L02: High Order Functions
L03: Lists in Scala
L04: Data types in Scala
L05: Variance and Implicits
L06: For expressions
L07: Lambda Calculus
L08: Introduction to Haskell
L09: Lazy Evaluation
L10: Data types in Haskell
L11: Functors & Monads
Homework
Homework 1
Homework 2
Homework 3
Functional Programming
Functional Programming 2023
Team
Rules
Plagiarism
Homework 1
Homework 2
Homework 3
Homework 4
Lecture notes
TBA
Labs
Lab 01: Scala IDEs
Lab 02: Recursive functions
Lab 03: Higher-order functions
Lab 04: Algebraic datatypes
Lab 05: OO vs Functional decomposition
Lab 06: List applications
Lab 07: Polymorphism
Lab 08: Matrices