Edit this page Backlinks 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ă Formal Languages and Automata LFA 2024-2025 Echipa Regulament Lectures Labs 1. DFA 2. Programming introduction - Python 3. RegEx 4. RegEx -> NFA Programming Paradigms PP 2023-2024 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 Definition L04: Lists in Scala L05: Data types in Scala L06: For expressions L07: Lambda Calculus L08: Intro to Haskell L09: Lazy Evaluation L10: Functors & Monads L11: Classes, Applicatives and More Monads Homeworks Homework 1 Homework 2 Homework 3 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