Загрузка...

GATE CS 2020 | Question: 13 Consider a relational database containing the following schemas.

GATE CS 2020 | Question: 13
Consider a relational database containing the following schemas.
The primary key of each table is indicated by underlining the constituent fields.
SELECT s.sno, s.sname
FROM Suppliers s, Catalogue c
WHERE s.sno=c.sno AND
cost (SELECT AVG (cost)
    FROM Catalogue
   WHERE pno = ‘P4’
   GROUP BY pno) ;
The number of rows returned by the above SQL query is
(A) 4 (B) 5 (C)0 (D)2

Ans : (A) 4

⏰ Time stamp
➡️ 0:00 Question
➡️ 0:37 Solution

My Other Youtube Channel https://www.youtube.com/@monafitc https://www.youtube.com/@monalisapradhan16
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 #sql @monafitc​

Видео GATE CS 2020 | Question: 13 Consider a relational database containing the following schemas. канала Monalisa CS
Комментарии отсутствуют
Зарегистрируйтесь или войдите с
Информация о видео
15 ч. 34 мин. назад
00:02:47
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 CS 2021 Set 1 | Question: 33 Consider the relation R(P , Q , S , T , X , Y , Z , W) with theGATE CS 2021 Set 1 | Question: 33 Consider the relation R(P , Q , S , T , X , Y , Z , W) with the

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 2025 | Set 1 | Question: 25 The height of any rooted tree is defined as the maximum numberGATE CS 2025 | Set 1 | Question: 25 The height of any rooted tree is defined as the maximum number

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

Ch 3.2 : Basic Types , Schema Definition (create table command) | DBMS lectures by @MonalisaCS​Ch 3.2 : Basic Types , Schema Definition (create table command) | DBMS lectures by @MonalisaCS​

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

GATE CS 2016 Set 2 | Question: 52 Consider the following database table named water_schemes:GATE CS 2016 Set 2 | Question: 52 Consider the following database table named water_schemes:

GATE CS 2025 | Set 2 | Question: 14 Which ONE of the following languages is accepted by aGATE CS 2025 | Set 2 | Question: 14 Which ONE of the following languages is accepted by a

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 2017 Set 2 | Question: 17 An ER model of a database consists of entity types A and B.GATE CS 2017 Set 2 | Question: 17 An ER model of a database consists of entity types A and B.

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(𝛽)) ?

Ch 7.6 : Rod-Cutting problem | Dynamic ProgrammingCh 7.6 : Rod-Cutting problem | Dynamic Programming

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

Яндекс.Метрика
© 2008-2026 «Информационно-развлекательный портал города Верхняя Салда»
salda.ws@mail.ru salda_ws Контакты Карта портала Сообщить об ошибке Соглашения Пользовательское соглашение Соглашение о конфиденциальности Согласие на обработку персональных данных Информация для правообладателей Об использовании Cookies
Все заметки Новая заметка Страницу в заметки
Страницу в закладки Мои закладки
На информационно-развлекательном портале SALDA.WS применяются cookie-файлы. Нажимая кнопку Принять, вы подтверждаете свое согласие на их использование.
О CookiesНапомнить позжеПринять