Updated as on

25-11-2022

SCHEME OF EXAMINATION
B. Tech- 2nd Year Semester: 3th
Branch: Computer Science and Business Systems
Periods per
Scheme of Exam Credit
Subject week Total
S.N. Subject Name L+(T+
Code Theory/Practical Marks
L T P P)/2
ESE CT TA
Formal Language and 100
1 CS112301 2 1 - 20 30 150 4
Automata Theory
Computer Organization 100
2 CS112302 3 0 - 20 30 150 3
and Architecture
Object Oriented 100
3 CS112303 2 1 - 20 30 150 3
Programming

4 Computational Statistics AM112304 3 0 - 100 20 30 150 3

Database Management 100

5 CS112305 3 1 - 20 30 150 3
Systems
Computer Organization
6 CS112391 - - 2 40 - 20 60 1
and Architecture Lab
Object Oriented 40 20
7 CS112392 - -- 2 - 60 1
programming Lab
Computational Statistics - - 2 - 20 60 1
8 CS112393 40
Lab

Database Management 40 20
9 CS112394 - - 2 - 60 1
Systems Lab

10 Indian constitution HM100395 - - - - - 10 10 -

Total 13 3 8 660 100 240 1000 20

Note:

L-Lecture T-Tutorial P-Practical

CT-ClassTest TA-TeachersAssessment ESE-EndSemesterExam

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Formal Language and L= T=0 P=0 Credits =
CS112301 Automata Theory
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

Formal languages and automata theory deals with

the concepts of automata, formal languages,
Grammar, computability and decidability. The
reasons to study Formal Languages and Automata On successful completion of the course, the student will
Theory are Automata Theory provides a simple, be able to:
elegant view of the complex machine that we call a
computer. More precisely, the objectives are: CO1.Design finite automata to accept a set of strings of
 To give an overview of the theoretical a language.
foundations of computer science from the CO2.Determine whether the given language is regular
perspective of formal languages. or not. .
 To illustrate finite state machines to solve CO3.Design context free grammars to generate strings
problems in computing. of context free language.
 To explain the hierarchy of problems arising CO4.Design push down automata and the equivalent
in the computer sciences. context free grammars and Design Turing machine.
 To familiarize Regular grammars, context
frees grammar. CO5.Distinguish between computability and non-
 To solve various problems of applying computability, Decidability and un-decidability.
normal form techniques, push down
automata and Turing Machines

UNIT – I Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky
hierarchy of languages. Regular languages and finite automata: Regular expressions and
languages, deterministic finite automata (DFA) and equivalence with regular expressions,
nondeterministic finite automata (NFA) and equivalence with DFA, regular grammars and
equivalence with finite automata, properties of regular languages, Kleene’s theorem, pumping
lemma for regular languages, Myhill-Nerode theorem and its uses, minimization of finite automata.

UNIT – II Context-free languages and pushdown automata: Context-free grammars (CFG) and
languages (CFL), Chomsky and Greibach normal forms, nondeterministic pushdown automata
(PDA) and equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for context-free
languages, deterministic pushdown automata, closure properties of CFLs. Context-sensitive
languages: Context-sensitive grammars (CSG) and languages, linear bounded automata and
equivalence with CSG.

UNIT – III: Turing machines: The basic model for Turing machines (TM), Turing
recognizable(recursively enumerable) and Turing-decidable (recursive) languages and their closure
properties, variants of Turing machines, nondeterministic TMs and equivalence with deterministic
TMs, unrestricted grammars and equivalence with Turing machines, TMsas enumerators.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 UNIT – IV Undecidability: Church-Turing thesis, universal Turing machine, the universal and
diagonalization languages, reduction between languages and Rice s theorem, undecidable problems
about languages.

UNIT – V: Basic Introduction to Complexity: Introductory ideas on Time complexity of

deterministic and nondeterministic Turing machines, P and NP, NP- completeness, Cook’s Theorem,
other NP -Complete problems.

Text Books:

S. No. Title Author(s) Publisher

John E. Hopcroft,
Introduction to Automata Theory,
1 Rajeev Motwani and Addison-Wesley
Languages, and Computation
Jeffrey D. Ullman.

Reference Books:

S. No. Title Author(s) Publisher

Harry R. Lewis and
Elements of the Theory of
1 Christos H.
Computation
Papadimitriou.
2 Automata and Computability Dexter C. Kozen
Introduction to the Theory of
3 Michael Sipser
Computation

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 COMPUTER
Subject Code
ORGANIZATION & L= T=0 P=0 Credits =
CS112302
ARCHITECHTURE
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

1. Identify the basic hardware components of a

1. To understand the structure, function and computer system.
characteristics of computer systems. 2. Familiarize themselves with binary and
2. To understand the design of the various hexadecimal number systems including
functional units and components of computer arithmetic.
computers. 3. Familiarize themselves with functional units of
3. To identify the elements of modern the processor such as the register file and
instructions sets and their impact on arithmetic logical unit.
processor design. 4. Understand basics functionality of systems:
4. To explain the function of each element of a parallel, pipelined, superscalar and RISC/CISC
memory hierarchy architectures.
5. To identify and compare different methods 5. Represent system design in appropriate formats;
for computer I/O. addressing modes, an instruction sets as per the
system configuration requirements.

UNIT – I Introduction: Basics in Boolean logic and Combinational/Sequential Circuits. Functional

blocks of a computer: CPU, memory, input-output subsystems, control unit. Instruction set
architecture of a CPU: Registers, instruction execution cycle, RTL interpretation of instructions,
addressing modes, instruction set. Outlining instruction sets of some common CPUs. Data
representation: Signed number representation, fixed and floating point representations, character
representation.

UNIT – II Computer arithmetic:Integer addition andsubtraction, ripple carry adder, carry look-ahead
adder, etc. multiplication – shift-and-add,Booth multiplier, carry save multiplier, etc. Division
restoring and non-restoring techniques, floating point arithmetic, IEEE 754 format.

UNIT – III: Introduction to x86 architecture. CPU control unit design: Hardwired and micro-
programmed design approaches, design of a simple hypothetical CPU. Memory system design:
Semiconductor memory technologies, memory organization

UNIT –IV Peripheral devices and their characteristics: Input-output subsystems, I/O
deviceinterface, I/O transfers – program controlled, interrupt driven and DMA, privilegedand non-
privileged instructions, software interrupts and exceptions. Programs andprocesses – role of
interrupts in process state transitions, I/O device interfaces – SCII, USB.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards. Parallel
Processors: Introduction to parallel processors, Concurrent access to memory and cache coherency

UNIT – V: Memory organization: Memory interleaving, concept of hierarchicalmemory

organization, cache memory, cache size vs. block size, mapping functions, replacement algorithms,
write policies.

Text Books:

S. No. Title Author(s) Publisher

Prentice Hall of India,
1 Computer System Architecture M. M. Mano: 3rd ed.,
New Delhi, 1993.

Reference Books:

S. No. Title Author(s) Publisher

Computer Architecture and
1 John P. Hayes.
Organization
Computer Organization and
2 Architecture Designing for William Stallings.
Performance
Computer System Design and Vincent P. Heuring and
3
Architecture Harry F. Jordan

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Object Oriented L= T=0 P=0 Credits =
CS112303 Programming
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

1. Understanding about object oriented At the end of the course, a student will be able to:
programming. 1. Students will understand the concepts of
2. Gain knowledge about the capability to flow of control, abstraction, pointer and
store information together in an object. recursion.
3. Understand the capability of a class to rely 2. Analyse a simple programming problem
upon another class. specification.
4. Learn how to store one object inside another 3. Design a high-level solution to the problem
object and use of one method can be used in using functional abstraction and general
variety of different ways. imperative programming language
5. Create and process data in files using file constructs.
I/O functions. 4. Write, compile, execute and debug a C++
6. Understand about constructors which are program which maps the high-level design
special type of functions. onto concrete C++ programming constructs.
7. Learn how to write code in a way that it is
independent of any particular type.
UNIT – I Introduction: Procedural programming, An Overview of C: Types Operator and
Expressions, Scope and Lifetime, Constants, Pointers, Arrays, and References, Control Flow,
Functions and Program Structure, Namespaces, error handling, Input and Output (C-way), Library
Functions (string, math, stdlib), Command line arguments, Pre-processor directive

UNIT – II Some difference between C and C++: Single line comments, Local variable declaration
within function scope, function declaration, function overloading, stronger type checking, Reference
variable, parameter passing – value vs reference, passing pointer by value or reference, #define
constant vsconst, Operator new and delete, the typecasting operator,Inline Functions in contrast to
macro, default arguments

UNIT – III: The Fundamentals of Object Oriented Programming: Necessity for OOP, Data
Hiding, Data Abstraction, Encapsulation, Procedural Abstraction, Class and Object.
More extensions to C in C++ to provide OOP Facilities: Scope of Class and Scope Resolution
Operator, Member Function of a Class, private, protected and public Access Specifier, this Keyword,
Constructors and Destructors, friend class, error handling (exception)
UNIT –IV Essentials of Object Oriented Programming: Operator overloading, Inheritance –
Single and Multiple, Class Hierarchy, Pointers to Objects, Assignment of an Object to another Object,
Polymorphism through dynamic binding, Virtual Functions, Overloading, overriding and hiding, Error
Handling

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 UNIT – V: Generic Programming: Template concept, class template, function template, template
specialization Input and Output: Streams, Files, Library functions, formatted output

Text Books:

S. No. Title Author(s) Publisher

1 The C++ Programming Language, BjarneStroustrup Addison Wesley
C++ and Object-Oriented
2 Debasish Jana PHI Learning Pvt. Ltd
Programming Paradigm,

Reference Books:

S. No. Title Author(s) Publisher

1 The C++ Programming Language, BjarneStroustrup Addison Wesley

The Design and Evolution of C++,

2 BjarneStroustrup, Addison Wesley.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code
Computational Statistics L= T=0 P=0 Credits =
AM112304
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

 Apply the concepts of probability and CO1 Identify the difference between structured program
distributions to some case studies. Apply and procedureoriented program Remembering
C213.2 Apply the concepts of discrete
probability distributions. Apply CO2 Develop programs for file handling Understanding
 Apply the concepts of continuous
probability distributions. Apply CO3 Implementing the concepts of Exceptions Handling
 Assess the sampling theory and making in programming Applying
inferences. Eval Correlate the material
CO4 Develop applications for a range of problems using
of one unit to the material in other units.
object-oriented programming techniques. Understanding
Understand
 Resolve the potential misconceptions CO5 Apply the concepts of inheritance Applying
and hazards in each topic of study. C215.6 Encapsulation of data in virtual functions.
Remember

UNIT – I Introduction: Multivariate Normal Distribution: Multivariate Normal Distribution

Functions, Conditional Distribution and its relation to regression model, Estimation of parameters.

UNIT – II Discriminant Analysis: Statistical background, linear discriminant function analysis,

Estimating linear discriminant functions and their properties

UNIT – III: Principal Component Analysis: Principal components, Algorithm for conducting
principal component analysis, deciding on how many principal components to retain, H-plot.

UNIT –IV Factor Analysis: Factor analysis model, Extracting common factors, determining number
of factors, Transformation of factor analysis solutions, Factor scores

UNIT – V: Clustering: Introduction, Types of clustering, Correlations and distances, clustering by

partitioning methods, hierarchical clustering, overlapping clustering, K-Means Clustering-Profiling
and Interpreting Clusters

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
Text Books:

S. No. Title Author(s) Publisher

An Introduction to Multivariate
1 T.W. Anderson.
Statistical Analysis
2 Applied Multivariate Data Analysis, Vol I & II, J.D. Jobson.

Reference Books:

S. No. Title Author(s) Publisher

Regression Diagnostics , Identifying

D.A. Belsey, E. Kuh
1 Influential Data and Sources of
R.E. Welsch
Collinearety,
J. Neter, W.
2 Applied Linear Regression Models Wasserman and M.H.
Kutner
3 The Foundations of Factor Analysis, A.S. Mulaik.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Database Management L= T=0 P=0 Credits =
CS112305 Systems
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

1. Be familiar with basic concepts of RDBMS,

Relational data model & be able to write
relational algebra expressions for queries;
 To understand the role of a database 2. Be familiar with basic database storage
management system and its users in an structures and access techniques: file and
organization. page organizations, indexing methods
 To understand database concepts, including including B-tree and hashing;
the structure and operation of the relational 3. Understand DML, DDL and will be able to
data model construct queries using SQL by knowing the
 Can successfully apply logical database importance of data & its requirements in any
design principles, including E-R diagrams application.
and database normalization. 4. Utilize a database modeling technique for a
 Construct simple and moderately advanced single entity class, a one-to-one (1:1)
database queries using Structured Query relationship between entity classes, a one-to-
Language (SQL). many (1:M) relationship between entity
 To understand the concept of transaction, its classes, a many-to-many (M:M) relationship
properties and how to persist the data in between entity classes, and recursive
complex concurrent users environment. relationships;
5. Be familiar with the basic issues of
transaction, its processing and concurrency
control.

UNIT – I Introduction: Introduction: Introduction to Database. Hierarchical, Network and

Relational Models. Database system architecture: Data Abstraction, Data Independence, Data
Definition Language (DDL), Data Manipulation Language (DML). Data models: Entity-
relationship model, network model, relational and object orienteddata models, integrity constraints,
data manipulation operations.

UNIT – II Relational query languages: Relational algebra, Tuple and domain relational
calculus,SQL3, DDL and DML constructs, Open source and Commercial DBMS - MYSQL,
ORACLE, DB2, SQL server. Relational database design: Domain and data dependency,
Armstrong's axioms, Functional Dependencies, Normal forms, Dependency preservation, Lossless
design.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 UNIT – III: Query processing and optimization: Evaluation of relational algebra expressions,
Query equivalence, Join strategies, Query optimization algorithms. Storage strategies: Indices, B-
trees, Hashing.

UNIT –IV Transaction processing: Concurrency control, ACID property, Serializability of

scheduling, Locking and timestamp based schedulers, Multi-version and optimistic Concurrency
Control schemes, Database recovery.

UNIT – V: Database Security: Authentication, Authorization and access control, DAC, MAC and
RBAC models, Intrusion detection, SQL injection. Advanced topics: Object oriented and object
relational databases, Logical databases, Web databases, Distributed databases, Data warehousing and
data mining.

Text Books:

S. No. Title Author(s) Publisher

Abraham Silberschatz,
1 Database System Concepts Henry F. Korth andS.
Sudarshan

2 Applied Multivariate Data Analysis, Vol I & II, J.D. Jobson.

Reference Books:

S. No. Title Author(s) Publisher

1 Principles of Database and Base Systems, Vol 1 by

Knowledge J. D. Ullman.
R. Elmasri and S.
2 Fundamentals of Database Systems..
Navathe
Serge Abiteboul,
3 Foundations of Databases. Richard Hull, Victor
Vianu.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Computer Organization and L= T=0 P=0 Credits =
CS112391 Architecture Lab
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

1. Circuits on breadboard or simulators

(a) Implementation of Combinational Digital/Boolean Circuits: Adder, Subtractor,
Multiplication Module, Division Module, Multiplexer, Demultiplexer, Encoder, Decoder.
(b) Implementation of Sequential Circuits: Counters, Linear Feedback Shift Registers (LFSR)
2. C/C++ programming to understand the formats of char, int, float, double, long etc.
3. Machine language programming on x86 or higher version kits or simulators:
(i) Add/subtract/multiplication/division/GCD/LCM
(ii) Accessing some specific memory locations/ports
(iii) Counting odd and even integers from a series of memory locations
(iv) Printing values of selected registers
(v) Handing interrupts

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Object Oriented L= T=0 P=0 Credits =
CS112392 Programming Lab
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

Upon successful completion of this Lab the student

will be able to:
1. You will be able to know about Object oriented
programming.
The objective of course is to develop
2. Use Abstract Data Types in the programs.
programming skills of students, using object
3. Application of Non recursive functions.
oriented programming concepts, learn the
4. OOP principles like Encapsulation Inheritance
concept of class and object using C++ and
Polymorphism were frequently used.
develop classes for simple applications.
5. Different sorting techniques (Quick sort, Merge
sort, Heap sort) were used.
6. Polymorphism and exception handling in the
programs.
Laboratory
1. Parameter passing: passing parameter by value vs by reference, passing array as constant
pointer
2. Function overloading: writing string operations like strcat and strncat, strcpy and strncpy as
overloaded functions.
3. Dynamically allocating space for a pointer depending on input and doing this repeatedly,
depending on different inputs and finally de-allocating the pointer.
4. Define class complex with all possible operations: constructor, destructor, copy constructor,
assignment operator with the data members stored as pointer to integers.
5. Define class vector of integers with all possible operations like constructor, destructor, copy
constructor and assignment operators
6. Define class matrix of integers with all possible operations like constructor, destructor, copy
constructor and assignment operators
7. Define class matrix of integers using vector, with all possible operations like constructor,
destructor, copy constructor and assignment operators
8. Define class stack, queue, linked-list, array, set using some data-type (int) with data members
kept as private and functions kept in both protected and public sections.
9. Define class complex with all possible operators: constructor, destructor, copy constructor,
assignment operator and operators >, <, >=, <=, ==, ++ (pre and post), +, +=, ( ), with the data
members stored as pointer to integers.
10. Define class vector of integers with all possible operations like constructor, destructor, copy
constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( )
11. Define class matrix of integers with all possible operations like constructor, destructor, copy
constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +, +=, ( ).
12. Define class matrix of integers using vector, with all possible operations like constructor,
destructor, copy constructor and assignment operators>, <, >=, <=, ==, ++ (pre and post), +,

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 +=, ( ).
13. Define stack and queue inherited from array class, with standard functions and operators
14. Define a class called ‘array’ with data type passed as template type with constructor,
destructor, copy constructor and assignment operators and index operator.
15. Define template functions for compare and use it in the algorithms like bubble sort, insertion
sort, merge sort.
16. Formatted input-output examples
17. Input manipulators
18. Overriding operators <<, >>
19. Define class model for complex number, student class, book class and show it using UML
diagram as well as concrete class.
20. Show behavioral modeling through sequence diagram and activity diagram for workflow in a
typical log-in, log-out situation.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code
Computational Statistics Lab L= T=0 P=0 Credits =
CS112393
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Laboratory
Python Concepts, Data Structures, Classes: Interpreter, Program Execution, Statements,
Expressions, Flow Controls, Functions, Numeric Types, Sequences and Class Definition,
Constructors, Text & Binary Files - Reading and Writing

Data Wrangling: Combining and Merging Datasets, Reshaping and Pivoting, Data Transformation,
String Manipulation, Regular Expressions

Data Aggregation, Group Operations, Time series: GoupBy Mechanics, Data Aggregation,
Groupwise Operations and Transformations, Pivot Tables and Cross Tabulations, Time Series Basics,
Data Ranges, Frequencies and Shifting

Visualization in Python: Matplotlib package, Plotting Graphs, Controlling Graph, Adding Text,
More Graph Types, Getting and setting values, Patches

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code Database Management L= T=0 P=0 Credits =
CS112394 Systems Lab
ESE CT TA Total ESE Duration
Examination
100 20 30 150 3 Hours
Scheme

LIST OF EXPERIMENTS [12 hrs.]

1.Database Schema for a customer-sale scenario

Customer (Cust id: integer, Cust name: string)
Item (item_id: integer, item name: string, price: integer)
Sale (bill no: integer, bill data: date, cystoid: integer, item_id: integer, qty_sold: integer)
For the above schema, perform the following—
Create the tables with the appropriate integrity constraints
Insert around 10 records in each of the tables

(a) List all the bills for the current date with the customer names and item numbers.
(b) List the total Bill details with the quantity sold, price of the item and the final amount.
(c) List the details of the customer who have bought a product which has a price>200.
(d) Give a count of how many products have been bought by each customer.
(e) Give a list of products bought by a customer having cust_id as 5.
(f) List the item details which are sold as of today.
(g) Create a view which lists out the bill no, bill date, cust_id, item_id, price, qty_sold,
amount.
(h) Create a view which lists the daily sales date wise for the last one week.
(i) Create a view which lists out the bill no, bill date, cust_id, item_id, price, qty_sold,
amount.
(j) Create a view which lists the daily sales date wise for the last one week.

2.Database Schema for a Student Library scenario

Student (Stud no: integer, Stud name: string)
Membership (Mem_no: integer, Stud no: integer)
Book(book no: integer, book_name:string, author: string)
Iss_rec (iss_no: integer, iss_date: date, Mem_no: integer, book_no: integer)
For the above schema, perform the following—
(a) Create the tables with the appropriate integrity constraints.
(b) Insert around 10 records in each of the tables.
(c) List all the student names with their membership numbers.
(d) List all the issues for the current date with student and Book names.
(e) List the details of students who borrowed book whose author is CJ DATE.
(f) Give a count of how many books have been bought by each student.
(g) Give a list of books taken by student with stud_no as 5.
(h) List the book details which are issued as of today.
(i) Create a view which lists out the iss_no, iss _date, stud_name, book name.
(j) Create a view which lists the daily issues-date wise for the last one week.

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
3. Database Schema for a Employee-pay scenario
employee (emp_id: integer, emp_name: string)
department (dept_id: integer, emp_name: string)
pay details (emp_id: integer, dept_id: integer, basic: integer, deductions: integer, additions: integer,
DOJ: date)
payroll (emp_id: integer, pay_date: date)
For the above schema, perform the following:
(a) Create the tables with the appropriate integrity constraints
(b) Insert around 10 records in each of the tables
(c) List the employee details department wise
(d) List all the employee names who joined after particular date
(e) List the details of employees whose basic salary is between 10,000 and 20,000
(f) Give a count of how many employees are working in each department
(g) Give a name of the employees whose net salary>10,000
(h) List the details for an employee_id=5
(i) Create a view which lists out the emp_name, department, basic, deductions, net salary
(j) Create a view which lists the emp_name and his netsalary

4. Database Schema for a student-Lab scenario

Student (stud_no: integer, stud_name: string, class: string)
Class (class: string, descript: string)
Lab (mach_no: integer, Lab_no: integer, description: String)
Allotment (Stud_no: Integer, mach_no: integer, dayof week: string)
For the above schema, perform the following—
(a) Create the tables with the appropriate integrity constraints
(b) Insert around 10 records in each of the tables
(c) List all the machine allotments with the student names, lab and machine numbers
(d) List the total number of lab allotments day wise
(e) Give a count of how many machines have been allocated to the ‗CSIT ‘class
(f) Give a machine allotment detail of the stud_no 5 with his personal and class details
(g) Count for how many machines have been allocated in Lab_no 1 for the day of the week as
―Monday‖
(h) How many students class wise have allocated machines in the labs?
Create a view which lists out the stud_no, stud_name, mach_no, lab_no, dayofweek
(i) Create a view which lists the machine allotment details for ―Thursday

5(a) Write and execute subprogram to find largest number from the given three numbers.
(b) Write and execute subprogram using loop, while and for iterative control statement.

6(a) Write and execute subprogram to check whether the given number is Armstrong or not
(b) Write and execute subprogram to generate all prime numbers below 100.

7(a) Write and execute subprogram to demonstrate the GOTO statement.

(b) Write a subprogram to demonstrate %type and %rowtype attributes

8(a) Write and execute subprogram to demonstrate predefined exceptions

(b) Write and execute subprogram to demonstrate user defined exceptions

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
9(a) Create a cursor, which displays all employee numbers and names from the EMP table.
(b) Create a cursor, which update the salaries of all employees as per the given data.

10(a) Create a cursor, which displays names of employees having salary > 50000.
(b) Create a procedure to find reverse of a given number

11(a) Create a procedure to update the salaries of all employees as per the given data
(b) Create a procedure to demonstrate IN, OUT and INOUT parameters

12(a) Create a function to check whether given string is palindrome or not.

(b) Create a function to find sum of salaries of all employees working in depart number 10.

13(a) Create a trigger before/after update on employee table for each row/statement.

14 Create a trigger before/after delete on employee table for each row/statement.

15 Create a trigger before/after insert on employee table for each row/statement.

16(a) Create a Form to display employee details using SQL

(b) Create a Report to generate all employee annual salaries….

Additional Programs:
1. Create a Master/details relationship form which perform Add New, Search, Delete, Save and
Update on the records
2. Generate a report to calculate employee ‘s salaries department wise from employee table.
3. Create a Report to generate the details of employee table including sum and average salaries
department wise.

Reference Books:
S. No. Title Authors Publisher
1 Fundamentals of Database Systems Elma Sri Nava the Pearson Education
2 An Introduction to Database systems C.J. Date, A. Kannan, Pearson, Eight Edition
S. Swami Nadhan,

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards
 Subject Code
Indian constitution L= T=0 P=0 Credits =
HM100395
ESE CT TA Total ESE Duration
Examination 100 20 30 150 3 Hours
Scheme
Minimum number of class tests to be
Minimum Assignments=02
conducted=02

Course Objectives Course Outcomes

1.00 Applicablefor
Chairman(AC) Chairman(BoS) DateofRelease Version AY2021-22Onwards