Question 2 Let L be a language that can be recognized by a finite automaton. The language LR consisting of reverse of the elements of L […]

Question 4 The basic logic of pumping lemma can be considered as a good example of A recursion B iteration C pigeonhole principle D divide-and-conquer Question […]

Question 5 Which of the following scheduling algorithms is non-preemptive? A Round-robin B First in, first out C Multilevel queue scheduling D Multilevel queue scheduling with […]

Question 6 The part of machine level instruction, which tells central processor what has to be done, is A address B locator C operation code D […]