Register

IIT Madras MS written test 2019 - DBMS

506 views
0 votes
0 votes

Which of the following statements about SQL queries is true?

  1. The GROUP BY clause has nothing to do with Aggregate functions.
  2. The GROUP BY clause can only be used when Aggregate functions are used.
  3. Aggregate functions can only be used when the GROUP BY clause has been used.
  4. The GROUP BY clause can be used even when Aggregate functions are not used.
User Avatar

2 Answers

0 votes
0 votes
iv.

with group by clause , we can use an aggregate function as well as column also on which we have performed grouping  as select statement
User Avatar
0 votes
0 votes
normally GROUP BY clause is used with Aggregate function. However GROUP BY clause can be used without aggregate function also. hence the option IV is correct.
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
SPluto asked May 2, 2019
612 views
IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
User Avatar
0 votes
0 votes
0 answers
2
SPluto asked May 2, 2019
539 views
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
User Avatar
1 votes
1 votes
1 answer
4
SPluto asked May 2, 2019
656 views
IIT Madras MS written test 2019 - C prog.
for(; i != 0; --i) { printf("\nIITM"); --i; } If i is initialized to 100, then IITM will be printed 50 times If i is initialized to 101, then IITM will be printed 51 times Both I and II are true I is true, II is false I is false, II is true Both I and II are false
for(; i != 0; i) { printf("\nIITM"); i; }If i is initialized to 100, then IITM will be printed 50 timesIf i is initialized to 101, then IITM will be printed 51 timesBot...
User Avatar
Link Copied!