GATE Question Bank » IT » THEORY OF COMPUTATION


 
A) Finite memory
B) Read only head
C) Finite control
D) All the above (a), (b) and (c)

 
A) Pattern matching
B) Sequential circuit design
C) Compiler design
D) All (a), (b), and (c)

 
A) Table
B) Two – dimensional array
C) Graph
D) All (a), (b) and (c)

 
A) String recognition
B) Arithmetic operations
C) Both (a) and (b)
D) None of these

 
A) A FA can t determine the midpoint of a palindrome
B) A FA can t remember its previous input
C) A FA head has read only capability and can t move in both directions
D) a and b

Pages  1  2 3 4 5

 

facebook
twitter
google plus
linkedin
pinterest

Enter your E-Mail to receive updates