Science (English Medium) Class 12 - CBSE Important Questions for Computer Science (C++)

Write SQL queries for (i) to (iv) and find outputs for SQL queries (v) to (viii), which are based on the tables.

DVD

MEMBER

1) To display all details from the table MEMBER in descending order of ISSUEDATE

2) To display the DCODE and DTITLE of all Folk Type DVDs from the table DVD.

3) To display the DTYPE and number of DVDs in each DTYPE from the table DVD.

4) To display all NAME and ISSUEDATE of those members from the table. MEMBER who have DVDs issued (i.e., ISSUEDATE) in the year 2017

5) SELECT MIN(ISSUEDATE) FROM MEMBER

6) SELECT DISTINCT DTYPE FROM DVD;

7) SELECT D.DCODE, NAME, DTITLE FROM DVD D, MEMBER M WHERE D.DCODE=M.DCODE;

8) SELECT DTITLE FROM DVD WHERE DTYPE NOT IN ("Folk", "Classical" ) ;

Observe the following table carefully and· write the names of the most appropriate columns, which can be considered as (i) candidate keys and. (ii) primary key:

Consider the following DEPT and EMPLOYEE tables. Write SQL queries for (i) to (iv) and find outputs for SQL queries (v) to (viii).

Table: DEPT

Table: EMPLOYEE

Note: DOJ refers to the date of joining ·and DOB refers to the date of Birth of employees

1) To display Eno, Name, Gender from the table EMPLOYEE in ascending order of Eno.

2) To display the Name of all the MALE Employees from the table EMPLOYEE.

3) To display the Eno and Name of those employees from the table EMPLOYEE who are born between '1987-01-01' and '1991-12-01'.

4) To count and display FEMALE employees who have Joined after '1986-01-01'.

5) SELECT COUNT(*), DCODE FROM EMPLOYEE GROUP BY DCODE HAVING COUNT(*)>1;

6) SELECT DISTINCT DEPARTMENT FROM DEPT;

7) SELECT NAME, DEPARTMENT FROM EMPLOYEE E, DEPT D WHERE E.DCODE=D.DCODE AND EN0<1003;

8) SELECT MAX(DOJ), MIN(DOB) FROM EMPLOYEE;

State any one Absorption Law of Boolean Algebra and verily it using truth table.

Draw the Logic Circuit of the following Boolean Expression

(U' + v).(V' + W')

Derive a Canonical POS expression for a Boolean function FN, represented by the following truth truth table:

Reduce the following Boolean Expression to its simplest form using K-Map:

`G(U, V,W, Z) = sum(3,5 , 6 , 7 , 11 , 12 ,13, 15)`

State DeMorgan's Laws of Boolean Algebra and verify them using a truth table.

Draw the Logic Circuit of the following Boolean Expression using only NOR Gates

(A+B).(C+D)

Derive a Canonical POS expression for a Boolean function G, represented by the following truth table:

Reduce the following Boolean Expression to its simplest form using K-Map:

`E (U, V, Z, W) = sum (2, 3 , 6, 8, 9, 10, 11 , 12 , 13 )`

Verify the following using Boolean Laws : U'+V = U'V'+ U' .V + U.V

Draw the Logic Circuit for the following Boolean Expression: (X'+Y).Z + W'

Derive a Canonical POS expression for a Boolean function F, represented by the following truth table

Reduce the following Boolean Expression to its simplest form using K-Map

`F (X, Y, Z, W) = sum (0, 1, 4, 5, 6, 7, 8, 9, 11, 15)`