Updated as on

24-11-2022
Shri Shankaracharya Technical Campus
An Autonomous Institute affiliated to
(Chhattisgarh Swami Vivekananda Technical University Bhilai)
SCHEME OF EXAMINATION AND SYLLABUS
B. Tech Second Year (4th semester)

Computer Science and Engineering

Artificial Intelligence, Artificial Intelligence and Machine Learning, Big
Data Analytics, Data Science, Gaming Technology, Internet of Things
Internet of Things & Cyber Security with Blockchain Technology

Periods
Board of

Total Marks
per Scheme of Exam
Studies week
S.N.

Credit
Course
(BOS) Courses (Subject) Code Theory/Practical
L T P
ESE CT TA
Applied
1 Discrete Structure AM100401 3 1 - 100 20 30 150 4
Mathematics
Computer System
Comp. Sc. and
2 Architecture and CS102402 2 1 - 100 20 30 150 3
Engineering
Microprocessor
Comp. Sc. and
3 Java Programming CS102403 3 0 - 100 20 30 150 3
Engineering
Comp. Sc. and Analysis and Design of
4 CS102404 3 0 - 100 20 30 150 3
Engineering Algorithms
Comp. Sc. and Database Management
5 CS102405 3 0 - 100 20 30 150 3
Engineering System
Comp. Sc. and
6 Java Programming Lab CS102491 - 2 25 - 25 50 1
Engineering
Comp. Sc. and
7 Python Lab CS102492 - 2 25 - 25 50 1
Engineering
Comp. Sc. and Database Management
8 CS102493 - 2 25 - 25 50 1
Engineering System Lab
Comp. Sc. and
9 Mini Project-II CS102494 - 2 50 - 25 75 1
Engineering
Applied
10 Biology For Engineers AC100495 - - - - - 25 25 -
Chemistry
Total 14 2 8 625 100 275 1000 20

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code
Discrete Structure L=3 T=1 P=0 Credits = 4
AM102401

Evaluation ESE CT TA - ESE Duration

Scheme 100 20 30 150 3 hours.

Course Objective Course Outcomes

The Objective of this course is: After completion of this course students willbe:
 To introduce a number of discrete CO1. Able to apply mathematical logic and
mathematical structures found to be serving as Boolean algebra in switching circuits & logic
tools in the development of theoretical computer circuits.
science. CO2. Familiar with set theory, relation and
 Course focuses on how discrete structures functions.
actually helped computer engineers to solve CO3. Familiar with algebraic structures, graphtheory
problems occurred in the development of and combinatorics.
programming languages. CO4. Able to solve problems in various fields in
 Course highlights the importance of discrete computer science, especially networking.
structures towards simulation of a problem in CO5. To gain the basic knowledge of graphs.
computer science engineering.

UNIT-I MATHEMATICAL LOGIC & BOOLEAN ALGEBRA: CO1

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.
[10 hrs.]
UNIT-II SET THEORY, RELATIONS, FUNCTIONS: CO2
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.
[10 hrs]

UNIT-III ALGEBRAIC STRUCTURES: CO3

Groups, Subgroups, Cosets, Lagrange ‘s theorem, Isomorphism, Automorphism, Homomorphism, Codes & group
codes, Rings, Integral domains and Fields.
[10 hrs]
UNIT-IV GRAPH THEORY: CO4
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. [9 hrs]

UNIT-V COMBINATORICS: CO5

Permutation and combination, pigeon-hole principle, Mathematical induction, Principle of inclusion &
exclusion, Generating function, Recurrence relation.
[9 hrs]
Text Books:
S.No. Title Authors Publisher

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Computer System Architecture and
Subject Code Microprocessor L=2 T=1 P=0 Credits = 3
CS102402
Tata McGraw-Hill,
1 Elements of Discrete Mathematics C.L Liu Publications.
Bernard Kolman,
Discrete Mathematical Robert C. Busby
2 Pearson Education.
Structures and Sharon Cutler
Ross

Reference Books:
S. No. Title Authors Publisher
Swapan Kumar Swapan Kumar
1 A Text Book of Discrete Sarkar, S. Chand & Sarkar, S. Chand &
Mathematics Compeny Ltd Compeny Ltd
Graph theory with
Prentice Hall of
2 applications to engineering Narsingh Deo
India.
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
4 Structures with applications J.P. Tremblay and Tata McGraw-Hill.
to computer science R. Manohar

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Evaluation ESE CT TA - ESE Duration
Scheme 100 20 30 150 3 hours.

Course Objective Course Outcomes

The objective of this course is: CO1 Identify the basic hardware components of a
 To understand the structure, computer system.
function and characteristics of CO2 Familiarize themselves with binary and
computer systems. hexadecimal number systems including computer
 To understand the design ofthe arithmetic.
various functional units and CO3 Familiarize themselves with functional units of the
components of computers. processor such as the register file and arithmetic logical unit.
 To identify the elements of CO4 Understand basics functionality of systems:
modern instructions sets and parallel, pipelined, superscalar and RISC/CISC
their impact on processor architectures.
design. CO5 Represent system design in appropriate formats;
 To explain the function of addressing modes, an instruction sets as per the system
each element of a memory configuration requirements.
hierarchy
 To identify and compare
different methods for
computer I/O.
UNIT-I Basic Building blocks of Computer CO1
CPU structure and functions, processor organization, ALU, data paths, internal registers, status flags; micro-
operations, instruction format, instruction cycle, hardwired control, micro programmed control, microinstruction
sequencing and execution, addressing modes and formats, System bus structure: Data, address and control buses, bit
slicing
[8 hrs.]
UNIT-II Data Representation CO2
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
[7hrs]
UNIT-III Memory and Peripheral devices CO3
Memory system, internal and external memory, memory hierarchy, cache memory and itsworking, virtual
memory concept. I/O organization; I/O techniques: interrupts, polling, DMA; Synchronous vs. asynchronous I/O.
[7hrs]
UNIT-IV Pipelining CO4
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.
[7hrs]
UNIT-V 8085 Microprocessor CO5
8085 microprocessor architecture; Instruction set, instruction types and formats; Instruction execution, instruction
cycles, different types of machine cycles and timing diagram.
16-bit microprocessors families: 8086 architecture, registers, memory segmentation andaddressing,
32-bit Intel microprocessors families: The Intel 80286, 80386, 80486,
64-bit Intel microprocessors families: The Intel 805xx, 806xx, 807xx. Recent Processors andtheir specifications.
[7hrs]

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Text Books:

S. No. Title Author(s) Publisher

Computer System Architecture Prentice-Hall of
1 Mano, M.M
India. 2004
Computer organization Architecture Rajaraman, V. and Prentice-Hall ofIndia.2007
Radhakrishnan, T
2
Computer architecture & organization Tata McGraw-Hill.
3 Govindrajalu, B
2004

Reference Books:

S. No. Title Author(s) Publisher

Computer Architecture and Design A.J Wand Go & Wokingham UK
1
Addison Wisely 1989
Computer Architecture John P Hayes Prentice-Hall of India. 2007
2 and Organization

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Java Programming
L=3 T=0 P=0 Credits = 3
CS102403

Evaluation ESE CT TA Total ESE Duration

Scheme 100 20 30 150 3 hours.

Course Objective Course Outcomes

The objective of this course is: CO1 To construct Java programs using features
 Understand fundamentals of of Object-oriented programming.
programming such as CO2 Able to explain object and
variables, conditional and package construction process.
iterative execution, methods, CO3 To construct robust Java programs
etc. using exception handling and String class.
CO4 To develop java programs
 Understand fundamentals using multithreading and File
of object-oriented Handling
programming inJava, including CO5 To design and develop application
defining classes, invoking programsusing UI components and Database
methods, using class libraries, connectivity.
etc.

UNIT-I Introduction: CO1

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.
[8 hrs.]
UNIT-II Inheritance: CO2
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.
[7 hrs]
UNIT-III String class: CO3
Strings: string constructor, string methods, String Buffer 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 Input Stream, Output Stream,
Reader and Writer classes for reading from and writing data into disk files.
[7 hrs.]
UNIT-IV Applets:
CO4
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.
[7 hrs.]

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
UNIT-V AWT: CO5
components, Button, Label, Text Field, Panel, Window, Frame, Canvas, Action Listener, Mouse
Listener, Key Listener, Item Listener etc. Layout managers, Remote method invocation (RMI).
SWING: JButton, JLabel, JTextField, JScrollBar, JComboBox, JTabbed Pane, JScroll Pane, 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).
[7 hrs.]

Text Books:
S.No. Title Authors Publisher
Java - The CompleteReference
Herbert McGraw HillEducation
1
Scheldt
2 Programming with Java Balagurusamy McGraw Hill
Education
V. Vijaya
3 Object Oriented Programming through Bhaskar, P. SCITECH
JAVA VenkataSubba
Reddy

Reference Books:
S. No. Title Authors Publisher
Java: A Beginner ‘s Guide Herbert McGraw-Hill
1
Scheldt Education

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Analysis and Design of
L=3 T=0 P=0 Credits = 3
CS102404 Algorithms
CT TA -
ESE ESE Duration
Evaluation
Scheme 100 20 30 150 3 hours.

Course Objective Course Outcomes

The Objective of this course is: CO1 Design algorithms for various computing
 To understand and apply the algorithm problems.
analysis techniques. CO2 Analyze the time and space complexity of
 To critically analyze the efficiency of algorithms.
alternative algorithmic solutions for the CO3 Critically analyze the different algorithm
same problem. design techniques for a given problem.
 To understand different algorithm design CO4 Modify existing algorithms to improve
techniques. efficiency.
 To understand the limitations of CO5 To Understand how to apply various
Algorithmic power. algorithms.

UNIT-I Introduction: CO1

Definitions and Application of notations, Asymptotic notations: big oh, small oh, omega and theta
notations, worst case, best case and average case analysis. solving recurrence equations: General
recurrence equation, Master Method, Recursive Tree Method, substitution method, analyzing control
structures. Analysis of Sorting and Searching: Heap, insertion, selection and bubble sort; sequential,
binary and Fibonacci search.
[7 hrs]

UNIT-II Divide-and-Conquer Technique of problem solving: CO2

The Basic divide and conquer algorithm for matrix multiplication, Quicksort, Merge sort, heap sort, shell
sort, radix sort, Dynamic sets and searching: Array doubling, Red Black trees, hashing high, priority
queues.
[8 hrs.]

UNIT-III Graphs: CO3

Definitions and representations, traversal, DFS and BFS., DFS on undirected graphs. Greedy algorithms:
Prim’s algorithm, single source shortest paths, Kruskal’s minimal spanning trees, Dijkstra shortest path
Transitive closure, APSP problem, Fractional Knapsack problems.
[7 hrs]

UNIT-IV Dynamic Programming and String Matching: CO4

Sum of Subset problem, Graphs and their traversal, Multiplying a sequence of matrices, Multi Stage
Graph, longest common sub sequence, knapsack problem. String Matching: Knuth - Moore-Pratt
Algorithm, Boyer- Moore Algorithm, The general string problem as a finite automaton

[7 hrs]
UNIT-V Backtracking and Branch and Bound: CO5
Back tracking and Recursive back tracking, the general method, N-queens problem, sum of subsets,
graph coloring, Hamiltonian cycle, Knapsack problem.
General method, applications (Branch and Bound): 15 puzzle problem, Travelling sales person problem,
0/1 knapsack problem, LC (Least-cost search), FIFO Branch and Bound solution.

[7 hrs]

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Text Books:
S.No. Title Author(s) Publisher
Introduction to the Design Pearson
1 Anany Levitin
and Analysis of Algorithms. Education
Ellis Horowitz,
Sartaj Shani and Universities
2 Computer Algorithms/ C++
Sagathevan Press
Rajasekar an

Reference Books:
S. No. Title Author(s) Publisher
Thomas Cormann,
Introduction to Charles Eliasson, Ronald PHI Learning Private
1
Algorithms. L. Rivest and Limited
Clifford Stein
Alfred V. Aho, John E.
Data Structures and Pearson Education,
2 Hopcroft and Jeffrey D.
Algorithms. Reprint
Ullman
Algorithms Design Oxford university
3 Harsh Bhasin
and Analysis. press
Design & Analysis of
Oxford university
4 algorithms. S. Sridhar
press

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Database Management System
CS102405 L=3 T=0 P=0 Credits = 3

Evaluation ESE CT TA - ESE Duration

Scheme 100 20 30 150 3 hours.

Course Objective Course Outcomes

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

UNIT-I Introduction to Database & Indexing Techniques: CO1

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.
[8 hrs]

UNIT-II The Relational Data Model & SQL: CO2

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.
[7 hrs]

UNIT-III Database Design: CO3

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.
[7 hrs.]

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
UNIT-IV Query & Transaction Processing: CO4
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, satiability of
schedules, Levels of transaction consistency, Deadlocks.
[7 hrs]

UNIT-V Crash recovery and Concurrency Control: CO5

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
granularities.
Database Security: Authentication, Authorization and Access Control, DAC, MAC, RBAC models,
Intrusion detection, SQL injection.
[7 hrs.]

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

Reference Books:
S. No. Title Authors 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

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Java Programming Lab
CS102491 L=0 T=0 P=2 Credits = 1

Evaluation ESE CT TA - ESE Duration

Scheme 25 - 25 - -

Course Objective Course Outcomes

The objective of this course is: CO1 To develop java programs using constructors and
 Understand fundamentals of destructors.
programming such as variables, CO2 To utilize the concept of inheritance to develop java
conditional and iterative programs.
execution, methods, etc. CO3 To demonstrate the use of exception handling and
Strings in java programs.
 Understand fundamentals of CO4 To create multithreaded applications using java
object-oriented programming in programming.
Java, including defining classes, CO5 To design and develop interactive application
invoking methods, using class programs using user Interfacing components, file handling
libraries, etc. etc.

List of Experiments: [12 hrs]

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 themarks
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 My thread class is created by extending the Thread class. In
another class, create objects of the My thread class and run them. In the run method print
CSVTU10 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.

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
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.

Reference Books:

S. No. Title Authors Publisher

Kathy Sierra & Bert Computer
1 Head first Java
Bates SciencePress

2 Beginning Programming with Java for Barry Burd

Addison-Wesley
Dummies

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Python Lab
CS102492 L=0 T=0 P=2 Credits = 1

Evaluation ESE CT TA - ESE Duration

Scheme 25 - 25 - -

Course Objective Course Outcomes

Course Outcome: At the end of the course,

The objectives of this lab are: students will be able to,
The course is designed CO1: Describe the Python language syntax
 To develop logical understanding of including control statements, loops and functions
the subject. to write programs for a wide variety problem in
 To create the ability to model, solve mathematics, science, and games.
and interpret physical and engineering CO2: Examine the core data structures like lists,
problems. dictionaries, tuples and sets in Python to store,
 To provide an overview of functions of process and sort the data.
complex variable which helps in solving CO3: Interpret the concepts of Object-oriented
many engineering problems programming as used in Python using
 To provide Basic knowledge of encapsulation, polymorphism and inheritance
Python. CO4: Discover the capabilities of Python regular
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: [12 hrs.]

(Each student should perform, at least, 10 experiments.)

1. Write programs to understand the use of Python Identifiers, Keywords, Indentations,

Comments 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 Nd array, 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, Data Frame, Index Objects, Re-
indexing, 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.

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
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.
Write programs to understand the use of Matplotlib for Working with Line Chart, Histogram,
Bar Chart, Pie Charts

Reference Books:
S. No. Title Authors Publisher
1 Python Data Analytics Fabio Nelli APress
2 Python for Data Analysis Wes McKinney O ‘Reilly

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Database Management
Subject Code System Lab L=0 T=0 P=2 Credits = 1
CS102493

Evaluation ESE CT TA - ESE Duration

Scheme 25 - 25 - -

Course Objective Course Outcomes

The objectives of this lab are: .
 To explain basic database Course Outcome: At the end of the course,
concepts, applications, data students will be able to,
models, schemas and instances. CO1 Apply the basic concepts of Database Systems and
 To demonstrate the use of Applications.
constraints and relational algebra CO2. Use the basics of SQL and construct queries using
operations. Describe the basics of SQL in database creation and interaction.
CO3. Design a commercial relational database system
SQL and construct queries using
(Oracle, MySQL) by writing SQL using the system.
SQL. CO4. Analyze and Select storage and recovery
 To emphasize the importance of techniques of database system.
normalization in databases. CO5. To familiarize issues of concurrency control
 To facilitate students in Database and transaction management .
design

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.

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
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.
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?
(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

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.

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
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

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
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code Mini Project-II
CS102494 L=0 T=0 P =2 Credits = 1

Evaluation ESE
CT TA - ESE Duration
Scheme
50 - 25 - -

Course Objective Course Outcomes

The objectives of this lab are: On successful completion of the course, the student
will be able to:
The objective of this course is to
CO1: Identify, discuss and justify the technical aspects
improve student ‘s ability to
of the chosen project with a comprehensive and
analyze, design and solve
systematic approach.
complex engineering problems
CO2: Reproduce, improve and refine technical aspects
through pedagogies (Project
of engineering projects applying appropriate techniques,
Based Learning) that support
resources, and modern engineering and IT tools.
them in developing these skills.
CO3: Work as an individual and as a member or leader
The goal here is not to passively
in teams in development of technical projects.
absorb and reiterate information;
CO4: Follow management principle and value
but rather to actively engage with health, safety and ethical practices during project.
the content, work through it with CO5: Communicate and report effectively project
others, relate to it through an related activities and findings.
analysis, use modern tools and
effectively solve problems with
the corresponding knowledge
gained.

The Process Followed to Maintain the Quality of Student Projects are: [12 Hrs.]

1. Introduction to IoT and its components.

2. Introduction to arduino uno Board, Bread Board & connecting various devices.
3. Types of sensors, Actuators and sending, receiving data techniques.
4. To communicate with wifi and Bluetooth devices.
5. Allotment of project ideas.
6. Monitoring
7. Monitoring
8. Assessment of Project work.
(a) Allotment of Projects:

(i) Students form their team (max four students) and submit their areas in which they would like
to pursue their projects.

(ii) Through meeting and deliberations students are allotted guide depending on their preference
and maximum number of groups under a faculty is limited to three.

(b) Identification of projects:

Students are asked to formulate problem statement and state objectives of their project in
consultation with the project guide

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
c) Continuous Monitoring

(i) Progress is continuously monitored by guide and instructions are given how to proceed
further during their project periods as per time table.

(ii) Students submit weekly progress report to the project in-charge after consultation with their
project guide.

(d) Evaluation

(i) In order to evaluate projects two project seminars (assessment) are taken in which student ‘s
team present their project through presentations and demonstrate their work.

(ii) Students are assessed on the basis of their technical skill implementation, use of modern
tools, communication skill, team work, health, safety and ethical practices and relevance of the
project.

(iii) At the end of the semesters a report is submitted by the students and student ‘s projects are
finally evaluated by external examiner in end semester practical examination based

Reference Books:
S. No. Title Authors Publisher
ESE 2022 - BASICS OF PROJECT IES MASTER TEAM IES MASTER
1 MANAGEMENT PUBLICATION (1 January
2021)
Modern Systems Analysis and Design Jeffrey A. Hoffer, Pearson Education; Third
2 Joey F. George, Edition; 2002.
Joseph S. Valakati

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Subject Code BIOLOGY FOR L=0 T=0 P=0 Credits = 0
(AC100495) ENGINEERS
ESE CT TA Total ESE Duration
Evaluation Scheme Workshop ,Quiz, Seminar And 25 25
By Organize Guest Lecture - -

Course Objectives Course Outcomes

The objective of this course is to impart an
understanding of fundamentals of biological On successful completion of the course, the student will
systems and its applications towards industries to be able to:
solve the problems in the real life.
 To convey that Biology is as important CO1: Describe how biological observations of 18th Century
scientific discipline as Mathematics, that lead to major discoveries..
Physics, Chemistry, and Engineering and CO2: Convey that classification per se is not what biology is
technology. all about but highlight the underlying criteria, such as
 To convey that classification per se is not morphological, biochemical and ecological. Highlight the
what biology is all about. The underlying the concepts of genetic material and its segregation and
criterion, such as morphological, independent assortment.
biochemical or ecological be highlighted. CO3: Convey that all forms of life have the same building
Discuss the concept human genetics. blocks and yet the manifestations are as diverse as one can
 To convey that all forms of life has the same imagine. Classify enzymes and distinguish between different
building blocks and yet the manifestations mechanisms of enzyme action. Concept of genetic code.
are as diverse as one can imagine. The Universality and degeneracy of genetic code
molecular basis of coding and decoding CO4: Identify DNA as a genetic material in the molecular
genetic information is universal basis of information transfer. The fundamental principles of
 How to analyses biological processes at the energy transactions in physical and biological world.
reductionist level. Concept of Energy Thermodynamics properties of different biological systems.
change. CO5: Apply thermodynamic principles to biological
 The fundamental concept and principles of systems. Identify and classify microorganisms. A Brief
Microbiology Account of Evolution

Unit 1. INTRODUCTION CO1

Bring out the fundamental differences between science and engineering by drawing a comparison
between eye and camera, Bird flying and aircraft. Mention the most exciting aspect of biology as an
independent scientific discipline. Why we need to study biology? Discuss how biological observations
of 18th Century that lead to major discoveries. Examples from Brownian motion and the origin of
thermodynamics by referring to the original observation of Robert Brown and Julius Mayor. These
examples will highlight the fundamental importance of observations in any scientific inquiry.
[2 Hrs.]
Unit 2. CLASSIFICATION &GENETICS CO2
Hierarchy of life forms at phenomenological level. A common thread weaves this
hierarchy.Classification. Discuss based on (a) cellularity- Unicellular or multicellular (b) ultra
structure- prokaryotes or eucaryotes. (c) Energy and Carbon utilization -Autotrophs,Heterotrophs,
Lithotropes (d) Ammonia excretion – Aminotelic, Uricotelic, Ureotelic (e) Habitataacquatic or
terrestrial (e) Molecular taxonomy- three major kingdoms of life. A given organism can come under
different category based on classification. Model organisms for the study of biology come from
different groups. E.coli, S.cerevisiae, D. Melanogaster, C. elegance, A. Thaliana, M.musculus.

Mendel’s laws, Concept of segregation and independent assortment. Concept of allele. Gene mapping,
Gene interaction, Epistasis. Meiosis and Mitosis be taught as a part of genetics. Emphasis to be give
not to the mechanics of cell division nor the phases but how genetic material passes from parent to
offspring. Concepts of recessiveness and dominance. Concept of mapping of phenotype to genes.
Discuss about the single gene disorders in humans. Discuss the concept of complementation using
human genetics .[3Hrs.]
Unit 3. BIOMOLECULES &INFORMATION TRANSFER CO3
Molecules of life. In this context discuss monomeric units and polymeric structures. Discuss about
sugars, starch and cellulose. Amino acids and proteins. Nucleotides and DNA/RNA. Two carbon units
and lipids.

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version
Molecular basis of information transfer. DNA as a genetic material. Hierarchy of DNA structure from
single stranded to double helix to nucleosomes. Concept of genetic code. Universality and degeneracy
of genetic code. Define gene in terms of complementation and recombination.
[4 Hrs.]

Unit 4. MACROMOLECULAR ANALYSIS & ITS METABOLISM CO4

Proteins- structure and function. Hierarch in protein structure. Primary secondary, tertiary and
quaternary structure. Proteins as enzymes, transporters, receptors and structural elements.
Thermodynamics as applied to biological systems. Exothermic and endothermic versus endergonic
and exergoinc reactions. Concept of Keq and its relation to standard free energy. Spontaneity. ATP as
an energy currency. This should include the breakdown of glucose to CO 2 + H2O (Glycolysis and
Krebs cycle) and synthesis of glucose from CO2 and H2O (Photosynthesis). Energy yielding
andEnergy consuming reactions. Concept of Energy change
[3 Hrs.]

Unit 5. MICROBIOLOGY EVOLUTION CO5

Concept of single celled organisms. Concept of species and strains. Identification and classification of
microorganisms. Microscopy. Ecological aspects of single celled organisms. Sterilization and media
compositions. Growth kinetics.
Origin of Universe, Origin of Life, Evolution of Life Forms, Evidences of Evolution, Adaptive
Radiation, Theories of Evolution BiologicalEvolution, Hardy–Weinberg Principle,
[3 Hrs.]

Text Books:
S.
Title Author(s) Publisher
No.
1. Biology: A global Campbell, N. A, Reece, J. B., Urry, Pearson Education Ltd
approach Lisa, Cain, M, L., Wasserman, S. A.,
Miniorsky, P. V., Jackson, R. B.
2. Outlines of Conn, E.E, Stumpf, P.K., Bruening John Wiley and Sons
Biochemistry G., Doi R.H.
3. Principles of Nelson D. L. and Cox M.M.W.H. Freeman and Company
Biochemistry
4. Molecular Genetics Stent, G. S.; and Calendar, R.W.H. Freeman and company,
Distributed by Satish Kumar Jain
for CBS Publisher
5. Microbiology Prescott, L.M J.P. Harley and C.A. W.M.C. Brown Publishers
Klein
6 Biology for Prof. Suraishkumar & Prof Madhulika IIT madras
engineers and other Dixit
non biologist.
Reference Books:
S.
Title Author(s) Publisher
No.
1. Biology For Engineers DrTanu Allen, DrSohini Singh Vayu Education Of India
,New Delhi
2. Biology For Engineers Arthur T.Johnsion Taylor &Francis Group
3. Molecular. Cellular and Joseph D .Bronzino,Donal R .Peterson CRC Press
tissue Engineering
4. Biology For Engineers Rajiv Singal,GauravAgrawal,RituBir CBS Publisher &distributors
5. Biology For Engineers G,K,Suraish Kumar OUP India

1.00
Applicable for AY
2021-22 Onwards
Chairman (AC) Chairman (BoS) Date of Release Version