Shri Shankaracharya Technical Campus,

Shri Shankaracharya Group of Institutions

(An Autonomous Institute affiliated to Chhattisgarh Swami VivekanandaTechnical
University Bhilai)
SCHEME OF EXAMINATION AND SYLLABUS
Second Year (4th semester) B. Tech

Periods per
week Scheme of Exam
Subject Total Credit
S.N. Subject Name Code Theory/Practical Marks L+(T+P)/2
L T P
ESE CT TA

Discrete Structure 3 1 - 20 30 150 4

1 CS1020401 100
Computer System
2 architecture (CSA + CS1020402 3 0 - 100 20 30 150 3
Microprocessor)

Java 100
3 CS1020403 3 0 - 20 30 150 3

Analysis and Design of

3 0 - 100 20 30 150 3
4 Algorithms CS1020404

Database Management
100
5 System CS1020405 3 0 - 20 30 150 3

Computer System
Architecture (CSA + - 2 40 - 20 60 1
6 CS1020491
Microprocessor) Lab

Java Lab
7 CS1020492 - 2 40 - 20 60 1

Python Lab
8 CS1020493 - 2 40 - 20 60 1

Database Management
9 System Lab CS1020494 - 2 40 - 20 60 1

Self Learning-IV
[NPTEL -MOOC -
10 - - - - - 10 -
Course]

Total 15 1 8 660 100 240 1000 20

 Discrete Structure
Subject Code L=3 T=1 P=0 Credits = 4
CS1020401

Evaluation ESE CT TA - ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. To introduce a number of discrete

mathematical structures found to be serving After completion of this course students will
as tools in the development of theoretical be:
computer science. 1. Able to apply mathematical logic and
2. Course focuses on how discrete structures Boolean algebra in switching circuits & logic
actually helped computer engineers to solve circuits.
problems occurred in the development of 2. Familiar with set theory, relation and
programming languages. functions.
3. Course highlights the importance of 3. Familiar with algebraic structures, graph
discrete structures towards simulation of a theory and combinatorics.
problem in computer science engineering. 4. Able to solve problems in various fields in
computer science, specially networking

UNIT-I MATHEMATICAL LOGIC & BOOLEAN ALGEBRA: Basic concept of

mathematical logic, Statements, Connectives, Conditional and biconditional statements, Logical
equivalence, Logical implication & quantifiers, Basic concept of Boolean Algebra, Properties of
Boolean Algebra, Boolean functions, Disjunctive & conjunctive normal forms of Boolean
functions, Applications of Boolean Algebra in switching circuits & logic circuits.

UNIT-II SET THEORY, RELATIONS, FUNCTIONS: Basic concept of set theory, Relations,
Properties of relation in a set, Equivalence relation, Composition of relations, Partial order & total
order relations, Lattices &Hasse diagram, Introduction to function, Inverse, Identity, Injective,
Surjective & Bijective functions, Composition of functions and some special functions.

UNIT-III ALGEBRAIC STRUCTURES: Groups, Subgroups, Cosets, Lagrange’s theorem,

Isomorphism, Automorphism, Homomorphism, Codes & group codes, Rings, Integral domains
and Fields.

UNIT-IV GRAPH THEORY: Introduction to graph theory, Walks, Paths & Circuits, Types of
graphs, Shortest path problems, Eulerian and Hamiltonian graphs, Basic concept of tree: spanning
tree, minimum spanning tree, search tree, rooted binary tree, Cut sets, Network flow, Matrix
representation of graphs.

UNIT-V COMBINATORICS: Permutation and combination, Pigeon-hole principle,

Mathematical induction, Principle of Inclusion and Exclusion, Generating function, Recurrence
relation.
Text Book:
S.No. Title Authors Edition Publisher
Elements of discrete Tata McGraw-Hill,
1 C.L. Liu
mathematics publications.
Bernard Kolman,
Discrete Mathematical Robert C. Busby
2 Pearson Education.
structures and Sharon Cutler
Ross

ReferenceBooks:
S. No. Title Authors Edition Publisher
Swapan Kumar Swapan Kumar
A Text Book of Discrete
1 Sarkar, S. Chand Sarkar, S. Chand
Mathematics
&Compeny Ltd &Compeny Ltd
Graph theory with
Prentice Hall of
2 applications to engineering NarsinghDeo
India.
and computer science
Discrete mathematics for J.L. Mott, A.
Prentice Hall of
3 computer scientists and Kandel and T.P.
India.
mathematicians Baker
Discrete Mathematical
J.P. Tremblay and
4 Structures with applications Tata McGraw-Hill.
R. Manohar
to computer science
 Computer System
architecture (CSA +
Subject Code L=3 T=0 P=0 Credits = 3
Microprocessor
CS1020402

Evaluation ESE CT TA - ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. To understand the structure,

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

Unit 1 Basic Building blocks of Computer

CPU structure and functions, processor organization, ALU, data paths, internal registers, status flags;
micro-operations, instruction format, instruction cycle, hardwired control, microprogrammed control,
microinstruction sequencing and execution, addressing modes and formats, System bus structure:
Data, address and control buses, bit slicing.

Unit 2 Data Representation

Number representations and their operations, Design of Fast Adders, Signed multiplication, Booth’s
Algorithm, bit-pair recoding, Integer Division, Floating point numbers and operations, guard bits and
rounding.

Unit 3 Memory and Peripheral devices

Memory system, internal and external memory, memory hierarchy, cache memory and its working,
virtual memory concept.I/O organization; I/O techniques: interrupts, polling, DMA; Synchronous
vs. asynchronous I/O.

Unit 4 Pipelining
Pipelining, basic concepts in pipelining, delayed branch, branch prediction, data dependency,
instruction pipelining, multiple execution units, performance considerations, Basic concepts in
parallel processing:& classification of parallel architectures, Vector Processing, Array Processors.
Unit 5 8085 Microprocessor
8085 microprocessor architecture; Instruction set, instruction types and formats; Instruction
execution, instruction cycles, different types of machine cycles and timing diagram.
16-bit microprocessorsfamilies: 8086 architecture, registers, memory segmentation and addressing,
32-bit Intel microprocessorsfamilies: The Intel 80286, 80386, 80486,
64-bit Intel microprocessorsfamilies: The Intel 805xx, 806xx, 807xx. Recent Processors and their
specifications

Text Books:
S. No. Title Authors Edition Publisher
Computer System Prentice-Hall of
1 Mano, M.M 3rd Ed
Architecture India. 2004
Rajaraman, V.
Computer Organization and Prentice-Hall of
2
and Architecture Radhakrishnan, India. 2007
T
Computer Architecture Tata McGraw-Hill.
3 Govindrajalu, B
and Organization 2004
 Java
Subject Code L=3 T=0 P=0 Credits = 3
CS1020403

Evaluation ESE CT TA Total ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. To construct Java programs using features of Object

1. Understand fundamentals of oriented programming.
programming such as variables, 2. Able to explain object and package construction
conditional and iterative process.
execution, methods, etc. 3. To construct robust Java programs using exception
handling and String class.
2. Understand fundamentals of 4. To develop java programs using multithreading and
object-oriented programming in File Handling
Java, including defining classes, 5. To design and develop application programs using
invoking methods, using class UI components and Database connectivity.
libraries, etc.

UNIT- I
Introduction: Introduction & Fundamentals of JAVA, basic concepts of object-oriented
programming, About Java Technology, comparison between procedural programming paradigm and
object-oriented programming paradigm, Java’s architecture, Fundamental Programming Structure:
Data Types, variable, Arrays. Control Flow: Java’s Selection statements (if, switch, iteration,
statement, while, do-while, for, Nested loop), Concept of Objects and Classes, Reading console
inputs, Constructor overloading, final, this, static keyword.

UNIT-II
Inheritance: definition and advantages, super keyword, Method overriding, dynamic method
dispatch, Abstract class, Inner classes , Interface. Aggregation, Method overriding. Package:
Package, importing packages, sub package. Exception Handling: Fundamentals, Inbuilt, User
defined, Checked and Unchecked exceptions, Using try & catch, Multiple catch, throw , throws,
finally.

UNIT- III
String class: , Strings: string constructor, string methods, StringBuffer and methods. Wrapper classes
(Integer, Boolean, Character, etc.). Multi-threading: Thread concept, Thread life cycle, Thread class,
Runnable interface, synchronization, Thread class methods. Java I/O: Use of InputStream,
OutputStream, Reader and Writer classes for reading from and writing data into disk files.

UNIT-IV
Applets: Basics, Architecture, The HTML APPLET Tag, Passing Parameters to Applets, Applet
context and show documents (). Event Handing: Delegation Event model, Event Classes, Event
Listener, Interfaces, Adapter classes. JDBC: Fundamentals, Type I, Type II, Type III, Type IV
drivers. Networking: Basics, Socket overview, Networking classes, & interfaces, TCP/IP client
sockets, URL format, URL
connection, TCP/IP Server Sockets.
 UNIT-V
AWT: components, Button, Label, TextField, Panel, Window, Frame, Canvas, ActionListener,
MouseListener, KeyListener, ItemListener etc. Layout managers, Remote method invocation(RMI).
SWING: JButton, JLabel, JTextField, JScrollBar, JComboBox, JTabbedPane, JScrollPane, JTree etc.
Generics in Java: Creating instances of generic classes, generic types, Declaring (and invoking)
methods that take generic types. Creating and running executable JAR (Java ARchives).

Text Books:
S.No. Title Authors Edition Publisher
Java - The Complete
Herbert McGraw Hill
1 Reference 11th Edition
Schildt Education
Programming with Java McGraw Hill
2 Balagurusamy 6th Edition
Education
V. Vijaya
Object Oriented Bhaskar , P.
3 1st Edition SCITECH
Programming through JAVA VenkataSubba
Reddy

ReferenceBooks:
S. No. Title Authors Edition Publisher
Java: A Beginner’s Guide Herbert McGraw-Hill
1 8th Edition
Schildt Education
Core Java: An Integrated
R. Nageswara DreamTech Press
2 Approach 8th Edition
Rao
 Analysis and Design of
Subject Code Algorithms L=3 T=0 P=0 Credits = 3
CS1020404
CT TA -
Evaluation ESE ESE Duration
Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

 To understand and apply the algorithm

analysis techniques.  Design algorithms for various computing
 To critically analyze the efficiency of problems.
alternative algorithmic solutions for the  Analyze the time and space complexity of
same problem. algorithms.
 To understand different algorithm design  Critically analyze the different algorithm
techniques. design techniques for a given problem.
 To understand the limitations of  Modify existing algorithms to improve
Algorithmic power. efficiency.

UNIT I INTRODUCTION:
Notion of an Algorithm – Fundamentals of Algorithmic Problem Solving – Important Problem Types
– Fundamentals of the Analysis of Algorithmic Efficiency –Asymptotic Notations and their
properties. Analysis Framework – Empirical analysis - Mathematical analysis for Recursive and Non-
recursive algorithms - Visualization

UNIT II BRUTE FORCE AND DIVIDE-AND-CONQUER:

Brute Force – Computing an – String Matching - Closest-Pair and Convex-Hull Problems -
Exhaustive Search - Travelling Salesman Problem - Knapsack Problem - Assignment problem.
Divide and Conquer Methodology – Binary Search – Merge sort – Quick sort – Heap Sort -
Multiplication of Large Integers – Closest-Pair and Convex - Hull Problems.

UNIT III DYNAMIC PROGRAMMING AND GREEDY TECHNIQUE:

Dynamic programming – Principle of optimality - Coin changing problem, Computing a Binomial
Coefficient – Floyd‘s algorithm – Multi stage graph - Optimal Binary Search Trees – Knapsack
Problem and Memory functions. Greedy Technique – Container loading problem - Prim‘s algorithm
and Kruskal's Algorithm – 0/1 Knapsack problem, Optimal Merge pattern - Huffman Trees.

UNIT IV ITERATIVE IMPROVEMENT:

The Simplex Method - The Maximum-Flow Problem – Maximum Matching in Bipartite Graphs,
Stable marriage Problem.

UNIT V COPING WITH THE LIMITATIONS OF ALGORITHM POWER:

Lower - Bound Arguments - P, NP NP- Complete and NP Hard Problems. Backtracking – n-Queen
problem - Hamiltonian Circuit Problem – Subset Sum Problem. Branch and Bound – LIFO Search
and FIFO search - Assignment problem – Knapsack Problem – Travelling Salesman Problem -
Approximation Algorithms for NP-Hard Problems – Travelling Salesman problem – Knapsack
problem.

Text Books:
 S.No. Title Authors Edition Publisher
Introduction to the Design Third Pearson
1 Anany Levitin
and Analysis of Algorithms‖ Edition Education, 2012
Ellis Horowitz,
Sartaj Sahni and Second Universities
2 Computer Algorithms/ C++
Sanguthevar Edition Press, 2007
Rajasekaran

ReferenceBooks:
S. No. Title Authors Edition Publisher
Thomas H.Cormen,
Introduction to Charles E.Leiserson, Third PHI Learning Private
1
Algorithms‖ Ronald L. Rivest and Edition Limited, 2012
Clifford Stein
Alfred V. Aho, John E.
Data Structures and Pearson Education,
2 Hopcroft and Jeffrey D.
Algorithms‖ Reprint 2006
Ullman
Algorithms Design Oxford university
3 Harsh Bhasin
and Analysis‖ press, 2016
Design and
Oxford university
4 Analysis of S. Sridhar
press, 2014
Algorithms‖
 Database Management
Subject Code System L=3 T=0 P=0 Credits = 3
CS1020405

Evaluation ESE CT TA - ESE Duration

Scheme 100 20 30 150 3 hrs

Course Objective Course Outcomes

1. Be familiar with basic concepts of RDBMS,

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

UNIT-I

INTRODUCTION TO DATA BASE & INDEXING TECHNIQUES: - Advantages of DBMS,

Type of Data Models, Schema and instances, DBMS Architecture and Data Independence

Entity- Relationship Model: Attributes and Keys, Relationship Types, Weak Entity set, Strong
Entity Set, Enhanced E–R Modeling, Specialization and Generalization

Indexing Techniques : Indexes, Multi level indexes, Dynamics Multilevel indexes using B trees and
B+- Trees.

UNIT-II

THE RELATIONAL DATA MODEL & SQL:- Types of data models, Relational data model:
concepts, constraints, relational algebra, relational calculus, Tuple and Domain relational calculus,

SQL: DDL,DML, DCL, Types of constraints, Defining different constraints on a table, Defining &
Dropping integrity constraints in the alter table command, View, Index.
UNIT-III

DATABASE DESIGN:- Functional Dependencies and Normalization for Relational Databases:

Informal design guidelines for relation schemes, Functional dependencies, Normal forms based on
primary keys, General definitions of second and third normal forms, Boyce- Codd normal form,
problem related with normal forms & solutions. Multi valued & Join Dependencies, 4th & 5th
Normalization.

UNIT-IV

QUERY & TRANSACTION PROCESSING:- Query Processing : Query processing stages , Query
interpretation, Query execution plan, Table scans, Fill factor, Multiple index access, Methods for join
tables scans, Structure of a query optimizer.

Transaction Processing: Types of failures, ACID property, schedules and recoverability, serialbility
of schedules, Levels of transaction consistency, Deadlocks.

UNIT –V

CRASH RECOVERY & CONCURRENCY CONTROL:- Failure classification, Different type of

Recovery techniques & their comparative analysis, deferred update, immediate update, Shadow
paging, Check points, On-line backup during database updates.

Concurrency Control: Different type of concurrency control techniques & their comparative
analysis, Locking techniques, Time- stamp ordering, Multi-version techniques, Optimistic techniques,
Multiple granularity.

Database Security: Authentication, Authorization and Access Control, DAC, MAC, RBAC models,
Intrusion detection, SQL injection.

Text Books:
S.No. Title Authors Edition Publisher
Korth & MH
1 Database system concept
Sudarshan
Galgotia
Principles of Database
2 Ullman, J.O 2nd Edn Publications
Systems
Introduction to Database Pearson Education
3 C.J.Date
Systems

ReferenceBooks:
S. No. Title Authors Edition Publisher
Principles of Database and
Computer Science
1 Knowledge – Base Systems”, J. D. Ullman
Press
Vol 1
Serge Abiteboul,
2 Foundations of Databases Richard Hull, Addison-Wesley
Victor Vianu
 Computer System
Architecture (CSA +
Subject Code L=0 T=0 P=2 Credits = 1
Microprocessor) Lab
CS1020491

Evaluation ESE CT TA - ESE Duration

Scheme 40 - 20 - -

Course Objective Course Outcomes

1. Assemble the hardware part of the computer system and

1.To study of assembling the
hardware part of the computer will be able to partition the memory and format the system
system. 2. Install different types of OS and BIOS setup and
2.To study how to partition the Configuration.
memory and format the system 3. Apply a basic concept of digital fundamentals to
3.To study installation of Microprocessor based personal computer system.
different types of OS and BIOS 4. Identify a detailed s/w & h/w structure of the
setup and Configuration.
Microprocessor
4.To study the basic concept of
digital fundamentals to 5. Design, write and test assembly language programs of
Microprocessor based personal moderate complexity.
computer system. 6. Illustrate how the different peripherals are interfaced with
5.To study the design, write and Microprocessor
test assembly language 7. Apply concepts of microprocessor for developing system
programs of moderate to solve real world problems.
complexity

Laboratory Equipments / Machine Requirements:

Computer Hardware trainer kits, Old computing system – should be used for training, Prepare museum
of antique computer components for display in laboratory, 8086 based microprocessor kit, MASM
assembler, 8086 simulator, PCs. The students are free to choose any programming platform from (C++
/ JAVA / PYTHON) to perform the above mentioned set.

List of Experiments: (At least Ten experiments are to be performed by each student)

1. Assembling of a Personal Computer: a. Identifying parts of mother board, power connections

and locating other connectors. b. Interconnection of disk drive units, keyboard, mouse and
monitor.
2. Hard disk partitioning and OS installation: a. Partitioning the hard disk using FDISK/ Partition
Magic/ Disk Manager
3. Installation of Windows XP/2000/Pro b. Installation of Linux kernel (possibly with dual boot
option).
4. Installation of Software packages in Linux Platform.
5. Write a program to perform signed bit multiplication using Booth’s algorithm.
6. Write a program for floating point representation and perform Addition/Subtraction.
7. To perform addition & subtraction of two 8 – bit hexadecimal numbers.
8. To perform addition & subtraction of two 8 – bit decimal numbers and store the result in DX
register.
9. To perform multiplication of 4 and 5 .
 10. To perform division of 16 – bit number with 8-bit number.
11. To solve Arithmetic equation 3AX+5DX+BP and store the result in CX register. 12. To solve
Arithmetic equation (P*Q)+(R*S).
12. To add only positive number from 100 data bytes.
13. To write a program to add series of 20 bytes.
14. To find positive & negative byte from 100 data bytes.
15. To find largest & smallest byte from block of data.

S. No. Title Authors Edition Publisher

IBM PC Assembly Language PHI/Pearson
1 P. Abel 5th Edition
and Programming Education
Edition,20
Introduction To Assembly SivaramaP.Danda 03
2 Edition,2003
Language Programming mudi Springer
Int
3 VHDL FOR ENGINEERS Kenneth L Pearson Education
 Java Lab
L=0 T=0 P=2 Credits = 1
Subject Code CS1020492

Evaluation ESE CT TA - ESE Duration

Scheme 40 - 20 - -

Course Objective Course Outcomes

. 1. Understand fundamentals of
programming such as variables, 1. To develop java programs using constructors and
conditional and iterative destructors.
execution, methods, etc. 2. To utilize the concept of inheritance to develop java
programs.
2. Understand fundamentals of 3. To demonstrate the use of exception handling and
object-oriented programming in Strings in java programs.
Java, including defining classes, 4. To create multithreaded applications using java
invoking methods, using class programming.
libraries, etc. 5. To design and develop interactive application programs
using user Interfacing components, file handling etc.

List of Experiments

1. Write a program to find the volume of a box having its side w,h,d means width ,height and depth. Its
volume is v=w*h*d and also find the surface area given by the formula s=2(wh+hd+dw). use
appropriate constructors for the above.
2. Develop a program to illustrate a copy constructor so that a string may be duplicated into another
variable either by assignment or copying.
3. Create a base class called shape. Apart from Constructors, It contains two methods get xy564value()
and show xyvalue() for accepting co-ordinates and to display the same. Create the sub class Called
Rectangle which contains a method to display the length and breadth of the rectangle called
showxyvalue().Illustrate the concepts of Overriding and Constructor call sequence.
4. Write a program that creates an abstract class called dimension, create two subclasses, rectangle and
triangle. Include appropriate methods for both the subclass that calculate and display the area of the
rectangle and triangle.
5. Write a program, which throws Arithmetic Exception. Write another class (in a different file) that
handles the Exception.
6. Create a user defined Exception class which throws Exception when the user inputs the marks
greater than 100 Catch it and again rethrow it.
7. Write a program to illustrate various String class methods.
8. Write a program to illustrate various String Buffer methods.
9. Write a program in which a Mythread class is created by extending the Thread class. In another
class, create objects of the Mythread class and run them. In the run method print “CSVTU” 10 times.
Identify each thread by setting the name.
10. Write a program to illustrate various Thread methods.
11. Write a Program to implement Bank Account Class which illustrates the concept of Thread
Synchronization.
12. To write a program to create a text file using Byte Stream class.

13. To write a program to copy contents of one file to another.

14. Write a program to find numbers of occurrence of vowels in a file.
15. Write a program, which illustrates capturing of Mouse Events. Use Applet for this.
16. Write a program using swing components which simulates simple calculator.
17. Write a JDBC program for Student Mark List Processing.
 Python Lab
Subject Code L=0 T=0 P=2 Credits = 1
CS1020493

Evaluation ESE CT TA - ESE Duration

Scheme 40 - 20 - -

Course Objective Course Outcomes

Course Outcome: At the end og the course,

students will be able to,
Course Objective: The course is CO1: Describe the Python language syntax
designed including control statements, loops and functions
1. To develop logical understanding of to write programs for a wide variety problem in
the subject. mathematics, science, and games.
2. To create the ability to model, solve CO2: Examine the core data structures like lists,
and interpret physical and engineering dictionaries, tuples and sets in Python to store,
problems. process and sort the data.
3. To provide an overview of functions of CO3: Interpret the concepts of Object-oriented
complex variable which helps in solving programming as used in Python using
many engineering problems encapsulation, polymorphism and inheritance
4. To provide Basic knowledge of CO4: Discover the capabilities of Python regular
Python. expression for data verification and utilize matrices
for building performance efficient Python
programs.
CO5: Identify the external modules for creating
and writing data to excel files and inspect the file
operations to navigate the file systems.

List of Experiments: (Each student should perform, at least, 10 experiments.)

1. Write programs to understand the use of Python Identifiers, Keywords, Indentations, Comments in
Python, Operators, Membership operator.
2. Write programs to understand the use of Python String, Tuple, List, Set, Dictionary, File input/output.
3. Write programs to understand the use of Numpy’s Ndarray, Basic Operations, Indexing, Slicing, and
Iterating, Conditions and Boolean Arrays.
4. Write programs to understand the use of Numpy’s Shape Manipulation, Array Manipulation,
Vectorization.
5. Write programs to understand the use of Numpy’s Structured Arrays, Reading and Writing Array Data
on Files.
6. Write programs to understand the use of Pandas Series, DataFrame, Index Objects, Reindexing,
Dropping, Arithmetic and Data Alignment.
7. Write programs to understand the use of Pandas Functions by Element, Functions by Row or Column,
Statistics Functions, Sorting and Ranking, Correlation and Covariance, “Not a Number” Data.
8. Write programs to understand the use of Pandas for Reading and Writing Data using CSV and Textual
Files, HTML Files, XML, Microsoft Excel Files.
9. Write programs to understand the use of Matplotlib for Simple Interactive Chart, Set the Properties of
the Plot, matplotlib and NumPy.
10. Write programs to understand the use of Matplotlib for Working with Multiple Figures and Axes,
Adding Text, Adding a Grid, Adding a Legend, Saving the Charts.
11. Write programs to understand the use of Matplotlib for Working with Line Chart, Histogram, Bar
Chart, Pie Charts.

Recommended Books:
S. No. Title Authors Edition Publisher
1 Python Data Analytics Fabio Nelli APress
2 Python for Data Analysis Wes McKinney O’Reilly
 Database Management
System Lab
Subject Code L=0 T=0 P =2 Credits = 1
CS1020494

ESE
Evaluation CT TA - ESE Duration
Scheme 40 - 20 - -

Course Objective Course Outcomes

Upon successful completion of this Lab the

. student will be able to:
The major objective of this lab is to 1. Creating , Modify database Tables and

provide a strong formal foundation in manipulate data in the Tables

database concepts, technology and practice 2. Performing database operations in a

to the participants to groom them into well- procedural manner using pl/sql
informed database application developers. 3. Performing database

Rather than imparting isolated operations create, update,

knowledge/experience fragments in each of modify, retrieve, etc.
concepts, technology and practice, the 4. Design and Develop applications like

course will aim at achieving a good blend banking, reservation system, etc.
of the three. 5. Design and implement a small
database project using RDBMS to
understand the concept of a
database transaction and related
database facilities.

List of Experiments
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, cust_id: integer, item_id: integer, qty_sold: integer)

For the above schema, perform the following—

a) Create t he tables with the appropriate integrity constraints
b) Insert around 10 records in each of the tables
c) List all the bills for the current date with the customer names and item numbers
d) List the total Bill details with the quantity sold, price of the item and the final amount
e) List the details of the customer who have bought a product which has a price>200
f) Give a count of how many products have been bought by each customer
g) Give a list of products bought by a customer having cust_id as 5
h) List the item details which are sold as of today
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 CJDATE
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

3 Database Schema for a Employee-pay scenario

employee(emp_id : integer, emp_name: string)
department(dept_id: integer,dept_name:string)
paydetails(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 names of the employees whose netsalary>10,000
h) List the details for an employee_id=5
i) Create a view which lists out the emp_name, department, basic, dedeuctions, netsalary
j) Create a view which lists the emp_name and his net salary

4 Database Schema for a Video Library scenario

Customer(cust_no: integer,cust_name: string)
Membership(Mem_no: integer, cust_no: integer)
Cassette(cass_no:integer, cass_name:string, Language: String)
Iss_rec(iss_no: integer, iss_date: date, mem_no: integer, cass_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 customer names with their membership numbers
d) List all the issues for the current date with the customer names and cassette names
e) List the details of the customer who has borrowed the cassette whose title is “ The
Legend”
f) Give a count of how many cassettes have been borrowed by each customer
g) Give a list of book which has been taken by the student with mem_no as 5
h) List the cassettes issues for today
i) Create a view which lists outs the iss_no, iss_date, cust_name, cass_name
j) Create a view which lists issues-date wise for the last one week

5 Database Schema for a student-Lab scenario

Student(stud_no: integer, stud_name: string, class: string)
Class(class: string,descrip: 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 details 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
i) Create a view which lists out the stud_no, stud_name, mach_no, lab_no, dayofweek
j) Create a view which lists the machine allotment details for “Thursday”.

6 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.
7. 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.

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

8 b) Write a subprogram to demonstrate %type and %rowtype attributes
9 a) Write and execute subprogram to demonstrate predefined exceptions
b) Write and execute subprogram to demonstrate user defined exceptions
10 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.

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

12 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

13 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.

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

b) Create a trigger before/after delete on employee table for each row/statement.
c) 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.