Page 372 - C++
P. 372

CBSE AISSCE 2017-2018 Marking Scheme for Computer Science
                                       (2018-2019 Sub Code: 083       Paper Code: 91)

                          (½ Mark for correct output)
                          NOTE: Values may be written in any order
                    (vii)  SELECT ANO, COUNT(*), MIN(AMOUNT) FROM TRANSACT
                          GROUP BY ANO HAVING COUNT(*)> 1;

                    Ans  ANO​   ​COUNT(*)​    ​MIN(AMOUNT)
                          101   2          2500
                          103   2          1000

                          (½ Mark for correct output)
                          NOTE: Values may be written in any order

                   (viii)  SELECT COUNT(*), SUM(AMOUNT) FROM TRANSACT
                          WHERE DOT <= '2017-06-01';

                    Ans  COUNT(*)​   ​SUM(AMOUNT)
                          2          5000

                          (½ Mark for correct output)

               6     (a)   State any one Absorption Law of Boolean Algebra and verify it using truth table.    2

                    Ans  X + X . Y = X
                          Verification:
                                    X                   Y                  X.Y                X+X.Y
                                    0                   0                   0                    0
                                    0                   1                   0                    0

                                    1                   0                   0                    1
                                    1                   1                   1                    1
                          OR
                          X . (X + Y)= X
                          Verification:

                                    X                   Y                  X+Y               X.(X+Y)
                                    0                   0                   0                    0
                                    0                   1                   1                    0
                                    1                   0                   1                    1
                                    1                   1                   1                    1

                          OR
                          X + X’ . Y = X + Y
                          Verification:
                                X             Y            X’          X’.Y        X+X’.Y          X+Y
                                0             0            1             0             0            0
                                0             1            1             1             1            1

                                1             0            0             0             1            1
                                1             1            0             0             1            1
                          OR


                                                        Page #30/35
   367   368   369   370   371   372   373   374   375   376   377