Aspire's Library

A Place for Latest Exam wise Questions, Videos, Previous Year Papers,
Study Stuff for MCA Examinations
  • AMU MCA
    Previous Year Questions

AMU MCA Previous Year Questions (PYQs)

AMU MCA Database Management Systems PYQ

AMU MCA PYQ
E-R modeling technique is a





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

E-R modelling starts from general view → top-down approach.

AMU MCA PYQ
Malicious software is known as






Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2020 PYQ

Solution

Malicious software is commonly called malware.

AMU MCA PYQ
The physical location of a record determined by a formula that transforms a file key into a record location is





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hash function directly maps key to location.
AMU MCA PYQ
The employee salary should not be greater than Rs. 20,000.” This constraint is of type:






Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

It restricts a single attribute value.
AMU MCA PYQ
In a University schema, student and courses contains:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Many students enroll in many courses → many-to-many.
AMU MCA PYQ
Consider a relation $R(A,B,C,D)$ with set of functional dependencies $AB \rightarrow CD$ and $D \rightarrow A$. Let $R_1(A,D)$ and $R_2(B,C,D)$ are two decompositions over $R$. Which of the following statement is TRUE?





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

The decomposition is lossless (common attribute $D$ determines $A$), but not dependency preserving (FD $AB \rightarrow CD$ is lost).
AMU MCA PYQ
In which file, the records are organized in sequence and an index table is used to speed up access to the records without requiring a search of the entire file?





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Indexed Sequential File uses sequential storage + index for fast access.
AMU MCA PYQ
The Default and Maximum Size of Text Field in MS-Access is:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

Adjacency matrix is a method to represent graphs.
AMU MCA PYQ
Which of the following is not a type of database?





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Hierarchical, network, and distributed are database models. Decentralized is not a standard database type.
AMU MCA PYQ
The relational model uses some unfamiliar terminology. A tuple is equivalent to a:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

In relational databases, a tuple represents a single record (row).
AMU MCA PYQ
Match the following:
 List–I
 List–II
 (A) No attribute can be added
 (1) Determinants
 (B) Uniquely identified a row
 (2) Candidate key
 (C) A constraint between two attribute
 (3) Non-redundancy
 (D) Group of attributes on the left hand side of arrow of functional dependency

 (4) Functional dependency






Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

Solution:

No attribute can be added → Non-redundancy (3)

Uniquely identifies a row → Candidate key (2)

Constraint between attributes → Functional dependency (4)

LHS of FD → Determinants (1)

So correct matching: A-3, B-2, C-4, D-1
AMU MCA PYQ
The result of the UNION operation between $R_1$ and $R_2$ is a relation that includes:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

UNION returns all tuples from both relations without duplicates.
AMU MCA PYQ

Consider a relation schema $R(A,B,C,D)$ with the following set of functional dependencies:
$FD={A\rightarrow BC,\ B\rightarrow C,\ A\rightarrow B,\ AB\rightarrow C,\ AC\rightarrow D}$.
Which of the following is irreducible set of the above defined FDs?






Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2022 PYQ

Solution

From $A\rightarrow B$ and $B\rightarrow C$, we get $A\rightarrow C$.
Also from $AC\rightarrow D$ and $A\rightarrow C$, we get $A\rightarrow D$.
Minimal irreducible cover is:
$A\rightarrow B,\ B\rightarrow C,\ A\rightarrow D$
AMU MCA PYQ
A phone number in a database is an example of:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2025 PYQ

Solution

A phone number is a single attribute, hence it is a field.
AMU MCA PYQ
If every non-key attribute is functionally dependent on primary key, relation is in at least:





Go to Discussion
AMU MCA Previous Year PYQ AMU MCA AMU MCA 2021 PYQ

Solution

This condition satisfies 2NF (no partial dependency).

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More

AMU MCA

Online Test Series,
Information About Examination,
Syllabus, Notification
and More.

Click Here to
View More
Ask Your Question or Put Your Review.

loading...