https://ocw.cs.pub.ro/ppcarte/ 2026-04-17T20:36:05+03:00 https://ocw.cs.pub.ro/ppcarte/ https://ocw.cs.pub.ro/ppcarte/lib/tpl/bootstrap3/images/favicon.ico text/html 2021-05-18T12:43:42+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=admitere-informatica-2021&rev=1621331022&do=diff Lectie filmata online Varianta 2. Problema 3 Un tablou bidimensional a cu n linii si n coloane numerotate de la 1 la n, este simetric fata de diagonala secundara, daca pentru orice pereche de indici (i,j) este adevarata expresia: * a[i][j] = a[j][i]$ G$$ G_1$$ G$$ G_1$$ G$$ G$$ n$$ m$$ G_1$$ G$$ m$$ G_1$$ \frac{n(n-1)}{2}-m$$ F(N)=2*F(N-1)$$ N > 0$$ F(0)=1$$ F(N)=2^N$$ 2^7=128$$ x_iy_jz_k$$ x_iy_jz_{k+1}$$ x_iy_jz_n$$ x_iy_{j+1}B$$ B$$ x_iy_mz_n$$ x_{i+1}AB$$ x_{i+1}$$ B$$ A$$ 0 \leq m \le… text/html 2023-09-21T21:33:22+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=archive&rev=1695321202&do=diff Books * Main * Regulament * Guidelines * Midterm * Examen final * Syllabus * Lectures: * 1. Introduction * 2. The Turing Machine * 3. Computing * 4. The Universal Turing Machine * 5. Undecidable Problems * 6. Reductions * Labs: * 1. Turing Machines * 2. Computing * 3. Turing Reductions * 4. More Turing Reductions * 5. Asymptotic Notations * 6. Recurrence * 7. Algoritmi nedeterministi * 8. Reduce… text/html 2019-04-18T14:49:26+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=ereee&rev=1555588166&do=diff -> text/html 2019-04-18T18:23:51+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=err2r3424&rev=1555601031&do=diff $ \texttt{lol}$ monospaced asdf $$ aasdf$$ qwer \(1 + 2 + 3\) -> text/html 2020-09-04T10:22:13+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=exam&rev=1599204133&do=diff 1. Scrieti o functie in Haskell care verifica daca o doua liste contin exact aceleasi elemente (nu neaparat in ordine). 2. Scrieti un predicat in Prolog care verifica daca toate elementele unei liste sunt pozitive. 3. Evaluati, folosind strategiile normala si aplicativa, urmatoarea lambda-expresie $ (\lambda x.(x\;(x\;x))\; (\lambda z.x\;\lambda x.z))$ text/html 2020-05-27T09:19:52+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=examen-27-mai&rev=1590560392&do=diff Examen restanta 27 mai 1. Scrieti o functie care primeste o lista de String-uri si interschimba primul caracter cu al patrulea. Exemplu: repl ["Matei", "Mihai", "George"] = ["eatMi", "aihMi", "reoGge"] 2. Scrieti un predicat care primeste o lista de liste imbricate, si construieste o lista text/html 2020-05-29T09:05:54+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=examen-29-mai&rev=1590732354&do=diff Examen 29 mai Examen AA 2 1. Găsiți o limită superioară pentru: $ T(n) = 2T(\sqrt n) + log(n)$ 2. Scrieți un algoritm nedeterminist pentru problema kpath(G, K): există o cale de lungime K în graful G? 3. Fie problema $ f(M, A) = 1 \Leftrightarrow \forall w \in A, M(w) halts$ (unde $ A$ este o mulțime finită); demonstrați că $ f$$ f$$ g$$ f \in NPC$$ f$$ g$$ f \leq_p g$$ g \leq_p f$$ \forall t, flip(flip(t)) = t$ text/html 2023-02-27T16:34:48+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=fp2022&rev=1677508488&do=diff Functional Programming lecture in 2022 Activity outline * Team * Rules * Plagiarism * Submission guidelines * Homework 1 * Homework 2 * Homework 3 * Homework 4 * Exam 2022 Lecture notes * Lecture 02 * Lecture 03 * Lecture 04 * Lecture 05 * Lecture 06 * Lecture 07 * Lecture 08 * Lecture 09 Labs * Lab 01: Scala IDEs * Lab 02: Syntax and functions * Lab 03: Higher-order functions * Lab 04: Lists in Scala * Lab 05: Datatypes… text/html 2024-03-08T11:35:25+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=fp2023&rev=1709890525&do=diff Functional Programming lecture in 2023 * Functional Programming 2022 * Team * Rules * Plagiarism Lecture notes * Lec. 02: Recursive functions * Lec. 03: Higher-order functions * Lec. 04: Algebraic datatypes * Lec. 05: Functional vs OO decomposition * Lec. 06: List applications * Lec. 07: For expressions and matrices * Lec. 08: Polymorphism * Lec. 09: Polymorphic expressions Labs * Lab 01: Scala IDEs * Lab 02: Recursive functions * Lab 03: Hi… text/html 2025-02-25T20:37:42+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=fp2024&rev=1740508662&do=diff Functional Programming 2023-2024 * Team * Rules * Plagiarism * Homework 1 * Homework 2 * Homework 3 * Homework 4 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 text/html 2020-09-15T14:05:22+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=laborator-lfa&rev=1600167922&do=diff Laborator LFA Lab. 1 Introduction to Python text/html 2020-09-10T17:57:59+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=laborator&rev=1599749879&do=diff Laborator AA Part 1 - Decidability - 4 labs 1. Turing Machine Key concepts: * computation (the output of the tape) and acceptance (acceptare); * mechanical description of an algorithm * (Answers online - discussion) A Turing Machine consists of:$ \Sigma$$ K$$ q_0$$ \delta : K \times \Sigma \rightarrow K \times \Sigma \times \{L,H,R\}$$ F \subseteq K$$ K,\Sigma, \delta, q_0, F$$ n^2$$ n\cdot \log{n}$ text/html 2021-05-16T21:53:15+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=project-2-draft&rev=1621191195&do=diff Task Set 4 For the final tasks of this project, we want to merge the information about students' class situation from the 3 tables (lecture, exam, homework) !!! Please add links to csvs!!! . The issue with joining these 3 tables is that table lecture_grades text/html 2021-04-25T16:07:09+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=project-3-draft&rev=1619356029&do=diff Task Set 3 (Query Language & Graphs) Query Language overview The objective of this task set is to: * allow programmers to combine table processing functions in a flexible way * create a separation between what functions do and how they are implemented. This is helpful for a number of reasons: text/html 2020-05-20T18:39:42+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=sample_exam&rev=1589989182&do=diff Sample Exam 1. (1p) Scrieti o functie care intoarce lista tuturor patratelor perfecte. 2. (1p) Scrieti un program Prolog care genereaza lista tuturor patratelor perfecte. 3. (1p) Scrieti o lambda-expresie reductibila pentru care evaluarea normala si evaluarea aplicativa se comporta diferit. text/html 2026-04-15T19:18:48+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=sidebar&rev=1776269928&do=diff Books * 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 - Proble… text/html 2016-04-22T11:14:37+03:00 https://ocw.cs.pub.ro/ppcarte/doku.php?id=start&rev=1461312877&do=diff About This is a repo for Matei Popovici's books.