-
259.
Consider the following Finite State Automaton:
[1] The language accepted by this automaton is given by the regular expression
[2 marks]
(A) b*ab*ab*ab*
(B) (a+b)*
(C) b*a (a+b)*
(D) b*ab*ab*
[2] The minimum state automaton equivalent to the above FSA has the following number of states [2 marks]
(A) 1
(B) 2
(C) 3
(D) 4asked in Computer Science And Engineering, 2007
View Comments [0 Reply]
-
260.
Consider the following program segment. Here R1, R2 and R3 are the general purpose registers.
Assume that the content of memory location 3000 is 10 and the content of the register R3 is 2000. The content of each of the memory locations from 2000 to 2010 is 100. The program is loaded from the memory location 1000. All the numbers are in decimal.
[1] Assume that the memory is word addressable. The number of memory references for accessing the data in executing the program completely is: [2 marks]
(A) 10
(B) 11
(C) 20
(D) 21[2] Assume that the memory is word addressable. After the execution of this program, the content of memory location 2010 is: [2 marks]
(A) 100
(B) 101
(C) 102
(D) 110[3] Assume that the memory is byte addressable and the word size is 32 bits. If an interrupt occurs during the execution of the instruction “INC R3”, what return address will be pushed on to the stack? [2 marks]
(A) 1005
(B) 1020
(C) 1024
(D) 1040asked in Computer Science And Engineering, 2007
View Comments [0 Reply]
-
261.
Match the following:
[2 marks](P) SMTP (1) Application layer (Q) BGP (2) Transport layer (R) TCP (3) Data link layer (S) PPP (4) Network layer (5) Physical layer
(A) P - 2, Q - 1, R - 3, S - 5
(B) P - 1, Q - 4, R - 2, S - 3
(C) P - 1, Q - 4, R - 2, S - 5
(D) P - 2, Q - 4, R - 1, S - 3
asked in Computer Science And Engineering, 2007
View Comments [0 Reply]
-
262.
-
263.
-
264.
