DBMS Tutorial Point
In this article, you will get DBMS GATE Questions 2019 with answers. 1. Which one of the following statements is NOT correct about the B+ tree data structure used for creating an index of a relational database table? a. Each leaf node has a pointer to the next leaf nodeb. Non-leaf nodes have pointers to data recordsc. … Read more
In this article you will get DBMS GATE Questions 2020 with answers. 1. Consider a relational database containing the following schema. The primary key of each table is indicated by underlying the constituent fields. SELECT s.sno, s.snameFROM Suppliers s, Catalogue cWHERE s.sno = c.sno ANDCost > (SELECT AVG (cost)FROM CatalogueWHERE pno = ‘P4’GROUP BY pno); The … Read more
1.Which of the following process scheduling algorithm may lead to starvationA.FIFOB.Round RobinC.Shortest Job NextD.None of the aboveAnswer-C If the quantum time of round robin algorithm is very large, then it is equivalent to:(A) First in first out(B) Shortest Job Next(C) Lottery scheduling(D) None of the above Answer: (A) 3.Orders are processed in the sequence they … Read more
What is a long-term scheduler?a) It selects which process has to be brought into the ready queueb) It selects which process has to be executed next and allocates CPUc) It selects which process to remove from memory by swappingd) None of the mentioned Answer: (a) If all processes I/O bound, the ready queue will almost … Read more
A deadlock in DBMS and OS is a condition wherein two or more processes or transactions are waiting for each other in order to be finished but none of the processes or transactions are willing to give up the resources that the other processes need. In this situation, no processes ever get finished and are in the … Read more