B. Tech.

Computer Science and Engineering

(Artificial Intelligence and Data Science)
Course Structure
(w.e.f. 2023-24 admitted batch)

VISION
The Apollo University aspires to create global leaders of the future, preparing them
for a constantly evolving world and empowering them to build a healthier and more
equitable society.

MISSION
The Mission is to achieve this vision through transformative education, developed
at the intersection of healthcare, science, technology, and management, having
roots in innovation & research, in an inclusive culture that fosters practical
oriented knowledge, stimulates critical thinking and sustains our legacy of
pioneering and excellence, for the benefit of mankind.

THE APOLLO UNIVERSITY

MURUKAMBATTU
CHITTOOR (Dt) 517127
ANDHRA PRADESH
 I - Semester

3 Week Induction Programme

Periods

Credits
per week
Course Code Course Name
L T P

BTAT1701 Engineering Physics 3 1 0 4

BTAT1702 Engineering Mathematics 3 1 0 4

BTAT1801 Problem Solving and Programming with C 3 1 0 4

BTAT1101 Communicative English 3 0 0 3

BTAT1201 University Elective I 3 0 0 3

BTAL1701 Engineering Physics Lab 0 0 3 1.5

Problem Solving and Programming with C
BTAL1801 0 0 3 1.5
Lab

TOTAL 15 3 6 21

II - Semester
Periods

Credits
per week
Course Code Course Name
L T P

BTAT1703 Probability & Statistics 3 1 0 4

BTAT1802 Basic Electrical and Electronics Engineering 3 1 0 4

BTAT1301 Data Structures 3 1 0 4

BTAT1302 Python Programming 3 1 0 4

BTAT1102 Environmental Studies 3 0 0 0

BTAT1202 University Elective II 3 0 0 3

Basic Electrical and Electronics Engineering
BTAL1802 0 0 2 1
Lab
BTAL1301 Data Structures Lab 0 0 2 1

BTAL1302 Python Programming Lab 0 0 2 1

TOTAL 18 4 6 22
 III - Semester
Periods

Credits
per week
Course Code Course Name
L T P
BTAT2701 Discrete Mathematics and Graph Theory 3 1 0 4
BTAT2301 Design and Analysis of Algorithms 3 1 0 4
BTAT2302 Object Oriented Programming through Java 3 0 0 3
BTAT2801 Digital Logic design 3 0 0 3
University Core - III 3 0 0 3
University Elective -III 3 0 0 3
BTAT2303 Constitution of India 3 0 0 0
BTAL2301 Java Programming Lab 0 0 2 1
BTAL2801 Digital Logic Design lab 0 0 2 1

TOTAL 21 2 4 22

IV - Semester
Periods

Credits
per week
Course Code Course Name
L T P
Deterministic Stochastic and Statistical
BTAT2702 3 1 0 4
Methods
BTAT2901 Management for Engineers 3 0 0 3
BTAT2501 Data Science for Beginners 3 0 0 3
BTAT2304 Database Management Systems 3 0 0 3
BTAT2305 Operating Systems 3 1 0 4
BTAT2502 Artificial Intelligence 3 0 0 3
BTAT2306 Universal Human Values 3 0 0 0
BTAL2302 Database Management Systems Lab 0 0 2 1
BTAL2501 Exploratory Data Analytics with R lab 0 0 2 1
BTAI2301 Internship – I will be Evaluated in V Sem - - - -
TOTAL 21 2 4 22
 Value Added Courses
Course Code Course Name
BTAA0001 Getting Started with Google Cloud Learning Path
BTAA0002 Fundamentals of Data Analytics
BTAA0003 Introduction to Blockchain Technology
BTAA0004 Oracle Cloud Infrastructure Architect

V - Semester
Periods

Credits
per week
Course Code Course Name
L T P
BTAT3501 Machine Learning 3 0 0 3
BTAT3301 Computer Networks 3 0 0 3
BTAT3302 Automata and Compiler Design 3 1 0 4
BTAT3401 Faculty Elective - I 3 0 0 3
BTAT3601 Programme Elective - I 3 0 0 3
BTAM3501 MOOC - I 0 0 0 3
BTAL3501 Machine Learning Lab 0 0 2 1
BTAL3502 Computer Networks Lab 0 0 2 1
BTAI3301 Internship-I Evaluation 0 0 4 2
TOTAL 15 1 8 23

Faculty Elective -I Program Elective -I

Course Course
Course Name Course Name
Code Code
Object Oriented Analysis and Software Testing
BTAT3401a BTAT3601a
Design Methodologies
BTAT3401b Software Engineering BTAT3601b Distributed Computing
BTAT3401c Artificial Intelligence BTAT3601c Advanced Java Programming
Computer Organisation and
BTAT3401d BTAT3601d Network Security
Architecture
BTAT3401e Software Engineering BTAT3601e Database Security
BTAT3401f Advanced Data Structures
BTAT3401g Data Warehousing and Mining
BTAT3401h Machine Learning
Differential Equations and
BTAT3401i
Vector Calculus
 Numerical Methods for
BTAT3401j
Engineers
Mathematical Foundations of
BTAT3401k
Cyber Security
BTAT3401l Information Retrieval Systems
Cryptography and Network
BTAT3401m
security
Principles of Programming
BTAT3401n
Languages
BTAT3401o Unix and Shell Programming
BTAT3401p Introduction to Psychology
BTAT3401q Industry 4.O
BTAT3401r Computer Vision

Value Added Courses

Course Code Course Name

BTAA0005 Database Engineer Learning Path

BTAA0006 Big Data Foundation Course
BTAA0007 Programming Basics for Blockchain Engineers
BTAA0008 Oracle Cloud Security Administrator

VI - Semester
Periods

Credits
per week
Course Code Course Name
L T P

BTAT3502 Natural Language Processing 3 0 0 3

BTAT3503 Data Warehousing and Mining 3 0 0 3
BTAT3402 Faculty Elective - II 3 0 0 3
BTAT3602 Programme Elective - II 3 0 0 3
BTAT3603 Programme Elective - III 3 0 0 3
BTAM3502 MOOC - II 0 0 0 3
BTAL3503 Natural Language Processing lab 0 0 2 1
BTAL3504 Data Warehousing and Mining lab 0 0 2 1
-- Internship – II will be Evaluated in VII Sem
TOTAL 15 0 4 20
 Faculty Elective -II Program Elective -II
Course Course
Course Name Course Name
Code Code
BTAT3402a Design Patterns BTAT3602a Image Processing
Cryptography & Network
BTAT3402b Cyber Security BTAT3602b
security
BTAT3402c Software Project management BTAT3602c Deep Learning
BTAT3402d Linux Programming BTAT3602d Distributed Databases
BTAT3402e Cloud Computing BTAT3602e Database Administration
BTAT3402f Mobile Computing Program Elective -III
BTAT3402g Image Processing BTAT3603a High Performance Computing
BTAT3402h Deep learning BTAT3603b Software Project Management
BTAT3402i E-Commerce BTAT3603c MERN Technologies
BTAT3402j Block Chain Technology BTAT3603d Network Programming
Mathematical Foundations of Data Software Requirements
BTAT3402k BTAT3603e
Science Management
Transforms and Boundary Value
BTAT3402l
Problems
BTAT3402m Optimization Techniques
BTAT3402n Information Security
BTAT3402o Ethical Hacking
BTAT3402p Internet of Things
BTAT3402q Embedded Systems
BTAT3402r Green Computing
BTAT3402s Cloud Security
BTAT3402t DevNet
BTAT3402u Advanced computer networks
BTAT3402v Network Security
BTAT3402w Fault Tolerant Systems
BTAT3402x Computational Intelligence
BTAT3402y Data Analytics with Tableau

Value Added Courses

Course Code Course Name
BTAA0009 Data Analyst Learning Path
BTAA0010 BDA Foundation
BTAA0011 Blockchain Essentials
BTAA0012 Oracle Cloud Operations Engineer
 VII - Semester
Periods

Credits
per week
Course Code Course Name
L T P

BTAT4501 Big Data Analytics 3 0 0 3

BTAT4502 Neural Networks and Deep Learning 3 0 0 3
BTAT4601 Programme Elective - IV 3 0 0 3
BTAT4602 Programme Elective - V 3 0 0 3
BTAM4501 MOOC - III 0 0 0 3
BTAP4301 Mini Project 0 0 2 1
BTAL4501 Big data Analytics lab 0 0 2 1
BTAL4502 Neural Networks and Deep Learning lab 0 0 2 1
BTAI4301 Internship - II Evaluation 0 0 4 2
TOTAL 12 0 10 20

Program Elective -IV Program Elective -V

Course Course
Course Name Course Name
Code Code
BTAT4601a Social Network Analysis BTAT4602a Software Project Management
BTAT4601b AI in Block Chain BTAT4602b Health Analytics
Sequential Malware Analysis in Business Intelligence and
BTAT4601c BTAT4602c
Data Science Analytics
BTAT4601d Social Media Analytics BTAT4602d Image and Video Analytics
BTAT4601e Financial Analytics BTAT4602e Machine Learning for Security

Value Added Courses

Course Code Course Name

BTAA0013 BI and Analytics with Looker

BTAA0014 Big Data Technology
BTAA0015 Certified Blockchain Developer
 VIII - Semester
Periods

Credits
per week
Course Code Course Name
L T P

BTAP4302 Project Work 0 0 24 12

BTAV4301 Comprehensive Viva-Voce 0 0 2 1
TOTAL 0 0 26 13
I SEMESTER
BTAT1701: ENGINEERING PHYSICS L T P C
3 1 0 4
Course Description:
Engineering Physics is a course made for those keen on research as well as engineering at the
same time. It clubs together with the fields of Engineering as well as applied sciences and
creates a course that helps one gain collective knowledge of the new concepts in the field of
physics while also studying and researching their applications at the same time. Engineering
Physics course allows you to pursue a wide range of topics at the same time, thus giving you
several different options for a career. Being extremely vast and technical, the Engineering
Physics course is a much-respected degree that stands apart from other engineering degrees
and can be extremely rewarding at the same time.
Course Objectives:
1. Introducing fundamental concepts of physics that helps student understand intricacies of
physical world around us.
2. Introducing Quantum aspects of nature starting from the Newtonian Mechanics and wave
concepts of nature, with the help of explanations from ground breaking experiments of 20th
Century.
3. Introducing general Optical phenomena basing on wave nature of electromagnetic
radiation.
4. Introducing various applications of quantum mechanics such as LASERs, Fibre Optics and
Semiconductors devices.

UNIT I Mechanics, waves and Oscillations 20 Hrs

Newton Laws & Equations of Motion, Momentum, Energy, Angular Momentum, Rigid Body
Motion, Periodic Motion & Superposition, Free and Forced Vibrations, Resonance and
Coupled Oscillators.

Learning Outcomes:
1. Students are expected to understand free body diagrams and solving simple force equations.
2. Understanding the concepts of waves and vibrations and problem solving.
3. Understanding the concepts of wave super position.

UNIT II Concepts of Quantum Mechanics 8 Hrs

Particle properties of waves, Wave properties of particles, Atomic Structure, Schrödinger’s

Equation, Particle in a Box, Finite Potential Well, Quantum Harmonic Oscillator.
Learning Outcomes:
1. Understanding of dual nature.
2. Introductory concepts of wave mechanics.
3. simple problems solving related to quantum mechanics.
UNIT III Statistical Mechanics 8 Hrs
Statistical Distributions, Maxwell-Boltzmann Statistics, Molecular energies in an Ideal Gas
Quantum Statistics, Applications of Statistical mechanics.
Learning Outcomes:
1. Statistical distributions and their importance
2. Statistical aspects of thermodynamics
3. Obtain the idea of how microscopic aspects effecting macroscopic properties in physics.

UNIT IV Optics 16 Hrs

Wave Optics: Electro Magnetic Radiation and Electro Magnetic Spectrum, Super Position of
Waves, Refraction, Reflection, Interference, Diffraction and Polarisation.
LASERS: Characteristics of LASER, Spontaneous and Stimulated Emission of Radiation,
Einstein’s Coefficients and their significance. Meta-stable State, Pumping, Population
Inversion. Ruby Laser, Helium-Neon Laser, Semiconductor Diode Laser, Applications of
Lasers.
Fiber Optics: Principle and construction of optical fibre, Acceptance Angle and Numerical
Aperture, Classification of Optical Fibers, Attenuation in Optical Fibers (scattering, absorption
and bending losses) Applications of Optical Fibers.

Learning Outcomes:
1. Understanding E-M Spectrum and various applications and problems solving.
2. Understanding Generation of LASER and its applications.
3. Understanding basic concepts of Fibre optics and its applications.

UNIT V Semiconductors and Semiconductor devices 8 Hrs

Semiconductors Fermi Level in Intrinsic and Extrinsic Semiconductors. Carrier concentration
ofIntrinsic Semiconductor. Carrier concentration of Extrinsic Semiconductor (qualitative).
Semiconductor devices - Formation of a PN Junction and working of a PN Junction diode,
Energy band Diagram of open circuited PN Diode, I-V Characteristics of PN Junction diode.
Applications: LED, Solar Cell and Photo diode.
Learning Outcomes:
1. Understanding how quantum properties effecting the material properties.
2. Basic understanding of semiconductor Devices and applications.

Course Outcomes:
1. The problem-solving capabilities.
2. Quantitative aspects of wave and vibrations and its importance in understanding light.
3. Understanding of the statistical distributions and some simple thermodynamic
applications
4. Understanding preliminary concepts of Quantum nature and how it give birth to
modern engineering.
Text Books:
1. B.K. Pandey & S. Chaturvedi Engineering Physics, Cengage Learning.
2. Avadhanulu M N., Kshirsagar P G, A text book of Engineering Physics, S Chand
publications Pvt. Ltd, 2014.
3. D.K Bhattacharya and Poonam Tandon, Engineering Physics, Oxford Higher
Education press, 2015.

Reference Books:
1. P K Palanisamy, Engineering Physics, Sitech Publications.
2. Charles Kittel, Introduction to Solid State Physics, John Wiley Publisher.
3. A.S. Vasudeva, Modern engineering Physics, S Chand.
4. Dekker, Solid State Physics.
BTAT1702: ENGINEERING MATHEMATICS L T P C
3 1 0 4
Course Description:
This course is about the basic mathematics that is fundamental and essential component in all
streams of undergraduate studies in sciences and engineering. The course consists of topics in
matrices, quadratic forms, mean value theorems, multivariable calculus and multiple integrals
with applications to various engineering problems.
Course Objectives:
The course should enable the students to:
1. Instruct the concept of Matrices in solving linear algebraic equations, Eigen values and
Eigen vectors.
2. Familiarize the techniques in quadratic forms.
3. The maxima and minima of functions of single and several variables.
4. Illuminate the students in the concept of finding areas and volumes.
5. Equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various
real-world problems and their applications.
UNIT I 12 Hrs
Matrices: Rank of a matrix by echelon form, system of homogeneous and non-homogeneous
linear equations. Eigen values, Eigen vectors of Matrices, Cayley-Hamilton theorem (without
proof), finding inverse and power of a matrix by Cayley-Hamilton theorem.
Learning outcomes:
At the end of this unit, the student will be able to
1. Solving systems of linear equations, using technology to facilitate row reduction
determine the rank, Eigen values and Eigenvectors.
2. Identify special properties of a matrix, such as positive definite, etc., and use this
information to facilitate the calculation of matrix characteristics.
UNIT II 12 Hrs
Quadratic forms: Symmetric matrix, Orthogonal matrices, Diagonalisation of a matrix by
orthogonal process. Quadratic forms and nature of the quadratic forms, reduction of quadratic
form to canonical forms by orthogonal transformation.
Learning outcomes:
At the end of this unit, the student will be able to
1. Reduce the quadratic form to canonical form using orthogonal transformations.
2. An Introductory Approach focuses on the principles, processes, methodologies, and
approaches involved in the study of quadratic forms and matrices.
UNIT-III 12 Hrs
Mean value theorems: Rolle’s Theorem, Lagrange’s mean value theorem, Cauchy’s mean
value theorem, Taylor’s and Maclaurin theorems with remainders (without proof); Properties
and Problems.
Learning outcomes:
At the end of this unit, the student will be able to
1. Translate the given function as series of Taylor’s and Maclaurin’s with remainders.
 2. Analyse the behaviour of functions by using mean value theorems

UNIT IV 12 Hrs
Multivariable calculus: Partial derivatives, total derivatives, chain rule, change of variables,
Jacobians, maxima and minima of functions of two variables, method of Lagrange multipliers.
Learning outcomes:
At the end of this unit, the student will be able to
1. Find partial derivatives numerically and symbolically and use them to analyse and
interpret the way a function varies.
2. Acquire the Knowledge maxima and minima of functions of several variable.
3. Utilize Jacobian of a coordinate transformation to deal with the problems in change of
variables.

UNIT V 12 Hrs
Multiple integrals: Double integrals, change of order of integration, double integration in
polar coordinates, areas enclosed by plane curves. Evaluation of triple integrals, change of
variables between Cartesian and spherical polar co-ordinates.
Learning outcomes:
At the end of this unit, the student will be able to
1. Evaluate double integrals of functions of several variables in two dimensions using Cartesian
and polar coordinates.
2. Apply double integration techniques in evaluating areas bounded by region.
3. Evaluate multiple integrals in Cartesian, cylindrical and spherical geometries.
Course Outcomes:
After completion of the course, students will be able to
1. Analyse the solutions of the system of linear equations and find the Eigen values and
Eigen vectors of a matrix, which are used to analyse the long-term behaviour of any
system.
2. Reduce the quadratic form to canonical form using orthogonal transformations.
3. Utilize mean value theorems to real life problems.
4. Familiarize with functions of several variables, which is useful in optimization.
5. Evaluate multiple integrals in various coordinate systems.

Text Books:
1. E. Kreyszig, Advanced engineering mathematics”, John wiley & Son’s publishers, New
edition.
2. B. S. Grewal,” Higher engineering mathematics”, Khanna publishers, New edition.
Reference Books:
1. R. K. Jain and S. R. K. Iyengar, Advanced Engineering Mathematics, 3/e, Alpha
Science International Ltd., 2002.
2. George B. Thomas, Maurice D. Weir and Joel Hass, Thomas Calculus, 13/e, Pearson
Publishers, 2013.
3. Glyn James, Advanced Modern Engineering Mathematics, 4/e, Pearson
publishers, 2012.
BTAT1801: PROBLEM SOLVING AND PROGRAMMING WITH C L T P C
3 1 0 4
COURSE DESCRIPTION:
The course is designed to provide complete knowledge of C language, improves logical skills
which will help to create programs, applications in C and by learning the basic programming
constructs they can easily switch over to any other language in future.
Course Objectives:
The objective of this course is to make students to:
1. Familiarize the environment of structured programming and enabling to build logic with
algorithms and flowcharts.
2. Know the concepts of evaluation of expressions, conditional branching and loops.
3. Understand the features, train the student to convert the logic into program using a top-
down approach.
4. Apply the concepts like, arrays and pointers in solving the real-world problems.
5. Demonstrate the concepts of structure, union and file handling operations.

UNIT I 10 Hrs
Introduction to Computers and Problem Solving: What is computer, Introduction to
components of a computer: Hardware, Software, Programming Language Types, Compiler,
Problem Solving Aspect, Top-Down Design.
Idea of Algorithm: steps to solve logical and numerical problems. Representation of
Algorithm, Flowchart with examples.
From algorithms to programs: source code, variables, data types and memory locations,
Syntax and Logical Errors in compilation, object and executable code
Learning outcomes:
At the end of this unit, the students will be able to
1. Use C basic concepts to write simple C programs.
2. Test and execute the programs and correct syntax and logical errors.
3. Translate algorithms into programs.

UNIT II 13 Hrs
History of C language, Characteristics of C language, C Character Set, C Tokens, Input-Output
Statements, Structure of C Program, Arithmetic expressions, Operator Precedence &
Associativity, Conditional Branching and Loops, Writing and evaluation of conditionals and
consequent branching and Jumping Constructs, Iteration and loops.

Learning outcomes:
At the end of this unit, the students will be able to
1. Evaluate expressions.
2. Implement conditional branching and iteration.
3. Use iterative statements for writing the C programs.
UNIT III 12 Hrs
Function: Functions (including using built in libraries), Parameter passing in functions, call
by value, passing arrays to functions: idea of call by reference, Storage Classes.
Recursion, Example programs: Finding Factorial, Fibonacci series, Ackermann function.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Create programs using C Functions by modularizing.
2. Develop C programs with the help of various storage classes to control variable access.
3. Implement the problems using recursive functions.

UNIT IV 13 Hrs
Arrays: Arrays (1-D, 2-D), Character arrays and strings
Pointers: Idea of pointers, Defining pointers, Use of Pointers in self-referential structures,
notation of linked list (no implementation), Dynamic Memory allocation Functions.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Use arrays to process multiple homogeneous data.
2. Apply String handling functions and pointers.
3. Use arrays, strings and pointers to formulate algorithms and write programs.

UNIT V 12 Hrs
Structures: Defining structures and Array of Structures, Nested Structures, enum, typedef,
Union.
File handling: File Handling Functions, File Modes, File Operations.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Identify the modes, appropriate operations to be performed on files
2. Develop the structures based the problem.
3. Create user defined data types.

Course Outcomes:
After completion of the course, the student will be able to:
1. Formulate simple algorithms for arithmetic, logical problems and to translate the
algorithms to programs (in C language)
2. Test and execute the programs and correct syntax and logical errors, to implement
conditional branching, iteration.
3. Decompose a problem into functions and synthesize a complete program using divide and
conquer approach.
4. Use arrays, pointers to formulate algorithms and programs for real-world problems.
5. Apply programming to solve the problems of storing different data’s and various
operations on files.
Text Books:
1. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill.
2. Computer science, a structured programming approach using C, B.A. Forouzan and R.F.
Gilberg, Third edition, Thomson.

Reference Books:
1. R.G. Dromey, ―How to Solve it by Computer‖, Low Price Edition, Pearson Education
India, 2008.
2. The C Programming Language, B.W. Kernighan, Dennis M. Ritchie, PHI/Pearson
Education.
3. Let us C by Yashwanth P. Kanetkar 8th edition BPB publication
BTAT1101: COMMUNICATIVE ENGLISH L T P C
3 0 0 3
Course Description:
The creation of the Course is to facilitate Stakeholders in productively using the Language to
functional advantage to form meaningful engagements in a social context and influence their
professional dynamic.
Learning Objectives:
1. To heighten awareness of the correct usage of English grammar in Writing and Speaking.
2. To improve their speaking ability in English both in terms of fluency and
comprehensibility.
3. To give Oral Presentations and receive Feedback on their performance.
4. To increase their reading speed and comprehension of academic articles.
5. To improve their reading fluency skills through extensive reading.
6. To enlarge their vocabulary by maintaining a Vocabulary Journal.
7. To strengthen their ability to write academic papers, essays and summaries using the “Mind
Mapping,’ dynamic.

Learning Outcomes:
1. To review grammatical structures of English and the use of these forms in specific
communicative contexts, which include: class activities, homework assignments, reading
of texts and writing and functional real-world facets.
2. To improve their accuracy and fluency in producing and understanding spoken and written
English and endorse this proficiency in both personal and professional realms.
3. To attain and enhance competence in the four modes of literacy: Writing, Speaking,
Reading and Listening.
4. To develop their ability as critical thinkers.

UNIT I 9 Hrs
Vocabulary and Reading:
Special Features of English Vocabulary, Reading With Purpose; Understanding What is Read;
Drawing a Conclusion Based on Inferences, Deduction, Reading Between the Lines, Context,
Connotation, Higher Order Thinking; How to Explain Specific Information with Clarity;
Defining and Giving Reasons; Giving Directions; Professional Vocabulary.
UNIT II 9 Hrs
Basic Grammar:
Subject-Verb Agreement; Verb Tenses; Active-Passive Voice; Direct and Indirect Speech;
Question Tags; Degrees of Comparison; Articles; Avoiding Jargon
UNIT III 9 Hrs
Writing:
Letter Writing; Report Writing; E-Communication, Drafting and Collating Key Information,
Taking Notes from Lectures, Reading Materials, Reporting on Minutes of the Meeting, Precis
Writing
UNIT IV 9 Hrs
Basics of Communication:
Role of Communication; Purpose of Communication; Barriers to Communication; Verbal and
Non-Verbal Communication, Communication at the Workplace; Human Needs and
Communication; “Mind Mapping” Communication; E-Communication
UNIT V 9 Hrs
Presentations:
Self-Introduction; Individual Presentation; Group Discussions; Debates
ACADEMIC RESOURCES AND REFERENCES
1. Scholarly Publications - Journals
2. Popular Sources - Newspapers and Magazines
3. Professional Sources
4. Conference Proceedings
5. Government Documents
6. English Communications Skills for Professionals, by Gregory A. Barnes Wren and Martin
Grammar
BTAL1701: ENGINEERING PHYSICS LAB L T P C
0 0 2 1
Concepts of Experimental Physics
1. Error-Analysis and Drawing Graph

Mechanics - waves and Oscillations

2. Compound Pendulum
3. Estimation of the moment of inertia of a Fly wheel.
4. Estimation of the Young’s modulus of a steel wire using a torsion pendulum.
5. Melde’s Experiment
6. Resonance in LCR Circuits

Optics
7. Determine the thickness of the wire using wedge shape method
8. Determination of the radius of curvature of the lens by Newton’s ring method
9. Determination of wavelength by plane diffraction grating method
10. Determination of dispersive power of prism.
11. Determination of wavelength of LASER light using diffraction grating.
12. To determine the numerical aperture and acceptance angle of a given optical fibre

Semiconductor Physics
13. Energy Gap of a semi-conductor.
14. I-V Characteristics (Resistor, Diode, Solar Cell, LDR)
BTAL1801: PROBLEM SOLVING AND PROGRAMMING WITH C LAB L T P C
0 0 2 1
Course Description:
This lab course is designed to improve knowledge, logical skills, enhances the analyzing and
problem-solving skills which can be used for developing programs in C.
Learning Objectives:
The objective of this course is to make students to:
1. Understand the environment and enable to write algorithm and draw the flowchart.
2. Create the programs using control statements.
3. Analyse and modularise the problem into sub programs.
4. Develop programs using the concepts of arrays and strings.
5. Solve the memory access related problems and can analyse the file handling
mechanisms.

1. A) Write an algorithm, draw a flowchart for:

i) Finding the area and circumference of a circle of given radius.
ii) Finding the volume of a sphere of given radius.
iii) Finding the interest on a given principle for a given period of time at a given rate of
interest per year.
B) Familiarization with programming environment and write a C program for:
i) Finding the area and circumference of a circle of given radius.
ii) Finding the volume of a sphere of given radius.
iii) Finding the interest on a given principle for a given period of time at a given rate of
interest per year.
2. A) Write a C program to calculate the total and percentage of a student for the given marks.
B) Write a C program to display all the sizes of datatypes in C.
C) Write a C program to convert an integer into character.
3. A) Write a C program to find whether a given number is even or odd.
B) A salesman gets a commission of 5% on the sales if his sales are below Rs.5000/- and a
commission of 8% on the sales that exceeds Rs.5000/- together with Rs.250/-. Write an
algorithm or a flowchart and develop C program for computing the commission of the
salesman, based on his sales.
C) Write a C program in the menu driven style to perform the operations +, -, *, /, % between
two given integers.
4. A) i) Write three C programs to print a multiplication table for a given number using
while, do-while, and for loops.
ii) Write a C program to construct Pascal’s triangle.
B) Write a C program to compute the sum of:
i) 1+x+x2+x3+………….+xn, given x and n.
ii) 1 – x2/2! + x4/4! – x6/6! + x8/8! – x10/10! + … to n terms where the nth term becomes
less than 0.0001.
5. A) Write C functions for the following:
i) A function that takes an integer n as argument and returns 1 if it is a prime number and
 0 otherwise.
ii) A function that takes a real number x and a positive integer n as arguments and returns
xn.
iii) A function that takes a positive integer n as an argument and returns the nth Fibonacci
number.
6. Using recursion write C functions for the following:
i) Factorial of a non-negative integer n.
ii) Greatest Common Divisor of two integers.
7. A) Write a program to store the numbers given by the user in an array, and then to find the
mean, deviations of the given values from the mean, and variance.
B) Write a program to store user given numbers in an array and find the locations of
minimum and maximum values in the array and swap them and display the resulting
array.
8. A) Write a C program to implement the operations of matrices – addition, subtraction,
multiplication
B) Write a C program that uses functions to perform the insertion of a substring into
a given main string from a given position and delete n characters from a given
position in a given string.
C) i) Write a C program to determine whether a given string is palindrome or not.
ii) Write a C program to count the lines, words and characters in a given text.
9. A) Write a C program to swap two numbers using pointers.
B) Define a structure and union for student having members roll no., name, class,
section, marks. Create an array of 5 students and find the average marks for every
student.
10. A) Write a function which copies the contents of one file to another and display the file
Contents
B) Write a C program to reverse the first n characters in a file.
C) Write a C program to merge two files into a third file.
Course Outcomes:
After completion of the course, the student will be able to
1. Formulate the algorithms and can draw flowcharts for simple problems
2. Write conditional and iterative programs.
3. Develop the programs using sub functions and recursion.
4. Represent data in arrays, strings and can manipulate them.
5. Create files and perform simple operations like reading and writing on files.

Text Books:
1. B.A. Forouzon and R.F. Gilberg, “COMPUTER SCIENCE: A Structured Programming
Approach Using C”, Third edition, CENGAGE Learning, 2016.
2. Richard F. Gilberg & Behrouz A. Forouzan, “Data Structures: A Pseudocode Approach
with C”, Second Edition, CENGAGE Learning, 2011.

Reference Books:
1. Pradip Dey and Manas Ghosh, Programming in C, Oxford University Press, 2nd Edition
2011.
2. E. Balaguruswamy, “C and Data Structures”, 4th Edition, Tata Mc Graw Hill.
3. A. K. Sharma, Computer Fundamentals and Programming in C, 2nd Edition, University
Press.
II SEMESTER
BTAT1703: PROBABILITY & STATISTICS L T P C
3 1 0 4
Course Objectives:
1. To familiarize the students with the foundations of probability and statistical methods.
2. Summarize the basic concepts of data science and its importance in engineering.
3. To impart probability concepts and statistical methods in various applications
Engineering.
4. Compute conditional probabilities directly and using Baye’s theorem, and check for
independence of events.
5. Understand the law of large numbers and the central limit theorem and how these concepts
are used to model various random phenomena.

UNIT I 12 Hrs
Descriptive Statistics: Statistics Introduction, Measures of Variability (dispersion), Skewness,
Kurtosis, correlation, correlation coefficient, rank correlation, principle of least squares,
method of least squares, regression lines, regression coefficients and their properties.
Learning Outcomes:
At the end of this unit, the student will be able to
1. summarize the basic concepts of data science and its importance in engineering.
2. analyze the data quantitatively or categorically, measure of averages, variability.
3. adopt correlation methods and principle of least squares, regression analysis.

UNIT II 12 Hrs
Probability: Probability, probability axioms, addition law and multiplicative law of
probability, conditional probability, Baye’s theorem, random variables (discrete and
continuous), probability density functions, properties.
Learning Outcomes:
At the end of this unit, the student will be able to
1. Define the terms trial, events, sample space, probability, and laws of probability.
2. Make use of probabilities of events in finite sample spaces from experiments.
3. Apply Baye’s theorem to real time problems.
4. Explain the notion of random variable, distribution functions and expected value.

UNIT III 12 Hrs

Probability distributions: Discrete distribution - Binomial, Poisson approximation to the
binomial distribution and their properties. Continuous distribution: normal distribution and
their properties.
Learning Outcomes:
At the end of this unit, the student will be able to
1. Apply Binomial and Poisson distributions for real data to compute probabilities, theoretical
frequencies.
2. Interpret the properties of normal distribution and its applications.
UNIT IV 12 Hrs
Estimation and Testing of hypothesis, large sample tests: Estimation-parameters, statistics,
sampling distribution, point estimation, Formulation of null hypothesis, alternative hypothesis,
the critical and acceptance regions, level of significance, two types of errors and power of the
test. Large Sample Tests: Test for single proportion, difference of proportions, test for single
mean and difference of means. Confidence interval for parameters in one sample and two
sample problems.
Learning Outcomes:
At the end of this unit, the student will be able to
1. Explain the concept of estimation, interval estimation and confidence intervals.
2. Apply the concept of hypothesis testing for large samples.

UNIT V 12 Hrs
Small sample tests: Student t-distribution (test for single mean, two means and paired t-test),
testing of equality of variances (F-test), χ2 - test for goodness of fit, χ2 - test for independence
of attributes.
Learning Outcomes:
At the end of this unit, the student will be able to
1. Apply the concept of testing hypothesis for small samples to draw the inferences.
2. Estimate the goodness of fit.

Course Outcomes:
Upon successful completion of this course, the student should be able to
1. Compute descriptive statistics using numerical techniques and explain the characteristics
through correlation and regression tools.
2. Apply probability theory to find the chances of happening of events.
3. Understand various probability distributions and calculate their statistical moments.
4. Solve the problems on testing of hypothesis on large samples.
5. Solve the problems on testing of hypothesis on small samples.

Text Books:
1. Miller and Freunds, Probability and Statistics for Engineers, 7/e, Pearson, 2008.
2. S.C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e, Sultan
Chand & Sons Publications, 2012.

Reference Books:
1. S. Ross, a First Course in Probability, Pearson Education India, 2002.
2. W. Feller, an Introduction to Probability Theory and its Applications, 1/e, Wiley, 1968.
3. Peyton Z. Peebles, Probability, Random Variables & Random Signal Principles -
McGraw Hill Education, 4th Edition, 2001.
BTAT1802: BASIC ELECTRICAL & ELECTRONICS ENGINEERING L T P C
3 1 0 4
Course Objectives:
1. To introduce the basics of electric circuits and DC Machines analysis
2. To impart knowledge in the basics of AC Fundamentals
3. To introduce analog devices and their characteristics
4. To educate on the fundamental concepts of digital electronics
5. To introduce the functional elements and working of measuring instruments

UNIT I Fundamentals of Electrical Engineering and DC Machines: 12 Hrs

Ohm’s Law, Kirchhoff’s Laws, types of sources, passive elements. Series parallel circuits,
mesh and nodal analysis. Superposition, Reciprocity theorem.
DC Machines: Principle of operation of D.C generators, types, E.M.F equation. Principle of
operation of D.C motors, Types motors, Torque equation, Losses and efficiency, simple
problems on D.C Generators and motors.
Learning Outcomes:
1. Understand the fundamentals of electrical circuits.
2. Understand the performance of DC machines.
3. Understand the mathematical treatment of DC Machines in terms of torque, losses and
efficiency equations.

UNIT II Fundamentals of AC circuits: 12 Hrs

AC voltage wave form and basic definitions: Peak Value, R.M.S. value, Average values, Form
factor and Peak factor, ’j’ operator, Analysis of single phase AC circuits series and parallel
(Simple circuits). Three phase circuits – Star - delta connection, Relation between line and
phase voltages / currents in a 3-phase Star-Delta balanced system
Learning Outcomes:
1. Understand the concepts of AC fundamentals circuits with analysis.
2. Understand the concepts of 3-phase AC fundamentals circuits with analysis.
3. Understand 3-phase star-delta AC circuits with mathematical treatment.

UNIT III Induction Motors and Measuring Instruments: 12 Hrs

Concept of Faraday’s laws, 3- phase induction motor working principle, operation and
construction details.
Instruments: Introduction, classification of instruments, operating principles, essential features
of measuring instruments, permanent magnet moving coil (PMMC) instruments, moving iron
(MI) instruments.
Learning Outcomes:
1. Understand the principle and operation of induction motor
2. Understand the concepts of and measuring instruments.
3. Understand the concepts of 3-phase AC fundamentals circuits with analysis.
4. Understand the differences between types of instruments.
UNIT IV Diode And Transistor: 12 Hrs
Overview of Semiconductors, PN junction diode and Zener diode –Diode circuits: rectifiers
(bridge type only), filters, clippers and clampers. BJT construction, operation, characteristics
(CB, CE and CC configurations) and uses – JFET and MOSFET construction, operation,
characteristics (CS configuration) and uses.
Learning Outcomes:
1. Understand the principle and operation of diodes, transistors.
2. Understand the principle and operation of types of bridge rectifiers.
3. Understand the principle, construction and operation BJT, MOSFET along with V-I
characteristics.

UNIT V Digital Electronics: 12 Hrs

Number systems – binary codes –binary arithmetic - Boolean algebra, laws & theorems -
simplification of Boolean expression using K maps - logic gates - implementation of Boolean
expressions using logic gates - standard forms of Boolean expression.
Learning Outcomes:
1. Understand the binary number coded approach in digital electronics.
2. Understand the principle Boolean expression using K maps - logic gates.
3. Understand the implementation of Boolean expressions using logic gates.

Text Books:
1. Basic Electrical Engineering –T.K. Nagesarkar and M.S. Sukhja, Oxford University
Press.2nd edition.
2. Basic Electrical & Electronics Engineering –T.K. Nagesarkar and M.S. Sukhja, Oxford
University Press.2nd edition.
3. Principles of Electronics - V. K. Mehta, S. Chand Publications, 2nd edition.

References Books:
1. Theory and problems of Basic electrical Engineering- D. P. Kotahari & I. J. Nagrath
PHI.
2. Electronic Devices and Circuits, Millman & Halkias, TMH publications.
3. Electrical Machinery Dr. P.S. Bimbhra, Khanna Publication First Edition 2021.
BTAT1301: DATA STRUCTURES L T P C
3 1 0 4
Course Description:
The basic idea to introduce this course is to make students to explore several techniques,
algorithms to store, organize data and will include linked lists, stacks, queues, graphs and trees.
Study and analysing of the various data structures gives complete awareness to use them in
various applications.
Course Objectives:
The objective of this course is to make students to:
1. Impart the basic concepts of data structures and expected to know the Abstract Data Type,
and difference between linear and non-linear data structures
2. Learn implementing concepts about Stacks, Queues
3. Enable them to write algorithms for operations of various linked lists
4. Choose appropriate searching and sorting technique based on the problem to be solved
5. Understand basic concepts about trees, graphs and its applications
UNIT I 12 Hrs
Introduction to Data Structures: Definition of Data Structures, Abstract Data Type,
Classification of Data Structures- Linear and Non-Linear, Applications, Data Structure
Operations: insertion, deletion, search, traversal.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Identify importance of storing and organizing data.
2. Classify the various data structures.
3. Enumerate the real time applications of data structures.
UNIT II 12 Hrs
Stacks and Queues: Stack ADT and its operations, Array representation of stacks, Stack
applications - Reversing Data, Infix to Postfix Transformation, Postfix expression evaluation.
Queue ADT and its Operations, Array representation of Queues, Queue Types: Circular
Queues, Priority Queue, Dequeue, Applications of Queues. Dynamic Memory Allocation.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Describes the operations of Stack and queue.
2. Differentiate the various notations of arithmetic expression.
3. Allocate memory dynamically.
UNIT III 12 Hrs
Linked Lists: Concepts of Linked Lists, Types of Linked Lists, Singly Linked lists: Operations
& its implementation, Linked representations of Stacks & Queues, Concatenating two lists,
Doubly Linked List: Operations & its implementation, Circularly Linked List, Application of
Linked Lists.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Apply various operations on singly linked lists.
2. Interpret the various operations of doubly linked lists.
3. Analyse the various operations of Circularly linked lists.
UNIT IV 12 Hrs
Searching and Sorting: Searching: Linear Search and Binary Search Techniques. Sorting:
objectives and properties of different sorting algorithms: Bubble Sort, Selection Sort, Insertion
Sort, Quick Sort, Merge Sort, Heap Sort.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Solve searching problems.
2. Choose appropriate technique for sorting for the given problem.
3. Design and develop different sorting techniques.
UNIT V 12 Hrs
Trees and Graphs: Trees: Basic Tree Terminologies, Different types of Trees: Binary Trees,
Binary Tree Traversals, Applications of Binary Trees, Binary Search Trees, Spanning Trees.
Graphs: Basic Terminologies and Representations - Adjacency Matrix, Adjacency List, Graph
Traversals, Applications.
Learning Outcomes:
At the end of this unit, the students will be able to
1. Get familiarize with the tree terminologies.
2. Traverse the binary trees easily.
3. Represent and traverse the graphs.
Course Outcomes:
After completion of this course student will be able to:
1. Demonstrate the concepts of Abstract data type and can differentiate different between
linear and non-linear data structures.
2. Implement Stacks and Queues for a given problem.
3. Create programs for Linked lists using various operations.
4. Select the data structure that efficiently model the information in a problem
5. Describe the concepts of trees, graphs and their applications.

Text Books:
1. Richard Gilberg, Behrouz Forouzan, ―Data Structures: A P seudocode Approach with C
(Data Structures Series), Second Edition, Cengage Learning, 2004.
2. Gav Pai, ―Data Structures and Algorithms – Concepts, Techniques and Applications‖,
Tata McGraw Hill, 2008.

Reference Books:
1. A. A. Puntambekar, ―Data Structures Using C, First Edition, Technical Publications,
2009.
2. E Balagurusamy, ―Data Structures Using C, Tata McGraw-Hill Education, 2013.
BTAT1302: PYTHON PROGRAMMING L T P C
3 1 0 4
Course Description:
This course was introduced to make students to learn Python language and programming
constructs like loops, conditionals, data structures, and modules. Familiarizes the various tools
to run and write Python scripts, and student can develop code quickly, it dives deeper into
essential programming topics which helps the students to solve the complex real time problems.
Course Objectives:
The objective of this course is to make students to:
1. Know the basic concepts of python and to run the python scripts
2. Develop python programs with different operators, conditions and loops
3. Use python data structures sequences
4. Define and create python functions, modules, packages and make use of them
5. Learn object oriented programming concepts
UNIT I 12 Hrs
Introduction: History of Python, Need of Python Programming, Applications Basics of
Python Programming Using the REPL(Shell), Running Python Scripts, Variables, Assignment,
Keywords, Input-Output, Indentation.
Learning outcomes:
At the end of this unit, the students will be able to
1. Use python basic concepts to write simple python programs.
2. Test and execute the python scripts using different python scripts.
3. Know the importance of indentation.

UNIT II 12 Hrs
Types, Operators and Expressions: Types - Integers, Strings, Booleans; Operators-
Arithmetic Operators, Comparison (Relational) Operators, Assignment Operators, Logical
Operators, Bitwise Operators, Membership Operators, Identity Operators, Expressions and
order of evaluations Control Flow- if, if-elif-else, for, while, break, continue, pass.

Learning outcomes:
At the end of this unit, the students will be able to List the basic constructs of python. Use the
operators to write various conditional statements.Implement conditional branching and
iteration.

UNIT III 12 Hrs

Data Structures: Lists - Operations, Slicing, Methods; Tuples, Sets, Dictionaries, Sequences.
Comprehensions, strings and basic operations of strings.
Learning outcomes:
At the end of this unit, the students will be able to
1. Organize, process, retrieve and store data.
2. Use the data structure lists, Dictionaries, Tuples etc.,
3. Develop programs for manipulating strings.
UNIT IV 12 Hrs
Functions: Defining Functions, Calling Functions, Passing Arguments, Keyword Arguments,
Default Arguments, Variable-length arguments, Anonymous Functions, Fruitful Functions
(Function Returning Values), Scope of the Variables in a Function - Global and Local
Variables.
Modules: Creating modules, import statements, from. Import statement, name spacing.
Python packages: Introduction to PIP, Installing Packages via PIP, Using Python Packages.
Learning outcomes:
At the end of this unit, the students will be able to
1. Solve the problems by applying the modularity principle.
2. Know the usage of various modules based on the problem.
3. Install necessary packages as required.

UNIT V 12 Hrs
Object Oriented Programming OOP in Python: Classes, 'self-variable', Methods, Constructor
Method, Inheritance, Overriding Methods, Data hiding,
Error and Exceptions: Difference between an error and Exception, Handling Exception, try
except block, Raising Exceptions, User Defined Exceptions.

Learning outcomes:
At the end of this unit, the students will be able to
1. Know the concepts of object-oriented programming and can apply to solve real world
problems.
2. Illustrate the inheritance and overriding methods.
3. Classify exceptions and explain the ways of handling them.

Course Outcomes:
After completion of the course, the student will be able to:
1. Develop and run simple Python programs for solving problems
2. Demonstrate the python programs using various basic concepts
3. Represent compound data using Python lists, tuples, and dictionaries
4. Install python packages and can create and decompose python programs into functions
and modules
5. Demonstrate the object oriented concepts

Text Books:
1. Python Programming: A Modern Approach, Vamsi Kurama, Pearson.
2. Learning Python, Mark Lutz, Orielly.

Reference Books:
1. Think Python, Allen Downey, Green Tea Press.
2. Core Python Programming, W.Chun, Pearson.
3. Introduction to Python, Kenneth A. Lambert, Cengage.
BTAT1102: ENVIRONMENTAL STUDIES L T P C
3 0 0 0
Learning Objectives:
1. Creating the awareness about environmental problems among people.
2. Imparting basic knowledge about the environment and its allied problems.
3. Developing an attitude of concern for the environment.

Learning Outcomes:
The Environmental Studies facilitates students’ understanding of complex environmental
issues from a problem-oriented, interdisciplinary perspective. After successful completion of
the course the students will
1. Understand key concepts from economic, political, and social analysis as they pertain to
the design and evaluation of environmental policies and institutions.
2. Appreciate concepts and methods from ecological and physical sciences and their
application in environmental problem solving.
3. Appreciate the ethical, cross-cultural, and historical context of environmental issues and
the links between human and natural systems.
4. Reflect critically about their roles and identities as citizens, consumers and environmental

UNIT I 9 Hrs
Multidisciplinary nature of environmental studies: Definition, scope and importance; Need
for public awareness; Natural Resources: Renewable and non-renewable resources; Forest
resources: Water resources: Mineral resources; Food resources: Energy resources: Land
resources; Equitable use of resources for sustainable lifestyles; Natural resources and
associated problems.

UNIT II 9 Hrs
Ecosystems: Concept of an ecosystem.; Introduction, types, characteristic features, structure
and function of the following ecosystem: - Forest ecosystem; Grassland ecosystem; Desert
ecosystem; Aquatic ecosystems (ponds, streams, lakes, rivers, oceans, estuaries) Environment
Protection Act,1986; Public awareness.; Environment and human health.

UNIT III 9 Hrs

Biodiversity and its conservation: Introduction – Definition- genetic, species and ecosystem
diversity.; Biogeographical classification of India; India as a mega-diversity nation; Hot-sports
of biodiversity.; Threats to biodiversity: habitat loss, poaching of wildlife, man-wildlife
conflicts.; Endangered and endemic species of India; Conservation of biodiversity: In-situ and
Ex-situ conservation of biodiversity.
UNIT IV 9 Hrs
Environmental Pollution Definition; Cause, effects and control measures of Air pollution;
Water pollution; Soil pollution; Marine pollution; Noise pollution; Thermal pollution and
nuclear hazards - Solid waste Management: Causes, effects and control measures of urban and
industrial wastes. - Role of an individual in prevention of pollution - Disaster management:
floods, earthquake, cyclone and landslides.
UNIT V 9 Hrs
Social Issues and the Environment: From Unsustainable to Sustainable development; Water
conservation- rain water harvesting- watershed management; Resettlement and rehabilitation
of people; its problems and concerns.; Environmental ethics: Issues and possible solutions.;
Climate change, global warming, acid rain, ozone layer depletion, nuclear accidents and
holocaust - Wasteland reclamation.; Consumerism and waste products.; Population and
environment

Text Books:
1. A Textbook of Environmental Studies (English, Paperback, Asthana D. K.) S.Chand
& co, New Delhi
2. Textbook of Environmental Studies for Undergraduate Courses, Erach BHaruchu,
UGC, KINDLE Edition, Amazon.

Reference books:
1. Encyclopedia of Environment and Society- set of 5 volumes, Sage Publications
BTAL1802: BASIC ELECTRICAL & ELECTRONICS ENGINEERING LAB L T P C
0 0 2 1

Course Objectives:
1. Understand the Thevenin’s networks, DC Machines Speed Control, Brake test, No load
test, simple test on single phase transformer and 3-phase Induction motor.
2. Understand the nature and scope of modern electronics, describe physical models of basic
components, design and construct simple electronic circuits to accomplish a specific
function, e.g., designing amplifiers and understand their capabilities and limitations and
make decisions regarding their best utilization in a specific situation.

Course Outcomes:
After completing this course, the student will be able to:
1. Understand the Thevenin’s Theorem in circuit analysis, speed control methods of DC
motor with and without loading along with performance, working of single-phase
transformer at no load conditions, the performance of three phase induction motor,
different.
2. Identify, Specify and test R, L, C Components (Colour Codes), Potentiometers, Switches,
Coils, Relays.
3. Identify, Specify and test Active Devices, Diodes, BJTs, Low power JFETs.
4. Explain and demonstrate working of PN Junction and Zener diode.
5. Explain and demonstrate working Half and Full wave Rectifier without filters.
6. Demonstrate working of CE characteristics and its application as an amplifier.

Part A: Electrical experiments

1. Verification of Thevenin’s Theorem.
2. Speed control of DC shunt motor by: a) Armature Voltage Control
b) Field flux control method.
3. Brake test on DC shunt motor.
4. Swinburn’s test on DC shunt machine.
5. OC & SC tests on Single – Phase transformer (Predetermination of efficiency and
regulation at given power factors).
6. Brake test on 3-phase induction motor (performance characteristics).

Part B: (Electronics Laboratory experiments)

1. Identification of various electronic components and Devices
Specifications, Testing of R, L, C Components (Colour Codes), Potentiometers, Bread
Boards.
2. Identification and Specifications of Active Devices like Diodes, BJTs, JFET etc.
Study and operation of
3. Digital Multi meters
4. Function Signal Generator
5. Regulated Power Supplies
6. Study and Operation of CRO: Measurement of amplitude and frequency. Time Period
measurement
7. PN Junction and Zener diode characteristics A. Forward bias B. Reverse bias.
8. Half wave and Full wave Rectifiers.
9. Transistor CE characteristics (Input and Output)
10. FET characteristics
11. CE Amplifier
BTAL1301: DATA STRUCTURES LAB L T P C
0 0 2 1
Course Description:
This lab course is intended to make students to implement various techniques, algorithms of
data structures which can make them more effective designer, developer.

Course Objectives:
The main objective of conducting this lab is to enable the students to:
1. Get practical knowledge of data structures learned in the class room.
2. Extend programming ability using a structured programming approach.
3. Build and manipulate linear and non-linear data structures, including stacks, queues,
linked lists, trees and graphs.
4. Choose the appropriate data structure to use in solving the typical computer science
problems.
1. Write a C program that implements Stack & Queue operations using arrays
2. Write a C program that uses Stack operations to perform the following
a) Converting Infix expression to Postfix expression.
b) Evaluating the Postfix expression.
3. Write a C program that implements Circular Queue and Dequeue operations using Arrays.
4. Write a C program that implements Stack & Queue operations using Pointers
5. Write a C program that uses functions to perform the following operations on singly linked
list.
i) Creation ii) Insertion iii) Deletion iv) Traversal
6. Write a C program that uses functions to perform the following operations on doubly linked
list.
i) Creation ii) Insertion iii) Deletion iv) Traversal
7. Write a C program that uses functions to perform the following operations on circular linked
list.
i) Creation ii) Insertion iii) Deletion iv) Traversal
8. Write C programs that use both recursive and non recursive functions to perform the
following searching operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
9. Write a C program that implements the following sorting methods to sort a given list of
integers in ascending order
i) Bubble sort ii) Selection sort iii) Insertion sort iv) Merge Sort v) Quick sort
10. A) Write a C program that uses functions to perform the following Binary Tree Traversals
a) Inorder b) Preorder c) Postorder
B) Write a C program to implement the following graph traversals
a) Depth-First Search b) Breadth- First Search
Course Outcomes:
After Completing this lab, the student must be able to:
1. Demonstrate the algorithms of various data structures.
2. Emphasize the specification of each data structure as an abstract data type before
discussing implementations and application of the structure.
3. Aware of the importance of dynamic allocation and operations of linked lists.
4. Solve the problems by selecting appropriate searching and sorting method.
5. Traverse the binary tree and graph.

Text Books:
1. Data Structures: A Pseudo code Approach with C, 2nd Edition, R. F. Gilberg and B. A.
Forouzan, Cengage Learning.

Reference Books:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and
2. Susan Anderson Freed, Universities Press.
3. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein,
PHI/Pearson Education.
BTAL1302: PYTHON PROGRAMMING LAB L T P C
0 0 2 1
Course Description:
This lab provides coding exercises on various commonly used concepts like, data structures,
writing custom functions, and reading and writing to files. With the gain of the knowledge
the students can solve the real-world problems quickly using python constructs and can
develop simple html pages.

Course Objectives:
The objective of conducting this lab is to enable the students to:
1. Understand python programming basics and paradigm.
2. Learn and develop python looping, control statements and string manipulations.
3. Get familiar with the concepts of data structures and should organize, retrieve the data.
4. Know the concepts of file handling and modular programming.
5. Develop the programs using multi dimension lists and creation of simple html pages.
1. Basics & operations
a) Running instructions in Interactive interpreter and a Python Script.
b) Write a program to purposefully raise Indentation Error and correct it.
c) Write a program to compute distance between two points taking input from the user
(Pythagorean Theorem).
d) Write a program add.py that takes 2 numbers as command line arguments and prints its
sum.
2. Control Flow
a) Write a Program for checking whether the given number is a even number or not.
b) Using a for loop, write a program that prints out the decimal equivalents of 1/2, 1/3, 1/4,
. . . ,1/10.
c) Write a program using a for loop that loops over a sequence. What is sequence?
d) Write a program using a while loop that asks the user for a number, and prints a
countdown from that number to zero.
3. Control Flow - Continued
a) Find the sum of all the primes below 200.
Each new term in the Fibonacci sequence is generated by adding the previous two terms.
By
starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89,...
b) By considering the terms in the Fibonacci sequence whose values do not exceed 400, find
the sum of the even-valued terms.
4. DS
a) Write a program to count the numbers of characters in the string and store them in a
dictionary data structure
b) Write a program to use split and join methods in the string and trace a birthday with a
dictionary data structure.
c) Write a program combining lists that combines these lists into a dictionary.
 d) Write a program to count the frequency of characters in a given file. Can you use character
frequency to tell whether the given file is a Python program file, C program file or a text file?
5. Files
a) Write a program to print each line of a file in reverse order.
b) Write a program to compute the number of characters, words and lines in a file.
6. Functions
a) Write a function ball collide that takes two balls as parameters and computes if they are
colliding. Your function should return a Boolean representing whether or not the balls are
colliding.
Hint: Represent a ball on a plane as a tuple of (x, y, r), r being the radius
If (distance between two balls centers) <= (sum of their radii) then (they are colliding)
b) Find mean, median, mode for the given set of numbers in a list.
7. Functions - Continued
a) Write a function nearly equal to test whether two strings are nearly equal. Two strings a
and b are nearly equal when a can be generated by a single mutation on b.
b) Write a function dups to find all duplicates in the list.
c) Write a function unique to find all the unique elements of a list.
8. Functions - Problem Solving
a) Write a function cumulative product to compute cumulative product of a list of numbers.
b) Write a function reverse to reverse a list. Without using the reverse function.
c) Write a function to compute gcd,lcm of two numbers. Each function shouldn’t exceed
one line.
9. Multi-D Lists
a) Write a program that defines a matrix and prints.
b) Write a program to perform addition of two square matrices.
c) Write a program to perform multiplication of two square matrices.
10 - Modules
a) Install packages requests, flask and explore them using (pip).
b) Write a script that imports requests and fetches content from the page Eg. (Wiki).
c) Write a simple script that serves a simple HTTP Response and a simple HTML Page.
Course Outcomes:
After completion of the course, the student will be able to:
1. Acquire the knowledge to develop basic Python scripts.
2. Implement the python scripts using conditional and looping statements.
3. Format the data and can organize, retrieve, modify the data easily.
4. Manipulate the files and can simplify the code by modularizing.
5. Install packages and can write scripts to develop simple HTML pages.
References:
1. Think Python, Allen Downey, Green Tea Press.
2. Core Python Programming, W.Chun, Pearson.
3. Introduction to Python, Kenneth A. Lambert, Cengage.
III SEMESTER
BTAT2701: Discrete Mathematics and Graph Theory L T P C
3 1 0 4
Course Description:
The purpose of this course is to understand and use (abstract) discrete structures that are
backbones of computer science. Introduce the concepts of mathematical logic and gain
knowledge in sets, relations and functions and Solve problems using counting techniques and
combinatorics and to introduce generating functions and recurrence relations. Use Graph
Theory for solving real world problems.

Course Objectives:
1. To explain about the Algebra, Graph theory and Recurrence relations.
2. To demonstrate the application of basic methods of discrete mathematics in Computer
Science problem solving.
3. To elucidate solving mathematical problems from algorithmic perspective.
4. To introduce the mathematical concepts which will be useful to study advanced courses
Design and Analysis of Algorithms, Theory of Computation, Cryptography and Software
Engineering etc.
5. To reveal how solutions of graph theory can be applied to computer science problems
UNIT-I 12 Hrs
Mathematical Logic:
Introduction, Statements and Notation, Connectives, Well-formed formulas, Tautology,
Duality law, Equivalence, Implication, Normal Forms, functionally complete set of
connectives, Inference Theory of Statement Calculus, Predicate Calculus, Inference theory of
Predicate Calculus.
UNIT-II 12 Hrs
Set Theory:
Basic Concepts of Set Theory, Relations and Ordering, Functions composition of
functions, Inverse Functions, Lattices and its properties. Algebraic structures: Algebraic
Systems-Examples and General Properties, Semi groups and Monoids, groups, sub groups,
homomorphism, Isomorphism.
UNIT-III 12 Hrs

Elementary Combinatorics:

Basics of Counting, Combinations and Permutations, Enumeration of Combinations and

Permutations, Enumerating Combinations and Permutations with Repetitions,
Enumerating Permutations with Constrained Repetitions, Binomial Coefficients, The
Binomial and Multinomial Theorems, The Principle of Inclusion-Exclusion.
UNIT-IV 12 Hrs
Recurrence Relations:
Generating Functions of Sequences, Calculating Coefficients of Generating Functions,
Recurrence relations, Solving Recurrence Relations by Substitution and Generating functions,
The Method of Characteristic roots, Solutions of Inhomogeneous Recurrence Relations.
UNIT-V 12 Hrs
Graphs:
Basic Concepts, Isomorphism and Subgraphs, Trees and their Properties, Spanning Trees,
Directed Trees, Binary Trees, Planar Graphs, Euler’s Formula, Multigraphs and Euler Circuits,
Hamiltonian Graphs, Chromatic Numbers, The Four-Color Problem
Course Outcomes:
After completion of the course, students will be able to
1. Apply mathematical logic to solve problems.
2. Understand the concepts and perform the operations related to sets, relations and functions,
gain the conceptual background needed and identify structures of algebraic nature.
3. Apply basic counting techniques to solve combinatorial problems.
4. Formulate problems and solve recurrence relations.
5. Apply Graph Theory in solving computer science problems.
Text Books:
1. Joe L. Mott. Abraham Kandel and Theodore P. Baker, “Discrete Mathematics for
Computer Scientists & Mathematicians”, 2nd Edition, Pearson, 2008. (For Units III to
V).
2. J P Trembly and R Manohar, “Discrete Mathematical Structures with Applications to
Computer Science”, 1st Edition, McGraw Hill, 2017(For Unit I&II).
Reference Books:
1. Ralph P. Grimaldi and B.V. Ramana, “Discrete and Combinatorial
Mathematics, an Applied Introduction”, 5th Edition, Pearson, 2016.
2. Narsingh Deo, “Graph Theory with Applications to Engineering”, Prentice
Hall, 1979.
3. D.S. Malik and M.K. Sen, “Discrete Mathematics theory and Applications”, I st
Edition, Cenegage Learning, 2012.
4. C L Liu and D P Mohapatra, “Elements of Discrete Mathematics, A computer
Oriented approach”, 4th Edition, MCGRAW-HILL, 2018.
 BTAT2301: Design and Analysis of Algorithms L T P C
3 1 0 4
Course Description:
Design and analysis of algorithms is the process of finding the computational complexity of
algorithms. It helps to design and analyse the logic on how the algorithm will work before
developing the actual code for a program. It focuses on introduction to algorithm, asymptotic
complexity, sorting and searching using divide and conquer, greedy method, dynamic
programming, backtracking, branch and bound. NP-hard and NP-complete problems. The
applications of algorithm design are used for information storage, retrieval, transportation
through networks, and presentation to users.
Learning Objectives:
1. To analyse the asymptotic performance of algorithms.
2. To apply important algorithmic design paradigms and methods of analysis.
3. To synthesize efficient algorithms in common engineering design situations.
4. Methods and techniques for analysing the correctness and resource requirements of
algorithms.

UNIT I 12 Hrs
Introduction
Algorithm - Pseudo Code for Expressing Algorithms - Performance Analysis- Space
Complexity - Time Complexity- Asymptotic Notation - Big Oh Notation - Omega Notation -
Theta Notation and Little Oh Notation. - Recurrences - Substitution method, Recursion-tree
method, Master method.
UNIT II 12 Hrs
Disjoint Sets, Divide And Conquer
Disjoint Sets: Disjoint Set Operations - Union and find Algorithms
Divide and Conquer: General Method - Applications-Binary Search – Quick Sort - Merge Sort-
Strassen’s Matrix Multiplication.
UNIT III 12 Hrs
Dynamic Programming
General Method –Applications-Matrix Chain Multiplication - Optimal Binary Search Trees -
0/1 Knapsack Problem - All Pairs Shortest Path Problem - Travelling Sales Person Problem –
Reliability Design Problem.
UNIT IV 12 Hrs
Greedy Method And Backtracking
Greedy Method: General Method –Applications- Job Sequencing with Deadlines - Knapsack
Problem - Minimum Cost Spanning Trees - Single Source Shortest Path Problem -
Backtracking:
General Method – Applications-N-Queens Problem - Sum of Subsets Problem - Graph
Colouring - Hamiltonian Cycles.
UNIT V 12 Hrs
Branch And Bound, Np-Hard And Np-Complete Problems
Branch And Bound: General Method - Applications - Travelling Sales Person Problem - 0/1
Knapsack Problem- LC Branch and Bound Solution - FIFO Branch and Bound Solution.
NP Hard and NP-Complete Problems: Basic Concepts - Non deterministic algorithms - NP –
Hard and NP Complete Classes - Cook’s Theorem.
Course Outcome:
1. To gain knowledge of time complexity, space complexity and recurrence methods.
2. To design searching and sorting algorithms along with divide and conquer method and
disjoint sets.
3. To apply Dynamic Programming design technique for problem solving.
4. To apply Greedy and back tracing design technique for problem solving
5. To understand the branch and bound algorithms for solving the complex problems
Text Book(s)
1. Ellis Horowitz, Satraj Sahni, Sanguthevar Rajasekharan, “Fundamentals of Computer
Algorithms”, Universities Press, 2nd Edition, 2015.
2. Alfred V. Aho, John E. Hopcroft, Jeffrey D, “The Design And Analysis Of Computer
Algorithms”, Pearson India, 1st Edition, 2013.
Reference Books
1. Knuth Donald E, “Art of Computer Programming: Fundamental Algorithms Volume 1 -
Fundamental Algorithms”, Third Edition, Pearson Publishers, 2011.
2. Levitin A, “Introduction to the Design and Analysis of Algorithms”, Pearson Education,
3rd Edition, 2012.
3. Thomas H. Cormen, C.E. Leiserson, R L.Rivest and C. Stein, Introduction to Algorithms
, Third edition, MIT Press, 2009
Jon Kleinberg, ÉvaTardos , Algorithm Design, Pearson education, 2014
BTAT2302: Object Oriented Programming through Java L T P C
3 0 0 3
Course Description:
The course introduces object-oriented programming (OOP) concept and OOP based software
development methodology. In this course the students learn object-oriented nature of Java. Java
is a class based and OOP language used to demonstrate and implement appropriate concepts
and techniques.
Learning Objectives:
1. Understand the basic concepts of Object-Oriented Programming principles.
2. Acquire knowledge of object-oriented paradigm in the Java programming language.
3. Develop programs belongs to concepts of Inheritance, Data Abstraction.
4. Understand handling exceptions, streams, applets.
5. Use Java in a variety of technologies and on different platforms.

UNIT I: An Overview of Java:

Evolution of java, Object Oriented Programming, Data types, Type conversion and casting,
Automatic Type Promotion in Expressions, Arrays, strings, Arithmetic Operators, Operator
Precedence

Control Statements: Java’s selection Statements, Iteration statements, Jump Statements.

Case study

UNIT II: Introducing classes:

Class Fundamentals, Declaring Objects, Introducing Methods, Constructors, Argument

Passing, Returning Objects, Recursion, Using Object as Parameter, This Keyword

Overloading Methods and constructors, static and final keywords, Introducing Nested and
Inner classes, exploring the String class, Using Command line Arguments
Case study

UNIT III: Inheritance:

Inheritance Understanding Inheritance, Types of Inheritance Significance of Inheritance,

Constructor call in Inheritance, use of super keyword in Java, Polymorphism, Understanding
Polymorphism, Significance of Polymorphism in Java, Method Overriding, Dynamic Method
Dispatching.

Data Abstraction:
Basics of Data Abstraction, Understanding Abstract classes, Understanding Interfaces,
Multiple Inheritance Using Interfaces, Packages, Access protection, Importing Packages
Case study

UNIT-IV: Exception Handling:

Exception handling Fundamentals, Exception Types, Uncaught Exceptions, Using try and
catch, Multiple catch clauses, Nested try statements, throw, throws, finally, Java Built-in
Exceptions, creating your own exception subclasses, Chained Exceptions, Three Recently
added Exceptions features, Using Exceptions.

Stream: I/O basics, Reading Console input, writing console Output, The Printwriter class,
Reading and writing files, automatically closing a file. Applet class, lifecycle of an Applet.
Case study
UNIT-V:

Event Handling - The Delegation event model- Events, Event sources, Event Listeners,
Event classes, Handling mouse and keyboard events, Adapter classes, Inner classes,
Anonymous Inner classes.

Swing (JFC) - Introduction, difference between and swing, Components Hierarchy, Panes,
Individual Swings Components JLabel, JButton, JTextField, JTextArea, JScrollpane,
JCombobox
Networking - Introduction to JDBC Connectivity, Remote Method Invocation (RMI), Client
server communications
Case study

Course Outcomes:
1. Understand the basics of java programming like variables, operators, and control
statements.
2. Design and implement object oriented (OO) programs to solve problems.
3. Analyze the importance of Inheritance and learn how to implement data abstraction.
4. Understand the concept of Exception Handling and streams.
5. Learn to create user interface using swing components.

Text Books:
1. ”Java the Complete Reference”, Herbert Schildt, MCGRAW HILL Education, 9th
Edition, 2016.
2. “Understanding Object – Oriented Programming with Java”, T. Budd, updated edition,
Pearson Education, 2000.

Reference Books:
5. “Programming with Java” T.V.Suresh Kumar, B.Eswara Reddy, P.Raghavan Pearson
Edition.
6. “Object Oriented Programming through Java”, P. Radha Krishna, 1 st edition, Universities
Press, 2007.
7. “Java Programming and Object Oriented Application Development”, 1 st Edition,
Cengage Learning, 2006.
8. “An Introduction to programming and OO Design using Java”, updated edition, Pearson
Education, 2000.
BTAT2801: Digital Logic design L T P C
3 0 0 3
Course Description
Foundation in design and analysis of the operation of digital gates. Design and implementation
of combinational and sequential logic circuits. Concepts of Boolean algebra, Karnaugh maps,
flip-flops, registers, and counters and VHDL Programming for Digital Circuits.
Learning objectives:
1. Provides introduction to logic designs and the basic building blocks used in digital systems.
2. To understand the number systems and codes, Boolean algebra, and logic gates.
3. To minimize the logical functions using Boolean algebra, K-maps, tabular method, and also
to understand combinational circuits.
4. To understand different sequential circuits and different Arithmetic circuits.
5. To understand VHDL programming for digital circuits

UNIT-I 8 Hrs
Number Systems and Codes: Decimal, Binary, Octal, and Hexa-decimal number systems and
their conversions, ASCII code, Excess-3 code, Gray code, Complement representation of
negative numbers: Signed Magnitude, One’s complement method, Two’s complement method,
Binary Arithmetic.

UNIT-II 8 Hrs
Logic Simplification and Combinational Logic Design: Review of Boolean Algebra and De
Morgan’s Theorem, SOP & POS forms, Canonical forms, Karnaugh maps up to 6 variables,
Binary codes, Code Conversion.

UNIT-III 10 Hrs
Combinational Logic Design: Analysis of combinational circuits, Design Procedure – Binary
Adder, Subtractor, BCD Adder, multiplier, comparator, decoders, encoders, multiplexers,
demultiplexers, Code Converters.

UNIT-IV 10 Hrs
Sequential Circuits: Latches: RS latch and JK latch, Flip-flops: RS, JK, D, T flip flops, Master-
slave flip flops, Edge-triggered flip-flops. Shift registers, Universal Shift register, ripple
counters, synchronous counters, Ring counter, Johnson counter, Up-Down counter.

UNIT V 9 Hrs
VLSI Design flow: Design entry, Schematic, HDL, different modeling styles in VHDL, Data
types and objects, Dataflow, Behavioural and Structural Modeling, Synthesis and Simulation
VHDL constructs and codes for combinational and sequential circuits.

Course Outcomes: At the end of the course the student will be able to
CO1: understand significance of number systems, conversions, binary codes (L2)
CO2: apply different simplification methods for minimizing boolean functions (L3)
CO3: illustrate knowledge on design of various combinational circuits (L3)
CO4: illustrate the concept of sequential logic design, analyze the operation of flip-flops,
registers, and counters (L3)
CO5: Discuss the Use of HDL & appropriate EDA tools for digital logic design and simulation.
(L2)

Text Books:
1. M. Morris Mano and Michael D. Ciletti, Digital Design, 4th Edition, Pearson Education,
2013.
2. D.V. Hall, “Digital Circuits and Systems”, Tata McGraw Hill, 1989
Reference Books:
1. Anand Kumar, Switching Theory and Logic Design, 2nd Edition, PHI, 2014.
2. Charles Roth, “Digital System Design using VHDL”, Tata McGraw Hill 2nd edition 2012.
3. R.P. Jain, “Modern digital Electronics”, Tata McGraw Hill, 4th edition, 2009.
BTAL2301: Java Programming Lab L T P C
0 0 2 1
Learning Objectives:
1. Learn to use object orientation to solve problems and use java language to
implement them.
2. To experiment with the syntax and semantics of java language and gain
experience with java programming.
3. Illustrate inheritance concepts for reusing the program.
4. Design and develop GUI based applications using applets.
5. Understand and use of GUI components.

LIST OF EXPERIMENTS:

1) Preparing and practice – Installation of Java software, study of any Integrated

development environment, sample programs on operator precedence and associativity,
class and package concept, scope concept, control structures, constructors and
destructors. Learn to compile, debug and execute java programs.

2) a) Write Java program(s) to display n prime numbers.

b) Write Java program(s) to multiply two matrices.

3) a) Write a Java program to create a student class with following fields

i. Hall ticket number
ii. Student Name
iii. Department Create ‘n’ number of Student objects where ‘n’ value is passed
as input to constructor.
b) Write a Java program to demonstrate String comparison using == and equals method.

4) Write a program in JAVA to demonstrate the method and constructor overloading.

5) a) Demonstrate the implementation of inheritance (multilevel, hierarchical and multiple)

by using extend and implement keywords.
b) Write a java program to implement the concept of dynamic method dispatch.

6) a) Write a java program to implement stack concept using interface.

b) Write a java program to demonstrate the differences between access specifiers.

7) a) Write a java program to create a user defined exception that displays an error
message when user enters an integer value greater than n.
b) Write a program to develop an applet that displays a simple message.

8) a) Write a java program to split a given text file into n parts. Name each part as the
name of the original file followed by .part<n> where n is the sequence number of the
 part file.
b) Write a java program to create a super class called Figure that receives the
dimensions of two dimensional objects. It also defines a method called area that
computes the area of an object. The program derives two subclasses from Figure.

9) a) Design a simple calculator which performs all arithmetic operations.

b) Write a java program to handle keyboard and mouse events

10) a) Understand the process of graphical user interface design and implementation using
swings.
b) Write a Program that creates User Interface to perform Integer Divisons. The user
enters two numbers in text fields, Num1 and Num2.The division of Num1 and Num2
is displayed in the result field when the divide button clicked. If Num1 or Num2
were not integer, the program would throw a NumberFormatException,If Num2 is
Zero, and the program wouldthrow an Arithmeticexception. Display theException in
message box.

Course Outcomes:
After the completion of this course the student be able to:
1. Solve the problem using object-oriented approach and design solutions which
are robust.
2. Develop portable programs which work in all environments using classes and
objects.
3. Write the programs illustrating inheritance concept.
4. Create user defined exceptions and user friendly interfaces.
5. Ability to design user interface which can handle keyboard and mouse events.
BTAL2801: Digital Logic design Lab L T P C
0 0 2 1
LIST OF EXPERIMENTS (Hardware)
1. Realization of Boolean Expressions using Gates
2. Design and realization of logic gates using universal gates
3. Design and realization of a 4 – bit Gray to Binary and Binary to Gray Converter
4. Verify the functionality of Mux and De-Mux ICs
5. Verify the functionality of Encoder and Decoder ICs
6. Design and realization of 4-bit comparator
7. Verify the functionality of D & T Flip-Flop ICs
8. Verify the functionality of S-R & J-K Flip-Flop ICs
9. Mod-N counter using 7490 and 74190.
10. Shift register IC 7495.

LIST OF EXPERIMENTS (Hardware)

VHDL Programming:
1. Write structural and dataflow VHDL models for
a) Half adder / Half subtractor b) Full adder / Full subtractor
2. Write a VHDL program in structural model for
a) 16:1 mux realization b) 3:8 decoder realization through 2:4 decoder
3. Write a VHDL program in behavioural model for
a) 3:8 decoder b) 8:3 encoder
4. Write a VHDL program in structural and behavioural models for 8 bit asynchronous up-
down counter
5. Write a VHDL program in structural model for 8-bit Universal Shift Register.

Course Outcomes: At the end of this course students will have the ability to
1. Construct Basic combinational Circuits and Verification of its functionality
2. Construct Sequential Circuits and Verification of its functionality
3. Write structural, behavioural and data flow models for digital circuits
4. Simulate VHDL models of digital circuits
IV SEMESTER
BTAT2702 Deterministic Stochastic and Statistical Methods L T P C
3 1 0 4
Course Description:
This course provides a study of various Mathematical Methods and Statistical Methods which
is needed for Artificial Intelligence, Machine Learning, and Data Science and also for
Computer Science and engineering problems. This course will be rigorous, and will explore
the rich and fascinating math behind some of the popular techniques and intellectual ideas of
modern-day data science and machine learning.
Course Objectives:
1. To employ methods related to these concepts in a variety of data science applications.
2. To adopt a rigorous and mathematical approach to solving problems in machine learning
and data science.
3. To apply the mathematical concepts discussed over the duration of the course.
4. To apply the concepts of probability and distributions to some case studies.
5. To Correlate results to the solution approach followed (Analysis).
UNIT-I 12 Hrs
Data Representation:
Distance measures, Projections, Notion of hyper planes, half-planes. Principal Component
Analysis- Population Principal Components, sample principal coefficients, covariance, matrix
of data set, Dimensionality reduction, Singular value decomposition, Gram Schmidt process.
UNIT-II 12 Hrs
Single Variable Distribution:
Random variables (discrete and continuous), probability density functions, properties,
Mathematical Expectation - Probability distribution - Binomial, Poisson approximation to
the binomial distribution and normal distribution their properties-Uniform distribution-
exponential distribution.
UNIT-III 12 Hrs
Stochastic Processes and Markov Chains:
Introduction to Stochastic processes- Markov process. Transition Probability, Transition
Probability Matrix, First order and Higher order Markov process, step transition
probabilities, Markov chain, Steady state condition, Markov analysis.
UNIT-IV 12 Hrs
Multivariate Distribution Theory:
Multivariate Normal distribution – Properties, Distributions of linear combinations,
independence, marginal distributions, conditional distributions, Partial and Multiple
correlation coefficient. Moment generating function. BAYESIAN INFERENCE AND ITS
APPLICATIONS: Statistical tests and Bayesian model comparison, Bit, Surprisal, Entropy,
Source coding theorem, Joint entropy, Conditional entropy, Kullback-Leibler divergence.
UNIT-V 12 Hrs
Optimization:
Unconstrained optimization, Necessary and sufficiency conditions for optima, Gradient
descent methods, Constrained optimization, KKT conditions, Introduction to non-gradient
techniques, Introduction to least squares optimization, Optimization view of machine learning.
Data Science Methods: Linear regression as an exemplar function approximation problem,
linear classification problems.

Course Outcomes:
After completion of the course, students will be able to
1. Apply logical thinking to problem-solving in context.
2. Employ methods related to these concepts in a variety of data science applications.
3. Use appropriate technology to aid problem-solving and data analysis.
4. The Bayesian process of inference in probabilistic reasoning system.
5. Demonstrate skills in unconstrained optimization.
Text Books:
1. Mathematics for Machine Learning by A. Aldo Faisal, Cheng Soon Ong, and Marc
Peter Deisenroth.
2. Dr. B.S Grewal, Higher Engineering Mathematics, 45th Edition, Khanna Publishers.
3. S. D. Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut,
Delhi.
Reference Books:
1.. Operations Research, An Introduction, Hamdy A. Taha, Pearson publishers.
2. A Probabilistic Theory of Pattern Recognition by Luc Devroye, Laszlo Gyorfi,
Gabor Lugosi.
3. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna publications.
BTAT2901 Management for Engineers L T P C
3 0 0 3
Course Description: This course is intended to help the students to learn the basic concepts
and functions of management and its role in the performance of an organization and to
understand various decision-making approaches available for managers to achieve
excellence. Learners shall have a broad view of different functional areas of management like
operations, human resource, finance and marketing.
Learning Objectives:
1. Introducing fundamental concepts of management that helps student understand
intricacies of management world around us.
2. Introducing management aspects of nature starting from the basics and critical concepts
of different nature,
3. Introducing decision making and functional areas of management
4. Introducing various aspects related to entrepreneurship

UNIT I Introduction to management Theory 12 Hrs

Introduction to management theory, Management Defined, Characteristic of Management,
Management as an art-profession, System approaches to Management, Task and
Responsibilities of a professional Manager, Levels of Manager and Skill required.
UNIT II Management and Organization 12 Hrs
Management Process, Planning types, Mission, Goals, Strategy, Programmes, Procedures,
Organising, Principles of Organisation, Delegation, Span of Control, Organisation Structures,
Directing, Leadership, Motivation, Controlling.
UNIT III Productivity and decision making 12 Hrs
Concept of productivity and its measurement; Competitiveness; Decision making process;
decision making under certainty, risk and uncertainty; Decision trees; Models of decision
making
UNIT IV Functional areas of management 12 Hrs
Introduction to functional areas of management, Operations management, Human resources
management, Marketing management, financial management.
UNIT V Entrepreneurship 12 Hrs
Introduction to entrepreneurship -Entrepreneurship in India, Role of Government, Business
plans, Corporate social responsibility, Patents and Intellectual property rights.
Course Outcomes:
1. Basic knowledge of management aspects
2. Understanding of organisations
3. Understanding of the productivity and decision-making concepts
4. Understanding entrepreneurship
Text Books:
1. H. Koontz, and H. Weihrich, Essentials of Management: An International Perspective. 8th
ed., McGraw-Hill, 2009.
2. Robbins, S. P., Judge, T., Vohra, N. (2013). Organizational Behavior. India: Pearson.

Reference Books:
1. P. Kotler, K. L. Keller, A. Koshy, and M. Jha, Marketing Management: A South Asian
Perspective. 14th ed., Pearson, 2012.
2. M. Y. Khan, and P. K. Jain, Financial Management, Tata-McGraw Hill, 2008.
3. R. D. Hisrich, and M. P. Peters, Entrepreneurship: Strategy, Developing, and Managing a
New Enterprise, 4th ed., McGraw-Hill Education, 1997.
4. D. J. Sumanth, Productivity Engineering and Management, McGraw-Hill Education, 1985.
5. K. Ashwathappa, ‘Human Resources and Personnel Management’, TMH, 3 rd. edition,
2005.
6. R. B. Chase, Ravi Shankar and F. R. Jacobs, Operations and Supply Chain Management,
14th ed. McGraw Hill Education (India), 2015.
7. P C Tripathi and P N Reddy, Principles of management, TMH, 4th edition, 2008.
BTAT2501 Data Science for Beginners L T P C
3 0 0 3
Course Description:
Data science is the domain of study that deals with vast volumes of data using modern tools
and techniques to find unseen patterns, derive meaningful information, and make business
decisions. Data science uses complex machine learning algorithms to build predictive models.
how to collect and manage data responsibly and ultimately use it to make informed decisions.
Learning Objectives:
1. An understanding of the data operations
2. An overview of simple statistical models and the basics of machine learning techniques
of regression.
3. An understanding good practices of data science
4. Skills in the use of tools such as python, IDE
5. Understanding of the basics of the Supervised learning

UNIT I Introduction, Toolboxes: Python, fundamental libraries for data Scientists. Integrated
development environment (IDE). Data operations: Reading, selecting, filtering, manipulating,
sorting, grouping, rearranging, ranking, and plotting.
UNIT II Descriptive statistics, data preparation. Exploratory Data Analysis data
summarization, data distribution, measuring asymmetry. Sample and estimated mean, variance
and standard score. Statistical Inference frequency approach, variability of estimates,
hypothesis testing using confidence intervals, using ‘p’ values
UNIT III Supervised Learning: First step, learning curves, training-validation and test.
Learning models generalities, support vector machines, random forest. Examples
UNIT IV Regression analysis, Regression: linear regression simple linear regression, multiple
& Polynomial regression, Sparse model. Unsupervised learning, clustering, similarity and
distances, quality measures of clustering, case study.
UNIT V Network Analysis, Graphs, Social Networks, centrality, drawing centrality of Graphs,
PageRank, Ego-Networks, community Detection
Course Outcomes:
By the end of this course the students will be able to,
1. Describe what Data Science is and the skill sets needed to be a data scientist.
2. Explain the significance of exploratory data analysis (EDA) in data science.
3. Ability to learn the supervised learning, SVM.
4. Apply basic machine learning algorithms (Linear Regression).
5. Explore the Networks, PageRank.

Text Books:
1. Introduction to Data Science a Python approach to concepts, Techniques and
Applications, Igual, L;Seghi’, S. Springer, ISBN:978-3-319-50016-4
2. Cathy O’Neil and Rachel Schutt, “Doing Data Science”, O'Reilly, 2015.
Reference Books:
1. Jojo Moolayil, “Smarter Decisions: The Intersection of IoT and Data Science”,
PACKT, 2016.
2. David Dietrich, Barry Heller, Beibei Yang, “Data Science and Big data Analytics”,
EMC 2013
3. Raj, Pethuru, “Handbook of Research on Cloud Infrastructures for Big Data Analytics”,
IGI Global.
4. Andrew Park, “Data Science for Beginners”, ISBN: 9798645845551, 2020.
BTAT2304 Database Management Systems L T P C
3 0 0 3
Course Description:
Database Management Systems is intended to provide a clear understanding of fundamentals
with emphasis on their applications to create and manage large data sets. It emphasizes on
technical overview of database software to retrieve data from database. This includes database
design principles, normalization, and concurrent transaction processing, security, recovery and
file organization techniques. This will provide adequate knowledge to understand future
evolutions of data technologies.
Course Objectives:
The objective of this course is to make students to:
1. Discuss the basic database concepts, applications, data models, schemas and instances
and design Entity Relationship (E-R) model for a database.
2. Demonstrate the use of integrity constraints, relational algebra operations and relational
calculus.
3. Describe the basics of SQL, construct queries using SQL, SQL functions, trigger and
cursor concepts in PL/SQL.
4. Understand reasoning about functional dependency and to make the students to identify
the role of normalization in database management systems.
5. To present the students with the knowledge of Transaction, concurrency and recovery
strategies of DBMS

UNIT I 12 Hrs
Database Systems And Entity Relationship Modeling
Database System Applications - Purpose of Database Systems - View of Data - Database
Languages - Database Users and Administrators - Various Components of overall Database
System Structure- Data Models-The Entity-Relationship Model - Attributes and Entity Sets -
Relationship Sets - Entity-Relationship Diagrams.

UNIT II: 12 Hrs

Relational Data Model
Introduction to the Relational Model - Integrity Constraints -Relational algebra selection and
projection - set operations- renaming – joins -division-examples of algebra queries- Tuple
Relational Calculus - Domain Relational Calculus-Expressive power of algebra and calculus.

UNIT III: 12 Hrs

Introduction to Sql
Structured Query Language (SQL): Introduction to SQL -Data types - Data Definition language
commands - Data Manipulation language Commands and Data control Language Commands
- Candidate Key - Primary key - Foreign key - Select Clause - Where Clause - Logical
Connectivity’s – AND - OR - Range Search - Pattern Matching - Order By - Group By - Set
Operations – Union - Intersect and Minus - Aggregate Functions - Join Operations. PL/SQL:
Control Structures - functions - Triggers and Cursors.
UNIT IV: 12 Hrs
Normalization
Introduction to Schema Refinement - Properties of Decompositions – Functional Dependencies
– Attribute closure - Normal Forms - First - Second - Third – BCNF - Basic definitions of
MVDs and JDs - Fourth and Fifth normal forms.

UNIT V:
Transaction Processing Concepts And Concurrency Control Techniques 12Hrs
Transaction Concept - Transaction States - Implementation of Atomicity and Durability -
Serializability - Recoverability - Concurrent Executions - Lock-Based Protocols for
Concurrency Control - Time Stamp-Based Protocol for Concurrency Control - Multiple
Granularity Recovery System: Recovery and Atomicity – Log based Recovery – Recovery with
Concurrent Transactions.

Course Outcomes:
After completion of the course - the student will be able to:
1. Demonstrate knowledge on Data models and Database Languages and Design Entity
Relationship model for a database
2. Analyse the relational database theory, and be able to write relational algebra and
relational calculus expressions for queries
3. Analyse and evaluate the databases using SQL DML/DDL Commands
4. Analyse databases using normal forms to provide solutions for real time applications
5. Understand the properties of transactions in a database system, Analyse concurrency
control techniques for handling concurrent transactions and understand recovery of data
from failures
Text Books:
3. Henry F. Korth, Silberchatz, Sudarshan, “Database System Concepts”, 7/e, 2019, Tata
McGraw-Hill, New York.
4. Raghu Rama Krishnan, “Database Management System”, 2/e, 2000, Tata McGraw Hill,
New York.
Reference Books:

1. Ramez Elmasri, Shamkant B. Navathe, "Fundamental Database Systems", Pearson

Education, 6th Edition, 2014.
2. Database Principles Fundamentals of Design Implementation and Management, Carlos
Coronel, Steven Morris, Peter Robb, Cengage Learning.
3. Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke, TMH
4. “Database Systems, Concepts, Design and Applications” by S.K.Singh, Pearson
Education.
BTAT2305 Operating Systems L T P C
3 1 0 4
Course Description:
This course examines the important problems in operating system design and
implementation. This discussion will cover the tradeoffs that can be made between
performance and functionality during the design and implementation of an operating system.
Particular emphasis will be given to three major OS subsystems: process management
memory management (segmentation, paging, swapping), and file systems; and on operating
system support for distributed systems.
Learning Objectives:
1. To introduce the operating system concepts, designs and provide skills required to
implement the services.
2. To describe the trade-offs between conflicting objectives in large scale system design.
3. To develop the knowledge for application of the various design issues and services.
Unit 1
Introduction to OS: Functionality of OS - OS design issues - Structuring methods
(monolithic, layered, modular, micro-kernel models) - Abstractions, processes.
OS Principles: System calls, System/Application Call Interface – Protection: User/Kernel
modes - Interrupts
Unit 2
Scheduling: Processes Scheduling - CPU Scheduling: Pre-emptive, non-pre-emptive –
Multiprocessor scheduling – Deadlocks - Resource allocation and management - Deadlock
handling mechanisms: prevention, avoidance, detection, recovery.
Concurrency: Inter-process communication, Synchronization - Implementing
synchronization primitives (Peterson’s solution, Bakery algorithm, synchronization
hardware) - Semaphores – Classical synchronization problems, Monitors: Solution to Dining
Philosophers problem
Unit 3
Memory Management : Main memory management, Memory allocation strategies, Virtual
memory: Hardware support for virtual memory (caching, TLB) – Paging - Segmentation -
Demand Paging - Page Faults – Page Replacement -Thrashing
Unit 4
Storage Management, Protection and Security : Disk structure and attachment – Disk
scheduling algorithms (seek time, rotational latency based)-System threats and security –
Policy vs mechanism - Access vs authentication
Unit 5
System protection: Access matrix – Capability based systems - OS: performance, scaling,
future directions in mobile OS, Recent Trends.
Course Outcome:
1. To interpret the evolution of OS functionality, structures and layers. System calls and to
find the stages of various process states.
2. To design a model scheduling algorithm to compute various scheduling criteria.
3. To apply and analyse communication between inter process and synchronization
techniques. Implement page replacement algorithms, memory management problems and
segmentation.
4. To differentiate the file systems for applying different allocation and access techniques.
Text Book(s)
1. Abraham Silberschatz, Peter B. Galvin, Greg Gagne-Operating SystemConcepts,
Wiley(2018).
2. Stallings (2006), Operating Systems, Internals and Design Principles, 5th edition,
Pearson Education, India.

Reference Books
1. Ramez Elmasri, A.Gil Carrick, David Levine, Operating Systems, ASpiral Approach-
McGrawHill Higher Education (2010).
2. Remzi H. Arpaci-Dusseau, Andrea C. Arpaci-Dusseau, Operating Systems, Three
EasyPieces, Arpaci-Dusseau Books, Inc (2015).
3. Andrew S. Tanenbaum, Modern Operating Systems, Pearson, 4 th Edition (2016).
4. William Stallings, Operating Systems: Internals and Design Principles, Pearson, 9 th
Edition (2018).
BTAT2502 Artificial Intelligence L T P C
3 0 0 3

Prerequisites:
1. A course on Computer Programming and Data Structures.
2. A course on Advanced Data Structures.
3. A course on Design and Analysis of Algorithms.
4. A course on Mathematical Foundations of Computer Science.
5. Some background in linear algebra, data structures and algorithms, and probability
will all be helpful.
Course Description:
Artificial Intelligence (AI) is a well-established, exciting branch of computer science
concerned with methods to make computers, or machines in general, intelligent - so that they
are able to learn from experience, to derive implicit knowledge from the one given explicitly,
to understand natural languages such as English, Arabic, or Urdu, to determine the content of
images, to work collaboratively together, etc. The techniques used in AI are as diverse as the
problems tackled: they range from classical logic to statistical approaches to simulate brains.
This pathway reflects the diversity of AI in that it freely combines a number of themes related
to AI techniques, namely making sense of Complex Data, Learning from Data, Reasoning and
Optimisation.
Learning Objectives:
The primary objective of this course is to introduce the basic principles, techniques, and
applications of Artificial Intelligence.
The course should enable the students to:
1. Artificial Intelligence (AI) is a fast-moving technology with impacts and implications
for both individual lives and society as a whole.
2. To analyse various search strategies in intelligent systems.
3. Become familiar with basic principles of AI towards problem solving, Inference,
Perception, Knowledge & Reasoning and Learning.
4. Investigate applications of AI techniques in intelligent systems, artificial neural
networks, machine learning models and Robotics.

UNIT-I 9 Hrs
Overview of Artificial Intelligence: AI problems, foundation of AI and history of AI
intelligent agents: Agents and Environments, the concept of rationality, the nature of
environments, structure of agents, problem solving agents, problem formulation.
UNIT – II 9 Hrs
Problem Solving and Search strategies: Searching- Searching for solutions, uniformed
search strategies – Breadth first search, depth first Search. Search with partial information
(Heuristic search) Hill climbing, A*, AO* Algorithms, Problem reduction, Game Playing-
Adversial search, Games, mini-max algorithm, optimal decisions in multiplayer games,
Problem in Game playing, Alpha-Beta pruning, Evaluation functions.
UNIT – III 9 Hrs
Knowledge and Reasoning: Knowledge representation issues, predicate logic- logic
programming, semantic nets- frames and inheritance, constraint propagation, representing
knowledge using rules, rules-based deduction systems. Reasoning under uncertainty, review of
probability, Bayes’ probabilistic interferences and Dempster-Shafer theory.
UNIT - IV 9 Hrs
Logic & Knowledge Representation: First order logic. Inference in first order logic,
propositional vs. first order inference, unification & lifts forward chaining, Backward chaining,
Resolution, learning from observation, Explanation based learning, Statistical Learning
methods, Reinforcement Learning.
UNIT - V 9 Hrs
Uncertain Knowledge and Reasoning, Learning, and Robotics: Uncertainty - Acting under
uncertainty - Basic probability notation - The axioms of probability - Bayes’ rule and its use -
Learning from observations - Forms of learning - Inductive learning - Learning decision trees.
Robotics: Introduction-Robot hardware - Robotic perception - Planning to move-Robotic
software Architectures - Application Domains.
Course Outcomes:
After completion of the course, students will be able to
1. Solve basic AI based problems.
2. Define the concept of Artificial Intelligence.
3. Apply AI techniques to real-world problems to develop intelligent systems.
4. Select appropriately from a range of techniques when implementing intelligent
systems.
Text Books:
1. Artificial Intelligence a Modern Approach, 3/e, Stuart Russell and Peter Norvig, 2020,
Pearson Education 4th edition, New Delhi, India.
2. Artificial Intelligence, 3/e, Elaine Rich, Kevin Knight and Shiva Shankar B Nair, 2004,
Tata McGraw Hill, Hyderabad, India.
Reference Books:
1. S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second
Edition, Pearson Education.
2. David Poole, Alan Mackworth, Randy Goebel,” Computational Intelligence: a logical
approach”, Oxford University Press.
3. G. Luger, “Artificial Intelligence: Structures and Strategies for complex problem
solving”, Fourth Edition, Pearson Education.
4. Rich, Knight, Nair: Artificial Intelligence, Tata McGraw Hill, Third Edition 2009.
BTAL2302 Database Management Systems Lab L T P C
0 0 2 1

Course Description:
This Laboratory course introduces the query language for design and development of a
database by using various software’s such as SQL, ORACLE etc. It provides practice on built-
in SQL functions using languages like DDL, DCL, DML and TCL to create and manage
database systems and perform Set operations, Sub Queries, Joins; and PL/SQL programs to
implement Exceptions, Cursors, Stored Functions, Views, Sequences, Locks and Triggers.
Course Objectives:
The objective of conducting this lab is to enable the students to:

1. Demonstrate practical knowledge on creation and alteration of tables, insertion and

Querying of data and Analyse and evaluate the databases using SQL DML/DDL
commands.
2. Write SQL Queries to implement a Database Schema for the given Database.
3. Design Simple Database using a Tool and Implement it using SQL.
4. Implement DDL and DML commands in SQL and PL/SQL, ORACLE to manage data in
databases.
5. Programming PL/SQL including procedures, functions, cursors and triggers.
Experiments:
1. Practice of DDL and DML Commands
2. Exercise on DDL and DML Commands
a. Create student table with the following structure name varchar2(10), rollno

varchar2(5).

b. Add branch column to the student table.

c. Increase the size of rollno column from 5 to 10.

d. Add marks1, marks2, marks3, dob columns to the student table.

e. Insert at least 5 rows to the student table

f. Display name and rollno of all the students.

g. Add total column to the student table.

h. calculate the total of every student.

i. Display the details of ‘cse’ students.

j. Display the structure of student table.

k. Display all rows and columns from student table.

 l. Display the name and total obtained by every student.

m. Display the details of students who got above 250 marks.

n. Add average column to student table.

o. Find out the average marks for every student.

p. Display the details of students who got above 80%.

q. Modify the branch values from ‘CSE’ to ‘ECE’.

r. Display the details of students whose dob is 12-05-1991.

s. Remove details of ECE students.

t. Remove dob column from student table.

u. Remove all the records from student table.

3. Practice of SQL Operators (Arithmetic, Logical, Relational, Between and, is null

and like operator)
4. Exercise on SQL Operators
a. Create employee table with the following structure empname varchar2(15),
empno number(3), salary number(5), deptno number(3).
b. Insert at least 5 rows into employee table.
c. Display the details of employee table.
d. Eliminate duplicate rows from employee table if any.
e. Eliminate duplicate names in employee table.
f. Display the details of employee table in salary ascending order.
g. Display the details of employee table in empname alphabetic order.
h. Display the details of employee table in salary descending order.
i. Create table emp1 which is having same information as employee.
j. Create a table emp2 from emp1 without getting the records of emp1 table.
k. Display the details of employee table whose salary is <= 8000.
l. Increment the salaries of employee by 20%.
m. Display empname, empno who is working in deptno 10;
n. Display empname, empno who is not working in deptno 30.
 o. Display the details of employee table whose salary in between 8000 and 20000.
p. Add a column commission number (4) to employee table.
q. Update the employee table such that, if salary is > 10000 then commission is
2000.
r. Update the employee table such that, if salary is between 5000 and 10000
then commission is 1000.
s. Display the details of employee whose name contain 3rd letter as ‘r’.
t. Display the details of employee whose name contains exactly 7 characters.
u. Display the details of employee whose commission is null.
v. Display the details of employee who is working in deptno 20 and 30.
w. Display the details of employee whose commission is not null.
x. Display the details of employee whose salary is 20000 or deptno is 20.
y. Display the details of employee whose salary is 25000 and deptno is 10.
z. Display the details of employee whose salary is not 25000.
aa. Create table emp3 which contains the details of employee table in ascending
order of their salary.

5. Practice of different Integrity Constraints like Not null, Check, Primary Key ,
Unique Key and Referential Integrity (Foreign Key) Constraints.
6. Exercise on Integrity Constraints
a. Create emp table with the following structure empno number(6), empname
varchar2(10), job char(10), deptno number(4), salary number(5), comm
number(3). Job values are Sales executive, Analyst, Manager, Clerk. Allow
null values for all columns except empno and deptno.
b. Add a column phoneno number(10) to emp table.
c. Modify the column width of Job field of emp table.
d. Create dept table with the following structure deptno number(4) primary
key, deptname char(15), location char(15). deptname values (Sales,
Marketing, Production).
e. Add constraints to emp table such that empno as primary key and deptno as
foreign key.
f. Add constraints to emp table to check the value of empno greater than 100
while entering values.
 g. Add constraints to emp table such that the default salary is 5000
otherwise the values entered by the user.
h. Add columns DOJ and DOB to emp table.
i. Insert at least 5 rows into dept table.
j. Insert at least 10 rows into emp table.
k. Update the emp table set the value of comm as 999.
l. Create a table emp1 with the same structure as emp and insert rows into
the table using select class.
m. Delete those rows from emp that have deptno value as 10.
n. Display unique deptno values from emp table.
o. Display maximum and minimum salary of emp table and display the
output under heading “Minimum Salary” and “Maximum Salary”
respectively.
p. Find out the average salary of emp table.

q. Find out the 5th maximum salary of emp table.

r. Find out the 3rd lowest salary of emp table.

s. Display the first 3 highest salaries and last 3 lowest salaries from emp table.
t. Drop the comm column from emp table.
u. Create a view View1 (empno, deptno, salary) from emp and perform
insert, delete and update operations.
v. Create a view View2 (empno, salary) from emp, (deptno, deptname) from
dept and perform insert, delete and update operations.
w. Drop the view named View2.
x. Display all emp values from sales or production.
y. Display the details of employees who joined between 01-01-2020 and 1-06-
2021.

7. Exercise on Relational Algebra operations (Set operations, Different Types of

Joins like Natural Join, Equi Join, Theta Join and outer join)
8. Practice of SQL Functions(Number, Character, Date , Conversion and Aggregate
functions)
9. PL/SQL Programs
a. Write a PL/SQL program to swap two numbers.
b. Write a PL/SQL program to find the largest of three numbers.
 c. Write a PL/SQL program to find the total and average of 6 subjects and
display the grade.
d. Write a PL/SQL program to find the sum of digits in a given number.
e. Write a PL/SQL program to display the number in reverse order.
f. Write a PL / SQL program to check whether the given number is perfect
number or not.
g. Write a PL/SQL program to find the factorial of a given number.
h. Write a PL/SQL code block to calculate the area of a circle for a value of
radius varying from 3 to 7. Store the radius and the corresponding values of
calculated area in an empty table named areas, consisting of two columns
radius and area.

10. Triggers and Cursors

Course Outcomes:
After completion of the course - the student will be able to:
1. Design database for any real-world problem
2. Define SQL queries
3. Decide the constraints
4. Investigate for data inconsistency
5. Implement PL/SQL programs

References:
1. Ivan Bayross, “SQL, PL/SQL Programming”, 2/e, 2011, BPB Publications, New Delhi,
India.
2. Satish Ansari, “Oracle Database 11g: Hands-on SQL and PL/SQL”, PHI Publishers,
2010.
BTAL2301 Exploratory Data Analytics with R lab L T P C
0 0 2 1

Course Description:
This course covers the essential exploratory techniques for summarizing data. These techniques
are typically applied before formal modelling commences and can help inform the development
of more complex statistical models. Exploratory techniques are also important for eliminating
or sharpening potential hypotheses about the world that can be addressed by the data. We will
cover in detail the plotting systems in R as well as some of the basic principles of constructing
data graphics. We will also cover some of the common multivariate statistical techniques used
to visualize high-dimensional data.

Course Objectives:
The students will be able to learn:

1. How to manipulate data within R and to create simple graphs and charts used in
introductory statistics.

2. Apply statistics in the real-life based problems.

3. The given data using different distribution functions in R.
4. The hypothesis testing and calculate confidence intervals; perform linear regression
models for data analysis.
5. Summarize and interpret the decision regarding given data.
List of Experiments:
1. Introduction to R and Basic Commands
2. Computation of Tables and Graphs-Summary Statistics
3. Descriptive Statistics - measures of central tendency and dispersion
4. Random Variables and Probability Distributions
5. Discrete and Continuous Probability Distributions
6. Correlation and Regression
7. Multiple Linear Regression
8. Estimation
9. Testing of Hypothesis- I (Z test)
10. Testing of Hypothesis- II (t, F, Chi-square tests)
Course Outcomes:
After completion of the course, students will be able to
1. Utilize and R Data types for developing programs.
2. Understanding of statistical data and characterization of its all parameters.
3. Learn the important statistical random distribution functions and try to mimic or model the
engineering, science, business and industry etc. related problems in terms of these
functional distribution to find the meaningful solution.
4. Learn recent reliable and accurate statistical computational procedures for making
inferences of a large variety of population parameters using known tabulated or software
tools (R, Matlab etc.) computation.
5. Apply the understanding and the knowledge of statistical tools and properties to solve the
real-life problems.

Text Books:
1. Norean R. Sharpe, Richard D. De Veaux, Paul F. Velleman, Business Statistics,
Fourth Edition, Pearson Education. 2019.
2. Sandip Rakshit, “Statistics with R Programming”, McGraw Hill Education, 2018.
Reference Books:
1. S. C. Gupta and V. K. Kapoor, Fundamentals of Applied Statistics, S. Chand,
2006.
2. S. R. Mani Sekhar and T. V. Suresh Kumar, Programming with R, I st Edition,
CENGAGE, 2017.
3. R.E. Walpole, R.H. Mayers, S.L. Mayers and K. Ye, Probability and Statistics
for engineers and scientists, 9th Edition, Pearson Education, 2018.
4. Miller & Freund’s, Probability and statistics for engineers, 8th edition, Pearson
publication, 2018.
5. K G Srinivasa, G M Siddesh, ChetanShetty, Sowmya B J, “Statistical
Programming in R”, Oxford Higher Education, 2017.