Discussion
Home ‣ Technical Questions ‣ Database Comments
- Question
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
- Correct Answer
- Both 2 and 3
ExplanationBoth 2 and 3 are clearly the diadvantages of circular list
- 1. 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
- 2. The relationship where both the participating entities belong to same entity type is called
Options- A. Participation
- B. Recursive
- C. Standard
- D. Normal Discuss
- 3. 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
- 4. What are different types of DBMS? Discuss
- 5. 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
- 6. The time complexity of sequential search is
Options- A. O(n)
- B. O(2n)
- C. O(n^2)
- D. None Discuss
- 7. If you are using C language to implement the heterogeneous linked list, what pointer type will you use? Discuss
- 8. Does the minimum spanning tree of a graph give the shortest distance between any 2 specified nodes?
Options- A. Yes
- B. No
- C. May be Yes or No
- D. None Discuss
- 9. Which of the following products implemented the CODASYL DBTG model?
Options- A. IDMS
- B. DB2
- C. dBase-II
- D. R:base Discuss
- 10. Which of the following indicates the maximum number of entities that can be involved in a relationship?
Options- A. Minimum cardinality
- B. Maximum cardinality
- C. ERD
- D. Greater Entity Count (GEC) Discuss
Database problems
Search Results
Correct Answer: Both A and B
Explanation:
Both of them are relation ship constraints
Correct Answer: Recursive
Explanation:
The relationship where both the participating entities belong to same entity type is called Recursive relationship
Correct Answer: Degree of relationship
Explanation:
The no of entities participating in relation is called Degree of relationship
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)
Correct Answer: Logical Data Independence
Explanation:
LDI is the capacity to change the conceptual schema without having to change external schemas or application programs.
Correct Answer: O(n)
Explanation:
The time complexity of sequential search is O(n)
Correct Answer: The heterogeneous linked list contains different data types in its nodes and we need a link, pointer to connect them It is not possible to use ordinary pointers for this So we go for void pointer Void pointer is capable of storing pointer to any type as it is a generic pointer type
Correct Answer: No
Explanation:
No.Minimal spanning tree assures that the total weight of the tree is kept at its minimum. But it doesn?t mean that the distance between any two nodes involved in the minimum-spanning tree is minimum.
Correct Answer: IDMS
Correct Answer: Maximum cardinality
Comments
There are no comments.More in Technical Questions:
Programming
Copyright ©CuriousTab. All rights reserved.