logo

CuriousTab

CuriousTab

Discussion


Home Technical Questions Database Comments

  • Question
  • What are different types of DBMS?


  • Correct Answer
  • 1 DBMS 2 RDBMS (Relational) 3 ORDBMS (Object Relational) 4 DDBMS (Distributed) 5 FDBMS (Federated) 6 HDDBMS (Homogeneous) 7 HDBMS (Hierarchical) 8 NDBMS (Networked) 

  • Tags: Database Administrator

    Database problems


    Search Results


    • 1. The capacity to change the conceptual schema without having to change external schemas or application programs is called

    • Options
    • A. Physical Data Independence
    • B. Logical Data Independence
    • C. Both A and B
    • D. None
    • Discuss
    • 2. What is schema?
    • Discuss
    • 3. Physical data models describe the details of how data is stored in the computers

    • Options
    • A. TRUE
    • B. FALSE
    • Discuss
    • 4. Representation level data models provide the concepts that are close to the way many users perceive data

    • Options
    • A. TRUE
    • B. FALSE
    • Discuss
    • 5. Database is a collection of concepts that can be used to describe the structure of a database

    • Options
    • A. TRUE
    • B. FALSE
    • Discuss
    • 6. The no of entities participating in a relation is called

    • Options
    • A. Relation
    • B. Degree of relationship
    • C. Recursive relationship
    • D. None of the above
    • Discuss
    • 7. The relationship where both the participating entities belong to same entity type is called

    • Options
    • A. Participation
    • B. Recursive
    • C. Standard
    • D. Normal
    • Discuss
    • 8. Which among the following is the relationship constraints

    • Options
    • A. Cardinality ratio
    • B. Participation constraints
    • C. Both A and B
    • D. None of the above
    • Discuss
    • 9. Which among the following is the disadvantage of circular list?

    • Options
    • A. An info field that contains the information stored in the node
    • B. Can?t traverse the list backward
    • C. A pointer to the node is given we cannot delete the node
    • D. Both 2 and 3
    • Discuss
    • 10. The time complexity of sequential search is

    • Options
    • A. O(n)
    • B. O(2n)
    • C. O(n^2)
    • D. None
    • Discuss


    Comments

    There are no comments.

Enter a new Comment