gate automata question

Set-15 TOC GATE 2006

TOC |Gate-2007| Previous Year Questions| Set-14

TOC |Gate-2007| Theory of Computation ( Automata) Which of the following problems is undecidable?  [GATE – 2007] a. Membership problem for CFGs.b. Ambiguity problem for CFGs.c. Finiteness problem for FSAs.d. Equivalence problem for FSAs. Answer : b) Which of the following is TRUE?  [GATE – 2007] a. Every subset of a regular set is regular.b. …

TOC |Gate-2007| Previous Year Questions| Set-14 Read More »

Set-15 TOC GATE 2006

TOC |Gate-2008| Previous Year Questions| Set-13

TOC |Gate-2008| Theory of Computation ( Automata) Which of the following is true for the language {ap|p is a prime} ?  [GATE – 2008] a. It is not accepted by a Turing Machineb. It is regular but not context-freec. It is context-free but not regulard. It is neither regular nor context-free, but accepted by a Turing machine Answer …

TOC |Gate-2008| Previous Year Questions| Set-13 Read More »

Set-15 GATE-2006 DBMS

DBMS |Gate-2006| Previous Year Questions| Set-15

DBMS |Gate-2006| Database Management System 1. Consider the following log sequence of two transactions on a bank account, with initial balance 12000, that transfer 2000 to a mortgage payment and then apply a 5% interest. Suppose the database system crashes just before log record 7 is written. When the system is restarted, which one statement …

DBMS |Gate-2006| Previous Year Questions| Set-15 Read More »

Set-15 GATE-2006 DBMS

DBMS |Gate-2007| Previous Year Questions| Set-14

DBMS |Gate-2007| Database Management System 1. Consider the following relation schemas : i. b-Schema = (b-name, b-city, assets)ii. a-Schema = (a-num, b-name, bal)iii. d-Schema = (c-name, a-number) Let branch, account and depositor be respectively instances of the above schemas. Assume that account and depositor relations are much bigger than the branch relation. Consider the following …

DBMS |Gate-2007| Previous Year Questions| Set-14 Read More »