Information Technology - Online Test

Q1. What is the chromatic number of an n-vertex simple connected graph which does not contain any odd length cycle? Assume n ≥ 2
Answer : Option A
Explaination / Solution:
No Explaination.


Q2. Which one of the following is TRUE for any simple connected undirected graph with more than 2 vertices?
Answer : Option C
Explaination / Solution:
No Explaination.


Q3. What is the minimum number of gates required to implement the Boolean function (AB + C) if we have to use only 2-input NOR gates?
Answer : Option B
Explaination / Solution:
No Explaination.


Q4. How many 32K × 1 RAM chips are needed to provide a memory capacity of 256 K-bytes =
Answer : Option C
Explaination / Solution:
No Explaination.


Q5. In which one of the following page replacement policies, Belady’s anomaly may occur?
Answer : Option A
Explaination / Solution:
No Explaination.


Q6. S → a Sa| bSb| a| b The language generated by the above grammar over the alphabet {a, b} is the set of
Answer : Option B
Explaination / Solution:
No Explaination.


Q7. Let πbe a problem that belongs to the class NP. Then which one of the following is TRUE?
Answer : Option C
Explaination / Solution:
No Explaination.


Q8. Given the following state table of an FSM with two states A and B, one input and one output: 

If the initial state is A = 0, B = 0, what is the minimum length of an input string which will take the machine to the state A = 0, B = 1 with Output = 1?
Answer : Option A
Explaination / Solution:
No Explaination.


Q9. In a compiler, keywords of a language are recognized during
Answer : Option C
Explaination / Solution:

Any identifier is also a token so it is recognized in lexical Analysis

Q10. A CPU generally handles an interrupt by executing an interrupt service routine
Answer : Option C
Explaination / Solution:
No Explaination.