Question 1
Question 2
Question 3
L = { 2nk | k > 0 , and n is non − negative integer number }
The minimum number of states of finite automaton which accept the language L is2n
Question 4
Question 5
Question 6
MOV AL, 153 NEG ALThe contents of the destination register AL (in 8-bit binary notation), the status of Carry Flag(CF) and Sign Flag(SF) after the execution of above instructions, are
Question 7
Public static int f(int a) {
//Pre-conditions : a>0 and no overflow/underflow occurs
int b = 0;
for (int i = 0; i < 32; i++) {
b = b << 1;
b = b | (a & 1);
a = a >>> 1; // This is a logical shift
}
Return b;
}
Question 8
(N-1)2
Question 9
Question 10
There are 100 questions to complete.