Calculate candidate key (in Hindi)

Overview of the Course (in Hindi)

5:19mins

Keys in DBMS (in Hindi)

8:14mins

Inference rules for Functional Dependencies (in Hindi)

8:12mins

Find Clouser in Functional Dependencies (in Hindi)

8:08mins

Computer Clouser with example (in Hindi)

8:08mins

Calculate candidate key (in Hindi)

8:29mins

Find candidate key easily (in Hindi)

5:37mins

Find candidate key (in Hindi)

8:07mins

Question of candidate key (in Hindi )

3:47mins

Maximum size of the join r1⋈ r2 (in Hindi)

8:01mins

Referential integrity constraint question with solution( in Hindi )

8:10mins

SQL update query related question with solution( in Hindi )

6:52mins

The functional dependencies are satisfied by the instance(in Hindi)

7:26mins

Functional dependencies is NOT implied by the above set (in Hindi )

5:36mins

Find super key (in DBMS )

6:28mins

Conflict serializable (in Hindi)

6:41mins

Decomposition is Lossless or dependency preserving(in Hindi)

6:01mins

Previous year Question with solution of conflict serializable( in Hindi )

7:12mins

SQL query question (in Hindi)

7:17mins

Index file associated related question (in Hindi)

7:12mins

Any non-serial interleaving of T1 and T2 for concurrent execution leads to( in Hindi)

5:36mins

Correct serialization of the transactions( in Hindi)

6:03mins

SELECT Y FROM T WHERE X=7 (in Hindi)

5:56mins

If the transaction T1 fails after the execution of Read(B),then which is true? (In Hindi)

5:32mins

Referential integrity (in Hindi )

6:06mins

Non recoverable schedule (in Hindi )

5:25mins

The canonical cover for this set ( in Hindi )

5:18mins

Armstrong's axiom( in Hindi )

6:06mins

On-delete cascade( in Hindi )

5:14mins