CLASS ROOM QUIZ - 1
Class Room Quiz 1 This is Abhinav Pal Making a Class Room Quiz The language L = (0n 1n 2n where n > 0) is a context free language context-sensitive language regular language recursive enumerable language For which of the following application, regular expressions can not be used ? Designing computers Designing compilers Both (a) and (b) Developing computers Which of the following statements is (are) correct ? Recursive languages are closed under complementation. If a language and its complement are both regular, the language is recursive Set of recursively enumerable language is closed under union All of these The subcategories of orthographic projection are cavalier, cabinet, isometric cavalier, cabinet, isometric isometric, dimetric, trimetric isometric, cavalier, trimetric In the raster-scan method for transformation, a 90° rotation can be performed by reversing the order of bits within each row in the frame buffer by performing XOR on th...