30-minute practice mock for Chapter 6 Theory of Computation and Computer Graphics (ACtE06): 30 MCQs (18 conceptual, 12 numerical/code-output), five from each sub-topic - finite automata (DFA and NFA, subset construction, minimization, regular expressions, pumping lemma), context-free languages (CFG derivations and parse trees, ambiguity, CNF, GNF, BNF, pushdown automata, CFL pumping lemma and closure), Turing machines (TM notation and acceptance, recognizers and transducers, multitape and nondeterministic TMs, Church-Turing thesis, universal TM, decidability, complexity, intractability and reducibility), introduction to computer graphics (raster and vector displays, frame buffers, display processors, I/O devices, graphics software standards), two-dimensional transformations (translation, rotation, scaling, reflection, shear, composite matrices, window-to-viewport mapping, Cohen-Sutherland and Liang-Barsky clipping) and three-dimensional transformations (4 x 4 homogeneous matrices, 3D composite transformations, viewing pipeline, orthographic, oblique and perspective projections). Automata and transformation answers were computed by simulation and exact matrix arithmetic, and every code-output answer was confirmed by running the code.