PROPOSED SCHEME OF EXAMINATION

and

SYLLABI

for

Bachelor of Technology
Information Technology & Engineering

1st SEMESTER TO 8th SEMESTER

 Introduction of the Proposed B.Tech. Courses
ITE (Information Technology and Engineering)

The primary objective of the proposed B.Tech. course i.e. ITE (Information Technology and
Engineering), is to cover the entire syllabus of the GATE Examination which is of great
importance and highly desirable for the students of Engineering. The detailed description of
the contents of the GATE syllabus which are covered by the subjects mentioned in the
proposed Scheme and Syllabus of the new B.Tech. course are given below in the tabular
form.

Contents of the GATE Syllabus Covered by Subject

Section1: Engineering Mathematics
Discrete Mathematics: Propositional and first order logic.
Sets, relations, functions, partial orders and lattices. Groups. ETCS 203- Foundation of Computer
Science
Graphs: connectivity, matching, coloring. Combinatorics:
counting, recurrence relations, generating functions.
Linear Algebra: Matrices, determinants, system of linear
ETMA-101-A. Mathematics-I
equations, eigenvalues and eigenvectors, LU decomposition.
Calculus: Limits, continuity and differentiability. Maxima ETMA-101-A. Mathematics-I
and minima. Mean value theorem. Integration. ETMA-102-A. Mathematics-II
Probability: Random variables. Uniform, normal, ETMA-201-A. Mathematics-III
exponential, poisson and binomial distributions. Mean, ETMA-202-A. Mathematics-IV
median, mode and standard deviation. Conditional ETCT-210-Probability and
probability and Bayes theorem. Statistics
Section 2: Digital Logic ETEC-205- Switching Theory and
Boolean algebra. Combinational and sequential circuits. Logic Design
Minimization. Number representations and computer ETCS-204- Computer Organization
arithmetic (fixed and floating point). and Architecture
Section 3: Computer Organization and Architecture
Machine instructions and addressing modes. ALU, data‐path
ETCS-204- Computer Organization
and control unit. Instruction pipelining. Memory hierarchy: and Architecture
cache, main memory and secondary storage; I/O interface
(interrupt and DMA mode).
Section 4: Programming and Data Structures
ETCS-108-Introduction to Programming
Programming in C. Recursion. Arrays, stacks, queues, linked ETCS-209-Data Structure
lists, trees, binary search trees, binary heaps, graphs.
Section 5: Algorithms
Searching, sorting, hashing. Asymptotic worst case time and
ETCS-301- Algorithm Design
space complexity. Algorithm design techniques: greedy,
and Analysis
dynamic programming and divide‐and‐conquer. Graph
search, minimum spanning trees, shortest paths.
Section 6: Theory of Computation
Regular expressions and finite automata. Context-free
grammars and push-down automata. Regular and contex-free ETCS-206-Theory of Computation
languages, pumping lemma. Turing machines and
undecidability.
 Section 7: Compiler Design
Lexical analysis, parsing, syntax-directed translation. ETCS-302-Compiler Design
Runtime environments. Intermediate code generation.
Section 8: Operating System
Processes, threads, inter‐process communication,
concurrency and synchronization. Deadlock. CPU ETCS-304-Operating Systems
scheduling. Memory management and virtual memory. File
systems.
Section 9: Databases
ER‐model. Relational model: relational algebra, tuple
ETCS-208-Database Management
calculus, SQL. Integrity constraints, normal forms. File Systems
organization, indexing (e.g., B and B+ trees). Transactions
and concurrency control.
Section 10: Computer Networks
Concept of layering. LAN technologies (Ethernet). Flow and
error control techniques, switching. IPv4/IPv6, routers and
routing algorithms (distance vector, link state). TCP/UDP
ETCS-306-Computer Networks
and sockets, congestion control. Application layer protocols
(DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network
security: authentication, basics of public key and private key
cryptography, digital signatures and certificates, firewalls.
 Overview of the Proposed B.Tech. Course
ITE (Information Technology and Engineering)

The field of Information Technology requires the methods for efficient, secure and reliable
transmission of information over a (noisy) channel to be developed. The existing methods
needs to be understood by the students and/or practitioners in the field of Information
Technology. The students need to understand the basics of the field with inculcation of
knowledge so that they can contribute to the field of Information Technology in these areas
and with a good foundation in other core areas of Information Technology. The proposed
scheme and syllabus/curriculum of B.Tech. Information Technology and Engineering (ITE)
has been proposed and designed keeping in mind the emerging subjects/areas as suggested by
AICTE in APH-2020. With this aim, the following subjects have been introduced in the
curriculum.

The core areas of Computer Science and Information Technology as identified in the GATE
syllabus are comprehensively covered in the proposed B.Tech. ITE course. Student after
completion of the curriculum should have acquired good foundation in the core areas of
Information Technology and have a strong basis for doing work in the field of Probability and
Statistics , Data Sciences , Ad Hoc Networks, Blockchain etc. With this aim, the following
subjects have been introduced in the curriculum.

S.No. Semester Paper ID Paper

THEORY PAPERS
1 III ETCT 205 Object Oriented Methodologies
2 III ETCT 207 Software Engineering and Project Management
3 IV ETIE 210 Probability and Statistics
4 IV ETIE 212 Linear and Non-Linear Optimization
5 V ETCT 303 Data Sciences
6 VI ETIE 308 Information Retrieval System
7 VII ETIE-401 Wireless Ad hoc and Sensor Networks
8 VII ETCT 401 Blockchain
9 VIII ETCS 402 Machine Learning

Elective Subjects (Added to electives as suggested by committee)

S.No. Semester Paper ID Paper

1 VIII ETCT 430 Quantum Computing
 BACHELOR OF TECHNOLOGY
(COMMON TO ALL BRANCHES)
FIRST SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status
THEORY PAPERS
ETMA-101 Applied Mathematics-I 3 1 4 M
ETPH-103 Applied Physics-I 2 1 3 M
ETME-105 Manufacturing Processes 3 0 3 M
ETEE-107 Electrical Technology 3 0 3 M
ETHS-109 Human Values and Professional Ethics-I# 1 1 1 --
ETCS-111 Fundamentals of Computing 2 0 2 --
ETCH-113 Applied Chemistry 2 1 3 M
PRACTICAL/VIVA VOCE
ETPH-151 Applied Physics Lab-I ------ 2 1
ETEE-153 Electrical Technology Lab ------ 2 1 M
ETME-155 Workshop Practice ------ 3 2 M
ETME-157 Engineering Graphics Lab ------ 3 2
ETCS-157 Fundamentals of Computing Lab ------ 2 1 --
ETCH-161 Applied Chemistry Lab ------ 2 1 --
NCC/NSS*# ------ ------ ------ --
TOTAL 16 18 27
M: Mandatory for award of degree
#NUES (Non University Examination System)
*#NCC/NSS can be completed in any one semester from Semester 1 – Semester 4. It will be evaluated internally
by the respective institute. The credit for this will be given after fourth Semester for the students enrolled from
the session 2014-15 onwards. The camps/classes will be held either during Weekends/Holidays or
Winter/Summer Vacations.
 BACHELOR OF TECHNOLOGY
(COMMON TO ALL BRANCHES)
SECOND SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status
THEORY PAPERS
ETMA-102 Applied Mathematics-II 3 1 4 M
ETPH-104 Applied Physics-II 2 1 3
ETEC-106 Electronic Devices 3 0 3 M
ETCS-108 Introduction to Programming 3 0 3 M
ETME-110 Engineering Mechanics 2 1 3 --
ETHS-112 Communication Skills 2 1 3 --
ETEN-114 Environmental Studies 2 1 3 --
PRACTICAL/VIVA VOCE
ETPH-152 Applied Physics Lab-II ------ 2 1
ETCS-154 Programming Lab ------ 2 1 M
ETEC-156 Electronic Devices Lab ------ 2 1 M
ETME-158 Engineering Mechanics Lab ------ 2 1 --
ETEN-160 Environmental Studies Lab ------ 2 1 --
NCC/NSS*# ------ ------ ------ --
TOTAL 17 15 27
M: Mandatory for award of degree
#NUES (Non University Examination System)
*#NCC/NSS can be completed in any one semester from Semester 1 – Semester 4. It will be evaluated internally
by the respective institute. The credit for this will be given after fourth Semester for the students enrolled from
the session 2014-15 onwards. The camps/classes will be held either during Weekends/Holidays or
Winter/Summer Vacations.
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
THIRD SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status
THEORY PAPERS
ETMA 201 Applied Mathematics – III 3 1 4

ETCS 203 Foundation of Computer Science 3 1 4 M

ETEC 205 Switching Theory and Logic Design 3 1 4
ETCT 205 Object Oriented Methodologies 3 1 4
Software Engineering and Project
ETCT 207 3 1 4
Management
ETCS 209 Data Structures 3 1 4
PRACTICAL/VIVA VOCE
ETEC 253 Switching Theory and Logic Design Lab 0 2 1

ETCS 255 Data Structures Lab 0 2 1

ETCT 257 Object Oriented Methodologies Lab 0 2 1

Software Engineering and Project
ETCT 259 0 2 1
Management Lab^
NCC/NSS*# - - -
TOTAL 18 14 28
M: Mandatory for award of degree
*NCC/NSS can be completed in any semester from Semester 1 – Semester 4. It will be evaluated internally by
the respective institute. The credit for this will be given after fourth Semester for the students enrolled from the
session 2014-15 onwards.
#NUES(Non University Examination System)
^Using UML 2.0
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
FOURTH SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status

THEORY PAPERS

ETMA 202 Applied Mathematics – IV 3 1 4

ETCS 204 Computer Organization and Architecture 3 1 4
ETCS 206 Theory of Computation 3 1 4 M
ETCS 208 Database Management Systems 3 1 4 M

ETIE 210 Probability and Statistics 3 0 3

ETIE 212 Linear and Non-Linear Optimization 3 1 4
PRACTICAL/VIVA VOCE

ETMA-252 Applied Mathematics Lab 0 2 1

ETIE 254 Probability and Statistics Lab 0 2 1
ETCS-256 Database Management Systems Lab 0 2 1
ETIE-258 Linear and Non-Linear Optimization Lab 0 2 1
Computer Organisation and Architecture
ETCS-260 0 2 1
Lab
ETSS-250 NCC/NSS*# - - 1
TOTAL 18 15 29
M: Mandatory for award of degree
*NCC/NSS can be completed in any semester from Semester 1 – Semester 4. It will be evaluated internally by
the respective institute. The credit for this will be given after fourth Semester for the students enrolled from the
session 2014-15 onwards.
NOTE: 4 weeks Industrial / In-house Workshop will be held after fourth semester. However, Viva-Voce will be
conducted in the fifth semester.
#NUES(Non University Examination System)
.
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
FIFTH SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status
THEORY PAPERS
ETCS 301 Algorithms Design and Analysis 3 1 4
Communication Skills for
ETHS 301 2 1 2
Professionals
ETCT 303 Data Sciences 3 1 4
ETCS 307 Java Programming 3 1 4

ETIT 309 Communication Systems 3 0 3

ETMS 311 Industrial Management 3 0 3

PRACTICAL/VIVA VOCE
ETCS 351 Algorithms Design and Analysis Lab 0 4 2
ETCT 351 Data Sciences Lab 0 2 1
ETCS 357 Java Programming Lab 0 2 1
ETIT 357 Communication System Lab 0 2 1
Viva Industrial Training / In-house
ETIT 359 0 0 1
Workshop *
TOTAL 17 14 26
M: Mandatory for award of degree
*Viva-Voce for evaluation of Industrial Training / In-house Workshop will be conducted in this semester.
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
SIXTH SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits Status

THEORY PAPERS

ETCS 302 Compiler Design 3 1 4 M

ETCS 304 Operating Systems 3 1 4 M

ETIE 308 Information Retrieval System 3 0 3

ETEC 310 Data Communication and Networks 3 1 4 M

ETEE-310 Microprocessor and Microcontroller 3 1 4

ETCS 312 Artificial Intelligence 3 1 4
PRACTICAL/VIVA VOCE
ETCS 352 Operating Systems Lab 0 2 1
ETIE 354 Information Retrieval System Lab 0 2 1
ETEC 358 Data Communication and Networks Lab 0 2 1
Microprocessor and Microcontroller
ETEE 358 0 2 1
Lab
TOTAL 18 13 27
M: Mandatory for award of degree
Note: Minimum of 4-6 weeks of industrial training related to CSE will be held after 6 th semester; however,
viva-
voce will be conducted in 7th Semester (ETIT 461).
Imp:- Elective Paper will be floated in 7th Semester, if one-third of the total students opt for the same. It is
advised that the decision about the elective subject for 7 h Semester is done before 15th April every year before
end of 6th semester.
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
SEVENTH SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits
THEORY PAPERS
ETIE-401 Wireless Ad hoc and Sensor Networks 3 1 4
ETCT-401 Blockchain 3 0 3
ETIT-403 Cryptography and Network Security 3 0 3
ELECTIVE (SELECT ANY TWO, ONE FROM EACH GROUP))
GROUP-A
ETEC-401 Embedded Systems 3 0 3
ETEC-403 Optoelectronics and Optical Communication 3 0 3
ETIT-407 Cloud Computing 3 0 3
ETIT-409 Distributed Databases 3 0 3
ETIT-411 Semantic Web Technologies 3 0 3
ETIT-413 Software Testing 3 0 3
ETIT-415 Digital Signal Processing 3 0 3
GROUP-B
ETIT-419 .NET and C# Programming 3 0 3
ETIT-423 System and Network Administration 3 0 3
ETIT-425 Grid Computing 3 0 3
ETIT-427 Advanced Database Administration 3 0 3
ETIT-429 Probabilistic Graphical Models 3 0 3
Sociology and Elements of Indian History for
ETHS-419 3 0 3
Engineers
PRACTICAL/VIVA VOCE
ETIE-451 Wireless Ad hoc and Sensor Networks Lab 0 2 1
ETCT 451 Blockchain Lab 0 2 1
ETIT-455 Cryptography and Network Security Lab 0 2 1
ETIT-459 Lab based on Elective Group– A or B 0 2 1
Summer Training / Industrial workshop /
ETIT-461 0 0 1
Certification
ETIT-463 Minor Project+ 0 6 3
TOTAL 15 15 24
Imp:- Elective Paper will be floated if one-third of the total students opt for the same. It is advised that the
decision about the elective subject for 8th Semester is done before 15th November every year before end of
seventh semester. New Electives may be added as per requirement after getting it duly approved by BOS and
AC respectively.
+ The student will submit a synopsis at the beginning of the semester for approval from the departmental
committee in a specified format, thereafter he/she will have to present the progress of the work through seminars
and progress reports.
 BACHELOR OF TECHNOLOGY
(INFORMATION TECHNOLOGY& ENGINEERING)
EIGHTH SEMESTER EXAMINATION
Code No. Paper ID Paper L T/P Credits
THEORY PAPERS

ETIT 402 Mobile Computing 3 1 4

ETCS 402 Machine Learning 3 0 3

ETHS 402 Human Values and Professional Ethics-II 1 0 1

ELECTIVE (SELECT ANY TWO, ONE FROM EACH GROUP)
GROUP A
ETIT-406 Big Data Analytics 3 0 3
ETIT-408 Social Network Analysis 3 0 3
ETIT-410 Soft Computing 3 0 3
ETIT-412 Bio Informatics 3 0 3
ETIT-414 Web Application development using .NET 3 0 3
ETIC-414 VLSI Design 3 0 3
ETCS-404 Human Computer Interaction 3 0 3
GROUP B
ETIT418 Digital Image Processing 3 0 3
ETIT420 Next Generation Networks 3 0 3
ETIT422 GPS and GIS 3 0 3
ETEC404 Satellite Communication 3 0 3
ETIT428 E-Commerce and M-Commerce 3 0 3
ETIT430 Distributed Systems 3 0 3
ETIT 412 Enterprise Computing in Java 3 0 3
ETCT 430 Quantum Computing 3 0 3
PRACTICAL/VIVA VOCE
ETIT 452 Mobile Computing Lab Lab 0 2 1
ETCS-454 Machine Learning Lab 0 2 1
ETIT 456 Lab based on Elective – I or II 0 4 2
ETIT-460 *Major Project 0 12 8
TOTAL 13 21 26
*The student will submit a synopsis at the beginning of the semester for approval from the departmental
committee in a specified format, thereafter he/she will have to present the progress of the work through seminars
and progress reports. Seminar related to major project should be delivered one month after staring of Semester.
The progress will be monitored through seminars and progress reports.
**Syllabus may be revised after 2 years.
NOTE:
1. The total number of the credits of the B.Tech. (ITE) Programme = 215.
2. Student shall be required to appear in examinations of all courses. However, to award the degree a
student shall be required to earn a minimum of 200 credits including mandatory papers (M).
FOR LATERAL ENTRY STUDENTS:
1. The total number of the credits of the B.Tech. (ITE) Programme = 161.
2. Each student shall be required to appear for examinations in all courses Third Semester onwards.
However, for the award of the degree a student shall be required to earn a minimum of 150 credits,
including mandatory papers (M).
 NOMENCLATURE OF CODES GIVEN IN THE SCHEME OF

B.TECH AND M.TECH

1. ET stands for Engineering and Technology.

2. PE stands for Power Engineering.
3. ME stands for Mechanical Engineering.
4. MT stands for Mechatronics.
5. AT stands for Mechanical and Automation Engineering.
6. EE stands for Electrical and Electronics Engineering.
7. EL stands for Electrical Engineering.
8. IT stands for Information Technology
9. CS stands for Computer Science and Engineering
10. CE stands for Civil Engineering
11. EC stands for Electronics and Communications Engineering.
12. EN stands for Environmental Engineering
13. TE stands for Tool Engineering
14. MA stands for Mathematics
15. HS stands for Humanities and Social Sciences
16. SS stands for Social Services
17. IE stands for Information Technology and Engineering
18. CT stands for Computer Science and Technology

New Subject
 APPLIED MATHEMATICS-I
Paper Code : ETMA-101 L T C
Paper : Applied Mathematics-I 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit.
Each question should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Applied Mathematics that are
required for an engineering student.
UNIT- I
Successive differentiation: Leibnitz theorem for nth derivative (without proof). Infinite series: Convergence and
divergence of infinite series, positive terms infinite series, necessary condition, comparison test (Limit test),
D’Alembert ratio test, Integral Test, Cauchy’s root test, Raabe’s test and Logarithmic test(without proof).
Alternating series, Leibnitz test, conditional and absolutely convergence. Taylor’s and Maclaurin’s
expansion(without proof) of function ( ex, log(1+x), cos x , sin x) with remainder terms ,Taylor’s and
Maclaurin’s series, Error and approximation.
[T1], [T2][No. of hrs. 12]
UNIT- II
Asymptotes to Cartesian curves.Radius of curvature and curve tracing for Cartesian, parametric and polar

curves. Integration: integration using reduction formula for ,

. Application of integration : Area under the curve, length of the curve, volumes and
surface area of solids of revolution about axis only .Gamma and Beta functions.
[T1],[T2][No. of hrs. 12]
UNIT- III
Matrices: Orthogonal matrix, Hermitian matrix, Skew-Hermitian matrix and Unitary matrix. Inverse of matrix
by Gauss-Jordan Method (without proof). Rank of matrix by echelon and Normal (canonical) form. Linear
dependence and linear independence of vectors.Consistency and inconsistency of linear system of
homogeneous and non homogeneous equations . Eigen values and Eigen vectors.Properties of Eigen values
(without proof).Cayley-Hamilton theorem (without proof).Diagonlization of matrix.Quadratic form, reduction of
quadratic form to canonical form.
[T1], [T2][No. of hrs. 12]
UNIT-IV
Ordinary differential equations: First order linear differential equations, Leibnitz and Bernaulli’s equation. Exact
differential equations , Equations reducible to exact differential equations. Linear differential equation of higher
order with constant coefficients, Homogeneous and non homogeneous differential equations reducible to linear
differential equations with constant coefficients.Method of variation of parameters.Bessel’s and Legendre’s
equations (without series solutions), Bessel’s and Legendre’s functions and their properties.
[T1],[T2][No. of hrs. 12]
Text:
[T1] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications.
[T2]. R. K. Jain and S.R.K. Iyengar,”Advanced Engineering Mathematics “Narosa Publications.

References:
[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications
[R2] G.Hadley, “ Linear Algebra” Narosa Publication
[R3] N.M. Kapoor, “ A Text Book of Differential Equations”, Pitambar publication.
[R4] Wylie R, “ Advance Engineering mathematics” , McGraw-Hill
[R5] Schaum’s Outline on Linear Algebra, Tata McGraw-Hill
[R6] Polking and Arnold, “ Ordinary Differential Equation using MatLab” Pearson.
 APPLIED PHYSICS – I
Paper Code: ETPH – 103 L T C
Paper: Applied Physics – I 2 1 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Applied Physics aspects that
are required for his understanding of basic physics.

UNIT I
Interference: Introduction, Interference due to division of wave front: Fresnel’s Biprism, Interference due to
division of amplitude: wedge shaped film, Newton’s rings.

Diffraction: Introduction, Difference between Fresnel and Fraunhofer diffraction, Single slit diffraction,
Transmission diffraction grating, Absent spectra.
[T1], [T2](No. of Hrs. 8)

UNIT II
Polarization: Introduction, Uniaxial crystals, Double refraction, Nicol prism, Quarter and half wave plates,
Theory of production of plane, circularly and elliptically polarized lights, Specific rotation, Laurents half shade
polarimeter.

Laser: Spontaneous and stimulated emissions, Einstein’s coefficients, Laser and its principle, He-Ne laser.

Fibre optics: Introduction, Single mode fibre, Step index and graded index multimode fibres,
Acceptance angle and numerical aperture.
[T1], [T2](No. of Hrs. 8)
UNIT III
Theory of Relativity: Introduction, Frame of reference, Galilean transformation, Michelson-Morley
experiment, Postulates of special theory of relativity, Lorentz transformations, Length contraction, Time
dilation, Mass energy relation

Ultrasonics: Introduction, Production of ultrasonics by magnetostriction and Piezoelectric methods,

Applications.
[T1], [T2](No. of Hrs. 8)
UNIT IV
Nuclear Physics: Introduction,Radioactivity, Alpha decay, Beta decay, Gamma decay, Q value, Threshold
energy, Nuclear reactions, Nuclear fission: Liquid drop model, Nuclear fusion, Particle accelerators: Linear
accelerator, Cyclotron, Radiation detectors: Ionization chamber, Geiger Mueller Counter.
[T1](No. of Hrs. 8)
Text Books:
[T1]. Arthur Beiser, ‘Concepts of Modern Physics’, [McGraw-Hill], 6th Edition 2009
[T2]. A. S.Vasudeva, ‘Modern Engineering Physics’, S. Chand, 6th Edition, 2013.

Reference Books
[R1]. A. Ghatak ‘Optics’ , TMH, 5th Edition, 2013
[R2]. G. Aruldhas ‘Engineering Physics’ PHI 1st Edition, 2010.
[R3]. Fundamentals of Optics : Jenkins and White , Latest Edition
[R4]. C. Kittle, “Mechanics”, Berkeley Physics Course, Vol.- I.
[R5]. Feynman “ The Feynman lectures on Physics Pearson Volume 3 Millennium Edition, 2013
[R6]. Uma Mukhrji ‘Engineering Physics’ Narosa, 3rd Edition, 2010.
[R7]. H.K. Malik & A. K. Singh ‘Engineering Physics’ [McGraw-Hill], 1st Edition, 2009.
 MANUFACTURING PROCESSES

Paper Code: ETME-105 L T C

Paper: Manufacturing Processes 3 0 3
INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The Objective of the paper is to facilitate the student with the basic Manufacturing processes.
Unit-I
Introduction: Introduction of Manufacturing processes and their classification, Basic Metals &Alloys :
Properties and Applications. Properties of Materials: Strength, elasticity, stiffness, malleability, ductility,
brittleness, toughness and hardness. Ferrous Materials: Carbon steels, its classification based on % carbon as
low, mild, medium & high carbon steel, its properties & applications. Wrought iron.Cast iron. Alloy steels:
stainless steel, tool steel. Elementary introduction to Heat- treatment of carbon steels: annealing, normalizing,
quenching & tempering and case- hardening.
Non-Ferrous metals & alloys: Properties and uses of various non-ferrous metals & alloys and its composition
such as Cu-alloys: Brass, Bronze, Al-alloys such as Duralumin.
Casting Processes:
Principles of metal casting, Pattern materials, types and allowance, composition and properties of moulding
sand, foundry tools, concept of cores and core print, elements of gating system, description and operation of
cupola, special casting processes e.g. die-casting; permanent mould casting; centrifugal casting; investment
casting; casting defects.
(T1 ,T2, R1, R2, R3, R4, R5) [No. of Hrs.12]
UNIT-II
Smithy and Forging:
Hot working and cold working, Forging tools and equipments, Forging operations, Forging types: Smith
forging, Drop forging, Press forging, Machine forging; Forging defects; Extrusion, wire drawing, swaging.
BENCH WORK AND FITTING:
Fitting shop tools, operation: Fitting; sawing; chipping; thread cutting (with taps and dies);
Marking and marking tools.
(T1 ,T2, R1, R2, R3, R4, R5) [No. of Hrs. 12]
Unit-III
Metal joining: Welding principles, classification of welding techniques, Oxyacetylene Gas welding, equipment
and field of application, Arc-welding, metal arc, Carbon arc welding, submerged arc welding and atomic
hydrogen welding, TIG and MIG welding, Electric resistance welding: spot; seam; flash; butt and percussion
welding, Flux: composition; properties and function, Electrodes, Types of joints and edge preparation, Brazing
and soldering, welding defects.
(T1 ,T2, R1, R2, R3, R4, R5)[No. of Hrs. 12]
Unit-IV
Sheet Metal Work:
Tools and equipments used in sheet metal work, metals used for sheets, standard specification for sheets, Types
of sheet metal operations: shearing, drawing, bending. Other operations like spinning, stretch forming,
embossing and coining.
Powder Metallurgy: Introduction of powder metallurgy process: powder production, blending, compaction,
sintering.
(T1 ,T2, R1, R2, R3, R4, R5)[No. of Hrs. 12]
Text Books:
[T1]. Manufacturing Process by Raghuvanshi.(Dhanpat Rai and Co.)
[T2]. Manufacturing Technology by P.N.Rao (TMH publications)
Reference Books:
[R1]. Workshop Technology by Hazra-Chowdhary (Media Promoters and Publishers Pvt. Ltd.)
[R2]. Production Engineering by R.K.Jain (Khanna Publishers)
[R3]. Workshop Technology by Chapman (Elsevier Butterworth-Heinemann)
[R4]. Fundamentals of Modern Manufacturing by Mikell P. Groover (Wiley India Edition)
[R5]. Manufacturing Processes for Engineering Materials by Kalpakjian and Schmid (Pearson)
 ELECTRICAL TECHNOLOGY
Paper Code: ETEE-107 L T C
Paper : Electrical Technology 3 0 3

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. This is first introductory course in electrical technology to the students of all the branches of engineering
in first year.
2. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
3. Apart from question no. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit.
Each question should be of 12.5 marks.

Objective: To provide exposure to the students in respects of the basics of different aspects of electrical
engineering with emphasis on constructional, measurement and applications of various types of instruments and
equipments.

UNIT – I: DC Circuits
Introduction of Circuit parameters and energy sources (Dependent and Independent), Mesh and Nodal Analysis,
Superposition, Thevenin’s, Norton’s, Reciprocity, Maximum Power Transfer and Millman’s Theorems, Star-
Delta Transformation and their Applications to the Analysis of DC circuits.
[T1],[T2][No. of Hrs. 11]
UNIT – II: A.C.Circuits
A.C. Fundamentals, Phasor representation, Steady State Response of Series and Parallel R-L, R-C and R-L-C
circuits using j-notation, Series and Parallel resonance of RLC Circuits, Quality factor, Bandwidth, Complex
Power, Introduction to balanced 3-phase circuits with Star- Delta Connections.
[T1],[T2][No. of Hrs. 14]
UNIT – III: Measuring Instruments
Basics of measuring instruments and their types ,Working principles and applications of moving coil, moving
iron (ammeter & voltmeter) and Extension of their ranges, dynamometer- type Wattmeter , induction-type
Energy Meter , Two-wattmeter method for the measurement of power in three phase circuits, Introduction to
digital voltmeter, digital Multimeter and Electronic Energy Meter.
[T1],[T2],[R2][No. of Hrs. 11]
UNIT – IV: Transformer and Rotating Machines
Fundamentals of Magnetic Circuits, Hysteresis and Eddy current losses, working principle, equivalent circuit,
efficiency and voltage regulation of single phase transformer and its applications. Introduction to DC and
Induction motors (both three phase and single phase), Stepper Motor and Permanent Magnet Brushless DC
Motor.
[T1],[T2],[R2][No. of Hrs. 12]
Text Books:
[T1] S.N Singh, “Basic Electrical Engineering” PHI India Ed 2012
[T2] Chakrabarti, Chanda,Nath “Basic Electrical Engineering” TMH India”, Ed 2012.
Reference Books:
[R1] William Hayt “Engineering Circuit Analysis” TMH India Ed 2012
[R2] Giorgio Rizzoni “Principles and Application of Electrical Engineering” Fifth Edition TMH India.
 HUMAN VALUES & PROFESSIONAL ETHICS
Paper Code: ETHS-109 L T C
Paper : Human Values & Professional Ethics 1 1 1

Non-University Examination Scheme (NUES)

Note: There will be no End-Term External University Examination. Marks are to be given on the basis of two
internal sessional test of 30 marks each and one final Viva-voce project report Examination of 40 marks.

Objectives:
This introductory course input is intended
a. To help the students appreciate the essential complementarity between ‘VALUES’ and ‘SKILLS’ to
ensure sustained happiness and prosperity which are the core aspirations of all human beings.
b. To facilitate the development of a holistic perspective among students towards life, profession and
happiness, based on the correct understanding of the Human reality and the rest of the Existence. Such
a Holistic perspective forms the basis of value-based living in a natural way.
c. To highlight plausible implications of such a Holistic understanding in terms of ethical human conduct,
trustful and mutually satisfying human behaviour and mutually enriching interaction with Nature.

UNIT-1: Introduction to Value Education No. of lectures: 03+1

1. Understanding the need, basic guidelines, content and process for value education.
2. Basic Human Aspirations: Prosperity and happiness
3. Methods to fulfil the human aspirations – understanding and living in harmony at various levels.
4. Practice Session – 1. [T1], [R1], [R4]

UNIT-2: Harmony in the Human Being No. of lectures: 05+1

1. Co-existence of the sentient “I” and the material body – understanding their needs – Happiness &
Conveniences.
2. Understanding the Harmony of “I” with the body – Correct appraisal of physical needs and the meaning of
prosperity.
3. Programme to ensure harmony of “I” and Body-Mental and Physical health and happiness.
4. Harmony in family and society: Understanding Human-human relationship in terms of mutual trust and
respect.
5. Understanding society and nation as extensions of family and society respectively.
6. Practice Session – 02 [T2], [R1], [R2]

UNIT-3: Basics of Professional Ethics No. of lectures: 04+1

1. Ethical Human Conduct – based on acceptance of basic human values.
2. Humanistic Constitution and universal human order – skills, sincerity and fidelity.
3. To identify the scope and characteristics of people – friendly and eco-friendly production system,
Technologies and management systems.
4. Practice Session – 03.
[T1],[R4]

UNIT-4: Professional Ethics in practice No. of lectures: 04+1

1. Profession and Professionalism – Professional Accountability, Roles of a professional, Ethics and image
of profession.
2. Engineering Profession and Ethics - Technology and society, Ethical obligations of Engineering
professionals, Roles of Engineers in industry, society, nation and the world.
3. Professional Responsibilities – Collegiality, Loyalty, Confidentiality, Conflict of Interest, Whistle
Blowing
4. Practice Session – 04
[T1], [T2], [T3], [R3]
Text Books:
[T1] Professional Ethics, R. Subramanian, Oxford University Press.
[T2] Professional Ethics & Human Values: S.B. Srivasthva, SciTech Publications (India) Pvt. Ltd. New
Delhi.
[T3] Professional Ethics & Human Values: Prof. D.R. Kiran, TATA Mc Graw Hill Education.

References:
[R1] Success Secrets for Engineering Students: Prof. K.V. SubbaRaju, Ph.D., Published by SMARTstudent.
[R2] Ethics in Engineering Mike W. Martin, Department of Philosophy, Chapman University and Roland
Schinzinger, School of Engineering, University of California, Irvine.
[R3] Human Values: A. N. Tripathy (2003, New Age International Publishers)
[R4] Value Education website, http.//www.universalhumanvalues.info[16]
[R5] Fundamentals of Ethics, Edmond G. Seebauer & Robert L. Barry, Oxford University Press.
[R6] Human Values and Professional Ethics: R. R. Gaur, R. Sangal and G. P. Bagaria, Eecel Books
(2010, New Delhi). Also, the Teachers‟ Manual by the same author.

*PRACTICAL SESSIONS OF 14 HOME ASSIGNMENTS will be followed by the students pursuing this
paper. (Ref: Professional Ethics & Human Values: S.B. Srivastava, SciTech Publications (India) Pvt. Ltd. New
Delhi. )

CONTENT OF PRACTICE SESSION

Module 1: Course Introduction – Needs, Basic Guidelines, Content and Process of Value Education

PS-1: Imagine yourself in detail. What are the goals of your life? How do you set your goals in your life? How
do you differentiate between right and wrong? What have been your achievements and shortcoming in your life?
Observe and analyze them.

Expected Outcome:
The students start exploring themselves; get comfortable to each other and to the teacher and start finding the
need and relevance for the course.

PS-2:Now a days there is lot of voice about techno-genie maladies such as energy and natural resource
depletion, environmental Pollution, Global Warming, Ozone depletion, Deforestation, etc. – all these scenes are
man-made problems threatening the survival of life on the earth – what is root cause of these maladies and what
is the way out in your opinion?
On the other hand there is rapidly growing danger because of nuclear proliferation, arm race, terrorism,
criminalization of politics, large scale corruption, scams, breakdown of relationships, generation gap, depression
and suicidal attempts, etc - what do you think the root cause of these threats to human happiness and peace –
what could be the way out in your opinion?

Expected Outcome:
The students start finding out that technical education with study of human values can generate more problems
than solutions. They also start feeling that lack of understanding of human values is the root cause of all the
problems and the sustained solution could emerge only through understanding of human values and value based
living. Any solutions brought out through fear, temptation or dogma will not be sustainable.

PS-3:1.Observe that each one of us has Natural Acceptance, based on which one can verify right or not right for
him. Verify this in case of following:
a)What is naturally acceptable to you in relationship – feeling of respect or disrespect?
b)What is naturally acceptable to you - to nurture or to exploit others? Is your living the same as your natural
acceptance or different?
2.Out of three basic requirements for fulfillment of your aspirations, right understanding, relationship and
physical facilities, observe how the problems in your family are related to each. Also observe how much time
and efforts you devote for each in your daily routine.

Expected Outcome:
1. The students are able to see that verification on the basis of natural acceptance and experiential
validation through living is the only way to verify the right or wrong, and referring to any external
source life text or instrument or any other person cannot enable them to verify with authenticity, it will
only develop assumptions.
2. The students are able to see that their practice in living is not in harmony with their natural
acceptance at most of the time, and all they need to do is to refer to their natural acceptance to remove
this disharmony.

3. The students are able to see that lack of right understanding leading to lack of relationship is the
 major cause of the problems in their family and the lack of physical facilities in most of the cases;
while they have given higher priority to earning of physical facilities in their life ignoring relationship
and not being aware that right understanding is the most important requirement for any human being.

Module 2: Understanding harmony in human being – Harmony in myself!

PS-4:Prepare the list of your desires. Observe whether the desires. Observe whether the desires are related with
self “I” or body. If it appears to be related with the both, see which part of it is related to self “I” and which part
is related to body.

Expected Outcome:
The students are able to see that they can enlist their desires and the desires are not vague, also they are able to
relate their desires to “I” and “body” distinctly. If, any desire appears to be related with both, they are able to see
that feeling is related to “I” while the physical facility is related to the body. They are also able to see that “I”
and “body” are two realities, and most of their desires are related to “I” and not with the “Body”; while their
efforts are mostly connected on the fulfillment of the need of the body assuming that it will meet the needs of
“I” too.

PS-5:
1. {A}. Observe that any physical facilities you use, follows the given sequence with time; Necessary
and tasteful – unnecessary & tasteful – unnecessary & tasteless.
{B}. In contrast, observe that any feelings in you are either naturally acceptable or not acceptable at
all. If, naturally acceptable, you want it continuously and if not acceptable, you do not want it
at any moment.
2. List Down all your activities. Observe whether the activity is of “I” or of “body” or with the
participation both “I” and “body”.
3. Observe the activities with “I”. Identify the object of your attention for different moments (over a
period say 5 to 10 minute) and draw a line diagram connecting these points. Try to observe the link
between any two nodes.

Expected Outcome:
1. The students are able to see that all physical facilities they use are required for limited time in a limited
quantity. Also they are able to see that cause of feeling, they want continuity of the naturally acceptable
feelings and they do not want feelings which are not naturally acceptable eve for a single moment.
2. The students are able to see that activities like understanding, desires, thoughts and selection are the
activities of “I” only; the activities like breathing, palpitation of different parts of the body are fully the
activities of the body. With the acceptance of “I”, while activities they do with their sense organs like
hearing through ears, seeing through eyes, sensing through touch, tasting through tongue and smelling
through nose or the activities they do with their work organs like hands, legs, etc. are such activities
that require the participation of both “I” and “body”
3. The students become aware of their activities of “I” and start finding their focus of attention at different
moments. Also they are able see that most of their desires are coming from outsides (through
preconditioning or sensation) and are not based on their natural acceptance.

PS-6: 1.Chalk out the program to ensure that you are responsible to your body – for the nurturing, protection
and right utilization of the body.
2.Find out the plants and shrubs growing in and your campus. Find out their use for curing different
diseases.

Expected Outcome:
The students are able to list down activities related to a proper upkeep of the body and practice them in their
daily routine. They are also able to appreciate the plants wildly growing in and around the campus which can be
beneficial in curing the different diseases.

Module 3: Understanding harmony in the family and society - Harmony in Human – Human relationship
PS-7: Form small groups in the class and in that group initiate the dialogue and ask the eight questions related
to trust. The eight questions are-

S.No. Intention (Natural Acceptance) S.No. Competence

1.a. Do I want to make myself happy? 1.b. Am I liable to make myself always Happy?
2.a. Do I want to make the other happy? 2.b. Am I liable to make the other always happy?
3.a. Does the other want to make him 3.b. Is the other able to make him always happy?
happy?
4.a. Does the other want to make me 4.b. Is the other able to make me always happy?
happy? What is answer?
What is answer?

Let each student answer the question for himself and everyone else. Discuss the difference between intention
and competence.

Expected Outcome:
The students are able to see that the first four questions are related to our natural acceptance i.e. intention and
the next four to our competence. They are able to note that the intention is always correct, only competence is
lacking. We generally evaluate ourselves on the basis of our intention and other on the basis of their
competence. We seldom look at our competence and other’s intention as a result we conclude that I am a good
person and other is a bad person.

PS-8:
1. Observe that on how many occasions you are respecting your related ones (by doing the right evaluation) and
on how many occasion you are disrespecting by way of under evaluation, over evaluation or otherwise
evaluation.
2. Also observe whether your feeling of respect is based on treating the other as yourself or on differentiations
based on body, physical facilities or beliefs.

Expected Outcome:
The students are able to see that respect is right evaluation and only right evaluation leads to fulfilment of
relationship. Many present problems in the society are an outcome of differentiation (lack of understanding of
respect) like gender biasness, generation gap, caste conflicts, class struggle, and domination through poor play,
communal violence, and clash of isms and so on so forth.
All these problems can be solved by realizing that the other is like me as he has the same natural acceptance,
potential and program to ensure a happy and prosperous life for him and for others though he may have different
body, physical facilities or beliefs.

PS-9:
1. Write a note in the form of a story, poem, skit, essay, narration, dialogue, to educate a child.
Evaluate it in a group.
2. Develop three chapters to introduce “social science”, its needs, scope and content in the primary education of
children.

Expected Outcome:
The students are able to use their creativity for educating children. The students are able to see that they can play
a role in providing value education for children. They are able to put in simple words the issues that are essential
to understand for children and comprehensible to them. The students are able to develop an outline of holistic
model for social science and compare it with the existing model.

Module 4: Understanding harmony in the nature and existence – Whole existence as Co – existence -

PS-10: Prepare the list of units (things) around you. Classify them into four orders. Observe and explain the
mutual fulfilment of each unit with other orders.

Expected Outcome:
The students are able to differentiate between the characteristics and activities of different orders and study the
mutual fulfilment among them. They are also able to see that human beings are not fulfilling to their orders
today and need to take appropriate steps to ensure right participation (in term of nurturing, protection and right
utilization) in the nature.
PS-11:
1. Make a chart for the whole existence. List down different courses of studies and relate them
to different or levels in the existence.
2. Choose any one subject being taught today. Evaluate and suggest suitable modifications to make it
appropriate and holistic.

Expected Outcome:
The students are confident that they can understand the whole existence; nothing is a mystery in this existence.
They are also able to see the interconnectedness in the nature, and point out how different courses of study relate
to the different units and levels. Also they are liable to make out how these courses can be made appropriate and
holistic.

Module 5: Implication of the above Holistic Understanding of Harmony at all Levels of Existence.

PS-12: Choose any two current problem of different kind in the society and suggest how they can be solved on
the basis of the natural acceptance of human values. Suggest the steps you will take in present conditions.

Expected Outcome:
The students are liable to present sustainable solutions to the problem in society and nature. They are also able
to see that these solutions are practicable and draw road maps to achieve them.

PS-13:
1. Suggest ways in which you can use your knowledge of engineering / technology / management for
universal human order from your family to world family.
2. Suggest one format of humanistic constitution at the level of nation from your side.

Expected Outcome:
The students are able to grasp the right utilization of their knowledge in their streams of technology /
engineering / management to ensure mutually enriching and recyclable production systems.

PS-14: The course is going to be over now. Evaluate your state before and after the course in terms of-
• Thoughts
• Behavior
• Work and
• Realization
Do you have any plan to participate in the transition of the society after graduating from the institute?
Write a brief note on it.

Expected Outcome:
The students are able to sincerely evaluate the course and share with their friends. They are also able to suggest
measures to make the course more effective and relevant. They are also able to make use of their understanding
in the course for happy and prosperous society.
 FUNDAMENTALS OF COMPUTING
Paper Code: ETCS-111 L T C
Paper: Fundamentals of Computing 2 0 2

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 10 marks

Objective: The objective of the paper is to facilitate the student with applied working knowledge of computers.
This is the first course of computing and does not assume any pre-requisite.

UNIT-I
Five Component Model of a Computer, System and Application software (introduction ) storage devices ,
primary (RAM, ROM, PROM, EPROM, cache ) Memory and secondary (magnetic tape, hard disk, Compact
disks) memory , peripheral devices , printers.
[T1], [T2][8 Hours]
UNIT-II
Operating Systems: DOS Internal, External commands, Windows ( 2000 and NT) , Overview of architecture of
Windows, tools and system utilities including registry , partitioning of hard disk , Overview of Linux
architecture , File system , file and permissions , concept of user and group , installation of rpm and deb based
packages.
[T1], [T2][8 Hours]
UNIT-III
Basics of programming through flow chart , Networking Basics - Uses of a network and Common types of
networks , Network topologies and protocols , Network media and hardware , Overview of Database
Management System.
[T1],[T2],[R1][8 Hours]
UNIT-IV
Libre / Open Office Writer : Editing and Reviewing, Drawing, Tables, Graphs, Templates
Libre / Open Office Calc : Worksheet Management , Formulas, Functions, Charts
Libre / Open Office Impress: designing powerful power-point presentation
[R2][R3] [8 Hours]
Text:
[T1] Peter Norton, Introduction to computers, Sixth Edition Tata McGraw Hill (2007).
[T2] Andrews Jean, A+Guide to Managing & Maintaining Your PC, Cengage Publication 6/e
References:
[R1] Anita Goel, Computer Fundamentals, Pearson Education.
[R2] Joiner Associates Staff, Flowcharts: Plain & Simple: Learning & Application Guide , Oriel Inc
[R3] http://www.openoffice.org/why/
[R4] http://www.libreoffice.org/get-help/documentation/
 APPLIED CHEMISTRY
Paper Code: ETCH – 113 L T C
Paper : Applied Chemistry 2 1 3

INSTRUCTIONS TO PAPER SETTER: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or short
answer type questions. It should be of 25 marks.
2. Each unit should have two questions. However, student may be asked to attempt only 1 question from each unit.
Each question should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Applied Chemistry aspects
that are required for his understanding of basic chemistry

UNIT I: FUELS
Definition, Classification & Calorific value of fuels (gross and net), Dulong’s formula (Numericals),
Determination of calorific value of fuels using bomb’s calorimeter (Numericals), Determination of calorific
value of fuels using Boy’s Gas Calorimeter (Numericals), Cracking – Thermal & catalytic cracking, Octane &
Cetane numbers with their significance. High & Low temperature carbonization, Manufacture of coke (Otto –
Hoffmann oven) Proximate and ultimate analysis of Coal (Numericals) Combustion of fuels (Numericals).
[T1,T2][No. of hrs. 08]
UNIT II: THE PHASE RULE & CATALYSIS
Definition of various terms, Gibb’s Phase rule & its derivation, Application of phase rule to One component
system- The water system, Application of phase rule to Two component system- The Lead-Silver system
(Pattinson’s process).
Catalyst and its characteristics, Types of catalysts, Concept of promoters, inhibitors and poisons. Theories of
catalysis: Intermediate compound formation theory, adsorption or contact theory. Application of catalysts for
industrially important processes Enzyme catalysis: Characteristics, Kinetics & Mechanism of enzyme catalysed
reaction ( Michaelis-Menten equation), Acid-Base catalysis: Types, Kinetics & Mechanism, Catalysis by metals
salts (Wilkinson’s Catalyst), Auto-catalysis, Heterogeneous catalysis (Langmuir-Hinshelwood mechanism.
[T1,T2][No. of hrs. 08]
UNIT III: WATER
Introduction and specifications of water , Hardness and its determination by EDTA method (Numericals),
Alkalinity and its determination (Numericals), Reverse Osmosis, Electrodialysis, Disinfection by break-point
chlorination. Boiler feed water, boiler problems– scale, sludge, priming & foaming: causes & prevention, Boiler
problems– caustic embrittlement & corrosion: causes & prevention, Water Softening by Internal Treatment:
carbonate & phosphate conditioning, colloidal conditioning & calgon treatment Water Softening by External
Treatment: Lime-Soda Process (Numericals) Zeolite & Ion-Exchange Process.
[T1,T2][No. of hrs. 08]
UNIT IV: CORROSION & ITS CONTROL
Causes, effects & consequences; Chemical or Dry corrosion & its mechanism (Pilling-Bedworth Rule)
Electrochemial or Wet Corrosion & Its mechanism, Rusting of Iron Passivity, Galvanic series, Galvanic
Corrosion, Soil Corrosion Pitting Corrosion, Concentration Cell or Differential Aeration Corrosion, Stress
Corrosion. Factors Influencing Corrosion: Nature of metal and nature of corroding environment; Protective
measures: Galvanization, Tinning Cathodic Protection, Sacrificial Anodic protection, Electroplating, Electroless
plating, Prevention of Corrosion by Material selection & Design.
[T1,T2][No. of hrs. 08]
Text Books:
[T1] P. C. Jain & Monika Jain, Engineering Chemistry, Latest edition, Dhanpat Rai Publishing Co., 2002.
[T2] P. Mathew, Advance Chemistry, 1 & 2 Combined Editions, Cambridge University Press, 2003.

Reference Books:
[R1] P. W. Atkins and J. De Paula, Atkins’ Physical Chemistry, Oxford, 2010.
[R2] T. Engel and P. Reid, Physical Chemistry,Pearson Education, 2013.
[R3] K. Qanungo, Engineering Chemistry, PHI Learning Private Limited, New Delhi, 2009.
[R4] O. G. Palanna, Engineering Chemistry, Tata McGraw Hill Education Private Limited, 2012.
[R5] D. A. Jones, Principles and Prevention of Corrosion, Prentice Hall, 2nd Edition, 1996.
[R6] H. K. Chopra and A. Parmar, Engineering Chemistry- A Text Book, Narosa Publishing House, 2012.
[R7] S. Chawla, Engineering Chemistry-All India Edition, Dhanpat Rai & Co., 2003.
[R8] R. Gadi, S. Rattan and S. Mohapatra, Environmental Studies, S.K. Kataria & Sons, 2nd Edition 2009.
 APPLIED PHYSICS LAB – I

Paper Code: ETPH-151 P C

Paper : Applied Physics Lab – I 2 1

LIST OF EXPERIMENTS
1. To determine the wavelength of sodium light by Newton’s Rings.
2. To determine the wavelength of sodium light by Fresnel's biprism.
3. To determine the wavelength of sodium light using diffraction grating.
4. To determine the refractive index of a prism using spectrometer.
5. To determine the dispersive power of prism using spectrometer and mercury source.
6. To determine the specific rotation of cane sugar solution with the help of half shade polarimeter.
7. To find the wavelength of He-Ne laser using transmission diffraction grating.
8. To determine the numeral aperture (NA) of an optical fibre.
9. To plot a graph between the distance of the knife-edge from the center of the gravity and the time
period of bar pendulum. From the graph, find
(a) The acceleration due to gravity
(b) The radius of gyration and the moment of inertia of the bar about an axis.
10. To determine the velocity of ultrasound waves using an ultrasonic spectrometer in a given liquid
(Kerosene Oil).
11. To verify inverse square law.
12. To determine Planck’s constant.
Text Books:
[T1] C. L. Arora ‘B. Sc. Practical Physics’ S. Chand

Note: Any 8-10 experiments out of the list may be chosen. Proper error – analysis must be carried out with all
the experiments.
 ELECTRICAL TECHNOLOGY LAB

Paper Code: ETEE 153 L P C

Paper: Electrical Technology Lab 0 2 1

LIST OF EXPERIMENTS

1. To Design the circuit for a given load and selection of its various Components and instruments from
the safety point of view
2. Study and applications of CRO for measurement of voltage, frequency and phase of signals.
3. Connection of lamp by
(1)Single Switch Method.(2) Two-way Switch Method.
OR
Performance comparison of of fluorescent Tube & CFL Lamp.
4. To Verify Thevenin’s & Norton’s Theorem
OR
To Verify Superposition &Reciprocity Theorem.
OR
To Verify Maximum Power Transfer Theorem.
5. To Measure Power & Power Factor in a Single-Phase A.C Circuit using Three Ammeters or three
Voltmeters.
6. To Measure Power & Power Factor in a Balanced Three Phase Circuit using Two Single Phase
Wattcmeters.
7. To study of Resonance in a series R-L-C or Parallel R-L-C Circuits.
8. To perform open circuit and short circuit test on 1-phase transformer.
9. Starting, Reversing and speed control of DC shunt Motor
10. Starting, Reversing and speed control of 3-phase Induction Motor
11. To Study different types of Storage Batteries & its charging system.
12. .To Study different types of earthing methods including earth leakage circuit breaker (GFCI)

Note:- Any 8-10 Experiments out of the list may be chosen.

 WORKSHOP PRACTICE
Paper Code: ETME-155 L P C
Paper: Workshop Practice 0 3 2

LIST OF EXPERIMENTS
Sheet Metal Shop
1. To study the tools and machineries used in sheet metal shop.
2. To make a tray using sheet metal tools.
3. To make a Funnel using sheet metal tools.
4. To make a cylindrical mug in sheet metal shop.
Foundry Shop
5. To make a mould in Foundry Shop.
Carpentry Shop
6. To make a half lap T-joint in Carpentry Shop.
7. To make a half cross lap joint in Carpentry Shop.
8. To make a pattern using Carpentry Tools.
Welding Shop
9. To study arc and gas welding equipments and tools.
10. To make Lap Joint, T-Joint and Butt Joint in Welding shop.
Fitting Shop
11. To make V-Section and T-Slot in fitting shop.
Machine Shop
12. To study basic operations on lathe, shaper, milling, drilling and grinding machines..
13. To perform step turning, knurling and threading operations on lathe.
14. To prepare a simple job on shaper.

Note:- Any 8-10 Experiments out of the list may be chosen.

 ENGINEERING GRAPHICS LAB

Paper Code: ETME-157 L P C

Paper: Engineering Graphics Lab 0 3 2

LIST OF EXPERIMENTS
UNIT - I
General: Importance, Significance and scope of engineering drawing, Lettering, Dimensioning, Scales, Sense of
proportioning, Different types of projections, Orthographic Projection, B.I.S. Specifications,
Projections of Point and Lines: Introduction of planes of projection, Reference and auxiliary planes,
projections of points and Lines in different quadrants, traces, inclinations, and true lengths of the lines,
projections on Auxiliary planes, shortest distance, intersecting and non-intersecting lines.
(T1, T2, R1, R2 , R3 )
Unit - II
Planes other than the Reference Planes: Introduction of other planes (perpendicular and oblique), their traces,
inclinations etc., Projections of points and lines lying in the planes, conversion of oblique plane into auxiliary
Plane and solution of related problems.
Projections of Plane Figures: Different cases of plane figures (of different shapes) making different angles
with one or both reference planes and lines lying in the plane figures making different given angles (with one of
both reference planes). Obtaining true shape of the plane figure by projection.
(T1, T2, R1, R2 , R3)
Unit - III
Projection of Solids: Simple cases when solid are placed in different positions, Axis faces and lines lying in the
faces of the solid making given angles. (T1, T2, R1, R2 , R3)
Unit-IV
Isometric Projection of plain surface and bodies. (T1, T2, R1, R2 , R3)
Text Books:
[T1] Engineering drawing by N.D.Bhatt (Charotar Publications).
[T2] Engineering Drawing by S.C.Sharma & Navin Kumar (Galgotia Publications)
Reference Books:
[R1] Engineering Drawing by Venugopalan, (New Age International).
[R2] Engineering Drawing by P.S.Gill (S.K. Kataria & Sons)
[R3] Engineering Graphics by K.C.John (PHI)

Note:- Any 8-10 Experiments out of the list may be chosen.

 FUNDAMENTAL OF COMPUTING LAB

Paper Code: ETCS 157 L P C

Paper: Fundamental of Computing Lab 0 2 1

LIST OF EXPERIMENTS
For program development an IDE e.g. CodeBlock[a], Eclipse CDT [b], Netbeans[c] is recommended
1. Dismantling a PC Part -1
2. Dismantling a PC Part -2
3. Internal and External commands of DOS
4. System utilities of windows including regedit
5. Installation of any rpm or debianlinux distribution with emphasis on drive partitioning
6. Installation of rpm and deb based packages
7. Understanding of File system of Linux
8. Creating user and group ( through CLI)
9. Understanding and working knowledge of .Libre / Open Office Writer
: Editing and Reviewing, Drawing, Tables, Graphs, Templates
10. Understanding and working knowledge of Libre / Open Office Calc
11. Understanding and working knowledge Libre / Open Office Impress
12. Understanding of flow chart development through Dia *
13. Two Mini Projects based on the skills learned in experiments 1-12
• [ Dia ] http://projects.gnome.org/dia/

Note:- Any 8-10 Experiments out of the list may be chosen.

 APPLIED CHEMISTRY LAB

Paper Code –ETCH-161 P C

Paper : Applied Chemistry Lab 2 1

LIST OF EXPERIMENTS
1. Determination of alkalinity of water sample.
2. Determination of hardness of water sample by EDTA method.
3. Determine the percentage composition of sodium hydroxide in the given mixture of sodium hydroxide
and sodium chloride.
4. Determine the amount of oxalic acid and Sulphuric acid in one litre of solution, given standard sodium
hydroxide and Potassium Permanganate.
5. Determine the amount of copper in the copper ore solution, provided hypo-solution (Iodometric
Titration).
6. Determine the amount of chloride ions present in water using silver nitrate (Mohr’s Precipitation
Method).
7. Determine the strength of MgSO4 solution by Complexometric titration.
8. Determine the surface tension of a liquid using drop number method.
9. Determine the viscosity of a given liquid (density to be determined).
10. Determine the cell constant of conductivity cell and titration of strong acid/strong base
conductometrically.
11. To determine (a) λ max of the solution of KMnO4. (b) Verify Beer’s law and find out the concentration
of unknown solution by spectrophotometer.
12. Determination of the concentration of iron in water sample by using spectrophotometer.
13. Determination of the concentration of Iron (III) by complexometric titration.
14. Proximate analysis of coal.
15. Determination of eutectic point and congruent melting point for a two component system by method of
cooling curve.
(At least 8 to 10 experiments are to be performed)
Suggested Books:
1. A. I. Vogel, G. H. Jeffery, Vogel’s Text Book of Quantitative Chemical Analysis, Published by
Longman Scientific & Technical, 5th Edition, 1989.
2. S. Chawla, Essentials of Experimental Engineering Chemistry, Dhanpat Rai & Co., 3rd Edition, 2008.
3. S. Rattan, Experiments in Applied Chemistry, Published by S.K.Kataria & Sons, 2nd Edition, 2003.
4. O. P. Pandey, D. N. Bajpai and S. Giri, Practical Chemistry,Published by S. Chand, 2005.
5. M. S. Kaurav, Engineering Chemistry with Laboratory Experiments, Published by PHI Learning
Private Limited, 2011.
6. S. K. Bhasin and Sudha Rani, Laboratory Manual on Engineering Chemistry, Published by Dhanpat
Rai Publishing Company, 2006.
Note:- Any 8-10 Experiments out of the list may be chosen.
 APPLIED MATHEMATICS-II

Paper Code : ETMA-102 L T C

Paper: APPLIED MATHEMATICS-II 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Applied Mathematics that are
required for an engineering student.
Unit –I
Partial differentiation and its Applications: Partial derivatives of first and second order. Euler’s theorem for
homogeneous functions (without proof). Derivatives of Implicit Functions, total derivatives. Change of
variables. Jacobian. Taylor’s theorem for function of two variables(without proof). Error and approximation.
Extreme values of function of several variables(maxima ,minima, saddle points). Lagrange method of
undetermined multipliers. Partial differential equations: Formulation, solution of first order equations,
Lagranges equations, Charpit’s method.
[T2][No. of 12hrs.]
Unit-II
Laplace Transformation:Definition, Laplace transformation of basic functions , existence condition for Laplace
transformation, Properties of Laplace transformation(Linearity, scaling and shifting). Unit step function,
Impulse Function, Periodic Functions. Laplace transformation of derivatives, Laplace transformation of
integrals, differentiation of transforms, Integration of transforms, Convolution theorem ,inverse Laplace
transformation. Solution of ordinary Differential equations.
[T1, T2] [No. of 12hrs.]
Unit-III
Complex Function: Definition, Derivatives, Analytic function, Cauchy’s Riemann equation (without proof).
Conformal and bilinear mappings, Complex Integration: Complex Line integration, Cauchy’s integral theorem
and integral formula(without proof). Zeros and Singularities, Taylor’s and Laurent’s series (without
proof).Residues, Residue theorem (without proof). Evaluation of real definite integrals: Integration around the
unit circle, Integration around a small semi circle and integration around rectangular contours.
[T1,T2][No. of 12hrs.]
Unit-IV
Multiple integrals: Double integrals, Change of order of integration, Triple integrals. Vector Calculus: Scalar
and vector functions, Gradient, Divergence and curl.Directional derivatives, Line Integrals.Surface integrals,
volume integrals.Green’s theorem, Stoke’s theorem and Gauss divergence theorem (without proof).
[T1, T2][No. of 12hrs.]
Text:
[T1]. E. kresyzig,” Advance Engineering Mathematics”, Wiley publications
[T2] Michael Greenberg, “Advance Engineering mathematics”, Pearson.

References:
[R1] R.K. Jain and S.R.K. Iyengar,”Advanced Engineering Mathematics “Narosa Publications
[R2] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications.
[R3] S. Ponnusamy, “Foundation of Complex Analysis” Narosa Publication
[R4] G.B. Thomas and R. N. Finny “ Calculus and Analytic Geometry” Addison Wesley/ Narosa
[R5] Wylie R, “ Advance Engineering mathematics” , McGraw-Hill
[R6] M. Spiegel, “Schaum’s Outline on Laplace Transform, Tata McGraw-Hill
 APPLIED PHYSICS – II

Paper Code: ETPH-104 L T C

Paper : APPLIED PHYSICS – II 2 1 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Applied Physics aspects that
are required for his understanding of basic physics.

UNIT I
Electromagnetic Theory : Gradient, Divergence, Curl, Gauss’ law, Ampere’s Law, Continuity equation,
Maxwell’s equations (differential and integral forms), Significance of Maxwell’s equations, Poynting Theorem,
Electromagnetic wave propagation in dielectrics and conductors.
[T1], [T2][No. of Hrs. 8]
UNIT II
Statistical Physics: Black body radiation, Planck's radiation formula, Wien's and Rayleigh-Jeans Laws,
Distribution laws: Qualitative features of Maxwell-Boltzmann, Bose-Einstein and Fermi-Dirac statistics & their
comparison (without derivation).
Quantum Mechanics: Postulates of Quantum mechanics, de-Broglie hypothesis, Davisson Germer experiment,
Wave function and its physical significance, Wave Packet, Phase and group velocities, Uncertainty principle,
Schrodinger equation for free particle, Time dependent Schrodinger equation, Particle in a box (1-D).
[T1][T2][No. of Hrs. 8]
UNIT III
Crystal Structure: Types of solids, Unit cell, Types of crystals, Translation vectors, Lattice planes, Miller
indices, Simple crystal structures, Interplaner spacing, Crystal structure analysis: Bragg’s law, Laue method,
Point defects: Schottcky and Frankel defects.
[T1], [T2][No. of Hrs. 8]
UNIT IV
Band Theory of Solids: Introduction, Kronig-Penney model: E-k diagram, Effective mass of an electron,
Intrinsic semiconductors: Electron concentration in conduction band, Hole concentration in valence band,
Extrinsic semiconductor: p-type and n-type semiconductors, Fermi level, Hall Effect: Hall voltage and Hall
coefficient.
[T1][T2][No. of Hrs. 8]
Text Books:
[T1]. Arthur Beiser ‘Concepts of Modern Physics’, [McGraw-Hill], 6th Edition 2009.
[T2]. A. S.Vasudeva, ‘Modern Engineering Physics’, S. Chand, 6th Edition, 2013.

Reference Books
[R1]. Richard Wolfson ‘Essential University Physics’ Pearson, Ist edition, 2009.
[R2]. H.K. Malik & A. K. Singh ‘Engineering Physics’ [McGraw-Hill], Ist Edition, 2009.
[R3]. C. Kittle, ‘Mechanics’, Berkeley Physics Course, Vol.- I. Latest Edition.
[R4]. Irving Kaplan ‘Nuclear Physics’ Latest Edition.
[R5]. John R. Taylor, Chris D. Zafirator and Michael A. Dubson, ‘Modern Physics For Scientists and
Engineers’, PHI, 2nd Edition.
[R6]. D.J. Griffith, ‘Introduction to Electrodynamics’, Prentice Hall, Latest Edition.
 ELECTRONIC DEVICES
Paper Code: ETEC-106 L T C
Paper : Electronic Devices 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. This is the first introductory course in Electronics Engineering to the students of all the branches of
engineering during the first year.
2. Question No.1 should be compulsory and cover the entire syllabus. This question should have
objective or short answer type questions from each unit. It should be of 25 marks.
3. Every unit should have two questions. However, student may be asked to attempt only 1 question from
each unit. Each question should be of 12.5 marks.

Objective: Objective of the paper is to facilitate the student with the basics of electronic aspects that are
required for his understanding and applications in their respective field of study. The pre-requisites are, to have
a basic understanding of Applied Physics and Mathematics.
Unit-I
Evaluation Of Electronics: Introduction & Application Of Electronics, Energy Band Theory Of Crystals,
Energy Band Structures In Metals, Semiconductors And Insulators, Theory Of Semiconductors: Classification
Of Semiconductors, Conductivity Of Semiconductors, Carrier Concentration In Intrinsic & Extrinsic
Semiconductors, Properties Of Intrinsic And Extrinsic Semiconductors, Variation In Semiconductors
Parameters With Temperature, Fermi-Dirac Function, Fermi Level In A Semiconductor Having Impurities,
Band Structure Of Open-Circuited P-N Junction, Drift And Diffusion Currents, Carrier Life Time, Continuity
Equation (Elementary Treatment Only)
[T1][T2][T3][No. Of Hours: 12]
Unit – II
Theory of p-n junction Diode: Diode Current Equation, Diode Resistance, Transition Capacitance, Diffusion
Capacitance, (Elementary treatment only), Effect of Temperature on p-n Junction Diode, Switching
Characteristics, Piecewise Linear Model, Special Diodes: Zener Diode, Varactor Diode, Tunnel Diode,
Photodiode, Light Emitting Diodes, Schottky Barrier Diode, Applications of Diodes: Half-Wave Diode
Rectifier, Full-Wave Rectifier, Clippers and Clampers (Elementary treatment only).
[T1][T2][T3][No. of Hours: 11]
Unit – III
Bipolar junction transistor: Introduction of transistor, construction, transistor operations, BJT characteristics,
load line, operating point, leakage currents, saturation and cut off mode of operations, Eber-moll’s model.
[T1][T2][T3][No. of Hours: 11]
Unit – IV
Application of BJT: CB, CE, CC configurations, hybrid model for transistor at low frequencies, Introduction to
FETs and MOSFETs.
Fundamentals of digital electronics: Digital and analog signals, number systems, Boolean algebra, logic gates
with simple applications, logic gates, karnaugh maps.
[T1][T2][T3][No. of Hours: 11]
Text Books
[T1] S. Salivahanan, N. Suresh Kr. & A. Vallavaraj, “Electronic Devices & Circuit”, Tata McGraw Hill,
2008
[T2] Millman, Halkias and Jit, “Electronic devices and circuits” McGraw Hill
[T3] Boylestad & Nashelsky, “Electronic Devices & Circuits”, Pearson Education, 10 TH Edition.

Reference Books
[R1] Sedra & Smith, “Micro Electronic Circuits” Oxford University Press, VI Edition
[R2] Robert T. Paynter, “Introducing Electronic Devices & Circuits”, Pearson Education, VII Edition, 2006
 INTRODUCTION TO PROGRAMMING

Paper Code: ETCS-108 L T C

Paper: Introduction to Programming 3 0 3

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be 12.5 marks

Objective: The objective of the paper is to facilitate the student with the basics of programming aspects, using C
as the primary language. This course focuses on the programming constructs which are used in other languages
as well. This is the first course on programming and does not assume any prerequisite.

UNIT I
Concept of algorithms, Flow Charts, Overview of the compiler ( preferably GCC) , Assembler, linker and
loader , Structure of a simple Hello World Program in C ,Overview of compilation and execution process in an
IDE ( preferably Code Block)
[T1],[T2], [R4][R5][No. of hrs 8]
UNIT II
Programming using C: Preprocessor Directive, C primitive input output using get char and put char , simple I/O
Function calls from library , data type in C including enumeration , arithmetic, relational and logical operations,
conditional executing using if, else, switch and break .Concept of loops , for, while and do-while , Storage
Classes: Auto, Register, Static and Extern
[T1], [T2], [R7][No. of hrs 8]
UNIT III
Arrays (one and two dimensional), 2-d arrays used in matrix computation. Concept of Sub-programming,
functions. Parameter transmission schemes i.e. call by value and call by reference, Pointers, relationship
between array and pointer, Argument passing using pointers, Array of pointer, passing arrays as arguments
[T2], [R1], [R7][No. of hrs 8]
UNIT IV
Structure and unions , Strings and C string library, File Handling in C Using File Pointers,fopen( ), fclose(
),Input and Output using file pointers, Character Input and Output with Files , String Input / Output Functions ,
Formatted Input / Output Functions,Block Input / Output Functions, Sequential Vs Random Access Files ,
Positioning the File Pointer
[T1], [T2],[R2][R7][No. of hrs 8]
Text Books:
[T1] Herbert Schildt, “C: The Complete Reference”, OsbourneMcgraw Hill, 4th Edition, 2002.
[T2] Forouzan Behrouz A. “Computer Science: A Structured Programming Approach Using C, Cengage
Learning 2/e
Reference Books:
[R1] Kernighan & Ritchie, “C Programming Language”, The (Ansi C version), PHI, 2/e
[R2] K.R Venugopal, “Mastering C ”, TMH
[R3] R.S. Salaria "Application Programming in C " Khanna Publishers4/e
[R4] Yashwant Kanetkar “ Test your C Skills ” , BPB Publications
[R5] http://www.codeblocks.org/
[R6] http://gcc.gnu.org/
[R7] Programming in ANSI C, E. Balagurusamy; Mc Graw Hill, 6th Edition.
 ENGINEERING MECHANICS

Paper Code: ETME 110 L T C

Paper: Engineering Mechanics 2 1 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

OBJECTIVE: THE OBJECTIVE OF THE PAPER IS TO GIVE THE BASIC PRINCIPLES OF MECHANIC
APPLIED IN DIFFERENT DISCIPLINES OF ENGINEERING.
UNIT- I
Force system: Free body diagram, Parallel force system, concurrent force system, Equilibrium equations and
applications in different force systems.
Friction: Static and Kinetic friction, laws of dry friction, co-efficient of friction, angle of friction, angle of
repose, cone of friction, Belt drive- derivation of equation T1/T2 =e and its application, M.A, V.R and
Efficiency of Screw Jack, Application of friction in pivot and collar bearing..
[T1, T2, R1, R2, R4, R5][No. of Hrs. 08]
UNIT- II
Structure: Plane truss, perfect and imperfect truss, assumption in the truss analysis, analysis of perfect plane
trusses by the method of joints, method of section, graphical method.
Distributed Force: Determination of center of gravity, center of mass and centroid by direct integration and by
the method of composite bodies, mass moment of inertia and area moment of inertia by direct integration and
composite bodies method, radius of gyration, parallel axis theorem, Pappus theorems, polar moment of inertia.
[T1, T2, R1, R2, R4, R5][No. of Hrs. 08]
Unit-III
Kinematics of Particles: Rectilinear motion, plane curvilinear motion-rectangular coordinates, normal and
tangential component.
Kinetics of Particles: Equation of motion, rectilinear motion and curvilinear motion, work energy equation,
conservation of energy, impulse and momentum, conservation of momentum, impact of bodies, co-efficient of
restitution, loss of energy during impact.
[T1, T2, R1, R2, R4, R5][No. of Hrs. 08]
Unit-IV
Kinematics of Rigid Bodies: Concept of rigid body, type of rigid body motion, absolute motion, introduction
to relative velocity, instantaneous center of velocity, Velocity polygons for four bar mechanism and single
slider mechanism.
Kinetics of Rigid Bodies: Equation of motion, translatory motion and fixed axis rotation, application of work
energy principles to rigid bodies conservation of energy.
Shear force and bending Moment Diagram. [T1, T2, R1, R2, R4, R5][No. of Hrs. 08]

Text Books:
[T1] Engg Mechanics by A.K.Tayal (Umesh Publications).
[T2] Engg Mechanics by Basudeb Bhattacharya (Oxford university Press)

Reference Books:
[R1] Engg Mechanics by Irving H. Shames (Pearson publications).
[R2] Engg Mechanics by U.C.Jindal (Galgotia Publications).
[R3] Engg Mechanics by Beer &Johnston( TMH).
[R4] Engg Mechanics by K.L.Kumar (TMH).
[R5] Engg Mechanics by Sadhu Singh (Khanna Publishers).
 COMMUNICATION SKILLS
Paper Code: ETHS – 112 L T C
Paper: Communication Skills 2 1 3
INSTRUCTIONS TO PAPER SETTERS: MAXMIUM MARKS: 75
1.Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2.Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective:To enhance the language and communication competence of professional students with emphasis on
English for Specific Purposes (ESP) through communication skills related activities.
UNIT-I
I. Basic Remedial Grammar (Errors in Parts of Speech, Tenses, Verbs and Modal; Reported Speech; Active
and Passive Voice; Conditional clauses; Question Tags and Short Responses)
[T1],[R2],[R3][No. of hrs 06]
UNIT-II
II. Vocabulary and usage (Synonyms and Antonyms; Suffixes and Prefixes; Homophones and Homonyms;
One-word substitution; Prepositions; Phrasal verbs and Idioms, Indianism)
[T1],[R2],[R3][No. of hrs 06]
UNIT-III
(A)
I. Types of writing (Expository, Descriptive, Narrative, Analytical and Argumentative)
II. Definition, description and explanation of scientific objects, instruments and processes etc.
III. Interpretation and use of charts, graphs and tables in technical writing.[T1],[R1]
(B)
I. Paragraph writing
II. Precis writing
III. Comprehension [T1],[R2],[R3]
[No. of hrs 10]
UNIT-IV
I. Reading different types of texts (speed and purpose)[T1]
II. Reading five essays [T2]
III. E.M. FORSTER, What I Believe (Pg-123)
IV. JAMES BRYCE, Some Hints on Public Speaking (Pg-135)
V. L.A. HILL, Principles of Good Writing (Pg-150)
VI. A.P.J. ABDUL KALAM, Work Brings Solace (Pg-207)
VII. SALIM ALI, Man and Nature in India: The Ecological Balance (Pg-213)
[No. of hrs 10]
TEXT BOOKS
[T1] Technical Communication: Principles and practice (OUP), (Meenakshi Raman and Sangeeta Sharma)
OXFORD UNIVERSITY PRESS
[T2] Communication Skills for Engineers, Murli Krishna, Pearson.
[T3] Wren and Martin: High School English Grammar and Composition; S. Chand
[T4] Exploration of Ideas; An Anthology of Prose: Orient Blackswan.

REFERENCE BOOKS:
[R1] Professional Communication: Aruna Koneru, MCGRAW HILLS EDUCATION PVT. LTD
[R2] Wren and Martin: High School English Grammar and Composition; S. Chand
[R3] Advanced English Grammar and Composition: Gurudas Mukherjee & Inidbar Mukherjee; (ANE
BOOKS PVT. LTD.)
 ENVIRONMENTAL STUDIES

Paper Code: ETEN-114 L T C

Paper : Environmental Studies 2 1 3
INSTRUCTIONS TO PAPER SETTER: MAXIMUM MARKS: 75
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.

2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Each unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.
Objective: The objective of this course is to make students environment conscious. They will be exposed through
the fundamental concepts of environment and ecosystem so that they can appreciate the importance of
individual and collective efforts to preserve and protect our environment. This course must raise various
questions in student’s mind that how our environment is inter dependent on various factors and how human
being must care for their natural surroundings.

UNIT I: Environmental Studies: Ecosystems, Bio-diversity and its Conservation

(i) The Multidisciplinary Nature of Environmental Studies-
Definition, scope and importance of Environmental Studies. Biotic and a biotic component of environment,
need for environmental awareness.
(ii) Ecosystems
Concept of an ecosystem, structure and function of an ecosystem, producers, consumers and decomposers,
energy flow in the ecosystem, ecological succession, food chains, food webs and ecological pyramids.
Introduction, types, characteristic features, structures and function of the following ecosystem:
(a) Forest ecosystem
(b) Grassland ecosystem
(c) Desert ecosystem
(d) Aquatic ecosystem (ponds, streams, lakes, rivers, oceans, estuaries).
(iii) Bio-diversity and its Conservation
Introduction to biodiversity —definition: genetic, species and ecosystem diversity, Bio-geographical
classification of India, Value of biodiversity: Consumptive use, productive use, social, ethical, aesthetic and
option values, Biodiversity at global, national and local levels, India as a mega-diversity nation, Hot-spots of
biodiversity, Threats to biodiversity : Habitat loss, Poaching of wildlife, man-wildlife conflicts, rare endangered
and threatened species(RET) endemic species of India, method of biodiversity conservation: In-situ and ex-situ
conservation.
[T1], [R3][No. of hrs. 08]
UNITII: Natural Resources: problems and prospects
(i) Renewable and Non-renewable Natural Resources
Concept and definition of Natural Resources and need for their management
• Forest resources:Use and over-exploitation, deforestation, case studies, timber extraction, mining,
dams and their effects on forests and tribal people.
• Water resources:Use and over-utilization of surface and ground water, floods, drought, conflicts over
water, dams-benefits and problems, Water conservation, rain water harvesting, watershed management.
• Mineral resources:Uses are exploitation, environmental effects of extracting and using mineral
resources, case studies.
• Food resources:World food problems, changes causes by agriculture and over-grazing, effects of
modern agriculture, fertilizer-pesticide problems, water logging, salinity, case studies.
• Energy resources:Growing energy needs, renewable and non-renewable energy sources, use of
alternate energy sources, Urban problems related to energy, case studies.
• Land resources:Land as a resource, land degradation, man induced landslides, soil erosion and
desertification.
[T1], [R3][No. of hrs. 08]
UNIT III: Environmental Chemistry and Pollution Control
(i) Chemistry of Environment
(a) Green Technology
Principles of Green technology, Zero Waste Technology, Green Chemistry & Its basic principles,
Atom Economy, Green Methodologies.clean development mechanisms (CDM), concept of
environmental impact assessment,

(b) Eco-Friendly polymers

Environmental degradation of polymers, Biodegradable, Photo-biodegradable polymers, Hydrolysis &
Hydrobiodegradable, Biopolymers & Bioplastics: polylactic acid, polyhydroxybutyrate,
polycaprolactone,.Concept of bioremediation.
(ii)Environmental Pollution
Definition, types, causes, effects and control measures of (a) Air pollution, (b) Water pollution, (c) Soil
pollution, (d) Marine pollution, (e) Noise pollution, (f) Thermal pollution, (g) Nuclear
hazards.Pollution case studies. Solid waste and its management: causes, effects and control measures of
urban and industrial waste.
Chemical toxicology-Terms related to toxicity, impact of chemicals (Hg, As, Cd, Cr, Pb) on
environment.
[T1], [R3][No. of hrs. 08]
UNIT IV: Disaster Management, Social Issues, Human Population and the Environment
(i) Disaster Management
Disaster management: floods, earthquake, cyclone and land-slides, nuclear accidents and holocaust, case
studies.

(ii) Social Issues, Human Population and the Environment

Sustainable development, Climate change, global warming, acid rain, ozone layer depletion, Environmental
ethics: Issues and possible solutions, Consumerism and waste products, , Wasteland reclamation. Population
growth, problems of urbanisation.
Environment Protection Act, 1986; Air (Prevention and Control of Pollution) Act, 1981; Water (Prevention and
Control of Pollution) Act, 1974; Wildlife Protection Act, 1972; Forest Conservation Act, 1980; Environmental
management system standards-ISO 14000 series.
[T1][No. of hrs. 08]
Text Books:
[T1] E. Barucha, Textbook of Environmental Studies for Undergraduate Courses,
Universities Press (India) Pvt. Ltd., 2005.
[T2] S. Chawla, A Textbook of Environmental Studies, McGraw Hill Education Private Limited, 2012
References Books:
[R1] G. T. Miller, Environmental Science, Thomas Learning, 2012
[R2] W. Cunningham and M. A. Cunningham, Principles of Environment Science: Enquiry and
Applications, Tata McGraw Hill Publication, N. Delhi, 2003.
[R3] R. Rajagopalan, Environmental Studies: From Crisis to Cure, 2nd Edition, Oxford University Press,
2011.
[R4] A.K. De, Environmental Chemistry, New Age Int. Publ. 2012,,
[R5] A. Kaushik and C.P. Kaushik, Perspectives in Environment Studies, 4 th Edition, New Age International
Publishers,2013
[R6] Environmental Engineering by Gerard Kiely, Tata McGraw-Hill Publishing Company Ltd., New Delhi,
2010.
 APPLIED PHYSICS LAB – II

Paper Code: ETPH-152 P C

Paper: Applied Physics Lab – II 2 1

LIST OF EXPERIMENTS
1. To determine the e/m ratio of an electron by J.J. Thomson method.
2. To measure the frequency of a sine-wave voltage obtained from signal generator and to obtain lissajous
pattern on the CRO screen by feeding two sine wave signals from two signal generators.
3. To determine the frequency of A.C. mains by using Sonometer .
4. To determine the frequency of electrically maintained tuning fork by Melde’s method.
5. Computer simulation (simple application of Monte Carlo): Brownian motion, charging & discharging
of a capacitor.
6. To study the charging and discharging of a capacitor and to find out the time constant.
7. To study the Hall effect.
8. To verify Stefan’s law.
9. To determine the energy band gap of a semiconductor by four probe method/or by measuring
the variation of reverse saturation current with temperature.
10. To study the I-V characteristics of Zener diode.
11. To find the thermal conductivity of a poor conductor by Lee’s disk method.
12. To study the thermo emf using thermocouple and resistance using Pt. Resistance thermometer.
Suggested Books:
[T1] C. L. Arora ‘B. Sc. Practical Physics’ S. Chand, Latest edition.
Note: Any 8-10 experiments out of the list may be chosen. Proper error – analysis must be carried out with all
the experiments.
 PROGRAMMING LAB
Paper Code : ETCS 154 P C
Paper : Programming Lab 2 1

LIST OF EXPERIMENTS
For program development an IDE e.g. CodeBlock[a] , Eclipse CDT [b], Netbeans[c] is recommended
1. Write a program to find divisor or factorial of a given number.
2. Write a program to find sum of a geometric series
3. Write a recursive program for tower of Hanoi problem
4. Write a recursive program to print the first m Fibonacci number
5. Write a menu driven program for matrices to do the following operation
depending on whether the operation requires one or two matrices
Addition of two matrices
Subtraction of two matrices
Finding upper and lower triangular matrices
Transpose of a matrix
Product of two matrices.
6. Write a program to copy one file to other, use command line arguments.
7. An array of record contains information of managers and workers of a company.
Print all the data of managers and workers in separate files.
8. Write a program to perform the following operators an Strings without using String
functions
To find the Length of String.
To concatenate two string.
To find Reverse of a string.
To Copy one sting to another string.
9. Write a Program to store records of an student in student file. The data must be stored
using Binary File.Read the record stored in “Student.txt” file in Binary code.Edit the record stored in
Binary File.Append a record in the Student file.
10. Write a programmed to count the no of Lowercase, Uppercase numbers and special
Characters presents in the contents of File.
11. Two Mini Projects based on the skills learned in experiments 1-10 [ These mini projects may be done
in a group not exceeding group size of 4 ]
[a] http://www.codeblocks.org/
[b] http://www.eclipse.org/cdt/
[c] https://netbeans.org/features/cpp/
Note:- Any 8-10 Experiments out of the list may be chosen.
 Electronic Devices

Paper Code: ETEC-156 P C

Paper: Electronic Devices Lab 2 1

LIST OF EXPERIMENTS
1. Introduction to C.R.O, Function Generator& Bread Board Kit & to generate different types of
waveform with the help of Function Generator & to calculate their frequency, amplitude AC & DC
voltage.
2. Identification & testing of Active & passive components
3. To plot V-I characteristics of a semiconductor diode &
Calculate Static & Dynamic Resistance
4. To Study the Reverse characteristics of Zener diode
5. To Study the Rectifier circuit.
a) Half Wave Rectifier
b) Centre Tapped Rectifier.
c) Bridge Rectifier.
6. To Study the output waveforms of different Filter Ckts of Rectifier.
7. To Plot Input & Output characteristics CB transistor.
8. To Plot Input & Output characteristics of CE transistor.
9. Realization of basic gates.
10. Implementation of Boolean functions (two or three variables).
11. Few experiments mentioned above to be performed on P-spice.
12. To develop a working model of any electronic circuit.
Note:- Any 8-10 Experiments out of the list may be chosen.
 ENGINEERING MECHANICS LAB

Paper Code: ETME-158 P C

Paper: Engineering Mechanics Lab 2 1

LIST OF EXPERIMENTS:

1. To verify the law of Force Polygon

2. To verify the law of Moments using Parallel Force apparatus. (simply supported type)
3. To determine the co-efficient of friction between wood and various surface (like Leather,
Wood, Aluminum) on an inclined plane.
4. To find the forces in the members of Jib Crane.
5. To determine the mechanical advantage, Velocity ratio and efficiency of a screw jack.
6. To determine the mechanical advantage, Velocity ratio and Mechanical efficiency of the
Wheel and Axle
7. To determine the MA, VR, of Worm Wheel ( 2-start)
8. Verification of force transmitted by members of given truss.
9. To verify the law of moments using Bell crank lever
10. To find CG and moment of Inertia of an irregular body using Computation method.

Note:- Any 8-10 Experiments out of the list may be chosen.

 ENVIRONMENTAL STUDIES LAB

Paper Code –ETEN-160 P C

Paper : Environmental Studies Lab 2 1

LIST OF EXPERIMENTS
1. Determination of pH, conductivity and turbidity in drinking water sample.
2. Determination of pH and conductivity of soil/sludge samples.
3. Determination of moisture content of soil sample.
4. Determination of Total Dissolved Solids (TDS) of water sample.
5. Determination of dissolved oxygen (DO) in the water sample.
6. Determination of Biological oxygen demand (BOD) in the water sample.
7. Determination of Chemical oxygen demand (COD) in the water sample.
8. Determination of Residual Chlorine in the water sample.
9. Determination of ammonia in the water sample.
10. Determination of carbon dioxide in the water sample.
11. Determination of nitrate ions or sulphate ions in water using spectrophotometer.
12. Determination of the molecular weight of polystyrene sample using viscometer method.
13. Base catalyzed aldol condensation by Green Methodology.
14. Acetylation of primary amines using eco-friendly method.
15. To determine the concentration of particulate matter in the ambient air using High Volume Sampler.
P.S.: For better understanding of various aspects of environment visits to local areas, depending upon easy
access and importance may be planned to any nearby river, forest, grassland, hills and students should write a
report based on their observations.
Suggested Books:
1. A. I. Vogel, G. H. Jeffery, Vogel’s Text Book of Quantitative Chemical Analysis, Published by
Longman Scientific & Technical, 5th Edition, 1989.
2. dst.gov.in/green-chem.pdf (monograph of green chemistry laboratory experiments).
3. S. Chawla, Essentials of Experimental Engineering Chemistry, Dhanpat Rai & Co., 3rd Edition, 2008.
4. S. Rattan, Experiments in Applied Chemistry, Published by S.K.Kataria & Sons, 2nd Edition, 2003.
5. W. Cunningham and M. A. Cunningham, Principles of Environment Science: Enquiry and
Applications, Tata McGraw Hill Publication, N. Delhi, 2003.
6. A. Kaushik and C. P. Kaushik, Perspectives in Environment Studies, 4th Edition, New Age
International Publishers, 2013.
Note:- Any 8-10 Experiments out of the list may be chosen.
 APPLIED MATHEMATICS-III

Paper Code: ETMA-201 L T/P C

Paper: Applied Mathematics-III 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks.

UNIT-I
Fourier series: Definition, Euler’s formula, conditions for Fourier expansion, functions having points of
discontinuity, change of intervals, even and odd functions ,half range series, Harmonic analysis. Fourier
Transforms: Definition, Fourier integral, Fourier transform, inverse Fourier transform, Fourier sine and cosine
transforms, properties of Fourier transforms (linearity, scaling, shifting, modulation), Application to partial
differential equations.
[T2][No. of hrs 11]
UNIT-II
Difference equation: Definition, formation, solution of linear difference equation with constant coefficients
,simultaneous difference equations with constant coefficients, applications of difference equations .Z- transform:
Definition, Z- transform of basic functions, properties of Z-transform (linearity, damping, shifting,
multiplication),initial value theorem, final value theorem, convolution theorem, convergence of Z- transform,
inverse of Z- transform, Application to difference equations.
[T2][No. of hrs 11]
UNIT-III
Numerical Methods: Solution of algebraic and transcendental equations using bisection method, Regula-Falsi
method and Newton – Raphson method. Solution of linear simultaneous equations using Gauss-Jacobi’s
iteration method and Gauss-Seidal’s iteration methods.Finite differences: Forward differences, backward
differences and Central differences. Interpolation: Newton’s interpolation for equi-spaced values. Stirling’s
central difference interpolation formula, Divided differences and interpolation formula in terms of divided
differences , Lagrange’s interpolation formula for unequi-spaced values.
[T1,T2][No. of hrs 11]
UNIT-IV
Numerical Differentiation, maxima and minima of a tabulated function. Numerical Integration: Newton-Cote’s
quadrature formula, Trapezoidal rule, Simpson’s one-third rule and Simpson’s three-eighth rule .Numerical
solution of ordinary differential equations: Picard’s method, Taylor’s method,Euler’s method, modified Euler’s
method, Runge-Kutta method of fourth order.
[T1,T2][No. of hrs 11]
Text Books:
[T1] R.K. Jain and S.R.K. Iyengar,” Numerical methods for Scientific and Engineering Computation”,
New Age Publishing Delhi-2014.
[T2] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications, 2014 Edition.

Reference Books:
[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications
[R2] P. B. Patil and U. P. Verma, “ Numerical Computational Methods”, Narosa
[R3]. Partial Differential Equations” Schaum’s Outline Series, McGraw Hill.
[R4] Michael Greenberg, “ Advance Engineering mathematics” , Pearson.
[R5] Schaum’s Outline on Fourier Analysis with Applications to Boundary Value Problem, Tata McGraw-
Hill
 FOUNDATION OF COMPUTER SCIENCE

Paper Code: ETCS-203 L T/P C

Paper: Foundation of Computer Science 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, the student may be asked to attempt only 1 question from each unit.
Each question should be 12.5 marks.

Objective: To give basic knowledge of combinatorial problems, algebraic structures and graph theory.

UNIT- I
Formal Logic: Preposition, Symbolic Representation and logical entailment theory of Inferences and
tautologies, Predicates, Quantifiers, Theory of inferences for predicate calculus, resolution. Techniques for
theorem proving: Direct Proof, Proof by Contraposition, proof by contradiction.
[T1,T2][No. of hrs. 10]
UNIT- II
Overview of Sets and set operations, permutation and combination, principle of inclusion, exclusion (with
proof) and pigeonhole principle (with proof), Relation, operation and representation of a relation, equivalence
relation, POSET, Hasse Diagrams, extremal Elements, Lattices, composition of function, inverse, binary and n-
ary operations.
[ T1,T2][No. of hrs. 12]
UNIT- III
Principle of mathematical induction, principle of complete induction, solution methods for linear and non-linear
first-order recurrence relations with constant coefficients, Graph Theory: Terminology, isomorphic graphs,
Euler’s formula (proof) ,chromatic number of a graph, five color theorem(with proof), Euler &Hamiltonian
paths.
[ T1,T2][No of hrs 11]
UNIT-IV
Groups, Symmetry, subgroups, normal subgroups, cyclic group, permutation group and cayles’s
theorem(without proof), cosets lagrange’s theorem(with proof) homomorphism, isomorphism, automorphism,
rings, Boolean function, Boolean expression, representation & minimization of Boolean function.
[ T1,T2][No of hrs 11]
Text Books:
[T1] Norman L. Biggs, “Discrete Mathematics”, Oxford, second edition.
[T2] Keneth H. Rosen, “Discrete Mathematics and Its Applications”, TMH, seventh edition.

Reference Books:
[R1] Kolman, Busby & Ross, “Discrete Mathematical Structures”, PHI, 1996.
[R2] C.L. Liu, “Elements of Discrete Mathematics”, TMH, 2000.
[R3] J. P. Trembly& P. Manohar, “Discrete Mathematical Structures with Applications to Computer
Science”, McGraw Hill, 1997.
 SWITCHING THEORY AND LOGIC DESIGN

Paper Code: ETEC-205 L T/P C

Paper: Switching Theory and Logic Design 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the knowledge of Logic Systems and
Circuits, thereby enabling the student to obtain the platform for studying Digital Systems and Computer
Architecture.

UNIT- I
Number Systems and Codes:- Decimal, Binary, Octal and Hexadecimal Number systems, Codes- BCD, Gray
Code, Excess-3 Code, ASCII, EBCDIC, Conversion between various Codes.
Switching Theory: - Boolean Algebra- Postulates and Theorems, De’ Morgan’s Theorem, Switching
Functions- Canonical Forms- Simplification of Switching Functions- Karnaugh Map and Quine Mc-Clusky
Methods.
Combinational Logic Circuits:- Review of basic gates- Universal gates, Adder, Subtractor ,Serial Adder,
Parallel Adder- Carry Propagate Adder, Carry Look-ahead Adder, Carry Save Adder, Comparators, Parity
Generators, Decoder and Encoder, Multiplexer and De-multiplexer, ALU, PLA and PAL.
[T2,T3][No. of Hrs. 14]
UNIT- II
Integrated circuits: - TTL and CMOS logic families and their characteristics. Brief introduction to RAM and
ROM.
Sequential Logic Circuits: - Latches and Flip Flops- SR, , D, T and MS-JK Flip Flops, Asynchronous Inputs.
Counters and Shift Registers:- Design of Synchronous and Asynchronous Counters:- Binary, BCD,
Decade and Up/Down Counters , Shift Registers, Types of Shift Registers, Counters using Shift Registers- Ring
Counter and Johnson Counter.
[T2,T3][No. of hrs. 10]
UNIT- III
Synchronous Sequential Circuits:- State Tables State Equations and State Diagrams, State Reduction and
State Assignment, Design of Clocked Sequential Circuits using State Equations.
Finite state machine-capabilities and limitations, Mealy and Moore models-minimization of completely
specified and incompletely specified sequential machines, Partition techniques and merger chart methods-
concept of minimal cover table.
[T1][No. of hrs. 10]
UNIT- IV
Algorithmic State Machine: Representation of sequential circuits using ASM charts synthesis of output and
next state functions, Data path control path partition-based design.
Fault Detection and Location: Fault models for combinational and sequential circuits, Fault detection in
combinational circuits; Homing experiments, distinguishing experiments, machine identification and fault
detection experiments in sequential circuits.
[T1][No. of hrs. 10]
Text Book:
[T1] Zyi Kohavi, “Switching & Finite Automata Theory”, TMH, 2nd Edition
[T2] Morris Mano, Digital Logic and Computer Design”, Pearson
[T3] R.P. Jain, “Modern Digital Electronics”, TMH, 2nd Ed,

Reference Books:
[R1] A Anand Kumar, “Fundamentals of Digital Logic Circuits”, PHI
[R2] Taub ,Helbert and Schilling, “Digital Integrated Electronics”, TMH
 Object Oriented Methodologies
Paper Code: ETCT 205 L T/P C
Paper: Object Oriented Methodologies 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To make the students well versed with current s/w developments in the industry.

UNIT-1
Fundamentals of Object Oriented Programming, Object Oriented Languages, Features, Abstractions, Abstract
Data Types, Encapsulation, Information Hiding, Coupling, Cohesion
Object Oriented Hierarchies - Inheritance, Polymorphism, Dynamic Binding, Aggregations
Object Oriented Analysis & Design - Concepts, Methodologies, Unified Modeling Language, Structural
Modeling (Class Diagram), Behavioral Modeling (Interaction Diagram, State Diagram)
[T1][No. of hrs. 11]

UNIT-II
Introduction to C++, object & classes, attributes, methods. C++ class declaration, state identity and behavior of
an object, constructors and destructors, instantiation of objects, default parameter value, object types, C++
garbage collection, dynamic memory allocation, metaclass/abstract classes. [T2][No. of
hrs. 11]

UNIT – III:
Inheritance, Class hierarchy, derivation – public, private & protected; aggregation, composition vs classification,
hierarchies, polymorphism, categorization of polymorphic techniques, method polymorphism, polymorphism by
parameter, operator overloading, parametric polymorphism, generic function – template function, function name
overloading, overriding inheritance methods, run time polymorphism. [ T1,T2][No. of hrs.
11]

UNIT – IV:
Standard C++ classes, using multiple inheritance, persistant objects, streams and files, namespaces, exception
handling, generic classes, standard template library: Library organization and containers, standard containers,
algorithm and Function objects, iterators and allocators, strings. [ T1,T2][No. of hrs.
11]

Text Books:
[T1] Rumbaugh et. al. “Object Oriented Modelling & Design”, Prentice Hall
[T2] A.R.Venugopal, Rajkumar, T. Ravishanker “Mastering C++”, TMH

Reference Books:
[R1] A.K. Sharma, “Object Oriented Programming using C++”, Pearson
[R2] G . Booch “Object Oriented Design & Applications”, Benjamin,Cummings.
[R3] E.Balaguruswamy, “Objected Oriented Programming with C++”, TMH
[R4] S. B. Lippman & J. Lajoie, “C++ Primer”, 3rd Edition, Addison Wesley, 2000.
[R5] R. Lafore, “Object Oriented Programming using C++”, Galgotia.
 SOFTWARE ENGINEERING AND PROJECT MANAGEMENT

Paper Code: ETCT-207 L T/P C

Paper: Software Engineering and Project Management 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: To improvise the concept to build any software.

UNIT-I
Role of Software Engineering, Software Evolution, Legacy system structures, Legacy system design, Legacy
System Assessment, Software Development Life Cycle. Software Process Models: Software process models,
Software Specification, Software design and implementation, Software validation, automated process support,
Prescriptive Models, The Waterfall Model, Incremental Process Models,
Evolutionary Process Models, Prototyping in the Software Process, Extreme Programming, Agile Methodology,
Scrum, The Unified Process. , Overview of Quality Standards like ISO 9001, SEI-CMM
[T2][No. of hrs
11]
UNIT-II
Project Management and Requirement Engineering: Project Planning and Scheduling, Risk Management,
Functional and Non Functional Requirements, Users Requirement, System Requirements, SRS Document
Generation, Feasibility Studies, Types of Feasibilities, Requirement Analysis, Requirement Validation,
Requirement Management, Software Measurement and Cost estimation, COCOMO model, Putnam Resource
Allocation Model.
Software Metrics: Size Metrics like LOC, Token Count, Function Count, Design Metrics, Data Structure Metrics,
and Information Flow Metrics.
[T2][No. of hrs
11]
UNIT-III
Software Design: Cohesion & Coupling, Classification of Cohesiveness & Coupling, Function Oriented Design,
Object Oriented Design, User Interface Design.
Software Reliability: Failure and Faults, Reliability Models: Basic Model, Logarithmic Poisson Model, Calendar
time Component, Reliability Allocation.
[T1][T2][No. of hrs 11]
UNIT-IV
Software Testing: Software process, Functional testing: Boundary value analysis, Equivalence class testing,
Decision table testing, Cause effect graphing, Structural testing: Path testing, Data flow and mutation testing,
unit testing, integration and system testing, Debugging, Testing Tools & Standards.
Software Maintenance: Management of Maintenance, Maintenance Process, Maintenance Models, Reverse
Engineering, Software Reengineering, Configuration Management, Documentation.
[T1][T2][No. of hrs 11]
Text Books:
[T1] R. S. Pressman, “Software Engineering – A practitioner‟s approach”, 3rd ed., McGraw Hill Int. Ed., 1992.
[T2] K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International, 2001
Reference Books:
[R1] R. Fairley, “Software Engineering Concepts”, Tata McGraw Hill, 1997.
[R2] P. Jalote, “An Integrated approach to Software Engineering”, Narosa, 1991.
[R3] Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN, 1996.
[R4] James Peter, W Pedrycz, “Software Engineering”, John Wiley & Sons
[R5] I. Sommerville, “Software Engineering”, Addison Wesley, 1999.
 DATA STRUCTURES

Paper Code: ETCS-209 L T/P C

Paper: Data Structures 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks : 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, the rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, the student may be asked to attempt only 1 question from each unit.
Each question should be 12.5 marks.

Objective: To understand the programming and the various techniques for enhancing the programming skills
for solving and getting efficient results.

UNIT – 1:
Introduction to programming methodologies and design of algorithms.Abstract Data Type, array, array
organization, sparse array.Stacks and Stack ADT, Stack Manipulation, Prefix, infix and postfix expressions,
their interconversion and expression evaluation.Queues and Queue ADT, Queue manipulation. General Lists
and List ADT, List manipulations, Single, double and circular lists.
[ T1,T2][No. of hrs. 12]
UNIT – II:
Trees, Properties of Trees, Binary trees, Binary Tree traversal, Tree manipulation algorithms, Expression trees
and their usage, binary search trees, AVL Trees, Heaps and their implementation.
[T1,T2][No. of hrs. 12]
UNIT – III:
Multiway trees, B-Trees, 2-3 trees, 2-3-4 trees, B* and B+ Trees.Graphs, Graph representation, Graph traversal.
[T1,T2][No. of hrs. 12]
UNIT – IV:
Sorting concept, order, stability, Selection sorts (straight, heap), insertion sort (Straight Insertion, Shell sort),
Exchange Sort (Bubble, quicksort), Merge sort (only 2-way merge sort). Searching – List search, sequential
search, binary search, hashing concepts, hashing methods (Direct, subtraction, modulo-division, midsquare,
folding, pseudorandom hashing), collision resolution (by open addressing: linear probe, quadratic probe,
pseudorandom collision resolution, linked list collision resolution), Bucket hashing.
[T1,T2][No. of hrs. 12]
Text Books:
[T1] R. F. Gilberg, and B. A. Forouzan, “Data structures: A Pseudocode approach with C”, Thomson
Learning.
[T2] A .V. Aho, J .E . Hopcroft, J .D .Ulman “Data Structures and Algorithm”, Pearson Education.

Reference Books:
[R1] S. Sahni and E. Horowitz, “Data Structures”, Galgotia Publications.
[R2] Tanenbaum: “Data Structures using C”, Pearson/PHI.
[R3] T .H . Cormen, C .E . Leiserson, R .L . Rivest “Introduction to Algorithms”, PHI/Pearson.
[R4] A.K.Sharma, “Data Structures”, Pearson
[R5] Ellis Horowitz and Sartaz Sahani “Fundamentals of Computer Algorithms”, Computer Science
Press.
 SWITCHING THEORY AND LOGIC DESIGN LAB

Paper Code: ETEC-253 L T/P C

Paper: Switching Theory and Logic Design Lab 0 2 1

List of Experiments:

1. Realize all gates using NAND & NOR gates

2. Realize Half Adder, Full Adder, Half subtracter, Full subtracter
3. Realize a BCD adder
4. Realize a Serial Adder
5. Realize a four bit ALU
6. Realize Master-Save J K Flip-Flop, using NAND/NOR gates
7. Realize Universal Shift Register
8. Realize Self-Starting, Self Correcting Ring Counter
9. Realize Multiplexer and De-Multiplexer
10. Realize Carry Look ahead Adder / Priority Encoder
11. Simulation of PAL and PLA
12. Simulation Mealy and Moore State machines

NOTE: - At least 8 Experiments out of the list must be done in the semester
 DATA STRUCTURES LAB

Paper Code: ETCS-255 L T/P C

Paper: Data Structures Lab 0 2 1

List of Experiments :

1. Perform Linear Search and Binary Search on an array.

Description of programs:

a. Read an array of type integer.

b. Input element from user for searching.
c. Search the element by passing the array to a function and then returning the position of the element
from the function else return -1 if the element is not found.
d. Display the position where the element has been found.
2. Implement sparse matrix using array.
Description of program:

a. Read a 2D array from the user.

b. Store it in the sparse matrix form, use array of structures.
c. Print the final array.
3. Create a linked list with nodes having information about a student and perform
I. Insert a new node at specified position.
II. Delete of a node with the roll number of student specified.
III. Reversal of that linked list.
4. Create doubly linked list with nodes having information about an employee and perform Insertion at front of
doubly linked list and perform deletion at end of that doubly linked list.
5. Create circular linked list having information about an college and perform Insertion at front perform
Deletion at end.
6. Create a stack and perform Pop, Push, Traverse operations on the stack using Linear Linked list.
7. Create a Linear Queue using Linked List and implement different operations such as Insert, Delete, and
Display the queue elements.
8. Create a Binary Tree (Display using Graphics) perform Tree traversals (Preorder, Postorder, Inorder) using
the concept of recursion.
9. Implement insertion, deletion and display (inorder, preorder and postorder) on binary search tree with the
information in the tree about the details of a automobile (type, company, year of make).
10. To implement Insertion sort, Merge sort, Quick sort, Bubble sort, Bucket sort, Radix sort, Shell sort,
Selection sort, Heap sort and Exchange sort using array as a data structure.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 Object Oriented Methodologies Lab

Paper Code: ETCT-253 L T/P C

Paper: Object Oriented Methodologies Lab 0 2 1

List of Experiment:

1. Write a program for multiplication of two matrices using OOP.

2. Write a program to perform addition of two complex numbers using constructor overloading. The first
constructor which takes no argument is used to create objects which are not initialized, second which takes
one argument is used to initialize real and imag parts to equal values and third which takes two argument
is used to initialized real and imag to two different values.
3. Write a program to find the greatest of two given numbers in two different classes using friend function.
4. Implement a class string containing the following functions:
a. Overload + operator to carry out the concatenation of strings.
b. Overload = operator to carry out string copy.
c. Overload <= operator to carry out the comparison of strings.
d. Function to display the length of a string.
e. Function tolower( ) to convert upper case letters to lower case.
f. Function toupper( ) to convert lower case letters to upper case.
5. Create a class called LIST with two pure virtual function store() and retrieve().To store a value call store
and to retrieve call retrieve function. Derive two classes stack and queue from it and override store and
retrieve.
6. Write a program to define the function template for calculating the square of given numbers with different
data types.
7. Write a program to demonstrate the use of special functions, constructor and destructor in the class
template. The program is used to find the bigger of two entered numbers.
8. Write a program to perform the deletion of white spaces such as horizontal tab, vertical tab, space, line
feed, new line and carriage return from a text file and store the contents of the file without the white spaces
on another file.
9. Write a program to read the class object of student info such as name , age ,sex ,height and weight from the
keyboard and to store them on a specified file using read() and write() functions. Again the same file is
opened for reading and displaying the contents of the file on the screen.
10. Write a program to raise an exception if any attempt is made to refer to an element whose index is beyond
the array size.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 SOFTWARE ENGINEERING AND PROJECT MANAGEMENT LAB

Paper Code: ETCT-259 L T/P C

Paper: Software Engineering and Project Management Lab 0 2 1

List of Experiments:

1. Consider the following information that you have compiled regarding the steps needed to complete a
project. You have identified all relevant steps and have made some determination regarding
predecessor/successor relationships. Using MS project , develop a simple network diagram for this
project , showing the links among the project activities.

Activity Predecessors
A- Survey Site ---------------------------
B- Install sewer and storm drainage A
C- Install gas and electric power lines A
D- Exacavate site for spec house B,C
E- Pour Foundation D

2. Suppose that we add some duration estimates to each of the activities from question 1. A portion of the
revised table is shown here. Recreate the network diagram for this project and note how MS project
uses nodes to identify activity durations, start and finish dates, and predecessors. What is the critical
path for this diagram? How do we know?

Activity Predecessors Duration

A- Survey Site --------------------------- 5 Days
B- Install sewer and storm A 9 Days
drainage
C- Install gas and electric power A 4 Days
lines
D- Exacavate site for spec house B,C 2 Days
E- Pour Foundation D 2 Days
2 Days

3. Draw the PERT diagram for the question no 2 using Activity on Arrow (AOA) convention and Activity
on Node (AON) Convention.
4. Refer to the activity network shown here in the table. Suppose that we have modified the original table
slightly to show the following predecessor relationship between tasks and resources assigned to
perform these activities. Enter the information using MS project to produce a Gantt chart. Assume that
each resource has been assigned to the project activity on full time basis.

Activity Predecessors Duration Resource Assigned

A- User Survey ----------------- 5 Days Gail Wilkins
B- Coding A 12 Days Tom Hodges

C- Debug A 5 Days Tom Hodges

D- Design Interface B,C 6 Days Sue Ryan
E- Develop Training D 5 Days Reed Taylor

A. Using the resource usage view, can you determine any warning signs that some member of the project
team has been over assigned?
B. Click on the Task Usage view to determine the specific days when there is conflict in the resource
assignment schedule.
 5. Using the keywords “Cases on project risk management “search the Internet to identify and generate
the report on any recent example of a project facing significant risks. What steps did the project
organization take to fist identify and then mitigate the risk factors in this case.

6. Go to the site http:/www. Dof.ca.gov/HTML/IT/PMM/OPT and reproduce the summary project budget
worksheet. How would you adjust this worksheet if you were estimating the costs for a new software
project? What items would you retain? Which would you remove or modify? Use MS Project to create
project summary report.

7. Using the data shown in the network precedence table below, enter various tasks in MS Project. Then
select a data approximately halfway through the overall project duration and update all tasks in the
network to show current status. You may assume that all tasks in the first half of the project are now
100% completed. What does the tracing Gantt chart look like?

Activity Predecessors Duration

A- Conduct Competitive analysis -------------------------- 3
B- Review field sales reports -------------------------- 2

C- Conduct tech capabilities assessment -------------------------- 5

D- Develop focus group data A,B,C 2
E- Conduct telephone surveys D 3
F- Identify relevant specification E 3
G- Interface with marketing staff F 1
H- Develop engineering specifications G 5
I- Check and debug designs H 4
J- Develop testing protocols G 3
K- Identify Critical Performance levels J 2
L- Assess and modify product I,K 6
components
M- Conduct capabilities assessments L 12
N- Identify selection criteria M 3
O- Develop RFQ M 4
P- Develop production master schedule N,O 5
Q- Liaison with sales staff P 1
R- Prepare product Launch Q 3

8. Draw the PERT diagram for the question no 7 using Activity on Arrow (AOA) convention and Activity
on Node (AON) Convention.
9. Go to a search engine and enter the term “Project failure” or “Project disaster” .Select one example and
develop and analysis of the project using MS Project was it terminated or not? If not why in your
opinion was it allowed to continue?
10. Do the case study of the following :
A. The IT department at Kimble college
B. The Tacoma Narrows suspension bridge
C. Project Libra to terminate or not to terminate
D. Johnson and Rogers Software Engineering Inc. (Ref.:- Jeffrey K. Pinto, Pearson publications)
11. What are the company’s top risks? How severe Is their impact and how likely are they about to occur.
Prepare RMMN plan for same. [Hint. Table should have following columns : Risk, Category, Problem
, Impact , RMMN ]
12. Explain Software Management Tools, CASE Tools, Planning and Scheduling Tools.
13. What is the Software Project Quality measures related to any projects?

NOTE:- At least 8 Experiments out of the list must be done in the semester.
APPLIED MATHEMATICS-IV

Paper Code: ETMA-202 L T/P C

Paper: Applied Mathematics-IV 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objectives:The objective of this course is to teach the students about the difference equation, probability, curve
ftting etc. and other numerical methods to solve various engineering problems.

UNIT – I
Partial Differential Equation: linear partial differential equations with constant coefficient, homogeneous and
non homogeneous linear equations. Method of separation of variables. Laplace equation, wave equation and
heat flow equation in Cartesian coordinates only with initial and boundary value.
[T1][No. of Hrs. 11]
UNIT II
Probability Theory: Definition, addition law of probability, multiplication law of probability, conditional
probability, Baye’s theorem, Random variable: discrete probability distribution, continuous probability
distribution, expectation, moments, moment generating function, skewness, kurtosis, binomial distribution,
Poisson distribution, normal distribution.
[T1,T2][No. of Hrs. 12]
UNIT-III
Curve Fitting: Principle of least square Method of least square and curve fitting for linear and parabolic curve,
Correlation Coefficient, Rank correlation, line of regressions and properties of regression coefficients. Sampling
distribution: Testing of hypothesis, level of significance, sampling distribution of mean and variance, Chi-square
distribution, Student’s T- distribution, F- distribution, Fisher’s Z- distribution.
[T1,T2][No. of Hrs. 12]
UNIT IV
Linear Programming: Introduction, formulation of problem, Graphical method, Canonical and Standard form of
LPP, Simplex method, Duality concept, Dual simplex method, Transportation and Assignment problem.
[T1][No. of Hrs. 10]
Text Books:
[T1] B. S. Grewal,”Higher Engineering Mathematics” Khanna Publications.
[T2]. N.M. Kapoor, “Fundamentals of Mathematical Statistics”, Pitambar Publications

References Books:
[R1] E. kresyzig,” Advance Engineering Mathematics”, Wiley publications
[R2] Miller and Freund, “ Probability and statistics for Engineers” , PHI
[R3] Gupta and Kapoor, “ Fundamentals of Mathematical Statistics” Sultan Chand and Sons
[R4] G. Hadley, “Linear Programming”, Narosa.
[R5] Schaum’s Outline on Probability and Statistics” Tata McGraw-Hill
[R6] Gupta and Manmohan, “ Problems in Operations Research”, Sultan Chand and Sons.
[R7] R.K. Jain and S.R.K. Iyengar,”Advanced Engineering Mathematics “Narosa Publications.
 COMPUTER ORGANIZATION & ARCHITECTURE

Paper Code: ETCS-204 L T/P C

Paper: Computer Organization & Architecture 3 1 4

INSTRUCTIONS TO PAPER SETTERS: Maximum Marks: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks.

Objective: To understand the architecture and organization of computer in depth.

UNIT- I
Basic Computer Organization and Register transfer language:
Over view of basic digital building blocks, Basic structure of a digital computer: Von-Neuman architecture,
Introduction to types of buses, Bus and memory transfer, Bus architecture using multiplexer and tri-state buffer,
register transfer language, Micro operation: arithmetic, logical, shift micro operation with hardware
implementation, Arithmetic Logic Shift Unit.
Levels of programming languages: Machine language, Assembly language, High level language, programme
development steps: compiling and assembling programmes.

[T1,T2][No. of hrs. 10]

UNIT- II
Computer Design and Instruction set architecture
Instruction codes, General computer registers with common bus system, addressing modes, computer
instructions: Memory Reference, Register reference, Input-Output Instructions, Instruction cycle, Input-Output
configuration and interrupt cycle.
Internal architecture of 8085 microprocessor: Pin diagram, 8085 instruction set.
[T1,T2][No. of hrs. 12]
UNIT- III
CPU Design:
Hardwired Control Unit, Timing and control, Micro Programmed Control Unit: Control memory and address
sequencing.
Pipelining: Introduction to Flynn’s classification, arithmetic pipeline, instruction pipeline, pipeline conflict and
hazards.
Computer arithmetic: Unsigned, Signed 1’s, 2’s compliment notations, addition, subtraction, multiplication and
division (Hardware implementation), introduction to floating point notation: IEEE 754 standard.
[T1,T2][No. of hrs. 11]
UNIT- IV
Memory & Input/output organization: Memory Hierarchy, Main Memory (RAM and ROM Chips), Virtual
memory, Cache memory and mappings.
Input/Output interface: I/O bus and interface modules, I/O bus Vs memory bus, Isolated Vs Memory mapped
I/O, Bus arbitration, modes of transfer.
[T1,T2][No. of hrs. 11]
Text Books:
[T1] M. Morris, Mano, “Computer System Architecture”, PHI 3rd Edition 2007.
[T2] Carl Hamacher, “Computer Organization”, McGraw Hill, 5 th Edition 2002.

Reference Books:
[R1] W. Stallings, “Computer organization and Architecture”, PHI, 7th ed, 2005.
[R2] R. Gaonker, “MicroProcessor Architecture, Programming and Application with the 8085, 5th Edition
[R3] J. D. Carpinelli, “Computer Systems Organization and Architecture”, Pearson Education, 2006.
[R4] J. P. Hayes, “Computer Architecture and Organization”, McGraw Hill, 1988.
[R5] J. L Hennessy and D. A. Patterson, “Computer Architecture: A quantitative approach”, Morgon
Kauffman, 1992.
 THEORY OF COMPUTATION

Paper Code: ETCS-206 L T/P C

Paper: Theory of Computation 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: To understand fundamental requirements for building algorithms of any language.

UNIT- I
Overview: Alphabets, Strings & Languages, Chomsky Classification of Languages, Finite Automata,
Deterministic finite Automata (DFA) & Nondeterministic finite Automata (NDFA), Equivalence of NDFA and
DFA, Minimization of Finite Automata, Moore and Mealy machine and their equivalence, Regular expression
and Kleen’s Theorem(with proof), Closure properties of Regular Languages, Pumping Lemma for regular
Languages(with proof).
[ T1,T2][No. of hrs. 11]
UNIT- II
Context free grammar, Derivation trees, Ambiguity in grammar and its removal, Simplification of Context Free
grammar, Normal forms for CFGs: Chomsky Normal Form & Greibach Normal Form, Pumping Lemma for
Context Free languages, Closure properties of CFL(proof required), Push Down Automata (PDA), Deterministic
PDA, Non Deterministic PDA ,Equivalence of PDA and CFG, Overview of LEX and YACC.
[ T1,T2][No. of hrs. 11]
UNIT- III
Turing machines, Turing Church’s Thesis, Variants and equivalence of Turing Machine, Recursive and
recursively enumerable languages, Halting problem, Undecidability, Examples of Undecidable problem.
[ T1,T2][No. of hrs. 11]
UNIT- IV
Introduction to Complexity classes, Computability and Intractability, time complexity, P, NP, Co-NP, Proof of
Cook’s Theorem, Space Complexity, SPACE, PSPACE, Proof of Savitch’s Theorem, L ,NL ,Co-NL complexity
classes.
[ T1,T2][No. of hrs. 11]
Text Books:
[T1] Hopcroft, John E.; Motwani, Rajeev; Ullman, Jeffrey D “Introduction to Automata Theory,
Languages, and Computation”, Third Edition, Pearson.
[T2] Sipser, Michael, ”Introduction to the theory of Computation”, Third Edition, Cengage.

References Books:
[R1] Martin J. C., “Introduction to Languages and Theory of Computations”, Third Edition, TMH.
[R2] Papadimitrou, C. and Lewis, C.L., “Elements of the Theory of Computation”, PHI.
[R3] Daniel I.A. Cohen, ”Introduction to Computer Theory”,Second Edition, John Wiley.
 DATABASE MANAGEMENT SYSTEMS

Paper Code: ETCS-208 L T/P C

Paper: Database Management Systems 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: The concepts related to database, database techniques, SQL and database operations are introduced
in this subject. This creates strong foundation for application data design.

UNIT-I : Introductory Concepts of DBMS:Introduction and application of DBMS, Data Independence,

Database System Architecture – levels, Mapping, Database users and DBA, Entity – Relationship model,
constraints, keys, Design issues, E-R Diagram, Extended E-R features- Generalization, Specialization,
Aggregation, Translating E-R model into Relational model.
[T1, T2][No. of Hrs. 10]
UNIT-II : Relational Model:Therelational Model, The catalog, Types, Keys, Relational Algebra, Fundamental
operations, Additional Operations-, SQL fundamentals, DDL,DML,DCL PL/SQL Concepts, Cursors, Stored
Procedures, Stored Functions, Database Integrity – Triggers.
[T2, R3][No. of Hrs. 10]
UNIT-III:Functional Dependencies, Non-loss Decomposition, First, Second, Third Normal Forms, Dependency
Preservation, Boyce/Codd Normal Form, Multi-valued Dependencies and Fourth Normal Form, Join
Dependencies and Fifth Normal Form.
[T2, R1, R3][No. of Hrs. 10]
UNIT-IV: Transaction Management: ACID properties, serializability of Transaction, Testing for
Serializability and concurrency control, Lock based concurrency control (2PL, Deadlocks), Time stamping
methods, Database recovery management.
Implementation Techniques: Overview of Physical Storage Media, File Organization, Indexing and Hashing,
B+ tree Index Files, Query Processing Overview, Catalog Information for Cost Estimation, Selection Operation,
Sorting, Join Operation, Materialized views, Database Tuning.
[T1, T2, R2][No. of Hrs. 12]
Text Books:
[T1] Abraham Silberschatz, Henry F. Korth, S. Sudharshan, “Database System Concepts”, 5 th Edition, Tata
McGraw Hill, 2006
[T2] Elmsari and Navathe, “Fundamentals of Database Systems”, 6th Ed., Pearson, 2013

References Books:
[R1] C.J.Date, A.Kannan, S.Swamynathan, “An Introduction to Database Systems”, 8 th Edition, Pearson
Education, 2006.
[R2] J. D. Ullman, “Principles of Database Systems”, 2nd Ed., Galgotia Publications, 1999.
[R3] Vipin C. Desai, “An Introduction to Database Systems”, West Publishing Co.,
 Probability and statistics

Paper Code: ETIE-210 L T/P C

Paper: Probability and statistics 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

UNIT I
Algebra of Sets: sets and classes, limit of a sequence of sets, rings, sigma-rings, fields, sigma-fields, monotone
classes.
Probability: Classical, relative frequency and axiomatic definitions of probability, addition rule and conditional
probability, multiplication rule, total probability, Bayes’ Theorem and independence, problems.
Random Variables: Discrete, continuous and mixed random variables, probability mass, probability density
and cumulative distribution functions, mathematical expectation, moments, probability and moment generating
function, median and quantiles, Markov inequality, Chebyshev’s inequality, problems.

UNIT II
Special Distributions: Discrete uniform, binomial, geometric, negative binomial, hypergeometric, Poisson,
continuous uniform, exponential, gamma, Weibull, Pareto, beta, normal, lognormal, inverse Gaussian, Cauchy,
double exponential distributions, reliability and hazard rate, reliability of series and parallel systems, problems.
Function of a random variable, problems.
Joint Distributions: Joint, marginal and conditional distributions, product moments, correlation and regression,
independence of random variables, bivariate normal distribution, problems.
Transformations: functions of random vectors, distributions of order statistics, distributions of sums of random
variables, problems.

UNIT III
Sampling Distributions: The Central Limit Theorem, distributions of the sample mean and the sample variance
for a normal population, Chi-Square, t and F distributions, problems.
Descriptive Statistics: Graphical representation, measures of locations and variability.
Estimation: Unbiasedness, consistency, the method of moments and the method of maximum likelihood
estimation, confidence intervals for parameters in one sample and two sample problems of normal populations,
confidence intervals for proportions, problems.

UNIT IV
Testing of Hypotheses: Null and alternative hypotheses, the critical and acceptance regions, two types of error,
power of the test, the most powerful test and Neyman-Pearson Fundamental Lemma, tests for one sample and
two sample problems for normal populations, tests for proportions, Chi-square goodness of fit test and its
applications, problems.
References Books:
1. An Introduction to Probability and Statistics by V.K. Rohatgi & A.K. Md. E. Saleh.
2. Introduction to Probability and Statistics by J.S. Milton & J.C. Arnold.
3. Introduction to Probability Theory and Statistical Inference by H.J. Larson.
4. Introduction to Probability and Statistics for Engineers and Scientists by S.M. Ross
5. A First Course in Probability by S.M. Ross
6. Probability and Statistics in Engineering by W.W. Hines, D.C. Montgomery, D.M. Gpldsman & C.M.
Borror
7. Lectures in Probability by M. Kac (for example on independent events)
8. C.K. Wong (1972) A note on mutually independent events. Annals of Statistics, V. 26, 27.(for example
on independent events).
9. Measure Theory by P. Halmos (for algebra of sets)
10. Modern Mathematical Statistics by E.J. Dudewicz & S.N. Mishra
11. Introduction to the Theory of Statistics by A.M. Mood, F.A. Graybill and D.C. Boes
 Linear and Non-Linear Optimization

Paper Code: ETIE-212 L T/P C

Paper: Linear and Non-Linear Optimization 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

UNIT I
Mathematical Background: Sequences and Subsequences- Mapping and functions- Continuous
functions- Infimum and Supremum of functions- Minima and maxima of functions- Differentiable
functions. Vectors and vector spaces- Matrices- Linear transformation- Quadratic forms- Definite
quadratic forms- Gradient and Hessian- Linear equations- Solution of a set of linear equations-Basic solution
and degeneracy. Convex sets and Convex cones- Introduction and preliminary definition- Convex sets and
properties- Convex Hulls- Extreme point- Separation and support of convex sets- Convex Polytopes and
Polyhedra- Convex cones- Convex and concave functions- Basic properties- Differentiable convex
functions- Generalization of convex functions.
UNIT II
Linear Programming: Introduction - Optimization model, formulation and applications-Classical
optimization techniques: Single and multi-variable problems-Types of constraints. Linear optimization
algorithms: The simplex method -Basic solution and extreme point Degeneracy-The primal simplex method -
Dual linear programs - Primal, dual, and duality theory - The dual simplex method -The primal-dual algorithm-
Duality applications.
Post optimization problems: Sensitivity analysis and parametric programming.
UNIT III
Nonlinear Programming: Minimization and maximization of convex functions- Local & Global optimum-
Convergence-Speed of convergence.
Unconstrained optimization: One dimensional minimization - Elimination methods: Fibonacci & Golden
section search - Gradient methods - Steepest descent method.
UNIT IV
Constrained optimization: Constrained optimization with equality and inequality constraints. Kelley's
convex cutting plane algorithm - Gradient projection method - Penalty Function methods. Constrained
optimization: Lagrangian method - Sufficiency conditions - Kuhn-Tucker optimality conditions- Rate of
convergence - Engineering applications Quadratic programming problems-Convex programming problems.

TEXT BOOKS
1. David G Luenberger, .Linear and Non Linear Programming., 2nd Ed, Addison-Wesley.
2. S.S.Rao, .Engineering Optimization.; Theory and Practice; Revised 3rd Edition, New Age
International Publishers, New Delhi

REFERENCES
1. S.M. Sinha, Mathematical programming: Theory and Methods, Elsevier, 2006.
2. Hillier and Lieberman Introduction to Operations Research, McGraw-Hill, 8th edition, 2005.
3. Saul I Gass, Linear programming, McGraw-Hill, 5th edition, 2005.
4. Bazarra M.S., Sherali H.D. & Shetty C.M., Nonlinear Programming Theory and Algorithms,John Wiley,
New York, 1979.
5. Kalyanmoy Deb, Optimization for Engineering: Design-Algorithms and Examples,PHI, 1998
 APPLIED MATHEMATICS LAB

Paper Code: ETMA-252 L T/P C

Paper: Applied Mathematics Lab 0 2 1

List of Experiments:-
1. Solution of algebraic and transcendental equation.
2. Algebra of matrices: Addition, multiplication, transpose etc.
3. Inverse of a system of linear equations using Gauss-Jordan method.
4. Numerical Integration.
5. Solution of ordinary differential equations using Runge-Kutta Method.
6. Solution of Initial value problem.
7. Calculation of eigen values and eigen vectors of a matrix.
8. Plotting of Unit step function and square wave function.

It is expected that atleast 12 experiments be performed, including the above specified 8 experiments which are
compulsory. The remaining experiments may be developed by faculty and students based on applications of
Mathematics in Real Life problem.

Text Books:
1. B.S. Grewal., “Numerical Methods in Engg. And Science”, Khanna Publications
2. P. Dechaumphai & N. Wansophark, “Numerical Methods in Engg.: Theories with Matlab, Fortran,
C & Pascal Programs”, Narosa Publications
Reference Books:
1. P.B. Patil & U.P. Verma, “Numerical Computational Methods”, Narosa Publications
2. John C. Polking & David Arnold, “Ordinary Differential Equations using MATLAB”, Pearson
Publications
3. Rudra Pratap, “Getting Started With MatLab” Oxford University Press
4. Byrom Gottfried, “Programming With C” Shaum’s Outline
5. Santosh Kumar, “Computer based Numerical & Statistical Techniques”, S. Chand Publications.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 PROBABILITY AND STATISTICS LAB

Paper Code: ETIE 254 L T/P C

Paper: Probability And Statistics Lab 0 2 1

1. Fitting of binomial distributions for given n and p.

2. Fitting of binomial distributions after computing mean and variance.
3. Fitting of Poisson distributions for given value of lambda.
4. Fitting of Poisson distributions after computing mean.
5. Fitting of normal distribution when parameters are given.
6. Fitting of normal distribution when parameters are not given
7. Exact Sample Tests based on Chi-Square Distribution.
8. Testing of significance and confidence intervals for single proportion and difference of two proportions
9. Testing of significance and confidence intervals for single mean and difference of two means and
paired tests.
10. Testing of significance and confidence intervals for difference of two standard deviations.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 DATABASE MANAGEMENT SYSTEMS LAB

Paper Code: ETCS-256 L T/P C

Paper: Database Management Systems Lab 0 2 1

LAB BASED ON DBMS

Lab includes implementation of DDL, DCL, DML i.e SQL in Oracle.

List of Experiments:

1. Design a Database and create required tables. For e.g. Bank, College Database
2. Apply the constraints like Primary Key, Foreign key, NOT NULL to the tables.
3. Write a SQL statement for implementing ALTER, UPDATE and DELETE
4. Write the queries to implement the joins
5. Write the queries for implementing the following functions: MAX (), MIN (),AVG (),COUNT ()
6. Write the queries to implement the concept of Integrity constrains
7. Write the queries to create the views
8. Perform the queries for triggers
9. Perform the following operation for demonstrating the insertion, updation and deletion using the
referential integrity constraints

TEXT BOOK:
1. SQL/ PL/SQL, The programming language of Oracle, Ivan Bayross, 4th Edition BPB Publications

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 Linear and Non-Linear Optimization Lab

Paper Code: ETCT-258 L T/P C

Paper: Linear and Non-Linear Optimization Lab 0 4 2

1. Simplex technique to solve L.P.P and reading dual solution from the optimal table.
2. Dual Simplex technique to solve L.P.P.
3. Illustration of following special cases in LPP using Simplex method (i) Unrestricted variables (ii)
Unbounded solution (iii) Infeasible solution (iv) Alternative or multiple solutions.
4. To determine local/Relative optima of a given unconstrained problem.
5. Test whether the given function is concave/convex.
6. Solution of optimization problems using Karush-Kuhn-Tucker conditions.
7. Solution of Quadratic programming problem by Wolfe’s method.
8. Solution of Quadratic programming problem by Beal’s method.

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 COMPUTER ORGANISATION AND ARCHITECTURE LAB

Paper Code: ETCS-260 L T/P C

Paper: Computer Organisation and Architecture Lab 0 2 1

List of Experiments:
Based on 8085 simulators

1. To draw and explain

i. Block diagram and pin diagram of 8085.
ii. Instruction set of 8085.
2. Write a program to perform:
i. Addition of two 8 bit numbers without carry.
ii. Addition of two 8 bit numbers with carry
3. Write a program to perform:
i. Subtraction of two 8 bit numbers without borrows.
ii. Subtraction of two 8 bit numbers with borrows.
4. Write a program to find 1’s complement of an 8 bit number.
5. Write a program to find 2’s complement of an 8 bit number.
6. Write a program to perform Multiplication of two 8 bit numbers.
7. Write a program to find to find the smallest and largest number from the given series.
8. Write a program to find sum of series of n consecutive numbers.
9. Write a program to find factorial of a number.
10. Write a program to reverse an 8 bit number.
11. Write a program to sort array in ascending/ descending order.
12. Write a program to perform division of two 8 bit numbers.

The instructor is advised to develop lab programs based on the learning concepts of architecture and insight into
operating systems.

NOTE: - At least 8 Experiments from the syllabus must be done in the semester
 ALGORITHMS DESIGN AND ANALYSIS

Paper Code: ETCS-301 L T/P C

Paper: Algorithms Design and Analysis 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: The objective of this paper is to teach the students various problem solving strategies like divide and
conquer, Greedy method, Dynamic programming and also the mathematical background for various
algorithms. After doing this course, students will be able to select an appropriate problem solving strategies for
real world problems. This will also help them to calculate the time, complexity and space complexity of various
algorithms.

UNIT – I
Asymptotic notations for time and space complexity, Big-Oh notation, Θ notation, Ω notation, the little-oh
notation, the little-omega notation, Recurrence relations: iteration method, recursion tree method, substitution
method, master method (with proof), subtract and conquer master method(with proof), Data Structures for
Disjoint Sets, Medians and Order statistics. Complexity analysis, Insertion sort, Merge Sort, Quick sort.
Strassen’s algorithm for Matrix Multiplications.
[T1][R1][R2][No. of Hrs. 10]
UNIT – II
Dynamic Programming: Ingredients of Dynamic Programming, emphasis on optimal substructure ,
overlapping substructures, memorization. Matrix Chain Multiplication, Longest common subsequence and
optimal binary search trees problems, 0-1 knapsack problem, Binomial coefficient computation through
dynamic programming. Floyd Warshall algorithm.
[T1][T2][R1] [R3][No. of Hrs. 10]
UNIT – III
Greedy Algorithms: Elements of Greedy strategy, overview of local and global optima, matroid, Activity
selection problem, Fractional Knapsack problem, Huffman Codes, A task scheduling problem. Minimum
Spanning Trees: Kruskal’s and Prim’s Algorithm, Single source shortest path: Dijkstra’s and Bellman Ford
Algorithm(with proof of correctness of algorithms).
[T1][T2][R4] [No. of Hrs. 10]
UNIT – IV
String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm, String Matching with
finite automata, The Knuth-Morris Pratt algorithm.
NP-Complete Problem: Polynomial-time verification, NP-Completeness and Reducibility, NP-Completeness
Proof, NP –hard ,Case study of NP-Complete problems (vertex cover problem, clique problem).
[T1][R1] [No. of Hrs.: 10]
Text Books:
[T1] T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to Algorithms”, 3 rd Ed., PHI,
2013.
[T2] Jon Klenberg,Eva Tardos,”Algorithm Design”, Pearson Publications,2014

Reference Books:
[R1] Sara Basse, “introduction to Design & analysis”,Pearson
[R2] Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Computer Algorithms/C++ “Second Edition,
Universities Press.
[R3] A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer Algorithms”,
Pearson Publication, 2013.
[R4] Richard Neapolitan, “Foundations of Algorithms” , Fifth Edition, Jones & Bartlett Learning
 COMMUNICATION SKILLS FOR PROFESSIONALS

Paper Code : ETHS-301 L T/P C

Paper : Communication Skills for Professionals 2 1 2

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To develop communication competence in prospective engineers so that they are able to
communicate information as well as their thoughts and ideas with clarity and precision. This course will also
equip them with the basic skills required for a variety of practical applications of communication such as
applying for a job, writing reports and proposals. Further, it will make them aware of the new developments in
communication that have become part of business organisations today.

UNIT I
Organizational Communication: Meaning, importance and function of communication, Process of
communication, Communication Cycle - message, sender, encoding, channel, receiver, decoding, feedback,
Characteristics, Media and Types of communication, Formal and informal channels of communication, 7 C’s of
communication, Barriers to communication, Ethics of communication (plagiarism, language sensitivity)
Soft Skills: Personality Development, Self Analysis through SWOT, Johari Window, Interpersonal skills -Time
management, Team building, Leadership skills. Emotional Intelligence.Self Development and Assessment- Self
assessment, Awareness, Perception and Attitudes, Values and belief, Personal goal setting, Career planning, Self
esteem.
[T1,T2][No. of Hrs. 08]
UNIT II
Introduction to Phonetics: IPA system (as in Oxford Advanced Learner’s Dictionary), Speech Mechanism,
The Description of Speech Sounds, Phoneme, Diphthong, Syllable, Stress, Intonation, Prosodic Features;
Pronunciation; Phonetic Transcription - Conversion of words to phonetic symbols and from phonetic symbols to
words. British & American English (basic difference in vocabulary, spelling, pronunciation, structure)
Non-Verbal Language: Importance, characteristics, types – Paralanguage (voice, tone, volume, speed, pitch,
effective pause), Body Language (posture, gesture, eye contact, facial expressions), Proxemics, Chronemics,
Appearance, Symbols.
[T1,T2][No. of Hrs. 08]
UNIT III
Letters at the Workplace – letter writing (hard copy and soft copy): request, sales, enquiry, order, complaint.
Job Application -- resume and cover letter
Meeting Documentation-- notice, memo, circular, agenda and minutes of meeting.
Report Writing - Significance, purpose, characteristics, types of reports, planning, organizing and writing a
report, structure of formal report. Writing an abstract, summary, Basics of formatting and style sheet (IEEE
Editorial Style Manual), development of thesis argument, data collection, inside citations, bibliography;
Preparing a written report for presentation and submission. Writing a paper for conference presentation/journal
submission.
[T1,T2][No. of Hrs. 08]
UNIT IV
Listening and Speaking Skills: Importance, purpose and types of listening, process of listening, difference
between hearing and listening, Barriers to effective listening, Traits of a good listener, Tips for effective
listening. Analytical thinking; Speech, Rhetoric, Polemics; Audience analysis. Telephone Skills - making and
receiving calls, leaving a message, asking and giving information, etiquettes.
Presentations: Mode, mean and purpose of presentation, organizing the contents, nuances of delivery, voice
and body language in effective presentation, time dimension.
Group Discussion: Purpose, types of GDs, strategies for GDs, body language and guidelines for group
discussion.
Interview Skills: Purpose, types of interviews, preparing for the interview, attending the interview, interview
process, employers expectations, general etiquettes.
[T1,T2][No. of Hrs. 07]
Text Books:
[T1] Anna Dept.Of English. Mindscapes: English for Technologists & Engineers PB. New Delhi: Orient
Blackswan.
[T2] Farhathullah, T. M. Communication Skills for Technical Students.Orient Blackswan, 2002.

References Books:
[R1] Masters, Ann and Harold R. Wallace.Personal Development for Life and Work, 10th Edition.Cengage
Learning India, 2012.
[R2] Institute of Electrical and Electronics Engineers. IEEE Editorial Style Manual.IEEE, n.d. Web. 9 Sept.
2009.
[R3] Sethi and Dhamija.A Course in Phonetics and Spoken English.PHI Learning, 1999.
[R4] Khera, Shiv. You Can Win. New York: Macmillan, 2003.
 DATA SCIENCES
Paper Code: ETCT 303 L T C
Paper : Data Sciences 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

This is the first introductory course in Electronics Engineering to the students of all the branches of
engineering during the first year.
Question No.1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions from each unit. It should be of 25 marks.
Every unit should have two questions. However, student may be asked to attempt only 1 question from each
unit. Each question should be of 12.5 marks.

Objective: The objective of this course is to impart necessary knowledge of the mathematical foundations
needed for data science and develop programming skills required to build data science applications.

UNIT I
Introduction to Data Science: Concept of Data Science, Traits of Big data, Web Scraping, Analysis vs
Reporting, Programming Tools for Data Science: Toolkits using Python: Matplotlib, NumPy, Scikit-
learn, NLTK, Visualizing Data: Bar Charts, Line Charts, Scatterplots, Working with data: Reading Files,
Scraping the Web, Using APIs (Example: Using the Twitter APIs), Cleaning and Munging,
Manipulating Data, Rescaling, Dimensionality Reduction

UNIT II
Mathematical Foundations: Linear Algebra: Vectors, Matrices, Statistics: Describing a Single Set of
Data, Correlation, Simpson’s Paradox, Correlation and Causation, Probability: Dependence and
Independence, Conditional Probability, Bayes’s Theorem, Random Variables, Continuous
Distributions, The Normal Distribution, The Central Limit Theorem, Hypothesis and Inference:
Statistical Hypothesis Testing, Confidence Intervals, P-hacking, Bayesian Inference

UNIT III
Machine Learning: Overview of Machine learning concepts –Over fitting and train/test splits, Types
of Machine learning –Supervised, Unsupervised, Reinforced learning, Introduction to Bayes
Theorem, Linear Regression-model assumptions, regularization (lasso, ridge, elastic net),
Classification and Regression algorithms-Naïve Bayes, K-Nearest Neighbors, logistic regression,
support vector machines (SVM), decision trees, and random forest, Classification Errors, Analysis of
Time Series-Linear Systems Analysis, Nonlinear Dynamics, Rule Induction, Neural Networks-Learning
And Generalization,Overview of Deep Learning.

UNIT IV
Case Studies of Data Science Application: Weather forecasting, Stock market prediction, Object
recognition, Real Time Sentiment Analysis

TEXT BOOK
1. Joel Grus, "Data Science from Scratch: First Principles with Python", O'Reilly Media
2. Ian Goodfellow, Yoshua Bengio and Aaron Courville, "Deep Learning", MIT Press
3. Jain V.K., “Data Sciences”, Khanna Publishing House
REFERENCES
1. Jain V.K., “Big Data and Hadoop”, Khanna Publishing House
2. Jeeva Jose, “Machine Learning”, Khanna Publishing House
3. Jiawei Han and Jian Pei, "Data Mining Concepts and Techniques", Third Edition, Morgan
Kaufmann Publishers
4. Aurélien Géron, "Hands-On Machine Learning with Scikit-Learn and Tensor Flow: Concepts,
Tools, and Techniques to Build Intelligent Systems", 1st Edition, O'Reilly Media
 JAVA PROGRAMMING

Paper Code: ETCS-307 L T/P C

Paper: Java Programming 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: To learn object-oriented concepts and enhancing programming skills.

UNIT I
Overview and characteristics of Java, Java program Compilation and Execution Process Organization of the
Java Virtual Machine, JVM as an interpreter and emulator, Instruction Set, class File Format, Verification, Class
Area, Java Stack, Heap, Garbage Collection. Security Promises of the JVM, Security Architecture and Security
Policy. Class loaders and security aspects, sandbox model
[T1,R2][No. of Hrs.: 11]
UNIT II
Java Fundamentals, Data Types & Literals Variables, Wrapper Classes, Arrays, Arithmetic Operators, Logical
Operators, Control of Flow, Classes and Instances, Class Member Modifiers Anonymous Inner Class Interfaces
and Abstract Classes, inheritance, throw and throws clauses, user defined Exceptions, The StringBuffer Class,
tokenizer, applets, Life cycle of applet and Security concerns.
[T1,T2][No. of Hrs.: 12]
UNIT III
Threads: Creating Threads, Thread Priority, Blocked States, Extending Thread Class, Runnable Interface,
Starting Threads, Thread Synchronization, Synchronize Threads, Sync Code Block, Overriding Synced
Methods, Thread Communication, wait, notify and notify all.
AWT Components, Component Class, Container Class, Layout Manager Interface Default Layouts, Insets and
Dimensions, BorderLayout, FlowLayout, GridLayout, CardLayout GridBagLayout AWT Events, Event Models,
Listeners, Class Listener, Adapters, ActionEvent Methods FocusEvent KeyEvent,Mouse Events,WindowEvent
[T2][No. of Hrs.: 11]
UNIT IV
Input/Output Stream, Stream Filters, Buffered Streams, Data input and Output Stream, Print Stream Random-
access, JDBC (Database connectivity with MS-Access, Oracle, MS-SQL Server), Object serialization, Sockets,
development of client Server applications, design of multithreaded server. Remote Method invocation, Java
Native interfaces, Development of a JNI based application.
Collection API Interfaces, Vector, stack, Hashtable classes, enumerations, set, List, Map, Iterators.
[T1][R1][No. of Hrs.: 10]
Text Books:
[T1] Patrick Naughton and Herbertz Schidt, “Java-2 the complete Reference”,TMH
[T2] Sierra & bates, “Head First Java”, O’reilly

Reference Books:
[R1] E. Balaguruswamy, “Programming with Java”, TMH
[R2] Horstmann, “Computing Concepts with Java 2 Essentials”, John Wiley.
[R3] Decker & Hirshfield, “Programming.Java”, Vikas Publication.
 COMMUNICATION SYSTEMS

Paper Code: ETIT-309 L T/P C

Paper: Communication Systems 3 1 4

•
INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75
•
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
• short answer type questions. It should be of 25 marks.
• 2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
• should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
• question should be of 12.5 marks
•
•
Objective: The objective of the paper is to facilitate the students with the knowledge of electronic
communication there by enabling the student to obtain the platform for studying in communication system.

UNIT I
Introduction: Overview of Communication system, Communication channels, Mathematical Models for
Communication Channels
Introduction of random Variables: Definition of random variables, PDF, CDF and its properties, joint PDF,
CDF, Marginalized PDF, CDF, WSS wide stationery, strict sense stationery, non stationery signals, UDF, GDF,
RDF, Binomial distribution, White process, Poisson process, Wiener process.
[T1, T2][No. of Hrs. 11]
UNIT II
Analog Modulation: Modulation- Need for Modulation, Amplitude Modulation theory: DSB-SC, SSB, VSB.
Modulators and Demodulators. Angle Modulation, Relation between FM and PM Wave. Generation of FM
wave- Direct and Indirect Methods. Bandwidth of FM (NBFM, WBFM)
Pulse Analog Modulation: Sampling-Natural and Flat top. reconstruction, TDM-Pulse Amplitude Modulation
(TDM-PAM), Pulse Width Modulation (PWM), Pulse Position Modulation(PPM), Generation and Recovery.
Pulse Digital Modulation: Pulse Code Modulation (PCM), Differential Pulse Code Modulation (DPCM),
Delta Modulation (DM), ADPCM.
[T1, T2][No. of Hrs. 11]
UNIT III
Digital Modulation and Transmission: Advantages of digital communication. Modulation schemes: ASK,
PSK, FSK. Spectral Analysis. Comparison. Digital Signaling Formats-Line coding.
Information and Coding Theory: Entropy, Information, Channel Capacity. Source Coding Theorem:
Shannon Fano Coding, Huffman Coding.
[T1, T2][No. of Hrs. 11]
UNIT IV
Fiber Optical System: Basic Optical Communication System. Optical fibers versus metallic cables, Light
propagation through optical fibers. Acceptance angle and acceptance cone, Fiber configurations. Losses in
optical fibers. Introduction to Lasers and light detectors. Applications: Military, Civil and Industrial
applications.
Advanced Communication Systems: Introduction to cellular radio telephones. Introduction to satellite
Communication.
[T1, T2][No. of Hrs. 11]
Text Books:
[T1] George Kennedy, “Electronics Communication System”, TMH 1993
[T2] B.P. Lathi, “Analog& Digital Communication”, Oxford University Press 1999.

Reference Books:
[R1] Simon Haykin, “Introduction to Analog & Digital Communication”, Wiley, 2000
[R2] Tannenbaum, “Computer networks”, PHI, 2003
[R3] K. Sam Shanmugam, “Digital & Analog Communication system”, John Wiley & Sons 1998.
 INDUSTRIAL MANAGEMENT

Paper Code: ETMS-311 L T/P C

Paper: Industrial Management 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The course provides a broad introduction to some aspects of business management and running of
business organization.

UNIT I
Industrial relations- Definition and main aspects. Industrial disputes and strikes. Collective bargaining.
Labor Legislation- Labor management cooperation/worker’s participation in management. Factory legislation.
International Labor Organization.
[T1,T2][No. of Hrs. 10]
UNIT II
Trade Unionism- Definition, Origin, Objectives of Trade Unions. Methods of Trade unions. Size and finance of
Indian Trade unions-size, frequency distribution, factors responsible for the small size. Finance-sources of
income, ways of improving finance.
[T1,T2][No. of Hrs. 10]
UNIT III
Work Study-Method study and time study. Foundations of work study. Main components of method study.
Time study standards. Involvement of worker’s unions. Work Sampling. Application of work study to office
work.
[T1,T2][No. of Hrs. 10]
UNIT IV
Quality Management- What is Quality? Control Charts. Quality is everybody’s job. Taguchi Philosophy.
Service Quality. What is Total Quality Management (TQM)? Roadmap for TQM.Criticism of TQM.Six Sigma.
[T1,T2][No. of Hrs. 10]
Text Books:
[T1] Sinha, P.R.N., Sinha I.B. and Shekhar S.M.(2013), Industrial Relations, Trade Unions and Labour
Legislation. Pearson Education
[T2] Chary, S.N. (2012), Production and Operations Management. Tata McGraw Hill Education.

Reference Books:
[R1] Srivastava, S.C. (2012), Industrial Relations and Labour Laws, Vikas Publishing
[R2] Shankar R (2012), Industrial Engineering and Management. Galgotia Publications
[R3] Telsang, M. (2006), Industrial Engineering and Production Management. S.Chand
[R4] Thukaram, Rao (2004), M.E. Industrial Management. Himalaya Publishing House.
 ALGORITHMS DESIGN AND ANALYSIS LAB

Paper Code: ETCS 351 L T/P C

Paper: Algorithms Design and Analysis Lab 0 2 1

List of Experiments:

1. To implement following algorithm using array as a data structure and analyse its time complexity.
a. Merge sort
b. Quick sort
c. Bubble sort
d. Bucket sort
e. Radix sort
f. Shell sort
g. Selection sort
h. Heap sort
2. To implement Linear search and Binary search and analyse its time complexity.
3. To implement Matrix Multiplication and analyse its time complexity.
4. To implement Longest Common Subsequence problem and analyse its time complexity.
5. To implement Optimal Binary Search Tree problem and analyse its time complexity.
6. To implement Huffman Coding and analyse its time complexity.
7. To implement Dijkstra’s algorithm and analyse its time complexity.
8. To implement Bellman Ford algorithm and analyse its time complexity.
9. To implement naïve String Matching algorithm, Rabin Karp algorithm and Knuth Morris Pratt
algorithm and analyse its time complexity.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 DATA SCIENCES LAB

Paper Code: ETCT 351 L T/P C

Paper: Data Sciences Lab 0 2 1

List of Experiments:

1. Write a programme in Python to predict the class of the flower based on available attributes.
2. Write a programme in Python to predict if a loan will get approved or not.
3. Write a programme in Python to predict the traffic on a new mode of transport.
4. Write a programme in Python to predict the class of user.
5. Write a programme in Python to indentify the tweets which are hate tweets and which are not.
6. Write a programme in Python to predict the age of the actors.
7. Mini project to predict the time taken to solve a problem given the current status of the user
 JAVA PROGRAMMING LAB

Paper Code: ETCS-357 L T/P C

Paper: Java Programming Lab 0 2 1

List of Experiments:

1. Create a java program to implement stack and queue concept.

2. Write a java package to show dynamic polymorphism and interfaces.
3. Write a java program to show multithreaded producer and consumer application.
4. Create a customized exception and also make use of all the 5 exception keywords.
5. Convert the content of a given file into the uppercase content of the same file.
6. Develop an analog clock using applet.
7. Develop a scientific calculator using swings.
8. Create an editor like MS-word using swings.
9. Create a servlet that uses Cookies to store the number of times a user has visited your servlet.
10. Create a simple java bean having bound and constrained properties.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 COMMUNICATION SYSTEMS LAB

Paper Code: ETIT-357 L T/P C

Paper: Communication Systems Lab 0 2 1

List of Experiments:

1. Generation of DSB-SC AM signal using balanced modulator.

2. Practical study of amplitude demodulation by linear diode detector

3. Generation of SSB AM signal.

4. Practical study of envelop detector for demodulation of AM signal and observe diagonal peak clipping
effect.

5. To generate FM signal using voltage controlled oscillator.

6. To generate a FM Signal using Varactor & reactance modulation.

7. Detection of FM Signal using PLL & foster seelay method.

8. Practical study of Super heterodyne AM receiver and measurement of receiver parameters viz.sensitivity,
selectivity & fidelity.
9. Practical study of Pre-emphasis and De-emphasis in FM.

10. Generation of Phase modulated and demodulated signal.

Simulations study of some of the above experiments using P-spice or Multisim softwares

NOTE: - At least 8 Experiments out of the list must be done in the semester
 COMPILER DESIGN

Paper Code: ETCS-302 L T/P C

Paper: Compiler Design 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: This course aims to teach students the principles involved in compiler design. It will cover all the
basic components of a compiler, its optimizations and machine code generation. Students will be able to design
different types of compiler tools to meet the requirements of the realistic constraints of compilers.

UNIT- I
Brief overview of the compilation process, structure of compiler & its different phases, lexical analyzer, cross
compiler, Bootstrapping, quick & dirty compiler, Shift-reduce parsing, operator- precedence parsing, top-
down parsing, predictive parsing ,LL(1) and LL(k) grammar, bottom up parsing, SLR, LR(0), LALR parsing
techniques.
[T1][T2][R1][No. of Hrs. 12]
UNIT- II
Design and implementation of a lexical analyzer and parsing using automated compiler construction tools(eg.
Lex, YACC, PLY), Syntax-directed translation schemes, implementation of syntax directed translations,
intermediate code, postfix notation, three address code, quadruples, and triples, translation of assignment
statements, Boolean expressions, control statements,Semantic Analysis, Type Systems, Type Expressions, Type
Checker, Type Conversion
[T2][R1][R3][R4][R5][No. of Hrs. 12]
UNIT- III
Symbol table, data structures and implementation of symbol tables, representing scope information.
Run Time Storage Administration, implementation of a simple stack allocation scheme, storage allocation in
block structured languages and non block structured languages, Error, Lexical-phase errors, syntactic-
phase errors, semantic errors.
[T1][T2]][R2][No. of Hrs. 10]
UNIT-IV
The principle sources of optimization, loop optimization, the DAG representation of basic blocks, value number
and algebraic laws, global dataflow analysis, Object programs, problems in code generation, a machine model, a
single code generator, register allocation and assignment, code generation from DAGs, peephole optimization.
[T1][T2] [No. of Hrs. 10]

Text Books:
[T1] Alfred V. Aho & J.D. Ullman, “Compiler Principles ,Techniques& Tools”, Pearson
[T2] Kenneth C. Louden, “Compiler Design”,Cengage Publication

Reference Books:
[R1] Kakde O.G., “Complier Design”, Laxmi Publication
[R2] Trembley and Sorenson, “Theory and Practice of Compiler Writing”, McGraw Hill
[R3] Vinu V. DAS, “Compiler Design Using FLEX and YACC ,PHI
[R4] Jhon R. Levine, Tony Mason and Doug Brown, “Lex &Yacc”, O’Reilly.pdf
[R5] Andrew W. Appel, Maia Ginsburg, “Modern Compiler Implementation in C”, Cambridge University
Press
 OPERATING SYSTEMS

Paper Code: ETCS-304 L T/P C

Paper: Operating Systems 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The goal of this course is to provide an introduction to the internal operation of modern operating
systems. The course will cover processes andthreads, mutual exclusion, CPU scheduling, deadlock, memory
management, and file systems.

UNIT I
Introduction: What is an Operating System, Simple Batch Systems, Multiprogrammed Batches systems, Time-
Sharing Systems, Personal-computer systems, Parallel systems, Distributed Systems, Real-Time Systems, OS –
A Resource Manager.
Memory Organization & Management: Memory Organization, Memory Hierarchy, Memory Management
Strategies, Contiguous versus non- Contiguous memory allocation, Partition Management Techniques, Logical
versus Physical Address space, swapping, Paging, Segmentation, Segmentation with Paging
Virtual Memory: Demand Paging, Page Replacement, Page-replacement Algorithms, Performance of Demand
Paging, Thrashing, Demand Segmentation, and Overlay Concepts.
[T1] [T2][R2][R3] [No. of hrs. 10]
UNIT II
Processes: Introduction, Process states, process management, Interrupts, Interprocess Communication
Threads: Introduction, Thread states, Thread Operation, Threading Models.
Processor Scheduling: Scheduling levels, pre emptive vs no pre emptive scheduling, priorities, scheduling
objective, scheduling criteria, scheduling algorithms, demand scheduling, real time scheduling.
Process Synchronization: Mutual exclusion, software solution to Mutual exclusion problem, hardware solution
to Mutual exclusion problem, semaphores, Critical section problems. Case study on Dining philosopher
problem, Barber shop problem etc.
[T1][T2][[R3] [No. of hrs. 10]
UNIT III
Deadlocks: examples of deadlock, resource concepts, necessary conditions for deadlock, deadlock solution,
deadlock prevention, deadlock avoidance with Bankers algorithms, deadlock detection, deadlock recovery.
Device Management: Disk Scheduling Strategies, Rotational Optimization, System Consideration, Caching
and Buffering
[T1][T2][R1] [No. of hrs. 10]
UNIT IV
File System: Introduction, File Organization, Logical File System, Physical File System , File Allocation
strategy, Free Space Management, File Access Control, Data Access Techniques, Data Integrity Protection,
Case study on file system viz FAT32, NTFS, Ext2/Ext3 etc.
[T1] [T2][R4][R5] [No. of hrs. 10]
Text Books:
[T1] Deitel & Dietel, “Operating System”, Pearson, 3rd Ed., 2011
[T2] Silbersachatz and Galvin, “Operating System Concepts”, Pearson, 5 th Ed., 2001
[T3] Madnick & Donovan, “Operating System”, TMH,1st Ed., 2001

Reference Books:
[R1] Tannenbaum, “Operating Systems”, PHI, 4th Edition, 2000
[R2] Godbole, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2014
[R3] Chauhan, “Principles of Operating Systems”, Oxford Uni. Press, 2014
[R4] Dhamdhere, “Operating Systems”, Tata McGraw Hill, 3rd edition, 2012
[R5] Loomis, “Data Management & File Structure”, PHI, 2nd Ed.
 INFORMATION RETRIEVAL SYSTEM
Paper Code: ETIE-308 L T/P C
Paper: 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be 12.5 marks.

UNIT – I:
Introduction: Retrieval strategies: vector space model, Probabilistic retrieval strategies: Simple term weights,
Non binary independence model, Language models.

UNIT – II:
Retrieval Utilities: Relevance feedback, clustering, N-grams, Regression analysis, Thesauri.

UNIT – III:
Retrieval utilities: Semantic networks, parsing Cross –Language: Information Retrieval: Introduction, Crossing
the Language barrier.
Efficiency: Inverted Index, Query processing, Signature files, Duplicate document detection.

UNIT – IV:
Integrating structured data and text. A historical progression, Information retrieval as relational application,
Semi Structured search using a relational schema. Distributed Information Retrieval: A theoretical Model of
Distributed retrieval, web search

Text books:
[T1] David A. Grossman, OphirFrieder, Information Retrieval – Algorithms and Heuristics, Springer, 2nd
Edition ( Distributed by Universal Press), 2004

Reference books:
[R1] Gerald J Kowalski, Mark T Maybury Information Storage and Retrieval Systems: Theory and
Implementation, Springer, 2004.
[R2] Soumen Chakrabarti, Mining the Web : Discovering Knowledge from Hypertext Data, Morgan –
Kaufmann Publishers, 2002.
[R3] Christopher D Manning, PrabhakarRaghavan, HinrichSchutze, An Introduction to Information Retrieval
By Cambridge University Press, England, 2009.
 DATA COMMUNICATION & NETWORKS

Paper Code: ETEC-310 L T/P C

Paper: Data Communication & Networks 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be 12.5 marks.

Objectives: The objective of the paper is to provide an introduction to the fundamental concepts on data
communication and the design, deployment, and management of computer networks.

UNIT- I
Data Communications : Components, protocols and standards, Network and Protocol Architecture, Reference
Model ISO-OSI, TCP/IP-Overview ,topology, transmission mode, digital signals, digital to digital encoding,
digital data transmission, DTE-DCE interface, interface standards, modems, cable modem, transmission media-
guided and unguided, transmission impairment, Performance, wavelength and Shannon capacity. Review of
Error Detection and Correction codes.
Switching: Circuit switching (space-division, time division and space-time division), packet switching (virtual
circuit and Datagram approach), message switching.
[T1, T2, R1, R4] [No. of Hours: 11]
UNIT- II
Data Link Layer: Design issues, Data Link Control and Protocols: Flow and Error Control, Stop-and-wait
ARQ. Sliding window protocol, Go-Back-N ARQ, Selective Repeat ARQ, HDLC, Point-to –Point Access: PPP
Point –to- Point Protocol, PPP Stack,
Medium Access Sub layer: Channel allocation problem, Controlled Access, Channelization, multiple access
protocols, IEEE standard 802.3 & 802.11 for LANS and WLAN, high-speed LANs, Token ring, Token Bus,
FDDI based LAN, Network Devices-repeaters, hubs, switches bridges.
[T1, T2,R1][No. of Hours: 11]
UNIT- III
Network Layer: Design issues, Routing algorithms, Congestion control algorithms,
Host to Host Delivery: Internetworking, addressing and routing, IP addressing (class full & Classless), Subnet,
Network Layer Protocols: ARP, IPV4, ICMP, IPV6 ad ICMPV6.
[T1, T2,R1][No. of Hours: 11]
UNIT- IV
Transport Layer: Process to Process Delivery: UDP; TCP, congestion control and Quality of service.
Application Layer: Client Server Model, Socket Interface, Domain Name System (DNS): Electronic Mail
(SMTP), file transfer (FTP), HTTP and WWW.
[T2, T1, R1, R4][No. of Hours: 11]
Text Books:
th
[T1] A. S. Tannenbum, D. Wetherall, “Computer Networks”, Prentice Hall, Pearson, 5 Ed
[T2] Behrouz A. Forouzan, “Data Communications and Networking”, Tata McGraw-Hill, 4th Ed

Reference Books:
[R1] Fred Halsall, “Computer Networks”, Addison – Wesley Pub. Co. 1996.
th
[R2] Larry L, Peterson and Bruce S. Davie, “Computer Networks: A system Approach”, Elsevier, 4 Ed
[R3] Tomasi, “Introduction To Data Communications & Networking”, Pearson 7th impression 2011
th
[R4] William Stallings, “Data and Computer Communications”, Prentice Hall, Imprint of Pearson, 9 Ed.
[R5] Zheng , “Network for Computer Scientists & Engineers”, Oxford University Press
[R6] Data Communications and Networking: White, Cengage Learning
 MICROPROCESSORS AND MICROCONTROLLERS

Paper Code: ETEE-310 L T/P C

Paper: Microprocessors and Microcontrollers 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objective: The objective of the paper is to facilitate the student with the knowledge of microprocessor systems
and microcontroller.

UNIT- I
Introduction to Microprocessor Systems: Architecture and PIN diagram of 8085, Timing Diagram, memory
organization, Addressing modes, Interrupts. Assembly Language Programming.
[T1][No. of hrs. 10]
UNIT- II
8086 Microprocessor: 8086 Architecture, difference between 8085 and 8086 architecture, generation of
physical address, PIN diagram of 8086, Minimum Mode and Maximum mode, Bus cycle, Memory
Organization, Memory Interfacing, Addressing Modes, Assembler Directives, Instruction set of 8086, Assembly
Language Programming, Hardware and Software Interrupts.
[T2][No. of hrs. :12]
UNIT- III
Interfacing of 8086 with 8255, 8254/ 8253, 8251, 8259:Introduction, Generation of I/O Ports, Programmable
Peripheral Interface (PPI)-Intel 8255, Sample-and-Hold Circuit and Multiplexer, Keyboard and Display
Interface, Keyboard and Display Controller (8279), Programmable Interval timers (Intel 8253/8254), USART
(8251), PIC (8259), DAC, ADC, LCD, Stepper Motor.
[T1][No. of hrs. :12]
UNIT-IV
Overview of Microcontroller 8051: Introduction to 8051 Micro-controller, Architecture, Memory
organization, Special function registers, Port Operation, Memory Interfacing, I/O Interfacing, Programming
8051 resources, interrupts, Programmer’s model of 8051, Operand types, Operand addressing, Data transfer
instructions, Arithmetic instructions, Logic instructions, Control transfer instructions, Timer & Counter
Programming, Interrupt Programming.
[T3][No. of hrs. 11]
Text Books:
[T1] Muhammad Ali Mazidi, “Microprocessors and Microcontrollers”, Pearson, 2006
[T2] Douglas V Hall, “Microprocessors and Interfacing, Programming and Hardware” Tata McGraw Hill,
2006.
[T3] Ramesh Gaonkar, “MicroProcessor Architecture, Programming and Applications with the 8085”, PHI

References Books:
[R1] Muhammad Ali Mazidi, Janice Gillispie Mazidi, Rolin D. MCKinlay “The 8051 Microcontroller and
Embedded Systems”,2nd Edition, Pearson Education 2008.
[R2] Kenneth J. Ayala, “The 8086 Microprocessor: Programming & Interfacing The PC”, Delmar
Publishers,
2007.
[R3] A K Ray, K M Bhurchandi, “Advanced Microprocessors and Peripherals”, Tata McGraw Hill, 2007.
[R4] Vaneet Singh, Gurmeet Singh, “Microprocessor and Interfacing”, Satya Prakashan, 2007.
 ARTIFICIAL INTELLIGENCE

Paper Code: ETCS-312 L T/P C

Paper: Artificial Intelligence 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To learn the basics of designing intelligent agents that can solve general purpose problems, represent
and process knowledge, plan and act, reason under uncertainty and can learn from experiences

UNIT-I
Introduction: Introduction to intelligent agents
Problem solving: Problem formulation, uninformed search strategies, heuristics, informed search strategies,
constraint satisfactionSolving problems by searching, state space formulation, depth first and breadth first
search, iterative deepening
[T1,T2][No. of hrs. 12]
UNIT-II
Logical Reasoning : Logical agents , propositional logic, inferences ,first-order logic, inferences in first order
logic, forward chaining, backward chaining, unification ,resolution
[T1,T2][No. of hrs. 10]
UNIT-III
Game Playing:Scope of AI -Games, theorem proving, natural language processing, vision and speech
processing, robotics, expert systems, AI techniques- search knowledge, abstraction
[T1,T2][No. of hrs. 12]
UNIT-IV
Learning from observations: Inductive learning, learning decision trees, computational learning theory,
Explanation based learning
Applications: Environmental Science, Robotics, Aerospace, Medical Sciences etc.
[T1,T2][No. of hrs. 10]
Text Book:
[T1] Rich and Knight, “Artificial Intelligence”, Tata McGraw Hill, 1992
[T2] S. Russel and P. Norvig, “Artificial Intelligence – A Modern Approach”, Second Edition, Pearson Edu.

Reference Books:
[R1] KM Fu, "Neural Networks in Computer Intelligence", McGraw Hill
[R2] Russel and Norvig,"Artificial Intelligence: A modern approach", Pearson Education
 OPERATING SYSTEMS LAB

Paper Code: ETCS-352 L T/P C

Paper: Operating Systems Lab 0 2 1
List of Experiments:
1. Write a program to implement CPU scheduling for first come first serve.
2. Write a program to implement CPU scheduling for shortest job first.
3. Write a program to perform priority scheduling.
4. Write a program to implement CPU scheduling for Round Robin.
5. Write a program for page replacement policy using a) LRU b) FIFO c) Optimal.
6. Write a program to implement first fit, best fit and worst fit algorithm for memory management.
7. Write a program to implement reader/writer problem using semaphore.
8. Write a program to implement Banker’s algorithm for deadlock avoidance.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 INFORMATION RETRIEVAL SYSTEM LAB

Paper Code: ETIE-354 L T/P C

Paper: 0 2 1

Lab Exercises based on Information retrieval practices in following application areas.

• Inverted Index
• Automatic Summarization
• Item set Mining
• Optical Mark Recognition
• Machine Translation
• Speech Recognition
• Sentiment Analysis
• Question Answering
• Chatbots
• Market Intelligence
• Text Classification

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 DATA COMMUNICATION & NETWORKS LAB

Paper Code: ETEC-358 L T/P C

Paper: Data Communication & Networks Lab 0 2 1

List of Experiments:

1. PC to PC Communication
2. Parallel Communication using 8 bit parallel cable & Serial communication using RS 232C
3. Ethernet LAN protocol
4. To create scenario and study the performance of CSMA/CD protocol through Simulation
5. To create scenario and study the performance of token bus and token ring protocols through
simulation
6. To create scenario and study the performance of network with CSMA / CA protocol and compare
with
7. CSMA/CD protocols.
8. Implementation and study of stop and wait protocol
9. Implementation and study of Go back-N and selective repeat protocols
10. Implementation of distance vector routing algorithm
11. Implementation of Link state routing algorithm.

*All Practical can be conducted using C-Language and LAN Emulator.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 MICROPROCESSORS AND MICROCONTROLLERS LAB

Paper Code: ETEE-358 L T/P C

Paper: Microprocessors and Microcontrollers Lab 0 2 1

List of Experiments:

1. Write a program to add and subtract two 16-bit numbers with/ without carry using 8086.
2. Write a program to multiply two 8 bit numbers by repetitive addition method using 8086.
3. Write a Program to generate Fibonacci series.
4. Write a Program to generate Factorial of a number.
5. Write a Program to read 16 bit Data from a port and display the same in another port.
6. Write a Program to generate a square wave using 8254.
7. Write a Program to generate a square wave of 10 kHz using Timer 1 in mode 1(using 8051).
8. Write a Program to transfer data from external ROM to internal (using 8051).
9. Design a Minor project using 8086 Micro processor (Ex: Traffic light controller/temperature controller
etc)
10. Design a Minor project using 8051 Micro controller

NOTE: - At least 8 Experiments out of the list must be done in the semester.
 WIRELESS AD HOC AND SENSOR NETWORKS
Paper Code: ETIE-401 L T/P C
Paper: Wireless Ad hoc and Sensor Networks 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

UNIT I
MAC & ROUTING IN AD HOC NETWORKS
Introduction – Issues and challenges in ad hoc networks – MAC Layer Protocols for wireless ad hoc networks –
Contention-Based MAC protocols – MAC Protocols Using Directional Antennas – Multiple-Channel MAC
Protocols – Power-Aware MAC Protocols – Routing in Ad hoc Networks – Design Issues – Proactive, Reactive
and Hybrid Routing Protocols
UNIT II
TRANSPORT & QOS IN AD HOC NETWORKS
TCP‟s challenges and Design Issues in Ad Hoc Networks – Transport protocols for ad hoc networks – Issues
and Challenges in providing QoS – MAC Layer QoS solutions – Network Layer QoS solutions – QoS Model
UNIT III
MAC & ROUTING IN WIRELESS SENSOR NETWORKS
Introduction – Applications – Challenges – Sensor network architecture – MAC Protocols for wireless sensor
networks – Low duty cycle protocols and wakeup concepts – Contention-Based protocols – Schedule-Based
protocols – IEEE 802.15.4 Zigbee – Topology Control – Routing Protocols
UNIT IV
TRANSPORT & QOS IN WIRELESS SENSOR NETWORKS
Data-Centric and Contention-Based Networking – Transport Layer and QoS in Wireless Sensor Networks –
Congestion Control in network processing – Operating systems for wireless sensor networks – Examples
SECURITY IN AD HOC AND SENSOR NETWORKS
Security Attacks – Key Distribution and Management – Intrusion Detection – Software based Anti-tamper
techniques – Water marking techniques – Defense against routing attacks – Secure Ad hoc routing protocols –
Broadcast authentication WSN protocols – TESLA – Biba – Sensor Network Security Protocols – SPINS

TEXT BOOKS:
1. C.Siva Ram Murthy and B.S.Manoj, ―Ad Hoc Wireless Networks – Architectures and Protocols, Pearson
Education, 2006.
2. Holger Karl, Andreas Willing, ―Protocols and Architectures for Wireless Sensor Networks, John Wiley &
Sons, Inc., 2005.
REFERENCES
1. Subir Kumar Sarkar, T G Basavaraju, C Puttamadappa, ―Ad Hoc Mobile Wireless Networks, Auerbach
Publications, 2008.
2. Carlos De Morais Cordeiro, Dharma Prakash Agrawal, ―Ad Hoc and Sensor Networks: Theory and
Applications (2nd Edition), World Scientific Publishing, 2011.
3. Waltenegus Dargie, Christian Poellabauer, ―Fundamentals of Wireless Sensor Networks Theory and
Practice, John Wiley and Sons, 2010
4. Xiang-Yang Li , “Wireless Ad Hoc and Sensor Networks: Theory and Applications, 1227 th edition,
Cambridge university Press,2008.
 BLOCKCHAIN
Paper Code: ETCT 401 L T/P C
Paper : Blockchain 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.
3. Two internal sessional test of 10 marks each and one project report* carrying 5 marks.

Objectives: The objective of this course is to provide conceptual understanding of how block chain technology
can be used to innovate and improve business processes. The course covers the technological underpinning of
block Chain operations in both theoretical and practical implementation of solutions using block Chain
technology.

UNIT I
Introduction: Overview of Block chain, Public Ledgers, Bitcoin, Smart Contracts, Block in a Block chain,
Transactions, Distributed Consensus, Public vs Private Block chain, Understanding Crypto currency to Block
chain, Permissioned Model of Block chain, Overview of Security aspects of Block chain Basic Crypto
Primitives:Cryptographic Hash Function, Properties of a hash function, Hash pointer and Merkle tree, Digital
Signature, Public Key Cryptography, A basic cryptocurrency.
UNIT II
Understanding Block chain with Crypto currency: Bitcoin and Block chain:Creation of coins, Payments and
double spending, Bitcoin Scripts, Bitcoin P2P Network, Transaction in Bitcoin Network, Block Mining, Block
propagation and block relay.Working with Consensus in Bitcoin: Distributed consensus in open environments,
Consensus in a Bitcoin network, Proof of Work (PoW) –basic introduction, Hashcash PoW, Bitcoin PoW,
Attacks on PoW and the monopoly problem, Proof of Stake, Proof of Burn and Proof of Elapsed Time, The life
of aBitcoin Miner, Mining Difficulty, Mining Pool.
UNIT III
Understanding Block chain for Enterprises: Permissioned Block chain:Permissioned model and use cases,
Design issues for Permissioned block chains, Execute contracts, State machine replication, Overview of
Consensus models for permissioned block chain-Distributed consensus in closed environment, Paxos, RAFT
Consensus, Byzantine general problem, Byzantine fault tolerant system, Lamport-Shostak-Pease BFT
Algorithm, BFT over Asynchronous systems.Enterprise application of Block chain:Cross border payments,
Know Your Customer (KYC), Food Security, Mortgage over Block chain, Block chain enabled Trade, We
Trade –Trade Finance Network, Supply Chain Financing, Identity on Block chain
UNIT IV
Block chain application development: Hyperledger Fabric-Architecture, Identities and Policies, Membership
and Access Control, Channels, Transaction Validation, Writing smart contract using Hyperledger Fabric,
Writing smart contract using Ethereum, Overview of Ripple and Corda

TEXT BOOK

1. Melanie Swan, “Block Chain: Blueprint for a New Economy”, O’Reilly, 20152.
2. Daniel Drescher, “Block Chain Basics”, Apress; 1stedition, 20174.

REFERENCES
1. Josh Thompsons, “Block Chain: The Block Chain for Beginners-Guide to Block chain Technology and
Leveraging Block Chain Programming”
2. Imran Bashir, “Mastering Block Chain: Distributed Ledger Technology, Decentralization and Smart
Contracts Explained”, Packt Publishing
3. RiteshModi, “Solidity Programming Essentials: A Beginner’s Guide to Build Smart Contracts for Ethereum
and Block Chain”, Packt Publishing
4. Salman Baset, Luc Desrosiers, Nitin Gaur, Petr Novotny, Anthony O’Dowd, Venkatraman Ramakrishna,
“Hands-On Block Chain withHyperledger: Building Decentralized Applications with Hyperledger Fabric
and Composer”
 CRYPTOGRAPHY AND DATA COMPRESSION
Paper Code: ETIE-403 L T/P C
Paper: Cryptography and Data Compression 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

Unit-I

Data Compression: Compression Techniques: Loss less compression, Lossy compression, measure of
performance, modeling and coding, different types of models, and coding techniques.

Text Compression: Minimum variance Huffman coding, extended Huffman coding, Adaptive Huffman coding.
Arithmetic coding, Dictionary coding techniques, LZ 77, LZ 78, LZW.

Audio Compression: High quality digital audio, frequency and temporal masking, lossy sound compression, µ-
law and A-law companding, and MP3 audio standard

Unit-II

Image and Video Compression: PCM, DPCM JPEG, JPEG –LS , and JPEG 2000 standards. Intra frame
coding, motion estimation and compensation, introduction to MPEG - 2 H-264 encoder and decoder.

Data Security: Security goals, cryptography, stenography cryptographic attacks, services and mechanics.
Integer arithmetic, modular arithmetic, and linear congruence, Substitution cipher, transposition cipher, stream
and block cipher, and arithmetic. modes for block ciphers, Data encryption standard, double DES, triple DES,
attacks on DES, AES, key distribution center.

Unit-III

Number Theory and Asymmetric Key Cryptography: Primes, factorization, Fermat’s little theorem, Euler’s
theorem, and extended Euclidean algorithm. RSA, attacks on RSA, Diffie Hellman key exchange, key
management, and basics of elliptical curve cryptography. Message integrity, message authentication, MAC,
hash function, H MAC, and digital signature algorithm

Unit-IV

System Security: Malware, Intruders, Intrusion detection system, firewall design, antivirus 04 techniques,
digital Immune systems, biometric authentication, and ethical hacking.

Recommended Books:

1. Khalid Sayood, ― Introduction to Data Compression‖ ,Morgan Kaufmann, 2000

2. David Saloman, ―Data Compression: The complete reference‖ , Springer publication

3. Behrous Forouzen, ―Cryptography and Network Security‖, Tata Mc Graw –Hill Education 2011

4. Berard Menezes, ―Network Security and Cryptography‖, learning publication Cengage

5. William Stallings, ―Cryptography and Network Security‖, Pearson Education Asia Publication, 5th
edition
 BLOCK CHAIN CONCEPTS AND APPLICATIONS
Paper Code: ETIE-405 L T/P C
Paper: block chain concepts and applications 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

EMBEDDED SYSTEMS

Paper Code: ETEC-401 L T/P C

Paper: Embedded Systems 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

Objective: The objective of the paper is to enable a student to design an embedded system for specific tasks.

UNIT- I
Overview of Embedded Systems: Characteristics of Embedded Systems. Comparison of Embedded Systems
with general purpose processors.General architecture and functioning of micro controllers.8051 micro
controllers.
PIC Microcontrollers: Architecture, Registers, memory interfacing, interrupts, instructions, programming and
peripherals.
[T1][No. of hrs. 12]
UNIT- II
ARM Processors: Comparison of ARM architecture with PIC micro controller, ARM 7 Data Path, Registers,
Memory Organization, Instruction set, Programming, Exception programming, Interrupt Handling, Thumb
mode Architecture.
Bus structure: Time multiplexing, serial, parallel communication bus structure. Bus arbitration, DMA, PCI,
AMBA, I2C and SPI Buses.
[T2][No. of hrs. 12]
UNIT- III
Embedded Software, Concept of Real Time Systems, Software Quality Measurement, Compilers for Embedded
System.
[T3][No. of hrs. 10]
UNIT-IV
RTOS: Embedded Operating Systems, Multi Tasking, Multi Threading, Real-time Operating Systems, RT-
Linux introduction, RTOS kernel, Real-Time Scheduling.
[T3][No. of hrs. 10]
Text Book:
[T1] Design with PIC Microcontrollers, John B. Peatman, Pearson Education Asia, 2002
[T2] ARM System Developer’s Guide: Designing and Optimizing System Software, Andrew N. Sloss,
Dominic Symes, Chris Wright, Morgan Kaufman Publication, 2004.
[T3] Computers as components: Principles of Embedded Computing System Design, Wayne Wolf, Morgan
Kaufman Publication, 2000

References Books:
[R1] The Design of Small-Scale embedded systems, Tim Wilmshurst, Palgrave2003
[R2] Embedded System Design, Marwedel,Peter, Kluwer Publishers, 2004.
 OPTOELECTRONICS AND OPTICAL COMMUNICATION

Paper Code: ETEC-403 L T/P C

Paper: Optoelectronics and Optical Communication 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks

Objective: The objective of this paper is to introduce the student about Optical Fiber, Wave propagation,
Detectors and its structures and functions.

UNIT - I
Introduction: Optical Fiber: Structures, Wave guiding and Fabrication – Nature of light, Basic optical laws
and Definition, Optical fiber modes and Configuration, Mode theory for circular waveguides, Single mode
fibers, Graded index fiber, Fiber materials, Fabrication and mechanical properties, Fiber optic cables, Basic
Optical Communication System, Advantage of Optical Communication System .
[T1, T2][No. of Hrs.10]
UNIT – II
Attenuation in Optical Fibers: Introduction, Absorption, Scattering, Very Low Loss Materials, All Plastic &
Polymer-Clad-Silica Fibers.
Wave Propagation: Wave propagation in Step-Index & Graded Index Fiber, Overall Fiber Dispersion-Single
Mode Fibers, Multimode Fibers, Dispersion-Shifted Fiber, Dispersion, Flattened Fiber, Polarization.
[T1, T2][No. of Hrs.11]
UNIT – III
Source & Detectors: Design & LED’s for Optical Communication, Semiconductor Lasers for Optical Fiber
Communication System and their types, Semiconductor Photodiode Detectors, Avalanche Photodiode Detector
& Photo multiplier Tubes. Source to fiber power launching - Output patterns, Power coupling, Power launching,
Equilibrium Numerical Aperture, Laser diode to fiber coupling. Optical detectors- Physical principles of PIN
and APD, Detector response time, Temperature effect on Avalanche gain, Comparison of Photo detectors.
Optical receiver operation- Fundamental receiver operation, Digital signal transmission, error sources, Receiver
configuration, Digital receiver performance, Probability of error, Quantum limit, Analog receivers .
[T1, T2][No. of Hrs.11]
UNIT – IV
Optical Fiber Communication Systems: Data Communication Networks – Network Topologies, Mac
Protocols, Analog System. Advanced Multiplexing Strategies – Optical TDM, Sub carrier Multiplexing, WDM
Network. Architectures: SONET/SDH. Optical Transport Network, Optical Access Network, Optical Premise
Network. Applications-Military Applications, Civil, Consumer & Industrial Applications.
[T1, T2][No. of Hrs.12]
Text Books:
[T1] J. Gowar, “Optical Communication System”, IEEE Press – 2nd Edition.
[T2] R.P.Khare, "Fiber Optics and Opto Electronics" Oxford Publication

Reference Books:
[R1] Optical Information Processing – F. T. S. Yu – Wiley, New York, 1983
[R2] G. P. Agrawal, Fiber optic Communication Systems, John Wiley & sons, New York, 1992
[R3] A. Ghatak, K. Thyagarajan, “An Introduction to Fiber Optics”, Cambridge University Press
[R4] J. H. Franz & V. K. Jain, “Optical Communication Components & Systems”, Narosa Publish, 2013
[R5] John M. Senior, “Optical Fiber Communications”, Pearson, 3rd Edition, 2010.
 CLOUD COMPUTING

Paper Code: ETIT-407 L T/P C

Paper: Cloud Computing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be 12.5 marks

Objective: To enable students to understand the basic concepts of Cloud Computing and to apply these concepts
for designing, evaluating, simulations and comparing various applications in Cloud Computing.

UNIT I
Introduction to Cloud Computing
Overview of Parallel Computing, Grid Computing, Distributed Computing and its Variants (eg. MANETs, Peer
to Peer, Cloud), Introduction to Autonomic Computing, Evolution of Cloud Computing and it's vision, Issues
and Challenges in Cloud Computing, Applications of Cloud Computing.
[T1, T2][No. of Hours: 10]
UNIT II
Cloud Computing Architecture
Cloud Computing Architectures: features of Clouds: components, types, technologies, Service Models
(Services: IaaS, PaaS, SaaS), Deployment Models ( Public Cloud, Private Cloud, Hybrid Cloud, Community
Cloud) various cloud management platforms and tools.
[T1, T2][No. of Hours: 12]
UNIT III
Virtualization of Clouds
Virtualization: Introduction, Evolution, Virtualized Environment characteristics, Server Virtualization, VM
Provisioning and Manageability, VM Migration Services, VM Provisioning in the Cloud Context, and Future
Research Directions. Cloud Security Mechanisms (Encryption, PKI, SSO, IAM), Service Management in Cloud
Computing(SLA, Billing & Accounting etc).
[T1, T2][No. of Hours: 12]
UNIT IV
Advanced Cloud Applications
Specialized Cloud Architecture: Direct I/O Access, Load Balanced Virtual Switches, Multipath Resource
Access, Federated Clouds, Basics of Cloud Mobility,Enterprise cloud computing: Data, Processes, Components,
Architectures, applications, Enterprise Software(ERP, SCM, CRM)
Case Studies on Open Source and Commercial available tools and platforms (Microsoft Azure, Google
AppEngine, Amazon Web services, Hadoop, Eucalyptus, Cloud SIM etc).
[T1, T2][No. of Hours: 11]
Text Books:
[T1] Rajkumar Buyya, Christian Vecchiola, and Thamarai Selvi, Mastering Cloud Computing, Tata
McGraw Hill, New Delhi, India, 2013.
[T2] Thomas Erl, Zaigam Mahmood, Ricardo Puttini, Cloud Computing Concepts, Technology &
Architecture, 1st Reprint, Pearson India, 2013 (T2)
[T3] Kumar Saurabh, Cloud Computing, 2nd Edition, Wiley, 2013 (T3)
[T4] Gautam Shroff, "Enterprise Cloud Computing", Cambridge University Press.

Reference Books:
[R1] Barrie Sosinsky, Cloud Computing Bible, Wiley
[R2] A. Srinivasan and J. Suresh, Cloud computing a pratical approach for learning and Implementation,
Pearson India 1st edition
[R3] Michael Miller, Cloud Computing, Pearson, 2008.
[R4] Mukesh Singhal, Niranjan G.Shivaratri, TMH Edition. (Must be included for the basicsof distributed
systems basics from which all distributed systems have been originated).
 DISTRIBUTED DATABASES

Paper Code:ETIT-409 L T/P C

Paper:Distributed Databases 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective:The objective of this paper is to facilitate the student with principles and foundations of Distributed
databases.

UNIT I
Architecture of distributed systems: network operating system, distributed operating systems, Distributed
database systems. (a) Federated database systems, (b) multidatabase systems, and (c) Client/Server systems,
Distributed DBMS architecture.
Distributed database design: Top down design- Designing issues, Fragmentation, Allocation, Data dictionary,
Bottom up design- Schema Matching, Schema Integration, Schema Mapping, Data Cleaning
Data and Access Control: views in centralised and distributed DBMS, Data security, Semantic Integrity
Control.
[T1, R1][No. of Hours: 10]
UNIT II
Query Processing: Characterization of query processors, Layers of query processing, Query Decomposition:
Normalization, Analysis, Elimination of redundancy,
Data Localization: Reduction of primary horizontal fragmentation, Reduction of vertical fragmentation,
reduction of derived fragmentation, hybrid fragmentation.
Optimization of Distributed Query: Join ordering, Semi join based algorithms, optimization
[T1, T2][No. of Hours: 11]
UNIT III
Transaction Management:Properties of transactions, Types of transactions- flat transactions, nested
transactions, workflow.
Distributed Concurrency Control: Serializability theory, Locking based concurrency control Algorithm, Tim-
stamp based algorithms,
Deadlock Management: Prevention, Avoidance, Detection and Resolution
[T1, T2][No. of Hours: 10]
UNIT IV
Distributed DBMS Reliability: Local Reliability protocol, Distributed Reliability protocol- two phase commit
protocol, three phase commit protocol.
Parallel Database System: System architecture, Parallel query processing, Load Balancing, Database Clusters.
Web Data Management: Web Search-crawling, indexing ranking, Web Querying, Distributed XML Processing.
[T1, R2][No. of Hours: 11]
Text Books:
[T1] Principles of Distributed Database Systems.Ozsu and Valduriez.Prentice Hall.
[T2] Distributed Database Principles and Systems.Ceri and Pelagatti.McGraw Hill.

Reference Books:
[R1] Distributed Systems: Concept and Design.Coulouris, Dollimore, and Kindberg. AW.
[R2] Recovery Mechanisms in Database Systems. Kumar and Hsu, Prentice Hall.
[R3] Concurrency Control and Recovery in Database Systems. Bernstein, Hadzilacos and Goodman, AW
 SEMANTIC WEB TECHNOLOGIES

Paper Code:ETIT-411 L T/P C

Paper:Semantic Web Technologies 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: This is the aim behind the Semantic Web, which is also being referred to as Web 3.0 and which is
heavily embedded in the Artificial Intelligence area. Its long-term goal is that of enhancing the human and
machine interaction by representing the data in an understandable way for the machine.

UNIT-I
Introduction: Why Semantics-Data integration across the web, Traditional data modelling methods, semantic
relationships, metadata, Building models, Calculating with knowledge, Exchanging information, Semantic web
technology.
[T1, T2][No. of Hours: 10]
UNIT-II
RDF Resource description language: Simple Ontology’s in RDF and RDF schema- Introduction, syntax for
RDF, advanced features, Simple ontology’s in RDF schemas.
RDF Formal semantics: Why semantics, Model theoretic semantic for RDF(S),Semantic reasoning with
deduction rules, the semantic limits of RDF(S).
[T1, T2][No. of Hours: 12]
UNIT-III
Web Ontology Languages(OWL): OWL syntax and intuitive semantics, owl species, Description logics,
Model theoretic semantics of owl, Automated Reasoning with OWL.
[T1, T2][No. of Hours: 10]
UNIT-IV
Rules and Queries: Ontology and Rules-What is Rule, Data log as a first order rule language, Combining
Rules with OWL-DL, Rule interchange format RIF.
Query Language: SPARQL-Query language for RDF, Conjunctive queries for OWL-DL.
[T1, T2][No. of Hours: 12]
Text Books:
[T1] Foundation Of Semantic Web Technology:-Pascal Hitzler, Marcus Krotzsch, Sebastion Rudolph.by
Chapman and Hall Book(CRC Press).
[T2] Programming The Semantic Web:-Toby Segaran, Colin Evans, Jamie Taylor by O’Reilly Media
Publication.

Reference Books:
[R1] A Semantic Web Primer MIT Press.
[R2] Knowledge Representation: Logical, Philosophical, and Computational Foundations, JohnSowa,(ISBN-
13:978-0534949655
[R3] Foundations of Semantic Web Technologies, Pascal Hitzler, Markus Krotzsch, Sebastian
Rudolph(ISBN:978-1-4200-9059-5).
[R4] Agency and the Semantic Web, Christopher Walton, ISBN-13: 978-0199292486.
[R5] Artificial Intelligence: A Modern Approach, 3rd Edition, Stuart Russell, Peter Norvig
(ISBN-13:978-0-13-604259-4).
 SOFTWARE TESTING

Paper Code:ETIT-413 L T/P C

Paper:Software Testing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To introduce the students about the knowledge of software testing, types of testing and testing tools.

UNIT I
Introduction: What is software testing and why it is so hard?, Error, Fault, Failure, Incident, Test Cases,
Testing Process, Limitations of Testing, No absolute proof of correctness, Overview of Graph Theory.
[T1, T2][No. of Hours: 10]
UNIT II
Functional Testing: Boundary Value Analysis, Equivalence Class Testing, Decision Table Based Testing,
Cause Effect Graphing Technique.
Structural Testing: Path testing, DD-Paths, Cyclomatic Complexity, Graph Metrics, Data Flow Testing,
Mutation testing.
[T1, T2][No. of Hours: 11]
UNIT III
Reducing the number of test cases:
Prioritization guidelines, Priority category, Scheme, Risk Analysis, Regression Testing, Slice based testing
Testing Activities: Unit Testing, Levels of Testing, Integration Testing, System Testing, Debugging, Domain
Testing.
[T1, T2][No. of Hours: 11]
UNIT IV
Object Oriented Testing: Issues in Object Oriented Testing, Class Testing, GUI Testing, Object Oriented
Integration and System Testing.
Testing Tools: Static Testing Tools, Dynamic Testing Tools, Characteristics of Modern Tools.
[T1, T2][No. of Hours: 10]
Text Books:
[T1] William Perry, “Effective Methods for Software Testing”, John Wiley & Sons, New York, 1995.
[T2] Cem Kaner, Jack Falk, Nguyen Quoc, “Testing Computer Software”, Second Edition, Van Nostrand
Reinhold, New York, 1993.
[T3] Boris Beizer, “Software Testing Techniques”, Second Volume, Second Edition, Van Nostrand
Reinhold, New York, 1990.
[T4] Louise Tamres, “Software Testing”, Pearson Education Asia, 2002

Reference Books:
[R1] Roger S. Pressman, “Software Engineering – A Practitioner’s Approach”, Fifth Edition, McGraw-Hill
International Edition, New Delhi, 2001.
[R2] Boris Beizer, “Black-Box Testing – Techniques for Functional Testing of Software and Systems”, John
Wiley & Sons Inc., New York, 1995.
[R3] K.K. Aggarwal & Yogesh Singh, “Software Engineering”, New Age International Publishers, New
Delhi, 2003.
[R4] Marc Roper, “Software Testing”, McGraw-Hill Book Co., London, 1994.
[R5] Gordon Schulmeyer, “Zero Defect Software”, McGraw-Hill, New York, 1990.
[R6] Watts Humphrey, “Managing the Software Process”, Addison Wesley Pub. Co. Inc., Massachusetts,
1989.
[R7] Boris Beizer, “Software System Testing and Quality Assurance”, Van Nostrand Reinhold, New York,
1984.
[R8] Glenford Myers, “The Art of Software Testing”, John Wiley & Sons Inc., New York, 1979.
 DIGITAL SIGNAL PROCESSING

Paper Code:ETIT-415 L T/P C

Paper:Digital Signal Processing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objectives: The aim of this course is to provide in depth knowledge of various digital signal processing
techniques and design of digital filters, learn the concept of DFT FFT algorithms, and design of digital filters
using different approximations, DSP processor and architecture. The prerequisites of this subject are basic
knowledge of signal and systems.

UNIT–I :
Frequency Domain Sampling: The Discrete Fourier Transform, Properties of the DFT, Linear filtering
methods based of the DFT.
Efficient computation of the DFT: Principal Of FFT, Fast Fourier Transform Algorithms, Applications of FFT
Algorithms, A linear filtering approach to computation of the DFT.
Application of DFT, Design of Notch filter
[T2,T1][No. of Hours: 11]
UNIT–II:
Design & Structure of IIR filters from analog filters: Impulse Invariance; Bilinear transformation and its use
in design of Butterworth and Chebyshev IIR Filters; Frequency transformation in Digital Domain, Direct,
Cascade, Parallel& transposed structure
Design & structure of FIR filters: Symmetric and anti-symmetric FIR filters; Design of Linear Phase FIR
filters using windows, Frequency Sampling Method of FIR design, Direct, Cascade, Frequency Sampling,
transposed structure
[T1,T2][No. of Hours: 11]
UNIT–III:
Implementation of Discrete Time Systems:
Lattice structures, Lattice and Lattice-Ladder Structures, Schur - Cohn stability Test for IIR filters; Discrete
Hilbert Transform.
Linear predictive Coding:
Lattice filter design, Levension Darwin Technique, Schur Algorithm
[T1,T2][No. of Hours: 10]
UNIT–IV:
Quantization Errors in Digital SignalProcessing: Representation of numbers, Quantization of filter
coefficients, Round-off Effects in digital filters.
Multirate Digital Signal Processing: Decimation, Interpolation, Sampling rate conversion by a rational factor;
Frequency domain characterization of Interpolator and Decimator; Polyphase decomposition.
[T1, T2][No. of Hours: 10]
Text Books:
[T1] Oppenheim & Schafer, Digital Signal Processing, PHI-latest edition.
[T2] Proakis and Manolakis, Digital Signal Processing, PHI Publication

Reference Books:
[R1] S. K. Mitra, Digital Signal Processing, TMH edition 2006
[R2] Johny. R. Johnson, Introduction to Digital Signal Processing, PHI-latest edition
[R3] R.Babu ,Digital Signal Processing , SciTech Publication.
 .NET AND C# PROGRAMMING

Paper Code:ETIT-419 L T/P C

Paper:.NET and C# Programming 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: This course provides a solid foundation in the C# programming language, and covering the
fundamental skills that are required to design and develop object- oriented applications for the web and
Microsoft Windows by using Microsoft Visual C# .NET and the Microsoft Visual Studio .NET development
environment.

UNIT I
MS.NET Framework Introduction: Framework Components, Framework Versions, Types of Applications
which can be developed, Base Class Library, Namespaces, MSIL / Metadata and PE files, The Common
Language Runtime (CLR), Managed Code, MS.NET Memory Management / Garbage Collection, Common
Type System (CTS), Common Language Specification (CLS), Types of JIT Compilers, Security Manager,
control application development
Language basics: Why Datatypes, Global, Stack and Heap Memory, Reference Type and Value Type,
Datatypes & Variables Declaration, Implicit and Explicit Casting, Checked and Unchecked Blocks – Overflow
Checks, Casting between other datatypes, Boxing and Unboxing, Enum and Constant, Operators, Control
Statements,Working with Arrays and methods.
[T1,T2][No. of Hours: 11]
UNIT II
Introduction to Object Oriented Features:What is an Object, state of an Object, Lifecycle of an Object,
relationship between Class and Object, define Application using Objects, Principles of Object Orientation,
Encapsulation, Inheritance, Polymorphism, Encapsulation is binding of State and Behaviour together,
Inheritance is based on “is a” relationship, Understanding Polymorphism with Examples.
Constructor & Destructor, Working with "static" Members, Constructor in Inheritance, Type Casting of
Reference Types, Static and Dynamic Binding and Virtual Methods, Abstract Class Object as Parent of all
classes, Interface, Syntax for Implementation of Interface, Explicit Implementation of Interface members, Types
of Inheritance, exceptional handling.
[T1,T2][No. of Hours: 10]
UNIT III
Working with Collections and Generics:IList and IDictionary, typesafety issue with ArrayList and Hashtable
classes, IEnumerable and IEnumerator, Sorting Items in the collection using IComparable, custom generic
classes, Generic Collection Classes.
Operator Overloading, Partial Classes, Importance of Attributes, working with components/assemblies, data
stream and files: text stream, binary stream, working with file system, Serialization & Deserialization,
multithreading.
[T1,T2][No. of Hours: 11]
UNIT IV
WinForms: Introduction, Controls, Menus and Context Menus, Menu Strip, Toolbar Strip, Graphics and GDI,
SDI and MDI Applications, Dialog box, Form Inheritance, Developing Custom, Composite and Extended
Controls, Data Access using ADO.NET, Data Access using ADO.NET- dataset, XML, debugging and tracing,
Delegates & Events: Delegate Declaration, Sample Application, Chat Application using Delegates, += and -=
Operator (Events), Chat Application using Delegates and Events, General Syntax for Delegates and Events.
[T1,T2][No. of Hours: 12]
Text Books:
[T1] Stephen Walther,” ASP.NET 3.5 Unleashed or ASP.NET 4.5 Unleashed,” Pearsons Publication,
[T2] George Shepherd, "Microsoft ASP.NET 3.5 Step by Step", PHI learning Publication Eastern Economy
[T3] Chris Love, Marco Bellinaso,”ASP.NET 3.5 Website Programming Problem - Design – Solution,”
Wrox publication 2012
Reference Books:
[R1] George Shepherd, "Microsoft ASP.NET 4.0 Step by Step", PHI learning Publication Eastern Economy
[R2] Imar Spaanjaars," Beginning ASP.NET 3.5 In C# and VB," Wiley / Wrox publication, 2009
[R3] Bill Evjen, Scott Hanselman, Devin Rader, “Professional ASP.NET 3.5 in C# and VB," Wiley
publication, 2008
[R4] Matthew MacDonald, “The Complete Reference: ASP.NET”, Tata McGraw Hill, 2002.
[R5] Jason N. Gaylord et al,"Professional ASP.NET 4.5 in C# and VB," wrox publication, 2013
 SYSTEM AND NETWORK ADMINISTRATION

Paper Code: ETIT-423 L T/P C

Paper: System and Network Administration 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: This course is intended for B.Tech students, who wish to improve skills through hands-on experience
in System Administration and Network Administration.

System Administration:
UNIT- I
System Hardware: PC and Server Hardware Architecture, Operating System Administration: UNIX, Windows,
MAC OS.
Centralization and Decentralization: Centralized Authentication, Active Directories; LDAP;
Storage: RAID, Storage Area Network(SAN), Direct Attached Storage(DAS), Network Attached
Storage(NAS); Data Integrity Backup and Recovery.
[T1,T2][No. of Hours: 11]
UNIT- II
Lab Management: System Configuration, Cloning, Monitoring and Administering them; workstations, server,
Data centers Data Center Management: Administering, Surveillance, Access Control,
Special Topics: High Performance Computing, Virtualization and Cloud Computing.
[T1,T2][No. of Hours: 11]
Network Administration:
UNIT- III
Network administrator(definition and functions),Network Planning, Routine system maintenance
Computer Networks: OSI & TCP/IP Model, clean architecture;
Switching & Routing: Layer 2 & Layer 3 switching; Routing; VLAN; Cisco L2 and L3 Switch Configuration;
DHCP Configuration; IPv6, Wireless LAN: 802.11 a/b/g/n/ac WiFi; Access Point and Wireless Router
configuration.
[T1,T2][No. of Hours: 11]
UNIT-IV
Internet Architecture: ISP Architecture; DNS Resolution; Content Mirroring, Internet Applications: DNS,
Web, Mail, Proxy, NTP;
Perimeter Security: Firewall, UTM,
Network Security: LAN and WLAN Security issues; IP Spoofing; Dictionary Attack; DoS and DDoS Attack;
Rogue/Misconfigured/External APs; Network Troubleshooting: ping, traceroute, nslookup, dig, tcpdump;
Network Monitoring: SNMP; MRTG.
[T1,T2][No. of Hours: 11]
Text Books:
[T1] Thomas A Limoli, Christina J. Hogan , Strata R. Chalup " Theory and Practise of System and Network
administration " Addison-Wesley Professional; 2 edition 2007
[T2] Subramaniam Mani, Subramanian " Network Management: Principles And Practice" Pearson
Education India, 2006

References Books:
[R1] Evi Nemeth, Garth Snyder, Trent R. Hein , Ben Whaley "UNIX and Linux System Administration
Handbook" (4th Edition), 2010
[R2] Craig Hunt, "TCP/IP Network Administration" "O'Reilly Media, Inc.", 2002
[R3] Bill McCarty Learning Red Hat Linux "O'Reilly Media, Inc.", 2003
 GRID COMPUTING

Paper Code: ETIT-425 L T/P C

Paper: Grid Computing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To enable students to understand the basic concepts of Gridcomputing with performance issues, Web
services, monitoring, optimization, security and resource management.

UNIT I
Fundamentals: Overview of Distributed Systems and it's variants like grid computing, cloud computing,
Cluster Computing etc. Introduction to Grid Computing, it's components(Functional View, A Physical View,
Service View), key issues and benefits, Characterization and Architecture of Grid, Grid - Types, Topologies,
Components, Layers. Grid Computing Standards and Applications.
[T1,T2][No. of Hours: 11]
UNIT II
Web Services and Grid Monitoring: OGSA and WSRF: Overview, Services, Schema and architecture. Grid
Monitoring Systems: Overview, architecture, GridICE, JAMM, MDS and Other monitoring Systems (Ganglia
and GridMon), Grid portals.
[T1,T2][No. of Hours: 11]
UNIT III
Grid Security and Resource Management:
Grid Security: A Brief Security Primer, PKI, X509 Certificates, Grid Security
Grid Scheduling and Resource Management: Scheduling Paradigms, Working principles of Scheduling, A
Review of Condor, SGE, PBS and LSF-Grid Scheduling with QoS.
[T1,T2][No. of Hours: 11]
UNIT IV
Data Management and Grid Middleware-
Data Management: Categories and Origins of Structured Data, Data Management, Challenges, Database
integration with grid, Architectural Approaches-Collective Data Management Services, Federation Services .
Grid Middleware: List of globally available Middlewares, Globus Toolkit.
[T1,T2][No. of Hours: 11]
Text Books:
[T1] Maozhen Li, Mark Baker, The Grid Core Technologies, John Wiley & Sons.
[T2] Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson 2004.
[T3] Ian Foster & Carl Kesselman, The Grid 2 – Blueprint for a New Computing Infrastructure, Morgan
Kaufman – 2004.

References Books:
[R1] C.S. R. Prabhu ,”Grid and Cluster Computing’, PHI 2014
[R2] Barry Wilkinson, “Grid Computing”, CRC Press.
[R3] Joel M. Crichlow, “Distributed Systems – Computing over Networks”, PHI, 2014.
[R4] RajKumar Buyya, “High Performance Cluster Computing – Volume I Architectures and Systems”,
Pearson, 2013.
 ADVANCED DATABASE ADMINISTRATION

Paper Code: ETIT-427 L T/P C

Paper: Advanced Database Administration 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the advancements in the Database
Administration that are required for the student to become a DBA.

UNIT-I
Creating a Database – Database configuring Assistant (DBCA), Password management, Using DBCA to
delete a database.
Managing the database instance – Management framework, starting and stopping database control, Initialising
parameter files, starting up and shutting down database instance.
Managing Database storage structure – Storage structure, How table data is stored?, Tablespaces and data
files, Space Management in Tablespaces, Tablespace management.
[T1][T2][No. of Hrs. 11]
UNIT-II
Database user security – Creating a user, Authenticating users, Unlocking a user account and resetting the
password, Privileges and role, System privileges, object privileges.
Managing Schema Objects – Table types, Action with tables, creating views, sequences, What is partition and
why use it? Creating a Partition, Partitioning method, Index organised tables and heap tables, creating index-
organised tables, cluster, cluster types, sorted hash cluster.
Managing data and concurrency – Manipulating with data through SQL, function procedure, packages,
Triggers, locking concepts, detecting and resolving lock conflicts.
[T1][T2][No. of Hrs. 11]
UNIT-III
Managing undo Data – Monitoring Undo, Administering Undo, Configuring Undo Retention, Sizing
Undo tablespace.
Implementing database security – database transparent encryption (TDE), TDE Process, Implementing TDE.
Performance management - troubleshooting, tuning.
[T1][T2][No. of Hrs. 10]
UNIT-IV
Performing Backup and Recovery – Configuring Recovery Manager, using Recoverymanager, Recovering
from noncritical Losses , recovery from loss of control file , data file andredo file.
Performing flashback – Flashback database , Flashback database Architecture, Configuringflashback Database
using enterprise manager, Monitoring Flashback database
Moving data- General Architecture , Loading data with SQL *loader , Data pump , Data pumpexport and
import.
[T1][T2][No. of Hrs. 11]
Text Books:
[T1] Sam R. Alapati “ Expert Oracle Database 11G Administration “ Dreamtech Press.
[T2] Darl Kuhn “Pro Oracle Database 11g Administration”, Apress

References Books:
[R1] Ken Simmons, Sylvester, Carstarphen” Pro SQL Server 2012 Administration”, Dreamtech Press
[R2] Sheeri K Cabral, Keith Murphy,” MySQL Administrator's Bible” John Wiley & Sons
[R3] Steve Fogel, Paul Lane, “Oracle Database Administrator’s Guide, 10g” Oracle
[R4] Craig S. Mullins, “Database Administration”, Addison-Wesley
 PROBABILISTIC GRAPHICAL MODELS

Paper Code: ETIT-429 L T/P C

Paper: Probabilistic Graphical Models 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student probabilistic graphical models, parameter
learning, convexity and Bayesian networks.

UNIT-I
Bayesian network, Examples (HMM, diagnostic system, etc.), Separation and independence, Markov properties
and minimalism, Markov network, Examples (Boltzmann machine, Markov random field, etc.), Cliques and
potentials, Markov properties
[T1, T2, R1][No. of Hrs. 11]
UNIT-II
Exact inference, Complexity, Bucket elimination, Junction tree, Belief propagation (message passing),
Application to HMM, Sum- and Max-product algorithms.
[T1, R1][No. of Hrs. 11]
UNIT-III
Parameter learning, Exponential family, Bayesian learning, Expectation-Maximization (EM)
[T1, T2][No. of Hrs. 10]
UNIT-IV
Approximate inference, Convexity, Mean field approach, Structured variational method, Loopy belief
propagation, Characterization of solution spaces, Sampling methods.
[T1, T2, R2][No. of Hrs. 10]
Text Books:
[T1] Bayesian Networks and Beyond by Daphne Koller and Nir Friedman
[T2] An Introduction to Probabilistic Graphical Models by Michael I. Jordan

Reference Books:
[R1] Probabilistic Networks and Expert Systems by Cowell, Dawid, Lauritzen, and Spiegelhalter, Springer
1999.
[R2] Learning in Graphical Models by M. Jordan (editor), MIT Press, 1999.
 SOCIOLOGY AND ELEMENTS OF INDIAN HISTORY FOR ENGINEERS

Paper Code: ETHS-419 L T/P C

Paper: Sociology and Elements of Indian History for Engineers 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The objective of this course is to familiarize the prospective engineers with elements of Indian history
and sociological concepts and theories by which they could understand contemporary issues and problems in
Indian society. The course would enable them to analyze critically the social processes of globalization,
modernization and social change. All of this is a part of the quest to help the students imbibe such skills that will
enhance them to be better citizens and human beings at their work place or in the family or in other social
institutions.

UNIT I
Module 1A: Introduction to Elements of Indian History: What is History? History Sources-Archaeology,
Numismatics, Epigraphy & Archival research; Methods used in History; History & historiography.
[3 Lectures]
Module 1B: Introduction to sociological concepts-structure, system, organization, social institution, Culture
social stratification (caste, class, gender, power). State & civil society.
[7 Lectures]
[T1][No. of Hrs. 10]
UNIT II
Module 2A: Indian history & periodization; evolution of urbanization process: first, second & third phase of
urbanization; Evolution of polity; early states of empires; Understanding social structures-feudalism debate.
[3 Lectures]
Module 2B: Understanding social structure and social processes: Perspectives of Marx, Weber & Durkheim.
[7 Lectures]
[T1][No. of Hrs. 10]
UNIT III
Module 3A: From Feudalism to colonialism-the coming of British; Modernity & struggle for independence.
[3 Lectures]
Module 3B: Understanding social structure and social processes: Perspectives of Marx, Weber & Durkheim.
[9 Lectures]
[T1][No. of Hrs. 12]
UNIT IV
Module 4A: Issues & concerns in post-colonial India (upto 1991); Issues & concerns in post-colonial India 2nd
phase (LPG decade post 1991).
[3 Lectures]
Module 4B: Social change in contemporary India: Modernization and globalization, Secularism and
communalism, Nature of development, Processes of social exclusion and inclusion, Changing nature of work
and organization.
[10 Lectures]
[T1][No. of Hrs. 13]
Text Books:
[T1] Desai, A.R. (2005), Social Background of Indian Nationalism, Popular Prakashan.
[T2] Giddens, A (2009), Sociology, Polity, 6th Edition

Reference Books:
[R1] Guha, Ramachandra (2007), India After Gandhi, Pan Macmillan
[R2] Haralambos M, RM Heald, M Holborn, (2000), Sociology, Collins
 WIRELESS AD HOC AND SENSOR NETWORK LAB

Paper Code: ETIE-451 L T/P C

Paper: WIRELESS AD HOC AND SENSOR NETWORK LAB 0 4 2

1. Introduction of Wireless sensor network applications and its simulation.

2. Network Simulator installation of wireless sensor network.
3 Write TCL script for transmission between mobile nodes.
4 Write TCL script for sensor nodes with different parameters.
5 Generate tcl script for udp and CBR traffic in WSN nodes.
6 Generate tcl script for TCP and CBR traffic in WSN nodes.
7 Implementation of routing protocol in NS2 for AODV protocol.
8 Implementation of routing protocol in NS2 for DSR protocol.
9 Implementation of routing protocol in NS2 for TORA protocol.
10 Study other wireless sensor network simulators

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 BLOCKCHAIN LAB

Paper Code: ETCT 451 L T/P C

Paper: Blockchain Lab 0 2 1

List of experiments

1. Install and understand Docker container, Node.js, Java and Hyperledger Fabric, Ethereum and
perform necessary software installation on local machine/create instance on Cloud to run.
2. Create and deploy a block chain network using Hyperledger Fabric SDK for Java Set up and
initialize the channel, install and instantiate chain code, and perform invoke and query on your
block chain network
3. Interact with a block chain network. Execute transactions and requests against a block chain
network by creating an app to test the network and its rules
4. Deploy an asset-transfer app using block chain. Learn app development within a Hyperledger
Fabric network
5. Use block chain to track fitness club rewards Build a web app that uses Hyperledger Fabric to
track and trace member rewards
6. Car auction network: A Hello World example with Hyperledger Fabric Node SDK and IBM Block
chain Starter Plan. Use Hyperledger Fabric to invoke chain code while storing results and data in
the starter plan
7. Develop an IoT asset tracking app using Block chain. Use an IoT asset tracking device to improve
a supply chain by using Block chain, IoT devices, and Node-RED
8. Secure art using block chain digital certificates. Node.js-based auction application can help
democratize the art market
9. Block chain for telecom roaming, fraud, and overage management. See how communication
service providers use block chain to enhance their value chains.
10. Use IoT dashboards to analyze data sent from a Block chain network. Build an IoT app and IoT
dashboards with Watson IoT Platform and Node-RED to analyze IoT data sent from a Block chain
network
11. Create an Android app with Block chain integration. Build a Block chain enabled health and
fitness app with Android and Kubernetes
12. Create a global finance block chain application with IBM Block chain Platform Extension for VS
Code. Develop a Node.js smart contract and web app for a Global Finance with block chain use
case
13. Develop a voting application using Hyperledger and Ethereum. Build a decentralized app that
combines Ethereum's Web3 and Solidity smart contracts with Hyperledger's hosting Fabric and
Chain code EVM
14. Create a block chain app for loyalty points with Hyperledger Fabric Ethereum Virtual Machine.
Deploy Fabric locally with EVM and create a proxy for interacting with a smart contract through
a Node.js web app

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 CRYPTOGRAPHY AND NETWORK SECURITY LAB

Paper Code: ETIE-453 L T/P C

Paper: CRYPTOGRAPHY AND NETWORK SECURITY LAB 0 2 1

1. Implementation of Ceaser Cipher Encryption/Decryption

2. Implementation of Monoalphabetic Encryption/Decryption
3. Implementation of Polyalphabetic Cipher
4. Implementation of Playfair Cipher
5. Implementation of Hill Cipher
6. Implementation of Diffie Hellman Key Exchange
7. Implementation of RSA Encryption-Decryption
8. Implementation of Triple-DES Encryption-Decryption
9. Implementation of Digital Signature
10. Implementation of Authentication in Kerbos

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 EMBEDDED SYSTEMS LAB

Paper Code: ETIT-459(ELECTIVE) L T/P C

Paper: Embedded Systems Lab 0 2 1

List of Experiments:

1. Introduction to microcontroller and interfacing modules.

2. To interface the seven segment display with microcontroller 8051
3. To create a series of moving lights using PIC on LEDs.
4. To interface the stepper motor with microcontroller.
5. To display character ‘A’ on 8*8 LED Matrix.
6. Write an ALP to add 16 bits using ARM 7 Processor
7. Write an ALP for multiplying two 32 bit numbers using ARM Processor
8. Write an ALP to multiply two matrices using ARM processor

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 DIGITAL SIGNAL PROCESSING LAB

Paper Code: ETIT-459 (ELECTIVE) L T/P C

Paper: Digital Signal Processing Lab 0 2 1

List of Experiments:

Software Experiments:
1. Generation of basic signals sine, cosine, ramp, step, impulse and exponential in continuous and
discrete domains using user defined functions.
2. Write a MATLAB program to find convolution (linear/circular) and correlation of two discrete
signals.
3. Perform linear convolution using circular convolution and vice versa.
4. Write a MATLAB program to
i. Find 8 point DFT, its magnitude and phase plot and inverse DFT.
ii. Find 16 point DFT, its magnitude and phase plot and inverse DFT.
5. Perform the following properties of DFT-
i. Circular shift of a sequence.
ii. Circular fold of a sequence.
6. Write a MATLAB Program to design FIR Low pass filter using
i. Rectangular window
ii. Hanning window
iii. Hamming window
iv. Bartlett window
7. Write a MATLAB program to
i. Implement a Low pass / High pass / Band pass / Band stop IIR Filter using
Butterworth Approximation.
ii. Implement a Low pass / High pass / Band pass / Band stop IIR Filter using
Chebyshev Approximation.
Hardware Experiments using Texas Instruments Kits-DSK 6713:
8. Introduction to Code composer Studio.
9. Write a program to generate a sine wave and see the output on CRO
10. Write a Program to Generate ECHO to give audio file.
11. Write a program to demonstrate Band Stop filter by FIR.
Additional Experiments:
12. Write a program to generate a cos wave and see the output on CRO
13. Write a program to blink the LED
14. Write a program to display a string on LCD.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 MOBILE COMPUTING

Paper Code: ETIT-402 L T/P C

Paper: Mobile Computing 3 1 4

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objectives: Should have studied papers such as Communication systems, Data communications and networking
and wireless networks. To learn the basic concepts, aware of the GSM, SMS, GPRS Architecture. To have an
exposure about wireless protocols –Wireless LAN, Bluetooth, WAP, Zig Bee issues. To Know the Network,
Transport Functionalities of Mobile communication. To understand the concepts of Adhoc and wireless sensor
networks. Introduce Mobile Application Development environment.

UNIT-I
Mobile Physical Layer: Review of generation of mobile services, overview of wireless telephony, cellular
concept, GSM: air-interface, channel structure, location management: HLR-VLR, hierarchical, handoffs,
channel allocation in cellular systems, CDMA, GPRS.
Mobile Computing Architecture: Issues in mobile computing, three tier architecture for mobile computing,
design considerations, Mobile file systems, Mobile databases. WAP: Architecture, protocol stack, Data gram
protocol, Wireless transport layer security, Wireless transaction protocol, wireless session protocol, application
environment, and applications.
[T1] [T2][T3] [No. of Hrs. 12]
UNIT-II
Mobile Data Link Layer: Wireless LAN over view, IEEE 802.11, Motivation for a specialized MAC, Near &
far terminals, Multiple access techniques for wireless LANs such as collision avoidance, polling, Inhibit sense,
spread spectrum, CDMA , LAN system architecture, protocol architecture, physical layer MAC layer and
management, Hiper LAN.
Blue Tooth: IEEE 802.15 Blue tooth User scenarios, physical, MAC layer and link management.
Local Area Wireless systems: WPABX, IrDA, ZigBee, RFID, WiMax.
[T1] [T2][T3] [No. of Hrs. 11]
UNIT-III
MOBILE IP Network Layer: IP and Mobile IP Network Layer- Packet delivery and Handover Management-
Location Management- Registration- Tunnelling and Encapsulation-Route Optimization- Dynamic Host
Configuration Protocol, Ad Hoc networks, localization, MAC issues, Routing protocols, global state routing
(GSR), Destination sequenced distance vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc on
demand distance vector routing (AODV), VoIP –IPSec.
Mobile Transport Layer: Traditional TCP/IP, Transport Layer Protocols-Indirect, Snooping, Mobile TCP.
[T1] [T2][T3] [No. of Hrs. 11]
UNIT-IV
Support for Mobility: Data bases, data hoarding, Data dissemination, UA Prof and Caching, Service
discovery, Data management issues, data replication for mobile computers, adaptive clustering for mobile
wireless networks, Mobile devices and File systems, Data Synchronization, Sync ML.
Introduction to Wireless Devices and Operating systems: Palm OS, Windows CE, Symbion OS, Android,
Mobile Agents. Introduction to Mobile application languages and tool kits.
[T1] [T2][T3] [No. of Hrs. 11]
Course Outcomes:
1. Gain the knowledge about various types of Wireless Data Networks and Wireless Voice Networks. 2.
Understand the architectures, the challenges and the Solutions of Wireless Communication.
3. Realize the role of Wireless Protocols in shaping the future Internet.
4. Able to develop simple Mobile Applications Using Toll kit.
Text Books:
[T1] J. Schiller, “Mobile Communications”, 2nd edition, Pearson, 2011.
[T2] Raj Kamal “Mobile Computing” Oxford Higher Education, Second Edition, 2012.
[T3] Dharam prakash Agrawal and Qing-An Zeng, “Introduction to Wireless and Mobile Systems” 3 rd
edition, Cengage learning 2013.
Reference Books:
[R1] Asoke K Talukder, Hasan Ahmed,Roopa R Yavagal “Mobile Computing”, Tata McGraw Hill
Pub ,Aug – 2010
[R2] Pei Zheng, Larry L. Peterson, Bruce S. Davie, Adrian Farrell “Wireless Networking Complete”
Morgan Kaufmann Series in Networking , 2009 ( introduction, WLAN MAC)
[R3] Vijay K Garg “Wireless Communications & Networking” Morgan Kaufmann Series, 2010
[R4] M. V. D. Heijden, M. Taylor, Understanding WAP, Artech House.
[R5] Charles Perkins, Mobile IP, Addison Wesley.
[R6] Charles Perkins, Ad hoc Networks, Addison Wesley.
[R7] Uwe Hansmann, Lothar Merk, Martin S. Nicklous, Thomas Stober, “Principles of Mobile Computing”,
Springer.
[R8] Evaggelia Pitoura and George Samarus, “Data Management for Mobile Computing”, Kluwer
Academic Press, 1998

Laboratory session: The student is advised to learn any of the following languages and use any one tool kit for
generating mobile applications, such as game, Clock, calendar, Convertor, phone book, Text Editor etc.,
Language support: XHTML-MP, WML, WML Script.
Mobile application languages- XML, Voice XML, Java, J2ME, Java Card
TooL Kits: WAP Developer tool kit and application environment, Android Mobile Applications Development
Tool kit.

[R1] Donn Felker , “Android Application Development For Dummies”, Wiley, 2010
[R2] Reto Meier, “ Professional Android 2 Application Development”, Wrox’s Prog. to Programmer Series.
[R3] Ed Burnette, ’Hello, Android: Introducing Google’s Mobile Development Platform’ third edition’
Pragmatic Programmers,2012
[R4] Jerome(J.F) DiMarzio “Android A programmer’s Guide” Tata McGraw-Hill 2010 Edition.
[R5] Reza B’Far, “Mobile computing principles: Designing and Developing Mobile Applications with UML
and XML”, Cambridge University press, 2005.
[R6] R.Riggs, A. Taivalsaari, M.VandenBrink, “Programming Wireless Devices with Java2 Platform, Micro
Edition”, ISBN: 0-201-74627-1, Addision Wesley,, 2001.
 MACHINE LEARNING

Paper Code: ETCS-402 L T/P C

Paper: Machine Learning 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To introduce the students about the knowledge of basic concepts of machine learning systems, types
of learning etc.

UNIT-I
Introduction:
Basic concepts: Definition of learning systems, Goals and applications of machine learning. Aspects of
developing a learning system: training data, concept representation, function approximation.
Types of Learning: Supervised learning and unsupervised learning. Overview of classification: setup, training,
test, validation dataset, over fitting.
Classification Families: linear discriminative, non-linear discriminative, decision trees, probabilistic
(conditional and generative), nearest neighbor.
[T1, T2][No. of Hrs: 12]
UNIT-II
Logistic regression, Perceptron, Exponential family, Generative learning algorithms, Gaussian discriminant
analysis, Naive Bayes, Support vector machines: Optimal hyper plane, Kernels. Model selection and feature
selection. Combining classifiers: Bagging, boosting (The Ada boost algorithm), Evaluating and debugging
learning algorithms, Classification errors.
[T1, T2][No. of Hrs: 11]
UNIT-III
Unsupervised learning: Clustering. K-means. EM Algorithm. Mixture of Gaussians.
Factor analysis.PCA (Principal components analysis), ICA (Independent components analysis), latent semantic
indexing. Spectral clustering, Markov models Hidden Markov models (HMMs).
[T1, T2][No. of Hrs: 11]
UNIT-IV
Reinforcement Learning and Control:MDPs. Bellman equations, Value iteration and policy iteration, Linear
quadratic regulation (LQR). LQG.Q-learning.Value function approximation, Policy search. Reinforce.
POMDPs.
[T1, T2][No. of Hrs: 10]
Text Books:
[T1] Tom M Mitchell, Machine Learning, McGraw Hill Education
[T2] Bishop, C. (2006). Pattern Recognition and Machine Learning. Berlin: Springer-Verlag.
[T3] Duda, Richard, Peter Hart, and David Stork.Pattern Classification. 2nd ed. New York, NY: Wiley-
Interscience, 2000. ISBN: 9780471056690.
[T4] Tom M. Mitchell, Machine Learning .ISBN – 9781259096952, McGraw-Hill Series, Edition – First

Reference Books:
[R1] Bishop, Christopher. Neural Networks for Pattern Recognition. New York, NY: Oxford University
Press, 1995. ISBN: 9780198538646.
[R2] Introduction to MachineLearning - Ethem Alpaydin, MIT Press, Prentice hall of India.
 HUMAN VALUES & PROFESSIONAL ETHICS – II

Paper Code: ETHS-402 L T/P C

Paper : Human Values & Professional Ethics-II 1 0 1

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.
3. Two internal sessional test of 10 marks each and one project report* carrying 5 marks.

Objectives:
1. The main object of this paper is to inculcate the skills of ethical decision making and then to apply these
skills to the real and current challenges of the engineering profession.
2. To enable student to understand the need and importance of value-education and education for Human
Rights.
3. To acquaint students to the National and International values for Global development

UNIT I - Appraisal of Human Values and Professional Ethics:

Review of Universal Human Values: Truth, Love, Peace, Right conduct, Non violence, Justice and
Responsibility. Living in harmony with ‘SELF’, Family, Society and Nature. Indian pluralism - the way of life
of Islam, Buddhism, Christianity, Jainism, Sikhism and Hinduism, Greek - Roman and Chinese cultural values.
Sensitization of Impact of Modern Education and Media on Values:
a) Impact of Science and Technology
b) Effects of Printed Media and Television on Values
c) Effects of computer aided media on Values (Internet, e-mail, Chat etc.)
d) Role of teacher in the preservation of tradition and culture.
e) Role of family, tradition & community prayers in value development.
Review of Professional Ethics: Accountability, Collegiality, Royalty, Responsibilityand Ethics Living.
Engineer as a role model for civil society, Living in harmony with ‘NATURE’, Four orders of living, their inter-
correctness, Holistic technology (eco-friendly and sustainable technology).
[T1][T2][R1][R5][R4][No. of Hrs. 03]
UNIT II – Engineers responsibility for safety:
Safety and Risks, Risk and Cost, Risk benefit analysis, testing methods for safety. Engineer’s Responsibility for
Safety Social and Value dimensions of Technology - Technology Pessimism – The Perils of Technological
Optimism – The
Promise of Technology – Computer Technology Privacy
Some Case Studies: Case Studies, BHOPAL Gas Tragedy, Nuclear Power Plant Disasters, Space Shuttle
Challenger , Three Mile Island Accident, etc.
[T1] [T2] [R4] [R2][No. of Hrs. 03]
UNIT III – Global Issues:
Globalization and MNCs: International Trade, Issues,
Case Studies: Kelleg’s, Satyam, Infosys Foundation, TATA Group of Companies
Business Ethics: Corporate Governance, Finance and Accounting, IPR.
Corporate Social Responsibility (CSR): Definition, Concept, ISO, CSR.
Environmental Ethics: Sustainable Development, Eco-System, Ozone depletion, Pollution.
Computer Ethics: Cyber Crimes, Data Stealing, Hacking, Embezzlement.
[T1] [T2] [R4][No. of Hrs. 05]
UNIT IV - Engineers Responsibilities and Rights and Ethical Codes:
Collegiality and loyalty, Conflict of interests, confidentiality, occupational crimes, professional rights,
responsibilities. To boost industrial production with excellent quality and efficiency, To enhance national
economy, To boost team spirit, Work Culture and feeling of job satisfaction, National integration, Examples of
some illustrious professionals.
Need for Ethical Codes, Study of some sample codes such as institution of Electrical and Electronics Engineers,
Computer Society of India etc., Ethical Audit.
Development and implementation of Codes: Oath to be taken by Engineering graduates and its importance**,
[T1] [T2] [R4][R2][No. of Hrs. 05]
Text Books:
[T1] Professional Ethics, R. Subramanian, Oxford University Press.
[T2] Professional Ethics & Human Values: Prof. D.R. Kiran, TATA Mc Graw Hill Education.

References Books:
[R1] Human Values and Professional Ethics: R. R. Gaur, R. Sangal and G. P. Bagaria, Eecel Books(2010,
New Delhi). Also, the Teachers‟ Manual by the same author
[R2] Fundamentals of Ethics, Edmond G. Seebauer & Robert L. Barry, Oxford University Press
[R3] Values Education: The paradigm shift, by Sri Satya Sai International Center for Human Values, New
Delhi.
[R4] Professional Ethics and Human Values – M.Govindrajan, S.Natarajan and V.S. Senthil Kumar, PHI
Learning Pvt. Ltd. Delhi
[R5] A Textbook on Professional Ethics and Human Values – R.S. Naagarazan – New Age International (P)
Limited, Publishers New Delhi.
[R6] Human Values & Professional Ethics- S B Gogate- Vikas publishing house PVT LTD New Delhi.
[R7] Mike Martin and Roland Schinzinger, “Ethics in Engineering” McGraw Hill
[R8] Charles E Harris, Micheal J Rabins, “Engineering Ethics, Cengage Learning
[R9] PSR Murthy, “Indian Culture Values and Professional Ethics”, BS Publications
[R10] Caroline Whitback< Ethics in Engineering Practice and Research, Cambridgs University Press
[R11] Charles D Fleddermann, “Engineering Ethics”, Prentice Hall.
[R12] George Reynolds, “Ethics in Information Technology”, Cengage Learning
[R13] C, Sheshadri; The Source book of Value Education, NCERT
[R14] M. Shery; Bhartiya Sanskriti, Agra (Dayalbagh)

*Any topic related to the experience of the B.Tech student in the assimilation and implementation of human
values and professional ethics during the past three years of his/her studies in the institute OR A rigorous ethical
analysis of a recent case of violation of professional ethics particularly related to engineering profession.

**All students are required to take OATH in writing prior to submission of major project and the record of the
same is to be maintained at the college level and/or, this oath may be administered by the head of the institutions
during the graduation ceremonies. The draft for the same is available alongwith the scheme and syllabus.
 BIG DATA ANALYTICS

Paper Code: ETIT-406 L T/P C

Paper: Big Data Analytics 3 0 3
INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75
1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To introduce the students about knowledge of Data Management, Big Data stacks and Data analysis.

UNIT-I
Big Data Introduction:The Evolution of Data Management, Defining Big Data, Traditional and advanced
analytics. Distributed Computing, need of distributed computing for big data, economics of computing, latency
problem.
Examining Big Data Types, Structured Data, sources of big structured data, role of relational databases in big
data, Unstructured Data, sources of unstructured data, role of a CMS in big data management.
[T1][R1][No. of Hrs. 11]
UNIT-II
Big Data Stack: Redundant Physical Infrastructure, Security Infrastructure, Operational Databases.
Organizing Data Services and Tools, Analytical Data Warehouses, Big Data Analytics, Big Data Applications.
Virtualization and big data: Server virtualization, Application virtualization, Network virtualization,
Processor and memory virtualization, Data and storage virtualization, Managing Virtualization with the
Hypervisor.
[T1][No. of Hrs. 10]
UNIT-III
MapReduce Fundamentals, Putting map and reduce Together, Optimizing MapReduce Tasks.
Hadoop, Hadoop Distributed File System (HDFS), Name Nodes, Data nodes, Hadoop MapReduce.
[T1][T2][R1][No. of Hrs. 11]
UNIT-IV
Big Data Analytics: Basic analytics, Advanced analytics, Operationalized analytics, Monetizing analytics, Text
Analytics and Big Data, Social media analytics, Text Analytics Tools for Big Data, Attensity, Clarabridge,
OpenText.
Integrating Data Sources: Dealing with Real-time Data Streams and Complex Event Processing,
Operationalizing Big Data, Applying Big Data within Your Organization, Security and Governance for Big Data
Environments.
[T1][No. of Hrs. 11]
Text Books:
[T1] Judith S. Hurwitz, Alan F. Nugent, Fern Halper, Marcia A. Kaufman,“Big Data For Dummies”, John
Wiley & Sons, Inc.(2013)
[T2] Robert D. Schneider, “Hadoop For Dummies”,John Wiley & Sons, Inc.(2012)

Reference Books:
[R1] Understanding Big Data: Analytics for Enterprise Class Hadoop and Streaming Data, by Paul
Zikopoulos,McGraw Hill 2012.
 SOCIAL NETWORK ANALYSIS

Paper Code: ETIT-408 L T/P C

Paper: Social Network Analysis 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To introduce the students about knowledge of social network analysis and framework for network
analysis.

UNIT-I
Social network analysis: network definition, manipulation, calculation, visualization. Graph terminology and
definitions. Representing networks: Adjacency matrix and properties.Weighted, directed, bipartite
networks.Trees. Some sample networks.
[T1, R1][No. of Hrs. 10]
UNIT-II
Linear Algebra / Graph Properties: Eigenvectors and eigenvalues. Graph Laplacian. Markov matrices.Paths,
walks, cycles.Degree, density.Degree distribution.Diameter, average path length.Average and local clustering.
Centrality measures:degree, betweenness, closeness, Katz, Bonacich.
Review of Poisson random graphs. Growing random networks.Preferential attachment. Properties andphase
transitions. Degree distributions.Fitting networks to data.Exponential random graph models.
[T1][No. of Hrs. 11]
UNIT-III
Frameworks for evaluating results in network analysis: autocorrelation, matching techniques, QAPregression,
exponential random graphs, and other models. Computational considerations. Lab: ApplyingERGM analysis.
Graph partitioning. Spectral partitioning.Modularity and modularity maximization.Betweennessclustering. Lab:
Calculating and comparing clustering approaches.
[T1][No. of Hrs. 11]
UNIT-IV
Game theory basics: players, moves, payoffs. Nash equilibrium.Efficiency and optimality.Examples.Network
formation as a game.Pairwise stability.Positive and negative externalities.
Processes on Networks: Diffusion on networks. SIS and SIR infection models and predictions. Search on
networks. Networkedadoption games.
[T1][No. of Hrs. 10]
Text Books:
[T1] Jackson, M. O. Social and Economic Networks.Princeton U. Press, 2008. ISBN: 978-0-691-14820-5.

Reference Books:
[R1] Social Network Analysis (Google eBook), John Scott, SAGE, 2012
 SOFT COMPUTING

Paper Code: ETIT-410 L T/P C

Paper: Soft Computing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To understand the various concepts of neural networks and fuzzy logic.

UNIT-I
Neural Networks:
History, overview of biological Neuro-system, Mathematical Models of Neurons, ANN architecture, Learning
rules, Learning Paradigms-Supervised, unsupervised and reinforcement Learning, ANN training Algorithms-
perceptions, Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model, Hopfield
Networks, Associative Memories, Applications of Artificial Neural Networks.
[T1, T2][No. of Hrs. 11]
UNIT-II
Fuzzy Logic:
Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets, Membership Function,
Fuzzy rule generation. Operations on Fuzzy Sets: Compliment, Intersections, Unions, Combinations of
Operations, Aggregation, Operations.
[T1, T2][No. of Hrs. 11]
UNIT-III
Fuzzy Arithmetic:
Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of Fuzzy
Numbers, Fuzzy Equations. Fuzzy Logic:
Classical Logic, Multivalued Logics, Fuzzy Propositions, Fuzzy Qualifiers,
Uncertainty based Information:
Information & Uncertainty, Nonspecificity of Fuzzy & Crisp Sets, Fuzziness of Fuzzy Sets.
[T1, T2][No. of Hrs. 11]
UNIT-IV
Introduction of Neuro-Fuzzy Systems:
Architecture of Neuro Fuzzy Networks.
Application of Fuzzy Logic:
Medicine, Economics etc.
Genetic Algorithm:
An Overview, GA in problem solving, Implementation of GA.
[T1, T2][No of Hrs 11]
Text Books:
[T1] Hertz J. Krogh, R.G. Palmer, “Introduction to the Theory of Neural Computation”, Addison-Wesley,
California, 1991.
[T2] G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI, 1995.
[T3] Melanie Mitchell, “An Introduction to Genetic Algorithm”, PHI, 1998.
[T4] F. O. Karray and C. de Silva, “Soft computing and Intelligent System Design”, Pearson, 2009.

Reference Books:
[R1] “Neural Networks-A Comprehensive Foundations”, Prentice-Hall International, New Jersey, 1999.
[R2] Freeman J.A. & D.M. Skapura, “Neural Networks: Algorithms, Applications and Programming
Techniques”, Addison Wesley, Reading, Mass, (1992).
 BIOINFORMATICS

Paper Code:ETIT-412 L T/P C

Paper: Bio Informatics 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The objective of the paper is to facilitate the student with the basics of Bioinformatics using Machine
Learning.

UNIT- I
Introduction: Biological data in digital symbol sequences, genomes, proteins and proteomes, biological
sequences, molecular function and structure. Biological Databases: Sequence databases, mapping databases,
information retrieval, genomic databases.
Machine Learning Foundations: The probabilistic framework and examples.
[T1], [T2][No. of hrs. 10]
UNIT- II
Machine Learning Algorithms: Introduction, dynamic programming, gradient descent, EM/GEM algorithms,
Markov-Chain Monte Carlo methods, simulated annealing, evolutionary and genetic algorithms, learning
algorithms.
Neural Network: Theory and Applications. Hidden Markov Models: Theory and applications
[T1][No. of hrs. 12]
UNIT- III
Probabilistic graphical models in bioinformatics: Markov Models and DNA symmetries, gene finders, hybrid
models and neural network parameterization of graphical models, single model case, bidirectional recurrent
neural networks for protein secondary structure prediction.
Probabilistic models of evolution: phylogenetic trees.
[T1] [No. of hrs. 11]
UNIT-IV
Stochastic grammars and linguistics: Introduction, formal grammars, Chomsky hierarchy, applications of
grammars, learning algorithms, applications of SCFGs. Microarrays and gene expression: Introduction,
Probabilistic modelling of array data, clustering, gene regulation.
[T1][No. of hrs. 10]
Text Books:
[T1] P.Baldi , S.Brunak ,”Bioinformatics : The machine learning approach” 2 nd Edition, MIT Press.
[T2] A.D.Baxevanis, B.F.F.Quellette “Bioinformatics: A Practical guide to the analysis of genes and
proteins” 3rd Edition, Wiley-Interscience.

References Books:
[R1] TK Attwood & DJ Parry-Smith,” Introduction to Bioinformatics”, Pearson Education
[R2] Edward Keedwell and Ajit Narayanan, “Intelligent Bioinformatics” John Wiley & Sons, Ltd.
[R3] A Tramontano, “Introduction to Bioinformatics”, Chapman & Hall/CRC.
[R4] D.Roy, “Bioinformatics” , Narosa Publishing House
[R5] David Mount, “Bioinformatics: sequence and genome analysis”, Cold spring harbour Lab
 WEB APPLIACTION DEVELPOMENTUSING .NET

Paper Code: ETIT-414 L T/P C

Paper: Web Application Development Using .NET 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

Objective: This course teaches how to develop business applications using .NET 3.5. It starts with C# and
VB.NET languages and then moves on to developing web applications using ASP.NET. It teaches LINQ and
AJAX, new extensions to ASP.NET 3.5

UNIT I
Introduction to .NET 3.5: Introduction to .NET Framework, Components of .NET - CLR and Class Library,
MSIL, CTS etc.
Introduction to C# 3.0: Language elements of C#, OOP with C#, Properties and static members, Inheritance,
overriding and shadowing, Runtime polymorphism - virtual and abstract methods, Boxing, unboxing, Interfaces
and structures, Exception Handling. Introduction to VB.NET 9.0: structure of VB.NET, Control structures, OOP
with VB.NET, Properties, Default properties, Inheritance, overriding and shadowing, Interfaces, structures and
Exception handling.
[T1, T2][No. of Hrs. 12]
UNIT II
Fundamentals of ASP.NET: server-side scripting, create simple ASP.NET, Server-side event processing,
Validation Controls, Working with Rich Controls and Navigation related controls, Master pages and themes,
Cookies and their application, Sessions and Applications, Working with GLOBAL.ASAX, Error handling,
Debugging and tracing, Page output caching, Data caching.
MS SQL Server: Architecture of SQL Server, Using Query Analyzer, Working with Transact SQL, stored
procedures and functions, creating database triggers.
ADO.NET: Introduction, SQLConnect, SQLCommand, SQLDataReader object to access SQL Server, connect
to MsAccess, and Oracle, DataSet, DataTable etc, Retrieving and manipulating data using GridView,
DetailsView, ListView, FormView and DataList, Calling stored procedures of SQL Server.
[T1, T2][No. of Hrs. 12]
UNIT III
XML: introduction, well-formed XML and valid XML, DOM and SAX, XMLReader and writer, Validating
XML with Schema and DTD, Loading data from XML to Database, Writing data from Database to XML,
Transforming XML content using XSLT.
Web Services: introduction, role in web applications, Component and protocols - SOAP, WSDL, Proxy class,
create webservice, Web services accessing database.
Advanced Programming: Operator overloading, Conversion operators, Delegates, Multithreading, Event
Handling, Generics, Iterators, Auto properties, Lambda Expressions.
[T1, T2][No. of Hrs. 11]
UNIT IV
LINQ: Language Integrated Query: LINQ to Objects, LINQ to SQL, Object-Relational Mapping, LINQ to
XML.
AJAX: What is AJAX , related technologies,Using ASP.NET AJAX – ScriptManager, UpdatePanel, Timer,
UpdateProgress etc., Using ASP.NET AJAX Control Toolkit – AlwaysVisibleControl, AutoComplete,
ConfirmButton, FilteredTextBox etc., Calling Web Services using AJAX.
[T1, T2][No. of Hrs. 10]
Text Books:
[T1] Stephen Walther,” ASP.NET 3.5 Unleashed or ASP.NET 4.5 Unleashed,” Sams Pearsons Publication,
[T2] George Shepherd, "Microsoft ASP.NET 3.5 Step by Step", PHI learning Publication Eastern Economy
Edition
[T3] Chris Love, Marco Bellinaso,”ASP.NET 3.5 Website Programming Problem - Design – Solution,”
Wrox publication 2012
Reference Books:
[R1] George Shepherd, "Microsoft ASP.NET 4.0 Step by Step", PHI learning Publication Eastern Economy
Edition
[R2] Imar Spaanjaars," Beginning ASP.NET 3.5 In C# and VB," Wiley / Wrox publication, 2009
[R3] Bill Evjen, Scott Hanselman, Devin Rader,"Professional ASP.NET 3.5 in C# and VB," wiley
publication,2008
[R4] Matthew MacDonald, “The Complete Reference: ASP.NET”, Tata McGraw Hill, 2002.
[R5] Jason N. Gaylord at al,"Professional ASP.NET 4.5 in C# and VB," wrox publication,2013
 VLSI DESIGN

Paper Code: ETIC-414 L T/P C

Paper: VLSI Design 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Q. No. 1 rest of the paper shall consist of four units as per the syllabus. Every unit should have
two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objective: The prerequisite are analog devices, STLD, Digital system design and micro-electronics. The
students are introducing to MOS technology, design rules and some applications.

UNIT I
Evolution of VLSI, MOS transistor theory, MOS structure, enhancement & depletion transistor, threshold
voltage, MOS device design equations, MOSFET scaling and small geometry effects, MOSFET capacitances.
NMOS inverter, CMOS inverter, DC characteristics, static load MOS inverter, pull up/pull down ratio, static &
dynamic power dissipation, CMOS & NMOS process technology – explanation of different stages in
fabrication, body effect, latch up in CMOS.
[T1,T2][No. of Hours: 11]
UNIT II
Stick diagram and design rules, lambda based design rules, switching characteristics & inter connection effects:
rise time, fall time delays, noise margin.
CMOS logic gate design: NAND, NOR, XOR and XNOR gates, Transistor sizing, combinational MOS logic
circuits: pass transistor and transmission gate designs, Pseudo NMOS logic.
[T1,T2][No. of Hours: 11]
UNIT III
Sequential MOS logic circuits: SR latch, clocked latch and flip flop circuits, CMOS D latch and edge triggered
flip flop, dynamic logic circuits; basic principle, non ideal effects, domino CMOS logic, high performance
dynamic CMOS circuits, clocking issues, clock distribution.
[T1,T2][No. of Hours: 11]
UNIT IV
VLSI designing methodology, design flow, design Hierarchy, concept of regularity, modularity & locality,
VLSI design style, Design quality, computer aided design technology, adder design and multiplier design
examples. Low power design concepts using CMOS Technology.
[T1,T2][No. of Hours: 11]
Text Books:
[T1] Basic VLSI Design - Pucknell Douglas A., Eshraghian Kamran, PHI Learning Pvt Limited, 2013.
[T2] N. Weste and D. Harris, "CMOS VLSI Design: A Circuits and Systems Perspective - 4th Edition",
Pearson Education, India.

Reference Book:
[R1] S. M. Kang, Y. Lebiebici, “CMOS digital integrated circuits analysis & design” Tata McGraw Hill,
3rd Edition.
[R2] Digital Integrated Circuit Design- Ken Martin, Oxford University Press
[R3] The MOS Transistor- Yaniiis Tsividis and Colin Mcandrew, Oxford University Press, 2013
[R4] J. M. Rabaey, “Digital Integrated Circuits” PHI Learning Pvt Limited, India
[R5] J. P. Uyemura, “Introduction to VLSI Circuits and Systems”, John Wiley & Sons, Inc., New York, NY
[R6] Neelam Sharma, "Digital Logic Design", Ashirwad Publication 2013-14
 HUMAN COMPUTER INTERACTION

Paper Code: ETCS-404 L T/P C

Paper: Human Computer Interaction 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer typequestions. It should be of 25 marks.
2. Apart from question no. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit.Each
question should be of 12.5 marks.

Objective: To introduce the students about the interaction between and computer and human being.

UNIT I
Introduction:The Human, The Computer, The interaction, Paradigms, Usability of Interactive Systems,
Guidelines, Principles and Theories.
Design Process:Interaction design basics, HCI in the software process, Design rules, Implementation support,
Evaluation techniques, Universal design, User Support.
[T1, T2][No. of Hrs. 10]
UNIT II
Models and Theories:Cognitive models, Socio-organizational issues and stakeholder requirements,
Communication and collaboration models, Task analysis, Dialogue notations and design, Models of the system,
Modelling rich interaction.
[T1, T2][No. of Hrs. 11]
UNIT III
Interaction Styles: Direct Manipulation and Virtual Environments, Menu Selection, Form Filling and Dialog
Boxes, Command and Natural Languages, Interaction Devices, Collaboration and Social Media Participation.
[T1, T2][No. of Hrs. 10]
UNIT IV
Design Issues: Quality of Service, Balancing Function and Fashion, User Documentation and Online Help,
Information Search, Information Visualization.
Outside the Box:Group ware, Ubiquitous computing and augmented realities, Hypertext, Multimedia and the
World Wide Web.
[T1, T2][No. of Hrs. 11]
Text Books:
[T1] Alan Dix, Janet Finlay, “Human Computer Interaction”, ISBN: 9788131717035 Pearson Education,
2004.
[T2] Ben Shneiderman, “Designing the User Interface-Strategies for Effective Human Computer
Interaction”, ISBN:9788131732557, Pearson Education , 2010

Reference Books:
[R1] Usability Engineering: Scenario-Based Development of Human-Computer Interaction, by Rosson, M.
and Carroll, J. (2002)
[R2] The Essentials of Interaction Design, by Cooper, et al. , Wiley Publishing(2007)
[R3] Usability Engineering, by Nielsen, J. Morgan Kaufmann, San Francisco, 1993. ISBN 0-12-518406-9
[R4] The Resonant Interface: HCI Foundations for Interaction Design , by Heim, S. , Addison-Wesley.
(2007)
[R5] Usability engineering: scenario-based development of human-computer interaction, By Rosson, M.B &
Carroll, J.M. , Morgan Kaufman.(2002).
 DIGITAL IMAGE PROCESSING

Paper Code: ETIT-418 L T/P C

Paper: Digital Image Processing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This questionshould have objective or
short answer type questions. It should be of 25 marks.
2. Apart from question no. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objectives: The aim of this course is to provide digital image processing fundamentals, hardware and software,
digitization, encoding, segmentation, feature extraction etc. It will enhance the ability of students to apply tools
in image restoration, enhancement and compression and to apply the techniques in both the spatial and
frequency domains. It will enhance the ability of students to identify the quality characteristics of medical
images, differences between computer vision and image processing and help in studying the remote sensing
images of the environmental studies.

UNIT- I :
Introduction and Digital Image Fundamentals: The origins of Digital Image Processing, Examples of Fields
that Use Digital Image Processing, Fundamentals Steps in Image Processing, Elements of Digital Image
Processing Systems, Image Sampling and Quantization, Some basic relationships like Neighbors, Connectivity,
Distance Measures between pixels, Linear and Non Linear Operations.
Image Enhancement in the Spatial Domain: Some basic Gray Level Transformations, Histogram Processing,
Enhancement Using Arithmetic and Logic operations, Basics of Spatial Filters, Smoothening and Sharpening
Spatial Filters, Combining Spatial Enhancement Methods.
[T1, T2][No. of Hrs: 10]
UNIT- II:
Filtering in the Frequency Domain: Introduction to Fourier Transform and the frequency Domain, Smoothing
and Sharpening Frequency Domain Filters.
Image Restoration: A model of The Image Degradation / Restoration Process, Noise Models, Restoration in
the presence of Noise Only Spatial Filtering, Periodic Noise Reduction by Frequency Domain Filtering,
Estimation of Degradation Function, Inverse filtering, Wiener filtering, Constrained Least Square Filtering,
Geometric Mean Filter, Geometric Transformations.
[T1, T2][No. of Hrs. 12]
UNIT- III:
Image Compression: fundamentals of compression, coding redundancy, Lossy and lossless compression,
Spatial and temporal redundancy, Image compression models. Some basic compression methods
Image Segmentation: Detection of Discontinuities, Edge linking and boundary detection, Region Oriented
Segmentation, Motion based segmentation.
[T1, T2][No. of Hrs. 12]
UNIT- IV:
Representation and Description: Representation, Boundary Descriptors, Regional Descriptors, Use of
Principal Components for Description, Introduction to Morphology, Some basic Morphological Algorithms.
Object Recognition: Patterns and Pattern Classes, Decision-Theoretic Methods, Structural Methods.
[T1, T2][No. of Hrs: 10]
Text Books:
[T1] Rafael C. Gonzalez & Richard E. Woods, “Digital Image Processing”, 3Rd edition, Pearson, 2002.
[T2] A.K. Jain, “Fundamental of Digital Image Processing”, PHI, 1989.

Reference Books:
[R1] Bernd Jahne, “Digital Image Processing”, 5th Ed., Springer, 2002.
[R2] William K Pratt, “Digital Image Processing: Piks Inside”, John Wiley & Sons, 2001.
 NEXT GENERATION NETWORKS

Paper Code: ETIT-420 L T/P C

Paper: Next Generation Networks 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This questionshould have objective or
short answer type questions. It should be of 25 marks.
2. Apart from question no. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks.

Objectives: The objective of this paper is to introduce the students about the advanced and next generation
networks and wireless access and transportation technologies.

UNIT I
Converged Services for Next Generation Networks
GSM/UMTS Network protocols: SS7 and 124tandardi basics, Supplementary Services: UMTS procedures.
Intelligent Network: IN principles, CAMEL, Services: what are the challenges? , Integration, deployment issues.
Next Generation Networks: IMS: the convergence. NGN architecture, NGN control architectures and protocols,
Multi-access to the services: 3G, WiFi, DSL, Cable. TISPAN, SIP, Service architectures, Transition of networks
(PSTN, IP-based) to NGN, Ipv6-based NGN, MEGACO, H.248, P2P systems, P2P SIP, Social Networks: Web-
NGN convergence, Telco 2.0, IPTV, RCS. UMTS 124tandardized124on at 3GPP: Standardisation process and
principles in ETSI and 3GPP, Functionalities 124tandardized in UMTS from Release 99 to Release 9. Latest
3GPP updates: what happened in 2010?
[T1, T2][No. of Hrs. 12]
UNIT II
Wireless Access and Transport Technologies
RAN architecture : Radio Access Network Architecture for GSM, GPRS and UMTS, network devices,
interfaces and protocols , QoS definition and management in GPRS and UMTS, Access methods and radio
resource management in mobile networks, mainly for: TDMA systems, CDMA systems and OFDMA systems.
Scheduling issues for GPRS, UMTS and WiMAX : downlink, uplink Physical to logical channel mapping : for
GSM , for UMTS Procedure and protocol used for resource allocation ,PDP Context and TBF allocation.
[T1][No. of Hrs. 12]
UNIT III
WPAN, WLAN, WMAN and Broadcast technologies
WLAN, WPAN, WMAN, DVB-H: Introduction ,WiFi: Standards, performance, usage and applications, new
evolutions ,WiMAX, DVB-H :Usage and standard, Security :Basics, architectures, algorithms, Bluetooth:
Standard, performance, usage and applications , Zigbee, UWB: Standards and usage, Service discovery in
wireless Networks (jxta, UPnP,…) , Security in Wireless Networks: PANs, LANs and cellular Wireless
Networks Simulation (tools and methods)
[T1][No. of Hrs. 10]
UNIT IV
Optimization: Theory and Network applications
Graph algorithms, linear programming basics, Introduction to Integer programming, Traffic engineering,
Network topology calculus, Network optimal routing and dimensioning, Frequency assignment, Pricing, Game
theory.
[T2][No. of Hrs. 10]
Text Books:
[T1] Next Generation Network Services: Technologies & Strategies by Neill Wilkinson, Publication, 2002
ISBN-10: 0471486671 | ISBN-13: 978-0471486671 | Edition: 1.
[T2] Next Generation Networks: Perspectives and Potentials by Jingming Li Salina, Pascal Salina,
Publisher:John Wiley & Sons, 2008, ISBN:0470724471, 9780470724477.

Reference book:
[R1] Next-Generation Network Services: By Robert Wood, Published Nov 1, 2005 by Cisco Press. Part of
the Networking Technology series
[R2] Best Practices for Implementing Next Generation Networks (NGN) in the Asia and Pacific Region,
International Telecommunication Union, Telecommunication Development Bureau, June 2012.
 GPS AND GIS

Paper Code: ETIT-422 L T/P C

Paper: GPS and GIS 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit should
have two questions. However, student may be asked to attempt only 1 question from each unit. Each question
should be of 12.5 marks

Objectives: To study the fundamentals and scope of Global Information System and Global Positioning System.

UNIT- I
Global Information System (GIS): Introduction, scope and benefits of GIS; application areas of GIS;
functional components and elements of GIS; geographic objects: scale, accuracy and resolution.
GIS Cartography and Maps: Digital cartography: selection, classification and simplification; exaggeration
and symbolization for cartographic abstraction; Types of Maps; map elements: projection, direction, scale and
co-ordinates; Geodatabases; GIS map outputs; Topographic mapping.
[T1,T2][No. of Hrs: 11]
UNIT- II
Geographic Data: Spatial and attribute data; vector and raster models; points, lines, polygon features;
computed and associated attributes; grids, cells and image data; linking spatial and attributed data.
Geoprocessing: Geographic co-ordinate system: latitudes and longitudes; Geoids Spheroids ellipsoids and
datum’s; projections and transformations.
[T1,T2][No. of Hrs: 10]
UNIT- III
Global Positioning System (GPS): Introduction; GPS components: systems, scales and codes; error and
accuracy of GPS observation; Differential GPS.
Fundamentals of Satellite Orbits: Orbital Mechanics, Constellation Design
Remote Sensing (RS): Introduction; application of RS; electromagnetic radiation; spectral signatures;
aerial/satellite image characteristics: spatial, spectral, radiometric and temporal.
[T1,T2][No. of Hrs: 11]
UNIT- IV
Statistics: Spatial statistics; independent and dependent variables; continuous data: sampling, correlation,
regression, frequency and descriptive analysis; discrete data.
Interpolation: Characteristic interpolators; deterministic interpolators; evaluating interpolators.
[T1,T2][No. of Hrs: 10]
Text Books:
Note: There is no single textbook for this course. Suggested Readings:
[T1] Burrough, P.A. and R.A. McDonnell, Principles of Geographic Information System, Oxford University
Press, Oxford.
[T2] Chang, K.T., Introduction to Geographic Information System, Tata Mc Graw-Hill, New Delhi.
[T3] Heywood, I. et. al., An Introduction to Geographic Infomation Systems, Pearson Education, Delhi.
[T4] Clarke, K., Analytical and Computer Cartography.2nd Ed., Upper Saddle River.
[T5] Garmin Corporation., GPS Guide for Beginners available at:
http://www.garmin.com/manuals/gps4beg.pdf.
[T6] LLiffe, J.C., Datum and Map Projections for remote Sensing, GIS and Surveying. New York : CRC
Press.
[T7] Curran,Paul J., Principles of Remote Sensing, Longman, London & New York.
[T8] Lillesand, T. and R. Kiefer, Remote Sensing and Image Interpretation, Wiley, New York.
 SATELLITE COMMUNICATION

Paper Code: ETEC-404 L T/P C

Paper: Satellite Communication 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objectives:To study the most relevant aspects of satellite communication with emphasis on the most recent
application & developments. It covers orbital mechanics, launching techniques, satellite link design, earth&
space segment, error control coding and different multiple access techniques.

UNIT- I
Principles of Satellite Communication:Evolution & growth of communication satellite, Satellite frequency
allocation & Band spectrum, Advantages of satellite communication, Active & Passive satellite, Applications of
satellite communication. Synchronous satellite, Satellite Launch.
Satellite Orbits:Introduction, Kepler’s Laws, Newton’s law, orbital parameters, orbital perturbations, station
keeping, geo stationary and non Geo-stationary orbits, LEO, MEO, Look Angle Determination- Limits of
visibility –eclipse-Sub satellite point –Sun transit outage.
[T1, T2, R1][No. of Hrs. 11]
UNIT- II
Satellite Link Design
Basic transmission, System noise temperature, G/T ratio, design of down links, uplink design, design of
specified C/N, Atmospheric Absorption, Rain induced attenuation.
Space Segment: Power Supply, Altitude Control, Station Keeping, Thermal Control, TT&C sub system,
Transponders, Antenna Sub system.
Earth Segment: Subsystem of earth station, Transmit-Receive Earth Station, different types of earth stations,
frequency coordination.
[T1, T2, R1][No. of Hrs. 11]
UNIT- III
Multiple Access Techniques: FDMA, FDMA down link analysis. TDMA, Satellite-switched TDMA, code
division multiple access, DAMA, On board signal processing for FDMA/TDM Operation.
Error Control for Digital Satellite Links: Error detection and correction for digital satellite links, error control
coding, Convolutional codes, satellite links concatenated coding and interleaving, Automatic Repeat Request
(ARQ).
[T1, T2, R2][No. of Hrs. 10]
UNIT- IV
Interconnection of Satellite Networks: Interconnection with ISDN, Interconnection of television networks.
Satellite Applications: Satellite mobile services, VSAT, GPS, Radarsat, INMARSAT, Satellite navigational
system. Direct broadcast satellites (DBS)- Direct to home Broadcast (DTH), Worldspace services, Business
TV(BTV)
[T1, R2, R3][No. of Hrs. 10]
Text Books:
[T1] Dennis Roddy, “Satellite Communication”, McGraw Hill International.
[T2] T. Pratt, “Satellite Communication”, John Willy and Sons (Asia) Pvt. Ltd.

Reference Books:
[R1] T. Ha, “Digital Satellite Communication”, McGraw Hill.
[R2] Bruce R. Elbert, “The Satellite Communication Applications Handbook” ,Artech House Boston.
[R3] Mark R. Chartrend, “Satellite Communication” Cengage Learning
[R4] Handbook of Satellite Communication, Wiley.
 E-COMMERCE AND M-COMMERCE

Paper Code: ETIT-428 L T/P C

Paper: E-Commerce and M-Commerce 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: The objective of the paper is to impart knowledge about the fundamentals and advancements in the
fields of Electronic Commerce (E-Commerce) and Mobile Commerce (M-Commerce) with the aim of enabling
the students to explore the possibilities of practical applications and research aspects in the field of integrating
business with Information Technology.

UNIT I
Introduction and Concepts: Networks and commercial transactions – Internet and other novelties; networks and
electronic transactions today, Model for commercial transactions; Internet environment – internet advantage,
worlds wide web and other internet sales venues; Online commerce solutions.
Security Technologies: Insecurity Internet; A brief introduction to Cryptography; Public key solution; Key
distribution and certification; prominent cryptographic applications.
Electronic Payment Methods: Updating traditional transactions; secure online transaction models; Online
commercial environments; digital currencies and payment systems; Offline secure processing; private data
networks.
[T1] [T2] [R1] [R4][No. of Hrs. 10]
UNIT II
Protocols for Public Transport of Private Information: Security protocols; secure protocols; Secure hypertext
transfer protocols; Secure sockets layers; Integrating security protocols into the web; Non technical provide.
Electronic Commerce Providers: On-line Commerce options: Company profiles.
Electronic Payment Systems: Digital payment systems; First virtual internet payment system; cyber cash model.
On-line Commerce Environments: Servers and commercial environments; Netscape product line; Netscape
commerce server; Microsoft internet explorer and servers; open market.
Digital Currencies: Optional process of Digicash, Ecash Trail; Using Ecash; Smart cards, Electronic Data
Interchange; Its basics; EDI versus Internet and EDI over Internet.
Strategies, Techniques and Tools: Internet Strategies: Internet Techniques, Shopping techniques and online
selling techniques; Internet tools.
[T1] [R5][No. of Hrs. 11]
UNIT III
Supply chain management: Introduction, What is supply chain management? Focus on the value chain, Option
for restructuring the supply chain, Using e-business to restructure the supply chain, Supply chain management
implementation.
E-procurement: Introduction, What is e-procurement?, Drivers of e-procurement, Focus on estimating e-
procurement cost savings, Risks and impacts of e-procurement, Implementing e-procurement, Focus on
electronics B2B marketplaces, The future of e-procurement?Customer relationship management: Introduction,
What is e-CRM?, conversion marketing, the online buying process, customer acquisition management, focus
on marketing communications for customer acquisition, customer retention management focus on excelling in
e-commerce service quality, customer extension Analysis and design: Introduction, process modeling, Data
modeling, Design for e-business, Focus on user –centered site design, Focus on security design for e-business.
Implementation and maintenance: Introduction, Alternatives for acquiring e-business systems, Development of
web-based content and services, focus on developing dynamic web content, testing, Changeover, Content
management and maintenance, Focus on measuring and improving performance of e- business systems.
[T2] [R2] [R3][No. of Hrs. 10]
UNIT IV
Introduction to M-commerce: Emerging applications, differentplayers in m-commerce, M-commerce life cycle
Mobile financial services, mobile entertainment services, and proactive service management.
Management of mobile commerce services, Content development and distribution to hand-held devices, content
caching, pricing of mobile commerce services; emerging issues in mobile commerce: The role of
emerging wireless LANs and 3G/4G wireless networks, personalized content management,implementation
challenges in m-commerce, futuristic m-commerce services.

[T2] [R1] [R4][No. of Hrs. 10]

Text Books:
[T1] Ravi Kalakota, Andrew B. Whinston, “Frontiers of E-Commerce”, 1st Edition, Sept. 1996, Addison
Wesley Longman
[T2] Dave Chaffey, “E-Business and E-Commerce Management”, 3rd Edition, 2009, Pearson Education.

References Books:
[R1] Henry Chan, Raymod Lee and etl., “E-Commerce Fundamental and Applications”, 1st Edition, Nov.
2001,Wiley
[R2] Brian Mennecke and Troy Strader, “Mobile Commerce: Technology, Theory and Applications”, Idea
Group, 2003.
[R3] Nansi Shi, “Mobile Commerce Applications”, IGI Global, 2004.
[R4] Gary P. Schneider, “Electronic Commerce”, Tenth Edition, May 2012, CENGAGE Learning India
[R5] K. K. Bajaj, D. Nag “E-Commerce”, 2nd Edition, Sept. 2005, McGraw Hill Education.
[R6] P. T. Joseph, “E-Commerce an Indian Perspective”, 4th Edition, July 2013, PHI Publication.
[R7] Bhaskar Bharat, “Electronic Commerce - Technology and Application”, 4th Edition, May 2013,
McGraw Hill Education.
 DISTRIBUTED SYSTEMS

Paper Code: ETIT-430 L T/P C

Paper: Distributed Systems 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective: To understand networking, operating systems and various issues.

UNIT-I
Fundamentals of Distributed Computing:
Architectural models for distributed and mobile computing systems, Basic concepts in distributed computing.
Distributed Operating Systems:
Overview, network operating systems, Distributed file systems, Middleware, client/server model for computing.
[T1, T2][No. of Hours 12]
UNIT-II
Communication:
Layered protocols, RPC, RMI, Remote objects.Basic Algorithms in Message Passing Systems, Leader Election
in Rings, and Mutual Exclusion in Shared Memory, Message Passing, PVM and MPI.
Process Concepts:
Threads, Clients and Servers, Code migration, Agent based systems, Distributed objects, CORBA, Distributed
COM.
[T1 [No. of Hours 10]
UNIT-III
Synchronization:
Clock synchronization, Logical clocks, Election algorithms, Mutual exclusion, Distributed transactions, Naming
concepts, Security in distributed systems
Distributed Databases:
Distributed Data Storage, Fragmentation & Replication, Transparency, Distributed Query Processing and
Optimization, Distributed Transaction Modeling and concurrency Control, Distributed Deadlock, Commit
Protocols.
[T2][No. of Hours 11]
UNIT-IV
Processing:
Basic Concepts: Introduction to processing, processing terminology, Design of algorithms, Design of Parallel
Databases, Parallel Query Evaluation.
[T1,T2][No. of Hours 11]
Text Books:
[T1] Tannenbaum, A, Maarten Van Steen. Distributed Systems, Principles and Paradigm, Prentice
Hall India, 2002
[T2] Elmarsi, Navathe, Somayajulu, Gupta, “Fundamentals of Database Systems”, 4 th Edition, Pearson
Education, 2007
Reference Books:
[R1] Tanenbaum, A, “Modern Operating Systems”, 2nd Edition, Prentice Hall India, 2001.
[R2] Singhal and Shivaratri, “Advanced Concepts in Operating Systems”, McGraw Hill, 1994
[R3] Attiya, Welch, “Distributed Computing”, Wiley India, 2006
[R4] Coulouris, Dollimore and Kindberg, “Distributed Systems”, Pearson, 2009.
 ENTERPRISE COMPUTING IN JAVA

Paper Code:ETIT-412 L T/P C

Paper: Enterprise Computing in JAVA 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective
or short answer type questions. It should be of 25 marks.
2. Apart from Question No. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks.

Objective:In this course student will learn about J2EE technology and will be able to develop dynamic websites.
This course will explain how Enterprise JavaBeans (EJBs) contain the application's business logic and business
data.
Pre-requisites: Core java
UNIT I
Introduction to J2EE and building J2EE applications, MVC architecture, Introduction to servlets and its
life cycle , problems with cgi-perl interface , generic and http servlet , servlet configuration, various session
tracking techniques, servlet context, servlet configuration, servlet collaboration.
[T1,T2][No. of Hours: 10]
UNIT II
JSP Basics and Architecture: JSP directives, Scripting elements, standard actions, implicit objects, JSP design
strategies.
Struts: Introduction of Struts and its architecture, advantages and application of Struts.
[T1,T2][No. of Hours: 12]
UNIT III
EJB Fundamentals: Motivation for EJB, EJB Echo system, J2EE technologies, Enterprise beans and types,
distributed objects and middleware, developing EJB components, remote local and home interface, bean class
and deployment descriptor.
[T1,T2][No. of Hours: 10]
UNIT IV
Introducing session beans: Session beans life time, statefull and Stateless session beans, lifecycle of session
beans.
Introducing Entity beans:Persistence concepts, features of entity beans, entity context,
Introduction to JMS & Message driven beans.
[T1,T2][No. of Hours: 10]
Text Books:
[T1] Ed Roman, Scott W Ambler, Tyler Jewell, “Mastering Enterprise Java Beans”, Wiley, 2 nd Ed., 2005.
[T2] Govind Sesadri , “Enterprise Java Computing: Application and Architectures”, Cambridge University
Publications, 1999.

Reference Books:
[R1] Ted Neward, “Effective Enterprise Java”, Eddison -Wesley, 2004.
[R2] Jim Farley, William Crawford, “ Java Enterprise in a Nutshell”, O’Reilly and Associates, 3rd Ed.
[R3] Austin Sincock , “Enterprise Java for SAP” , A Press Publications.
[R4] Joe Wigglesworth and McMilan Paula, “Java Programming: Advanced Topic”, Thomson, 3 rd Ed.,
2003.
[R5] Subrahamanyam Allamaraju, Cedric Buest, “Professional Java Server Programming, J2EE, Apress, 1.3
Ed., 2005.
[R6] Ivan Bayross and Sharanam Shah, “Java Server Programming”, Shroff.
[R7] John Hunt and Chris Loftus, “Guide to J2EE: Enterprise Java” Springer Verlag Publications.
[R8] Govind Seshadri, “Enterprise Java Computing: Application and Architectures”, Cambridge University
Press, 1999.
 QUANTUM COMPUTING

Paper Code: ETCS-428 L T/P C

Paper: Quantum Computing 3 0 3

INSTRUCTIONS TO PAPER SETTERS: MAXIMUM MARKS: 75

1. Question No. 1 should be compulsory and cover the entire syllabus. This question should have objective or
short answer type questions. It should be of 25 marks.
2. Apart from question no. 1, rest of the paper shall consist of four units as per the syllabus. Every unit
should have two questions. However, student may be asked to attempt only 1 question from each unit. Each
question should be of 12.5 marks

Objective: The objective of this course is to impart necessary knowledge to the learner so that he/she can
develop and implement algorithm and write programs using these algorithms.

UNIT I
Introduction to Quantum Computing: Motivation for studying Quantum Computing, Major players in the
industry (IBM, Microsoft, Rigetti, D-Wave etc.),Origin of Quantum Computing, Overview of major concepts in
Quantum Computing, Qubits and multi-qubits states, Bra-ket notation., Bloch Sphere representation, Quantum
Superposition, Quantum Entanglement

UNIT II
Math Foundation for Quantum Computing: Matrix Algebra: basis vectors and orthogonality, inner product
and Hilbert spaces, matrices and tensors, unitary operators and projectors, Dirac notation, Eigen values and
Eigen vectors.

UNIT III
Building Blocks for Quantum Program: Architecture of a Quantum Computing platform, Details of q-bit
system of information representation: Block Sphere, Multi-qubits States, Quantum superposition of qubits (valid
and invalid superposition), Quantum Entanglement, Useful states from quantum algorithmic perceptive e.g. Bell
State, Operation on qubits: Measuring and transforming using gates, Quantum Logic gates and Circuit: Pauli,
Hadamard, phase shift, controlled gates, Ising, Deutsch, swap etc., Programming model for a Quantum
Computing Program: Steps performed on classical computer, Steps performed on Quantum Computer, Moving
data between bits and qubits.

UNIT IV
Quantum Algorithms: Basic techniques exploited by quantum algorithms, Amplitude amplification, Quantum
Fourier Transform, Phase Kick-back, Quantum Phase estimation, Quantum Walks, Major Algorithms, Shor’s
Algorithm, Grover’s Algorithm, Deutsch’s Algorithm, Deutsch -Jozsa Algorithm 4.3OSS Toolkits for
implementing Quantum program, IBM quantum experience, Microsoft Q, Rigetti PyQuil (QPU/QVM).

Text Books:

1. Michael A. Nielsen, “Quantum Computation and Quantum Information”, Cambridge University Press.
2. David McMahon, “Quantum Computing Explained”, Wiley

Reference:

1. IBM Experience (https://quantumexperience,ng,bluemix.net)

2. Microsoft Quantum Development Kit (https://www.microsoft.com/en-us/quantum/development-kit)
3. Forest SDK PyQuil (https://pyquil.readthedocs.io/en/stable)
 MOBILE COMPUTING LAB

Paper Code: ETIT-452 L T/P C

Paper: Mobile Computing Lab 0 2 1

List of Experiments:

The student is advised to learn any of the following languages and use any one tool kit for generating mobile
applications, such as game, Clock, calendar, Convertor, phone book, Text Editor etc.,
Language support: XHTML-MP, WML, WML Script.
Mobile application languages- XML, Voice XML, Java, J2ME, Java Card
Tool Kits: WAP Developer tool kit and application environment, Android Mobile Applications Development
Tool kit.
For MANETS, use of NS2/NS3 is recommended for two experiments.

Reference Books:
[R1] Donn Felker, “Android Application Development for Dummies”, Wiley, 2010
[R2] Reto Meier, “Professional Android 2 Application Development”, Wrox’s Prog. To Programmer Series.
[R3] Ed Burnette, ’Hello, Android: Introducing Google’s Mobile Development Platform’ third edition’
Pragmatic Programmers, 2012
[R4] Jerome (J.F) DiMarzio “Android A programmer’s Guide” Tata McGraw-Hill 2010 Edition.
[R5] Reza B’Far, “Mobile computing principles: Designing and Developing Mobile Applications with UML
and XML”, Cambridge University press, 2005.
[R6] R.Riggs, A. Taivalsaari, M.VandenBrink, “Programming Wireless Devices with Java2 Platform, Micro
Edition”, ISBN: 0-201-74627-1, Addison Wesley,, 2001.

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 MACHINE LEARNING LAB

Paper Code: ETCS-454 L T/P C

Paper: Machine Learning Lab 0 2 1

Machine Learning Lab experiment based on syllabus of (ETCS-402).

1. Implement and demonstratethe FIND-Salgorithm for finding the most specific hypothesis based on a
given set of training data samples. Read the training data from a .CSV file.
2. For a given set of training data examples stored in a .CSV file, implement and demonstrate the
Candidate-Elimination algorithmto output a description of the set of all hypotheses consistent with the
training examples.
3. Write a program to demonstrate the working of the decision tree based ID3 algorithm. Use an
appropriate data set for building the decision tree and apply this knowledge toclassify a new sample.
4. Build an Artificial Neural Network by implementing the Backpropagation algorithm and test the same
using appropriate data sets.
5. Write a program to implement the naïve Bayesian classifier for a sample training data set stored as a
.CSV file. Compute the accuracy of the classifier, considering few test data sets.
6. Assuming a set of documents that need to be classified, use the naïve Bayesian Classifier model to
perform this task. Built-in Java classes/API can be used to write the program. Calculate the accuracy,
precision, and recall for your data set.
7. Write a program to construct aBayesian network considering medical data. Use this model to
demonstrate the diagnosis of heart patients using standard Heart Disease Data Set. You can use
Java/Python ML library classes/API.
8. Apply EM algorithm to cluster a set of data stored in a .CSV file. Use the same data set for clustering
using k-Means algorithm. Compare the results of these two algorithms and comment on the quality of
clustering. You can add Java/Python ML library classes/API in the program.
9. Write a program to implement k-Nearest Neighbour algorithm to classify the iris data set. Print both
correct and wrong predictions. Java/Python ML library classes can be used for this problem.
10. Implement the non-parametric Locally Weighted Regressionalgorithm in order to fit data points. Select
appropriate data set for your experiment and draw graphs.

NOTE:- At least 8 Experiments from the syllabus must be done in the semester.
 GPS AND GIS LAB

Paper Code: ETIT-456 (ELECTIVE-II) L T/P C

Paper: GPS and GIS Lab 0 2 1

Softwares for GPS:

a. openGTS
b. GPSTk
Softwares for GIS:
a. QGIS
b. GRASS GIS
c. GeoTools
d. ArcView GIS

List of Experiments

First Set of Experiments:

1. Using Handheld GPS for location & recording points
2. Recording point positions and data
3. Importing Juno Data into ArcMap
4. Set up a work area with basemap data
5. Entering data into Excel and Adding as Events to ArcMap
6. Using Pathfinder to download saved file from the GPS
7. Execute ArcMap
8. Loading an orthophoto into the Juno

Second Set of Experiments:

1. Introduction toMapping, Triangulation & Navigation using ArcView GIS

2. GPS/GIS Data Conversion and Map Construction
3. GPS Data Gathering
4. DGPS Post Processing and GIS Data Transfer
5. ArcView processing and map presentation

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 NEXT GENERATION NETWORKS LAB

Paper Code: ETIT-456 (ELECTIVE-II) L T/P C

Paper: Next Generation Networks Lab 0 2 1

List of Experiments:

1. Overview of IP Address
2. Design Ethernet Cables : Cross Cable, Straight Cable, Rollover Cable
3. Demonstrate to connect two computer without connecting devices
4. Demonstrate to connect two computer with connecting devices
5. Demonstrate to establish client-server connection with using of windows server 2008
6. Use of policies in Windows Server 2008
7. Overview of Router
8. Demonstrate the use of router to make a connection
9. Introduction to Network Address Translation
10. Overview of different interfaces in router
11. Implement IP Subnetting in IPV4
12. Implement IP routing using RIP
13. Implement IP routing using IGRP
14. Implement IP routing using EIGRP
15. Implement IP routing using OSPF
16. Configuration of VLAN
17. Configuration of VTP
18. Managing traffic with Standard IP Access List
19. Managing traffic with Extended IP Access List
20. Overview of MPLS

NOTE:- At least 8 Experiments out of the list must be done in the semester.
 QUANTUM COMPUTING LAB

Paper Code: ETIT-456 (ELECTIVE-II) L T/P C

Paper: Quantum Computing Lab 0 2 1

List of Experiments:
1. Building Quantum dice
2. Building Quantum Random No. Generation
3. Composing simple quantum circuits with q-gates and measuring the output into classical bits.
4. Implementation of Shor’s Algorithms
5. Implementation of Grover’s Algorithm
6. Implementation of Deutsch’s Algorithm
7. Implementation of Deutsch-Jozsa’s Algorithm
8. Implementing an API for efficient search using Grover’s Algorithms or Integer factorization using
Shor’s Algorithm