Databases (DBMS) for GATE — Complete Playlist

DBMS REVISION IN 15 MIN | HOW TO REVISE SUBJECTS EFFICIENTLY?? | GATE

DBMS Syllabus for GATE | GATE 2023

How to prepare DBMS from my playlist efficiently for gate 2023 | How to get full marks in DBMS

1. DBMS introduction part 1

2. DBMS intro part 2

3. DBMS intro part 3

4. ER model introduction

5. Attributes in ER model

6. introduction to keys

7. types of keys

8. relationships introduction

9. Maximum cardinality

10. minimum cardinality

11. relationship between strong and weak entity type

12. existance dependencies

13. Generalization and specialization

14. 3 questions on genralization and specialization

15. constraints on generalization and specialization

16. Aggregation

17. Relational model introduction

18. concept of keys in relational model

19. Integrity constraints in relational model

20. converting ER model to tables(Entity type and attributes)

21. transforming binary relationships (one to many or many to one)to tables

22. converting binary relationships (one to one) to tables

23. transforming binary relationships (many to many)to tables

24. summary of transforming binary relationships to tables

25. question on conversion of binary relationships to tables

26. question on er model to tables

27. GATE 2004,2005,2008 QUESTION ON CONVERTING ER MODEL TO TABLES

28. GATE 2015 AND 2018 QUESTION ON CONVERTING ER MODEL TO TABLES

29. transforming unary relationships into tables

30. converting generalization or specialization into tables

31. converting aggregation into tables

32. relational algebra intro

33. selection operator in relational algebra

34. projection operator in relational algebra

35. union operator in relational algebra

36. set difference operator in relational algebra

37. cartesian product operator in relational algebra

38. queries using cartesian product

39. query explaining renaming operator

40. more queries explaining renaming operator

41. optimizing queries using renaming operator

42. how to find largest and smallest in relational algebra

43. important queries on cartesian product

44. how to find greater than least and lesser than greatest

45. intersection operator in relational algebra

46. types of joins in relational algebra

47. natural join in relational algebra

48. queries on natural join

49. Semi and anti join in relational algebra

49.1 outer join in relational algebra

50. Division operator in relational algebra

51. queries on division operator

52. null in relational algebra

53. modification of database in relational algebra

55. gate 1999 question on relational algebra

54. gate 1998 question on relational algebra

57. gate 2004 question on relational algebra

56. gate 2007 question on relational algebra

58. gate 2004 question 2 on relational algebra

59. gate 2007 question 2 on relational algebra

60. gate 2007 question on relational algebra

62. gate 2008 question on relational algebra

61. gate 2014 question on relational algebra

63. gate 2012 question on relational algebra

64. gate 2017 question on relational algebra

65. minimum and maximum tuples in natural join

66. gate 2018 question on relational algebra

67. Introduction to tuple calculus

68. join in tuple calculus

69. Gate 2007 question on tuple calculus

70. Gate 2001 question on tuple calculus

71. Difference between for all and their exists quantifier

72. Gate 2009 question on tuple calculus

73. intro to domain relational calculus

74. Gate 2013 question on domain calculus

75. Introduction to SQL

76. INTRO TO SET OPERATORS UNION INTERSECTION AND MINUS

77. IN SOME ALL set operation in SQL

78. finding greatest and least using ALL operator

79. Few queries on IN operator

80. CONTAINS set operation in SQL

81. EXISTS AND NOT EXISTS set operation in SQL

82. unique set operation in SQL

83. Gate 2003 question on SQL

84. Gate 2006 question on SQL

85. gate 2007 question on SQL

86. gate 2011 question on SQL

87. Gate 2012 question on SQL

88. Gate 2014 question on SQL

89. SORTING TUPLES IN OUTPUT OF SQL QUERY

90. aggregate functions in SQL

91. GROUP BY clause in SQL

92. important points about GROUP BY clause

93. important query on GROUP BY clause

93.1. GATE 2015 QUESTION ON SQL

94. HAVING clause in SQL

94.1. having clause part 2

95. having and where clause difference

96. GATE 2005 QUESTION ON SQL

97. HANDLING NULL IN SQL

98. pattern matching in sql

99. handling duplicate values in SQL

100. handling empty subquery in SQL

101. complex query in SQL

102. GATE 2016 question on SQL

103. JOINS in sql

104. modification of database

104.1. GATE 2004 QUESTION ON SQL

105. views in sql

107.1 GATE 1999 QUESTION ON SQL

107. create command in sql

106. truncate and drop command in sql

108. on delete cascade

108.1 GATE 2005 and 2017 QUESTION ON SQL

109. alter command in sql

110. grant and revoke

111. intro to normalization

112. functional dependency

113. TYPES OF FD

113.1. gate 2000 and 2002 questions on FD

114. ARMSTRONG AXIOMS

115. CLOSURE

115.1 gate 2005 question on closure

116. TYPES OF KEYS

118. NUMBER OF SUPER KEYS

119. PRIME VS NON PRIME

120. HOW TO FIND HIGHEST NORMAL FORM

121. first normal form

122. second normal form

123. HOW TO DECOMPOSE TILL 2 NF

124. third normal form

125. gate questions on normal forms

126. why third normal form is adequate

127. how to check decomposition is lossy or lossless

128. how to check FDs are preserved in decomposition

129. gate 2008 and 2019 questions on good decomposition

130. Is 3 NF perfect

131. BCNF

132. IMPORTANT POINTS ABOUT NORMAL FORMS

133. COVER

134. gate 2017 question on cover

135. WHY BCNF IS NOT PERFECT NORMAL FORM

136. 4th normal form

137. gate 2007 question on MVD

138. 5th normal form

139. introduction to transactions

140. concept of read and write item

141. few terms in transactions

142. acid properties

143. why concurrency control is needed

144. schedule

145. Types of schedules and intro to serial schedule

146. serializable schedule

146.1 gate 1999,2004,2005 question on serializablity

146.2 gate 2012 question on serializablity

147. conflict equivalent schedule

147.1 gate 2008 question on conflict equivalent schedules

148. conflict serializability

148.1 number of conflict serializable schedules (GATE 2017)

149. how to check conflict serializability

150. why concurrency control techniques are based on conflict serilaizability

151. why concept of view serializability

152. view equivalent schedules

153. view serializability

154. how to check view serializability

155. recoverable schedule

155.1 gate 2016 question on recoverability

155.2 gate 2014 question on conflict serializablity and recoverability

156. cascadeless schedule

157. strict schedule

158. relationship between schedules

159. Introduction to lock based techniques| #Concurrency Control Technique in #Transaction

160. 2 phase locking (2pl)

161. Drawbacks in 2 Phase Locking(2PL) Protocol with examples | Concurrency Control | DBMS

162.1 gate 2007 question on strict 2PL

162. Basic 2PL ,Conservative 2PL ,Strict 2PL and Rigorous 2PL in DBMS | 2 Phase Locking in DBMS

163. timestamp ordering protocol introduction

164. basic timestamp ordering protocol

165. THOMAS WRITE RULE

166. relationship between timestamp ordering and 2pl

167. total, strict, multi version timestamp ordering protocol

168. deadlock handling in transactions

168.1 gate 2017 question on deadlocks

168.2 gate 2016 question on deadlocks

169. optimistic concurrency control technique

170. log based recovery

170.1 gate 2006 question on recovery

171. checkpoints in log based recovery

171.1 gate 2015 question on checkpoints

172. introduction and few numerical on hard disk

173. spanned vs unspanned strategy

174. pile or heap file organization

175. sequential file organization

176. indexed sequential file organization

177. types of indexes

178. primary indexing

179. numerical on primary indexing

180. clustered indexing

181. numerical on clustered indexing

182. secondary indexing

183. numerical on secondary indexing

184. summary of indexing

185. gate 2008 question on indexing

186. multi level indexing

187. why dynamic multi level indexing

188. B-tree introduction

189. numerical on B tree

190. b tree insertion

191. deletion in b tree

192. b+ tree

193. numerical on B+ tree

194. b+ tree insertion

195. b+ tree deletion

196. gate 2005 question on b+ tree

197. gate questions on order of B+ tree

198. gate 2009 question on B+ tree

199. gate 2010 question on B+ tree

200. gate 2015 question on b+ tree

201. gate 2007 question on B+ tree

202. GATE 2020 b+ TREE question

203. gate 2005 question on nested loop join

DBMS completed