Here you can ask questions and find or give answers to organizational, academic and other questions about studying computer science.

1.2k questions

1.3k answers

1.7k comments

608 users

Most popular tags

vrs vrs_exam vrs_exercise ltl exam ctl dira omega_automata rosy parallel_computing ltl_model_checking mbes processor_architecture zielonka local-model-checking mu-calculus sequent-calculus automata se1 lo2 bdd simplex temporal greatest-simulation vrs_lecture kripke rosy_exam zdd2fdd studiengang_reform bdd2fdd exists-algorithm simulation tool fourier_motzkin equivalance bdd2zdd studiengangswechsel symbolic_computation fdd2zdd ctl_model_checking fdd2bdd floating_point_arithmetic snf induction breakpoint zdd curriculum_change vrs_cheatsheet predicate_logic dynamic_scheduling ml1 cmd b_complement_multiplication constrain-algorithm compose-algorithm #parallel_computing minic i2sc format robdd acceptance curriculum_update basic_block_scheduling unit-tests finroc sche ddd2zdd zdd2bdd hrs infinite_path branch-bound pre-requisite thesis functional state-machine uml-diagram embedded-system registration pipeline_conflicts vector_computers actiontable modulo_scheduling static_scheduling organisation lo1 conditional #pram restrict ite programming compiler abacus scheduling parallel forall notation shannon important predecessors fdd

Categories

Is Tseitin CNF-conversion / from-scratch BDD construction still examinable in Problem 1?

0 votes
In the Sep 2024 and Aug 2023 exams, Problem 1 included (a) a Tseitin CNF-conversion step before DPLL, and (c) building a BDD directly from a raw formula, deriving the Shannon normal form myself first. Neither has appeared since — Feb 2025, Sep 2025, and Feb 2026 all go straight to DPLL, and their part (c) just converts between an already-given SNF and BDD instead. Are Tseitin and from-scratch BDD construction back in scope this year, or dropped for good?
ago in * TF "Emb. Sys. and Rob." by (120 points)

1 Answer

0 votes
In general, we feel free to change any of the exam problems from time to time. Remember that we are examining the content of the lecture (slides) and not just the content of the previous exam papers.

Apart from that, converting formulas to BDDs / normal forms, and computing linear clause forms were (almost) always part of the exam papers.
ago by (172k points)

Related questions

0 votes
1 answer
this solution is still wrong
asked May 29, 2020 in * TF "Emb. Sys. and Rob." by nafisur (300 points)
+1 vote
2 answers
Result is incorrect though it satisfies CNF
asked May 3, 2020 in * TF "Emb. Sys. and Rob." by nimteaj (770 points)
 | Snow Theme by Q2A Market
Powered by Question2Answer
Imprint | Privacy Policy
...