1. For the query, 'SELECT stud _ name, COUNT(courseID AS numCourses FROM studentDetails stud name numCourses >2;' Select the correct statement. (a) WHERE, IN (b) GROUP BY, WHERE (c) GROUP BY, IN (d) GROUP BY, HAVING 2. What is the output of the following C program? #include int main (int arg, char* argc []) { int x = 280; char* ptr p = (char*) &x;
I NEED ONLY CORRECT OPTION NO NEED TO EXPLAIN IN DEPTH,PLEASE SOLVE ALL THE QUESTION, DON'T LEAVE ANY QUESTION AND IF YOU DON'T KNOW THE CORRECT ANSWER THEN PLEASE LEAVE IT OTHERWISE I WILL DOWNVOTE IT....
1. For the query,
'SELECT stud _ name, COUNT(courseID AS numCourses FROM studentDetails
stud name
numCourses >2;'
Select the correct statement.
(a) WHERE, IN
(b) GROUP BY, WHERE
(c) GROUP BY, IN
(d) GROUP BY, HAVING
2. What is the output of the following C
#include <stdio.h>
int main (int arg, char* argc [])
{
int x = 280;
char* ptr p = (char*) &x;
printf ("8d\n", * ptr p);
return 0;
a) 24
b) 280
c) 0
d) Compilation error
3. What are the smallest and largest signed x-bit numbers?
a. -(2*-1)and +(2°-1)
b. -(25-1)and +(24-1-1)
c. -(2X-1)and +(2°-1)
d. -(2x-1-1)and +(2x-1)
4. What will be the output of the following code snippet:
from datetime import datetime as dt
date1='23/09/2019'
x=dt. strptime (datel, '8d/&m/§Y')
Answer Choices:
a) 23/09/2019
b) 09/23/2019 00:00:00
c) 2019-09-23 00:00:00
d) 2019-09-23
5. What is the time complexity when Floyd-Warshall
V is the set of vertices and E is the set of edges of a graph G (V, E).
Answer Choices:
a) O(E log V)
b) O(VE log V)
c) O(V?E)
d) O(V3)
Trending now
This is a popular solution!
Step by step
Solved in 3 steps
