Arts (English Medium) इयत्ता १२ - CBSE Important Questions for Computer Science (Python)

Which function is used to display the total number of records from a table in a database?

What will the following expression be evaluated for in Python?

print(15.0 / 4 + (8 + 3.0))

Differentiate between count() and count(*) functions in SQL with appropriate examples.

Write the outputs of the SQL queries based on the relations Teacher and Placement given below:

Table: Teacher

Table: Placement

1. SELECT Department, avg(salary) FROM Teacher GROUP BY Department;
2. SELECT MAX(Date_of_Join), MIN(Date_of_Join) FROM Teacher;
3. SELECT Name, Salary, T.Department, Place FROM Teacher T, Placement P WHERE T.Department = P.Department AND Salary>20000;
4. SELECT Name, Place FROM Teacher T, Placement P WHERE Gender = ’F’ AND T.Department = P.Department;

Write the output of the code given below:

p=5
def sum(q,r=2):
      global p
      p=r+q**2
      print(p, end= '#')

a=10
b=5
sum(a,b)
sum(r=5,q=1)

Predict the output of the code given below:

s="welcome2cs" 

n = len(s)
m=""
for i in range(0, n):
       if (s[i] >= 'a' and s[i] <= 'm'):
            m = m +s[i].upper()
 elif (s[i] >= 'n' and s[i] <= 'z'):
          m = m +s[i-1]
 elif (s[i].isupper()):
     m = m + s[i].lower()
 else:
     m = m +'&'
print(m)

Which function returns the sum of all elements of a list?

What will the following expression be evaluated for in Python?

print (4 + 3 * 5/3 − 5 % 2)

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)`