What conclusion will you make based on the obtained value in the given part?
Options :
6406532578982. There is a positive linear relationship between the variables X and Y .
6406532578983. There is a negative linear relationship between the variables X and Y .
6406532578984. There is no linear relationship between the variables X and Y.
6406532578985. We cannot conclude anything.
DBMS
Section Id : 64065353292
Section Number : 6
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 14
Number of Questions to be attempted : 14
Section Marks : 50
Display Number Panel : Yes
Section Negative Marks : 0
Group All Questions : No
Enable Mark as Answered Mark for Review and
Yes
Clear Response :
Maximum Instruction Time : 0
Sub-Section Number : 1
Sub-Section Id : 640653112793
Question Shuffling Allowed : No
Is Section Default? : null
Question Number : 91 Question Id : 640653771092 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 0
Question Label : Multiple Choice Question
THIS IS QUESTION PAPER FOR THE SUBJECT "DIPLOMA LEVEL : DATABASE MANAGEMENT
SYSTEMS (COMPUTER BASED EXAM)"
ARE YOU SURE YOU HAVE TO WRITE EXAM FOR THIS SUBJECT?
CROSS CHECK YOUR HALL TICKET TO CONFIRM THE SUBJECTS TO BE WRITTEN.
(IF IT IS NOT THE CORRECT SUBJECT, PLS CHECK THE SECTION AT THE TOP FOR THE SUBJECTS
REGISTERED BY YOU)
Options :
6406532578986. YES
6406532578987. NO
Sub-Section Number : 2
Sub-Section Id : 640653112794
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 92 Question Id : 640653771093 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Let P and Q be two relations. Let D(P) be a decomposition of P based on a set M of functional
dependencies. Let D(Q) be a decomposition of Q based on a set N of functional dependencies. It is
known that one among D(P) and D(Q) is in 3NF and the other is in 2NF. In order to correctly classify
D(P) and D(Q) as being in 3NF or 2NF,what is the MINIMAL test needed?
Options :
6406532578988. Test whether both are in 3NF
6406532578989. Test whether both are in 2NF
6406532578990. Test whether one of them is in 2NF
6406532578991. Test whether one of them is in 3NF
Question Number : 93 Question Id : 640653771094 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3
Question Label : Multiple Choice Question
Options :
6406532578992. Maximum= 60, Minimum= 0
6406532578993. Maximum= 100, Minimum= 60
6406532578994. Maximum= 100, Minimum= 0
6406532578995. Maximum= 60, Minimum= 40
Sub-Section Number : 3
Sub-Section Id : 640653112795
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 94 Question Id : 640653771095 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Options :
6406532578996. X: c2, Y: d1, P: b2, Q: c2
6406532578997. X: c2, Y: d2, P: b2, Q: c2
6406532578998. X: c1, Y: d1, P: b1, Q: c1
6406532578999. X: c2, Y: d1, P: b1, Q: c1
Sub-Section Number : 4
Sub-Section Id : 640653112796
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 95 Question Id : 640653771096 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Max. Selectable Options : 0
Question Label : Multiple Select Question
Consider the following table:
Which of the following functional dependencies hold on the Cars table instance?
Options :
6406532579000.
6406532579001.
6406532579002.
6406532579003.
Question Number : 96 Question Id : 640653771099 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :
6406532579012.
6406532579013.
6406532579014.
6406532579015.
Sub-Section Number : 5
Sub-Section Id : 640653112797
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 97 Question Id : 640653771097 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Options :
6406532579004.
6406532579005.
6406532579006.
6406532579007.
Question Number : 98 Question Id : 640653771098 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4 Max. Selectable Options : 0
Question Label : Multiple Select Question
Consider the Binary Search Tree (BST) shown in figure 1
Which of the following is/are the correct insertion order that will result in the given BST?
Options :
6406532579008. 46,71,21,11,35,26,16,82,93,59,65,41,51
6406532579009. 46,71,21,11,26,35,82,93,16,59,65,41,51
6406532579010. 46,21,71,35,11,26,16,82,93,59,65,41,51
6406532579011. 46,21,71,35,11,16,26,82,93,41,65,59,51
Sub-Section Number : 6
Sub-Section Id : 640653112798
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 99 Question Id : 640653771100 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 2
Question Label : Short Answer Question
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
Sub-Section Number : 7
Sub-Section Id : 640653112799
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 100 Question Id : 640653771102 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 3
Question Label : Short Answer Question
Consider a disk having 128 tracks per surface, 512 sectors per track and 256 bytes/sector. If the
minimum number of bits required to access a sector is 22, then find out the number of platters
required?
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
32
Sub-Section Number : 8
Sub-Section Id : 640653112800
Question Shuffling Allowed : Yes
Is Section Default? : null
Question Number : 101 Question Id : 640653771101 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
Question Label : Short Answer Question
Consider a string of pending block references in the given order: 4, 5, 2, 5, 3, 4, 2, 5, 3, 4. The
system has a buffer with 3 slots. Assume that initially the buffer is empty. If LRU buffer
replacement policy is used, then how many misses will occur while referencing all the requested
blocks ?
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
Question Number : 102 Question Id : 640653771103 Question Type : SA Calculator : None
Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Correct Marks : 4
Question Label : Short Answer Question
Response Type : Numeric
Evaluation Required For SA : Yes
Show Word Count : Yes
Answers Type : Equal
Text Areas : PlainText
Possible Answers :
10
Sub-Section Number : 9
Sub-Section Id : 640653112801
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653771104 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (103 to 104)
Question Label : Comprehension
Sub questions
Question Number : 103 Question Id : 640653771105 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Which of the following will be a lossless join decomposition of relation R?
Options :
6406532579020.
6406532579021.
6406532579022.
6406532579023.
Question Number : 104 Question Id : 640653771106 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 2
Question Label : Multiple Choice Question
What is the highest normal form achievable by the given relation?
Options :
6406532579024. 2NF
6406532579025. 1NF
6406532579026. 3NF
6406532579027. BCNF
Sub-Section Number : 10
Sub-Section Id : 640653112802
Question Shuffling Allowed : No
Is Section Default? : null
Question Id : 640653771107 Question Type : COMPREHENSION Sub Question Shuffling
Allowed : No Group Comprehension Questions : No Question Pattern Type : NonMatrix
Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction Time : 0
Question Numbers : (105 to 106)
Question Label : Comprehension
The sports federation FIA has decided to maintain a database of all the drivers, races and budgets
for the 2024 Formula 1 Season. Below is the original database structure designed by FIA:
Based on the above data, answer the given subquestions.
Sub questions
Question Number : 105 Question Id : 640653771108 Question Type : MSQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 3 Max. Selectable Options : 0
Question Label : Multiple Select Question
Which of the following functional dependencies violate the condition for the given relation to be in
2 NF?
Options :
6406532579028.
6406532579029.
6406532579030.
6406532579031.
Question Number : 106 Question Id : 640653771109 Question Type : MCQ Is Question
Mandatory : No Calculator : None Response Time : N.A Think Time : N.A Minimum Instruction
Time : 0
Correct Marks : 4
Question Label : Multiple Choice Question
Which of the following decompositions will help to achieve 2 NF?
Options :
6406532579032.
6406532579033.
6406532579034.
6406532579035.
PDSA
Section Id : 64065353293
Section Number : 7
Section type : Online
Mandatory or Optional : Mandatory
Number of Questions : 17
Number of Questions to be attempted : 17
Section Marks : 50
Display Number Panel : Yes
