Загрузка...
Все видеоНовые видеоПопулярные видео

Ch 1.12 : Reduction of ER Diagram into Relational Schemas part 2 | DBMS by @MonalisaCS ​

In this lecture i discussed Reduction of ER Diagram into Relational Schemas

Time stamp
0:00 intro & Revision
0:15 Representation of Weak Entity Sets
1:57 Representation of Relationship Sets

Get Lecture notes at https://monalisacs.com/

---------------------------------------------------
📗👩‍🏫DBMS Lecture for GATE CS : https://www.youtube.com/playlist?list=PL767-rEuXhcPyNdorURDlzlFIU5lRrAWS
❓🙋‍♀️DBMS GATE PYQ : https://www.youtube.com/playlist?list=PL767-rEuXhcPgY-cyY8roELrZ-8fAzj8p
----------------------------------------------------
📗👩‍🏫Math Lecture for GATE CS : https://www.youtube.com/playlist?list=PL767-rEuXhcO4TP5PwNCYvxxRZUEQWNdP
❓🙋‍♀️Math GATE PYQ : https://youtube.com/playlist?list=PL767-rEuXhcNHqc2QrjTWNLpFf8mKYnSJ
----------------------------------------------
❓🙋‍♀️GATE General Aptitude (GA) solved by Monalisa https://www.youtube.com/playlist?list=PL767-rEuXhcN9fgYnXz--m4uwJiEi66td
----------------------------------------------------------------
📘👩‍🏫Algorithm Lectures :https://www.youtube.com/playlist?list=PL767-rEuXhcNz3RzupBowAjH2VIxCiY4z
❓🙋‍♀️Algorithm GATE PYQ: https://www.youtube.com/playlist?list=PL767-rEuXhcPvbsxbBWbDSlRZ4e6kAVve
----------------------------------------------------------------
📙👩‍🏫Compiler Design Lectures :https://youtube.com/playlist?list=PL767-rEuXhcOgCrFXRxyvfO_4INJET0f0
❓🙋‍♀️Compiler Design PYQ :https://youtube.com/playlist?list=PL767-rEuXhcOVm9ABkyap0uSyjFz6c5cS
----------------------------------------------------------------------
📔👩‍🏫Theory Of Computation Lectures : https://youtube.com/playlist?list=PL767-rEuXhcPQWMuHXOCZzj5PqF9YBVZt
❓🙋‍♀️TOC GATE PYQ: https://youtube.com/playlist?list=PL767-rEuXhcN7sn9TCRxhmvDpG7RLT3UK
-------------------------------------------------------------------
📒👩‍🏫Data Structure Lecture: https://youtube.com/playlist?list=PL767-rEuXhcMiMbX4IU_oqWshY6z8Rc7j
❓🙋‍♀️Data Structure PYQ: https://youtube.com/playlist?list=PL767-rEuXhcOWUPgW1RrIkUKAle1YBdh1
-----------------------------------------------------------------------
#gate #gate_cs #gateexam #gateda #gatedatascience #gatecse #gatecs #dbms #database #datascience #datawarehouse #ermodel

Видео Ch 1.12 : Reduction of ER Diagram into Relational Schemas part 2 | DBMS by @MonalisaCS ​ канала Monalisa CS
Комментарии отсутствуют
Информация о видео
23 июня 2025 г. 18:37:52
00:10:07
Monalisa CS
Правообладателям
Жалоба на материал Недопустимый материал Нарушение авторских прав
Комментарии
Поделиться
Другие видео канала

GATE CS 2013 | Question: 24 Consider an undirected random graph of eight vertices. The probabilityGATE CS 2013 | Question: 24 Consider an undirected random graph of eight vertices. The probability

GATE IT 2008 | Question: 28 Consider the following Hasse diagrams.Which all of the above representGATE IT 2008 | Question: 28 Consider the following Hasse diagrams.Which all of the above represent

Ch 1.3 : Relationship Sets |DBMS lectures by @MonalisaCS​Ch 1.3 : Relationship Sets |DBMS lectures by @MonalisaCS​

GATE CS 2022 | Question: 40 The following simple undirected graph is referred to as the PetersonGATE CS 2022 | Question: 40 The following simple undirected graph is referred to as the Peterson

Ch 4.7.0 Generating Functions part 1 | Combinatorics Lecture by @MonalisaCSCh 4.7.0 Generating Functions part 1 | Combinatorics Lecture by @MonalisaCS

GATE CS 2017 Set 1 | Question: 47 The number of integers between 1 and 500 (both inclusive) that areGATE CS 2017 Set 1 | Question: 47 The number of integers between 1 and 500 (both inclusive) that are

Ch 4.6.0 Recurrence Relations | Fibonacci Numbers |Tower of Hanoi Combinatorics by @MonalisaCSCh 4.6.0 Recurrence Relations | Fibonacci Numbers |Tower of Hanoi Combinatorics by @MonalisaCS

GATE CS 2012 |Question: 37 How many onto (or surjective) functions are there from an n-element (n≥2)GATE CS 2012 |Question: 37 How many onto (or surjective) functions are there from an n-element (n≥2)

GATE CS 2024 | Set 2 | Question: 55 Consider the following augmented grammar, which is to be parsedGATE CS 2024 | Set 2 | Question: 55 Consider the following augmented grammar, which is to be parsed

GATE CS 2015 Set 1 | Question: 49 Let an represent the number of bit strings of length n containingGATE CS 2015 Set 1 | Question: 49 Let an represent the number of bit strings of length n containing

Ch 2.2.1: Set Identities | Set Operations | Set TheoryCh 2.2.1: Set Identities | Set Operations | Set Theory

GATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's followedGATE CS 2017 Set 1 | Q 48: Let A be an array of 31 numbers consisting of a sequence of 0's followed

GATE DA 2024| Question: 18 Consider the following tree traversals on a full binary tree:(i) PreorderGATE DA 2024| Question: 18 Consider the following tree traversals on a full binary tree:(i) Preorder

Ch 3.2.1 : Incidence Matrices | Isomorphism of Graphs | Graph Lectures by @MonalisaCSCh 3.2.1 : Incidence Matrices | Isomorphism of Graphs | Graph Lectures by @MonalisaCS

GATE CS 2016,Set-2|Q 11:Breadth First Search (BFS) is started on a binary tree beginning from theGATE CS 2016,Set-2|Q 11:Breadth First Search (BFS) is started on a binary tree beginning from the

GATE CS 2013 | Q47: Which one of the following is NOT logically equivalent to ¬∃x(∀y(∝)∧∀z(𝛽)) ?GATE CS 2013 | Q47: Which one of the following is NOT logically equivalent to ¬∃x(∀y(∝)∧∀z(𝛽)) ?

GATE DA 2024| Question: 20 Consider sorting the following array of integers in ascending order usingGATE DA 2024| Question: 20 Consider sorting the following array of integers in ascending order using

GATE CS 2016 Set 1|Q28 : A function f:N+→N+ , defined on the set of positive integers N+, satisfiesGATE CS 2016 Set 1|Q28 : A function f:N+→N+ , defined on the set of positive integers N+, satisfies

Ch 4.7.1 Generating Functions part 2 | Combinatorics Lecture by @MonalisaCSCh 4.7.1 Generating Functions part 2 | Combinatorics Lecture by @MonalisaCS

Ch 2.3.5: Composition of functions | Set Theory |Discrete Mathematics Lectures by Monalisa PradhanCh 2.3.5: Composition of functions | Set Theory |Discrete Mathematics Lectures by Monalisa Pradhan

GATE CS 2015 Set 2 | Question: 9 The number of divisors of 2100 is ____.GATE CS 2015 Set 2 | Question: 9 The number of divisors of 2100 is ____.

TopArticle.Ru
Статистика портала
Яндекс.Метрика
© 2008-2025 «Информационно-развлекательный портал города Верхняя Салда»
| Карта портала | Контакты | Сообщить об ошибке | Соглашения Пользовательское соглашение Соглашение о конфиденциальности Согласие на обработку персональных данных Информация для правообладателей Об использовании Cookies
salda.ws@mail.ru
Сейчас на сайте: 262 Статистика портала
Страницу в закладки Мои закладки
Все заметки Новая заметка Страницу в заметки

На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.

Об использовании CookiesПринять