Hello Learners, In this Post, you will find NPTEL Data Base Management System Assignment 4 Week 4 Answers 2023. All the Answers are provided below to help the students as a reference don’t straight away look for the solutions.
NPTEL Data Base Management System Assignment 5 Answers Join Group👇
Note: First try to solve the questions by yourself. If you find any difficulty, then look for the solutions.
| COURSE NAME | ANSWER |
| NPTEL Data Base Management System Assignment 1 Answers | Click Here |
| NPTEL Data Base Management System Assignment 2 Answers | Click Here |
| NPTEL Data Base Management System Assignment 3 Answers | Click Here |
| NPTEL Data Base Management System Assignment 4 Answers | Click Here |
| NPTEL Data Base Management System Assignment 5 Answers | Click Here |
| NPTEL Data Base Management System Assignment 6 Answers | Click Here |
| NPTEL Data Base Management System Assignment 7 Answers | Click Here |
| NPTEL Data Base Management System Assignment 8 Answers | Click Here |
NPTEL Data Base Management System Assignment 4 Answers 2023:
We are updating answers soon Join Group for update: CLICK HERE
Q.1. Consider the relational schema Course Assignments (Assignment No, QNo, Topic, Marks, QType) with the following Functional Dependencies : Assignment No → Topic Topic {Topic, QNo} → QType Which of the following is not a prime attribute of Course Assignments? (Marks, AssignmentNo}
Q.2. Consider the relational schema FileRepo (RepoName, FileNo, IndexNo, AdminID, FileCount) with the following functional dependencies : RepoName→{AdminID, FileNo} FileCount {RepoName, IndexNo} Which of the following decomposition of FileRepo is lossless?
- a) FileRepo1 (RepoName, FileNo), FileRepo2 (IndexNo, Admin ID, FileCount)
- b) FileRepo1 (RepoName, FileNo), FileRepo2 (FileNo, AdminID, FileCount)
- c) FileRepo1 (RepoName, FileCount), FileRepo2 (FileNo, IndexNo, AdminID, FileCount)
- d) FileRepo1 (RepoName, AdminID), FileRepo2 (FileNo, IndexNo, AdminID, FileCount)
Q.3. Consider the relational schema Course Assignments (Assignment No, QNo, Topic, Marks, QType) with the following Functional Dependency set : F={ QNo {Topic, AssignmentNo} Topic {Topic, QNo} → QType (Marks, AssignmentNo} } What is the canonical cover of F?
- Answer: D
NPTEL Data Base Management System Assignment 5 Answers Join Group👇
Q.4. Consider the relational schema Game Repo (Game Name, Game Type, Developer, PlayedBy) with the following Functional Dependency GameName, GameType → Developer GameTypePlayedBy Developer Game Name Identify the possible number of superkeys of GameRepo.
Q.5. Consider the relation Fig (FNo, Page, Colored, Dimensions) with the following Functional De pendencies : FD1 : FNo, Page → Colored FD2 : Colored → Dimensions FD3 : Dimensions → FNo If Fig is decomposed into Fig1 (FNo, Page, Colored) and Fig2 (Colored, Dimensions), which of the following options is (are) true?
- a) The decomposition is both lossless and dependency preserving.
- b) The decomposition is lossless but not dependency preserving.
- c) The decomposition neither lossless nor dependency preserving.
- d) The decomposition is not lossless but is dependency preserving.
Q.6. Consider the relational schema Game Repo (Game Name, GameType, Developer, PlayedBy) with the following Functional Dependency GameName, GameType → Developer GameType → PlayedBy Developer Game Name What is the highest Normal form of GameRepo?
- a) INF
- b) 2NF
- c) 3NF
- d) BCNF
Q.7. Consider the relation Fig (FNo, Page, Colored, Dimensions) with the following Functional De pendencies : FD1 : FNo, Page → Colored FD2 : Colored → Dimensions FD3 : Dimensions → FNo Which of the following is true?
- a) Fig has 1 candidate keys and is in 1NF
- b) Fig has 2 candidate keys and is in 2NF
- c) Fig has 3 candidate keys and is in 3NF
- d) Fig has 2 candidate keys and is in BCNF
NPTEL Data Base Management System Week 4 Answers Join Group👇
CLICK HERE
Q.8. Consider the instance of the relation Food (DishName, Price, Restaurant) :
Which of the following Functional Dependencies hold true on Food as can be found in the given instance?
- a) (DishName, Price} → Restaurant
- b) {Restaurant, Price} → DishName
- c) {Restaurant, DishName} → Price
- d) Restaurant → {Price, DishName}
Q.9. Consider the instance of the relation Food (DishName, Price, Restaurant) :
If a new tuple {Risotto, 250, ItaliYum} is inserted to the given instance of Food, which of the following can not be a possible candidate key of Food?
- a) {DishName, Price}
- b) {Restaurant, Price}
- c) {Restaurant, DishName}
- d) {DishName, Price, Restaurant}
Q.10. Consider the following relation : ClothesShop (ClothType, CColor, Designer, Shop ID) with the following functional dependencies : FD1 : ClothType → CColor FD2 : {Designer, CColor} → ShopID According to the rule of pseudo-transitivity, which of the following functional dependencies can be derived?
- a) CColor ShopID
- b) {ClothType, CColor} → Shop ID
- c) {ClothType, Designer} → Shop ID
- d) ClothType → ShopID
NPTEL Data Base Management System Assignment 4 Answers Join Group👇
Disclaimer: This answer is provided by us only for discussion purpose if any answer will be getting wrong don’t blame us. If any doubt or suggestions regarding any question kindly comment. The solution is provided by Brokenprogrammers. This tutorial is only for Discussion and Learning purpose.
About NPTEL Data Base Management System Course:
Databases form the backbone of all major applications today – tightly or loosely coupled, intranet or internet based, financial, social, administrative, and so on. Structured Database Management Systems (DBMS) based on relational and other models have long formed the basis for such databases. Consequently, Oracle, Microsoft SQL Server, Sybase etc. have emerged as leading commercial systems while MySQL, PostgreSQL etc. lead in open source and free domain.
Course Layout:
- Week 1:Course Overview. Introduction to RDBMS
- Week 2:Structured Query Language (SQL)
- Week 3:Relational Algebra. Entity-Relationship Model
- Week 4:Relational Database Design
- Week 5:Application Development. Case Studies. Storage and File Structure
- Week 6:Indexing and Hashing. Query Processing
- Week 7: Query Optimization. Transactions (Serializability and Recoverability)
- Week 8:Concurrency Control. Recovery Systems. Course Summarization.
CRITERIA TO GET A CERTIFICATE:
Average assignment score = 25% of average of best 8 assignments out of the total 12 assignments given in the course.
Exam score = 75% of the proctored certification exam score out of 100
Final score = Average assignment score + Exam score
YOU WILL BE ELIGIBLE FOR A CERTIFICATE ONLY IF AVERAGE ASSIGNMENT SCORE >=10/25 AND EXAM SCORE >= 30/75. If one of the 2 criteria is not met, you will not get the certificate even if the Final score >= 40/100.
If you have not registered for exam kindly register Through https://examform.nptel.ac.in/
