If there are ‘n’ number of states in NFA ,then its equivalent DFA may contain atmost 2ⁿ number of states.

To get the PDA, the CFG should be in the form of GNF.

One of the uses of CNF is to turn parse trees into binary trees. – These trees have some convenient properties, one of which we exploit here.
Theorem 7.17: Suppose we have a parse tree according to a Chomsky- Normal-Form grammar G = (V, T, P, S), and suppose that the yield of the tree is a terminal string w.

Let’s draw parse tree for string ‘( )’

Since for the given string two parse trees are possible. So the given grammar is ambiguous.

The overall logical data structure of a database can be expressed graphically by an E-R diagram. Which consists of rectangle (entity), ellipse (attribute), diamond (relationship), and lines.

The relation schema describes set of fields (Column heads/Attributes).

If X is not a proper subset of any key means there is no partial dependency. And if there is a violation then the only possibility left is transitive dependency, means if there is transitive dependencies then there is 3NF violation.

There are four properties of transactions that must be followed,
A-Atomicity
C-Consistency
I-Isolation
D-Durability
And the question is asking all or none refers to which of the property.
All or None refers to Atomicity.

Inheritance achieved by the keyword in SQL is ‘under’.

An ADT does not specify how the data type is implemented.

Backtracking is a depth-first search with any bounding function.

Each octet of IP address has the maximum value of 255. Since in option B, third octet exceeds the value 255,hence invalid.

In broadcasting communication ,the destination address of all the packets are same since that packet has to be distributed among all the hosts of the network.

There are 5 classful addressing scheme, Class A, Class B, Class C, Class D, Class D, Class E.

A functional dependency is a relationship between attributes.

Outer join operator is used to retain the unmatched rows of relations when they joined.

The physical location of a record is determined by a mathematical formula, which transforms a file key into a record location in hashed file. Hashing is the transformation of a string of characters into a usually shorter fixed-length value or key that represents the original string.

Option B is false because Lossless decomposition into BCNF is always possible but dependency preserving decomposition into BCNF is not always possible.

Primary objective of formal technical reviews:
Find errors during the process so that they do not become defects after release of the software. Benefit - the early discovery of errors so they do not propagate to the next step in the software process

Process class is a class which implement lower level business abstractions required to manage the business domain class.

A language L is recursive iff there exists a TM that enumerates L in canonical order.

Main memory, cache, magnetic disk are managed by operating system but solid state disk is not managed by operating system.