12th D September 2018 DBMS , SQL and Boolean Algebra

                               
                               Q.No. -5 DBMS , SQL( 02+ 04+02 = 08 marks)

                              Q. Q.No. 6 Boolean Algebra (02 + 01 + 02 + 03=08 marks)

Video: Sql questions board paper pattern: Click Here

Q.No.-5 Databases and SQL

Data base Concepts: Introduction to data base concepts and its need.

 Relational data model: Concept of domain, tuple, relation, key, primary key, alternate key, candidate key;

 Relational algebra : Selection, Projection, Union and Cartesian product;

 Structured Query Language:

 General Concepts: Advantages of using SQL, Data Definition Language and Data Manipulation Language;

 Data Types: NUMBER/DECIMAL, CHARACTER/VARCHAR/VARCHAR2, DATE;

 SQL COMMANDS: CREATE TABLE, DROP TABLE, ALTER TABLE, UPDATE ….SET…., INSERT, DELETE; SELECT, DISTINCT, FROM, WHERE, IN, BETWEEN, GROUP BY, HAVING, ORDER BY;

 SQL functions: SUM ( ), AVG ( ), COUNT ( ), MAX ( ) AND MIN ( ); Obtaining results (SELECT query) from 2 tables using equi-join, Cartesian product and Union

 Note: Implementation of the above mentioned commands could be done on any SQL supported software on one or two tables.

a) Writing sql query  with the help description, refering Table1  and Table2  - 1 mark
b) Writing sql query  with the help description, refering Table1  and Table2  - 1 mark
c) Writing sql query  with the help description, refering Table1  and Table2  - 1 mark
d) Writing sql query  with the help description, refering Table1  and Table2  - 1 mark

e) Writing Output for the sql query, refering Table1 and Table2 -   ½ mark
f) Writing Output for the sql query, refering Table1 and Table2 -   ½ mark
g) Writing Output for the sql query, refering Table1 and Table2 -   ½ mark
h) Writing Output for the sql query, refering Table1 and Table2 -   ½ mark

 Two Table General Syntax and Example:

SELECT  T2C,  T1C,  FROM  TABLE2  T2,  TABLE1 T1 WHERE T2..PKEY=T1..FKEY  CONDITION

EXAMPLE:
SELECT NAME, DEPARTMENT FROM EMPLOYEE E, DEPT D WHERE E.DCODE=D.DCODE AMD ENO<1003;      (OD. 2015)

SELECT  PNAME, SNAME FROM PRODUCTS P , SUPPLIERS S WHERE P.SUPCODE=S.SUPCODE AND QTY>100;  (OD 2013

Q.No. 6  Boolean Algebra (8 marks)

1) Boolean Circuit to Expression/Expression to Circuit : 2 marks

2)  Writing SOP / POS Expression (3 variables):1 marks

3)  Boolean Laws(18) verification (truth table /Laws): 2 marks

4)  K-Map SOP/ POS simplifying expression: 3 marks

Boolean Algebra

Role of Logical Operations in Computing.

 Binary-valued Quantities, Boolean Variable, Boolean Constant and Boolean Operators: AND, OR, NOT;

 Truth Tables; Closure Property, Commutative Law, Associative Law, Identity law, Inverse Law, Principle of Duality, Idempotent Law, Distributive Law, Absorption Law, Involution Law, DeMorgan’s Law and their applications;

 Obtaining Sum of Product (SOP) and Product of Sum (POS) form the Truth Table, Reducing Boolean Expression (SOP and POS) to its minimal form, Use of Karnaugh Map for minimization of Boolean expressions (up to 4 variables);

 Application of Boolean Logic: Digital electronic circuit design using basic Logic Gates (NOT, AND, OR, NAND, NOR)

                Use of Boolean operators (NOT, AND, OR) in SQL SELECT statements

            Use of Boolean operators (AND, OR) in search engine queries.