Graph based protocol ensures serializability and deadlock freedom and has restrictions on items being accessed,because before acquiring access to elements we have to acquire lock on parents.

ACID properties in DBMS
Atomicity-This property states that a transaction must be treated as an atomic unit, that is, either all of its operations are executed or none.
Consistency-The database must remain in a consistent state after any transaction. No transaction should have any adverse effect on the data residing in the database. If the database was in a consistent state before the execution of a transaction, it must remain consistent after the execution of the transaction as well.
Isolation- In a database system where more than one transaction are being executed simultaneously and in parallel, the property of isolation states that all the transactions will be carried out and executed as if it is the only transaction in the system. No transaction will affect the existence of any other transaction.
Durability-The database should be durable enough to hold all its latest updates even if the system fails or restarts. If a transaction updates a chunk of data in a database and commits, then the database will hold the modified data. If a transaction commits but the system fails before the data could be written on to the disk, then that data will be updated once the system springs back into action.

In Dense Index, an index entry appears for every search-key whereas for Sparse index, an index entry appears for only some of the search-key values.

There are two fundamental concepts of a network model :
->Records contain fields which need hierarchical organization.
->Sets are used to define one-to-many relationships between records that contain one owner, many members.

A temporal database stores data relating to time instances. It offers temporal data types and stores information relating to past, present and future time. Temporal databases could be uni-temporal, bi-temporal or tri-temporal. Valid time is the time period during which a fact is true in the real world.

The condition for the relation to be in BCNF is that the left side of functional dependencies must be super key.

Total no. of possible sequences possible
= Each bit can be either 0 ‘or’ 1
= 2 × 2 × 2 … 10times
= 2¹⁰
= 1024
Now let’s find the probability that none of the bits is 0 = 1/1024
Because out of 1024 only one sequence will contain all bits 1.
So the required probability
= 1 - 1/1024
= 1023/1024

Let
A = No. of students taken course in French
B = No. of students taken course in Russian
C = No. of students taken course in Spanish
Now, We have to find,
A∩B∩C
Now, the formula we know is
AUBUC = A + B + C - A∩B - B∩C - C∩A + A∩B∩C
= 1232 + 879 + 114 - 103 - 23 - 14 + A∩B∩C
2092 = 2085 + A∩B∩C
A∩B∩C = 7

No. of total elements in n×n relation = n²
For reflexive relation all the diagonal elements must be there. In total there are n diagonal elements out of n² and for remaining n²-n elements we have two choices either we can select it or don’t take it. Therefore total no. of reflexive relations possible is,
2 × 2 × 2 × …(n²-n)times
= 2^n2-n

p → q is logically equivalent to ~p V Q

The binary value of 1026 is
10000000010
But since char is of 1 byte so, it will consider 8 bits from the right side. Hence the value of char will be
00000010 = 2
So when the switch is executed it will go to case 8 and “Response 2” will get printed.

Inside the condition of if printf(“ABC”) will return 3 and we know that in if condition anything other than 0 is considered true so it will enter the if loop and will print Tue.Also before that ABC will get printed due to printf(“ABC”). So in total ABCTrue will get printed

III is not legal because variable sized object cannot be initialized.

Since p is a local variable for main() function ,so it will be stored in stack section.

A well- known approach to database design that can be used as a bottom-up approach is normalization

Given,
Pincode → city, state
Street, city, state → pincode
The candidate keys are
(empcode, name, pincode)
and
(empcode, name, street, city, state)
Since in both the functional dependencies right side is prime attributes but left side is not super keys. So the given relation is in 3NF but not in BCNF.