Database Management System MCQ

Database Management System MCQ for UGC NET/GATE/ISRO/DRDO/NIELIT/KVS/NVS

Q1➡ |
What is the optimized version of the relation algebra expression πA1A2F1F2(r)))), where A1, A2 are sets of attributes in with A1 ⊂ A2 and F1, F2 are Boolean expressions based on the attributes in r?
i ➥ πA1(F1∨F2) (r))
ii ➥ πA2(F1∨F2) (r))
iii ➥ πA1(F1∧F2) (r))
iv ➥ πA2(F1∧F2) (r))
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q2➡ |
Database _____ which is the logical design of the database, and the database ______ which is a snapshot of the data in the database at a given instant in time.
i ➥ Schema, Instance
ii ➥ Instance, Schema
iii ➥ Relation, Schema
iv ➥ Relation, Domain
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q3➡ |
Suppose R1(A, B) and R2(C, D) are two relation schemas. Let r1 and r2 be the corresponding relation instances. B is a foreign key that refers to C in R2. If data in r1 and r2 satisfy referential integrity constraints, which of the following is ALWAYS TRUE?
i ➥ C (r2) – ∏B (r1) = ∅
ii ➥ B (r1) = ∏C (r2)
iii ➥ B (r1) – ∏C (r2) = ∅
iv ➥ B (r1) – ∏C (r2) ≠ ∅
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q4➡ |
Let R={A,B,C,D,E,F} be a relation schema with the following dependencies C→F , E→A, EC→D, A→B. Which of the following is a key for R ?
i ➥ CD
ii ➥ EC
iii ➥ AE
iv ➥ AC
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q5➡ |
Consider the schema R= ( S, T, U, V ) and the dependencies S→T, T→U, U→V and V→S. Let R (R1 and R2) be a decomposition such that R1∩R2 ≠ Ø. The decomposition is:
i ➥ Not in 2NF
ii ➥ In 2NF but not in 3NF
iii ➥ In 3NF but not in 2NF
iv ➥ In both 2NF and 3NF
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q6➡ |
Relation R with an associated set of functional dependencies, F is decomposed into BCNF. The redundancy (arising out of functional dependencies) in the resulting set relations is.
i ➥ Zero
ii ➥ More than zero but less than that of an equivalent 3NF decomposition
iii ➥ Proportional to the size of F+
iv ➥ Indeterminate
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q7➡ |
Which one of the following statements about normal forms is FALSE?
i ➥ BCNF is stricter than 3NF
ii ➥ Lossless, dependency-preserving decomposition into 3NF is always possible
iii ➥ Lossless, dependency-preserving decomposition into BCNF is always possible
iv ➥ Any relation with two attributes is in BCNF
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q8➡ |
Which of the following is NOT a superkey in a relational schema with attributes V, W, X, Y, Z and primary key VY?
i ➥ VXYZ
ii ➥ VWXZ
iii ➥ VWXY
iv ➥ VWXYZ
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q9➡ |
Given the following two statements:
S1: Every table with two single-valued attributes is in 1NF, 2NF, 3NF and BCNF.
S2: AB->C, D->E, E->C is a minimal cover for the set of functional dependencies AB->C, D->E, AB->E, E->C.

Which one of the following is CORRECT?
i ➥ S1 is TRUE and S2 is FALSE.
ii ➥ Both S1 and S2 are TRUE.
iii ➥ S1 is FALSE and S2 is TRUE.
iv ➥ Both S1 and S2 are FALSE.
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q10➡ |
The subset of a super key is a candidate key under what condition?
i ➥ No proper subset is a super key
ii ➥ Each subset is a super key
iii ➥ Subset is a super key
iv ➥ All subsets are super keys
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q11➡ |
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R.

How many candidate keys does the relation R have?
i ➥ 4
ii ➥ 3
iii ➥ 6
iv ➥ 5
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q12➡ |
Relation R has eight attributes ABCDEFGH. Fields of R contain only atomic values. F = {CH -> G, A -> BC, B -> CFH, E -> A, F -> EG} is a set of functional dependencies (FDs) so that F+ is exactly the set of FDs that hold for R.

The relation R is
i ➥ in 1NF, but not in 2NF.
ii ➥ in 2NF, but not in 3NF.
iii ➥ in 3NF, but not in BCNF.
iv ➥ in BCNF.
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q13➡ |
The_____ operation allows the combining of two relations by merging pairs of tuples, one from each relation, into a single tuple.
i ➥ Intersection
ii ➥ Union
iii ➥ Join
iv ➥ Select
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q14➡ |
Let r be a relation instance with schema R = (A, B, C, D). We define r1 = ΠA,B,C(R) and r2 = ΠA,D(R). Let s = r1*r2 where * denotes natural join. Given that the decomposition of r into r1 and r2 is lossy, which one of the following is TRUE?
i ➥ s ⊂ r
ii ➥ r ∪ s = r
iii ➥ r ⊂ s
iv ➥ r * s = s
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q15➡ |
Let R1(A,B,C) and R2(D,E) be two relation schema, where the primary keys are shown underlined, and let C be a foreign key in R1 referring to R2. Suppose there is no violation of the above referential integrity constraint in the corresponding relation instances r1 and r2. Which one of the following relational algebra expressions would necessarily produce an empty relation?
i ➥ ΠD(r2) – ΠC(r1)
ii ➥ ΠC(r1) – ΠD(r2)
iii ➥ ΠD(r1C≠Dr2)
iv ➥ ΠC(r1C=Dr2)
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q16➡ |
Which of the following query transformations (i.e., replacing the l.h.s. expression by the r.h.s. expression) is incorrect? R1 and R2 are relations. C1, C2 are selection conditions and A1, A2 are attributes of R1.
i ➥ σC1( σC2R1)) → σC2C2(R1))
ii ➥ σC1( πA1R1)) → πA1C1(R1))
iii ➥ σC1( R1 ∪ R2 ) → σC1(R1) ∪ σC1(R2)
iv ➥ πA1C1(R1)) → σC1A1 (R1))
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q17➡ |
In RDBMS, which type of Join returns all rows that satisfy the join condition ?
i ➥ Inner Join
ii ➥ Outer Join
iii ➥ Semi Join
iv ➥ Anti Join
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q18➡ |
Relational Algebra is a __ query language that takes two relations as input and produces another relation as an output of the query.
i ➥ Structural
ii ➥ Procedural
iii ➥ Fundamental
iv ➥ Relational
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q19➡ |
The join operation can be defined as
i ➥ a cartesian product of two relations followed by a selection
ii ➥ a cartesian product of two relations
iii ➥ a union of two relations followed by cartesian product of the two relations
iv ➥ a union of two relations
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q20➡ |
A relational database contains two tables student and department in which student table has columns roll_no, name and dept_id and department table has columns dept_id and dept_name. The following insert statements were executed successfully to populate the empty tables:
Insert into department values (1, ‘Mathematics’)
Insert into department values (2, ‘Physics’)
Insert into student values (l, ‘Navin’, 1)
Insert into student values (2, ‘Mukesh’, 2)
Insert into student values (3, ‘Gita’, 1)
How many rows and columns will be retrieved by the following SQL statement?

Select * from student, department
i ➥ 6 rows and 5 columns
ii ➥ 3 rows and 5 columns
iii ➥ 3 rows and 4 columns
iv ➥ 0 row and 4 columns
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q21➡ |
Consider the join of a relation R , with a relation S . If R has m number of tuples and S has n number of tuples then the maximum and minimum sizes of the join respectively are:
i ➥ m + n & 0
ii ➥ mn & 0
iii ➥ m + n & | m – n |
iv ➥ mn & m + n
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q22➡ |
Given the relations
employee (name, salary, deptno) and
department (deptno, deptname, address)
Which of the following queries cannot be expressed using the basic relational algebra operations (U, -, x, π ,σ , p)?
i ➥ Department address of every employee
ii ➥ Employees whose name is the same as their department name
iii ➥ The sum of all employees’ salaries
iv ➥ All employees of a given department
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q23➡ |
The relational algebra expression equivalent to the tuple calculus expression {t|t ∈ r ⋀ (t[A]=10 ⋀ t[B]=20)} is
i ➥ σ(A=10 v B=20) (r)
ii ➥ σ(A=10) (r) U σ( B=20) (r)
iii ➥ σ(A=10) (r) ∩ σ(B=20) (r)
iv ➥ σ(A=10) (r) – σ(B=20) (r)
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q24➡ |
Consider two relations R1(A,B) with the tuples (1,5), (3,7) and R2(A,C) = (1,7), (4,9). Assume that R(A,B,C) is the full natural outer join of R1 and R2. Consider the following tuples of the form (A,B,C): a = (1.5,null), b = (1,null,7), c = (3,null,9), d = (4,7,null), e = (1,5,7), f = (3,7,null), g = (4,null,9).
Which one of the following statements is correct?
i ➥ R contains a,b,e,f,g but not c, d
ii ➥ R contains all of a,b,c,d,e,f,g
iii ➥ R contains e,f,g but not a,b
iv ➥ R contains e but not f,g
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q25➡ |
Which of the following functional dependencies hold for relations R(A, B, C) and S(B, D, E):
B -> A
A -> C
The relation R contains 200 tuples and the relation S contains 100 tuples. What is the maximum number of tuples possible in the natural join of R and S (R natural join S)
i ➥ 100
ii ➥ 200
iii ➥ 300
iv ➥ 2000
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q26➡ |
______ is a special type of integrity constraint that relates two relations & maintains consistency across the relations.
i ➥ Domain Constraints
ii ➥ Domain Integrity Constraints
iii ➥ Entity Integrity Constraints
iv ➥ Referential Integrity Constraints
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q27➡ |
Which operation is used to extract specific columns from a table?
i ➥ Project
ii ➥ Extract
iii ➥ Substitute
iv ➥ Join
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q28➡ |
Which of the following is a fundamental operation in relational algebra?
i ➥ Set intersection
ii ➥ Natural Join
iii ➥ Assignment
iv ➥ None of the above
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q29➡ |
Consider the relation X(P, Q, R, S, T, U) with the following set of functional dependencies
F = {
{P, R} → {S,T},
{P, S, U} → {Q, R}
}
Which of the following is the trivial functional dependency in F+ is closure of F?
i ➥ {P,R}→{S,T}
ii ➥ {P,R}→{R,T}
iii ➥ {P,S}→{S}
iv ➥ {P,S,U}→{Q}
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q30➡ |
In a schema with attributes A, B, C, D and E following set of functional dependencies are given
A → B
A → C
CD → E
B → D
E → A
Which of the following functional dependencies is NOT implied by the above set?
i ➥ CD → AC
ii ➥ BD → CD
iii ➥ BC → CD
iv ➥ AC → BC
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q31➡ |
Drop Table cannot be used to drop a table referenced by a _______ constraint.
i ➥ Primary Key
ii ➥ Composite Key
iii ➥ Foreign Key
iv ➥ Local Key
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q32➡ |
Let x, y, z, a, b, c be the attributes of an entity set E. If {x}, {x,y}, {a,b}, {a,b,c}, {x,y,z} are superkeys then which of the following are the candidate keys?
i ➥ {x,y} and {a,b}
ii ➥ {x} and {a,b}
iii ➥ {x,y,z} and {a,b,c}
iv ➥ {z} and {c}
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q33➡ |
Given the basic ER and relational models, which of the following is INCORRECT?
i ➥ An attribute of an entity can have more than one value
ii ➥ An attribute of an entity can be composite
iii ➥ In a row of a relational table, an attribute can have more than one value
iv ➥ In a row of a relational table, an attribute can have exactly one value or a NULL value
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q34➡ |
Which of the following indicates the maximum number of entities that can be involved in a relationship?
i ➥ Minimum cardinality
ii ➥ Maximum cardinality
iii ➥ ERD
iv ➥ Greater Entity Count
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q35➡ |
Maximum number of superkeys for the relation schema R(X,Y,Z,W) with X as the key is:
i ➥ 6
ii ➥ 8
iii ➥ 9
iv ➥ 12
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q36➡ |
A primary key is combined with a foreign key creates
i ➥ Many to many relationship between the tables that connect them
ii ➥ Parent-Child relation ship between the tables that connect them
iii ➥ Network model between the tables that connect them
iv ➥ None of the mentioned
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q37➡ |
The entity set person is classified as student and employee. This process is called _______
i ➥ Specialization
ii ➥ Inheritance
iii ➥ Generalization
iv ➥ Constraint generalization
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q38➡ |
The completeness constraint may be one of the following: Total generalization or specialization, Partial generalization or specialization. Which is the default?
i ➥ Partial
ii ➥ Total
iii ➥ Should be specified
iv ➥ Cannot be determined
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q39➡ |
Consider the employee work-team example, and assume that certain employees participate in more than one work team. A given employee may therefore appear in more than one of the team entity sets that are lower level entity sets of employee. Thus, the generalization is________.
i ➥ Disjointness
ii ➥ Overlapping
iii ➥ Uniqueness
iv ➥ Relational
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q40➡ |
There are similarities between the instructor entity set and the secretary entity set in the sense that they have several attributes that are conceptually the same across the two entity sets: namely, the identifier, name, and salary attributes. This process is called
i ➥ Commonality
ii ➥ Specialization
iii ➥ Generalization
iv ➥ Similarity
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q41➡ |
A ________ constraint requires that an entity belong to no more than one lower-level entity set.
i ➥ Disjointness
ii ➥ Uniqueness
iii ➥ Special
iv ➥ Relational
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q42➡ |
In the ______ normal form, a composite attribute is converted to individual attributes.
i ➥ First
ii ➥ Second
iii ➥ Third
iv ➥ Fourth
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q43➡ |
Which of the following is not Armstrong’s Axiom?
i ➥ Augmentation rule
ii ➥ Pseudotransitivity rule
iii ➥ Transitivity rule
iv ➥ Reflexivity rule
Answer –II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q44➡ |
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.
Consider a database that has the relation schema CR(StudentName, CourseName). An instance of the schema CR is as given below.
The following query is made on the database.
         T1 ← πCourseNameStudentName=’SA’(CR))
         T2 ← CR ÷ T1
The number of rows in T2 is ____________.
i ➥ 7
ii ➥ 6
iii ➥ 5
iv ➥ 4
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q45➡ |
In table T1, P is the primary key and Q is the foreign key referencing R in table T2 with on-delete cascade and on-update cascade. In table T2, R is the primary key and S is the foreign key referencing P in table T1 with on-delete set NULL and on-update cascade. In order to delete record 〈3,8〉 from table T1, the number of additional records that need to be deleted from table T1 is _____.
In table T1, P is the primary key and Q is the foreign key referencing R in table T2 with on-delete cascade and on-update cascade. In table T2, R is the primary key and S is the foreign key referencing P in table T1 with on-delete set NULL and on-update cascade. In order to delete record 〈3,8〉 from table T1, the number of additional records that need to be deleted from table T1 is _____.
i ➥ 0
ii ➥ 1
iii ➥ 2
iv ➥ 3
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q46➡ |
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: ρ is the rename operator).
Consider the relation Student (name, sex, marks), where the primary key is shown underlined, pertaining to students in a class that has at least one boy and one girl. What does the following relational algebra expression produce? (Note: ρ is the rename operator).
i ➥ Names of girl students with the highest marks
ii ➥ Names of girl students with more marks than some boy student
iii ➥ Names of girl students with marks not less than some boy student
iv ➥ Names of girl students with more marks than all the boy students
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q47➡ |
How many tuples does the result of the following relational algebra expression contain? Assume that the schema of AUB is the same as that of A. (AUB)⋈A.Id srcset=40∨C.Id<15 C">
How many tuples does the result of the following relational algebra expression contain? Assume that the schema of AUB is the same as that of A.
(AUB)⋈A.Id>40∨C.Id<15 C
i ➥ 7
ii ➥ 4
iii ➥ 5
iv ➥ 9
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q48➡ |
Consider the following relation schema pertaining to a students database:
Student (rollno, name, address)
Enroll (rollno, course no, coursename)
Where the primary keys are shown underlined. The number of tuples in the Student and Enroll tables are 120 and 8 respectively. What are the maximum and minimum number of tuples that can be present in (Student * Enroll), where ‘*’ denotes natural join ?
i ➥ 8, 8
ii ➥ 120, 8
iii ➥ 960, 8
iv ➥ 960, 120
Answer –I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q49➡ |
How many tuples will be returned by the following relational algebra query? ∏x(σ(P.Y=R.Y ∧ R.V=V2)(P × R)) - ∏x(σ(Q.Y=R.Y ∧ Q.T srcset=2)(Q × R))”>
How many tuples will be returned by the following relational algebra query?
x(P.Y=R.Y ∧ R.V=V2)(P × R)) – ∏x(Q.Y=R.Y ∧ Q.T>2)(Q × R))
i ➥ 0
ii ➥ 1
iii ➥ 2
iv ➥ 3
Answer –
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q50➡ |
Suppose now that R(A,B) and S(A,B) are two relations with r and s tuples, respectively (again, not necessarily distinct). If m is the number of (not necessarily distinct) tuples in the result of the SQL query:
R intersect S;
Then which of the following is the most restrictive, correct condition on the value of m?
i ➥ 0 <= m <= r + s
ii ➥ min(r,s) <= m <= max(r,s)
iii ➥ m = min(r,s)
iv ➥ 0 <= m <= min(r,s)
Answer –IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q51➡ |
Consider a relation R(A,B,C,D,E) with the following functional dependencies:
ABC -> DE and
D -> AB
The number of superkeys of R is:
i ➥ 2
ii ➥ 7
iii ➥ 10
iv ➥ 12
Answer – III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q52➡ |
Which normal form is considered adequate for normal relational database design?
i ➥ 2NF
ii ➥ 5NF
iii ➥ 3NF
iv ➥ 4NF
Answer –III
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q53➡ |
A table has fields F1, F2, F3, F4, and F5, with the following functional dependencies:
F1->F3
F2->F4
(F1,F2)->F5
in terms of normalization, this table is in
i ➥ 1NF
ii ➥ 2NF
iii ➥ 3NF
iv ➥ None of the mentioned
Answer – I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q54➡ |
Let R(A,B,C,D,E,P,G) be a relational schema in which the following FDs are known to hold:
AB->CD
DE->P
C->E
P->C
B->G
The relation schema R is
i ➥ in BCNF
ii ➥ in 3NF, but not in BCNF
iii ➥ in 2NF, but not in 3NF
iv ➥ not in 2NF
Answer –IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q55➡ |
Which of the normal form is based on multivalued dependencies?
i ➥ First
ii ➥ Second
iii ➥ Third
iv ➥ Fourth
Answer – IV
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q56➡ |
Which one is correct w.r.t. RDBMS ?
i ➥ primary key ⊆ candidate key ⊆ super key
ii ➥ super key ⊆ candidate key ⊆ primary key
iii ➥ super key ⊆ primary key ⊆ candidate key
iv ➥ primary key ⊆ super key ⊆ candidate key
Answer –I
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Q57➡ |
Let R1(a,b,c) and R2(x,y,z) be two relations in which a is the foreign key of R1 that refers to the primary key of R2 . Consider following four options.
(a) Insert into R1
(b) Insert into R2
(c) Delete from R1
(d) Delete from R2
Which of the following is correct about the referential integrity constraint with respect to above ?
i ➥ Operations (a) and (b) will cause violation.
ii ➥ Operations (b) and (c) will cause violation.
iii ➥ Operations (c) and (d) will cause violation.
iv ➥ Operations (d) and (a) will cause violation.
Answer – II
More DiscussionExplanation On YouTubeLearn Topic WiseHelp-Line

Leave a Reply

Your email address will not be published.

error: Content is protected !!
Open chat
1
Hi,how Can We Help You ?