Objective Questions(41-50)

41. Which of the following pairs have DIFFERENT expressive power?
(A) Deterministic finite automata (DFA) and Non-Deterministic finite automata(NFA)
(B) Deterministic push down automata (DPDA) and Non-deterministic pushdown automata (C) Deterministic single-tape Turing machine and Non-deterministic single-tape Turing Machine
(D) Single-tape Turing machine and multi-tape Turing machine 

DPDA cannot handle languages or grammars with ambiguity, but NDPDA can handle languages with ambiguity and any context-free grammar.

42. What is the component of a DBMS that is responsible for storing, retrieving, and updating data?
A )data dictionary
B )data management engine
C )database engine D )query engine

43. RAD is a linear sequential software development process model. RAD is an acronym for ?
a. Rapid Application Development
b. Rapid Action Development
c. Rough Application Development
d. Rough Action Development

44. Most difficult part of compiler design is:
a. Lexical Analyzer
b. Syntax Analyzer
c. Semantic Analyzer
d. Code-Optimization

45. Method of implementing Dynamic Scope in compiler design is/are:
a. Deep Access Method
b. Shallow Access Method
c. both a and b
d. None of the above

46. The lexical analysis for a modern computer language such as java needs the power of which one of the following machine models in a necessary and sufficient sense?
(a) Finite State Automata
(b) Deterministic Pushdown Automata
(c) Non-Deterministic Pushdown Automata
(d) Turing Machine

47. The following command is used to remove any table in the database in SQL
1. Delete
2. Drop
3. Truncate
4. Remove

48. Q.When the result of a computation depends on the speed of the processes involved there is said to be.
a)cycle stealing
b)a time lock
c)deadlock
d)none of these 

Race condition: The situation where several processes access – and manipulate shared data concurrently. The final value of the shared data depends upon which process finishes last.

49. In the C language:-
a. Atmost one activation record exist between the current activation record and the activation record for the main.
b. The number of activation records between the current activation record and the activation record for the main depends on the actual function calling sequence. c. The visibility of global variables depends upon the actual function calling sequence.
d. Recursion requires the activation record for the recursive function to be saved on a different stack before the recursive function can be called.

50. Reference Counting type of Garbage collection method does not collect:
a. Double link list.
b. Circular Link list
c. Heap implementation with link list
d. None of the above