WEB TECHNOLOGIES

Code No: 05311202 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
WEB TECHNOLOGIES
Objective Exam
Marks: 20.
I Choose the correct alternative:
1) Serve lets are __________ programming [ ]
A) Service side B) client side
C) Service & client side D)network side
2) During application scope the bean will get stored to ____________ [ ]

A) servlet B) servlet contest

B) servlet content D) servlet bean

3) Which is not a JDBC driver type? [ ]

A) JDBC – ODBC bridge B) Partial java driver

B) Pure java driver for direct access to DB D)JDBC – ODBC

4) getWriter() method is used to obtain_________ [ ]
A) The input stream B) The out put stream
C) both a& b D) None
5) MVC model is to separate out design logic into _______ [ ]
A) Modeling B) Viewing
C) Controlling D) all of the above
6) The Tomcat is a serve let that contains the _____________________ [ ]
A) Class libraries B) Documentation
C) Runtime support D) all of the above
7) used to _____________ [ ]
A) Set the value of action attribute B) Generated the XML elements dynamically
C) Set the body element D) Get the property value of the java bean
8) What is the job of controller? [ ]
A) Controls the all inputs B) Controls the output
C) Takes the user input and passes it to the model D) None
9) doget ( ) method does___________________ [ ]
A) HTTP request B) HTTP response
C) HTTP request & response D) HTTP request & response as parameter
10) default port number for JSP page is __________________ [ ]
A) 80 B) 8080 C) 8081 D) 8082
Cont….(2)

A
Code No: 05311202 : 2 : Set No. 1
II Fill in the Blanks:
11) JSTL stands ___________________________
12) The syntax of directive is _____________________
13) Polled connection is use to _____________________________________________
14) The session tracking is ___________ .
15) XAConnection interface is useful for ________________________
16) TLD stands for _____________________________
17) _________________ is use to simplify the view components.
18) Cookie is _____________________________________.
19) Application scope is used to counting __________________________of each object
20) Servlets are ________________________ .
-o0o-
Code No: 05311202 Set No. 2
I Choose the correct alternative:
1) getWriter() method is used to obtain_________ [ ]
A) The input stream B) The out put stream
C) both a& b D) None
2) MVC model is to separate out design logic into _______ [ ]
A) Modeling B) Viewing
C) Controlling D) all of the above
3) The Tomcat is a serve let that contains the _____________________ [ ]
A) Class libraries B) Documentation
C) Runtime support D) all of the above
4) used to _____________ [ ]
A) Set the value of action attribute B) Generated the XML elements dynamically
C) Set the body element D) Get the property value of the java bean
5) What is the job of controller? [ ]
A) Controls the all inputs B) Controls the output
C) Takes the user input and passes it to the model D) None
6) doget ( ) method does___________________ [ ]
A) HTTP request B) HTTP response
C) HTTP request & response D) HTTP request & response as parameter
7) default port number for JSP page is __________________ [ ]
A) 80 B) 8080 C) 8081 D) 8082
8) Serve lets are __________ programming [ ]
A) Service side B) client side
C) Service & client side D)network side
9) During application scope the bean will get stored to ____________ [ ]

A) servlet B) servlet contest

C) servlet content D) servlet bean

10) Which is not a JDBC driver type? [ ]

A) JDBC – ODBC bridge B) Partial java driver

C) Pure java driver for direct access to DB D)JDBC – ODBC
Cont….(2)

A
Code No: 05311202 : 2 : Set No. 2
II Fill in the Blanks:
11) The session tracking is ___________ .
12) XAConnection interface is useful for ________________________
13) TLD stands for _____________________________
14) _________________ is use to simplify the view components.
15) Cookie is _____________________________________.
16) Application scope is used to counting __________________________of each object
17) Servlets are ________________________ .
18) JSTL stands ___________________________
19) The syntax of directive is _____________________
20) Polled connection is use to _____________________________________________
-o0o-
Code No: 05311202 Set No. 3
I. Choose the correct alternative:
1) The Tomcat is a serve let that contains the _____________________ [ ]
A) Class libraries B) Documentation
C) Runtime support D) all of the above
2) used to _____________ [ ]
A) Set the value of action attribute B) Generated the XML elements dynamically
C) Set the body element D) Get the property value of the java bean
3) What is the job of controller? [ ]
A) Controls the all inputs B) Controls the output
C) Takes the user input and passes it to the model D) None
4) doget ( ) method does___________________ [ ]
A) HTTP request B) HTTP response
C) HTTP request & response D) HTTP request & response as parameter
5) default port number for JSP page is __________________ [ ]
A) 80 B) 8080 C) 8081 D) 8082
6) Serve lets are __________ programming [ ]
A) Service side B) client side
C) Service & client side D)network side
7) During application scope the bean will get stored to ____________ [ ]
A) servlet B) servlet contest
C) servlet content D) servlet bean
8) Which is not a JDBC driver type? [ ]

B) JDBC – ODBC bridge B) Partial java driver

C) Pure java driver for direct access to DB D)JDBC – ODBC

9) getWriter() method is used to obtain_________ [ ]
A) The input stream B) The out put stream
C) both a& b D) None
10) MVC model is to separate out design logic into _______ [ ]
A) Modeling B) Viewing C) Controlling D) all of the above
Cont….(2)

A
Code No: 05311202 : 2 : Set No. 3
II Fill in the Blanks:
11) TLD stands for _____________________________
12) _________________ is use to simplify the view components.
13) Cookie is _____________________________________.
14) Application scope is used to counting __________________________of each object
15) Servlets are ________________________ .
16) JSTL stands ___________________________
17) The syntax of directive is _____________________
18) Polled connection is use to _____________________________________________
19) The session tracking is ___________ .
20) XAConnection interface is useful for ________________________
-o0o-
Code No: 05311202 Set No. 4
I Choose the correct alternative:
1) What is the job of controller? [ ]
A) Controls the all inputs B) Controls the output
C) Takes the user input and passes it to the model D) None
2) doget ( ) method does___________________ [ ]
A) HTTP request B) HTTP response
C) HTTP request & response D) HTTP request & response as parameter
3) default port number for JSP page is __________________ [ ]
A) 80 B) 8080 C) 8081 D) 8082
4) Serve lets are __________ programming [ ]
A) Service side B) client side
C) Service & client side D)network side
5) During application scope the bean will get stored to ____________ [ ]

B) servlet B) servlet contest

C) servlet content D) servlet bean

6) Which is not a JDBC driver type? [ ]

D) JDBC – ODBC bridge B) Partial java driver

E) Pure java driver for direct access to DB D)JDBC – ODBC

7) getWriter() method is used to obtain_________ [ ]
A) The input stream B) The out put stream
C) both a& b D) None
8) MVC model is to separate out design logic into _______ [ ]
A) Modeling B) Viewing
C) Controlling D) all of the above
9) The Tomcat is a serve let that contains the _____________________ [ ]
A) Class libraries B) Documentation
C) Runtime support D) all of the above
10) used to _____________ [ ]
A) Set the value of action attribute B) Generated the XML elements dynamically
C) Set the body element D) Get the property value of the java bean
Cont….(2)

A
Code No: 05311202 : 2 : Set No. 4
II Fill in the Blanks:
11) Cookie is _____________________________________.
12) Application scope is used to counting __________________________of each object
13) Servlets are ________________________ .
14) JSTL stands ___________________________
15) The syntax of directive is _____________________
16) Polled connection is use to _____________________________________________
17) The session tracking is ___________ .
18) XAConnection interface is useful for ________________________
19) TLD stands for _____________________________
20) _________________ is use to simplify the view components.
-o0o-

OOPS THROUGH JAVA

Code No: 05210301 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct / Nov. – 2009
OOPS THROUGH JAVA
Objective Exam
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. Which is a checked Runtime Exception? [ ]
A. NullPointerException B. InterruptedException
C. ArithematicException D. ArrayIndexOutOfBoundsException
2. Which of the following method is not defined by MouseListener Interface. [ ]
A. mouseClicked B. mouseDragged C. mouseReleased D. mouseExited
3. Which of the following layout is used as default layout manager? [ ]
A. BorderLayout B. CardLayout C. FlowLayout D. GridLayout
4. The following method is called when we leave a web page that contains an applet [ ]
A. pause( ) B. stop( ) C. destroy( ) D. hide( )
5. Which of the following method doesn’t belong to Thread. [ ]
A. isAlive B. join C. sleep D. wake
6. Which event is generated when a scrollbar is manipulated? [ ]
A. Item Event B. Adjustment Event C. Check Event D. Text Event
7. Which block following will execute whether or not an exception is thrown? [ ]
A. Try B. Catch C. Throw D. Finally
8. Which of the following is the class not used networking. [ ]
A. DatagramPacket B. DatagramSocket C. InetAddress D. HTTPAddress
9. Which of the following is the valid priority we can use for thread? [ ]
A. MIN_PRIORITY B. MINIMUM_PRIORITY
C. LOW_PRIORITY D. ZERO_PRIORITY
10. Which listener interface is needed in handling TextField? [ ]
A. ActionListener B. ItemListener C. TextListener D. InputListener
Cont…2

A
Code No: 05210301 :2: Set No. 1
II. Fill in the blanks:
11. _____ is used to connect Java’s I/O system to other programs.
12. The ________ allows us to pass parameters to the Applet through HTML page.
13. TCP/IP is used to implement _______ connection.
14. The class EventObject is defined in ________ package.
15. The _________ function can be used to find IP address of the host machine.
16. The fundamental class of Java swing JApplet extends _________ class.
17. BorderLayout manager divides window in to _____ areas.
18. A try block may have _______ number of catch block(s).
19. To select or to change the font we have to use _______ method.
20. At the top of the AWT hierarchy is the ___________ class.
-oOo-
Code No: 05210301 Set No. 2
I. Choose the correct alternative:
1. The following method is called when we leave a web page that contains an applet [ ]
A. pause( ) B. stop( ) C. destroy( ) D. hide( )
2. Which of the following method doesn’t belong to Thread. [ ]
A. isAlive B. join C. sleep D. wake
3. Which event is generated when a scrollbar is manipulated? [ ]
A. Item Event B. Adjustment Event C. Check Event D. Text Event
4. Which block following will execute whether or not an exception is thrown? [ ]
A. Try B. Catch C. Throw D. Finally
5. Which of the following is the class not used networking. [ ]
A. DatagramPacket B. DatagramSocket C. InetAddress D. HTTPAddress
6. Which of the following is the valid priority we can use for thread? [ ]
A. MIN_PRIORITY B. MINIMUM_PRIORITY
C. LOW_PRIORITY D. ZERO_PRIORITY
7. Which listener interface is needed in handling TextField? [ ]
A. ActionListener B. ItemListener C. TextListener D. InputListener
8. Which is a checked Runtime Exception? [ ]
A. NullPointerException B. InterruptedException
C. ArithematicException D. ArrayIndexOutOfBoundsException
9. Which of the following method is not defined by MouseListener Interface. [ ]
A. mouseClicked B. mouseDragged C. mouseReleased D. mouseExited
10. Which of the following layout is used as default layout manager? [ ]
A. BorderLayout B. CardLayout C. FlowLayout D. GridLayout
Cont…2

A
Code No: 05210301 :2: Set No. 2
II. Fill in the blanks:
11. The class EventObject is defined in ________ package.
12. The _________ function can be used to find IP address of the host machine.
13. The fundamental class of Java swing JApplet extends _________ class.
14. BorderLayout manager divides window in to _____ areas.
15. A try block may have _______ number of catch block(s).
16. To select or to change the font we have to use _______ method.
17. At the top of the AWT hierarchy is the ___________ class.
18. _____ is used to connect Java’s I/O system to other programs.
19. The ________ allows us to pass parameters to the Applet through HTML page.
20. TCP/IP is used to implement _______ connection.
-oOo-
Code No: 05210301 Set No. 3
OOPS THROUGH JAVA
Objective Exam
. I. Choose the correct alternative:
1. Which event is generated when a scrollbar is manipulated? [ ]
A. Item Event B. Adjustment Event C. Check Event D. Text Event
2. Which block following will execute whether or not an exception is thrown? [ ]
A. Try B. Catch C. Throw D. Finally
3. Which of the following is the class not used networking. [ ]
A. DatagramPacket B. DatagramSocket C. InetAddress D. HTTPAddress
4. Which of the following is the valid priority we can use for thread? [ ]
A. MIN_PRIORITY B. MINIMUM_PRIORITY
C. LOW_PRIORITY D. ZERO_PRIORITY
5. Which listener interface is needed in handling TextField? [ ]
A. ActionListener B. ItemListener C. TextListener D. InputListener
6. Which is a checked Runtime Exception? [ ]
A. NullPointerException B. InterruptedException
C. ArithematicException D. ArrayIndexOutOfBoundsException
7. Which of the following method is not defined by MouseListener Interface. [ ]
A. mouseClicked B. mouseDragged C. mouseReleased D. mouseExited
8. Which of the following layout is used as default layout manager? [ ]
A. BorderLayout B. CardLayout C. FlowLayout D. GridLayout
9. The following method is called when we leave a web page that contains an applet [ ]
A. pause( ) B. stop( ) C. destroy( ) D. hide( )
10. Which of the following method doesn’t belong to Thread. [ ]
A. isAlive B. join C. sleep D. wake
Cont…2

A
Code No: 05210301 :2: Set No. 3
II. Fill in the blanks:
11. The fundamental class of Java swing JApplet extends _________ class.
12. BorderLayout manager divides window in to _____ areas.
13. A try block may have _______ number of catch block(s).
14. To select or to change the font we have to use _______ method.
15. At the top of the AWT hierarchy is the ___________ class.
16. _____ is used to connect Java’s I/O system to other programs.
17. The ________ allows us to pass parameters to the Applet through HTML page.
18. TCP/IP is used to implement _______ connection.
19. The class EventObject is defined in ________ package.
20. The _________ function can be used to find IP address of the host machine.
-oOo-
Code No: 05210301 Set No. 4

OOPS THROUGH JAVA
I. Choose the correct alternative:
1. Which of the following is the class not used networking. [ ]
A. DatagramPacket B. DatagramSocket C. InetAddress D. HTTPAddress
2. Which of the following is the valid priority we can use for thread? [ ]
A. MIN_PRIORITY B. MINIMUM_PRIORITY
C. LOW_PRIORITY D. ZERO_PRIORITY
3. Which listener interface is needed in handling TextField? [ ]
A. ActionListener B. ItemListener C. TextListener D. InputListener
4. Which is a checked Runtime Exception? [ ]
A. NullPointerException B. InterruptedException
C. ArithematicException D. ArrayIndexOutOfBoundsException
5. Which of the following method is not defined by MouseListener Interface. [ ]
A. mouseClicked B. mouseDragged C. mouseReleased D. mouseExited
6. Which of the following layout is used as default layout manager? [ ]
A. BorderLayout B. CardLayout C. FlowLayout D. GridLayout
7. The following method is called when we leave a web page that contains an applet [ ]
A. pause( ) B. stop( ) C. destroy( ) D. hide( )
8. Which of the following method doesn’t belong to Thread. [ ]
A. isAlive B. join C. sleep D. wake
9. Which event is generated when a scrollbar is manipulated? [ ]
A. Item Event B. Adjustment Event C. Check Event D. Text Event
10. Which block following will execute whether or not an exception is thrown? [ ]
A. Try B. Catch C. Throw D. Finally
Cont…2

A
Code No: 05210301 :2: Set No. 4
II. Fill in the blanks:
11. A try block may have _______ number of catch block(s).
12. To select or to change the font we have to use _______ method.
13. At the top of the AWT hierarchy is the ___________ class.
14. _____ is used to connect Java’s I/O system to other programs.
15. The ________ allows us to pass parameters to the Applet through HTML page.
16. TCP/IP is used to implement _______ connection.
17. The class EventObject is defined in ________ package.
18. The _________ function can be used to find IP address of the host machine.
19. The fundamental class of Java swing JApplet extends _________ class.
20. BorderLayout manager divides window in to _____ areas.
-oOo-

DISTRIBUTED DATABASES ONLINE BITS

Code No: 05411203 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DISTRIBUTED DATABASES
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
2. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
3. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
4. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
5. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
6. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
7. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
8. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
9. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
10. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
Cont..2

A
: 2 :
Code No: 05411203 Set No. 1
II. Fill in the blanks:
11. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
12. OMG stands for____________
13. The set of data items written by Transaction Ti are called_______
14. The protocols which use a weighted majority are called ________ protocols.
15. IS and IX locks are available in _______________ Locking Technique
16. The task of mapping from one schema to another is called _____
17. Determination of structural and semantic problems of each component Database is called ________
18. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called__________ rule
19. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called_______.
20. In query processing, that site receives the query and performs the splitting is called __________
-o0o-
Code No: 05411203 Set No. 2
DISTRIBUTED DATABASES
Objective Exam
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
2. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
3. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
4. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
5. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
6. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
7. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
8. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
9. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
10. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
Cont..2

A
: 2 :
Code No: 05411203 Set No. 2
II. Fill in the blanks:
11. The protocols which use a weighted majority are called ________ protocols.
12. IS and IX locks are available in _______________ Locking Technique
13. The task of mapping from one schema to another is called _____
14. Determination of structural and semantic problems of each component Database is called ________
15. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called __________ rule
16. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called _______.
17. In query processing, that site receives the query and performs the splitting is called __________
18. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
19. OMG stands for ____________
20. The set of data items written by Transaction Ti are called _______
-o0o-
Code No: 05411203 Set No. 3
DISTRIBUTED DATABASES
I. Choose the correct alternative:
1. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
2. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
3. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
4. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
5. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
6. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
7. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
8. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
9. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
10. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
Cont..2

A
: 2 :
Code No: 05411203 Set No. 3
II. Fill in the blanks:
11. The task of mapping from one schema to another is called _____
12. Determination of structural and semantic problems of each component Database is called ________
13. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called __________ rule
14. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called _______.
15. In query processing, that site receives the query and performs the splitting is called __________
16. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
17. OMG stands for ____________
18. The set of data items written by Transaction Ti are called _______
19. The protocols which use a weighted majority are called ________ protocols.
20. IS and IX locks are available in _______________ Locking Technique
-o0o-
Code No: 05411203 Set No. 4
DISTRIBUTED DATABASES
Objective Exam
Marks: 20.
I. Choose the correct alternative:
1. In OMA objects communicate with each other via [ ]
a) ORG b) COM c) DCOM d) OMG
2. Distributed deadlock cycles can be detected using [ ]
a) DWFG b) LWFG c) WFG d) RAG
3. The availability and reliability of the system will be increased with [ ]
a) Redundancy b) Duplication c) Transparency d) scalability
4. In client/Server architecture the object manager resides at [ ]
a) Server b) Client c) Both client and server d) at central location
5. __________Algorithms prevent the access of stale cache data by ensuring that clients cannot update an object it is being read by other clients. [ ]
a) Avoidance based b) Detection Based c) Both 1 and 2 d) None
6. Schema Integration is the process of [ ]
a) Identifying Components b) Selecting Global Schema
c) Integrating Components d) All
7. The information describing how mapping from/to participating schemas and global schemas are stored in [ ]
a) Local Database b) Global Database
c) Global Directory d) Auxiliary Database
8. Two operations are in _________ if they operate on same data item, one of tem is a write operation
and they are issued by different transactions. [ ]
a) Serializable b) Schedule c) Conflict d) Non-conflict
9. A commitment protocol is called _______ if the occurrence of some kind of failures forces some of the participating sites to wait until the failure is repaired before terminating the transaction.[ ]
a) Non-Blocking b) Blocking c) Aborted d) committed
10. LOID to POID mapping information is usually stored in. [ ]
a) stacks b) Hash tables c) B+ trees d) Hash tables or B+-tree
Cont..2

A
: 2 :
Code No: 05411203 Set No. 4
II. Fill in the blanks:
11. If the timestamp of a write operation Wi(x) is smaller than WTM(x) of the data item x, it is possible to ignore the operation, instead of rejecting the operation is called__________ rule
12. ‘N’ processors which are capable of exchanging messages must agree on the value of a message is sent by one of them to all the others is called_______.
13. In query processing, that site receives the query and performs the splitting is called __________
14. An operation ‘P’ is said to be ___________________ with respect to operation ‘Q’ if the value returned by ‘P’ is independent of whether ‘Q’ executed before ‘P’ or not.
15. OMG stands for____________
16. The set of data items written by Transaction Ti are called_______
17. The protocols which use a weighted majority are called ________ protocols.
18. IS and IX locks are available in _______________ Locking Technique
19. The task of mapping from one schema to another is called _____
20. Determination of structural and semantic problems of each component Database is called ________
-o0o-

DATAWAREHOUSING AND DATA MINING ONLINE BITS

Code No: 05321203 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DATA WAREHOUSING & DATA MINING
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
A
I. Choose the correct alternative:
1. Which step in Apriori algorithm uses apriori property? [ ]
(a) join step (b) prune step (c) candidate generation step (d) query processing
2. Which technique can be used to reduce the size of the candidate k-itemsets in Apriori algorithm?
[ ]
a) pruning (b) cleaning (c) hash based (d) partitioning
3. Classification belongs to which type of learning? [ ]
(a) supervised (b) unsupervised (c) rote (d) machine
4. What kind of attributes does log linear model require? [ ]
(a) categorical (b) continuous (c) binary (d) ordinal
5. Which among the following is a accuracy measure of classifier? [ ]
(a) support (b) confidence (c) specificity (d) recall
6. Which algorithm mines frequent itemsets without candidate generation? [ ]
a) apriori b) FP tree c) FP growth d) maxpattern
7. What kind of analysis is used to access the impact of an input variable on a network output?[ ]
(a) component analysis (b) sensitivity analysis (c) output analysis (d) jackknife analysis
8. Which of the following is a lazy learner for classification? [ ]
(a) nearest neighbor (b) back propagation
(c) decision tree induction (d) genetic algorithm
9. Which is not an accuracy measure for classifier? [ ]
(a) sensitivity (b) precision (c) specificity (d) recall
10. In a term frequency matrix, what does each column represent? [ ]
a) term b) document vector c) number of term occurences d) words
Cont…2
Code No: 05321203 -2- Set No. 1
II. Fill in the blanks:
11. Association rules are considered interesting if they satisfy both______ & ______ thresholds.
12. If a rule concerns associations between the presence or absence of items, it is ______ rule.
13. Apriori can be applied to improve the efficiency of answering ____ queries.
14. FP growth algorithm adopts_________ strategy of algorithm design process.
15. ______ variables are continuous measurements of a roughly linear scale.
16. A typical example of association rule mining is _______.
17. _________ is a frequent patterns whose proper super pattern is not frequent.
18. Manhattan distance is defined as d(i, j) = _________.
19. An interesting mining optimization method can be adopted in spatial association analysis. This method is called as____________.
20. _________ is the percentage of retrieved documents that are infact relevant to the query.
-oOo-
Code No: 05321203 Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DATA WAREHOUSING & DATA MINING
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
A
I. Choose the correct alternative:
1. What kind of attributes does log linear model require? [ ]
(a) categorical (b) continuous (c) binary (d) ordinal
2. Which among the following is a accuracy measure of classifier? [ ]
(a) support (b) confidence (c) specificity (d) recall
3. Which algorithm mines frequent itemsets without candidate generation? [ ]
a) apriori b) FP tree c) FP growth d) maxpattern
4. What kind of analysis is used to access the impact of an input variable on a network output?[ ]
(a) component analysis (b) sensitivity analysis (c) output analysis (d) jackknife analysis
5. Which of the following is a lazy learner for classification? [ ]
(a) nearest neighbor (b) back propagation
(c) decision tree induction (d) genetic algorithm
6. Which is not an accuracy measure for classifier? [ ]
(a) sensitivity (b) precision (c) specificity (d) recall
7. In a term frequency matrix, what does each column represent? [ ]
a) term b) document vector c) number of term occurences d) words
8. Which step in Apriori algorithm uses apriori property? [ ]
(a) join step (b) prune step (c) candidate generation step (d) query processing
9. Which technique can be used to reduce the size of the candidate k-itemsets in Apriori algorithm?
[ ]
a) pruning (b) cleaning (c) hash based (d) partitioning
10. Classification belongs to which type of learning? [ ]
(a) supervised (b) unsupervised (c) rote (d) machine
Cont…2
Code No: 05321203 -2- Set No. 2
II. Fill in the blanks:
11. FP growth algorithm adopts_________ strategy of algorithm design process.
12. ______ variables are continuous measurements of a roughly linear scale.
13. A typical example of association rule mining is _______.
14. _________ is a frequent patterns whose proper super pattern is not frequent.
15. Manhattan distance is defined as d(i, j) = _________.
16. An interesting mining optimization method can be adopted in spatial association analysis. This method is called as____________.
17. _________ is the percentage of retrieved documents that are infact relevant to the query.
18. Association rules are considered interesting if they satisfy both______ & ______ thresholds.
19. If a rule concerns associations between the presence or absence of items, it is ______ rule.
20. Apriori can be applied to improve the efficiency of answering ____ queries.
-oOo-
Code No: 05321203 Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DATA WAREHOUSING & DATA MINING
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
A
I. Choose the correct alternative:
1. Which algorithm mines frequent itemsets without candidate generation? [ ]
a) apriori b) FP tree c) FP growth d) maxpattern
2. What kind of analysis is used to access the impact of an input variable on a network output?[ ]
(a) component analysis (b) sensitivity analysis (c) output analysis (d) jackknife analysis
3. Which of the following is a lazy learner for classification? [ ]
(a) nearest neighbor (b) back propagation
(c) decision tree induction (d) genetic algorithm
4. Which is not an accuracy measure for classifier? [ ]
(a) sensitivity (b) precision (c) specificity (d) recall
5. In a term frequency matrix, what does each column represent? [ ]
a) term b) document vector c) number of term occurences d) words
6. Which step in Apriori algorithm uses apriori property? [ ]
(a) join step (b) prune step (c) candidate generation step (d) query processing
7. Which technique can be used to reduce the size of the candidate k-itemsets in Apriori algorithm?
[ ]
a) pruning (b) cleaning (c) hash based (d) partitioning
8. Classification belongs to which type of learning? [ ]
(a) supervised (b) unsupervised (c) rote (d) machine
9. What kind of attributes does log linear model require? [ ]
(a) categorical (b) continuous (c) binary (d) ordinal
10. Which among the following is a accuracy measure of classifier? [ ]
(a) support (b) confidence (c) specificity (d) recall
Cont…2
Code No: 05321203 -2- Set No. 3
II. Fill in the blanks:
11. A typical example of association rule mining is _______.
12. _________ is a frequent patterns whose proper super pattern is not frequent.
13. Manhattan distance is defined as d(i, j) = _________.
14. An interesting mining optimization method can be adopted in spatial association analysis. This method is called as____________.
15. _________ is the percentage of retrieved documents that are infact relevant to the query.
16. Association rules are considered interesting if they satisfy both______ & ______ thresholds.
17. If a rule concerns associations between the presence or absence of items, it is ______ rule.
18. Apriori can be applied to improve the efficiency of answering ____ queries.
19. FP growth algorithm adopts_________ strategy of algorithm design process.
20. ______ variables are continuous measurements of a roughly linear scale.
-oOo-
Code No: 05321203 Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
IV B.Tech. I Sem., II Mid-Term Examinations, Oct./Nov. – 2009
DATA WAREHOUSING & DATA MINING
Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks.Time: 20 Min. Marks: 20.
A
I. Choose the correct alternative:
1. Which of the following is a lazy learner for classification? [ ]
(a) nearest neighbor (b) back propagation
(c) decision tree induction (d) genetic algorithm
2. Which is not an accuracy measure for classifier? [ ]
(a) sensitivity (b) precision (c) specificity (d) recall
3. In a term frequency matrix, what does each column represent? [ ]
a) term b) document vector c) number of term occurences d) words
4. Which step in Apriori algorithm uses apriori property? [ ]
(a) join step (b) prune step (c) candidate generation step (d) query processing
5. Which technique can be used to reduce the size of the candidate k-itemsets in Apriori algorithm?
[ ]
a) pruning (b) cleaning (c) hash based (d) partitioning
6. Classification belongs to which type of learning? [ ]
(a) supervised (b) unsupervised (c) rote (d) machine
7. What kind of attributes does log linear model require? [ ]
(a) categorical (b) continuous (c) binary (d) ordinal
8. Which among the following is a accuracy measure of classifier? [ ]
(a) support (b) confidence (c) specificity (d) recall
9. Which algorithm mines frequent itemsets without candidate generation? [ ]
a) apriori b) FP tree c) FP growth d) maxpattern
10. What kind of analysis is used to access the impact of an input variable on a network output?[ ]
(a) component analysis (b) sensitivity analysis (c) output analysis (d) jackknife analysis
Cont…2
Code No: 05321203 -2- Set No. 4
II. Fill in the blanks:
11. Manhattan distance is defined as d(i, j) = _________.
12. An interesting mining optimization method can be adopted in spatial association analysis. This method is called as____________.
13. _________ is the percentage of retrieved documents that are infact relevant to the query.
14. Association rules are considered interesting if they satisfy both______ & ______ thresholds.
15. If a rule concerns associations between the presence or absence of items, it is ______ rule.
16. Apriori can be applied to improve the efficiency of answering ____ queries.
17. FP growth algorithm adopts_________ strategy of algorithm design process.
18. ______ variables are continuous measurements of a roughly linear scale.
19. A typical example of association rule mining is _______.
20. _________ is a frequent patterns whose proper super pattern is not frequent.
-oOo-

DBMS ONLINE BITS

Code No: 07A5EC15 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
DATA BASE MANAGEMENT SYSTEMS Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:

1. First normal form states that [ ]

a) Primary key fields should contain only atomic values.

b) Non-key fields should contain only atomic values.

c) Every field should contain only atomic values.

d) All the above.

2. Fan-out of the tree is [ ]

a) The average number of children of a root node.

b) The average number of children of a non leaf node.

c) The average number of children of a leaf node.

d) The average number of children of all node.

3. The transaction identifier field of an update log record is. [ ]

a) The unique identifier of the transaction that performed write operation.

b) The unique identifier of the data item written.

c) The value of the data item prior to the write.

d) All the above.

4. In hash based indexing, a bucket consists of [ ]

a) A primary page. b) Pages linked in chain

c) Both a& b d)None.


5. When a file is organized so that the ordering of data records is same as or close to the ordering of data entries in same index, then the index is [ ]

a) Unclustered. b) Clustered. c) Both a & b. d) None.


6. Shadow paging technique maintains the following tables for crash-recovery [ ]

a) Page table & shadow page table.

b) Current page table & shadow page table.

c) Shadow page table.

d) Page table, shadow page table &Current page table.

7. Define page I/O [ ]

a) Input from disk to main memory.

b) Input from main memory to disk.

c) Output from disk to main memory and Input from main memory to disk

d) Input from disk to main memory and Output from main memory to disk.


Cont……[2]


A
[2]
Code No: 07A5EC15 Set No. 1

8. In hash based indexing, a hash function applied to the search key is used to find [ ]

a) Bucket number. b)Primary page. c) Record. d) A page.

9. A primary index is [ ]

a) An index on a set of fields that includes the Candidate Key.

b) An index on a set of fields that excludes the Candidate key.

c) An index on a set of fields that includes the Primary key.

d) An index on a set of fields that excludes all the key attributes.

10. For a FD X->Y, if some attribute A€X can be removed from X and the dependency still holds then it is
[ ]
a) Full Functional Dependency. b) Trivial FD. c) Partial FD. d) Multivalued FD.
II. Fill in the Blanks:

11. If every non prime attribute A in R is fully functionally dependent on the primary key attribute of R, then R is said to be in _________________


12. If X->Y is an FD and there exists a set of attributes Z that is neither a key nor a subset of any key of R and both X->Y and Z->y hold, then it is ____________


13. The unit of information read from or written to disk is_____________

14. In tree-based Indexing, the actual data is stored at _________________

15. Properties of a transaction are ______________, ______________, ___________, Durability.

16. After the transaction has been rolled back and the Database has been restored to its state prior to the start of the transaction is the _____________ state of a transaction.


17. In __________________ mode a transaction Ti on an item Q, can read, but cannot write Q.

18. The Log is a sequence of ____________, recording all the update activities in the Database.

19. ______________ is a checkpoint where transactions are allowed to perform updates even while buffer blocks are being written out.


20. A data structure that organizes data records on disk to optimize certain kinds of retrieval operation is __________________.

-oOo-
Code No: 07A5EC15 Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
DATA BASE MANAGEMENT SYSTEMS Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In hash based indexing, a bucket consists of [ ]
a. A primary page. b. Pages linked in chain c. Both a& b d. None.
2. When a file is organized so that the ordering of data records is same as or close to the ordering of data
entries in same index, then the index is [ ]

a. Unclustered. b. Clustered. c. Both a & b. d.None.

3. Shadow paging technique maintains the following tables for crash-recovery [ ]

a. Page table & shadow page table.

b.Current page table & shadow page table.

c. Shadow page table.

d.Page table, shadow page table &Current page table.

4. Define page I/O [ ]
a. Input from disk to main memory.
b. Input from main memory to disk.
c. Output from disk to main memory and Input from main memory to disk
d .Input from disk to main memory and Output from main memory to disk.
5. In hash based indexing, a hash function applied to the search key is used to find [ ]
a.Bucket number. b.Primary page. c.Record. d.A page.
6. A primary index is [ ]

a. An index on a set of fields that includes the Candidate Key.

b. An index on a set of fields that excludes the Candidate key.

c. An index on a set of fields that includes the Primary key.

d. An index on a set of fields that excludes all the key attributes.

7. For a FD X->Y, if some attribute A€X can be removed from X and the dependency still holds then it is
[ ]
a. Full Functional Dependency. b. Trivial FD. c. Partial FD. d. Multivalued FD.
8. First normal form states that [ ]
a. Primary key fields should contain only atomic values.
b. Non-key fields should contain only atomic values.

c. Every field should contain only atomic values.

d. All the above.

Cont……[2]

A
[2]
Code No: 07A5EC15 Set No. 2
9. Fan-out of the tree is [ ]

a. The average number of children of a root node.

b. The average number of children of a non leaf node.

c. The average number of children of a leaf node.

d. The average number of children of all node.

10. The transaction identifier field of an update log record is. [ ]
a. The unique identifier of the transaction that performed write operation.
b. The unique identifier of the data item written.
c. The value of the data item prior to the write.
b. All the above.
II. Fill in the Blanks:
11. In tree-based Indexing, the actual data is stored at _________________
12. Properties of a transaction are ______________, ______________, ___________, Durability.
13. After the transaction has been rolled back and the Database has been restored to its state prior to the start
of the transaction is the _____________ state of a transaction.
14. In __________________ mode a transaction Ti on an item Q, can read, but cannot write Q.
15. The Log is a sequence of ____________, recording all the update activities in the Database.
16. ______________ is a checkpoint where transactions are allowed to perform updates even while buffer
blocks are being written out.
17. A data structure that organizes data records on disk to optimize certain kinds of retrieval operation is
_________________.
18. If every non prime attribute A in R is fully functionally dependent on the primary key attribute of R, then
R is said to be in _________________
19. If X->Y is an FD and there exists a set of attributes Z that is neither a key nor a subset of any key of R
and both X->Y and Z->y hold, then it is ____________
20. The unit of information read from or written to disk is_____________
-oOo-
Code No: 07A5EC15 Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
DATA BASE MANAGEMENT SYSTEMS Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. When a file is organized so that the ordering of data records is same as or close to the ordering of data
entries in same index, then the index is [ ]

a. Unclustered. b. Clustered. c. Both a & b. d.None.

2. Shadow paging technique maintains the following tables for crash-recovery [ ]

a. Page table & shadow page table.

b. Current page table & shadow page table.

c. Shadow page table.

d. Page table, shadow page table &Current page table.

3. Define page I/O [ ]

a. Input from disk to main memory.

b. Input from main memory to disk.

c. Output from disk to main memory and Input from main memory to disk

d. Input from disk to main memory and Output from main memory to disk.

4. In hash based indexing, a hash function applied to the search key is used to find [ ]

a. Bucket number. b. Primary page. c. Record. d. A page.

5. A primary index is [ ]

a. An index on a set of fields that includes the Candidate Key.

b. An index on a set of fields that excludes the Candidate key.

c. An index on a set of fields that includes the Primary key.

d. An index on a set of fields that excludes all the key attributes.

6. For a FD X->Y, if some attribute A€X can be removed from X and the dependency still holds then it is
[ ]
a. Full Functional Dependency. b. Trivial FD. c. Partial FD. d. Multivalued FD.
7. First normal form states that [ ]
a. Primary key fields should contain only atomic values.
b. Non-key fields should contain only atomic values.
c. Every field should contain only atomic values.
d. All the above.
Cont……[2]

A
[2]
Code No: 07A5EC15 Set No. 3
8. Fan-out of the tree is [ ]

a. The average number of children of a root node.

b. The average number of children of a non leaf node.

c. The average number of children of a leaf node.

d. The average number of children of all node.

9. The transaction identifier field of an update log record is. [ ]
a. The unique identifier of the transaction that performed write operation.
b. The unique identifier of the data item written.
c. The value of the data item prior to the write.
d. All the above.
10. In hash based indexing, a bucket consists of [ ]
a. A primary page. b. Pages linked in chain c. Both a& b d. None.
II. Fill in the Blanks:
11. After the transaction has been rolled back and the Database has been restored to its state prior to the start
of the transaction is the _____________ state of a transaction.
12. In __________________ mode a transaction Ti on an item Q, can read, but cannot write Q.
13. The Log is a sequence of ____________, recording all the update activities in the Database.
14. ______________ is a checkpoint where transactions are allowed to perform updates even while buffer
blocks are being written out.
15. A data structure that organizes data records on disk to optimize certain kinds of retrieval operation is
__________________.
16. If every non prime attribute A in R is fully functionally dependent on the primary key attribute of R, then
R is said to be in _________________
17. If X->Y is an FD and there exists a set of attributes Z that is neither a key nor a subset of any key of R
and both X->Y and Z->y hold, then it is ____________
18. The unit of information read from or written to disk is_____________
19. In tree-based Indexing, the actual data is stored at _________________
20. Properties of a transaction are ______________, ______________, ___________, Durability.
-oOo-
Code No: 07A5EC15 Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
DATA BASE MANAGEMENT SYSTEMS Objective Exam
Name: ______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In hash based indexing, a hash function applied to the search key is used to find [ ]

a. Bucket number. b. Primary page. c. Record. d. A page.

2. A primary index is [ ]

a. An index on a set of fields that includes the Candidate Key.

b. An index on a set of fields that excludes the Candidate key.

c. An index on a set of fields that includes the Primary key.

d. An index on a set of fields that excludes all the key attributes.

3. For a FD X->Y, if some attribute A€X can be removed from X and the dependency still holds then it is
[ ]
a. Full Functional Dependency. b. Trivial FD. c. Partial FD. d. Multivalued FD.
4. First normal form states that [ ]
a. Primary key fields should contain only atomic values.
b. Non-key fields should contain only atomic values.
c. Every field should contain only atomic values.
d. All the above.
5. Fan-out of the tree is [ ]
a. The average number of children of a root node.

b. The average number of children of a non leaf node.

c. The average number of children of a leaf node.

d. The average number of children of all node.

6. The transaction identifier field of an update log record is. [ ]
a. The unique identifier of the transaction that performed write operation.
b. The unique identifier of the data item written.
c. The value of the data item prior to the write.
d. All the above.
7. In hash based indexing, a bucket consists of [ ]
a. A primary page. b. Pages linked in chain c. Both a& b d. None.
8. When a file is organized so that the ordering of data records is same as or close to the ordering of data
entries in same index, then the index is [ ]
a. Unclustered. b. Clustered. c. Both a & b. d.None.
Cont……[2]

A
[2]
Code No: 07A5EC15 Set No. 4
9. Shadow paging technique maintains the following tables for crash-recovery [ ]
a. Page table & shadow page table.
b. Current page table & shadow page table.
c. Shadow page table.
d. Page table, shadow page table &Current page table.
10. Define page I/O [ ]

a. Input from disk to main memory.

b. Input from main memory to disk.

c. Output from disk to main memory and Input from main memory to disk

d. Input from disk to main memory and Output from main memory to disk.

II. Fill in the Blanks:
11. The Log is a sequence of ____________, recording all the update activities in the Database.
12. ______________ is a checkpoint where transactions are allowed to perform updates even while buffer
blocks are being written out.
13. A data structure that organizes data records on disk to optimize certain kinds of retrieval operation is
__________________.
14. If every non prime attribute A in R is fully functionally dependent on the primary key attribute of R, then
R is said to be in _________________
15. If X->Y is an FD and there exists a set of attributes Z that is neither a key nor a subset of any key of R
and both X->Y and Z->y hold, then it is ____________
16. The unit of information read from or written to disk is_____________
17. In tree-based Indexing, the actual data is stored at _________________
18. Properties of a transaction are ______________, ______________, ___________, Durability.
19. After the transaction has been rolled back and the Database has been restored to its state prior to the start
of the transaction is the _____________ state of a transaction.
20. In __________________ mode a transaction Ti on an item Q, can read, but cannot write Q.
-oOo-

automat and compiler design online bits

Code No: 07A5EC20 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
AUTOMATA AND COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1.A sound type system eliminates _____,when the target program runs. [ ]
a)Type errors b)runtime errors c)compile type errors d)none
2. Implicit type conversions, is __________. [ ]
a)Done automatically by the compiler. b) Done automatically by the interpreter
c) Done automatically by the OS d) Done automatically by the language
3.____________ determines the type of a language construct from the way it is used. [ ]
a)Type synthesis b)Type inference c)Type reference d)None
4.A record is a data structure with ____________ [ ]
a)named fields b)fields c)named records d)records
5. Code Motion moves _____________. [ ]
a)Code outside a loop b)Code inside a loop c)Code top of a loop d)Code bottom of a loop.
6.Machine dependent optimization influenced by the _________ [ ]
a)Source machine b)Target machine c)Compiler d)Interpreter
7.An occurrence of an expression E is called a common sub expression if E is ___. [ ]
a)Previously computed and the values of E have not changed
b) Previously computed and the values of E will change
c) After computed and the values of E have not changed
d) After computed and the values of E will change
8. The code generator, produces the target program from the transformed ______. [ ]
a)High level code b)Low level code c) Intermediate code d)All the above
9. The line variable analysis is done by __________. [ ]
a)ud-chains b)du-chains c)computation of in and out d)All the above
10.Which is not an example for function-preserving transformation? [ ]
a)Copy propagation b)Flow of control c)Constant folding d)dead-code elimination
Cont…..[2]
[2]
Code No: 07A5EC20 Set No. 1
II. Fill in the Blanks:
11. Implicit type conversions also called ____________
12. The runtime representation of an object program in the logical address space consists of ___________.
13. The static data objects are created at ___________________.
14. The activations of procedures during the running of an entire program by a tree called _________.
15. The substitution of values for names whose values are constant is known as ______.
16. Activation records are sometimes called ______________.
17. If a transformation of a program performed by locking only at the statements in a basic blocks, called ________________.
18. The code improvement phase consists of _____________ followed by the application of transformation.
19. The replacement of an expressive operation by a cheaper one is called ________.
20. The relative address for a field name is relative to the __________ for that record.
-oOo-
Code No: 07A5EC20 Set No. 2
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
AUTOMATA AND COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. A record is a data structure with ____________ [ ]
a)named fields b)fields c)named records d)records
2. Code Motion moves _____________. [ ]
a)Code outside a loop b)Code inside a loop c)Code top of a loop d)Code bottom of a loop.
3. Machine dependent optimization influenced by the _________ [ ]
a)Source machine b)Target machine c)Compiler d)Interpreter
4. An occurrence of an expression E is called a common sub expression if E is ___. [ ]
a)Previously computed and the values of E have not changed
b) Previously computed and the values of E will change
c) After computed and the values of E have not changed
d) After computed and the values of E will change
5. The code generator, produces the target program from the transformed ______. [ ]
a)High level code b)Low level code c) Intermediate code d)All the above
6. The line variable analysis is done by __________. [ ]
a)ud-chains b)du-chains c)computation of in and out d)All the above
7. Which is not an example for function-preserving transformation? [ ]
a)Copy propagation b)Flow of control c)Constant folding d)dead-code elimination
8. A sound type system eliminates _____,when the target program runs. [ ]
a)Type errors b)runtime errors c)compile type errors d)none
9. Implicit type conversions, is __________. [ ]
a)Done automatically by the compiler. b) Done automatically by the interpreter
c) Done automatically by the OS d) Done automatically by the language
10.____________ determines the type of a language construct from the way it is used. [ ]
a)Type synthesis b)Type inference c)Type reference d)None
Cont…..[2]
[2]
Code No: 07A5EC20 Set No. 2
II. Fill in the Blanks:
11. The activations of procedures during the running of an entire program by a tree called _________.
12. The substitution of values for names whose values are constant is known as ______.
13. Activation records are sometimes called ______________.
14. If a transformation of a program performed by locking only at the statements in a basic blocks, called ________________.
15. The code improvement phase consists of _____________ followed by the application of transformation.
16. The replacement of an expressive operation by a cheaper one is called ________.
17. The relative address for a field name is relative to the __________ for that record.
18. Implicit type conversions also called ____________
19. The runtime representation of an object program in the logical address space consists of ___________.
20. The static data objects are created at ___________________.
-oOo-
Code No: 07A5EC20 Set No. 3
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
AUTOMATA AND COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. Machine dependent optimization influenced by the _________ [ ]
a)Source machine b)Target machine c)Compiler d)Interpreter
2. An occurrence of an expression E is called a common sub expression if E is ___. [ ]
a)Previously computed and the values of E have not changed
b) Previously computed and the values of E will change
c) After computed and the values of E have not changed
d) After computed and the values of E will change
3. The code generator, produces the target program from the transformed ______. [ ]
a)High level code b)Low level code c) Intermediate code d)All the above
4. The line variable analysis is done by __________. [ ]
a)ud-chains b)du-chains c)computation of in and out d)All the above
5. Which is not an example for function-preserving transformation? [ ]
a)Copy propagation b)Flow of control c)Constant folding d)dead-code elimination
6. A sound type system eliminates _____,when the target program runs. [ ]
a)Type errors b)runtime errors c)compile type errors d)none
7. Implicit type conversions, is __________. [ ]
a)Done automatically by the compiler. b) Done automatically by the interpreter
c) Done automatically by the OS d) Done automatically by the language
8.____________ determines the type of a language construct from the way it is used. [ ]
a)Type synthesis b)Type inference c)Type reference d)None
9. A record is a data structure with ____________ [ ]
a)named fields b)fields c)named records d)records
10. Code Motion moves _____________. [ ]
a)Code outside a loop b)Code inside a loop c)Code top of a loop d)Code bottom of a loop.
Cont…..[2]
[2]
Code No: 07A5EC20 Set No. 3
II. Fill in the Blanks:
11. Activation records are sometimes called ______________.
12. If a transformation of a program performed by locking only at the statements in a basic blocks, called ________________.
13. The code improvement phase consists of _____________ followed by the application of transformation.
14. The replacement of an expressive operation by a cheaper one is called ________.
15. The relative address for a field name is relative to the __________ for that record.
16. Implicit type conversions also called ____________
17. The runtime representation of an object program in the logical address space consists of ___________.
18. The static data objects are created at ___________________.
19. The activations of procedures during the running of an entire program by a tree called _________.
20. The substitution of values for names whose values are constant is known as ______.
-oOo-
Code No: 07A5EC20 Set No. 4
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
AUTOMATA AND COMPILER DESIGN
Objective Exam
Name: ______________________________ Hall Ticket No.
A
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. The code generator, produces the target program from the transformed ______. [ ]
a)High level code b)Low level code c) Intermediate code d)All the above
2. The line variable analysis is done by __________. [ ]
a)ud-chains b)du-chains c)computation of in and out d)All the above
3. Which is not an example for function-preserving transformation? [ ]
a)Copy propagation b)Flow of control c)Constant folding d)dead-code elimination
4. A sound type system eliminates _____,when the target program runs. [ ]
a)Type errors b)runtime errors c)compile type errors d)none
5. Implicit type conversions, is __________. [ ]
a)Done automatically by the compiler. b) Done automatically by the interpreter
c) Done automatically by the OS d) Done automatically by the language
6.____________ determines the type of a language construct from the way it is used. [ ]
a)Type synthesis b)Type inference c)Type reference d)None
7. A record is a data structure with ____________ [ ]
a)named fields b)fields c)named records d)records
8. Code Motion moves _____________. [ ]
a)Code outside a loop b)Code inside a loop c)Code top of a loop d)Code bottom of a loop.
9. Machine dependent optimization influenced by the _________ [ ]
a)Source machine b)Target machine c)Compiler d)Interpreter
10. An occurrence of an expression E is called a common sub expression if E is ___. [ ]
a)Previously computed and the values of E have not changed
b) Previously computed and the values of E will change
c) After computed and the values of E have not changed
d) After computed and the values of E will change
Cont…..[2]
[2]
Code No: 07A5EC20 Set No. 4
II. Fill in the Blanks:
11. The code improvement phase consists of _____________ followed by the application of transformation.
12. The replacement of an expressive operation by a cheaper one is called ________.
13. The relative address for a field name is relative to the __________ for that record.
14. Implicit type conversions also called ____________
15. The runtime representation of an object program in the logical address space consists of ___________.
16. The static data objects are created at ___________________.
17. The activations of procedures during the running of an entire program by a tree called _________.
18. The substitution of values for names whose values are constant is known as ______.
19. Activation records are sometimes called ______________.
20. If a transformation of a program performed by locking only at the statements in a basic blocks, called ________________.
-oOo-

formal languages and automata theory online bits

Code No: 07A50501 Set No. 1
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
III B.Tech. I Sem., II Mid-Term Examinations, November– 2009
FORMAL LANGUAGES AND AUTOMATA THEORY
Objective Exam
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. ____is used for describing block structure in programming languages. [ ]
a)Context free Language b)Context sensitive c)procedural d)primitive references.
2. The derivation of CFG can be represented by______ [ ] a)graphs b)definitions. c)trees d)grammar
3. The yield of a derivation tree is the _______the labels of the leaves without related petition of the left –to-right ordering.. [ ]
a)union b)cancatination c)sequence d)join
4. The following CFG is equivalent of the RE S->aS/bS/a/b_____ [ ]
a)(a+b) b)(a+b)* c)(a+b)(a+b) d)all of these
5. If G is a Context free Grammar, we can find a context Free Grammar G1,which has no null
Productions or unit productios such that ____ [ ]
a)G1=G b)L(G1)=L(G) c)G(L)=G1(L) d)L=G.
6. In turing Machine directed edges are used to represent ______ [ ]
a)final state b)initial state c)trasition function d)transition of states.
7. _______is used to restrict the Length of the Tape in Turing machines. [ ]
a)finite Automation b)Deterministic Automaton
c)Non Linear Automaton d)Linear Bounded Automaton
8. In NP Completeness for defining P we require the______ [ ]
a)space complexity b)input strings c)time complexity d)Grammar
9. ____________ can be thought of as a Finite state automaton connected to R/W head [ ]
a)pumping Lemma b)turing machine
c)Finite Deterministic automaton d)Recursive Functions
10. In the Turing Machine each cell can store ____No of inputs as symbols. [ ]
a)finite b)Null c)one d)infinite
Cont…..[2]

A
[2]
Code No: 07A50501 Set No. 1
II. Fill in the Blanks:
11. _______ is a process of splitting a sentence into words.
12. ______________ is used to restrict the Length of the Tape.
13. Turing and church independently designed a computing machine which can carry out a ________
14. The class of Automata that can be associated with context free language _________
15. Type 0 language accepted by ________
16. A terminal symbol ω belongs c(G) is ____________ if there exists more than one, derivation trees
for ω
17. A language L is in the class ______ if there exists a Non-deterministic TMM, such that M has time complexity p(n) for some polynomial P and M accepts L.
18. Context sensitive Language accepted by ______________
19. A string of symbols obtained by reading the leaves of the tree from left to right,omitting any €’s
encountered is called ______
20. A variable may be _______ if there is no way of getting the terminal from it.
-oOo-
Code No: 07A50501 Set No. 2
FORMAL LANGUAGES AND AUTOMATA THEORY
Objective Exam
Name:______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. The following CFG is equivalent of the RE S->aS/bS/a/b_____ [ ]
a)(a+b) b)(a+b)* c)(a+b)(a+b) d)all of these
2. If G is a Context free Grammar, we can find a context Free Grammar G1,which has no null
Productions or unit productios such that____ [ ]
a)G1=G b)L(G1)=L(G) c)G(L)=G1(L) d)L=G.
3. In turing Machine directed edges are used to represent ______ [ ]
a)final state b)initial state c)trasition function d)transition of states.
4. _______is used to restrict the Length of the Tape in Turing machines. [ ]
a)finite Automation b)Deterministic Automaton
c)Non Linear Automaton d)Linear Bounded Automaton
5. In NP Completeness for defining P we require the______ [ ]
a)space complexity b)input strings c)time complexity d)Grammar
6. ____________ can be thought of as a Finite state automaton connected to R/W head [ ]
a)pumping Lemma b)turing machine
c)Finite Deterministic automaton d)Recursive Functions
7. In the Turing Machine each cell can store ____No of inputs as symbols. [ ]
a)finite b)Null c)one d)infinite
8. ____is used for describing block structure in programming languages. [ ]
a)Context free Language b)Context sensitive c)procedural d)primitive references.
9. The derivation of CFG can be represented by______ [ ] a)graphs b)definitions. c)trees d)grammar
10. The yield of a derivation tree is the _______the labels of the leaves without related petition of the left –to-right ordering [ ]
a)union b)cancatination c)sequence d)join
Cont…..[2]

A
[2]
Code No: 07A50501 Set No. 2
II. Fill in the Blanks:
11. The class of Automata that can be associated with context free language _________
12. Type 0 language accepted by ________
13. A terminal symbol ω belongs c(G) is ____________ if there exists more than one, derivation trees
for ω
14. A language L is in the class ______ if there exists a Non-deterministic TMM, such that M has time complexity p(n) for some polynomial P and M accepts L.
15. Context sensitive Language accepted by ______________
16. A string of symbols obtained by reading the leaves of the tree from left to right,omitting any €’s
encountered is called ______
17. A variable may be _______ if there is no way of getting the terminal from it.
18. _______ is a process of splitting a sentence into words.
19. ______________ is used to restrict the Length of the Tape.
20. Turing and church independently designed a computing machine which can carry out a ________
-oOo-
Code No: 07A50501 Set No. 3
FORMAL LANGUAGES AND AUTOMATA THEORY
Objective Exam
Name:______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In turing Machine directed edges are used to represent ______ [ ]
a)final state b)initial state c)trasition function d)transition of states.
2. _______is used to restrict the Length of the Tape in Turing machines. [ ]
a)finite Automation b)Deterministic Automaton
c)Non Linear Automaton d)Linear Bounded Automaton
3. In NP Completeness for defining P we require the______ [ ]
a)space complexity b)input strings c)time complexity d)Grammar
4. ____________ can be thought of as a Finite state automaton connected to R/W head [ ]
a)pumping Lemma b)turing machine
c)Finite Deterministic automaton d)Recursive Functions
5. In the Turing Machine each cell can store ____No of inputs as symbols. [ ]
a)finite b)Null c)one d)infinite
6. ____is used for describing block structure in programming languages. [ ]
a)Context free Language b)Context sensitive c)procedural d)primitive references.
7. The derivation of CFG can be represented by______ [ ] a)graphs b)definitions. c)trees d)grammar
8. The yield of a derivation tree is the _______the labels of the leaves without related petition of the left –to-right ordering [ ]
a)union b)cancatination c)sequence d)join
9. The following CFG is equivalent of the RE S->aS/bS/a/b_____ [ ]
a) (a+b) b) (a+b)* c) (a+b)(a+b) d) all of these
10. If G is a Context free Grammar, we can find a context Free Grammar G1,which has no null
Productions or unit productios such that ____ [ ]
a) G1=G b) L(G1)=L(G) c) G(L)=G1(L) d) L=G.
Cont…..[2]

A
[2]
Code No: 07A50501 Set No. 3
II. Fill in the Blanks:
11. A terminal symbol ω belongs c(G) is ____________ if there exists more than one, derivation trees
for ω
12. A language L is in the class ______ if there exists a Non-deterministic TMM, such that M has time complexity p(n) for some polynomial P and M accepts L.
13. Context sensitive Language accepted by ______________
14. A string of symbols obtained by reading the leaves of the tree from left to right,omitting any €’s
encountered is called ______
15. A variable may be _______ if there is no way of getting the terminal from it.
16. _______ is a process of splitting a sentence into words.
17. ______________ is used to restrict the Length of the Tape.
18. Turing and church independently designed a computing machine which can carry out a ________
19. The class of Automata that can be associated with context free language _________
20. Type 0 language accepted by ________
-oOo-
Code No: 07A50501 Set No. 4
FORMAL LANGUAGES AND AUTOMATA THEORY
Objective Exam
Name:______________________________ Hall Ticket No.
Answer All Questions. All Questions Carry Equal Marks. Time: 20 Min. Marks: 20.
I. Choose the correct alternative:
1. In NP Completeness for defining P we require the______ [ ]
a)space complexity b)input strings c)time complexity d)Grammar
2. ____________ can be thought of as a Finite state automaton connected to R/W head [ ]
a)pumping Lemma b)turing machine
c)Finite Deterministic automaton d)Recursive Functions
3. In the Turing Machine each cell can store ____No of inputs as symbols. [ ]
a)finite b)Null c)one d)infinite
4. ___is used for describing block structure in programming languages. [ ]
a)Context free Language b)Context sensitive c)procedural d)primitive references.
5. The derivation of CFG can be represented by______ [ ] a)graphs b)definitions. c)trees d)grammar
6. The yield of a derivation tree is the _______the labels of the leaves without related petition of the left –to-right ordering [ ]
a)union b)cancatination c)sequence d)join
7. The following CFG is equivalent of the RE S->aS/bS/a/b_____ [ ]
a)(a+b) b)(a+b)* c)(a+b)(a+b) d)all of these
8. If G is a Context free Grammar, we can find a context Free Grammar G1,which has no null
Productions or unit productios such that____ [ ]
a)G1=G b)L(G1)=L(G) c)G(L)=G1(L) d)L=G.
9. In turing Machine directed edges are used to represent ______ [ ]
a)final state b)initial state c)trasition function d)transition of states.
10. _______is used to restrict the Length of the Tape in Turing machines. [ ]
a)finite Automation b)Deterministic Automaton
c)Non Linear Automaton d)Linear Bounded Automaton
Cont…..[2]

A
[2]
Code No: 07A50501 Set No. 4
II. Fill in the Blanks:
11. Context sensitive Language accepted by ______________
12. A string of symbols obtained by reading the leaves of the tree from left to right,omitting any €’s
encountered is called ______
13. A variable may be _______ if there is no way of getting the terminal from it.
14. _______ is a process of splitting a sentence into words.
15. ______________ is used to restrict the Length of the Tape.
16. Turing and church independently designed a computing machine which can carry out a _________
17. The class of Automata that can be associated with context free language _________
18. Type 0 language accepted by ________
19. A terminal symbol ω belongs c(G) is ____________ if there exists more than one, derivation trees
for ω.
20. A language L is in the class ______ if there exists a Non-deterministic TMM, such that M has time complexity p(n) for some polynomial P and M accepts L.