Department of Computer Science and Information Technology

Nims Institute of Engineering & Technology

Nims University Rajasthan,Jaipur

Department of Computer Science and Information

Technology
PROGRAM CURRICULUM

FOR
B. TECH.
Computer Science & Engineering

AS PER
AICTE MODEL CURRICULUM
[Effective from the Session: 2018-2019]

NIMS UNIVERSITY RAJASTHAN, JAIPUR

Jaipur-Delhi Highway
Jaipur - 303121, Rajasthan, India
Website: www.nimsuniversity.org

1
Department of Computer Science and Information Technology

Department of Computer Science & Information

Technology
The Computer Science Department offers Diploma Computer Science & Engineering and
Information Technology, B. Tech. program in Computer Science & Engineering, M. Tech.
programs in Computer Science & Engineering, Ph.D. program in Computer Science and
Engineering. The department has active research interest in various domains like Machine
Learning, Data Mining, Computer Networks and Security, High Performance Computing,
Unified Hardware Software co-design etc. It has modern computing amenities equipped with
the latest tools and technologies. The department emphasizes on effective teaching learning
process including project based learning using modern tools and technologies.

Vision

Retain the intellectual curiosity that motivates lifelong learning and allows for a flexible
response to the rapidly evolving challenges of the 21st century. The program expects
graduates to achieve, within several years of graduation, the following objectives.

Mission
 To provide quality education to meet the need of profession and society.
 Provide a learning ambience to enhance innovations, problem solving skills,
leadership qualities, team-spirit and ethical responsibilities.
 Establish Industry Institute Interaction program to enhance the entrepreneurship skills
 Provide exposure of latest tools and technologies in the area of engineering and
technology.
 Promote research based projects/activities in the emerging areas of technology
convergence.

Program Educational Objectives

The objectives of the Computer Science & Information Technology undergraduate

program are to produce graduate who:
 Apply their Computer Science & Information Technology education to address the
full range of technical and societal problems with creativity, imagination, confidence
and responsibility.

2
Department of Computer Science and Information Technology

 Actively seek out positions of leadership within their profession and their community.

Serve as ambassadors for engineering by exhibiting the highest ethical and professional
standards, and by communicating the importance and excitement of this dynamic field:

PEO 1-Graduates shall make their way to the society with proper scientific and technical
knowledge in Computer Science & Information Technology.

PEO 2-Graduates shall work in design and analysis of Computer Science & Information
Technology systems with strong fundamentals and methods of synthesis.

PEO 3- Graduates shall adapt to the rapidly changing environment in the areas of Computer
Science & Information Technology and scale new heights in their profession through lifelong
learning
PEO 4-Graduates shall excel in career by their ability to work and communicate effectively
as a team member and/or leader to complete the task with minimal resources, meeting
deadlines

Program Outcomes:
Ability to apply knowledge of mathematics, science and Computer Science & Information
Technology fundamentals for solving problems
1. Ability to Identify, formulate and analyze mechanical engineering problems arriving
at meaningful conclusions involving mathematical inferences
2. Ability to apply modern engineering tools, techniques and resources to solve complex
Mechanical & Aerospace engineering activities with an understanding of the
limitations

PROGRAM SPECIFIC OUTCOMES (PSOs):

Program Specific Course Learning Outcomes for Bachelor of Science, Computer Science set
by Faculty in Engineering are as follows:

PSO1: Analyze a complex computing problem and to apply principles of computing and
other relevant disciplines to identify solutions.

PSO2: Design, implement, and evaluate a computing-based solution to meet a given set of
computing requirements in the context of the program’s discipline.

3
Department of Computer Science and Information Technology

PSO3: Communicate effectively in a variety of professional contexts

PSO4: Recognize professional responsibilities and make informed judgments in computing

practice based on legal and ethical principles

PSO5: Function effectively as a member or leader of a team engaged in activities appropriate

to the program’s discipline

PSO6: Apply computer science theory and software development fundamentals to produce
computing-based solutions

Student’s outcomes:

The curriculum and syllabus for B.Terch in Information Technology programs (2019)
conform to outcome based teaching learning process. In general, following STUDENT
OUTCOMES have been identified and the curriculum and syllabus have been structured in
such a way that each of the courses meets one or more of these outcomes. Student outcomes
describe what students are expected to know and be able to do by the time of graduation.
These relate to the skills, knowledge, and behaviors that students acquire as they progress
through the program. Further each course in the program spells out clear instructional
objectives which are mapped to the student outcomes.

 An ability to apply knowledge of mathematics, science, and engineering.

 An ability to design and conduct experiments, as well as to analyze and interpret
data.
 An ability to design a system, component, or process to meet desired needs within
realistic constraints such as economic, environmental, social, political, ethical,
health and safety, manufacturability, and sustainability.
 An ability to function on multi-disciplinary teams.
 An ability to identify, formulates, and solves engineering problems.
 An understanding of professional and ethical responsibility.
 An ability to communicate effectively.
 The broad education necessary to understand the impact of engineering solutions in
a global, economic, environmental, and societal context.
 Recognition of the need for, and an ability to engage in life-long learning.
 Knowledge of contemporary issues.
 An ability to use the techniques, skills, and modern engineering tools necessary for
engineering practice

4
Department of Computer Science and Information Technology

B. Tech 1st Year Teaching and Examination Scheme (Common to all branches)
(Structure in accordance with AICTE Model Curriculum w.e.f. Academic Session
2018-19)

SEMESTER I
Theory Practical Total
S. Course Course Hours
Marks Marks Cr
No. Code Title
L T P IA ETE IA ETE
1. PHM101 Physics 3 1 2 30 70 15 35 150 5
2. MTM101 Mathematics-I 3 1 - 30 70 - - 100 4
Basic Electrical
3. EEM101 2 0 2 30 70 15 35 150 3
Engineering
Programming for
4. CSM101 2 - 2 30 70 15 35 150 3
Problem Solving
Engineering
5. MEM101 - - 4 - - 15 35 50 2
Graphics & Design
Human Values &
6. HUM101 3 - - 30 70 - - 100* --
Ethics
TOTAL 13 2 10 150 350 60 140 600 17

SEMESTER II
S. Theory Practical Total
Course Course Hours
No. Marks Marks Cr
Code Title
L T P IA ETE IA ETE
1. CHM201 Chemistry 3 1 2 30 70 15 35 150 5
2. MTM201 Mathematics-II 3 1 - 30 70 - - 100 4
3. Basic Civil
CEM201 3 1 2 30 70 15 35 150 5
Engineering
4. MEM201 Workshop Practices - - 4 - - 15 35 50 2
5. HUM201 Professional English 3 - 2 30 70 15 35 150 4
TOTAL 12 3 10 120 280 60 140 600 20

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits

*Human values will be offered as a compulsory audit course for which passing marks are
40% in End Semester Examination

B. Tech (Computer Science & Engineering) 2ndYear Teaching and Examination Scheme
(Structure in accordance with AICTE Model Curriculum w.e.f. Academic Session 2018-
19)

5
Department of Computer Science and Information Technology

SEMESTER III

Practical
Course Course Hours Theory Marks
S. No. Marks Total Cr
Code Title
L T P IA ETE IA ETE
Object Oriented
1 CSC301 3 1 3 30 70 15 35 150 5.5
Programming

Computer Organization &

2 CSC302 3 1 2 30 70 15 35 150 5
Architecture

Data Structure &

3 CSC303 3 1 2 30 70 15 35 150 5
Algorithms
4 CSM301 Cyber Security 3 0 0 30 70 100* --

5 MTM301 Mathematics-III 3 1 0 30 70 - - 100 4

6 HUM301 Technical Communication 3 - - 30 70 - - 100 3

TOTAL 18 4 7 180 420 45 105 650 22.5

SEMESTER IV

Theory Marks Practical Total

Course Hours
S. No. Course Code Marks Cr
Title
L T P IA ETE IA ETE
CSC401 Programming in Java
1. 3 1 3 30 70 15 35 150 5.5

CSC402 Design and Analysis 15 35

2. 3 1 2 30 70 150 5
Algorithms
CSC403 Database Management
3. System 3 1 2 30 70 15 35 150 5

4. CSC404 System Programming 3 1 0 30 70 - - 100 4

5. BTM401 Biology for Engineers 3 0 0 30 70 - - 100 3

6. BTM402 Environmental Science 2 0 0 30 70 - - 100* --

TOTAL 17 4 7 180 420 45 105 650 22.5

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits
*Cyber Security and Environmental Science will be offered as a compulsory audit course
for which passing marks are 40% in End Semester Examination
B. Tech (Computer Sc. & Engineering) 3rdYear Teaching and Examination Scheme
(Structure in accordance with AICTE Model Curriculum w.e.f. Academic Session 2018-
19)
SEMESTER-V
S. Course Code Course Hours Theory Marks Practical Total Cr
No. Title Marks
6
Department of Computer Science and Information Technology

L T P IA ETE IA ETE
1. CSC501 Computer Networks 3 0 3 30 70 15 35 150 4.5
2. CSC502 Operating System 3 1 2 30 70 15 35 150 5
3. CSC503 Software Engineering 3 1 2 30 70 15 35 150 5
CSC504 Computer Graphics and
4. 3 0 0 30 70 - - 100 3
Multimedia
5. Departmental Elective-I 3 0 0 30 70 - - 100 3
6. Open Elective-I 3 0 0 30 70 - - 100 3
TOTAL 18 2 7 180 420 45 105 750 23.5

SEMESTER-VI
Practical
Hours Theory Marks
S. No. Course Code Course Title Marks Total Cr
L T P IA ETE IA ETE
1. CSC601 Python Programming 3 1 3 30 70 15 35 150 5.5
2. CSC602 Artificial Intelligence 3 0 0 30 70 - - 100 3
Data Mining and
3 CSC603 3 0 0 30 70 100 3
Warehousing
4 CSC604 Software Testing 3 0 2 30 70 15 35 150 4
5 CSC605 Seminar 0 0 3 - - 50 - 50 1.5
6 Departmental Elective-II 3 0 0 30 70 - - 100 3
7 Open Elective-II 3 0 0 30 70 - - 100 3
TOTAL 18 2 8 180 420 80 70 750 23
L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,
Cr=Credits
Elective Subjects for 5th and 6th Semesters
Departmental Elective-I Departmental Elective-II
Discrete Mathematical
CSE501 3-0-0 3 CSE601 Cryptography & Network Security 3-0-0 3
Structures
Formal Language & Automata
CSE502 Mobile Computing 3-0-0 3 CSE602 3-0-0 3
Theory
Human Computer Interaction &
ECC502 Analog Electronics 3-0-0 3 CSE603 3-0-0 3
Usability
Analog and Digital
ECE505 3-0-0 3 CSE604 Information Retrieval 3-0-0 3
Communication

Open Elective-I Open Elective-II

Entrepreneurship
 HUO501 3-0-0 3 MEO601  Introduction to Robotics 3-0-0 3
Development
Professional Practice, Law ECO601 Micro Electro Mechanical System 3-0-0 3
HUO502 3-0-0 3
& Ethics
Introduction to Spacecraft
HUO503 Foreign Language Russian 3-0-0 3 MEO602 3-0-0 3
Technology
HUO504 Foreign Language Japanese 3-0-0 3 EEO601 Automatic Control 3-0-0 3
HUO505 Foreign Language German 3-0-0 3
HUO506 Foreign Language Chinese 3-0-0 3
B. Tech (Computer Sc. & Engineering) 4thYear Teaching and Examination Scheme
(Structure in accordance with AICTE Model Curriculum w.e.f. Academic Session 2018-
19)
SEMESTER-VII
Theory Marks Practical Total
S. Course Course Hours
Marks Cr
No. Code Title
L T P IA ETE IA ETE

7
Department of Computer Science and Information Technology

1. CSC701 Compiler Construction 3 0 2 30 70 15 35 150 4

Microprocessor and
2. EEE708 3 0 0 30 70 100 3
Interface
CSC702 Distributed Computing 3 0 0 30 70 - - 100 3
3. Departmental Elective-III 3 0 0 30 70 - - 100 3
4. Open Elective-III 3 0 0 30 70 - - 100 3
5. CSC703 Minor Project 0 0 8 15 35 50 4
Seminar on Industrial
6. CSC704 0 0 3 50 50 1.5
Training
TOTAL 15 0 13 150 350 80 70 650 21.5

SEMESTER-VIII
Theory Marks Practical Total
S. Course Hours
Course Code Marks Cr
No. Title
L T P IA ETE IA ETE
1 CSC802 Distributed Databases 3 0 0 30 70 100 3
CSC803 Digital Image
2 3 0 0 30 70 100 3
Processing
Departmental Elective-
3 3 0 0 30 70 - - 100 3
IV
4 Open Elective-IV 3 0 0 30 70 - - 100 3
5 CSC801 Major Project 0 0 16 150 200 350 8
TOTAL 12 0 16 120 280 150 200 750 20
L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam, Cr=Credits

Elective Subjects for 7th and 8th Semesters

Departmental Elective-III Departmental Elective-IV

CSE701 Data Analytics 3-0-0 3 CSE801 SOFT COMPUTING 3-0-0 3
CSE702 Machine Learning 3-0-0 3 CSE802 Modeling and Simulation 3-0-0 3
CSE703 Open Source Technology 3-0-0 3 CSE803 Real Time System 3-0-0 3
ECE709 Embedded System 3-0-0 3 CSE804 Operations Research 3-0-0 3

Open Elective-III Open Elective-IV

MEO701  Noise Vibration and Harshness 3-0-0 3 MEO801 Robot Dynamics & Control 3-0-0 3
 ECO701 Introduction to Wireless Network 3-0-0 3 MEO802 Air Traffic Control 3-0-0 3
MAO701 Quality management 3-0-0 3 MEO803 Solar Thermal Energy 3-0-0 3
Space Mission Design and
 MEO702 3-0-0 3 MEO804 Boundary Layer Theory 3-0-0 3
Optimization
ECO703  Intelligent Controller 3-0-0 3 ECO801 Satellite & Radar System 3-0-0 3
Non-Conventional Energy
EEO801 3-0-0 3
Resources

8
Department of Computer Science and Information Technology

B. Tech 1st Year Teaching and Examination Scheme (Common to all branches)
(Structure in accordance with AICTE Model Curriculum w.e.f. Academic Session 2018-19)

SEMESTER I
Theory Practical Total
S. Course Course Hours
Marks Marks Cr
No. Code Title
L T P IA ETE IA ETE
7. PHM101 Physics 3 1 2 30 70 15 35 150 5
8. MTM101 Mathematics-I 3 1 - 30 70 - - 100 4
Basic Electrical
9. EEM101 2 0 2 30 70 15 35 150 3
Engineering
Programming for
10. CSM101 2 - 2 30 70 15 35 150 3
Problem Solving
Engineering
11. MEM101 - - 4 - - 15 35 50 2
Graphics & Design
Human Values &
12. HUM101 3 - - 30 70 - - 100* --
Ethics
TOTAL 13 2 10 150 350 60 140 600 17

9
Department of Computer Science and Information Technology

SYLLABUS
I Semester
Common to all branches of UG Engineering & Technology

PHM101 Physics 3L:1T:2P 5

Course Objectives:
1. To impart the knowledge of special theory of relativity.
2. To impart the knowledge of basic principles of electromagnetic field theory and Maxwell’s
equations.
3. To impart the knowledge of basic principles of quantum mechanics.
4. To impart the basic knowledge of wave theory of optics.
5. To impart the basic knowledge of fiber optics and lasers.

Unit Contents Hour

Relativistic Mechanics:
Frame of reference, Inertial & non-inertial frames, Galilean transformations,
Michelson Morley experiment, Postulates of special theory of relativity,
1 8
Lorentz transformations, Length contraction, Time dilation, Velocity addition
theorem, Variation of mass with velocity, Einstein’s mass energy relation,
Relativistic relation between energy and momentum, Massless particle.
Electromagnetic Field Theory:
Continuity equation for current density, Displacement current, Modifying
equation for the curl of magnetic field to satisfy continuity equation, Maxwell’s
equations in vacuum and in non-conducting medium, Energy in an
2 8
electromagnetic field, Poynting vector and Poynting theorem, Plane
electromagnetic waves in vacuum and their transverse nature. Relation between
electric and magnetic fields of an electromagnetic wave, Energy and
momentum carried by electromagnetic waves, Resultant pressure, Skin depth.
Quantum Mechanics:
Introduction to quantum Mechanics, Wave-particle duality, Matter waves,
Heisenberg’s uncertainty Principle, Wave function and basic postulates, Time
3 8
dependent and time independent Schrodinger’s Wave Equation, Physical
interpretation of wave function and its properties, Applications of the
Schrodinger’s Equation: Particle in one dimensional box.
Wave Optics:
Coherent sources, Interference in uniform and wedge shaped thin films,
Newton’s Rings and its applications. Fraunhoffer diffraction at single slit and at
4 10
double slit, Diffraction grating, Dispersive power, Resolving power of grating,
Rayleigh’s criterion of resolution, Resolving power of grating, X-ray
diffraction and Bragg’s law.
Fibre Optics & Laser:
Fibre Optics: Introduction to fibre optics, Total internal reflection, Critical
angle, Acceptance angle, Numerical aperture, Normalized frequency,
5 Classification of fibre, Attenuation and Dispersion in optical fibres. Laser: 10
Absorption of radiation, Spontaneous and stimulated emission of radiation,
Einstein’s coefficients, Population inversion, Various levels of Laser, Ruby
Laser, He-Ne Laser, Laser applications.
TOTAL 44

10
Department of Computer Science and Information Technology

Course Outcomes:
1. To solve the classical and wave mechanics problems.
2. To develop the understanding of laws of thermodynamics and their application in various
processes.
3. To formulate and solve the engineering problems on Electromagnetism & Electromagnetic
Field Theory.
4. To aware of limits of classical physics & to apply the ideas in solving the problems in their
parent streams.

Recommended Books:
1. Concepts of Modern Physics - AurthurBeiser (Mc-Graw Hill).
2. Introduction to Special Theory of Relativity- Robert Resnick (Wiley).
3. Optics – Brijlal & Subramanian (S. Chand).
4. Engineering Physics: Theory and Practical- Katiyar and Pandey (Wiley India).
5. Applied Physics for Engineers- Neeraj Mehta (PHI Learning, New).
6. Engineering Physics-Malik HK and Singh AK (McGrawHill).
7. Practical Physics- K. K. Dey & B. N. Dutta (Kalyani Publishers New Delhi).
8. Engineering Physics-Theory and Practical- Katiyar& Pandey (Wiley India).
9. Engineering Physics Practical- S K Gupta (Krishna Prakashan Meerut).

Physics Lab
SUGGESTIVE LIST OF EXPERIMENTS:

1. To determine the wave length of monochromatic light with the help of Michelson ’s
interferometer.
2. To determine the wave length of sodium light by Newton’s Ring.
3. To determine the wave length of prominent lines of mercury by plane diffraction grating with
the help of spectrometer.
4. Determination of band gap using a P-N junction diode.
5. To determine the height of given object with the help of sextant.
6. To determine the dispersive power of material of a prism with the help of spectrometer.
7. To study the charge and discharge of a condenser and hence determine the same constant
(both current and voltage) graphs are to be plotted.
8. To determine the coherence length and coherence time of laser using He – Ne laser.
9. To measure the numerical aperture of an optical fiber.
10. To study the Hall Effect and determine the Hall Voltage and Hall coefficients.

Note: Perform at least 8 experiments from above list.

11
 Department of Computer Science and Information Technology

MTM101 Mathematics-I 3L:1T:0P 4

Course Objectives:
1. Construct, or give examples of, mathematical expressions that involve vectors, matrices, and
linear systems of linear equations.
2. Apply linear algebra concepts to model, solve, and analyze real-world situations.
3. Perform calculations and algebraic manipulations, particularly differentiation and integration,
quickly and accurately.
4. Use concepts of calculus to the model real-world problems.

Unit Contents Hour

Matrices: Types of Matrices: Symmetric, Skew-symmetric and Orthogonal
Matrices; Complex Matrices, Inverse and Rank of matrix using elementary
1 transformations, Rank-Nullity theorem; System of linear equations, Characteristic 8
equation, Cayley-Hamilton Theorem and its application, Eigen values and
eigenvectors; Diagonalisation of a Matrix.
Differential Calculus- I: Introduction to limits, continuity and differentiability,
Rolle’s Theorem, Lagrange’s Mean value theorem and Cauchy mean value
2 theorem, Successive Differentiation (nth order derivatives), Leibnitz theorem and 6
its application, Envelope, Involutes and Evolutes, Curve tracing: Cartesian and
Polar co-ordinates.
Differential Calculus-II: Partial derivatives, Total derivative, Euler’s Theorem for
homogeneous functions, Taylor and Maclaurin’s theorems for a function of one
3 6
and two variables, Maxima and Minima of functions of several variables,
Lagrange Method of Multipliers, Jacobians, Approximation of errors.
Multivariable Calculus-I: Multiple integration: Double integral, Triple integral,
4 Change of order of integration, Change of variables, Application: Areas and 10
volumes, Center of mass and center of gravity (Constant and variable densities).
Vector Calculus: Vector differentiation: Gradient, Curl and Divergence and their
Physical interpretation, Directional derivatives, Tangent and Normal planes.
5 Vector Integration: Line integral, Surface integral, Volume integral, Gauss’s 10
Divergence theorem, Green’s theorem, Stoke’s theorem ( without proof) and their
applications.
TOTAL 40

Course Outcomes:
1. Students completing this course will be able to find the null space of a matrix and represent it
as the span of independent vectors.
2. Remember the concept of matrices and apply for solving linear simultaneous equations.
3. Understand the concept of limit, continuity and differentiability and apply in the study of
Rolle,s, Lagrange,s and Cauchy mean value theorem and Leibnitz theorems.
4. Manipulate vectors to perform geometrical calculations in three dimensions.
5. Illustrate the working methods of multiple integral and apply for finding area, volume, centre
of mass and centre of gravity.
6. Remember the concept of vector and apply for directional derivatives, tangent and normal
planes. Also evaluate line, surface and volume integrals.
7. Perform calculations and algebraic manipulations, particularly differentiation and integration,
quickly and accurately.

Recommended Books:
12
Department of Computer Science and Information Technology

1. B. V. Ramana, Higher Engineering Mathematics, Tata Mc Graw-Hill Publishing Company

Ltd., 2008.
2. B. S. Grewal, Higher Engineering Mathematics, Khanna Publisher, 2005.
3. R K. Jain & S R K. Iyenger , Advance Engineering Mathematics, Narosa Publishing House
2002
4. E. Kreyszig, Advance Engineering Mathematics, John Wiley & Sons, 2005.
5. Peter V. O’Neil, Advance Engineering Mathematics, Thomson (Cengage) Learning, 2007.
6. D. Poole, Linear Algebra: A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
7. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
8. P. Sivaramakrishna Das and C. Vijayakumari, Engineering Mathematics, 1st Edition,
Pearson India Education Services Pvt. Ltd
9. Advanced Engineering Mathematics. Chandrika Prasad, Reena Garg, 2018.
10. Engineering Mathemathics – I. Reena Garg, 2018.

EEM101 Basic Electrical Engineering 2L:0T:2P 3

Course Objectives:
1. To provide a comprehensive
2. To obtain the knowledge and skills necessary for immediate employment & untenured
advancement in the field of electrical engineering.
3. To learn generation of sinusoidal voltage, aviary value, loot mean square value
4. To learn the principle of operation & contraction of single phase transformer
5. To understand the concept of wind, solar, fuel cell, Tidal, geo thermal.

Unit Contents Hours

DC Circuits
Electrical circuit elements (R, L and C), Concept of active and passive elements,
1 voltage and current sources, concept of linearity and linear network, unilateral and 8
bilateral elements, Kirchhoff‟s laws, Loop and nodal methods of analysis, Star-
delta transformation, Superposition theorem, Thevenin theorem, Norton theorem.
Steady- State Analysis of Single Phase AC Circuits
Representation of Sinusoidal waveforms – Average and effective values, Form
and peak factors, Concept of phasors, phasor representation of sinusoidally
varying voltage and current. Analysis of single phase AC Circuits consisting of R,
2 10
L, C, RL, RC, RLC combinations (Series and Parallel), Apparent, active &
reactive power, Power factor, power factor improvement. Concept of Resonance
in series & parallel circuits, bandwidth and quality factor. Three phase balanced
circuits, voltage and current relations in star and delta connections.
Transformers
Magnetic materials, BH characteristics, ideal and practical transformer, equivalent
3 8
circuit, losses in transformers, regulation and efficiency. Auto-transformer and
three-phase transformer connections.
4 Electrical machines 8
DC machines: Principle & Construction, Types, EMF equation of generator and
torque equation of motor, applications of DC motors (simple numerical problems)
Three Phase Induction Motor: Principle & Construction, Types, Slip-torque
characteristics, Applications (Numerical problems related to slip only)
Single Phase Induction motor: Principle of operation and introduction to
13
Department of Computer Science and Information Technology

methods of starting, applications.

Three Phase Synchronous Machines: Principle of operation of alternator and
synchronous motor and their applications.
Electrical Installations
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB,
5 Types of Wires and Cables, Importance of earthling. Types of Batteries,
6
Important characteristics for Batteries. Elementary calculations for energy
consumption and savings, battery backup.
TOTAL 40

Course Outcomes:
1. Apply the concepts of KVL/KCL and network theorems in solving DC circuits.
2. Analyse the steady state behaviour of single phase and three phase AC electrical circuits.
3. Identify the application areas of a single phase two winding transformer as well as an auto
transformer and calculate their efficiency. Also identify the connections of a three phase
transformer.
4. Illustrate the working principles of induction motor, synchronous machine as well as DC
machine and employ them in different area of applications.
5. Describe the components of low voltage electrical installations and perform elementary
calculations for energy consumption.

Recommended Books:
1. Ritu Sahdev, “Basic Electrical Engineering”, Khanna Publishing House.
2. S. Singh, P.V. Prasad, “Electrical Engineering: Concepts and Applications” Cengage.
3. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill.
4. D. C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill.
5. E. Hughes, “Electrical and Electronics Technology”, Pearson, 2010.
6. L. S. Bobrow, “Fundamentals of Electrical Engineering”, Oxford University Press.
7. V. D. Toro, “Electrical Engineering Fundamentals”, Pearson India.

Basic Electrical Engineering Lab

SUGGESTIVE LIST OF EXPERIMENTS:

1. Basic safety precautions. Introduction and use of measuring instruments–voltmeter, ammeter,

multi-meter, oscilloscope. Real-life resistors, capacitors and inductors.
2. Measuring the steady-state and transient time-response of R-L, R-C, and R-L-C circuits to a
step change in voltage (transient may be observed on a storage oscilloscope). Sinusoidal
steady state response of R-L, and R-C circuits – impedance calculation and verification.
Observation of phase differences between current and voltage. Resonance in R-L-C circuits.
3. Transformers: Observation of the no-load current waveform on an oscilloscope (non-
sinusoidal wave-shape due to B-H curve nonlinearity should be shown along with a
discussion about harmonics). Loading of a transformer: measurement of primary and
secondary voltages and currents, and power.
4. Three-phase transformers: Star and Delta connections. Voltage and Current relationships
(line-line voltage, phase-to-neutral voltage, line and phase currents). Phase-shifts between the
primary and secondary side. Cumulative three-phase power in balanced three-phase circuits.
5. Demonstration of cut-out sections of machines: dc machine (commutator-brush
arrangement), induction machine (squirrel cage rotor), synchronous machine (field winging -
slip ring arrangement) and single-phase induction machine.
6. Torque Speed Characteristic of separately excited dc motor.
14
Department of Computer Science and Information Technology

7. Synchronous speed of two and four-pole, three-phase induction motors. Direction reversal by
change of phase-sequence of connections. Torque-Slip Characteristic of an induction motor.
Generator operation of an induction machine driven at super-synchronous speed.
8. Synchronous Machine operating as a generator: stand-alone operation with a load. Control of
voltage through field excitation.
9. Demonstration of (a) dc-dc converters (b) dc-ac converters – PWM waveform (c) the use of
dc-ac converter for speed control of an induction motor and (d) Components of LT
switchgear.
Note: Perform at least 8 experiments from above list.

CSM101 Programming for Problem Solving 2L:0T:2P 3

Course Objectives:
1. To provide exposure to problem solving through programming.
2. To write algorithms.
3. To train the student to the basic concepts of C-programming language.
4. To involve a lab component which is designed to give the student hands on Experience with
the concepts.
5. To knowledge of pointers and use of pointers.

Unit Contents Hours

1 Introduction to components of a computer system: Memory, processor, I/O
Devices, storage, operating system, Concept of assembler, compiler, interpreter,
loader and linker. Idea of Algorithm: Representation of Algorithm, Flowchart,
Pseudo code with examples, From algorithms to programs, source code. 8
Programming Basics: Structure of C program, writing and executing the first C
program, Syntax and logical errors in compilation, object and executable code.
Components of C language. Standard I/O in C, Fundamental data types, Variables
and memory locations, Storage classes.
2 (Arithmetic expressions & Conditional Branching)
Arithmetic expressions and precedence: Operators and expression using
numeric and relational operators, mixed operands, type conversion, logical 8
operators, bit operations, assignment operator, operator precedence and
associativity.
3 (Loops & Functions) Iteration and loops: use of while, do while and for loops,
multiple loop variables, use of break and continue statements.
8
Functions: Introduction, types of functions, functions with array, passing
parameters to functions, call by value, call by reference, recursive functions.
4 (Arrays & Basic Algorithms)
Arrays: Array notation and representation, manipulating array elements, using
multidimensional arrays. Character arrays and strings, Structure, union,
8
enumerated data types, Array of structures, Passing arrays to functions.
Basic Algorithms: Searching &Basic Sorting Algorithms (Bubble, Insertion and
Selection), Finding roots of equations, Notion of order of complexity.
5 (Pointer& File Handling)
Pointers: Introduction, declaration, applications, Introduction to dynamic memory
8
allocation (malloc, calloc, realloc, free), Use of pointers in self-referential
structures, notion of linked list (no implementation)
TOTAL 40

15
Department of Computer Science and Information Technology

Course Outcomes:
1. To develop simple algorithms for arithmetic and logical problems.
2. To translate the algorithms to programs & execution (in C language).
3. To implement conditional branching, iteration and recursion.
4. To decompose a problem into functions and synthesize a complete program using divide and
conquer approach.
5. To use arrays, pointers and structures to develop algorithms and programs.

Recommended Books:
1. Schum’s Outline of Programming with C by Byron Gottfried, McGraw-Hill.
2. The C programming by Kernighan Brain W. and Ritchie Dennis M., Pearson Education.
3. Computer Basics and C Programming by V.Rajaraman , PHI Learning Pvt. Limited, 2015.
4. Computer Concepts and Programming in C, R.S. Salaria, Khanna Publishing House.
5. Computer Science- A Structured Programming Approach Using C, by Behrouz A. Forouzan,
Richard F.
6. Gilberg, Thomson, Third Edition, Cengage Learning - 2007.
7. Let Us C By Yashwant P. Kanetkar.
8. Problem Solving and Program Design in C, by Jeri R. Hanly, Elliot B. Koffman, Pearson
Addison-Wesley, 2006.
9. Programming in C by Kochan Stephen G. Pearson Education – 2015.
10. Computer Concepts and Programming in C by D.S. Yadav and Rajeev Khanna, New
AgeInternational Publication.
11. Computer Concepts and Programming by Anami, Angadi and Manvi, PHI Publication.
12. Computer Concepts and Programming in C by Vikas Gupta, Wiley India Publication
13. Computer Fundamentals and Programming in C. Reema Thareja, Oxford Publication
14. Problem Solving and Programming in C, R.S. Salaria, Khanna Publishing House

Programming for Problem Solving Lab

SUGGESTIVE LIST OF EXPERIMENTS:

1. WAP that accepts the marks of 5 subjects and finds the sum and percentage marks obtained
by the student.
2. WAP that calculates the Simple Interest and Compound Interest. The Principal, Amount,
Rate of Interest and Time are entered through the keyboard.
3. WAP to calculate the area and circumference of a circle.
4. WAP that accepts the temperature in Centigrade and converts into Fahrenheit using the
formula C/5=(F-32)/9.
5. WAP that swaps values of two variables using a third variable.
6. WAP that checks whether the two numbers entered by the user are equal or not.
7. WAP to find the greatest of three numbers.
8. WAP that finds whether a given number is even or odd.
9. WAP that tells whether a given year is a leap year or not.
10. WAP that accepts marks of five subjects and finds percentage and prints grades according
to the following criteria: Between
a. 90-100%----------Print ,,A‟
b. 80-90%----------------------------Print „B‟
c. 60-80%----------------------------Print „C‟
d. Below 60%---------------------- Print „D‟

16
Department of Computer Science and Information Technology

11. WAP that takes two operands and one operator from the user and perform the operation and
prints the result by using Switch statement.
12. WAP to print the sum of all numbers up to a given number.
13. WAP to find the factorial of a given number.
14. WAP to print sum of even and odd numbers from 1 to N number.
15. WAP to print the Fibonacci series.
16. WAP to check whether the entered number is prime or not.
17. WAP to find the sum of digits of the entered number.
18. WAP to find the reverse of a number.
19. WAP to print Armstrong numbers from 1 to 100.
20. WAP to convert binary number into decimal number and vice versa.
21. WAP that simply takes elements of the array from the user and finds the sum of these
elements.
22. WAP that inputs two arrays and saves sum of corresponding elements of these arrays in a
third array and prints them.
23. WAP to find the minimum and maximum element of the array.
24. WAP to search an element in a array using Linear Search.
25. WAP to sort the elements of the array in ascending order using Bubble Sort technique.
26. WAP to add and multiply two matrices of order nxn.
27. WAP that finds the sum of diagonal elements of a mxn matrix.
28. WAP to implement strlen (), strcat (),strcpy () using the concept of Functions.

Note: Students have to perform at least 15 experiments from the list

17
Department of Computer Science and Information Technology

MEM101 Engineering Graphics & Design 0L:0T:4P 2

Course Objectives:
1. To equip students with the fundamentals of Engineering Drawing
2. To impart students the ability to communicate technical information by graphical means.
3. To demonstrate the knowledge of CAD software.
4. To demonstrate the designing of 2D and 3D projects.
5. To create working drawing.

Unit Contents Hours

Introduction to Engineering Drawing, Orthographic Projections
Principles of Engineering Graphics and their significance, usage of Drawing
1 instruments, lettering, Scales – Plain and Diagonal Scales Principles of 6
Orthographic Projections – Conventions – Projections of Points and Lines
inclined to both planes; Projections of planes inclined Planes – Auxiliary Planes.
Projections and Sections of Regular Solids
Sections in lined to both the Planes – Auxiliary Views; Simple annotation,
dimensioning and scale. Floor plans the include: windows, doors and fixtures
2 6
such as WC, Both, sink, shower, etc. Prism, Cylinder, Pyramid, Cone – Auxiliary
Vies: Development of surfaces of Right Regular Solids – Prism, Pyramid,
Cylinder and Cone.
Isometric Projections
Principles of Isometric projection – Isometric Scale, Isometric Views,
3 Conventions; Isometric Views of lines, Planes Simple and compound Solids; 6
Conversion of Isometric Views to Orthographic Views and Vice-versa,
Conversions.
Computer Graphics
Listing the computer technologies the impact on graphical communication,
Demonstration knowledge of the theory of CAD software [such as: The Menu
System, Tollbars (Standard, Object Properties, Draw, Modify and Dimension),
Drawing Area (Background, Crosshairs, Coordinate System), Dialog boxes and
windows, Shortcut menus (Button Bars), The Command Line (where applicable),
The Status Bar, Different methods of zoom as used in CAD, Select and erase
objects: Isometric Views of lines, Planes, Simple and compound Solids]; Set up
of the drawing page and the printer, including scale settings, Setting up of units
and drawing limits; ISO and ANSI standards for coordinate dimensioning and
tolerancing; Orthographic constraints, Snap to objects manually and
automatically; Producing drawings by using various coordinate input entry
4 methods to draw straight lines, Applying various ways of drawing circles: 8
Applying dimensions to objects, applying annotations to drawings; Setting up
and use of Layers, layers to create drawings, Create, edit and use customized
layers; Changing line lengths through modifying existing lines (extend/lengthen);
Printing documents to pater using the print command: orthographic projection
techniques; Drawing sectional views of composite right regular geometric solids
and project the true shape of the sectioned surface; Drawing annotation,
Computer-aided design (CAD) software modelling of parts and assemblies.
Parametric and non-parametric solid, surface, and wireframe models. Part editing
and two-dimensional documentation of models. Planar projection theory,
including sketching of perspective, isometric, Multiview, auxiliary, and section
views. Spatial visualization exercises Dimensioning guidelines, tolerancing
techniques; dimensioning and scale multi views of dwelling:
18
Department of Computer Science and Information Technology

Demonstration of a simple team design project

Geometry and topology of engineered components: creation of engineering
models and their presentation in standard 2D blueprint form and as 3D wire-
frame and shaded solids; meshed topologies for engineering analysis and tool-
path generation for component manufacture; geometric dimensioning and 8
5
tolerancing; Use of solid-modelling software for creating associative models at
the component and assembly levels; floor plans that include: windows, doors, and
fixtures such as WC, bath, sink, shower, etc. Applying colour coding according
to building drawing practice; Drawing sectional elevation showing foundation to
ceiling; Introduction to Building Information Modelling (BIM).
TOTAL 34

Course Outcomes:
1. Understanding of the visual aspects of engineering design.
2. Understanding of engineering graphics standards and solid modelling.
3. Effective communication through graphics.
4. Appling computer-aided geometric design.
5. Analysis of Isometric views and creating working drawings.

Recommended Books:
1. Bhatt N.D., Panchal V.M. & Ingle P.R. (2014), Engineering Drawing, Charotar Publishing
House.
2. Shah, M.B. & Rana B.C. (2008), Engineering Drawing and Computer Graphics, Pearson
Education.
3. Agrawal B. & Agrawal C.M. (2012), Engineering Graphics, TMH Publication.
4. Engineering Graphics & Design, A.P. Gautam & Pradeep Jain, Khanna Publishing House.
5. Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech
Publishers. (Corresponding set of) CAD Software Theory and User Manuals.

HUM101 Human Values & Ethics 3L:0T:0P NC

19
Department of Computer Science and Information Technology

Course Objectives:
1. To impart knowledge of values and self-development, personality and behavior development,
character and competence, human rights and legislative procedures.
2. To make students explore their talents, personality and competency.
3. To give students fundamental knowledge about human rights, Indian constitution,
Philosophy.
4. To make students learn about fundamental rights and duties, Legislature, Executive and
Judiciary, Constitution and function of parliament.
5. To make students aware about composition of council of states and house of people, Speaker,
Passing of bills, Vigilance, Lokpal and functionaries.

Unit Contents Hours

Course Introduction - Need, Basic Guidelines, Content and Process for
Value Education
Understanding the need, basic guidelines, Self-Exploration - its content and
process; ‘Natural Acceptance’ and Experiential Validation, Continuous Happiness
1 and Prosperity- Human Aspirations, Right understanding, Relationship and 5
Physical Facilities, Understanding Happiness and Prosperity correctly- A critical
appraisal of the current scenario.
Method to fulfill the above human aspirations: understanding and living in
harmony at various levels
Understanding Harmony in the Human Being - Harmony in Myself
Understanding human being as a co-existence of the sentient ‘I’ and the material
‘Body’ Understanding the needs of Self (‘I’) and ‘Body’ - Sukh and Suvidha
2 Understanding the Body as an instrument of ‘I’, Understanding the characteristics 5
and activities of ‘I’ and harmony in ‘I’ Understanding the harmony of I with the
Body: Sanyam and Swasthya; correct appraisal of Physical needs, meaning of
Prosperity in detail, Programs to ensure Sanyam and Swasthya.
Understanding Harmony in the Family and Society- Harmony in Human-
Human Relationship Understanding harmony in the Family, Understanding
values in human-human relationship; meaning of Nyaya and program for its
fulfillment to ensure Ubhay-tripti; Trust (Vishwas) and Respect (Samman) ,
meaning of Vishwas; Difference between intention and competence, meaning of
3 Samman, Difference between respect and differentiation; the other salient values 5
in relationship, harmony in the society , Samadhan, Samridhi, Abhay, Sah-astitva
as comprehensive Human Goals ,Visualizing a universal harmonious order in
society- Undivided Society (AkhandSamaj), Universal Order
(SarvabhaumVyawastha )- from family to world family.

Understanding Harmony in the Nature and Existence - Whole existence as

Coexistence Understanding the harmony in the Nature. Interconnectedness and
mutual fulfillment among the four orders of nature- recyclability and self-
4 5
regulation in nature. Understanding Existence as Co-existence (Sah-astitva) of
mutually interacting units in all pervasive Space. Holistic perception of harmony
at all levels of existence
Implications of the above Holistic Understanding of Harmony on
Professional Ethics. Natural acceptance of human values Definitiveness of
Ethical Human Conduct. Basis for Humanistic Education, Humanistic
5 Constitution and Humanistic Universal Order. Competence in Professional 5
Ethics: a) Ability to utilize the professional competence for augmenting universal
human order, b) Ability to identify the scope and characteristics of people-
20
Department of Computer Science and Information Technology

friendly and eco-friendly production systems, technologies and management

models. Strategy for transition from the present state to Universal Human Order:
At the level of individual: as socially and ecologically responsible engineers,
technologists and managers. Case studies related to values in professional life and
individual life.
TOTAL 25

Course Outcomes:
1. Realize the significance of ethical human conduct and self-development.
2. Inculcate positive thinking, dignity of labor and religious tolerance.
3. Adopt value based living and holistic technologies to save nature.
4. Create awareness, conviction & commitment to values for improving the quality of life
through education, and for advancing social and human wellbeing.
5. Sensitize the students as citizens so that the norms and values of human rights and duties
education program are realized.

Recommended Books:
1. Chakraborty, S.K., Values and Ethics for Organizations, Theory and Practice, Oxford
University Press, New Delhi, 2001.
2. Kapoor, S.K., Human rights under International Law and Indian Law, Prentice Hall of India,
New Delhi,2002.
3. Basu, D.D., Indian Constitution, Oxford University Press, New Delhi, 2002.
4. Frankena, W.K., Ethics, Prentice Hall of India, New Delhi, 1990.
5. Meron Theodor, Human Rights and International Law Legal Policy Issues, Vol. 1 and 2,
Oxford University Press, New Delhi, 2000.

II Semester
Common to all branches of UG Engineering & Technology

CHM201 Chemistry 3L:1T:2P 5

21
Department of Computer Science and Information Technology

Course Objectives:
1. To acquire knowledge and desalination of untreated water, determination and treatment of
municipal water.
2. To gain the knowledge of conducting polymers, rubbers and fiber reinforced plastics.
3. To understand and apply methods and appropriate technology to the study of Instrumental
Analysis.
4. To understand concept of conductivity, electrochemical cells, cell constant and its
determination.
5. To understand the concept of coal analysis and gain knowledge of applicability of Nano-
materials.

Unit Contents Hours

Water Analysis; Hardness of water, Techniques for water softening (Lime-soda,
Zeolite, Ion exchange resin and Reverse osmosis method).
1 8
Fuels: classification of fuels, Analysis of coal, Determination of calorific value
(Bomb calorimeter and Dulong’s methods).
Atomic and Molecular Structure:
Molecular orbital’s of diatomic molecules. Band theory of solids. Liquid crystal
2 and its applications. Point defects in solids. Structure and applications of 8
Graphite and Fullerenes. Concepts of Nanomaterials and its application.
Polymer: Basic concepts of polymer-Blend and composites, Conducting and
biodegradable polymers. Preparation and application of some industrially
3 important polymers (Buna-S, Buna-N, Neoprene, Nylon-6, nylon-6,6 and 8
Terylene). General methods of synthesis of organometallic compounds (Grignard
reagent) and their applications.
Electrochemistry: Nernst Equation, relation of EMF with thermodynamic
functions (ΔH, ΔF and Δ S). Lead storage battery.
4 8
Corrosion: Causes, effects and its prevention.
Phase Rule and its application to water system.
Spectroscopic techniques and Applications:
Elementary idea and simple applications of Rotational, Vibrational, Ultraviolet &
5 Visible and Raman spectroscopy. 8
Drugs : Introduction, Synthesis, properties and uses of Aspirin, Paracetamol
TOTAL 40

Course Outcomes:
1. Develop innovative methods to produce soft water for industrial use and potable water at
cheaper cost.
2. Apply their knowledge for protection of different metals from corrosion.
3. Gain the knowledge of coal analysis and various fuels.
4. Measure molecular/system properties such as surface tension, viscosity, conductance of
solution, chloride and iron content in water.
5. Gain the knowledge applicability of nano-materials.
Recommended Books:
1. ShashiChawla (2004), A Text Book of Engineering Chemistry, DhanpatRai Publishing Co.
2. S.S.Dara (2006), Engineering Chemistry, Chand & Co.
3. Jain and Jain (2006), Engineering Chemistry, DhanpatRai Publishing Co.
4. N. Krishnamurthy et. al ((20014), Engineering Chemistry, PHI Publishers.
5. Physical Chemistry By S. Glasstone
6. Polymer Chemistry By Fre W., Billmeyer
7. Engineering Chemistry By Satya Prakash
22
Department of Computer Science and Information Technology

Chemistry Lab
SUGGESTIVE LIST OF EXPERIMENTS:
1. Determination of alkalinity in the given water sample.
2. Determination of temporary and permanent hardness in water sample using EDTA.
3. Determination of iron content in the given solution by Mohr‟s method.
4. Determination of viscosity of given liquid.
5. Determination of surface tension of given liquid.
6. Determination of chloride content in water sample.
7. Determination of available chlorine in bleaching powder.
8. Determination of pH by pH-metric titration.
9. Preparation of Phenol-formaldehyde and Urea-formaldehyde resin.
10. Determination of Cell constant and conductance of a solution.
11. Determination of rate constant of hydrolysis of esters.
12. Verification of Beer’s law.

NOTE: Choice of any 08 experiments from the above.

MTM201 Mathematics-II 3L:1T:0P 4

Course Objectives:
1. Identify the type of a given differential equation and select and apply the appropriate
analytical technique for finding the solution of first order and selected higher order ordinary
differential equations.

23
Department of Computer Science and Information Technology

2. Evaluate first order differential equations including separable, homogeneous, exact, and
linear.
3. Solve linear systems of ordinary differential equations.
4. Solve differential equations using variation of parameters.

Unit Contents Hours

Ordinary Differential Equation of Higher Order:Linear differential equation

of nth order with constant coefficients, Simultaneous linear differential
1 equations, Second order linear differential equations with variable coefficients,
10
Solution by changing independent variable, Reduction of order, Normal form,
Method of variation of parameters, Cauchy-Euler equation, Series solutions
(Frobenius Method)..
Multivariable Calculus-II: Improper integrals, Beta & Gama function and their
2 properties, Dirichlet’s integral and its applications, Application of definite 6
integrals to evaluate surface areas and volume of revolutions.
Sequences and Series: Definition of Sequence and series with examples,
3 Convergence of sequence and series, Tests for convergence of series, (Ratio test,
12
D’ Alembert’s test, Raabe’s test). Fourier series, Half range Fourier sine and
cosine series.
Complex Variable – Differentiation: Limit, Continuity and differentiability,
4 Functions of complex variable, Analytic functions, Cauchy- Riemann equations
6
(Cartesian and Polar form), Harmonic function, Method to find Analytic
functions, Conformal mapping, Mobius transformation and their properties.
Complex Variable –Integration:Complex integrals, Contour integrals, Cauchy-
Goursat theorem, Cauchy integral formula, Taylor’s series, Laurent’s series,
5 Liouvilles’s theorem, Singularities, Classification of Singularities, zeros of 6
analytic functions, Residues, Methods of finding residues, Cauchy Residue
theorem, Evaluation of real integrals of the type.
TOTAL 40

Course Outcomes:
1. Use Laplace transforms to solve ordinary differential equations.
2. Understand the concept of differentiation and apply for solving differential equations.
3. Remember the concept of definite integral and apply for evaluating surface areas and
volumes.
4. Understand the concept of convergence of sequence and series. Also evaluate Fourier series.
5. Illustrate the working methods of complex functions and apply for finding analytic functions.
6. Apply the complex functions for finding Taylor’s series, Laurent’s series and evaluation of
definite integrals.
7. Solve higher order linear differential equations using reduction of order, undetermined
coefficients, or variation of parameters.

Recommended Books:
1. B. V. Ramana, Higher Engineering Mathematics, Tata McGraw-Hill Publishing Company
Ltd., 2008.
2. B. S. Grewal, Higher Engineering Mathematics, Khanna Publisher, 2005.

24
Department of Computer Science and Information Technology

3. R. K. Jain & S. R. K. Iyenger , Advance Engineering Mathematics , Narosa Publishing -

House, 2002.
4. E. Kreyszig, Advance Engineering Mathematics, John Wiley & Sons, 2005.
5. Maurice D. Weir, Joel Hass, Frank R.Giordano, Thomas, Calculus, Eleventh Edition,
Pearson.
6. D. Poole , Linear Algebra : A Modern Introduction, 2nd Edition, Brooks/Cole, 2005.
7. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.
8. Charles E Roberts Jr, Ordinary Diffrential Equations, Application, Model and Computing,
CRC Press T&F Group.
9. Ray Wylie C and Louis C Barret, Advanced Engineering Mathematics, 6 th Edition, Tata
McGraw-Hill.
10. James Ward Brown and Ruel V Churchill, Complex Variable and Applications, 8th Edition,
Tata McGraw-Hill.

CEM201 Basic Civil Engineering 3L:1T:2P 5

Course Objectives:
1. To make aware students about civil engineering.
2. To Ensure Relevance of civil engineering to individual
3. To ensure relevance of civil engineering to society.
4. To compare the knowledge of clesigmeng, estimating and methods of construction of days
and transportation.
5. To compare the knowledge of civil engineering selection with the environment and the
defiant procedures and treatment useful for society.

Unit Contents Hours

1 Introduction: Scope and Specialization of Civil Engineering, Role of civil 4
Engineer in Society, Impact of infrastructural development on economy of
country.
Surveying: Object, Principles & Types of Surveying; Site Plans, Plans&
Maps; Scales & Unit of different Measurements. Linear Measurements:
Instruments used. Linear Measurement by Tape, Ranging out Survey Lines
and overcoming Obstructions; Measurements on sloping ground; Tape
2 corrections, conventional symbols. Angular Measurements: Instruments 8
used; Introduction to Compass Surveying, Bearings and Longitude & Latitude
of a Line, Introduction to total station. Levelling: Instrument used, Object of
levelling, Methods of levelling in brief, Contour maps.
Buildings: Selection of site for Buildings, Layout of Building Plan, Types of
buildings, Plinth area, carpet area, floor space index, Introduction to building
3 byelaws, concept of sun light and ventilation. Components of Buildings & 6
their functions, Basic concept of R.C.C., Introduction to types of foundation.
4 Transportation: Introduction to Transportation Engineering; Traffic and 6
Road Safety: Types and Characteristics of Various Modes of Transportation;
Various Road Traffic Signs, Causes of Accidents and Road Safety Measures.

25
Department of Computer Science and Information Technology

Environmental Engineering: Environmental Pollution, Environmental Acts

and Regulations, Functional Concepts of Ecology, Basics of Species,
Biodiversity, Ecosystem, Hydrological Cycle; Chemical Cycles: Carbon,
5 Nitrogen& Phosphorus; Energy Flow in Eco-systems. Water Pollution: 8
Water Quality standards, Introduction to Treatment & Disposal of Waste
Water. Reuse and Saving of Water, Rain Water Harvesting.

Solid Waste Management: Classification of Solid Waste, Collection,

6 Transportation and Disposal of Solid. Recycling of Solid Waste: Energy
Recovery, Sanitary Land fill, On-Site Sanitation.
Air& Noise Pollution: Primary and Secondary air pollutants, Harmful effects
of Air Pollution, Control of Air Pollution. . Noise Pollution, Harmful Effects
8
of noise pollution, control of noise pollution, Global warming& Climate
Change, Ozone depletion, Green House effect.
TOTAL 40

Course Outcomes:
1. Be able to know the role of civil engineering in the development of country.
2. Be able to carry out the basics of surveying in feed. Like setting etc.
3. Be able to know the importance of civil engineering for the development of environment.

Recommended Books:
1. Dr. B.C Punimia - Basics of Civil Engineering.
2. Dr. S.S Bhavigati - Basics of Civil Engineering.
3. Dr. A.K Jain - Basic Civil engineering.

Basic Civil Engineering Lab.

SUGGESTIVE LIST OF EXPERIMENTS:
1. Linear Measurement by Tape:
a. Ranging and Fixing of Survey Station along straight line and across obstacles.
b. Laying perpendicular offset along the survey line
2. Compass Survey: Measurement of bearing of lines using Surveyor's and Prismatic compass.
3. Levelling: Using Tilting/ Dumpy/ Automatic Level
a. To determine the reduced levels in closed circuit.
b. To carry out profile levelling and plot longitudinal and cross sections for road by
Height of Instrument and Rise & Fall Method.
4. To study and take measurements using various electronic surveying instruments like EDM,
Total Station etc.
5. To determine pH, hardness and turbidity of the given sample of water.
6. To study various water supply Fittings.
7. To determine the pH and total solids of the given sample of sewage.
8. To study various Sanitary Fittings.

26
Department of Computer Science and Information Technology

MEM201 Workshop Practices 0L:0T:4P 2

Course Objectives:
1. To make students to acquire skills in basic engineering practice.
2. To make students to identify the hand tools and instruments.
3. To make students to acquire measuring skills.
4. To provide the knowledge of job materials in various shops.
5. Students are expected to recognize the importance of safety while dealing with electrical
equipment and mechanical hand tools and machines tools.

SUGGESTIVE LIST OF EXPERIMENTS:

1. T – Lap joint Carpentry Shop
2. Bridle joint Foundry Shop
3. Mould of any pattern
4. Casting of any simple pattern Welding Shop
5. Lap joint by gas welding
6. Butt joint by arc welding
7. Lap joint by arc welding
8. Demonstration of brazing, soldering & gas cutting Machine Shop Practice.
9. Job on lathe with one step turning and chamfering operations Fitting and Sheet Metal Shop.
10. Finishing of two sides of a square piece by filing.
11. Making mechanical joint and soldering of joint on sheet metal.
12. To cut a square notch using hacksaw and to drill a hole and tapping.

Course Outcomes:
1. Demonstrate and produce different types of fitting models.
2. Gain knowledge of development of sheet metal models with an understanding of their
applications.
3. Perform soldering and welding of different sheet metal & welded joints.
4. Students will attain the knowledge of job materials and measuring skills.
5. Students will be able to understand the importance of safety in industries.

Recommended Books:
1. Elements of Workshop Technology: Vol I: Manufacturing Processes, S K Hajra. Choudhury,
A K. Hajra Choudhury, 15th Edition Reprinted 2013, Media Promoters &Publishers Pvt Ltd.,
Mumbai.
2. Raghuwanshi B.S., Workshop Technology Vol. I & II, Dhanpath Rai & Sons.
3. Kannaiah P. and Narayana K.L., Workshop Manual, 2nd Edn, Scitech publishers.
4. John K.C., Mechanical Workshop Practice. 2nd Edn. PHI 2010.
5. Jeyapoovan T.and Pranitha S., Engineering Practices Lab Manual, 3rd Edn. Vikas Pub.2008.

HUM201 Professional English 3L:0T:2P 4

Course Objectives:
1. To impart knowledge of speech, verb and clauses.
2. To make students understand about report and paragraph making.
3. To impart knowledge of phrasal verbs and make them to communicate.
4. To make students learn about Indian literature.
5. To make students improve their vocabulary.

27
Department of Computer Science and Information Technology

Unit Contents Hours

Communication: Meaning, Importance and Cycle of Communication. Media
and Types of Communication. Verbal and Non-Verbal Communication.
Barriers to communication. Formal and Informal Channels of Communication
1 (Corporate Communication). Divisions of Human Communication and 5
Methods to improve Interpersonal Communication. Qualities of good
communication.
Grammar: Passive Voice. Reported Speech. Conditional Sentences. Modal
2 5
Verbs. Linking Words (Conjunctions)
Composition: Job Application and Curriculum-Vitae Writing. Business Letter
3 5
Writing. Paragraph Writing. Report Writing.
Short Stories: “Luncheon” by Somerset Maugham. “How Much Land Does a
4 Man Need?” by Count Leo Tolstoy. “The Night Train at Deoli” by Ruskin Bond. 5

Poems: “No Men are Foreign” by James Kirkup. “If” by Rudyard Kipling.
5 “Where the Mind is without Fear” by Rabindranath Tagore. 5

TOTAL 25

Course Outcomes:
1. Improve language proficiency in English.
2. Hone the LSRW skills within and beyond the classroom environment.
3. Integrate English language learning with employability skills.
4. In calculate the habit of speaking in English fluently with observation and practice.
5. Develop skills for creative writing.

Recommended Books:
1. Sasikumar, V., Dutta and Rajeevan, A Course in Listening and Speaking-I Foundation Books
2005.
2. Sawhney, Panja and Vermaeds, English at the Workplace, Macmillan 2003.
3. Singh, R.P., Professional Communication OUP2004.

English Language Lab.

PRACTICE
1. Phonetic Symbols and Transcriptions.
2. Extempore.
3. Group Discussion.
4. Dialogue Writing.
5. Listening comprehension

28
 Department of Computer Science and Information Technology

SEMESTER III

Practical
S. Course Course Hours Theory Marks
Marks Total Cr
No. Code Title
L T P IA ETE IA ETE
Object Oriented
1 CSC301 3 1 3 30 70 15 35 150 5.5
Programming

Computer Organization &

2 CSC302 3 1 2 30 70 15 35 150 5
Architecture

Data Structure &

3 CSC303 3 1 2 30 70 15 35 150 5
Algorithms
4 CSM301 Cyber Security 3 0 0 30 70 100* --

5 MTM301 Mathematics-III 3 1 0 30 70 - - 100 4

6 HUM301 Technical Communication 3 - - 30 70 - - 100 3

TOTAL 18 4 7 180 420 45 105 650 22.5

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits

CSC301 Object Oriented Programming 3L:1T:3P 5.5 Credits

29
Department of Computer Science and Information Technology

Unit Topics Lectures

Introduction: Object Oriented Programming and Concepts,

Features: Abstraction, Encapsulation, Information Hiding,
I Access Modifiers (public, protected, private), Polymorphism, 8
Overloading; Inheritance and container classes, Overriding
Methods, Abstract Classes.

Class: Class definition and objects creation, Accessing Class

Members: Variables and Methods, Default arguments,
II Constructor & Destructors. Inline function, Friend function. 8
Dynamic Memory Allocation, Static Class and Static Function,
this Pointer.

Polymorphism: Types of Polymorphism, function overloading

and operator overloading, Restrictions on Operator Overloading,
III 8
Operator Functions as Class Members versus Friend Functions,
Overloading operators: Unary Operators, Binary Operators.

Inheritance: Introduction, Types of Inheritance, Base Classes

and Derived Classes, Abstract base classes, Use of virtual
IV functions in classes, Pointer to derived class, Use of Protected 8
and Private Inheritance and Member Functions, Overriding Base
Class Members in a Derived Class.

File handling: Introduction, Creating sequential files, reading

and writing files, opening and closing of file, detecting the end
V 8
of file, Exception handling: Try-Catch-Throw Mechanism,
Templates: Function Templates, Class Template.

Reference Books:

1. Object Oriented Programming in Turbo C++ : Robert Lafore , 4th Ed., Pearson Education.
2. Object oriented Programming with C++:EBalagurusamy, 2001, TMH.
3. Computing Concepts with C++ Essentials: Horstmann, John Wiley.
4. Object Oriented Programming in C++ :Bhave, Pearson.
5. Programming with C++ : D Ravichandran, 2003, TMH.
6. The Complete Reference in C++ :Herbert Schildt, 2005, TMH.
7. Object Oriented Programming in C++, S.K.Pandey.
8. Mastering C++, K R Venugopal, TMH.

Course Outcomes:

1. Understand and Apply Object oriented features and C++ concepts.

30
Department of Computer Science and Information Technology

2. Apply the concept of polymorphism and inheritance.

3. Implement exception handling and templates.

4. Develop applications using Console I/O and File I/O.

OBJECT ORIENTED PROGRAMMING [Lab ]

C++ Programs
1. Programs based on inheritance property. [13]
2. Programs of operator overloading (complex number arithmetic, polar coordinates). [10]
3. Programs using friend functions. [13]
4. Programs on various matrix operations. [13]
5. Stack operations using OOPs concepts.[13]
6. To implement Tower of Hanoi problem.[13]
Course Outcomes:

1. To Understand and implement Object oriented features and C++ concepts.

2. Implementation of the concept of polymorphism and inheritance.

3. Implement exception handling and templates.

4. Develop applications using Console I/O and File I/O.

CSC302 Computer Organization and 3L:1T:2P 5 Credits

31
Department of Computer Science and Information Technology

Architecture

Unit Topics Lectures

Introduction to Computer Architecture and Organization. Von

Neuman Architecture, Flynn Classification. Register Transfer
and Micro operations: Register transfer language, Arithmetic
Micro-operations, Logic Micro-operations, Shift Micro-
I 8
operations, Bus and memory transfers. Computer Organization
and Design: Instruction cycle, computer registers, common bus
system, computer instructions, addressing modes, design of a
basic computer

Central Processing Unit: General register organization, stack

organization, Instruction formats, Data transfer and
manipulation, program control. RISC, CISC characteristics.
II 8
Pipeline and Vector processing: Pipeline structure, speedup,
efficiency, throughput and bottlenecks. Arithmetic pipeline and
Instruction pipeline

Computer Arithmetic: Adder, Ripple carry Adder, carry look

Ahead Adder, Multiplication: Add and Shift, Array multiplier
III and Booth Multiplier, Division: restoring and Non-restoring 8
Techniques. Floating Point Arithmetic: Floating point
representation, Add, Subtract, Multiplication, Division.

Memory Organization: RAM, ROM, Memory Hierarchy,

IV Organization, Associative memory, Cache memory, and Virtual 8
memory: Paging and Segmentation.

Input-Output Organization: Input-Output Interface, Modes of

V Transfer, Priority Interrupt, DMA, IOP processor. 8

Text /Reference Books:

1. G. Streetman, and S. K. Banerjee, “Solid State Electronic Devices,” 7th edition, Pearson,
2014.
2. D. Neamen , D. Biswas, "Semiconductor Physics and Devices," McGraw-Hill Education.
3. S. M. Sze and K. N. Kwok, “Physics of Semiconductor Devices, ” 3rd edition, John
Wiley&Sons, 2006.
4. C.T. Sah, “Fundamentals of Solid State Electronics,” World Scientific Publishing Co.
Inc, 1991.
5. Y. Tsividis and M. Colin, “Operation and Modeling of the MOS Transistor,” Oxford
univ.press, 2011.
6. Muhammad H. Rashid, “Electronic Devices and Circuits,” Cengage publication, 2014.
7.
Course Outcomes:
32
Department of Computer Science and Information Technology

At the end of this course students will demonstrate the ability to:
1. Understand the principles of semiconductor Physics.
2. Understand and utilize the mathematical models of semiconductor junctions.
3. Understand carrier transport in semiconductors and design resistors.
4. Utilize the mathematical models of MOS transistors for circuits and systems.
5. Analyse and find application of special purpose diodes.

SUGGESTIVE LIST OF EXPERIMENTS:

1. Study of Lab Equipment and Components: CRO, multi-meter, and function generator, power
supply- active, passive components and bread board.
2. P-N Junction diode: Characteristics of PN junction diode - static and dynamic resistance
measurement from graph.
3. Applications of PN Junction diode: Half & Full wave rectifier- Measurement of Vrms, Vdc,
and ripple factor.
4. Characteristics of Zener diode: V-I characteristics of Zener diode, graphical measurement of
forward and reverse resistance.
5. Characteristics of Photo diode: V-I characteristics of photo diode, graphical measurement of
forward and reverse resistance.
6. Characteristics of Solar cell: V-I characteristics of solar cell, graphical measurement of
forward and reverse resistance.
7. Application of Zener diode: Zener diode as voltage regulator. Measurement of percentage
regulation by varying load resistor.
8. Characteristic of BJT: BJT in CE configuration- graphical measurement of h-parameters
from input and output characteristics. Measurement of Av, AI, Ro and Ri of CE amplifier
with potential divider biasing.
9. Field Effect Transistors: Single stage common source FET amplifier –plot of gain in dB Vs
frequency, measurement of, bandwidth, input impedance, maximum signal handling capacity
(MSHC) of an amplifier.
10. Metal Oxide Semiconductor Field Effect Transistors: Single stage MOSFET amplifier –plot
of gain in dB Vs frequency, measurement of, bandwidth, input impedance, maximum signal
handling capacity (MSHC) of an amplifier.
11. Simulation of amplifier circuits studied in the lab using any available simulation software
and measurement of bandwidth and other parameters with the help of simulation software.

Course outcomes:

33
Department of Computer Science and Information Technology

At the end of this course students will demonstrate the ability to:
1. Understand working of basic electronics lab equipment.
2. Understand working of PN junction diode and its applications.
3. Understand characteristics of Zener diode.
4. Design a voltage regulator using Zener diode.
5. Understand working of BJT, FET, MOSFET and apply the concept in designing of
amplifiers.

34
Department of Computer Science and Information Technology

CSC303 Data Structures and Algorithms 3L:1T:2P 5 Credits

Unit Topics Lectures

Definition & characteristics of algorithms, structures.

Difficulties in estimating exact execution time of algorithms.
Concept of complexity of program. Asymptotic notations: Big-
Oh, theta, Omega- Definitions and examples, Determination of
I time and space complexity of simple algorithms without 8
recursion. Representing a function in asymptotic notations viz
5n2 -6n=θ(n2 ) Arrays: Array as storage element, Row major &
column major form of arrays, computation of address of
elements of n dimensional array.

Arrays as storage elements for representing polynomial of one or

more degrees for addition & multiplication, sparse matrices for
transposing & multiplication, stack, queue, dequeue, circular
queue for insertion and deletion with condition for over and
underflow, transposition of sparse matrices with algorithms of
varying complexity (Includes algorithms for operations as
mentioned). Evaluation of Expression: Concept of precedence
II and associativity in expressions, difficulties in dealing with infix 8
expressions, Resolving precedence of operators and association
of operands, postfix & prefix expressions, conversion of
expression from one form to other form using stack (with &
without parenthesis), Evaluation of expression in infix, postfix &
prefix forms using stack. Recursion.

Linear linked lists: singly, doubly and circularly connected linear

linked listsinsertion, deletion at/ from beginning and any point in
ordered or unordered lists. Comparison of arrays and linked lists
as data structures. Linked implementation of stack, queue and
dequeue. Algorithms for of insertion, deletion and traversal of
III stack, queue, dequeue implemented using linked structures. 8
Polynomial representation using linked lists for addition,
Concepts of Head Node in linked lists. Searching: Sequential
and binary search

IV Non-Linear Structures: Trees definition, characteristics concept 8

of child, sibling, parent child relationship etc, binary tree:
different types of binary trees based on distribution of nodes,
binary tree (threaded and unthreaded) as data structure, Class: III
Sem. B.Tech. Evaluation Branch: Computer Science and

35
Department of Computer Science and Information Technology

Engineering Schedule per Week Lectures: 3 Examination Time

= Three (3) Hours Maximum Marks = 100 [Mid-term (20) &
End-term (80)] B.Tech. CS Syllabus as submitted to 15th
Academic council Date- 07/10/2015 3 insertion, deletion and
traversal of binary trees, constructing binary tree from traversal
results. Threaded binary Tree. Time complexity of insertion,
deletion and traversal in threaded and ordinary binary trees.
AVL tree: Concept of balanced trees, balance factor in AVL
trees, insertion into and deletion from AVL tree, balancing AVL
tree after insertion and deletion. Application of trees for
representation of sets.

Graphs: Definition, Relation between tree & graph, directed and

undirected graph, representation of graphs using adjacency
matrix and list. Depth first and breadth first traversal of graphs,
finding connected components and spanning tree. Single source
V 8
single destination shortest path algorithms. Sorting: Insertion,
quick, heap, topological and bubble sorting algorithms for
different characteristics of input data. Comparison of sorting
algorithms in term of time complexity.

RECOMMENDED BOOKS

1. Design And Analysis of Computer Algorithm,Aho,Pearson

2. Data Structure through C in Depth,Srivastava S. K.,BPB
3. Data Structure using C, Radhakrishanan,BPB
4. Expert Data Structure with C, Patel R. B., Khanna Book Publishing
5. Data Structure using C & C++ ,langsman,Augenstein& tenanbaum,2nd ed. ,PHI
6. Aaron M. Tenenbaum, YedidyahLangsam and Moshe J. Augenstein “Data Structures Using
C and C++” , PHI
7. Horowitz and Sahani, “Fundamentals of Data Structures”, Galgotia Publication

Course Outcomes:

1. Explain fundamental concepts of Data structures, space complexity and time complexity.
2. Design linear data structures stacks, queues and linked lists.
3. Design non linear data structures trees and Graphs, and implement their operations.
4. Apply appropriate data structure for a given application.
5. Implement different searching and sorting techniques. Compare different searching and sorting
techniques.

36
Department of Computer Science and Information Technology

DATA STRUCTURES AND ALOGITHMS [Lab]

1. Program on arrays, searching, sorting (Bubble sort, Selection sort, Insertion sort, Marge sort
etc.)[6]

2. Program to insert element at desire position, replacing element, deletion in array. [6]

3. Various matrices operations. [5]

4. Various strings programs.[5]

5. Implementation of stack and queue using array[5]

6. Implementation of stack and queue using link lists[5]

7. Implementation of circular queue using link lists.[5]

8. Polynomial addition, multiplication.[2]

9. Two-way link lists programs.[4]

10. Infix to postfix/prefix conversion.[4]

11. BST implementation (addition, deletion, searching).[4]

12. Graph traversal (BFS, DFS).[4]

Course Outcomes:

1. To implement linear data structures stacks, queues and linked lists.

2. To implement nonlinear data structures trees and Graphs, and implement their operations.
3. To implement appropriate data structure for a given application.
4. To Implement different searching and sorting techniques. Compare different searching and sorting
techniques.

37
Department of Computer Science and Information Technology

CSM301 Cyber Security 3L-0T-0P 0

UNIT TOPICS LECTURES

Introduction to Cyber Security :
Overview of Cyber Security, Internet Governance – Challenges
I and Constraints, Cyber Threats:- Cyber Warfare-Cyber Crime- 8
Cyber terrorism-Cyber Espionage, Need for a Comprehensive
Cyber Security Policy, Need for a Nodal Authority, Need for an
International convention on Cyberspace.
Cyber Security Vulnerabilities and Cyber Security
Safeguards :
Cyber Security Vulnerabilities-Overview, vulnerabilities in
software, System administration, Complex Network
Architectures, Open Access to Organizational Data, Weak
II 8
Authentication, Unprotected Broadband communications, Poor
Cyber Security Awareness. Cyber Security Safeguards-
Overview, Access control, Audit, Authentication, Biometrics,
Cryptography, Deception, Denial of Service Filters, Ethical
Hacking, Firewalls, Intrusion Detection Systems, Response,
Scanning, Security policy, Threat Management.
Securing Web Application, Services and Servers :
Introduction, Basic security for HTTP Applications and
III Services, Basic Security for SOAP Services, Identity 8
Management and Web Services, Authorization Patterns,
Security Considerations, Challenges.
Intrusion Detection and Prevention :
Intrusion, Physical Theft, Abuse of Privileges, Unauthorized
Access by Outsider, Malware infection, Intrusion detection and
IV Prevention Techniques, Anti-Malware software, Network based 7
Intrusion detection Systems, Network based Intrusion
Prevention Systems, Host based Intrusion prevention Systems,
Security Information Management, Network Session Analysis,
System Integrity Validation.
Cryptography and Network Security :
Introduction to Cryptography, Symmetric key Cryptography,
Asymmetric key Cryptography, Message Authentication,
Digital Signatures, Applications of Cryptography. Overview of
V Firewalls- Types of Firewalls, User Management, VPN 7
Security Security Protocols: - security at the Application
Layer- PGP and S/MIME, Security at Transport Layer- SSL
and TLS, Security at Network Layer-IPSec.

Course Outcomes:
1. Discuss the basics of Cyber security .
2. Illustrate the legal, ethical and professional issues in information security.
3. Demonstrate the aspects of risk management.
4. Become aware of various standards in the Information Security System.
38
Department of Computer Science and Information Technology

Design and implementation of Security Techniques.

Recommended Books:
1. Charles P. Pfleeger, Shari Lawerance Pfleeger, “Analysing Computer Security ”, Pearson
Education India.
2. V.K. Pachghare, “Cryptography and information Security”, PHI Learning Private Limited, Delhi
India.
3. Dr. Surya Prakash Tripathi, Ritendra Goyal, Praveen kumar Shukla ,”Introduction to
Information Security and Cyber Law” Willey Dreamtech Press.
4. Schou, Shoemaker, “Information Assurance for the Enterprise”, Tata McGraw Hill.
5. CHANDER, HARISH,” Cyber Laws And It Protection ” , PHI Learning Private
Limited ,Delhi ,India

MTM301 Mathematics III 3L:1T:0P 4

39
Department of Computer Science and Information Technology

Course Objectives:
1. To study basic property of the Laplace Transforms. 
2. To study of application of Laplace transforms in solution of ordinary differential equation. 
3. To make the students familiar with the basic statistical concepts and tools which are needed
to study situations involving uncertainty or randomness.
4. The course intends to render the students to several examples and exercises that blend their
everyday experiences with their scientific interests.

Unit Contents Hours

Transform Calculus: Introduction of Laplace Transform, Properties of
Laplace Transform, Periodic functions. Finding inverse Laplace transform by
1 different methods, convolution theorem. 8
Fourier series: Fourier Series for Continuous Functions, Half range sine and
cosine series. Series solution.
Partial Differential Equation: Introduction, Linear partial differential
equation of first order, Non Linear partial differential equation of first order,
2 Linear partial differential equation of second and higher order of 10
homogeneous form, Non-Linear partial differential equation of second and
higher order of homogeneous form, separation of variable
Numerical Methods I : Solution of polynomial and transcendental equations
– Bisection method, Newton-Raphson method and Regula-Falsi method.
3. Finite differences, Relation between operators, Interpolation using Newton’s 8
forward and backward difference formulae. Interpolation with unequal
intervals: Newton’s divided difference and Lagrange’s formulae.
Numerical Methods II: Numerical Differentiation, Numerical integration:
Trapezoidal rule and Simpson’s 1/3rd and 3/8 rules. Ordinary differential
4. equations: Taylor’s series, Euler and modified Euler’s methods. Runge-Kutta 8
method of fourth order for solving first and second order equations. Milne’s
predicator and corrector methods.
Basic Statistics: Measures of Central tendency: Moments, skewness and
5. Kurtosis - Probability distributions: Binomial, Poisson and Normal -
6
evaluation of statistical parameters for these three distributions, Correlation
and regression – Rank correlation.
TOTAL 40

Course Learning Outcomes: This course will enable the students to:
1. Use the appropriate shift theorems in finding Laplace and inverse Laplace transforms. 
2. Select and combine the necessary Laplace transform techniques to solve second-order
ordinary differential equations.
3. Understand the classification of partial differential equation in three independent variables.
4. Sketch curves in a plane using its mathematical properties in the different coordinate
systems of reference.
5. Compute area of surfaces of revolution and the volume of solids by integrating over cross-
sectional areas.
6. How to translate real-world problems into probability models.
40
Department of Computer Science and Information Technology

Text /Reference Books:

1. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006..
2. Ian N. Sneddon, Elements of Partial Differential Equations, McGraw-Hill Book Comp.,1988.
3. P. Kandasamy, K. Thilagavathy, K. Gunavathi, Numerical Methods, S. Chand & Company,
2nd Edition, Reprint 2012.
4. S.S. Sastry, Introductory methods of numerical analysis, PHI, 4th Edition, 2005.
5. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 35th Edition, 2010.
6. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2010.
7. Veerarajan T., Engineering Mathematics (for semester III), Tata McGraw-Hill, New Delhi,
2010.

HUM301 Technical Communication 2L:0T:0P 2

41
Department of Computer Science and Information Technology

Unit Topics Lectures

Information Design and Development- Different kinds of
technical documents, Information development life cycle,
Organization structures, factors affecting information and document
I design, Strategies for organization, Information design and writing 6
for print

and for online media.

Technical Writing, Grammar and Editing- Technical writing

process, forms of discourse, writing drafts and revising,
Collaborative writing, creating indexes, technical writing style and
language. Basics of grammar, study of advanced grammar, editing
II 6
strategies to achieve appropriate technical style. Introduction to
advanced technical communication, Usability, Hunan factors,
Managing technical communication projects, time estimation, Single
sourcing, Localization.

Self-Development and Assessment- Self assessment, Awareness,

Perception and Attitudes, Values and belief, Personal goal setting,
III 8
career planning, Self-esteem. Managing Time; Personal memory,
Rapid reading, taking notes; Complex problem solving; Creativity

Communication and Technical Writing- Public speaking, Group

discussion, Oral; presentation, Interviews, Graphic presentation,
Presentation aids, Personality Development. Writing reports, project
IV proposals, brochures, newsletters, technical articles, manuals, 8
official

notes, business letters, memos, progress reports, minutes of

meetings, event report.

Ethics- Business ethics, Etiquettes in social and office settings,

Email etiquettes, Telephone Etiquettes, engineering ethics,
V managing time, Role and responsibility of engineer, Work culture in 8
jobs, Personal memory, Rapid reading, taking notes, Complex
problem solving, Creativity.

Course Outcomes:
1. Gain an overview of the technical skills required by professional communicators.
2. Learn the methodology for planning technical communication projects.
3. Understand and know when and how to use appropriate writing and formatting conventions.
4. Learn how to use industry-standard software to produce a project such as a manual.
5. Understand the writer’s role in the team approach to technical communication projects.
6. Be familiar with key trends and issues in the field of technical communication
Recommended Books:
42
 Department of Computer Science and Information Technology

1. David F. Beer and David McMurrey, Guide to writing as an Engineer, John Willey. NewYork,
2004
2. Diane Hacker, Pocket Style Manual, Bedford Publication, New York, 2003. (ISBN
0312406843)
3. Shiv Khera, You Can Win, Macmillan Books, New York, 2003.
4. Raman Sharma, Technical Communications, Oxford Publication, London, 2004.
5. Dale Jungk, Applied Writing for Technicians, McGraw Hill, New York, 2004. (ISBN:
07828357-4)
6. Sharma, R. and Mohan, K. Business Correspondence and Report Writing, TMH New Delhi
2002.
7. Xebec, Presentation Book, TMH New Delhi, 2000. (ISBN 0402213)

SEMESTER IV

Theory Marks Practical Total

S. Course Course Hours
Marks Cr
No. Code Title
L T P IA ETE IA ETE

1. CSC401 Programming in Java 3 1 3 30 70 15 35 150 5.5

Design and Analysis

2. CSC402 3 1 2 30 70 15 35 150 5
Algorithms

43
 Department of Computer Science and Information Technology

Database Management
3. CSC403 3 1 2 30 70 15 35 150 5
System

4. CSC404 System Programming 3 1 0 30 70 - - 100 4

5. BTM401 Biology for Engineers 3 0 0 30 70 - - 100 3

6. BTM402 Environmental Science 2 0 0 30 70 - - 100* --

TOTAL 17 4 7 180 420 45 105 650 22.5

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits

CSC401 Programming in Java 3L:1T:3P 5.5 Credits

Unit Topics Lectures

I Introduction: Basic concepts of OOPS in java Introduction of 8

Java, Features of Java, Data Types, operations & Expressions,
Control Structures, arrays, Class, Objects& methods, Access
Specifiers, constructors, Type casting, Garbage collection, string

44
Department of Computer Science and Information Technology

handling-string operations, character Extraction, string

comparison, searching and modifying string, String Buffers,
Wrapper classes.

Inheritance: single and multilevel inheritance, method

overriding, abstract class, use of super and final keyword, this
keyword, static methods and classes. Package: user-defined
II packages, explicit & implicit import statement. Interfaces: 8
creating an interface, using an interface, extending an interface.

Exception Handling: introduction types & classes hierarchy,

Uncaught exception, multiple catch clauses, nested try statement,
built-in exceptions, creating your own exception.

Multithreading: Process& threads, java thread model, creating

III 8
multiple threads, thread priority, synchronization, inter-thread
communication, Suspending, Resuming, Stopping.

I/O Streams: console i/o-reading & writing From console; File

i/o- Byte stream, character stream

Applets: Local & remote applets, Architecture , Passing

Parameters AWT & Event Handling: Window fundamental ,
IV Working with graphics, Working with color & fonts, AWT 8
controls, layout managers, menu, Event handling & Adapter
Class; Swing Classes

Servelets: Introduction, servelet container, life cycle, interface,

generic servelt class, HTTP Servelet classes, get& set methods,
V Parameter passing to servelet. 8
JDBC: Introduction, database connectivity, Application
Architecture, Working with ResultSet.

Course Outcomes:

1. Read and understand Java-based software code of medium-to-high complexity.

2. Use standard and third party Java's API’s when writing applications.
3. Understand the basic principles of creating Java applications with graphical user interface
(GUI).
4. Create rich user-interface applications using modern API’s such as JAVAFX.
5. Understand the fundamental concepts of computer science: structure of the computational
process, algorithms and complexity of computation.

Text Books:
45
Department of Computer Science and Information Technology

1.Introduction to java programming, Liang Y.Daniel,2009,PearsonEduction

2.Thinking In Java, Bruce Eckel, Prentice Hall
Reference books:
1. Head First java, kathy Sierra & Bert Bates, o’reilly publication
2. Internet & JAVA programming,R.Krishnamoorthy&S.Prabhu
3.Programming with Java –E. Balaguruswami, TMH
4. A Programmer’s guide to Java Certification,Mughal K.A., Rasmussen R. W.,
Addison-Wesley,2000
 
LAB Programming in Java

1. Convert String to byte array and vice versa in java. [8]

2. Convert string lowercase to uppercase and vice versa without using library function
3. in java. [7]
4. Java program to convert given number of seconds to hours, minutes and second. [7]
5. Java program to find second largest element in an array.[7]
6. Java program to find second smallest element in an array. [7]
7. Java program to find smallest element in an array. [7]
8. Java program to swap first and last character of each word in a string. [7]
9. Java program to traverse all files of a directory/folder. [7]
10. Java program to check whether a given number is palindrome or not using class. [7]

Course Outcomes:

1. To understand and implement Java-based software code of medium-to-high complexity.

2. To implement Use standard and third party Java's API’s when writing applications.
3. To implement Java applications with graphical user interface
(GUI).
4. To Implement Create rich user-interface applications using modern API’s such as
JAVAFX.
5. Understand the fundamental concepts of computer science: structure of the computational
process, algorithms and complexity of computation.

CSC402 Design and Analysis of Algorithms 3L:1T:2P 5 Credits

Unit Topics Lectures

I Definition & characteristics of algorithms, structures. 8

Difficulties in estimating exact execution time of algorithms.
Concept of complexity of program. Asymptotic notations: Big-
Oh, theta, Omega- Definitions and examples, Determination of
time and space complexity of simple algorithms without

46
Department of Computer Science and Information Technology

recursion. Representing a function in asymptotic notations viz

5n2 -6n=θ(n2 ) Arrays: Array as storage element, Row major &
column major form of arrays, computation of address of
elements of n dimensional array.

Arrays as storage elements for representing polynomial of one or

more degrees for addition & multiplication, sparse matrices for
transposing & multiplication, stack, queue, dequeue, circular
queue for insertion and deletion with condition for over and
underflow, transposition of sparse matrices with algorithms of
varying complexity (Includes algorithms for operations as
II mentioned). Evaluation of Expression: Concept of precedence 8
and associativity in expressions, difficulties in dealing with infix
expressions, Resolving precedence of operators and association
of operands, postfix & prefix expressions, conversion of
expression from one form to other form using stack (with &
without parenthesis), Evaluation of expression in infix, postfix &
prefix forms using stack. Recursion.

Linear linked lists: singly, doubly and circularly connected linear

linked listsinsertion, deletion at/ from beginning and any point in
ordered or unordered lists. Comparison of arrays and linked lists
as data structures. Linked implementation of stack, queue and
III dequeue. Algorithms for of insertion, deletion and traversal of 8
stack, queue, dequeue implemented using linked structures.
Polynomial representation using linked lists for addition,
Concepts of Head Node in linked lists. Searching: Sequential
and binary search

Non-Linear Structures: Trees definition, characteristics concept

of child, sibling, parent child relationship etc, binary tree:
different types of binary trees based on distribution of nodes,
binary tree (threaded and unthreaded) as data structure, Class: III
Sem. B.Tech. Evaluation Branch: Computer Science and
Engineering Schedule per Week Lectures: 3 Examination Time
= Three (3) Hours Maximum Marks = 100 [Mid-term (20) &
End-term (80)] B.Tech. CS Syllabus as submitted to 15th
IV 8
Academic council Date- 07/10/2015 3 insertion, deletion and
traversal of binary trees, constructing binary tree from traversal
results. Threaded binary Tree. Time complexity of insertion,
deletion and traversal in threaded and ordinary binary trees.
AVL tree: Concept of balanced trees, balance factor in AVL
trees, insertion into and deletion from AVL tree, balancing AVL
tree after insertion and deletion. Application of trees for
representation of sets.

V Graphs: Definition, Relation between tree & graph, directed and 8

47
Department of Computer Science and Information Technology

undirected graph, representation of graphs using adjacency

matrix and list. Depth first and breadth first traversal of graphs,
finding connected components and spanning tree. Single source
single destination shortest path algorithms. Sorting: Insertion,
quick, heap, topological and bubble sorting algorithms for
different characteristics of input data. Comparison of sorting
algorithms in term of time complexity.

Text/References Books :

1. An introduction to data structures with applications By Jean-Paul Tremblay, P. G. Sorenson, TMH

2. Data Structures in C/C++, Horowitz, Sawhney, Galgotia

3. Data Structures in C/C++, Tanenbaum, Pearson

4. Data Structures in C++, Weiss, Parson

Course Outcomes:

1. Explain fundamental concepts of asymptotic notations of an algorithm divide and conquer

techniques.

2. Know various design and analysis techniques such as greedy algorithms, dynamic programming.

3. Understand the techniques used for designing of different graph algorithms.

4. Apply backtracking, branch and bound techniques for real time problems.

5. Know the concepts of P, NP and NP-Complete problems

DESIGN AND ANALYSIS OF ALGORITHMS [Lab]

Programming assignments on each algorithmic strategy:

1. Divide and conquer method (quick sort, merge sort, Strassen’s matrix multiplication),[8]

2. Greedy method (knapsack problem, job sequencing, optimal merge patterns, minimal spanning
trees).[8]

3. Dynamic programming (multistage graphs, OBST, 0/1 knapsack, traveling salesperson problem).
[7]

4. Back tracking (n-queens problem, graph coloring problem, Hamiltonian cycles).[7]

5. Sorting: Insertion sort, Heap sort, Bubble sort[7]

6. Searching: Sequential and Binary Search[7]

7. Selection: Minimum/ Maximum, Kth smallest element[7]

Course Outcomes:

1.To implement the techniques used for designing of different graph algorithms.
48
Department of Computer Science and Information Technology

2. Apply backtracking, branch and bound techniques for real time problems.

3. prove the correctness and analyze the running time of the basic algorithms for those classic
problems in various domains;

4. To apply the algorithms and design techniques to solve problems;

5. To implement analyze the complexities of various problems in different domains.

CSC403 Database Management Systems 3L:1T:2P 5 Credits

Unit Topics Lectures

INTRODUCTION TO DATABASE SYSTEMS: Overview

and History of DBMS. File System v/s DBMS .Advantage of
I 8
DBMS Describing and Storing Data in a DBMS. Queries in
DBMS. Structure of a DBMS.

49
Department of Computer Science and Information Technology

ENTITY RELATIONSHIP MODEL: Overview of Data Design

Entities, Attributes and Entity Sets, Relationship and Relationship
Sets. Features of the ER Model- Key Constraints, Participation
Constraints, Weak Entities, Class Hierarchies, Aggregation,
II 8
Conceptual Data Base, Design with ER Model-Entity v/s Attribute,
Entity vs Relationship Binary vs Ternary Relationship and
Aggregation v/s ternary Relationship Conceptual Design for a Large
Enterprise.

RELATIONSHIP ALGEBRA AND CALCULUS: Relationship

Algebra Selection and Projection, Set Operations, Renaming, Joints,
III 8
Division, Relation Calculus, Expressive Power of Algebra and
Calculus.

SQL QUERIES PROGRAMMING AND TRIGGERS: The

Forms of a Basic SQL Query, Union, Intersection and Except,
Nested Queries ,Correlated Nested Queries, Set-Comparison
IV 8
Operations, Aggregate Operators, Null Values and Embedded
SQL, Dynamic SQL, ODBC and JDBC, Triggers and Active
Databases.

SCHEMA REFINEMENT AND NORMAL FORMS:

Introductions to Schema Refinement, Functional Dependencies,
V Boyce-Codd Normal Forms, Third Normal Form, 8
Normalization-Decomposition into BCNF Decomposition into
3-NF.

Course Outcomes:

1. Understand DBMS concepts, data models and Architecture.

2. Use SQL for database management.

3. Understand ER concepts and ER mapping to relational model

4. Apply the concepts of relational algebra and calculus.

5. Apply normalization process to construct the data base.

RECOMMENDED BOOKS:

1. Date C J, “ An Introduction to Database Systems”, Addision Wesley

2. Korth, Silbertz, Sudarshan,” Database Concepts”, McGraw Hill
3. Elmasri, Navathe, “ Fudamentals of Database Systems”, Addision Wesley
4. O’Neil, Databases, Elsevier Pub.
5. Leon &Leon,”Database Management Systems”, Vikas Publishing House

50
Department of Computer Science and Information Technology

6. Bipin C. Desai, “ An Introduction to Database Systems”, Gagotia Publications

7. Majumdar& Bhattacharya, “Database Management System”, TMH
8. Ramkrishnan, Gehrke, “ Database Management System”, McGraw Hill

DATA BASE MANAGEMENT SYSTEMS [Lab]

Student can use MySql (preferred open source1356 DBMS) or any other Commercial DBMS tool
(MS-Access / ORACLE) at backend and C++ (preferred) VB/JAVA at front end.
1. (a) Write a C++ program to store students records (roll no, name, father name) of a class using
file handling. (Using C++ and File handling).

(b) Re-write program 1, using any DBMS and any compatible language.(C++/MySQL) (VB and
MS-Access)[8]

2. Database creation/ deletion, table creation/ deletion.

(a) Write a program to take a string as input from user. Create a database of same name. Now
ask user to input two more string, create two tables of these names in above database.

(b) Write a program, which ask user to enter database name and table name to delete. If database
exist and table exist then delete that table.[8]

3. Write a program, which ask user to enter a valid SQL query and display the result of that query.
[7]

4. Write a program in C++ to parse the user entered query and check the validity of query.[7]

(Only SELECT query with WHERE clause)

5. Create a database db1, having two tables t1 (id, name, age) and t2 (id, subject, marks).[7]

(a) Write a query to display name and age of given id (id should be asked as input).

(b) Write a query to display average age of all students.

(c) Write a query to display mark-sheet of any student (whose id is given as input).

(d) Display list of all students sorted by the total marks in all subjects.

6. Design a Loan Approval and Repayment System to handle Customer's Application for Loan and
handle loan repayments by depositing installments and reducing balances.[7]

7. Design a Video Library Management System for managing issue and return of Video tapes/CD
and manage customer's queries.[7]
Course Outcomes:

1. To implement and understand basic and advanced SQL commands.

2. Use SQL for database management.

51
Department of Computer Science and Information Technology

3. To implement and understand ER concepts and ER mapping to relational model

4. Apply the concepts of relational algebra and calculus.

5. Apply normalization process to construct the data base.

CSC404 System Programing 3L:1T:0P 4

Objective:
Deals with the design of programs that work on the low level abstraction of the computer, which is the task of
a computer engineer.

Unit Topics Lectures

Overview: Comparison of machine language, assembly language and high level
languages, External and internal representation of instructions and data. Data
I allocation structures, search structures and addressing modes. Activities and 9
system software for program generation, translation and execution. Editors for
source code and Object code/executable code files

Assemblers: Assembly language specification. Machine dependent and

II independent features of assembler.Classification of assemblers. Pass structure of 8
assemblers (problem and associated for IBM-PC.
Loader and Linkers: Functions and classification. Machine dependent and
III independent features of loaders, Design of bootstrap, absolute and relocatable 4
loaders, Design of linker. Case study of MS-DOS linker.
Macro processors: Macro definition, call and expansion. Macro processor
IV algorithm and data structure.Machine independent features (parameters, unique 5
labels, conditional expansion, nesting and recursion).Pass structure and design of
microprocessor and macro assembler, Case study of MASM macro processor.
High level language processor: HLL specification: Grammars and parse trees,
expression and precedence. Lexical analysis: Classification of tokens, scanning
methods, character recognition, lexical ambiguity. Syntactic analysis: Operator
V 7
precedence parsing, recursive descent parsing. Symbol Table Management: Data
structure for symbol table, basing functions for symbols, overflow technique,
block structure in symbol table

Course Outcomes:

1.Work effectively in a UNIX-style environment.

2. Explain the basic operations that are performed from the time a computer is turned on until a user
is able to execute programs.

3.Write medium to large C/C++ programs for a range of applications.

4.Use systems tools for C/C++ programming. To write C/C++ programs that use the UNIX system
52
Department of Computer Science and Information Technology

call interface.

5.Write small to medium size scripts, in various scripting languages, for a range of applications.

Recommended Books

1.System Software & Operating System by Dhamdhare

2.System Software by Donovan

BTM401 Biology for Engineers 3L:0T:0P 3

Unit Topics Lectures

I Introduction, Classification & Genetics: Bring out the fundamental 9
differences between science and engineering by drawing a comparison

53
Department of Computer Science and Information Technology

between eye and camera, Bird flying and aircraft. Mention the most
exciting aspect of biology as an independent scientific discipline. Why we
need to study biology? Discuss how biological observations of 18th
Century that lead to major discoveries. Examples from Brownian motion
and the origin of thermodynamics by referring to the original observation
of Robert Brown and Julius Mayor. These examples will highlight the
fundamental importance of observations in any scientific inquiry.
Hierarchy of life forms at phenomenological level. A common thread
weaves this hierarchy Classification. Discuss classification based on (a)
cellularity- Unicellular or multicellular (b) ultrastructure- prokaryotes or
eucaryotes. (c) energy and Carbon utilization -Autotrophs, heterotrophs,
lithotropes (d) Ammonia excretion – aminotelic, uricoteliec, ureotelic (e)
Habitata- acquatic or terrestrial (e) Molecular taxonomy- three major
kingdoms of life. A given organism can come under different category
based on classification. Model organisms for the study of biology come
from different groups. E.coli, S.cerevisiae, D. Melanogaster, C. elegance,
A. Thaliana, M. musculus. Mendel’s laws, Concept of segregation and
independent assortment. Concept of allele. Gene mapping, Gene
interaction, Epistasis. Meiosis and Mitosis be taught as a part of genetics.
Emphasis to be give not to the mechanics of cell division nor the phases
but how genetic material passes from parent to offspring. Concepts of
recessiveness and dominance. Concept of mapping of phenotype to genes.
Discuss about the single gene disorders in humans. Discuss the concept of
complementation using human genetics

Biomolecules & Enzymes: Molecules of life. In this context discuss

monomeric units and polymeric structures. Discuss about sugars, starch
and cellulose. Amino acids and proteins. Nucleotides and DNA/RNA. Two
carbon units and lipids. Enzymology: How to monitor enzyme catalyzed
II 8
reactions. How does an enzyme catalyzereactions. Enzyme classification.
Mechanism of enzyme action. Discuss at least two examples. Enzyme
kinetics and kinetic parameters. Why should we know these parameters to
understand biology? RNA catalysis

Information Transfer: Proteins- structure and function. Hierarch in

III protein structure. Primary secondary, tertiary and quaternary structure. 4
Proteins as enzymes, transporters, receptors and structural elements

Macromolecular analysis: Proteins- structure and function. Hierarch in

IV protein structure. Primary secondary, tertiary and quaternary structure. 5
Proteins as enzymes, transporters, receptors and structural elements.

V Metabolism & Microbiology: biological world. Thermodynamics as 7

applied to biological systems. Exothermic and endothermic versus
endergonic and exergoinc reactions. Concept of Keq and its relation to
standard free energy. Spontaneity. ATP as an energy currency. This should
include the breakdown of glucose to CO2 + H2O (Glycolysis and Krebs

54
Department of Computer Science and Information Technology

cycle) and synthesis of glucose from CO2 and H2O (Photosynthesis).

Energy yielding and energy consuming reactions. Concept of Energy
charge.

Course Outcomes:
On completion of the module the student is expected to be able to:
1. Describe how biological observations of 18th Century that lead to major discoveries
2. Convey that classification per se is not what biology is all about but highlight the underlying
criteria, such as morphological, biochemical and ecological
3. Highlight the concepts of recessiveness and dominance during the passage of genetic material
from parent to offspring
4. Convey that all forms of life have the same building blocks and yet the manifestations are as
diverse as one can imagine
5. Classify enzymes and distinguish between different mechanisms of enzyme action
6. Identify DNA as a genetic material in the molecular basis of information transfer
7. Analyse biological processes at the reductionistic level
8. Apply thermodynamic principles to biological systems
9. Identify and classify microorganisms

Recommended Books:
1. Biology: A global approach: Campbell, N. A.; Reece, J. B.; Urry, Lisa; Cain, M, L.;
Wasserman, S. A.; Minorsky, P. V.; Jackson, R. B. Pearson Education Ltd
2. Outlines of Biochemistry, Conn, E.E; Stumpf, P.K; Bruening, G; Doi, R.H., John Wiley and
Sons
3. Principles of Biochemistry (V Edition), By Nelson, D. L.; and Cox, M. M.W.H. Freeman and
Company
4. Molecular Genetics (Second edition), Stent, G. S.; and Calender, R.W.H. Freeman and
company, Distributed by Satish Kumar Jain for CBS Publisher
5. Microbiology, Prescott, L.M J.P. Harley and C.A. Klein 1995. 2nd edition Wm, C. Brown
Publishers

BTM402 Environmental Sciences 3L-0T-0P 0

UNIT TOPICS LECTURES

Environment, ecosystems and biodiversity: Definition, scope and

I importance of Risk and hazards; Chemical hazards, Physical hazards, 12
Biological hazards in the environment – concept of an ecosystem –
structure and function of an ecosystem – producers, consumers and
55
Department of Computer Science and Information Technology

decomposers-Oxygen cycle and Nitrogen cycle – energy flow in the

ecosystem – ecological succession processes – Introduction, types,
characteristic features, structure and function of the (a) forest ecosystem
(b) grassland ecosystem (c) desert ecosystem (d) aquatic ecosystems
(ponds, streams, lakes, rivers, oceans, estuaries) – Introduction to
biodiversity definition: genetic, species and ecosystem diversity –
biogeographical 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
–endangered and endemic species of India – conservation of
biodiversity: In-situ and ex-situconservation of biodiversity. Field study
of common plants, insects, birds Field study of simple ecosystems –
pond, river, hill slopes, etc.

Environmental pollution: Definition – causes, effects and control

measures of: (a) Air pollution (Atmospheric chemistry-Chemical
composition of the atmosphere; Chemical and photochemical reactions
in the atmosphere - formation of smog, PAN, acid rain, oxygen and
ozone chemistry;- Mitigation procedures- Control of particulate and
gaseous emission, Control of SO2, NOX, CO and HC) (b) Water
pollution : Physical and chemical properties of terrestrial and marine
II water and their environmental significance; Water quality parameters – 10
physical, chemical and biological; absorption of heavy metals - Water
treatment processes. (c) Soil pollution - soil waste management: causes,
effects and control measures of municipal solid wastes – (d) Marine
pollution (e) Noise pollution (f) Thermal pollution (g) Nuclear
hazards–role of an individual in prevention of pollution – pollution case
studies – Field study of local polluted site – Urban / Rural / Industrial /
Agricultural.

III Natural resources: Forest resources: Use and over-exploitation, 10

deforestation, case studies- timber extraction, mining, dams and their
effects on forests and tribal people – Water resources: Use and
overutilization of surface and ground water, dams-benefits and problems
– Mineral resources: Use and exploitation, environmental effects of
extracting and using mineral resources, case studies – Food resources:
World food problems, changes caused by agriculture and overgrazing,
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. Energy Conversion processes – Biogas – production and
uses, anaerobic digestion; case studies – Land resources: Land as a
resource, land degradation, man induced landslides, soil erosion and
desertification – role of an individual in conservation of natural
resources – Equitable use of resourcesfor sustainable lifestyles.
56
Department of Computer Science and Information Technology

Introduction to Environmental Biochemistry: Proteins –Biochemical

degradation of pollutants, Bioconversion of pollutants. Field study of
local area to document environmental assets – river / forest / grassland /
hill / mountain.

Social issues and the environment : From unsustainable to sustainable

development – urban problems related to energy – water conservation,
rain water harvesting, watershed management – resettlement and
rehabilitation of people; its problems and concerns, case studies – role of
non-governmental organization environmental ethics: Issues and
possible solutions – 12 Principles of green chemistry- nuclear accidents
and holocaust, case studies. – wasteland reclamation – consumerism and
IV 7
waste products – environment production act – Air act – Water act –
Wildlife protection act – Forest conservation act – The Biomedical
Waste (Management and Handling) Rules; 1998 and amendments-
scheme of labeling of environmentally friendly products (Ecomark).
enforcement machinery involved in environmental legislation- central
and state pollution control boards- disaster management: floods,
earthquake, cyclone and landslides. Public awareness.

Human population and the environment : Population growth,

variation among nations – population explosion – family welfare
programme – environment and human health – human rights – value
V 6
education – HIV / AIDS – women and child welfare –Environmental
impact analysis (EIA)- -GIS-remote sensing-role of information
technology in environment and human health – Case studies.

Course Objectives:
1. To the study of nature and the facts about environment.
2. To finding and implementing scientific, technological, economic and political solutions to
environmental problems.
3. To study the interrelationship between living organism and environment.
4. To appreciate the importance of environment by assessing its impact on the human world;
envision the surrounding environment, its functions and its value.
5. To study the dynamic processes and understand the features of the earth’s interior and surface.
6. To study the integrated themes and biodiversity, natural resources, pollution control and waste
management.

Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. Public awareness of environmental is at infant stage.
2. Ignorance and incomplete knowledge has led to misconceptions.
3. Development and improvement in std. of living has led to serious environmental disasters.
Recommended Books:
1. Gilbert M.Masters, ‘Introduction to Environmental Engineering and Science’, 2nd edition,
Pearson Education.
2. Benny Joseph, ‘Environmental Science and Engineering’, Tata McGraw-Hill, New Delhi
57
Department of Computer Science and Information Technology

3. Trivedi. R.K., ‘Handbook of Environmental Laws, Rules, Guidelines, Compliances and

Standards’, Vol. I and II, Enviro Media.
4. Cunningham, W.P. Cooper, T.H. Gorhani, ‘Environmental Encyclopedia’, Jaico Publ., House,
Mumbai.
5. Dharmendra S. Sengar, ‘Environmental law’, Prentice hall of India PVT LTD, New Delhi.

Theory Marks Practical Total

Hours
S. Course Course Marks
Cr
No. Code Title IA ET
L T P IA ETE
E
1. CSC501 Computer Networks 3 0 3 30 70 15 35 150 4.5
2. CSC502 Operating System 3 1 2 30 70 15 35 150 5
3. CSC503 Software Engineering 3 1 2 30 70 15 35 150 5

58
 Department of Computer Science and Information Technology

CSC504 Computer Graphics and

4. 3 0 0 30 70 - - 100 3
Multimedia
Departmental Elective-
5. 3 0 0 30 70 - - 100 3
I
6. Open Elective-I 3 0 0 30 70 - - 100 3
TOTAL 18 2 7 180 420 45 105 750 23.5
SEMESTER-V

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits

Departmental Elective-I
CSE501 Discrete Mathematical Structures 3-0-0 3
CSE502 Mobile Computing 3-0-0 3
ECC502 Analog Electronics 3-0-0 3
ECE505 Analog and Digital Communication 3-0-0 3
Open Elective-I
 HUO501 Entrepreneurship Development 3-0-0 3
HUO502 Professional Practice, Law & Ethics 3-0-0 3

HUO503 Foreign Language Russian 3-0-0 3

HUO504 Foreign Language Japanese 3-0-0 3
HUO505 Foreign Language German 3-0-0 3
HUO506 Foreign Language Chinese 3-0-0 3

CSC501 Computer Networks L3:T0:P3 Credits 4.5

Course Objective:
1. This course will introduce the basic principles in Computer Network.

2. Understand about different networks topologies.

3. Learn about Standards and protocols their implementations.

4. Learn how to make LAN and other setups of CN.

59
Department of Computer Science and Information Technology

Unit Topics Lectures

Network, Network Protocols, Edge, Access Networks and

Physical Media, Protocol Layers and their services models,
I Internet Backbones, NAP's and ISPs. 8

Protocol and Service Provided by application layer, transport

protocols. The world wide web. HTTP, Message formats, User
Server Interaction and Web caches. FTP commands and replies.
II 8
Electronic Mail, SMTP, Mail Message Formats and MIME and
Mail Access Protocols DNS The internet's directory service
DNS records and Message.
Transport Layer Service and Principles, Multiplexing and
Demultiplexing applications, connectionless Transport.UDP
Segment structure and UDP Checksum. Principles of Reliable
III Data Transfer-Go back to N and Selective Repeat. Connection 8
Oriented Transport TCP Connection and Segment Structure,
Sequence Numbers and acknowledgement numbers, Telnet,
Round trip time and timeout.TCP connection management.

Network service model, Routing principles. Link State routing

Algorithm, A distant Vector routing & OSPF algorithm.Router
Components; Input Prot, Switching fabric and output port.IPV6
IV Packet format. Point To Point Protocol (PPP), transition States, 8
PPP Layers-Physical Layer and Data Link Layer, Link Control
Protocols. LCP Packets and options. Authentication PAP and
CHAP, Network Control Protocol (NCP).
Synchronous Transport Signals. Physical configuration-SONET
Devices, Sections, Lines and Paths. SONET Layers-Photonic
Layer, section layer, line layer, path layer and device layer
V relationship. Sonet Frame format.Section overhead, Line 8
overhead and path overhead.Virtual Tributaries and types of
VTs.

Course Outcomes:

1. Describe various standard network models.

2. Understand various guided transmission media.

3. Analyse error detection and error correction codes.

4. Understand the concepts behind medium access control sub layer.

5. Implement and analyse routing and congestion issues in network design.

60
Department of Computer Science and Information Technology

RECOMMENDED BOOKS:

1. Forouzen, "Data Communication and Networking", TMH

2. A.S. Tanenbaum, Computer Networks, 3rd Edition, Prentice Hall India, 1997.
3. S. Keshav, An Engineering Approach on computer Networking, Addison Wesley, 1997
4. W. Stallings, Data and Computer Communication, Macmillan Press, 19139. 3. 4.

COMPUTER NETWORKS [Practical]

Suggested List of Practicals:

1. Implementation of the Data Link Layer framing method such as character stuffing and bit stuffing in C.[8]

2. Implementation of CRC algorithm in C.[8]

3. Implementation of a Hamming (7,4) code to limit the noise. We have to code the 4 bit data in to 7 bit data
by adding 3 parity bits. Implementation will be in C.[7]

4. Implementation of LZW compression algorithm in C.[7]

5. Write a socket program in C to implement a listener and a talker. 12[7]

6. Simulation of a network of 3 nodes and measure the performance on the same network.[7]

7. Write a program in C to encrypt 64-bit text using DES algorithm[7]

Course Outcomes:

1. To Analyze and implement b error detection and error correction codes.

2. To implement the concepts behind medium access control sub layer.

2. Implement and analyze routing and congestion issues in network design.

CSC 502 Operating Systems L3:T1:P2 Credits 5

Course Objectives:

1. This course provides a comprehensive introduction to understand the underlying principles,

techniques and approaches which constitute a coherent body of knowledge in operating
systems. In particular,

2. The course will consider inherent functionality and processing of program execution. The
emphasis of the course will be placed on understanding how the various elements that
underlie operating system interact and provides services for execution of application
software.

61
Department of Computer Science and Information Technology

3. Understand the Scheduling of all algorithms.

4. Learning about functioning of Operating System.

Unit Topics Lectures

Introduction and need of operating system, layered architecture/logical

structure of operating system, Type of OS, operating system as resource
manager and virtual machine, OS services, BIOS, System Calls/Monitor
Calls, Firmware- BIOS, Boot Strap Loader. Process management- Process
I model, creation, termination, states & transitions, hierarchy, context 8
switching, process implementation, process control block, Basic System
calls- Linux & Windows. Threads- processes versus threads, threading,
concepts, models, kernel & user level threads, thread usage, benefits,
multithreading models.

Interprocess communication- Introduction to message passing, Race

condition, critical section problem, mutual exclusion with busy waiting-
disabling interrupts, lock variables, strict alteration, Peterson ’s solution,
TSL instructions, busy waiting, sleep and wakeup calls, semaphore,
monitors, classical IPC problems. Process scheduling- Basic concepts,
classification, CPU and I/O bound, CPU schedulershort, medium, long-
II 8
term, dispatcher, scheduling:- preemptive and non-preemptive, Static and
Dynamic Priority, Co-operative & Non-cooperative,
Criteria/Goals/Performance Metrics, scheduling algorithms- FCFS, SJFS,
shortest remaining time, Round robin, Priority scheduling, multilevel
queue scheduling, multilevel feedback queue scheduling, Fair share
scheduling.

Deadlock- System model, resource types, deadlock problem, deadlock

characterization, methods for deadlock handling, deadlock prevention,
deadlock avoidance, deadlock detection, recovery from deadlock.
Memory management- concepts, functions, logical and physical address
space, address binding, degree of multiprogramming, swapping, static &
III 8
dynamic loading- creating a load module, loading, static & dynamic
linking, shared libraries, memory allocation schemesfirst fit, next fit, best
fit, worst fit, quick fit. Free space management- bitmap, link list/free list,
buddy’s system, memory protection and sharing, relocation and address
translation.

IV Virtual Memory- concept, virtual address space, paging scheme, pure 8

segmentation and segmentation with paging scheme hardware support and
implementation details, memory fragmentation, demand paging, pre-
paging, working set model, page fault frequency, thrashing, page
replacement algorithms- optimal, NRU, FIFO, second chance, LRU,
LRUapproximation clock, WS clock; Belady’s anomaly, distance string;
design issues for paging system- local versus global allocation policies,
load control, page size, separate instruction and data spaces, shared pages,
cleaning policy, TLB ( translation look aside buffer) reach, inverted page
table, I/O interlock, program structure, page fault handling, Basic idea of

62
Department of Computer Science and Information Technology

MM in Linux & windows.

File System- concepts, naming, attributes, operations, types, structure, file

organization & access(Sequential, Direct ,Index Sequential) methods,
memory mapped files, directory structures- one level, two level,
hierarchical/tree, acyclic graph, general graph, file system mounting, file
V sharing, path name, directory operations, overview of file system in Linux 8
& windows. Input/Output subsystems- concepts, functions/goals,
input/output devices- block and character, spooling, disk structure &
operation, disk attachment, disk storage capacity, disk scheduling
algorithm- FCFS, SSTF, scan scheduling, C-scan schedule.

Course Outcomes:

1. Understand the structure and functionalities of an Operating System and the concept of process.

2. Apply CPU Scheduling algorithms

3. Explain different problems related to process synchronization.

4. Apply deadlock prevention and deadlock detection algorithms

5. Describe the concepts of paging and segmentation for memory management

RECOMMENDED BOOKS
1. Abraham Siberschatz and Peter Baer Galvin, “Operating System Concepts ”, Fifth
Edition, Addision-Wesley
2. Milan Milankovic, “Operating Systems, Concepts and Design”, McGraw-Hill.
3. Harvey M Deital, "Operating Systems", Addison Wesley
4. Richard Peterson, “Linux: The Complete Reference”, Osborne McGraw-Hill.
5. Milenekovie, "Operating System Concept", McGraw Hill.
6. Petersons, "Operating Systems", Addision Wesley.
7. Dietal, "An Introduction to Operating System", Addision Wesley.

Practicals

OPERATING SYSTEMS

Suggested List of Experiments:

1. Practice commands: cp, mv, rm, ln, ls, who, echo, cat, mkdir, rmdir. Wildcards (?, *) ,I/O redirection (<,
>, >>), pipelines (|)[6]

2. Practice commands: xargs, alias, set-unset, setenv-unsetenv, export, source, ps, job, kill.[5]

3. Practice commands: head, tail, cut, paste, sed, grep, sort, uniq, find , locate, chmod.[5]

63
Department of Computer Science and Information Technology

4. Writing a simple shell script to echo who is logged in.[5]

5. Write a shell script to display only executable files in a given directory.[5]

6. Write a shell script to sort a list of file either in alphabetic order or largest file first according to user
response.[5]

7. Write a shell script to count the lines. Words and characters in its input (Note: Don't use wc).[5]

8. Write a shell script to print end of a glossary file in reverse order using array. (Hint: use awk tail).[5]

9. Modify cal command to accept more than one month (e.g. $cal Oct, Nov, )(Hint: use alias too)[5]

10. Write a shell script to check whether Ram logged in, continue checking every 60 seconds until success.[5]
Course Outcomes:

1. Implementation of the structure and functionalities of an Operating System.

2. Implementation of CPU Scheduling algorithms

3. Implementation of different problems related to process synchronization.

4. To implement deadlock prevention and deadlock detection algorithms

CSC 503 Software Engineering L3:T1:P2 Credits 5

Course Learning Objectives:

1. Here we will learn methods, tools and knowledge for fulfilling software requirements
2. Learn how to performs software design, software maintenance tasks, user interface design,
3. How to use computer programming and software testing.
4. Interdisciplinary study of this subject includes the knowledge from various fields such as project
management, management, mathematics, computer engineering, quality management and system
engineering.

Unit Topics Lectures

64
Department of Computer Science and Information Technology

Characteristics, Problems in system Development, System Level

I project Planning, System Development Life cycle (SDLC), computer 8
system engineering system analysis, modeling the architecture, system
specification.
Objectives, Resources and their estimation, LOC and FP estimation,
II effort estimation, COCOMO estimation model, risk analysis, software 8
project scheduling. Software Development: Life Cycle (SWDLC),
SWDLC models software engineering approaches
Requirement analysis tasks, Analysis principles. Software prototyping
and specification data dictionary finite state machine (FSM)
III models.Structured Analysis: Data and control flow diagrams, control 8
and process specification behavioral modeling, extension for data
intensive applications.

IV Design fundamentals, Effective modular design: Data architectural and 8

procedural design, design documentation.
Object oriented Analysis Modeling, Data modeling. Object Oriented
V Design: OOD concepts and methods class and object definitions, 8
refining operations. Class and object relationships, object
modularization. Introduction to Unified Modeling Language.

Course Outcomes:

1. Understand basic concepts of software engineering.

2. Compare different software engineering process models.

3. Analyse the principles of requirement Engineering.

4. Create architectural design for a given project.

5. Apply different testing techniques

RECOMMENDED BOOKS:

1. PankajJalote, Software Engineering , Wiley India

2. Rajib Mall, Fundamentals of Software Engineering, PHI Publication, 3rd Edition.
3. K. K. Aggarwal and Yogesh Singh, Software Engineering, New Age InternationalPublishers,3rd Edition.
4. R. S. Pressman, Software Engineering: A Practitioners Approach, McGraw Hill, 6thEdition.
5. Ian Sommerville, Software Engineering, Addison Wesley, 13th Edition.

65
Department of Computer Science and Information Technology

CSC 504 Computer Graphics and Multimedia L3:T0:P0 Credits 3

Objectives:

1. This course is designed to provide a comprehensive introduction to computer graphics

leading to the ability to
2. Understand contemporary terminology, progress, issues, and trends.A thorough introduction
to computer graphics techniques,
3. Focusing on 3D modeling, image synthesis, and rendering.The interdisciplinary nature of
computer graphics is emphasized in the wide variety of examples and applications.

66
Department of Computer Science and Information Technology

Unit Topics Lectures

Introduction
Introduction to Raster scan displays, Storage tube displays, refreshing,
flicking, interlacing, color monitors, display processors resolution,
I working principle of dot matrix, inkjet laser printers, working 8
principles of keyboard, mouse scanner, digitizing camera, track ball ,
tablets and joysticks, graphical input techniques, positioning
techniques, rubber band techniques, dragging etc
Scan conversion techniques
Scan conversion techniques, image representation, line drawing,
II simple DDA, Bresenham’s Algorithm, Circle drawing, general 8
method, symmetric DDA, Bresenham’s Algorithm, curves, parametric
function, Beizier Method, Bsp- line Method.
2D & 3D Co-ordinate system
2D & 3D Co-ordinate system, Translation, Rotation, Scaling,
III Reflection Inverse transformation, Composite transformation, world 8
coordinate system, screen coordinate system, parallel and perspective
projection, Representation of 3D object on 2D screen.
Point Clipping
Point Clipping: Line Clipping Algorithms, Polygon Clipping
IV algorithms, Introduction to Hidden Surface elimination, Basic 8
illumination model, diffuse reflection, specular reflection, phong
shading, Gourand shading ray tracing, color models like RGB, YIQ,
CMY, HSV etc.
Multimedia component
Multimedia components, Multimedia Hardware, SCSI, IDE, MCI,
V Multimedia data and file formats, RTF, TIFF, MIDI, JPEG, DIB, 8
MPEG, Multimedia Tools, Presentation tools, Authoring tools,
presentation.

Course Outcomes:

1. Explain the Computer Graphics display technologies

2. Analyse the basic output primitive drawing algorithms along with 2D transformation concepts to
display the objects

3. Apply the polygon filling algorithms to fill polygons with required colour

4. Apply the Line clipping and Polygon Clipping techniques

5. Demonstrate the 3D transformation concepts to model an object

Recommended Books-
1.Interactive Computer Graphics:A top down approach using OpenGL,Angel,5 thed.,Pearson
2.Computer Graphics C version,Hearn,2nded.,Pearson
67
Department of Computer Science and Information Technology

3.Computer Graphics with OpenGL,Hearn,3rded.,Pearson

4.Computer Graphics Mltimedia And Animation,Pakhira,PHI
5.Computer Graphics using OpenGL,Hill,Jr& Kelley,3rded.PHI
6.Computer Graphics ,Desai,PHI
7.Introduction to Computer Graphics,James D. Foley, Andries van Dam, Steven K. FeinerJohn F.
Hughes ,Richard L. Phillips , Addison-Wesley Professional September 10, 1993
13.Schaum's Outline of Computer Graphics,Zhigang Xiang, Roy A. Plastock ,TMH

DEPARTMENTAL ELECTIVE-I

CSE501 Discrete Mathematical Structures L3:T0:P0 Credits:03

Course Learning Objectives:

1. Discrete mathematics usually includes the study of algorithms,

2. Their implementations and efficiencies. Discrete mathematics is the
mathematical language of computer science.
3. How to Analyze the statements presented in DNF and determine their validity.
4. Learn how to Apply sets, relations and digraphs to solve applied problems
Details of the Course:

68
Department of Computer Science and Information Technology

Unit Topics Lectures

Operations and Laws of Sets, Cartesian Products,
Binary Relation, Partial Ordering Relation,
Equivalence Relation, Image of a Set, Sum and
Product of Functions, Bijective functions, Inverse and
Composite Function, Size of a Set, Finite and infinite
Sets, Countable and uncountable Sets, Cantor's
I diagonal argument and The Power Set theorem, 8
Schroeder-Bernstein theorem.
Principles of Mathematical Induction: The Well-
Ordering Principle, Recursive definition, The Division
algorithm: Prime Numbers, The Greatest Common
Divisor: Euclidean Algorithm, The Fundamental
Theorem of Arithmetic.
Basic counting techniques-inclusion and exclusion,
II 8
pigeon-hole principle, permutation and combination.
Syntax, Semantics, Validity and Satisfiability, Basic
Connectives and Truth Tables, Logical Equivalence:
The Laws of Logic, Logical Implication, Rules of
III Inference, The use of Quantifiers. Proof Techniques: 8
Some Terminology, Proof Methods and Strategies,
Forward Proof, Proof by Contradiction, Proof by
Contraposition, Proof of Necessity and Sufficiency.
Algebraic Structures with one Binary Operation, Semi
Groups, Monoids, Groups, Congruence Relation and
Quotient Structures, Free and Cyclic Monoids and
Groups, Permutation Groups, Substructures, Normal
Subgroups, Algebraic Structures with two Binary
IV 8
Operation, Rings, Integral Domain and Fields. Boolean
Algebra and Boolean Ring, Identities of Boolean
Algebra, Duality, Representation of Boolean Function,
Disjunctive and Conjunctive Normal Form

Graphs and their properties, Degree, Connectivity,

Path, Cycle, Sub Graph, Isomorphism, Eulerian and
Hamiltonian Walks, Graph Colouring, Colouring maps
and Planar Graphs, Colouring Vertices, Colouring
V Edges, List Colouring, Perfect Graph, definition 8
properties and Example, rooted trees, trees and sorting,
weighted trees and prefix codes, Bi-connected
component and Articulation Points, Shortest distances.

69
Department of Computer Science and Information Technology

Suggested books:
1. Kenneth H. Rosen, Discrete Mathematics and its Applications, Tata McGraw –
Hill
2. Susanna S. Epp, Discrete Mathematics with Applications,4th edition,
Wadsworth Publishing Co. Inc.
3. C L Liu and D P Mohapatra, Elements of Discrete Mathematics A Computer
Oriented Approach, 3rd Edition by, Tata McGraw – Hill
4. J.P. Tremblay and R. Manohar, Discrete Mathematical Structure and It ’s
Application to Computer Science”, TMG Edition, TataMcgraw-Hill
5. Norman L. Biggs, Discrete Mathematics, 2nd Edition, Oxford University Press.
Schaum’s Outlines Series, Seymour Lipschutz, Marc Lipson,

Course Outcomes

1. For a given logic sentence express it in terms of predicates, quantifiers, and

logical connectives
2. For a given a problem, derive the solution using deductive logic and prove the
solution based on logical inference
3. For a given a mathematical problem, classify its algebraic structure
4. Evaluate Boolean functions and simplify expressions using the properties of
Boolean algebra
5. Develop the given problem as graph networks and solve with techniques of
graph

CSE502 Mobile Computing L:3 T:0 P:0 Credits : 3

Course Objective:
1. Understand the concept of radio propagation and interference in multipath
propagation and channel model description
1. To compare different modulation and multiplexing techniques.
2. Design techniques, and compare their performance and tradeoffs Implement
algorithms
3. To analyze Wireless Application Protocol (WAP) for internet access and
advanced telephony services from the mobile phones.
4. Evaluate the performance of the security techniques which include symmetric
key cryptography and public key cryptography algorithms.

Unit Topics Lectures

I Introduction, issues in mobile computing, overview of wireless 8
telephony: cellular concept, GSM: air-interface, channel
structure, location management: HLR-VLR, hierarchical,
70
Department of Computer Science and Information Technology

handoffs, channel allocation in cellular systems, CDMA, GPRS.

Wireless Networking, Wireless LAN Overview: MAC issues,
IEEE 802.11, Blue Tooth, Wireless multiple access protocols,
II TCP over wireless, Wireless applications, data broadcasting, 8
Mobile IP, WAP: Architecture, protocol stack, application
environment, applications.
Data management issues, data replication for mobile computers,
III adaptive clustering for mobile wireless networks, File system, 8
Disconnected operations.
Mobile Agents computing, security and fault tolerance,
IV 8
transaction processing in mobile computing environment.
Ad Hoc networks, localization, MAC issues, Routing protocols,
global state routing (GSR), Destination sequenced distance
vector routing (DSDV), Dynamic source routing (DSR), Ad Hoc
V 8
on demand distance vector routing (AODV), Temporary ordered
routing algorithm (TORA), QoS in Ad Hoc Networks,
applications.

Course Outcomes:

1. Assess the capabilities of next-generation networks and the role of wireless technologies
in network design and operation.
2. Evaluate network protocols, routing algorithms, connectivity methods and characteristics.
3. Evaluate wireless network topologies, wireless connectivity and characteristics, and the
impact of wireless networks on security and Internet communications.
4. Select appropriate wireless technologies in commercial and enterprise applications.

Text Books:

1. Mobile Communication Engineering – W.C.Y. Lee, TMH

2. Mobile communication – Silcher, PEA
3. The Complete Guide to Wireless Computing and Networking – Paul Heltzel, BPB
4. Blue Tooth Connect without Cables – Jennifer Bray, PEA
ECC502 Analog Electronics 3L:0T:2P 4 credits

Course Objective:
At the start of this course students will demonstrate the ability to

1. Understand the characteristics of diodes and transistors

2. Design and analyze various rectifier and amplifier circuits
3. Design sinusoidal and non-sinusoidal oscillators
4. Understand the functioning of OP-AMP and design OP-AMP based circuits
5. Design ADC andDAC

Unit Topics Lectures

I Diode Circuits & Amplifier models 8
Diode Circuits, Amplifier models: Voltage amplifier, current
amplifier, trans-conductance amplifier and trans-resistance
amplifier. Biasing schemes for BJT and FET amplifiers, bias

71
Department of Computer Science and Information Technology

stability, various configurations (such as CE/CS, CB/CG,

CC/CD) and their features, small signal analysis, low frequency
transistor models, estimation of voltage gain, input resistance,
output resistance etc., design procedure for particular
specifications, low frequency analysis ofmultistageamplifiers.

High frequency transistor models & Power amplifiers

High frequency transistor models, frequency
response of single stage and multistage amplifiers,
II cascode amplifier. Various classes of operation 8
(Class A, B, AB, C etc.), their power efficiency and
linearity issues.

Feedback amplifiers
Feedback topologies: Voltage series, current series,
voltage shunt, current shunt, effect of feedback on
III gain, bandwidth etc., calculation with practical 9
circuits, concept of stability, gain margin and phase
margin.

Oscillators, Current mirror & Differential amplifier

Oscillators: Review of the basic concept,
Barkhausen criterion, RC oscillators (phase shift,
Wien bridge etc.), LC oscillators (Hartley, Colpitt,
Clapp etc.), non-sinusoidal oscillators.
Current mirror: Basic topology and its variants, V-
I characteristics, output resistance and minimum
IV sustainable voltage (VON), maximum usable load. 7
Differential amplifier: Basic structure and principle
of operation, calculation of differential gain,
common mode gain, CMRR and ICMR. OP-AMP
design: design of differential amplifier for a given
specification, design of gain stages and output
stages, compensation.

V OP-AMP applications 8
OP-AMP applications: review of inverting and non-
inverting amplifiers, integrator and differentiator,
summing amplifier, precision rectifier, Schmitt
trigger and its applications. Active filters: Low pass,
high pass, band pass and band stop, design
guidelines.
Digital-to-analog converters (DAC): Weighted
resistor, R-2R ladder, resistor string etc. Analog- to-
72
Department of Computer Science and Information Technology

digital converters (ADC): Single slope, dual slope,

successive approximation, flash etc.Switched
capacitor circuits: Basic concept, practical
configurations, application in amplifier, integrator,
ADC etc.

Course Outcomes:
At the end of this course students will demonstrate the ability to

a) Understand the characteristics of diodes andtransistors

b) Design and analyze various rectifier and amplifiercircuits
c) Design sinusoidal and non-sinusoidaloscillators
d) Understand the functioning of OP-AMP and design OP-AMP basedcircuits
e) Design ADC andDAC

Text /Reference Books:

1. J.V. Wait, L.P. Huelsman and GA Korn, Introduction to Operational

Amplifier theory and applications, McGraw Hill,1992.
2. J. Millman and A. Grabel, Microelectronics, 2nd edition, McGraw Hill,1988.
1. P. Horowitz and W. Hill, The Art of Electronics, 2nd edition, Cambridge
University Press,1989.
2. A.S. SedraandK.C. Smith, Microelectronic Circuits, Saunder'sCollege11
3. Publishing, EditionIV.

ECE-505 Analog and Digital 3L:0T:0P 3 credits

Communication
Course Objectives: At the start of this course students will demonstrate the ability to understand of

1. Analyze and compare different analog modulation schemes for their efficiency and
bandwidth
2. Analyze the behavior of a communication system in presence of noise
3. Investigate pulsed modulation system and analyze their system performance
4. Analyze different digital modulation schemes and can compute the bit error performance

SN CONTENTS Lectures
Review of signals and systems, Frequency domain representation of signals,
Principles of Amplitude Modulation Systems- DSB, SSB and VSB modulations.
Angle Modulation,
1 8
Representation of FM and PM signals, Spectral characteristics of angle modulated
signals.

2 Review of probability and random process. Gaussian and white noise 8

73
Department of Computer Science and Information Technology

characteristics, Noise in amplitude modulation systems, Noise in Frequency

modulation systems. Pre-emphasis and Deemphasis, Threshold effect in angle
modulation.

Pulse modulation. Sampling process. Pulse Amplitude and Pulse code modulation
(PCM),Differential pulse code modulation. Delta modulation, Noise
3 8
considerations in PCM, Time Division multiplexing, Digital Multiplexers.

Elements of Detection Theory, Optimum detection of signals in noise, Coherent

communication with waveforms- Probability of Error evaluations. Baseband Pulse
Transmission- Inter symbol Interference and Nyquist criterion.Pass band Digital
4 Modulation schemes- Phase Shift Keying, 8
Frequency Shift Keying,Quadrature Amplitude Modulation, Continuous Phase
Modulation and Minimum Shift Keying.

Digital Modulation tradeoffs. Optimum demodulation of digital signals over

band-limited channels- Maximum likelihood sequence detection (Viterbi
receiver). Equalization Techniques.
5
Synchronization and Carrier Recovery for Digital modulation. 8

TOTAL 40
Course Outcomes: At the end of this course students will demonstrate the ability to
1. Analyze and compare different analog modulation schemes for their efficiency and
bandwidth
2. Analyze the behavior of a communication system in presence of noise
3. Investigate pulsed modulation system and analyze their system performance
4. Analyze different digital modulation schemes and can compute the bit error performance
Text/Reference Books:

1. Haykin S., "Communications Systems", John Wiley and Sons, 2001.

2. Proakis J. G. and Salehi M., "Communication Systems Engineering", Pearson Education,
2002.
3. Taub H. and Schilling D.L., "Principles of Communication Systems”, Tata McGraw Hill,
2001.
4. Wozencraft J. M. and Jacobs I. M., ``Principles of Communication Engineering'',John Wiley,
1965.
5. Barry J. R., Lee E. A. and Messerschmitt D. G., ``Digital Communication'', Kluwer
Academic Publishers, 2004.
6. Proakis J.G., ``Digital Communications'', 4th Edition, McGraw Hill, 2000.

74
Department of Computer Science and Information Technology

OPEN ELECTIVE I

HUO501 Entrepreneurship Development 3L:0T:0P 3

Course Objectives:
1. Understand the growth of small scale industries in developing countries and their positions
vis-a-vis large industries.
2. Design assessment of viability, formulation, evaluation, financing, field-study and collection
of information, preparation of project report.
3. Realization of planning and production control, quality control, marketing, industrial
relations, sales and purchases, advertisement.
4. Aware the financial functions, cost of capital approach in project planning and control.
Economic evaluation, risk analysis, capital expenditures.
5. Understand Role of various national and state agencies which render assistance to small scale
industries.
Unit CONTENTS Hours
75
Department of Computer Science and Information Technology

Entrepreneurship- definition, growth of small scale industries in developing

countries and their positions vis-a-vis large industries; role of small scale
industries in the national economy; characteristics and types of small scale
1 8
industries; demand based and resources based ancillaries and sub-control types.
Government policy for small scale industry; stages in starting a small scale
industry.

Project identification- assessment of viability, formulation, evaluation,

financing, field study and collection of information, preparation of project report,
2 8
demand analysis, material balance and output methods, benefit cost analysis,
discounted cash flow, internal rate of return and net present value methods.

Accountancy- Preparation of balance sheets and assessment of economic

viability, decision making, expected costs, planning and production control,
3 quality control, marketing, industrial relations, sales and purchases, 8
advertisement, wages and incentive, inventory control, preparation of financial
reports, accounts and stores studies.

Project Planning and control: The financial functions, cost of capital approach
in project planning and control. Economic evaluation, risk analysis, capital
4 expenditures, policies and practices in public enterprises, profit planning and 8
programming, planning cash flow, capital expenditure and operations, control of
financial flows, control and communication.

Laws concerning entrepreneur viz, partnership laws, business ownership, sales

5 and income taxes and workman compensation act. Role of various national and
state agencies which render assistance to small scale industries. 8

TOTAL 40

Course Outcomes:
1. To understand concept of entrepreneurship.
2. To prepare project reports.
3. To preparation balance sheets and assesses economic viability.
4. To learn project planning and control.
5. Analyze laws concerning entrepreneur viz.

Recommended Books:
1. Forbat, John, “Entrepreneurship” New Age International.
2. Hisrich, Entrepreneurship, McGrawhill Education.
3. Havinal, Veerbhadrappa, “Management and Entrepreneurship” New Age International.
4. Joseph, L. Massod, “Essential of Management", Prentice Hall of India.

HUO502 Professional Practice, Law & Ethics 3L:0T:0P 3

76
 Department of Computer Science and Information Technology

Course Objectives:
1. To make the students understand the types of roles they are expected to play in the society as
practitioners of the civil engineering profession.
2. To develop some ideas of the legal and practical aspects of their profession

Unit CONTENTS Hours

Professional Practice A – Respective roles of various stakeholders: Government

(constituting regulatory bodies and standardization organizations, prescribing norms to
ensure safety of the citizens); Standardization Bodies (ex. BIS, IRC)(formulating standards
of practice); professional bodies (ex. Institution of Engineers(India), Indian Roads
Congress, IIA/ COA, ECI, Local Bodies/ Planning Authorities) (certifying professionals
and offering platforms for interaction); Clients/ owners (role governed by contracts);
Developers (role governed by regulations such as RERA); Consultants (role governed by
bodies such as CEAI); Contractors (role governed by contracts and regulatory Acts and
1 Standards); Manufacturers/ Vendors/ Service agencies (role governed by contracts and 8
regulatory Acts and Standards).

Professional Ethics B– Definition of Ethics, Professional Ethics, Business Ethics,

Corporate Ethics, Engineering Ethics, Personal Ethics; Code of Ethics as defined in the
website of Institution of Engineers (India); Profession, Professionalism, Professional
Responsibility, Professional Ethics; Conflict of Interest, Gift Vs Bribery, Environmental
breaches, Negligence, Deficiencies in state-of-the-art; Vigil Mechanism, Whistleblowing,
protected disclosures.

General Principles of Contracts Management: Indian Contract Act, 1972 and

amendments covering General principles of contracting; Contract Formation & Law;
Privacy of contract; Various types of contract and their features; Valid & Voidable
Contracts; Prime and sub-contracts; Joint Ventures & Consortium; Complex contract
terminology; Tenders, Request For Proposals, Bids & Proposals; Bid Evaluation; Contract
Conditions & Specifications; Critical /“Red Flag” conditions; Contract award & Notice To
2 12
Proceed; Variations & Changes in Contracts; Differing site conditions; Cost escalation;
Delays, Suspensions & Terminations; Time extensions & Force Majeure; Delay Analysis;
Liquidated damages & Penalties; Insurance & Taxation; Performance and Excusable Non-
performance; Contract documentation; Contract Notices; Wrong practices in contracting
(Bid shopping, Bid fixing, Cartels); Reverse auction; Case Studies; Build-Own-Operate &
variations; Public- Private Partnerships; International Commercial Terms.

3 Arbitration, Conciliation and ADR (Alternative Dispute Resolution) system: 8

Arbitration – meaning, scope and types – distinction between laws of 1940 and 1996;
UNCITRAL model law – Arbitration and expert determination; Extent of judicial
intervention; International commercial arbitration; Arbitration agreements – essential and
kinds, validity, reference and interim measures by court; Arbitration tribunal –
appointment, challenge, jurisdiction of arbitral tribunal, powers, grounds of challenge,
procedure and court assistance; Award including Form and content, Grounds for setting
aside an award, Enforcement, Appeal and Revision; Enforcement of foreign awards – New
77
 Department of Computer Science and Information Technology

York and Geneva Convention Awards; Distinction between conciliation, negotiation,

mediation and arbitration, confidentiality, resort to judicial proceedings, costs; Dispute
Resolution Boards; Lok Adalats.

Engagement of Labour and Labour & other construction-related Laws: Role of

Labour in Civil Engineering; Methods of engaging labour- on rolls, labour sub-contract,
piece rate work; Industrial Disputes Act, 1947; Collective bargaining; Industrial
4 8
Employment ( Standing Orders) Act, 1946; Workmen’s Compensation Act, 1923; Building
& Other Construction Workers (regulation of employment and conditions of service) Act
(1996) and Rules (1998); RERA Act 2017, NBC 2017.

Law relating to Intellectual property: Introduction – meaning of intellectual property,

main forms of IP, Copyright, Trademarks, Patents and Designs, Secrets; Law relating to
Copyright in India including Historical evolution of Copy Rights Act, 1957, Meaning of
copyright – computer programs, Ownership of copyrights and assignment, Criteria of
infringement, Piracy in Internet – Remedies and procedures in India; Law relating to
5 Patents under Patents Act, 1970 including Concept and historical perspective of patents
law in India, Patentable inventions with special reference to biotechnology products, Patent 4
protection for computer programs, Process of obtaining patent – application, examination,
opposition and sealing of patents, Patent cooperation treaty and grounds for opposition,
Rights and obligations of patentee, Duration of patents – law and policy considerations,
Infringement and related remedies.

TOTAL 40

Course Outcomes:
1. To familiarise the students to what constitutes professional practice, introduction of various
stakeholders and their respective roles; understanding the fundamental ethics governing the
profession.
2. To give a good insight into contracts and contracts management in civil engineering, dispute
resolution mechanisms; laws governing engagement of labour.
3. To give an understanding of Intellectual Property Rights, Patents.
4. To make the students understand the types of roles they are expected to play in the society as
practitioners of the civil engineering profession.
5. To develop good ideas of the legal and practical aspects of their profession

Recommended Books:
1. Meena Rao (2006), Fundamental concepts in Law of Contract, 3rd Edn. Professional Offset.
2. Neelima Chandiramani (2000), The Law of Contract: An Outline, 2nd Edn. Avinash
Publications Mumbai.
3. Avtarsingh (2002), Law of Contract, Eastern Book Co.
4. Dutt (1994), Indian Contract Act, Eastern Law House.
5. Anson W.R. (1979), Law of Contract, Oxford University Press.
6. Kwatra G.K. (2005), The Arbitration & Conciliation of Law in India with case law on
UNCITRAL Model Law on Arbitration, Indian Council of Arbitration.
78
Department of Computer Science and Information Technology

7. Wadhera (2004), Intellectual Property Rights, Universal Law Publishing Co.

8. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia Law House.
9. Bare text (2005), Right to Information Act.
10. O.P. Malhotra, Law of Industrial Disputes, N.M. Tripathi Publishers.
11. K.M. Desai(1946), The Industrial Employment (Standing Orders) Act.
12. Rustamji R.F., Introduction to the Law of Industrial Disputes, Asia Publishing House.
13. Vee, Charles & Skitmore, Martin (2003) Professional Ethics in the Construction Industry,
Engineering Construction and Architectural management, Vol.10, Iss2,pp 117-127, MCB UP
Ltd.
14. American Society of Civil Engineers (2011) ASCE Code of Ethics – Principles Study and
Application.
15. Ethics in Engineering- M.W.Martin& R.Schinzinger, McGraw-Hill.
16. Engineering Ethics, National Institute for Engineering Ethics, USA.

HUO503 Foreign Language Russian 3L:0T:0P 3

Course Objectives:
This intensive course provides a comprehensive introduction to Russian language and culture, while
ensuring a solid command of the fundamental grammatical structures.

Unit Topics Hours

Chapter 1. The Russian Alphabet (1).
Chapter 2. The Russian Alphabet (2).
Chapter 3. I want to study in Moscow!
I Chapter 4. My schedule. (Vocab quiz 1–6) 4
Chapter 5. Weekends.
Chapter 6. Where do you live?
Review Ch. 1 – 6 (Grammar quiz 1–6)
II Chapter 7. At home (Vocab quiz 7–9) 4
Chapter 8. This is a great neighborhood.
Chapter 9. What do you like to eat?
Review Ch.7 – 9 (Grammar quiz 7 - 9).
Chapter 10. Let’s go to a restaurant and visiting (Vocab quiz 10–12)
Chapter 11. Family
Chapter 12. A Family Album.
79
Department of Computer Science and Information Technology

Review Ch. 1–12 (Grammar quiz 10–12)

Chapter 13. What do we look like? (Vocab quiz 13–15)
Chapter 14. What are we like?
III 4
Chapter 15. What hurts?
Review Ch. 13 – 15
Chapter 16. Every day. (Vocab quiz 16–18).
IV Chapter 17. What are you interested in? 4
Chapter 18. In the city. (Grammar quiz 16 - 18)
Chapter 19. How can I get there? (Vocab quiz 19–20)
Chapter 19. How can I get there?
V 4
Chapter 20. Geography. (Grammar quiz 19 - 20)
Review, tests, presentations.
Chapter 1. Introduction to the course
Chapter 2. Grammar and Vocabulary Review
VI 4
Chapter 3. Self, education, languages
Review Ch. 1 – 3 (Grammar quiz 1–3)
Chapter 4. Communicative Content: Personal info
Chapter 5. Communicative Content: marriage and family.
VII 4
Chapter 6. Grammar Topics: Review cases and conjugation
Review Ch.4 – 6 (Grammar quiz 7 - 9).
Chapter 7. Communicative Content: Health
Chapter 8. Communicative Content: talking on the phone
VIII 4
Chapter 9. Grammar Topics: Aspect and time expressions
Review Ch. 7 – 9
Chapter 10. Communicative Content: Travel
Chapter 11. Communicative Content: free time and hobbies
IX 4
Chapter 12. Grammar Topics: Verbs of Motion (unprefixed)
Review Ch. 10 – 12
Chapter 13. Communicative Content: Finding your way in a city
X Chapter 14. Grammar Topics: Verbs of Motion (prefixed) 4
Review, tests, presentations.
Total 40

Course Outcomes:
Students at this level should be able to:
1. Read and write the language and comprehend short conversations on everyday topics.
2. Write and translate simple texts, write short essays, letters, and advertisements.
3. Make polite requests, ask for information, respond to requests and descriptions, impart
personal information, have simple discussions on familiar, everyday topics, and make
apologies
4. Communicate well and correctly in situations without significant complications
5. Read stylistically uncomplicated short stories, poems, and newspaper articles
6. Understand the main ideas and some details of radio and television programs, as well as
documentary and feature films

Recommended Books:
80
Department of Computer Science and Information Technology

1. Russian-English/English-Russian dictionary.
2. Dolgova, Irina and Cynthia Martin. Russian Stage Two: Welcome Back! Dubuque, IA:
Kendall/Hunt Publishing Company, 2010.The set includes a textbook, two workbooks, two CDs
and a DVD. All parts of the set are required for class. We will be using the same materials in the
second part of this course (Spring 2011).
3. Russian-English / English-Russian Dictionary. We recommend the site
http://lingvopro.abbyyonline.com/en ABBYY Lingvo.Pro or http://multitran.ru МУЛЬТИТРАН.

HUO504 Foreign Language Japanese 3L:0T:0P 3

Course Objectives:
This intensive course provides a comprehensive introduction to Japanese language and culture, while
ensuring a solid command of the fundamental grammatical structures.

Unit Topics Hours

Chapter 1. The Japanese Alphabet (1).
Chapter 2. The Japanese Alphabet (2).
Chapter 3. I want to study in Tokyo!
I Chapter 4. My schedule. (Vocab quiz 1–6) 4
Chapter 5. Weekends.
Chapter 6. Where do you live?
Review Ch. 1 – 6 (Grammar quiz 1–6)
II Chapter 7. At home (Vocab quiz 7–9) 4
Chapter 8. This is a great neighborhood.
Chapter 9. What do you like to eat?
Review Ch.7 – 9 (Grammar quiz 7 - 9).
Chapter 10. Let’s go to a restaurant and visiting (Vocab quiz
10–12)
Chapter 11. Family
81
Department of Computer Science and Information Technology

Chapter 12. A Family Album.

Review Ch. 1–12 (Grammar quiz 10–12)
Chapter 13. What do we look like? (Vocab quiz 13–15)
Chapter 14. What are we like?
III 4
Chapter 15. What hurts?
Review Ch. 13 – 15
Chapter 16. Every day. (Vocab quiz 16–18).
IV Chapter 17. What are you interested in? 4
Chapter 18. In the city. (Grammar quiz 16 - 18)
Chapter 19. How can I get there? (Vocab quiz 19–20)
Chapter 19. How can I get there?
V 4
Chapter 20. Geography. (Grammar quiz 19 - 20)
Review, tests, presentations.
Chapter 1. Introduction to the course
Chapter 2. Grammar and Vocabulary Review
VI 4
Chapter 3. Self, education, languages
Review Ch. 1 – 3 (Grammar quiz 1–3)
Chapter 4. Communicative Content: Personal info
Chapter 5. Communicative Content: marriage and family.
VII 4
Chapter 6. Grammar Topics: Review cases and conjugation
Review Ch.4 – 6 (Grammar quiz 7 - 9).
Chapter 7. Communicative Content: Health
Chapter 8. Communicative Content: talking on the phone
VIII 4
Chapter 9. Grammar Topics: Aspect and time expressions
Review Ch. 7 – 9
Chapter 10. Communicative Content: Travel
Chapter 11. Communicative Content: free time and hobbies
IX 4
Chapter 12. Grammar Topics: Verbs of Motion (unprefixed)
Review Ch. 10 – 12
Chapter 13. Communicative Content: Finding your way in a city
X Chapter 14. Grammar Topics: Verbs of Motion (prefixed) 4
Review, tests, presentations.
Total 40

Course Outcomes:
Students at this level should be able to:
1. Read and write the language and comprehend short conversations on everyday topics.
2. Write and translate simple texts, write short essays, letters, and advertisements.
3. Make polite requests, ask for information, respond to requests and descriptions, impart personal
information, have simple discussions on familiar, everyday topics, and make apologies
4. Communicate well and correctly in situations without significant complications
5. Read stylistically uncomplicated short stories, poems, and newspaper articles
6. Understand the main ideas and some details of radio and television programs, as well as
documentary and feature films

Recommended Books:
82
Department of Computer Science and Information Technology

1. Encyclopedia of Japan: Japanese history and culture, from abacus to zori.

2. Get Talking and Keep Talking Japanese Total Audio Course: (Audio pack) The essential short
course for speaking and understanding with confidence (Teach Yourself Language)by Helen
Gilhooly
3. Japanese Hiragana & Katakana for Beginners: First Steps to Mastering the Japanese Writing
Systemby Timothy G. StoutAnna Kudyma, Frank Miller, Olga Kagan. Beginner's Russian: With
Interactive Online Workbook. Publisher: Hippocrene Books 2011, ISBN: 978-0781812511.

HUO505 Foreign Language German 3L:0T:0P 3

Course Objectives:
This intensive course provides a comprehensive introduction to German language and culture, while
ensuring a solid command of the fundamental grammatical structures.

Unit Topics Hours

Chapter 1. The German Alphabet (1).
Chapter 2. The German Alphabet (2).
Chapter 3. I want to study in Berlin!
I Chapter 4. My schedule. (Vocab quiz 1–6) 4
Chapter 5. Weekends.
Chapter 6. Where do you live?
Review Ch. 1 – 6 (Grammar quiz 1–6)
II Chapter 7. At home (Vocab quiz 7–9) 4
Chapter 8. This is a great neighborhood.
Chapter 9. What do you like to eat?
Review Ch.7 – 9 (Grammar quiz 7 - 9).
Chapter 10. Let’s go to a restaurant and visiting (Vocab quiz 10–12)
Chapter 11. Family
Chapter 12. A Family Album.
83
Department of Computer Science and Information Technology

Review Ch. 1–12 (Grammar quiz 10–12)

Chapter 13. What do we look like? (Vocab quiz 13–15)
Chapter 14. What are we like?
III 4
Chapter 15. What hurts?
Review Ch. 13 – 15
Chapter 16. Every day. (Vocab quiz 16–18).
IV Chapter 17. What are you interested in? 4
Chapter 18. In the city . (Grammar quiz 16 - 18)
Chapter 19. How can I get there? (Vocab quiz 19–20)
Chapter 19. How can I get there?
V 4
Chapter 20. Geography. (Grammar quiz 19 - 20)
Review, tests, presentations.
Chapter 1. Introduction to the course
Chapter 2. Grammar and Vocabulary Review
VI 4
Chapter 3. Self, education, languages
Review Ch. 1 – 3 (Grammar quiz 1–3)
Chapter 4. Communicative Content: Personal info
Chapter 5. Communicative Content: marriage and family.
VII 4
Chapter 6. Grammar Topics: Review cases and conjugation
Review Ch.4 – 6 (Grammar quiz 7 - 9).
Chapter 7. Communicative Content: Health
Chapter 8. Communicative Content: talking on the phone
VIII 4
Chapter 9. Grammar Topics: Aspect and time expressions
Review Ch. 7 – 9
Chapter 10. Communicative Content: Travel
Chapter 11. Communicative Content: free time and hobbies
IX 4
Chapter 12. Grammar Topics: Verbs of Motion (unprefixed)
Review Ch. 10 – 12
Chapter 13. Communicative Content: Finding your way in a city
X Chapter 14. Grammar Topics: Verbs of Motion (prefixed) 4
Review, tests, presentations.
Total 40

Course Outcomes:
Students at this level should be able to:
1. Read and write the language and comprehend short conversations on everyday topics.
2. Write and translate simple texts, write short essays, letters, and advertisements.
3. Make polite requests, ask for information, respond to requests and descriptions, impart personal
information, have simple discussions on familiar, everyday topics, and make apologies.
4. Communicate well and correctly in situations without significant complications.
5. Read stylistically uncomplicated short stories, poems, and newspaper articles.
6. Understand the main ideas and some details of radio and television programs, as well as
documentary and feature films.

Recommended Books:

84
Department of Computer Science and Information Technology

1. The Everything Essential German Book: All You Need to Learn German in No Time by Edward
Swick.
2. Collins Easy Learning – Collins Easy Learning German Grammar and Practice.

HUO506 Foreign Language Chinese 3L:0T:0P 3

Course Objectives:
This intensive course provides a comprehensive introduction to Chinese language and culture, while
ensuring a solid command of the fundamental grammatical structures.

Unit Topics Hours

Chapter 1. The Chinese Alphabet (1).
Chapter 2. The Chinese Alphabet (2).
Chapter 3. I want to study in Beijing!
I Chapter 4. My schedule. (Vocab quiz 1–6) 4
Chapter 5. Weekends.
Chapter 6. Where do you live?
Review Ch. 1 – 6 (Grammar quiz 1–6)
Chapter 7. At home (Vocab quiz 7–9)
Chapter 8. This is a great neighborhood.
Chapter 9. What do you like to eat?
Review Ch.7 – 9 (Grammar quiz 7 - 9).
II 4
Chapter 10. Let’s go to a restaurant and visiting (Vocab quiz 10–12)
Chapter 11. Family
Chapter 12. A Family Album.
Review Ch. 1–12 (Grammar quiz 10–12)
Chapter 13. What do we look like? (Vocab quiz 13–15)
Chapter 14. What are we like?
III 4
Chapter 15. What hurts?
Review Ch. 13 – 15
Chapter 16. Every day. (Vocab quiz 16–18).
IV Chapter 17. What are you interested in? 4
Chapter 18. In the city . (Grammar quiz 16 - 18)
Chapter 19. How can I get there? (Vocab quiz 19–20)
Chapter 19. How can I get there?
V 4
Chapter 20. Geography. (Grammar quiz 19 - 20)
Review, tests, presentations.
Chapter 1. Introduction to the course
Chapter 2. Grammar and Vocabulary Review
VI 4
Chapter 3. Self, education, languages
Review Ch. 1 – 3 (Grammar quiz 1–3)
Chapter 4. Communicative Content: Personal info
Chapter 5. Communicative Content: marriage and family.
VII 4
Chapter 6. Grammar Topics: Review cases and conjugation
Review Ch.4 – 6 (Grammar quiz 7 - 9).
VIII Chapter 7. Communicative Content: Health 4
85
Department of Computer Science and Information Technology

Chapter 8. Communicative Content: talking on the phone

Chapter 9. Grammar Topics: Aspect and time expressions
Review Ch. 7 – 9
Chapter 10. Communicative Content: Travel
Chapter 11. Communicative Content: free time and hobbies
IX 4
Chapter 12. Grammar Topics: Verbs of Motion (unprefixed)
Review Ch. 10 – 12
Chapter 13. Communicative Content: Finding your way in a city
X Chapter 14. Grammar Topics: Verbs of Motion (prefixed) 4
Review, tests, presentations.
Total 40

Course Outcomes:
Students at this level should be able to:
1. Read and write the language and comprehend short conversations on everyday topics.
2. Write and translate simple texts, write short essays, letters, and advertisements.
3. Make polite requests, ask for information, respond to requests and descriptions, impart
personal information, have simple discussions on familiar, everyday topics, and make
apologies.
4. Communicate well and correctly in situations without significant complications.
5. Read stylistically uncomplicated short stories, poems, and newspaper articles.
6. Understand the main ideas and some details of radio and television programs, as well as
documentary and feature films.
Recommended Books:
1. Learn Chinese Through Englishby Dr. Anita Sharma.
2. Chinese: Crash Course Chinese - Learn Chinese Fast With a Native Speaker: 500+ Essential
Phrases to Build Your Chinese Vocabulary, Chinese, Learn Chinese, Chinese Phrasebook,
Mandarin Study Aidby Celine Li and Polyglot Language Guides.
3. Living Language Mandarin Chinese, Complete Edition: Beginner through advanced course,
including 3 course books, 9 audio CDs, Chinese character guide, and free online learningby
Living Language.

SEMESTER-VI
86
 Department of Computer Science and Information Technology

Theory Practical
Course Hours
S. No. Course Title Marks Marks Total Cr
Code
L T P IA ETE IA ETE
1. CSC601 Python Programming 3 1 3 30 70 15 35 150 5.5
2. CSC602 Artificial Intelligence 3 0 0 30 70 - - 100 3
Data Mining and
3 CSC603 3 0 0 30 70 100 3
Warehousing
4 CSC604 Software Testing 3 0 2 30 70 15 35 150 4
5 CSC605 Seminar 0 0 3 - - 50 - 50 1.5
Departmental
6 3 0 0 30 70 - - 100 3
Elective-II
7 Open Elective-II 3 0 0 30 70 - - 100 3
TOTAL 18 2 8 180 420 80 70 750 23
L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,
Cr=Credits
Departmental Elective-II
CSE601 Cryptography & Network Security 3-0-0 3
CSE602 Formal Language & Automata Theory 3-0-0 3
CSE603 Human Computer Interaction & Usability 3-0-0 3
CSE604 Information Retrieval 3-0-0 3

Open Elective-II
MEO601  Introduction to Robotics 3-0-0 3
ECO601 Micro Electro Mechanical System 3-0-0 3

MEO602 Introduction to Spacecraft Technology 3-0-0 3

EEO601 Automatic Control 3-0-0 3

CSC601 Python Programming L3:T1:P3 Credits: 5.5

Course objectives:
1. Describe the core syntax and semantics of Python programming language.
2. Discover the need for working with the strings and functions.
3. Illustrate the process of structuring the data using lists, dictionaries, tuples and sets.
4. Indicate the use of regular expressions and built-in functions to navigate the file system.
5. Infer the Object-oriented Programming concepts in Python.

No. of
UNIT No Syllabus Content
Hours

87
Department of Computer Science and Information Technology

Parts of Python Programming Language, Identifiers, Keywords, Statements 11

and Expressions, Variables, Operators, Precedence and Associativity, Data
Types, Indentation, Comments, Reading Input, Print Output, Type Conversions,
The type() Function and Is Operator, Dynamic and Strongly Typed
Language, Control Flow Statements, The if  Decision Control Flow
Statement, The if…else Decision Control Flow Statement, The if…elif…else
1
Decision Control Statement, Nested if Statement, The while Loop, The for
Loop, The continue and break Statements, Catching Exceptions Using try and
except Statement, Functions, Built-In Functions, Commonly Used Modules,
Function Definition and Calling the Function, The return Statement and void
Function, Scope and Lifetime of Variables, Default Parameters, Keyword
Arguments, *args and **kwargs, Command Line Arguments.

Strings, Creating and Storing Strings, Basic String Operations, Accessing 10

Characters in String by Index Number, String Slicing and Joining, String
2 Methods, Formatting Strings, Lists, Creating Lists, Basic List Operations,
Indexing and Slicing in Lists, Built-In Functions Used on Lists, List Methods,
The del Statement.

Dictionaries, Creating Dictionary, Accessing and Modifying key:value Pairs in 10

Dictionaries, Built-In Functions Used on Dictionaries, Dictionary Methods, The
del Statement, Tuples and Sets, Creating Tuples, Basic Tuple Operations,
3 Indexing and Slicing in Tuples, Built-In Functions Used on Tuples, Relation
between Tuples and Lists, Relation between Tuples and Dictionaries, Tuple
Methods, Using zip() Function, Sets, Set Methods, Traversing of Sets,
Frozenset.

Files, Types of Files, Creating and Reading Text Data, File Methods to Read 10
and Write Data, Reading and Writing Binary Files, The Pickle Module,
Reading and Writing CSV Files, Python os and os.path Modules, Regular
4
Expression Operations, Using Special Characters, Regular Expression
Methods, Named Groups in Python Regular Expressions, Regular Expression
with glob Module.

Object-Oriented Programming, Classes and Objects, Creating Classes in 11

Python, Creating Objects in Python, The Constructor Method, Classes with
5
Multiple Objects, Class Attributes versus Data Attributes, Encapsulation,
Inheritance, The Polymorphism

Course Outcomes:

88
Department of Computer Science and Information Technology

 Interpret the fundamental Python syntax and semantics and be fluent in the use of Python
control flow statements.
 Express proficiency in the handling of strings and functions.
 Determine the methods to create and manipulate Python programs by utilizing the data
structures like lists, dictionaries, tuples and sets.
 Identify the commonly used operations involving file systems and regular expressions.
 Articulate the Object-Oriented Programming concepts such as encapsulation, inheritance and
polymorphism as used in Python.
TEXT BOOK
1. Gowrishankar S, Veena A, “Introduction to Python Programming”, 1st
Edition, CRC Press/Taylor & Francis, 2018. ISBN-13: 978-0815394372

REFERENCE BOOKS / WEBLINKS:
1. Jake VanderPlas, “Python Data Science Handbook: Essential Tools for Working with
Data”, 1st Edition, O'Reilly Media, 2016. ISBN-13: 978-1491912058
2. Aurelien Geron, Hands-On Machine Learning with Scikit-Learn and TensorFlow:
Concepts, Tools, and Techniques to Build Intelligent Systems”, 1st Edition,O'Reilly
Media, 2017. ISBN – 13: 978-1491962299.
3. Wesley J Chun, “Core Python Applications Programming”, 3rd Edition, Pearson
Education India, 2015. ISBN-13: 978-9332555365
4. Miguel Grinberg, “Flask Web Development: Developing Web Applications with
Python”, 2nd Edition, O'Reilly Media, 2018. ISBN-13: 978-1491991732.

CSC601 Python Programming LAB

Syllabus

1) Write a Python program to find GCD of two numbers.

2) Write a Python Program to find the square root of a number by Newton’s Method

3) Write a Python program to find the exponentiation of a number.

4) Write a Python Program to find the maximum from a list of numbers.

5) write a Python Program to perform Linear Search

89
Department of Computer Science and Information Technology

6) write a Python Program to perform Binary Search

7) Write a Python Program to perform selection sort.

8) Write a Python Program to perform insertion sort.

9) Write a Python Program to perform Merge sort.

10) Write a Python program to find first n prime numbers.

11) Write a Python program to multiply matrices.

Course Objective:

 Learn Syntax and Semantics and create Functions in Python.

 Handle Strings and Files in Python.

 Understand Lists, Dictionaries and Regular expressions in Python.

 Implement Object Oriented Programming concepts in Python

 Build Web Services and introduction to Network and Database Programming in Python.

Course Outcomes:

 Examine Python syntax and semantics and be fluent in the use of Python flow control and
functions.
 Demonstrate proficiency in handling Strings and File Systems.

 Create, run and manipulate Python Programs using core data structures like Lists,

 Dictionaries and use Regular Expressions.

 Interpret the concepts of Object-Oriented Programming as used in Python.

 Implement exemplary applications related to Network Programming, Web Services and

 Databases in Python.

CSC602 Artificial Intelligence L3:T0:P0 Credits: 03

Objective:

90
Department of Computer Science and Information Technology

1. To familiarize students with Artificial Intelligence techniques for building well-engineered

and efficient intelligent systems.
2. To learn Pattern-directed inference systems and different types of truth maintenance systems
will be discussed in length from both theoretical and applied point of view.
3. Understand some cutting edge applications of these systems will also be discussed.

Unit Topics Lectures

Meaning and definition of artificial intelligence, various types of

production systems, Characteristics of production systems,
Study and comparison of breadth first search and depth first
I 8
search. Techniques, other Search Techniques like hill Climbing,
Best first Search. A* algorithm, AO* algorithms etc, and various
types of control strategies.

Knowledge Representation, Problems in representing

knowledge, knowledge representation using propositional and
II predicate logic, comparison of propositional and predicate logic, 8
Resolution, refutation, deduction, theorem proving, inferencing,
monotonic and non-monotonic reasoning.

Probabilistic reasoning, Baye's theorem, semantic networks

III scripts schemas, frames, conceptual dependency and fuzzy logic, 8
forward and backward reasoning.

Game playing techniques like minimax procedure, alpha-beta

cut-offs etc, planning, Study of the block world problem in
IV 8
robotics, Introduction to understanding and natural languages
processing.

Introduction to learning, Various techniques used in learning,

V introduction to neural networks, applications of neural networks, 8
common sense, reasoning, some example of expert systems.

Course Outcomes:

1. Understand the basic principles and applications of Artificial Intelligence

2. Solve various problems by applying a suitable search method

91
Department of Computer Science and Information Technology

3. Represent knowledge using various different techniques

4. Apply knowledge representation and list the key aspects of planning

5. Design various logic programs with Prolog

Recommended Books

 Introduction to Artificial Intelligence – Rajendra Akerkar, PHI.

 Artificial Intelligence – A Modern Approach. Second Edition
 Stuart Russel, Peter Norvig, PHI/Pearson Education.
 Artificial Intelligence, 3rd Edition, Patrick Henry Winston.,Pearson Edition,
 Artificial Intelligence , 2nd Edition, E.Rich and K.Knight (TMH).
 Artificial Intelligence and Expert Systems – Patterson PHI
 Expert Systems: Principles and Programming- Fourth Edn,Giarrantana/ Riley, Thomson
Computer Usage /Software Requires: PROLOG Programming for Artificial Intelligence.
Ivan Bratka-Third Edition – Pearson Education

92
Department of Computer Science and Information Technology

CSE603 DATA MINING AND WARE L3:T0:P0 Credits: 03

HOUSING

Objective:
1. To understand the basic principles, concepts and applications of data warehousing and data mining.
2. To introduce the task of data mining as an important phase of knowledge recovery process. Ability to do
Conceptual, Logical, and Physical design of Data Warehouses OLAP applications and OLAP deployment.
3. Will have a   good knowledge of the fundamental concepts that provide the foundation of data mining.
4. Design a data warehouse or data mart to present information needed by management in a form that is usable for
management client.

Unit Topics Lectures

Overview
Overview, Motivation(for Data Mining),Data Mining-Definition &
Functionalities, Data Processing, Form of Data Preprocessing, Data
Cleaning: Missing Values, Noisy Data, (Binning, Clustering,
I Regression, Computer and Human inspection), Inconsistent Data, Data 8
Integration and Transformation. Data Reduction:-Data Cube
Aggregation, Dimensionality reduction, Data Compression,
Numerosity Reduction, Clustering, Discretization and Concept
hierarchy generation.
Concept Description
Definition, Data Generalization, Analytical Characterization, Analysis
of attribute relevance, Mining Class comparisons, Statistical measures
in large Databases. Measuring Central Tendency, Measuring
Dispersion of Data, Graph Displays of Basic Statistical class
II Description, Mining Association Rules in Large Databases, 8
Association rule mining, mining Single-Dimensional Boolean
Association rules from Transactional Databases- Apriori Algorithm,
Mining Multilevel Association rules from Transaction Databases and
Mining Multi-Dimensional Association rules from Relational
Databases.
Classification and prediction
What is Classification & Prediction, Issues regarding Classification
and prediction, Decision tree, Bayesian Classification, Classification
by Back propagation, Multilayer feed-forward Neural Network, Back
propagation Algorithm, Classification methods K-nearest neighbor
III classifiers, Genetic Algorithm. Cluster Analysis: Data types in cluster 8
analysis, Categories of clustering methods, Partitioning methods.
Hierarchical Clustering- CURE and Chameleon. Density Based
Methods-DBSCAN, OPTICS. Grid Based Methods- STING,
CLIQUE. Model Based Method -Statistical Approach, Neural
Network approach, Outlier Analysis.
IV Data Warehousing 8
Overview, Definition, Delivery Process, Difference between Database
93
Department of Computer Science and Information Technology

System and Data Warehouse, Multi Dimensional Data Model, Data

Cubes, Stars, Snow Flakes, Fact Constellations, Concept hierarchy,
Process Architecture, 3 Tier Architecture, Data Marting.
OLAP function and Tools
Aggregation, Historical information, Query Facility, OLAP function
V and Tools. OLAP Servers, ROLAP, MOLAP, HOLAP, Data Mining 8
interface, Security, Backup and Recovery, Tuning Data Warehouse,
Testing Data Warehouse.

Course Outcomes:
1. Understand background on data objects and statistical concepts. It also discusses the types of data to be
mined and presents a general classification of data-mining tasks.
2. Learn techniques for preprocessing data before mining. Concepts such as the cleaning, integration,
reduction, transformation, and discretization of data are discussed.
3. Provides a solid introduction to data warehousing, OLAP, and data generalization.
4. Learn and presents a detailed study of methods for data cube computation, advanced query processing,
and multidimensional data analysis.
5. Learn ways of classifying data: decision tree induction, Bayesian classification, rule-based
classification, neural networks, support vector machines, associative classification, k-nearest-neighbor
classifier, case-based reasoning, genetic algorithms, rough sets, and fuzzy set approaches.

Recommended Books-
1. Data Mining,Adriaans,Pearson
2. data Mining: Introduction and Advance Topic,Dunham&Sridhar,Pearson
3. data and text mining:A business application approach,Miller,pearson
4. Data mining :a tutorial based Primer,Roiger,Pearsion
5. Data warehousing in real world,Anahory,Pearsion
6. Modern data warehousing,mining,andvisualization:coreconcept,Marakas,pearson
7. Data mining :technique and trends,Pearson
8. Data Mining and Warehousing,Hemantjoshi,Genius publication
9. M.H.Dunham,”DataMining:Introductory and Advanced Topics” Pearson Education
10. Jiawei Han, MichelineKamber, ”Data Mining Concepts & Techniques” Elsevier
11. Sam Anahory, Dennis Murray, “Data Warehousing in the Real World : A Practical Guide for Building Decision
Support Systems, 1/e “ Pearson Education
12. Mallach,”Data Warehousing System”,McGraw –Hill

CSE603 Software Testing and Quality Assurance L:3 T:0 P:2 Credits : 4

94
Department of Computer Science and Information Technology

Course Objective:
This course offers a good understanding of the concepts, methods and techniques of
software testing and quality assurance and prepares students to be in a position to develop
error free and quality software.
Unit Topics Lectures

Introduction: Overview of Software Engineering, Software Process,

Process Models, Overview of Project Management Process and its
Phases
Software Quality Assurance Concepts and Standards: Quality
I Concepts, Quality Control, Quality Assurance, SQA Activities, 8
Software Reviews, Formal Technical Reviews, Review Guidelines,
Software Reliability, Software Safety, Quality Assurance Standards,
ISO 9000, ISO 9001:2000, ISO 9126 Quality Factors, CMM, TQM,
Six Sigma, SPICE, Software Quality Assurance Metrics.

Risk Management and Change Management: Software Risks, Risk

Identification, Risk Projection, Risk Refinement, The RMMM Plan,
Software Configuration Management, Baselines, Software
II 8
Configuration Items, SCM Process: Version Control, Change Control,
Configuration Audit, Configuration Management for Web
Engineering.

Software Testing: Testing, Verification and Validation, Test

Strategies for Conventional and Object Oriented Software, Unit
Testing, Integration Testing, Validation Testing, Alpha and Beta
III 8
Testing, System Testing, Recovery Testing, Security Testing, Stress
Testing, Performance Testing, Metrics for Source Code, Metrics for
Testing, Debugging Process, Debugging Strategies.

Testing Techniques: Software Testing Fundamentals, Black Box and

White Box Testing, Basis Path Testing, Flow Graph Notation,
Independent Program Paths, Graph Matrices, Control Structure
IV 8
Testing, Condition Testing, Data Flow Testing, Loop Testing, Graph
Based Testing Methods, Equivalence Partitioning, Boundary Value
Analysis.

Object Oriented Testing Methods: Applicability of Conventional Test

Case Design Methods, Issues in Object Oriented Testing, Fault-Based
Testing, Scenario-Based Testing, Random Testing and Partition
Testing for Classes, InterClass Test Case Design.
V Testing Process and Specialized Systems Testing: Test Plan 8
Development, Requirement Phase, Design Phase and Program Phase
Testing, Testing Client/Server Systems, Testing Web based Systems,
Testing Offthe-Shelf Software, Testing in Multiplatform Environment,
Testing for Real Time Systems, Testing Security

Course Outcomes:

 Design test cases suitable for a software development for different domains.
95
Department of Computer Science and Information Technology

 Identify suitable tests to be carried out.

 Prepare test planning based on the document.
 Document test plans and test cases designed.
 Use of automatic testing tools.
 Develop and validate a test plan.

Text Books:

1. Ian Sommerville, Software Engineering, Seventh Edition, Pearson Education.

2. R.S. Pressman, Software Engineering: A Practitioner's Approach, Sixth Edition, Tata McGraw-Hill.
3. William E. Perry, Effective Methods for Software Testing, Second Edition, John Wiley & Sons.
4. Paul C. Jorgensen, Software Testing: A Craftsman ’s Approach, Third Edition, Auerbach Publications,
Taylor and Francis Group, 2010.
5. Yogesh Singh, Software Testing, Cambridge University Press. Punjab Technical University B.Tech.
Computer Science Engineering (CSE) 47
6. K.K. Aggarwal, Yogesh Singh, Software Engineering, Second Edition, New Age International.
7. Pankaj Jalote, An Integrated Approach to Software Engineering, Second Edition, Narosa.
8. S. Limaye, Software Testing, McGraw-Hill.
9. A. C. Gillies, Software Quality: Theory & Practice, Cengage Learning.
10. Graham, Foundations of Software Testing: ISTQB Certification, Cengage Learning.

CSE603 Software Testing and Quality Assurance Lab

Testing Lab List of Experiments

1.Write programs in „C‟Language to demonstrate the working of the following a.constructs: i) do...while ii)
while….do iii) if…else iv) switch v) for
2.―A program written in „C‟language for Matrix Multiplication fails‖ Introspect the causes for its failure and
write down the possible reasons for its failure.
3.Take any system (e.g. ATM system) and study its system specifications and report the various bugs. 4.Write
the test cases for any known application (e.g. Banking application)
5.Create a test plan document for any application (e.g. Library Management System)
6.Study of any testing tool (e.g. Win runner)
7.Study of any web testing tool (e.g. Selenium)
8.Study of any bug tracking tool (e.g. Bugzilla, bugbit)
9.Study of any test management tool (e.g. Test Director)
10.Study of any open source-testing tool (e.g. Test Link)

Departmental Elective II

96
Department of Computer Science and Information Technology

CSE601 Cryptography & Network L3:T0:P0 Credits: 03

Security
Objective:
1. Understand the basic concept of Cryptography and Network Security,
2. Learning their mathematical models. Various types ciphers, DES,AES, message Authentication, digital
Signature, System.
3. Understanding Network security, virus, worms and firewall.
4. Acquire knowledge in security issues, services, goals and mechanism. Understand mathematical foundation
required for various cryptographic Algorithms.
5. Identify and classify computer and security threats and develop a security model to prevent, detect and recover
from attacks.

Unit Topics Lectures

Introduction to Cryptography
Introduction to security attacks, services and mechanism,
introduction to cryptography. Conventional Encryption: Conventional
encryption model, classical encryption techniques- substitution ciphers
and transposition ciphers, cryptanalysis, stereography, stream and
block ciphers. Modern Block Ciphers: Block ciphers principals,
I Shannon’s theory of confusion and diffusion, fiestal structure, data 8
encryption standard(DES), strength of DES, differential and linear
crypt analysis of DES, block cipher modes of operations, triple DES,
IDEA encryption and decryption, strength of IDEA, confidentiality
using conventional encryption, traffic confidentiality, key distribution,
random number generation.
Asymmetric Key Cryptography
Introduction to graph, ring and field, prime and relative prime
numbers, modular arithmetic, Fermat’s and Euler’s theorem, primality
II testing, Euclid’s Algorithm, Chinese Remainder theorem, discrete 8
logarithms. Principals of public key crypto systems, RSA algorithm,
security of RSA, key management, Diffle-Hellman key exchange
algorithm
Authentication Algorithms
Message Authentication and Hash Function: Authentication
requirements, authentication functions, message authentication code,
III hash functions, birthday attacks, security of hash functions and 8
MACS, MD5 message digest algorithm, Secure hash algorithm(SHA).
Digital Signatures: Digital Signatures, authentication protocols, digital
signature standards (DSS), proof of digital signature algorithm.
Authentication Applications
Authentication Applications: Kerberos and X.509, directory
IV authentication service, electronic mail security-pretty good privacy
8
(PGP), S/MIME.
IP Security
IP Security: Architecture, Authentication header, Encapsulating
security payloads, combining security associations, key management.
V Web Security: Secure socket layer and transport layer security, secure
8
electronic transaction (SET). System Security: Intruders, Viruses and
related threads, firewall design principals, trusted systems.

97
Department of Computer Science and Information Technology

Course Outcomes:

1. Understand the need for Kerberos authentication and the techniques involved.

2. Familiarize with network security designs using available secure solutions (such as PGP, SSL, IPSec,
etc).

3. Identify the various kinds of malicious software and their related threats.

4. Understand the principles behind design of firewalls.

Recommended Books:

1. AtulKahate "Cryptography and Network Security" Tata McGraw-Hill

2. Charlie Kaufman,RadiaPerlman,MikeSpeciner" Network Securities" Pearson,

3. J. A. Coopeer "Computer Communication Securities"TMH,

4. D.W. Davies W. L. Price "securities For computer Networks"

5. John Wiley Sons, L.Stein "Web Securities A step by step Guide " Addison Wesley.

98
Department of Computer Science and Information Technology

CSE602 Formal Language and L3:T0:P0 Credits: 03

Automata Theory

Course Learning Objectives:

1. Introduce the student to   the concepts of Theory of computation in computer

science.
2. Learning about formal languages, formal grammars, and automata.
3. Understanding about FSM
4. Learn and Apply various languages to construct context free grammar.

Unit Topics Lectures

Basic Concepts of finite state system, Deterministic
and non-deterministic finite automation and designing
regular expressions, relationship between regular
I 8
expression & Finite automata minimization of finite
automation, Mealy & Moore Machines.

Basic Definition of Formal Language and Grammars.

Regular Sets and Regular Grammars, closure properties
of regular sets, Pumping lemma for regular sets,
decision Algorithms for regular sets, graphs & trees,
II state tables & diagram, NDFA & DFA concepts, 8
Conversion of NFA to DFA, Minimization of FA,
Mealy & Moore machines, state and machine
equivalence.

Context Free Grammars - Derivations and Languages -

Relationship between derivation and derivation trees –
ambiguity problems - - Context free Grammar,
Chomsky Normal form and Greibach Normal form,
Pushdown Automata, Context Free languages,
III Chomsky Classification of languages, Simplification of 8
CFG, Pumping Lemma for context free languages,
properties of context free languages, Push down
automaton (PDA), conversion from PDA to CFG.

IV Turing machines - Computable Languages and 8

functions - Turing Machine constructions -Storage in
finite control - multiple tracks - checking of symbols -
99
Department of Computer Science and Information Technology

subroutines - two way infinite tape. Undecidability:

Properties of recursive and Recursively enumerable
languages - Universal Turing Machines as an
undecidable problem - Universal Languages - Rice’s
Theorems.

Context Sensitive Language: Chomsky Hierarchy of

Languages and automata, Basic Definition &
descriptions of Theory & Organization of Linear
bounded Automata Properties of context-sensitive
V 8
languages.
The Class P and NP Languages, NP Completeness,
Some NP Complete Problems.

Course Outcomes:

1. Understand the basic concepts of formal languages of finite automata techniques.

2. Solve regular expressions and various problems to minimize FA.

3. Apply various languages to construct context free grammar.

4. Solve various problems of applying normal form techniques, Push down automata
and Turing Machines

RECOMMENDED BOOKS:

1. Language and Machine:An Introduction to the theory of

CoputerScience,Sudkamp,3rded.,Pearson
2. Introduction of Automata Theory,Language and
Computation,Hopcroft,3 ed.,Pearson
rd

3. Inroduction to formal language,Automation theory and

computation,Krithivasan,Pearson
4. Automata,computability and complexity,Rich,Pearson

100
Department of Computer Science and Information Technology

CSE603 Human Computer Interaction & L:3 T:0 P:0 Credits : 3

Usability
Course Objective:
5. Learn the foundations of Human Computer Interaction
6. Be familiar with the design technologies for individuals and persons with
disabilities
7. Be aware of mobile HCI
8. Learn the guidelines for user interface.

Unit Topics Lectures

The Human: I/O channels – Memory – Reasoning and problem
solving; The computer: Devices – Memory – processing and
I 8
networks; Interaction: Models – frameworks – Ergonomics –
styles – elements – interactivity- Paradigms.
Interactive Design basics – process – scenarios – navigation –
screen design – Iteration and prototyping. HCI in software
process – software life cycle – usability engineering –
II 8
Prototyping in practice – design rationale. Design rules –
principles, standards, guidelines, rules. Evaluation Techniques –
Universal Design.
Cognitive models –Socio-Organizational issues and stake holder
III requirements –Communication and collaboration models- 8
Hypertext, Multimedia and WWW.
Mobile Ecosystem: Platforms, Application frameworks- Types
of Mobile Applications: Widgets, Applications, Games- Mobile
IV 8
Information Architecture, Mobile 2.0, Mobile Design: Elements
of Mobile Design, Tools.
Designing Web Interfaces – Drag & Drop, Direct Selection,
V Contextual Tools, Overlays, Inlays and Virtual Pages, Process 8
Flow. Case Studies.

Course Outcomes:

5. Design effective dialog for HCI.

6. Design effective HCI for individuals and persons with disabilities.
7. Assess the importance of user feedback.
8. Explain the HCI implications for designing multimedia/ ecommerce/ e-learning Web
sites.
9. Develop meaningful user interface.

Text Books:

5. Alan Dix, Janet Finlay, Gregory Abowd, Russell Beale, “Human Computer
Interaction”, 3rd Edition, Pearson Education, 2004 (UNIT I , II & III)
6. Brian Fling, “Mobile Design and Development”, First Edition , O‟Reilly Media Inc.,
2009 (UNIT –IV)
7. Bill Scott and Theresa Neil, “Designing Web Interfaces”, First Edition, O‟Reilly,
2009.(UNIT-V)

101
Department of Computer Science and Information Technology

CSE604 Information Retrieval L3:T0:P0 Credits: 03

Course Learning Objectives:

 Gaining of a good understanding of the foundation concepts of information

retrieval techniques
 Apply information retreival principles to locate relevant information in large
collections of data
 To understand and deploy efficient techniques for the indexing of document
objects that are to be retrieved
 To implement features of retrieval systems for web-based and other search tasks

Unit Topics Lectures

Introduction -History of IR- Components of IR – Issues
–Open source Search engine Frameworks – The impact
of the web on IR – The role of artificial intelligence
I (AI) in IR – IR Versus Web Search – Components of a 8
Search engine- Characterizing the web.

Boolean and vector-space retrieval models- Term

weighting – TF-IDF weighting- cosine similarity –
Preprocessing – Inverted indices – efficient processing
with sparse vectors – Language Model based IR –
II 8
Probabilistic IR –Latent Semantic Indexing –
Relevance feedback and query expansion.

Web search overview, web structure, the user, paid

placement, search engine optimization/ spam. Web size
measurement – search engine optimization/spam –
Web Search Architectures – crawling – meta-crawlers-
III Focused Crawling – web indexes –- Near-duplicate 8
detection – Index Compression – XML retrieval.
automaton (PDA), conversion from PDA to CFG.

IV Link Analysis –hubs and authorities – Page Rank and 8

HITS algorithms -Searching and Ranking – Relevance
Scoring and ranking for Web – Similarity – Hadoop &
Map Reduce – Evaluation – Personalized search –
Collaborative filtering and content-based
102
Department of Computer Science and Information Technology

recommendation of documents and products – handling

“invisible” Web – Snippet generation, Summarization,
Question Answering, Cross- Lingual Retrieval
Information filtering; organization and relevance
feedback – Text Mining -Text classification and
clustering – Categorization algorithms: naive Bayes;
V decision trees; and nearest neighbor – Clustering 8
algorithms: agglomerative clustering; k-means;
expectation maximization (EM).

Course Outcomes:

 To analyse the performance of retrieval systems using test collections

 To make practical recommendations about deploying information retrieval
systems in different search domains, including considerations for document
management and querying
Recommended Books:

1. Introduction to Information Retrieval - Christopher D. Manning , Prabhakar

Raghavan , Hinrich Schütze

Introduction to Information Retrieval - Stanford NLP Group

103
Department of Computer Science and Information Technology

OPEN ELECTIVE-II

MEO601 Introduction to Robotics 3L:0T:0P 3

Course Objectives:
1. To study about the components of robot.
2. To study the robot end effector.
3. To understand the robot actuators.
4. To study the robot sensors.
5. To understand the robot kinematics.

Unit Topics Hours

Introduction: definition of robot; Main components of robot:
manipulator, sensors, controller, power conversion unit; Robot
geometry: types of joints, workspace, number of degrees of freedom;
Common configurations used in arms: rectangular, cylindrical,
I spherical, joined; Classification of robot according to coordinate system: 10
Cartesian, cylindrical, polar, articulated or jointed; Classification of
robots according to control method: non-servo, servo; Robot
specifications: payload, accuracy, repeatability resolution, maximum tip
speed, reach stroke.
Robot end effector: definition, gripper, tools; Gripper : main parts,
source of power; Types of grippers: mechanical grippers, vacuum cups,
magnetic grippers, adhesive grippers, Hooks, scoops, ladles, universal
II 6
gripper; Robot Tools: Spot welding gun, pneumatic impact wrench,
pneumatic nut runner, inert gas welding torch, heating torch, grinder,
spray painting gun.
Robot actuators: Definition; Characteristics: power to weight ratio,
stiffness, compliance, reduction gears; Conventional actuators:
III 8
hydraulic actuator, pneumatic actuator, electric motor, direct drive
motor, stepper motor, servo motor.
Robot sensors: Definition; of Sensor and transducer; Calibration; Basic
categories of measuring devices: analog, discrete; Main types of
sensors: position, velocity, acceleration, force and pressure, torque, slip
and tactile, proximity. Definition of digital image, generation of digital
IV 8
image; Robot Vision System: definition, use, functions, components,
classification; vision cameras; Techniques of image processing and
analysis: Image data reduction, segmentation, feature extraction, object
recognition; Application of robot vision system.
Robot kinematics: Definition of Robot kinematics, Tool frame and
base frame. Word –coordinate system, Direct kinematics, Inverse
V kinematics, Describing position and orientation of an object in space, 8
Homogenous transformation, Translational transformations, Rotational
transformations, Denavit- Hartenberg representation.
Total 40
104
Department of Computer Science and Information Technology

Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. Understand the main components of robot.
2. Understand the robot end effector.
3. Understand the basic of robot sensors.
4. Analyze the principle of robot kinematics

Recommended Books:
1. S.R. Deb, Robotics Technology and Flexible Automation, Tata McGraw-Hill Publication.
2. S.K. Saha, Introduction to Robotics, The McGraw-Hill Publication
3. Niku, Saeed B., Introduction to Robotics Analysis, Systems, Applications, Prentice Hall of
India Private Limited. New Delhi
4. Koren, Yoram, Robotics for Engineers, McGraw-Hill Book Company, Singapore

 ECO601 Micro Electro Mechanical System 3L:0T:0P 3

Course Objectives:
1. To study about the basic of MEMS.
2. To study the electrical and mechanical properties of MEMS material.
3. To study the bulk and surface micromachining.
4. To understand the principle of polymer and optical MEMS.

Unit Topics Hours

Introduction to MEMS and Micro fabrication: History of MEMS
Development, Characteristics of MEMS-miniaturization -
microelectronics integration - Mass fabrication with precision. Micro
I 10
fabrication - microelectronics fabrication process- silicon based MEMS
processes- new material and fabrication processing- points of
consideration for processing.
Electrical and mechanical properties of MEMS material:
Conductivity of semiconductors, crystal plane and orientation, stress
and stain – definition – relationship between tensile stress and stain-
II mechanical properties of silicon and thin films, Flexural beam bending 6
analysis under single loading condition- Types of beam- deflection of
beam-longitudinal stain under pure bending spring constant, torsional
deflection, intrinsic stress, resonance and quality factor.
III Sensing and actuation: Electrostatic sensing and actuation-parallel 8
plate capacitor – Application-Inertial, pressure and tactile sensor
parallel plate actuator- comb drive. Thermal sensing and Actuations-
thermal Sensors-Actuators- Applications- Inertial, Flow and Infrared
sensors. Piezo resistive sensors- piezo resistive sensor material- stress
in flexural cantilever and membrane- Application-Inertial, pressure,
flow and tactile sensor. Piezoelectric sensing and actuation-
piezoelectric material properties-quartz-PZT-PVDF –ZnO
105
Department of Computer Science and Information Technology

Application- Inertial, Acoustic, tactile, flow-surface elastic waves

Magnetic actuation- Micro magnetic actuation principle- deposition of
magnetic materials-Design and fabrication of magnetic coil.
Bulk and surface micromachining: Anisotropic wet etching, Dry
etching of silicon, Deep reactive ion etching (DRIE), Isotropic wet
IV 8
etching, Basic surface micromachining process- structural and
sacrificial material, stiction and antistiction methods, Foundry process.
Polymer and optical MEMS: Polymers in MEMS- polymide-SU-8
liquid crystal polymer(LCP)-PDMS-PMMA-Parylene- Flurocorbon,
V Application-Acceleration, pressure, flow and tactile sensors. Optical 8
MEMS-passive MEMS optical components-lenses-mirrors-Actuation
for active optical MEMS.
Total 40

Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. Understand the basic of MEMS.
2. Understand the electrical and mechanical properties of MEMS material.
3. Understand the sensing and actuation.
4. Understand the bulk and surface micromachining.
5. Analyze the principle of polymer and optical MEMS.

Recommended Books:
1. Chang Liu, “Foundations of MEMS”, Pearson International Edition, 2006.
2. Gaberiel M.Rebiz, “RF MEMS Theory,Design and Technology”, John Wiley & Sons,2003
3. Charles P.Poole, Frank J.Owens, “Introduction to nanotechnology” John Wiley & sons, 2003

MEO602 Introduction to Spacecraft Technology 3L:0T:0P 3

Course Objectives:
1. To familiarize the student with space mechanics and space missions
2. To study the basic concepts of orbital Mechanics with particular emphasis on interplanetary
trajectories
Unit Contents Hours
BASIC CONCEPTS: The Solar System – References Frames and
Coordinate Systems – The Celestial Sphere – The Ecliptic – Motion of Vernal
1 9
Equinox – Sideral Time – Solar Time – Standard Time – The Earth’s
Atmosphere
THE GENERAL N-BODY PROBLEM: The many body Problem –
Langrange – Jacobian Identity – The Circular Restricted Three Body Problem
2 – Libration Points – Relative Motion in the N- body Problem – Two – Body 9
Problem – Satellite Orbits – Relations Between Position and Time – Orbital
Elements
3 SATELLITE INJECTION AND SATELLITE ORBIT 9
PERTURBATIONS: General Aspects of satellite Injections – Satellite Orbit

106
Department of Computer Science and Information Technology

Transfer – Various Cases – Orbit Deviations Due to Injection – Errors –

Special and General Perturbations – Cowell’s Method – Encke’s Method –
Method of vibrations of Orbital Elements – General Perturbations Approach
INTERPLANETARY TRAJECTORIES: Two Dimensional Interplanetary
Trajectories – Fast Interplanetary Trajectories – Three Dimensional
4 9
Interplanetary Trajectories – Three Dimensional Interplanetary Trajectories –
Launch if Interplanetary Spacecraft – Trajectory about the Target Planet
BALLISTIC MISSILE TRAJECTORIES AND MATERIALS: The Boost
Phase – The Ballistic Phase – Trajectory Geometry – Optimal Flights – Time
5 of Flight – Re-entry Phase – The Position of the Impact Point – Influence
Coefficients. Space Environment - Peculiarities - Effect of Space
Environment on the Selection of Spacecraft Material 9
TOTAL 45

Course Outcomes:
1. To develop space craft design by basic knowledge of Aerodynamics & Propulsion.
1. To Predict the trajectory path by laws of physics of an object
Recommended Books:
1. Cornelisse, J.W. “Rocket Propulsion and Space Dynamic”, W.H. Freeman & Co., 1984
1. Sutton, G.P., “Rocket Propulsion Elements”, John Wiley, 1993.
2. Van de Kamp, P., “Elements of Astro mechanics”, Pitman, 1979.
3. Parker E.R., “Material for Missiles and Spacecraft”, McGraw – Hill Book Co., Inc., 1982

EEO601 Automatic Control 3L:0T:0P 3

Course Objectives:
1. To provide the basics and fundamental concepts of automatic control systems
2. This will permit an engineer to exploit time domain and frequency domain tools to design
and study automatic linear control systems
Unit Contents Hours
INTRODUCTION TO AUTOMATIC CONTROL SYSTEMS:
Historical review, Examples of control systems: simple pneumatic,
1 9
hydraulic and thermal systems, series and parallel systems, analogies,
mechanical and electrical components
p control, Feedback control systems, Block diagram representation of
2 9
control systems, reduction of block diagrams, Output to input ratios
TRANSIENT AND STEADY-STATE RESPONSE ANALYSIS: Laplace
transformation, Response of systems to different inputs viz. Step, impulse,
3 pulse, parabolic and sinusoidal inputs, Time response of first and second 9
order systems, steady state errors and error constants of unity feedback
circuit
4 STABILITY ANALYSIS: Stability definitions, characteristic equation, 9
location of roots in the s-plane for stability, Routh-Hurwitz criteria of
stability, Root locus and Bode techniques, concept and construction,

107
Department of Computer Science and Information Technology

frequency response
SAMPLED DATA CONTROL SYSTEMS: Sampled data control systems
- functional elements-sampling process – z transforms- properties - inverse
5 z- transforms- response between samples- modified z-transforms - ZOH and
First order Hold process- mapping between and z planes - pulse transfer
functions - step response – stability analysis- Jury’s stability test 9
TOTAL 40
Course Outcomes:
1. Describe the transfer functions for automatic control systems; open-loop and closed-loop
systems.
2. Describe the various time domain and frequency domain tools for analysis and design of
linear control systems.
3. Describe the methods to analyse the stability of systems from transfer function forms.

Recommended Books:
1. Katsuhiko Ogata., “ Modern Control Engineering”, 4th edition, Prentice Hall of India Private
Ltd, NewDelhi, 2004
2. Nagrath, I J and Gopal, .M., “ Control Systems Engineering”, 4th edition, New Age
International Pvt. Ltd., New Delhi, 2006.
3. Benjamin, C Kuo., “ Automatic Control System”, 7th edition, Prentice Hall of India Private
Ltd, New Delhi, 1993.
4. Richard, C. Dorf and Robert H. Bishop., “Modern Control System Engineering”, Addison
Wesley, 1999

SEMESTER-VII
108
Department of Computer Science and Information Technology

Theory Practical Total

S. Course Course Hours
Marks Marks Cr
No. Code Title
L T P IA ETE IA ETE
1. CSC701 Compiler Construction 3 0 2 30 70 15 35 150 4
Microprocessor and
2. EEE708 3 0 0 30 70 100 3
Interface
CSC702 Distributed Computing 3 0 0 30 70 - - 100 3
3. Departmental Elective-III 3 0 0 30 70 - - 100 3
4. Open Elective-III 3 0 0 30 70 - - 100 3
5. CSC703 Minor Project 0 0 8 15 35 50 4
Seminar on Industrial
6. CSC704 0 0 3 50 50 1.5
Training
TOTAL 15 0 13 150 350 80 70 650 21.5

L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam,

Cr=Credits
Departmental Elective-III
CSE701 Data Analytics 3-0-0 3
CSE702 Machine Learning 3-0-0 3
CSE703 Open Source Technology 3-0-0 3
ECE709 Embedded System 3-0-0 3

Open Elective-III
MEO701 Noise Vibration and Harshness 3-0-0 3
ECO701 Introduction to Wireless Network 3-0-0 3
MAO701 Quality management 3-0-0 3
MEO702 Space Mission Design and Optimization 3-0-0 3
ECO703 Intelligent Controller 3-0-0 3

109
Department of Computer Science and Information Technology

CSC701 Compiler Construction 3L:0T:2P Credits : 4

Course Learning Objectives:

1. To understand the basic concept of compiler design, and its different phases which will be
helpful to construct new tools like LEX, YACC, etc.
2. Understand the different phases.
3. Learn Analyzing Compiler.
4. Making Compiler.

Units Topics Lectures

Compiler, Translator, Interpreter definition, Phase of compiler
introduction to one pass &Multipass compilers, Bootstrapping,
Review of Finite automata lexical analyzer, Input, buffering,
I Recognition of tokens, Idea about LEX: A lexical analyzer 14
generator, Error handling.

Review of CFG Ambiguity of grammars, Introduction to

parsing. Bottom up parsing Top down parsing techniques, Shift
reduce parsing, Operator precedence parsing, Recursive descent
parsing predictive parsers. LL grammars & passers error
II handling of LL parser.LR parsers, Construction of SLR, Conical 14
LR & LALR parsing tables, parsing with ambiguous grammar.
Introduction of automatic parser generator: YACC error
handling in LR parsers.

Syntax directed definitions; Construction of syntax trees, L-

attributed definitions, Top down translation. Specification of a
type checker, Intermediate code forms using postfix notation and
III three address code, Representing TAC using triples and 14
quadruples, Translation of assignment statement.Boolean
expression and control structures.

Storage organization, Storage allocation, Strategies, Activation

records, Accessing local and non local names in a block
IV structured language, Parameters passing, Symbol table 13
organization, Data structures used in symbol tables.

Definition of basic block control flow graphs, DAG

representation of basic block, Advantages of DAG, Sources of
optimization, Loop optimization, Idea about global data flow
V analysis, Loop invariant computation, Peephole Optimization, 13
Issues in design of code generator, A simple code generator,
Code generation from DAG.

110
Department of Computer Science and Information Technology

Course Outcomes:

1. Master using lexical analyzer and parser generator tools

2. Master building symbol tables and generating intermediate code.

3. Master generating assembly code for a RISC machine.

4. Master programming in Java.

5. Be familiar with compiler architecture.

6. Be familiar with register allocation.

7. Be exposed to compiler optimization.

Recommended Books:

1.Compilersprincipal,Technique and tools,Aho,2nded.,Pearson

2.crafting a compiler with c,Fischer,Pearson
3.Modern Compiler Design,GallesPearson
4.the Essence of Compilers,Hunter,Pearson
5.Compilerdesign,Chattopadhyay,PHI
6.Compiler design in C,Holub,PHI

EEE708 Microprocessors & Interface 3L:0T:0P 3 Credits

Course Objective:
a) To investigate the programmer’s model of a microprocessor, appreciate methods of connecting common
peripheral devices,
b) To understand the ways in which microprocessors can be used in automated systems.
c) Students learns about the languages.
d) Different types of memory.

Unit Topics Lectures

Fundamentals of Microprocessors:
Fundamentals of Microprocessor Architecture. 8-bitMicroprocessor and
Microcontroller architecture, Comparison of 8-bit microcontrollers, 16-bit
I and 32-bit microcontrollers. Definition of embedded system and its 7
characteristics, Role of microcontrollers in embedded Systems. Overview
of the 8051 family.

The 8051 Architecture

Internal Block Diagram, CPU, ALU, address, data and control bus, working
registers, SFRs, Clock and RESET circuits, Stack and Stack Pointer,
II 8
Program Counter, I/O ports, Memory Structures, Data and Program
Memory, Timing diagrams and Execution Cycles.

111
Department of Computer Science and Information Technology

Instruction Set and Programming

Addressing modes: Introduction, Instruction syntax, Data types,
Subroutines Immediate addressing, Register addressing, Direct addressing,
Indirect addressing, Relative addressing, indexed addressing, Bit inherent
addressing, bit direct addressing. 8051 Instruction set, Instruction timings.
III 8
Data transfer instructions, Arithmetic instructions, Logical instructions,
Branch instructions, Subroutine instructions, Bit manipulation instruction.
Assembly language programs, C language programs. Assemblers and
compilers. Programming and debugging tools.

Memory and I/O Interfacing

Memory and I/O expansion buses, control signals, memory wait states.
IV Interfacing of peripheral devices such as General Purpose I/O, ADC, DAC, 8
timers, counters, memory devices.

External Communication Interface

Synchronous and Asynchronous Communication. RS232, SPI, I2C.
Introduction and interfacing to protocols like Blue-tooth and Zig-bee.
V LED, LCD and keyboard interfacing. Stepper motor interfacing, DC Motor 8
interfacing, sensor interfacing.

Course Outcomes:

At the end of this course, students will demonstrate the ability to

a) Do assembly language programming.
b) Do interfacing design of peripherals like I/O, A/D, D/A, timer etc.
c) Develop systems using different microcontrollers.

Text /Reference Books:

1. M. A.Mazidi, J. G. Mazidi and R. D. McKinlay, “The8051Microcontroller and Embedded
2. Systems: Using Assembly and C”,Pearson Education, 2007.
3. K. J. Ayala, “8051 Microcontroller”, Delmar Cengage Learning,2004.
4. R. Kamal, “Embedded System”, McGraw Hill Education,2009.
5. R. S. Gaonkar, “, Microprocessor Architecture: Programming and Applications with the
6. 8085”, Penram International Publishing, 1996
7. D.A. Patterson and J.H. Hennessy, "Computer Organization and Design: The
8. Hardware/Software interface”, Morgan Kaufman Publishers, 2013.
9. D. V. Hall, “Microprocessors & Interfacing”, McGraw Hill Higher Education, 1991.

Experiments list of Microprocessors

1. Study the hardware, functions, memory structure and operation of 8085-Microprocessor kit.
2. Program to perform integer division: (1) 8-bit by 8-bit (2) 16 bit by 8 bit.
3. Transfer of a block of data in memory to another place in memory
4. Transfer of black to another location in reverse order.
5. Searching a number in an array.
6. Sorting of array in: (1) Ascending order (2) Descending order.
7. Finding party of a 32-bit number.
8. Program to perform following conversion (1) BCD to ASCII (2) BCD to hexadecimal.
9. Program to multiply two 8–bit numbers & generate and sum 15 Fibonacci numbers

112
Department of Computer Science and Information Technology

CSC702 Distributed Computing 3L:0T:0P Credits : 3

OBJECTIVES:
 To provide knowledge on principles underlying the design of distributed and parallel systems
 To lay the foundations of Distributed and Parallel Systems.
 To introduce the idea of Distributed and Parallel Architecture.
 To introduce the idea of Distributed operating system and related issues

Units Topics Lectures

INTRODUCTION TO DISTRIBUTED AND PARALLEL SYSTEMS

Characterization of Distributed Systems – System Models
I –Introduction to Parallel Computing Systems – Scope of Parallel 8
Computing –Parallel Programming Platforms Dichotomy –
Communication Cost in Parallel Machines –Principles of Parallel
Algorithm Design.
COMMUNICATION IN DISTRIBUTED AND PARALLEL
ENVIRONMENT Paradigms in Distributed Applications – Remote
II Procedure Call – Remote Object Invocation – Group Communication 8
– Threads in Distributed Systems –Basic Communication Operations
in Parallel Systems –Principles of Message-Passing Programming
Paradigm– The Building Blocks– Message Passing Interface (MPI).
DISTRIBUTED OPERATING SYSTEMS
III Issues in Distributed Operating System – Clock Synchronization – 8
Causal Ordering – Global States – Election Algorithms – Distributed
Mutual Exclusion – Distributed Deadlock Management.
DISTRIBUTED RESOURCE MANAGEMENT
IV Distributed Shared Memory Algorithms – Distributed Coherence 8
Protocols – Data Consistency Models – Distributed Scheduling –Load
Distributing and Sharing – Distributed File Systems.
FAULT TOLERANCE AND CONSENSUS 8 Introduction to Fault
Tolerance – Distributed Commit Protocols – Voting Protocols –
V 8
Coordination and Agreement in Groups – Consensus – Byzantine
Fault Tolerance – Impossibilities in Fault Tolerance.

OUTCOMES:
On Completion of the course, the students should be able to:
 Articulate the principles and standard practices underlying the design of distributed and parallel systems. 
Explain the core issues of distributed and parallel systems.
 Appreciate the difficulties in implementing basic communication in parallel and distributed systems.
 Have knowledge on the substantial difficulty in designing parallel and distributed algorithms in comparison
to centralized algorithms.
 Appreciate the issues in distributed operating system, resource management and fault tolerance

TEXT BOOKS:

113
Department of Computer Science and Information Technology

1. George Coulouris, Jean Dollimore, Tim Kindberg, ―Distributed Systems Concepts and Design‖, Fifth
Edition, Pearson Education Asia, 2011.
2. MukeshSinghal, ―Advanced Concepts In Operating Systems‖, McGraw Hill Series in Computer Science,
1994.
3. Introduction to Parallel Computing, Second Edition, Ananth Grama, Anshul Gupta, George Karypis, Vipin
Kumar,: Addison Wesley 2003
REFERENCES:
1. Ajay D. Kshemkalyani and Mukesh Singhal, ―Distributed Computing: Principles, Algorithms and
Systems‖, Cambridge Press.
2. A.S.Tanenbaum, M.Van Steen, ―Distributed Systems‖, Pearson Education, 2004.
3. M.L.Liu, ―Distributed Computing Principles and Applications‖, Pearson Addison Wesley, 2004.
4. Tom White, ―Hadoop: The Definitive Guide‖, O'REILLY Media, 2009.

Departmental Elective- III

CSE701 Data Analytics 3L:0T:0P Credits : 3

Course Learning Objectives:

 Be exposed to big data
 Learn the different ways of Data Analysis
 Be familiar with data streams
 Learn the mining and clustering
 Apply the statistical analysis methods.
 Compare and contrast various soft computing frameworks.
 Design distributed file systems.
 Apply Stream data model.
 Use Visualisation techniques

Units Topics Lectures

Introduction to Big Data Platform – Challenges of conventional

systems – Web data – Evolution of Analytic scalability, analytic
processes and tools, Analysis vs reporting – Modern data
I analytic tools, Stastical concepts: Sampling distributions, 8
resampling, statistical inference, prediction error.

Regression modeling, Multivariate analysis, Bayesian modeling,

inference and Bayesian networks, Support vector and kernel
methods, Analysis of time series: linear systems analysis,
nonlinear dynamics – Rule induction – Neural networks:
II learning and generalization, competitive learning, principal 8
component analysis and neural networks; Fuzzy logic: extracting
fuzzy models from data, fuzzy decision trees, Stochastic search
methods.

114
Department of Computer Science and Information Technology

Introduction to Streams Concepts – Stream data model and

architecture – Stream Computing, Sampling data in a stream –
Filtering streams – Counting distinct elements in a stream –
Estimating moments – Counting oneness in a window –
III Decaying window – Realtime Analytics Platform(RTAP) 8
applications – case studies – real time sentiment analysis, stock
market predictions.

Mining Frequent item sets – Market based model – Apriori

Algorithm – Handling large data sets in Main memory – Limited
Pass algorithm – Counting frequent item sets in a stream –
Clustering Techniques – Hierarchical – K- Means – Clustering
IV high dimensional data – CLIQUE and PROCLUS – Frequent 8
pattern based clustering methods – Clustering in non-Euclidean
space – Clustering for streams and Parallelism.

MapReduce – Hadoop, Hive, MapR – Sharding – NoSQL

Databases – S3 – Hadoop Distributed file systems –
V Visualizations – Visual data analysis techniques, interaction 8
techniques; Systems and applications.

Course Outcomes:
Students will able to:
1. Explain the motivation for big data systems and identify the main sources of Big Data in the real
world.
2. Demonstrate an ability to use frameworks like Hadoop, NOSQL to efficiently store retrieve and
process Big Data for Analytics.
3. Implement several Data Intensive tasks using the Map Reduce Paradigm
4. Apply several newer algorithms for Clustering Classifying and finding associations in Big Data
5. Design algorithms to analyze Big data like streams, Web

Recommended Books:
1. Michael Berthold, David J. Hand, Intelligent Data Analysis, Springer, 2007.
2. Anand Rajaraman and Jeffrey David Ullman, Mining of Massive Datasets,Cambridge
University Press, 2012.

CSE702 Machine Learning L3-T0-P0 Credits:03

115
Department of Computer Science and Information Technology

Course Learning Objectives:

Machine learning uses interdisciplinary techniques such as statistics, linear algebra,

optimization, and computer science to create automated systems that can sift through large volumes
of data at high speed to make predictions or decisions without human intervention.

Machine learning as a field is now incredibly pervasive, with applications spanning from business
intelligence to homeland security, from analyzing biochemical interactions to structural monitoring
of aging bridges, and from emissions to astrophysics, etc.

This class will familiarize students with a broad cross-section of models and algorithms for machine
learning, and prepare students for research or industry application of machine learning techniques.

Unit Topics Lectures

Definition of learning systems. Goals and applications of

machine learning. Aspects of developing a learning system:
training data, concept representation, function approximation.

The concept learning task. Concept learning as search through a

I hypothesis space. General-to-specific ordering of hypotheses. 13
Finding maximally specific hypotheses. Version spaces and the
candidate elimination algorithm. Learning conjunctive concepts.
The importance of inductive bias.

Representing concepts as decision trees. Recursive induction of

decision trees. Picking the best splitting attribute: entropy and
information gain. Searching for simple trees and computational
complexity. Occam's razor. Overfitting, noisy data, and pruning.

Ensemble Learning ,Measuring the accuracy of learned

hypotheses. Comparing learning algorithms: cross-validation,
learning curves, and statistical hypothesis testing.

II learning in the limit; probably approximately correct (PAC) 14

learning. Sample complexity: quantifying the number of
examples needed to PAC learn. Computational complexity of
training. Sample complexity for finite hypothesis spaces. PAC
results for learning conjunctions, kDNF, and kCNF. Sample
complexity for infinite hypothesis spaces, Vapnik-Chervonenkis
dimension.

116
Department of Computer Science and Information Technology

Rule Learning: Propositional and First-Order 

Translating decision trees into rules. Heuristic rule induction
using separate and conquer and information gain. First-order
Horn-clause induction (Inductive Logic Programming) and Foil.
Learning recursive rules. Inverse resolution, Golem, and Progol.

Artificial Neural Networks 

Neurons and biological motivation. Linear threshold units.
III Perceptrons: representational limitation and gradient descent 14
training. Multilayer networks and backpropagation. Hidden
layers and constructing intermediate, distributed representations.
Overfitting, learning network structure, recurrent networks.

Support Vector Machines 

Maximum margin linear separators. Quadractic programming
solution to finding maximum margin separators. Kernels for
learning non-linear functions.

Bayesian Learning 
Probability theory and Bayes rule. Naive Bayes learning
algorithm. Parameter smoothing. Generative vs. discriminative
training. Logisitic regression. Bayes nets and Markov nets for
representing dependencies.

Instance-Based Learning 
Chapter 8. Constructing explicit generalizations versus
comparing to past specific examples. k-Nearest-neighbor
IV algorithm. Case-based learning. 14

Text Classification 
Bag of words representation. Vector space model and cosine
similarity. Relevance feedback and Rocchio algorithm. Versions
of nearest neighbor and Naive Bayes for text.

V Clustering and Unsupervised Learning  14

Learning from unclassified data. Clustering. Hierarchical
Aglomerative Clustering. k-means partitional clustering.
Expectation maximization (EM) for soft clustering.
Semi-supervised learning with EM using labeled and

117
Department of Computer Science and Information Technology

unlabled data.

Language Learning 
Classification problems in language: word-sense
disambiguation, sequence labeling. Hidden Markov
models (HMM's). Veterbi algorithm for determining
most-probable state sequences. Forward-backward EM
algorithm for training the parameters of HMM's. Use of
HMM's for speech recognition, part-of-speech tagging,
and information extraction. Conditional random fields
(CRF's). Probabilistic context-free grammars (PCFG).
Parsing and learning with PCFGs. Lexicalized PCFGs.

Course Outcomes:

By the end of the course, students should be able to:  Develop an appreciation for what is involved
in learning models from data.
 Understand a wide variety of learning algorithms.
 Understand how to evaluate models generated from data.
 Apply the algorithms to a real-world problem, optimize the models learned and report on the
expected accuracy that can be achieved by applying the models.

Recommended books:
1. Stephen Marsland, Machine Learning: An Algorithmic Perspective.
http://www.amazon.com/Machine-Learning-Algorithmic-PerspectiveRecognition/dp/
1420067184 .
2. Christopher M. Bishop, SOFT COMPUTING and Machine Learning.
http://research.microsoft.com/en-us/um/people/cmbishop/prml/.
3. Tom Mitchell, Machine Learning, http://www.cs.cmu.edu/~tom/mlbook.html.

CSE703 OPEN SOURCE L:3 T:0 P:0 Credits : 3

118
Department of Computer Science and Information Technology

TECHNOLOGY

Course Objective:
9. Here you will learn how we decrease software costs, increase security and
stability (especially in regard to malware),
10. Understand Protecting privacy, and giving users more control over their own
hardware. anyone is freely to use, copy, study, and change the software in any
way, and the source code is openly shared so that people are encouraged to
voluntarily improve the design of the software.
11. Learn about new technologies about privacy and control.

Unit Topics Lectures

OST overview: Evolution & development of OST and

contemporary technologies, Factors leading to its growth. Open
Source Initiative (OSI), Free Software Foundation and the GNU
I Project, principle and methodologies. Contexts of OST (India & 8
international).Applications of open source (open source teaching
and open source media) Risk Factors. Myths regarding open
source.

Philosophy of Software Freedom, Free Software, OSS, Closed

software, Public Domain Software, Shared software, Shared
II source. Detail of few OSS like Open Audio, Video, 2d & 3d 8
graphics software, system tools, office tools, Networking&
internet, Security, Educational tools and Games.

Open Source Development Model, Starting and Maintaining an

Open Source Project, Open Source Hardware, Open Source
III 8
Design, Ongoing OS Projects (i.e. examples of few good
upcoming software projects.) Case Study: - Linux, Wikipedia.

What Is A License, How to create your own Licenses? Important

IV FOSS Licenses (Apache, BSD, GPL, LGPL), copyrights and 8
copylefts, Patents

Social and Financial impacts of open source technology,

Economics of FOSS: Zero Marginal Cost, Income generation
V 8
opportUNITies, Problems with traditional commercial software,
Internationalization, Open Source as a Business Strategy.

Text Books:

119
Department of Computer Science and Information Technology

8. Saurabh, "UNIX Programming: The First Drive", Wiley India

9. Sumitabh Das, "Unix Concepts and applications", TMH, 2003
10. Johnson , Shell scripting, Wiley
11. YashwantKanitkar, "Unix Shell Programming", BPB, 2009
12. Mike Joy, Stephen Jarvis, Michael Luck, "Introducing Unix and Linux", Palgrave
Macmillan.

ECE707 Embedded Systems 3L:0T:0P 3 credits

Course Objectives:
1. The goal of the course is to teach the concepts C Language and object
oriented programming, PIC architecture and peripheral interfacing.
2. To read and understand the C and C++ programming, PIC microcontroller
architecture and programming
3. The course focuses on how to write program and peripheral interfacing of
PIC microcontroller and develop the applications.

UNITS CONTENTS Hours

Embedded system introduction

Introduction to embedded system, embedded system architecture,
classifications of embedded systems, challenges and design
1 issues in embedded systems, fundamentals of embedded 8
processor and microcontrollers, CISC vs. RISC, fundamentals of
Vonneuman/Harvard architectures, types of microcontrollers,
selection of microcontrollers.
Concepts of C programming
C concepts and programming- data types, advanced data
types- register, constants, IO operations, operators, operator
precedence and associatively, Conditional statements &
loops, arrays, single and double dimensional arrays, stings
and string operations.
Functions: Parameter passing-Pass by Value, Pass by Reference;
2 creating modular programs using functions, Recursive functions. 8
Structures & Unions: declaration, accessing members of structure,
difference between structure and union, User Defined Data
Types, Enumerated data type.
Pointers: pointer basics and concepts, arrays and pointer relation,
passing pointers to functions, dynamic memory allocation.
Files and file operations. Linked lists, stacks and queues. Pre-
processor directives, command line arguments.

3 Object oriented programming 8

Differences between C and C++, Fundamentals of object oriented
programming; OOP vs. Procedure oriented programming, OOP
concepts: classes, objects, abstraction, polymorphism,
inheritance, data binding and encapsulation.
Ba s ic s of C++: features of C++, data types, standard I/O,
arrays and strings in C++.
Classes in C++, instantiation, creating objects and object scope,
120
Department of Computer Science and Information Technology

data abstraction, data encapsulation, constructors and destructors,

methods and access modifiers, function and operator overloading
Inheritance-Base and Derived classes, Inheritance types, Scope
Resolution operator; polymorphism and virtual functions, exception
handling

PIC Architecture
Introduction to PIC microcontrollers, PIC architecture,
4 comparison of PIC with other CISC and RISC based systems and 8
microprocessors, memory mapping, assembly language
programming, addressing modes, instruction set.

I/O Programming P IC I/O ports, I/O bit manipulation

5 programming, timers/counters, programming to generate delay
and wave form generation, I/O programming, LEDs, 8
7segment L E D ’s, LCD and Keypad interfacing.
TOTAL 40

Course Outcomes:
1. Understand the fundamentals of embedded systems.
2. Understand the differences of microprocessor and controller.
3. Understanding of C and basics of C.
4. Understand the OOP concepts.
5. Understand the concepts of classes, objects, methods, constructors,
destructors in C++.
6. Understand the microcontroller architecture (PIC).
7. Understand and able to write the assemble language program.
8. Understand and able to write the I/O and timers/counter programming.

Text/Reference Books:
1. J.W. Valvano, "Embedded Microcomputer System: Real Time Interfacing",
Brooks/Cole, 2000.
2. Jack Ganssle, "The Art of Designing Embedded Systems", Newness,1999.
3. V.K. Madisetti, "VLSI Digital Signal Processing", IEEE Press (NY, USA),1995.
4. David Simon, "An Embedded Software Primer", Addison Wesley,2000.
5. K.J. Ayala, "The 8051 Microcontroller: Architecture, Programming, and
Applications", Penram Intl,1996.

Open Elective-III

MEO701 Noise vibration and Harshness 3L:0T:0P 3

121
Department of Computer Science and Information Technology

Course Objectives:
1. To study about the fundamentals of acoustics.
2. To study the effects of noise.
3. To understand the transportation noise and vibration source.
4. To study the reduction of noise and vibration.
5. To understand the principle of noise and vibration transducer.

Unit Topics Hours

Fundamentals of Acoustics and Noise, Vibration: Introduction,
classification of vibration and noises: Theory of Sound Predictions and
Measurement, Sound Sources, Sound Propagation in the Atmosphere,
Sound Radiation from Structures and Their Response to Sound, General
I 10
Introduction to Vibration, free and forced vibration, undamped and
damped vibration, linear and non linear vibration, response of damped
and undamped systems under harmonic force, analysis of single degree
and two degree of freedom systems.
Effects of Noise, Blast, Vibration, and Shock on People: General
Introduction to Noise and Vibration Effects on People and Hearing
Conservation, Noise Exposure, Noise-Induced Annoyance, Effects of
Infrasound, Low-Frequency Noise, and Ultrasound on People, Effects of
II 6
Intense Noise on People and Hearing Loss, Effects of Vibration on
People, Effects of Mechanical Shock on People, Rating Measures,
Descriptors, Criteria, and Procedures for Determining Human Response
to Noise.
Introduction to Transportation Noise and Vibration Sources: Noise
Characteristics of engines, engine overall noise levels, assessment of
III combustion noise, assessment of mechanical noise, engine radiated 8
noise, intake and exhaust noise, engine accessory contributed noise,
transmission noise, aerodynamic noise, tyre noise, brake noise.
Reduction of noise and vibrations: Vibration isolation, tuned
absorbers, unturned viscous dampers, damping treatments, application
IV 8
dynamic forces generated by IC engines, engine isolation, crank shaft
damping, modal analysis of the mass elastic model shock absorbers.
Noise and Vibration Transducers, Analysis Equipment, Signal
Processing, and Measuring Techniques: General Introduction toNoise
and Vibration Transducers, Measuring Equipment,Measurements, Signal
V 8
Acquisition and Processing, AcousticalTransducer Principles and Types
of Microphones, VibrationTransducer Principles and Types of Vibration
Transducers, SoundLevel Meters, Noise Dosimeters.
Total 40

Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. Understand the basic of acoustics and noise.
1. Understand the effect of noise.
2. Understand the transportation noise and vibration sources.
3. Understand the reduction of noise and vibration.
4. Analyze the principle of noise and vibration transducer
Recommended Books:
1. Colin H Hansen ―Understanding Active Noise Cancellation― , Spon Press , London 2003
1. Kewal Pujara ―Vibrations and Noise for Engineers, Dhanpat Rai & Sons, 1992.
2. Singiresu S.Rao,―Mechanical Vibrations‖ - Pearson Education, ISBM –81-297-0179-2004.
122
Department of Computer Science and Information Technology

ECO701 Introduction to Wireless Network 3L:0T:0P 3

Course Objectives:
1. To study about the wireless LAN.
2. To study the mobile network layer.
3. To understand the 3G overview.
4. To study the internetworking between WLANS and WWANS.
5. To understand the principle of 4G and beyond.
Unit Topics Hours
Wireless Lan: Introduction-WLAN technologies: - IEEE802.11:
System architecture, protocol architecture, 802.11b, 802.11a – Hiper
I 10
LAN: WATM, BRAN, HiperLAN2 – Bluetooth: Architecture, WPAN –
IEEE 802.15.4, Wireless USB, Zigbee, 6LoWPAN, WirelessHART.
Mobile Network Layer: Introduction - Mobile IP: IP packet delivery,
Agent discovery, tunneling and encapsulation, IPV6-Network layer in
II 6
the internet- Mobile IP session initiation protocol - mobile ad-hoc
network: Routing: Destination Sequence distance vector, IoT: CoAP.
3G Overview: Overview of UTMS Terrestrial Radio access network-
UMTS Core network Architecture: 3GPP Architecture, User equipment,
III 8
CDMA2000 overview- Radio and Network components, Network
structure, Radio Network, TD-CDMA, TD – SCDMA.
Internetworking between WLANS and WWANS: Internetworking
objectives and requirements, Schemes to connect WLANS and 3G
IV Networks, Session Mobility, Internetworking Architecture for WLAN 8
and GPRS, System Description, Local Multipoint Distribution Service,
Multichannel Multipoint Distribution System.
4G and beyond : Introduction – 4G vision – 4G features and challenges
- Applications of 4G – 4G Technologies: Multicarrier Modulation,
V Smart antenna techniques, IMS Architecture, LTE, Advanced 8
Broadband Wireless Access and Services, MVNO.

Total 40
Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. Understand the basic of wireless LAN.
2. Understand the mobile network layer.
3. Understand the 3G overview.
4. Understand the internetworking between WLANS and WWANS.
5. Analyze the principle of 4G and beyond

Recommended Books:
1. Jochen Schiller, ‖Mobile Communications‖, Second Edition, Pearson Education 2012.(Unit
I,II,III)
1. Vijay Garg, ―Wireless Communications and networking‖, First Edition, Elsevier 2007.(Unit
IV,V)
2. Anurag Kumar, D.Manjunath, Joy kuri, ―Wireless Networking‖, First Edition, Elsevier
2011.

MAO701 Quality management 3L:0T:0P 3

123
Department of Computer Science and Information Technology

Course Objectives:
1. To understand evolution of Quality Control, concept change, TQM Modern concept, Quality
concept in design.
2. To understand effects of human factor in quality.
3. To prepare Control Charts and analyze them.
4. To learn Defects diagnosis and prevention defect study.
5. To learn concepts of ISO-9000.

Unit CONTENTS Hours

Quality Concepts: Evolution of Quality Control, concept change, TQM
Modern concept, Quality concept in design, Review of design, Evolution of
proto type.
Control on Purchased Product Procurement of various products,
1 evaluation of supplies, capacity verification, Development of sources, 8
procurement procedure.
Manufacturing Quality Methods and techniques for manufacture,
inspection and control of product, quality in sales and services, guarantee,
analysis of claims.
Quality Management
Organization structure and design, quality function, decentralization,
designing and fitting, organization for different type products and company,
economics of quality value and contribution, quality cost, optimizing
2 8
quality cost, seduction program.
Human Factor in quality
Attitude of top management, cooperation of groups, operators attitude,
responsibility, causes of apparatus error and corrective methods.
Control Charts
Theory of control charts, measurement range, construction and analysis of
R charts, process capability study, use of control charts.
3 8
Attributes of Control Chart
Defects, construction and analysis of charts, improvement by control chart,
variable sample size, construction and analysis of C charts.
Defects diagnosis and prevention defect study, identification and analysis
of defects, correcting measure, factors affecting reliability, MTTF,
4 calculation of reliability, building reliability in the product, evaluation of 8
reliability, interpretation of test results, reliability control, maintainability,
zero defects, quality-circle.
ISO-9000 and its concept of Quality Management
5
ISO 9000 series, Taguchi method, JIT in some details 8
TOTAL 40

Course Outcomes:
1. Understand Procurement of various products, evaluation of supplies, capacity verification,
Development of sources, procurement procedure and Manufacturing Quality.
2. Understand Attitude of top management, cooperation of groups, operator’s attitude,
responsibility, causes of apparatus error and corrective methods.
3. Learn planning and production control, quality control, marketing, industrial relations, sales
and purchases, advertisement.
4. Identify and analyze the defects, take corrective measure, and identify factors affecting
reliability, MTTF, and be able to calculate reliability.
124
Department of Computer Science and Information Technology

5. Understand ISO 9000 series, Taguchi method, JIT in some details.

Recommended Books:
1. Lt. Gen. H. Lal, “Total Quality Management”, Eastern Limited, 1990.
2. Greg Bounds, “Beyond Total Quality Management”, McGraw Hill, 1994.
3. Menon, H.G, “TQM in New Product manufacturing”, McGraw Hill 1992.
4. Subburaj, Total Quality Management, McGrawhill Education

MEO702 Space Mission Design and Optimization 3L:0T:0P 3

Course Objectives:
1. This course builds on university level physics and mechanics to introduce and illustrate orbital
dynamics as is applied in the design of space missions.
2. Simple tools will be provided to allow planning of missions on orbit around Earth or in the Solar
System.

Unit Contents Hours

Motivation behind space exploration and utilization, The space pioneers,
and brief history of human space exploration, The main space agencies in
the world, Space utilization and exploration, Review of laws of mechanics,
1 Introduction to the space environment including the transition from the 9
atmosphere to space, microgravity, the electrical and thermal
environments, orbital lifetime, space debris and asteroids/comets collision
threats
Orbital Mechanics I - dynamics of spaceflight; concept of gravitational
well; orbital motion; Kepler’s Laws; the case of circular orbits, Orbital
Mechanics II - elliptical orbits; reference frames; orbital maneuvers;
2 9
perturbations of orbital motion; peculiar orbits, Rendezvous in Low Earth
Orbit (LEO); relative motion of the chaser vs. the target. Strategy to
successfully achieve a rendezvous in LEO
Interplanetary trajectories; Gravity Assist or Slingshot maneuvers
Propulsion in space - law of propulsion; concept of specific impulse; types
3 of thrusters; electric propulsion; ascent into space, and re-entry, Attitude 9
measurement and control; attitude change; electrical power generation and
distribution (overview); thermal balance (overview)
Space tethers (or cables) as an alternate method to generate electrical
4 power on orbit; Dynamic applications of space tethers, Shuttle-based tether 9
missions, Reliability; systems redundancy; risk management;
safety design for space systems; human rating concept, Space Shuttle -
concept; design; operations; Challenger and Columbia accidents, ISS;
Soyuz and Progress; Logistic supply to ISS with ATV, HTV, and
5 commercial vehicles Extravehicular Activity (EVA) and space suits, space
robotics Astronaut training , commercial space , suborbital flights Orion 9
and the Space Launch System (SLS) Future of Space Exploration and
Conclusion
TOTAL 40

Course Outcomes:
125
Department of Computer Science and Information Technology

1.Students able to learn Fundamental laws of mechanics and orbital mechanics

2.Students able to learn Types of space missions and their objectives
3.Students able to learn Key design elements for successful missions, in particular related to
human spaceflight
Recommended Books:
1. Osborne, G. F. and Ball, K. J., Space Vehicle Dynamics, Oxford Univ. Press (1967).
2. Hale, F. J., Introduction to Space Flight, Prentice Hall (1994).
3. Naidu, D. S., Optimal Control Systems, CRC Press (2003).
4. Chobotov, V., Orbital Mechanics, AIAA Edu. Series (2002).
5. Griffin, M. D. and French, J. R., Space Vehicle Design, 2nd ed., AIAA (2004).
6. Newcomb, R. W. and Kirk, D. E., Optimal Control Theory: An Introduction, Prentice Hall
(1990).
7. Bulirsch, R., Miele, A., Stoer, J., and Well, K. H. (Eds.), Optimal Control: Calculus of
Variations, Optimal Control Theory and Numerical Methods, BirkhauserVerlag (1993).

ECO703 Intelligent controller 3L:0T:0P 3

Course Objectives:
1. Students completing this course will obtain a basic understanding of fuzzy logic systems and
artificial neural networks,
2. Students will understand the advantages and disadvantages of these methods relative to other
control methods.
3. Students will be aware of current research trends and issues.
4. Students will be able to design control systems using fuzzy logic and artificial neural
networks.
 
Unit Topics Hours
Introduction : Approaches to intelligent control. Architecture for
intelligent control. Symbolic reasoning system,
I rule-based systems, the AI approach. Knowledge representation. Expert 6
systems.

 ARTIFICIAL NEURAL NETWORKS : Concept of Artificial Neural

Networks and its basic mathematical model, McCulloch-Pitts neuron
model, simple perceptron, Adaline and Madaline, Feed-forward
Multilayer Perceptron. Learning and Training the neural network. Data
II 6
Processing: Scaling, Fourier transformation, principal-component
analysis and wavelet transformations. Hopfield network, Self-organizing
network and Recurrent network. Neural Network based controller

GENETIC ALGORITHM – Basic concept of Genetic algorithm and

detail algorithmic steps, adjustment of free parameters Solution of typical
control problems using genetic algorithm. Concept on some other search
III 8
techniques like tabu search and ant-colony search techniques for solving
optimization problems.

Chassis maintenance - repair and overhauling : Mechanical and

automobile clutch and gear box, servicing and maintenance, Maintenance
servicing of propeller shaft and differential system. Maintenance
IV 8
&servicing of suspension systems. Brake systems, Types and servicing
techniques. Steering Systems, overhauling and Maintenance. Wheel
alignment, computerized alignment and Wheel balancing
126
Department of Computer Science and Information Technology

FUZZY LOGIC SYSTEM: Introduction to crisp sets and fuzzy sets,

basic fuzzy set operation and approximate reasoning. Introduction to
fuzzy logic modeling and control. Fuzzification, inferencing and
V defuzzification. Fuzzy knowledge and rule bases. Fuzzy modeling and 8
control schemes for nonlinear systems. Self organizing fuzzy logic
control. Fuzzy logic control for nonlinear time-delay system.

APPLICATIONS:GA application to power system optimization

problem, Case studies: Identification and control of linear and nonlinear
dynamic systems using Matlab-Neural Network toolbox. Stability
VI analysis of Neural-Network interconnection systems. Implementation of 6
fuzzy logic controller using Matlab fuzzy-logic toolbox. Stability analysis
of fuzzy control systems.

Total 40

Course Outcomes:
At the end of this course students will demonstrate the ability to:
1. learn basics of fuzzy set theory and neural networks
2. implement fuzzy based decision-making systems
3. implement Neural Network based approximate
4. design Fuzzy and Neural Network based control system
5. design ANFIS based control system
6. implement soft computing techniques controllers using simulation tools

Recommended Books:
1. Jacek.M.Zurada, "Introduction to Artificial Neural Systems", Jaico Publishing House, 1999.
2. KLIR G.J. & FOLGER T.A. "Fuzzy sets, uncertainty and Information", Prentice-Hall of
India Pvt.Ltd., 1993.
3. Zimmerman H.J. "Fuzzy set theory-and its Applications"-Kluwer Academic Publishers,
1994.
4. Driankov, Hellendroon, "Introduction to Fuzzy Control", Narosa Publishers.
5. Goldberg D.E. (1989) Genetic algorithms in Search, Optimization and Machine
learning, Addison Wesley.

SEMESTER-VIII
S. Course Course Hours Theory Practical Total Cr
127
Department of Computer Science and Information Technology

Marks Marks
No. Code Title
L T P IA ETE IA ETE
1 CSC802 Distributed Databases 3 0 0 30 70 100 3
2 CSC803 Digital Image Processing 3 0 0 30 70 100 3
Departmental Elective-
3 3 0 0 30 70 - - 100 3
IV
4 Open Elective-IV 3 0 0 30 70 - - 100 3
5 CSC801 Major Project 0 0 16 150 200 350 8
TOTAL 12 0 16 120 280 150 200 750 20
L = Lecture, T = Tutorial, P = Practical, IA=Internal Assessment, ETE=End Term Exam, Cr=Credits

Departmental Elective-IV
CSE801 SOFT COMPUTING 3-0-0 3
CSE802 Modeling and Simulation 3-0-0 3
CSE803 Real Time System 3-0-0 3

CSE804 Operations Research 3-0-0 3

Open Elective-IV
MEO801 Robot Dynamics & Control 3-0-0 3
MEO802 Air Traffic Control 3-0-0 3
MEO803 Solar Thermal Energy 3-0-0 3
MEO804 Boundary Layer Theory 3-0-0 3
ECO801 Satellite & Radar System 3-0-0 3
EEO801 Non-Conventional Energy Resources 3-0-0 3

CSC802 Distributed Database 3L:0T:0P 3 Credits

Objective:

The aim of the course is to 1) enhance the previous knowledge of database systems by deepening the
understanding of the theoretical and practical aspects of the database technologies, and showing the
need for distributed database technology to tackle deficiencies of the centralized database systems;
2) introduce basic principles and implementation techniques of distributed database systems, 3)
expose active and emerging research issues in distributed database systems and application
development, and 4) apply theory to practice by building and delivering a distributed database query
128
Department of Computer Science and Information Technology

engine, subject to remote Web service calls.

After the completion of the course, the students are expected to 1) get familiar with the currently
available models, technologies for and approaches to building distributed database systems and
services; 2) have developed practical skills in the use of these models and approaches to be able to
select and apply the appropriate methods for a particular case; 3) be aware of the current research
directions in the field and their possible outcomes; 4) be able to carry out research on a relevant
topic, identify primary references, analyze them, and come up with meaningful conclusions; and 5)
be able to apply learned skills to solving practical database related tasks.

Unit Topics Lectures

Features of Distributed versus Centralized Databases, Principles of
Distributed Databases, Levels of Distribution Transparency, Reference
Architecture for Distributed Databases, Types of Data
Fragmentation, Integrity Constraints in Distributed Databases. 
I 8
Translation of Global Queries to Fragment Queries, Equivalence
Transformations for Queries, Transforming Global Queries into
Fragment Queries, Distributed Grouping and Aggregate Function
Evaluation, Parametric Queries. 
Optimization of Access Strategies, A Framework for Query
Optimization, Join Queries, General Queries. 
The Management of Distributed Transactions, A Framework for
II 8
Transaction Management, Supporting Atomicity of Distributed
Transactions, Concurrency Control for Distributed Transactions,
Architectural Aspects of Distributed Transactions. 
Concurrency Control, Foundation of Distributed Concurrency Control,
Distributed Deadlocks, Concurrency Control based on Timestamps,
Optimistic Methods for Distributed Concurrency Control. 
Reliability, Basic Concepts, Nonblocking Commitment Protocols,
III 8
Reliability and concurrency Control, Determining a Consistent View of
the Network, Detection and Resolution of Inconsistency, Checkpoints
and Cold Restart, Distributed Database Administration, Catalog
Management in Distributed Databases, Authorization and Protection 
Architectural Issues, Alternative Client/Server Architectures, Cache
Consistency Object Management, Object Identifier Management, Pointer
Sizzling, Object Migration, Distributed Object Storage, Object
IV Query Processing, Object Query Processor Architectures, Query 8
Processing Issues, Query Execution, Transaction Management,
Transaction Management in Object DBMSs, Transactions as Objects. 

Database Integration, Scheme Translation, Scheme Integration, Query

Processing Query Processing Layers in Distributed Multi-DBMSs,
Query Optimization Issues. Transaction Management Transaction
and Computation Model Multidata base Concurrency Control, Multi
V 8
database Recovery, Object Orientation and Interoperability Object
Management Architecture CORBA and Database Interoperability
Distributed Component Model COM/OLE and Database Interoperability,
PUSH-Based Technologies 
Total 40
TEXT BOOKS : 
1. Distributed Database Principles & Systems, Stefano Ceri, Giuseppe Pelagatti  McGraw-Hill 

129
Department of Computer Science and Information Technology

REFERENCES: 
1. Principles of Distributed Database Systems, M.Tamer Ozsu, Patrick Valduriez  – Pearson
Education.

CSE 803 Digital Image Processing L3:T0:P0 Credits 03

Course Objective:
1. Give the students a general understanding of the fundamentals of digital image processing.
2. Introduce the student to analytical tools which are currently used in digital image processing as applied to image
information for human viewing
3. Develop the students ability to apply these tools in the laboratory in image restoration, enhancement and
compression.

Unit Topics Lectures

Introduction and Fundamentals: Motivation and Perspective,

Applications, Components of Image Processing System, Element of
Visual Perception, A Simple Image Model, Sampling and
Quantization. Image Enhancement in Spatial Domain: Introduction;
Basic Gray Level Functions - Piecewise-Linear Transformation
I 8
Functions: Contrast Stretching; Histogram Specification; Histogram
Equalization; Local Enhancement; Enhancement using
Arithmetic/Logic Operations - Image Subtraction, Image Averaging;
Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic
Filter; Sharpening - The Laplacian

Image Enhancement in Frequency Domain: Fourier Transform and the

Frequency Domain, Basis of Filtering in Frequency Domain, Filters -
Low-pass, High-pass; Correspondence Between Filtering in Spatial
and Frequency Domain; Smoothing Frequency Domain Filters -
Gaussian Low pass Filters; Sharpening Frequency Domain Filters -
Gaussian High pass Filters; Homomorphic Filtering. Image
II Restoration: A Model of Restoration Process, Noise Models, 8
Restoration in the presence of Noise only Spatial Filtering - Mean
Filters: Arithmetic Mean filter, Geometric Mean Filter, Order Statistic
Filters - Median Filter, Max and Min filters; Periodic Noise Reduction
by Frequency Domain Filtering - Band pass Filters; Minimum
Meansquare Error Restoration.

Color Image Processing: Color Fundamentals, Color Models,

Converting Colors to different models, Color Transformation,
Smoothing and Sharpening, Color Segmentation. Morphological
Image Processing: Introduction, Logic Operations involving Binary
III Images, Dilation and Erosion, Opening and Closing, Morphological 8
Algorithms - Boundary Extraction, Region Filling, Extraction of
Connected Components, Convex Hull, Thinning, Thickening.

130
Department of Computer Science and Information Technology

Registration: Introduction, Geometric Transformation - Plane to Plane

transformation, Mapping, Stereo Imaging Algorithms to Establish
Correspondence, Algorithms to Recover Depth. Segmentation:
Introduction, Region Extraction, Pixel-Based Approach, Multi-level
Thresholding, Local Thresholding, Region-based Approach, Edge and
IV Line Detection: Edge Detection, Edge Operators, Pattern Fitting 8
Approach, Edge Linking and Edge Following, Edge Elements
Extraction by Thresholding, Edge Detector Performance, Line
Detection, Corner Detection.

Feature Extraction: Representation, Topological Attributes, Geometric

Attributes. Description: Boundary-based Description, Region-based
Description, Relationship. Object Recognition: Deterministic
V Methods, Clustering, Statistical Classification, Syntactic Recognition, 8
Tree Search, Graph Matching.

Course Outcomes:

1 Demonstrate a knowledge of a broad range of fundamental image processing and image analysis techniques
and concepts (linear and non-linear filtering, denoising, deblurring, edge detection, line finding, detection,
morphological operators, compression, shape metrics and feature based recogniton)

2 Identify, Demonstrate and apply their knowledge by analysing image processing problems and recognising
and employing (or proposing) effective solutions

3 Design and create practical solutions to a range of common image processing problems and to critically
assess the results of their solutions, including shortcomings

Recommended Books:

1. Digital Image Processing 2nd Edition, Rafael C. Gonzalvez and Richard E.

Woods.Published by: Pearson Education.

2. Digital Image Processing and Computer Vision, R.J. Schalkoff. Published by:

131
Department of Computer Science and Information Technology

John Wiley and Sons, NY.

3. Fundamentals of Digital Image Processing, A.K. Jain. Published by Prentice

Hall, Upper Saddle River, NJ.

4.Fundamental of digital Image processing,Annadurai,Pearson
5.Digital Image Processing,Castleman,Pearson
6.Digital Image Processing using MATLAB,Gonzalez,Pearson

132
Department of Computer Science and Information Technology

Departmental Elective-IV

CSE 801 SOFT COMPUTING L3:T0:P0 Credits 03

OBJECTIVES:
 To learn the basic concepts of Soft Computing
 To become familiar with various techniques like neural networks, genetic algorithms
and fuzzy systems.
 To apply soft computing techniques to solve problems.
Unit Topics Lectures

INTRODUCTION TO SOFT COMPUTING 9 Introduction-Artificial

Intelligence-Artificial Neural Networks-Fuzzy Systems-Genetic
Algorithm and Evolutionary Programming-Swarm Intelligent Systems-
I 8
Classification of ANNsMcCulloch and Pitts Neuron Model-Learning
Rules: Hebbian and Delta- Perceptron Network-Adaline Network-
Madaline Network.

ARTIFICIAL NEURAL NETWORKS 9 Back propagation Neural Networks

- Kohonen Neural Network -Learning Vector Quantization -Hamming
II Neural Network - Hopfield Neural Network- Bi-directional Associative 8
Memory -Adaptive Resonance Theory Neural Networks- Support
Vector Machines - Spike Neuron Models.
FUZZY SYSTEMS 9 Introduction to Fuzzy Logic, Classical Sets and Fuzzy
Sets - Classical Relations and Fuzzy Relations -Membership Functions -
III Defuzzification - Fuzzy Arithmetic and Fuzzy Measures - Fuzzy Rule 8
Base and Approximate Reasoning - Introduction to Fuzzy Decision
Making.

GENETIC ALGORITHMS 9 Basic Concepts- Working Principles -

IV Encoding- Fitness Function - Reproduction - Inheritance Operators - 8
Cross Over - Inversion and Deletion -Mutation Operator - Bit-wise
Operators -Convergence of Genetic Algorithm.
HYBRID SYSTEMS 9 Hybrid Systems -Neural Networks, Fuzzy Logic and
Genetic -GA Based Weight Determination - LR-Type Fuzzy Numbers -
V Fuzzy Neuron - Fuzzy BP Architecture - Learning in Fuzzy BP- Inference 8
by Fuzzy BP - Fuzzy ArtMap: A Brief Introduction - Soft Computing
Tools - GA in Fuzzy Logic Controller Design - Fuzzy Logic Controller

OUTCOMES: Upon completion of this course, the students should be able to

 Apply suitable soft computing techniques for various applications.
 Integrate various soft computing techniques for complex problems.
TEXT BOOKS:
1. N.P.Padhy, S.P.Simon, "Soft Computing with MATLAB Programming", Oxford University Press, 2015.
2. S.N.Sivanandam , S.N.Deepa, "Principles of Soft Computing", Wiley India Pvt.Ltd., 2nd Edition, 2011.
3. S.Rajasekaran, G.A.Vijayalakshmi Pai, "Neural Networks, Fuzzy Logic and Genetic Algorithm, Synthesis and
Applications ", PHI Learning Pvt.Ltd., 2017.
133
Department of Computer Science and Information Technology

REFERENCES: 1. Jyh-Shing Roger Jang, Chuen-Tsai Sun, Eiji Mizutani, ―Neuro-Fuzzy and Soft Computing‖,
Prentice-Hall of India, 2002. 2. Kwang H.Lee, ―First course on Fuzzy Theory and Applications‖, Springer,
2005. 3. George J. Klir and Bo Yuan, ―Fuzzy Sets and Fuzzy Logic-Theory and Applications‖, Prentice Hall,
1996. 4. James A. Freeman and David M. Skapura, ―Neural Networks Algorithms, Applications, and
Programming Techniques‖, Addison Wesley, 2003.

CSE802 Modeling and Simulation 3L:0T:0P 3 Credits

Course Objectives:
The aim of this course is to introduce various system modeling and simulation techniques,
and highlight their applications in different areas. It includes modeling, design, simulation,
planning, verification and validation. After learning the simulation techniques, the students
are expected to be able to solve real world problems which cannot be solved strictly by
mathematical approaches. This course begins by demonstrating the usefulness of simulation
as a tool for problem solving in business, industry, government, and society.

Unit Topics Lectures

Introduction to Simulation - Introduction – Simulation Terminologies -
Application areas - Model Classification - Types of Simulation - Steps in a
I 8
Simulation study - Concepts in Discrete Event Simulation - Simulation
Examples
Mathematical models - Statistical Models – - Concepts – Discrete Distribution-
Continuous Distribution - Poisson Process- Empirical Distributions - Queuing
Models – Characteristics- Notation– Queuing Systems - Markovian Models- -
Generation of Pseudo Random numbers- Properties of random numbersL T
II 8
P/S SW/F W TOTAL CREDIT UNITS 3 - 4 - 5 - Techniques for generating random
numbers - Testing random number generators- - Generating Random-Variates-
Inverse Transform technique– Acceptance- Rejection technique - Composition
& Convolution Method.
Analysis of Simulation Data - Input Modeling - Data collection - Assessing
sample independence – Hypothesizing distribution family with data -
III Parameter Estimation – - Goodness-of-fit tests - Selecting input models in 8
absence of data - Output analysis for a Single system - Terminating
Simulations– Steady state simulations
Verification and Validation - Model Building – - Verification of Simulation
IV Models - Calibration and Validation of Models - Validation of Model 8
Assumptions - Validating Input – Output Transformations
Simulation of Computer Systems and Case Studies - Simulation Tools - Model
Input - High level computer system simulation - CPU Memory Simulation -
V 8
Comparison of systems via simulation - Simulation Programming techniques -
Development of Simulation models.
Total 40
Recommended Books:
• Jerry Banks and John Carson, “Discrete Event System Simulation ”, Fourth Edition, PHI, 2005.
• Geoffrey Gordon, “System Simulation”, Second Edition, PHI, 2006 (Unit – V).
• Frank L. Severance, “System Modeling and Simulation ”, Wiley, 2001.
• Averill M. Law and W. David Kelton, “Simulation Modeling and Analysis, Third Edition, McGraw Hill, 2006.
• Jerry Banks, “Handbook of Simulation: Principles, Methodology, Advances, Applications and Practice ”,
Wiley, 1998. • Sheldon M. Ross: Introduction to Probability Models 7th Edition, Academic Press, 2002
• Donald E. Knuth: The Art of Computer Programming - Volume 2: Semi Numerical Algorithms, 2nd Edition,
PEARSON
• Education, Reading MA, USA 2000 • Sheldon M. Ross: Simulation 3rd Edition, Academic Press, 2002

134
Department of Computer Science and Information Technology

• M. Law and W. D. Kelton. Simulation Modeling and Analysis, 3rd Edition, McGrawHill, New York, USA,
1998

CSE804 Real Time System L3:T0:P0 Credits 3

Objectives

Student Learning Objectives

1. To Understand Real-time scheduling and schedulability analysis
2. Formal specification and verification of timing constraints and properties
3. Design methods for real-time systems
4. Development and implementation of new techniques to advance the state-of-the-art real-time
systems research

Unit Topics Lectures

Overview of real-time applications and concepts with emphasis on the

I distinguishing characteristics of real-time systems and the constraints 8
that they must satisfy.
II Real-time scheduling and schedulability analysis, including clock- 8
driven and priority-driven scheduling.
Real-time operating systems. Basic operating-system functions needed
for real-time computing.
III 8

Resource managment in real-time systems, including potential

IV problems and their resolution as well as practical issues in building 8
real-time systems.
V Resource sharing in real-time systems. Distributed real-time systems, 8
multiprocessor real-time systems (if time permits).

Course Outcomes:
1. An ability to understand advanced concepts in theory of computer science;
2. An ability to understand advanced concepts in applications of computer science;
3. An ability to apply knowledge of advanced computer science to formulate the analyze
problems in computing and solve them;
4. An ability to learn emerging concepts in theory and applications of computer science;
5. An ability to design and conduct experiments as well as to analyze and interpret data; and
6. An ability to function in teams and to communicate effectively.

Recommended books
1. Real-Time Systems, Jane Liu, Prentice Hall, 2000.
CSE804 Real Time System L3:T0:P0 Credits 3

135
Department of Computer Science and Information Technology

Objectives

Identify and develop operational research models from the verbal description of the real
system.
• Understand the mathematical tools that are needed to solve optimization problems.
• Use mathematical software to solve the proposed models.
• Develop a report that describes the model and the solving technique, analyze the results
and propose recommendations in a language understandable to the decision-making
processes in Management Engineering
Unit Topics Lectures

Introduction to Operations Research: Basics definition,

scope, objectives, phases, models, and limitations of
I Operations Research. Linear Programming Problem – 8
Formulation of LPP, Graphical solution of LPP. Simple
Method, Artificial variables, big-M method, two-phase
method, degeneracy, and unbound solutions.
Transportation Problem. Formulation, solution,
unbalanced Transportation problem. Finding basic
II feasible solutions – Northwest corner rule, least cost 8
method, and Vogel’s approximation method. Optimality
test: the stepping stone method and MODI method
Assignment model. Formulation. The Hungarian method
for the optimal solution. Solving the unbalanced problem.
Traveling salesman problem and assignment problem
III Sequencing models. Solution of 8
Sequencing Problem – Processing n Jobs through 2
Machines – Processing n Jobs through 3 Machines –
Processing 2 Jobs through m machines – Processing n Jobs
through m Machines
Dynamic programming. Characteristics of dynamic
programming. Dynamic programming approach for
Priority Management employment smoothening, capital
budgeting, Stage Coach/Shortest Path, cargo loading and
IV Reliability problems Games Theory. Competitive games, 8
rectangular game, saddle point, minimax (maximin)
method of optimal strategies, value of the game. Solution
of games with saddle points, dominance principle.
Rectangular games without saddle point – mixed strategy
for 2 X 2 games
V Replacement Models. The Replacement of Items that 8
Deteriorate whose maintenance costs increase with time
without change in the money value. Replacement of items

136
Department of Computer Science and Information Technology

that fail suddenly: individual replacement policy, group

replacement policy

Inventory models. Inventory costs. Models with

deterministic demand – model (a) demand rate uniform
and production rate infinite, model (b) demand rate non-
uniform and production rate
infinite, model (c) demand rate uniform and production
rate finite.

Operation Research Notes OUTCOME:

• The methodology of Operations Research.
• Linear programming: solving methods, duality, and sensitivity analysis.
• Integer Programming.
• Network flows.
• Multi-criteria decision techniques.
• Decision making under uncertainty and risk.
• Game theory. Dynamic programming.

137
Department of Computer Science and Information Technology

Open Elective-IV

MEO801 Robot Dynamics & Control 3L:0T:0P 3 Credits

Course Objectives:
1. To impart knowledge about various drive systems and its selection for particular applications.
2. To gain the knowledge about various robot control systems.

Unit Topics Lectures

ROBOT DRIVE MECHANISM: Objectives, motivation, open loop
control, closed loop control with velocity and position feedback, Types
I of drive systems. Functions of drive system. Lead Screws, Ball Screws, 8
Chain & linkage drives, Belt drives, Gear drives, Precision gear boxes,
Harmonic drives, Cyclo speed reducers.
HYDRAULIC DRIVES: Introduction, Requirements, Hydraulic piston
and transfer valve, hydraulic circuit incorporating control amplifier,
II 8
hydraulic fluid considerations, hydraulic actuators Rotary and linear
actuators. Hydraulic components in robots.
PNEUMATIC DRIVES: Introduction, Advantages, pistons-Linear
Pistons, Rotary pistons, Motors Flapper motor, Geared motor,
III 8
Components used in pneumatic control. Pneumatic proportional
controller, pneumatically controlled prismatic joint.
ELECTRIC DRIVES: Introduction, Types, DC electric motor, AC
IV electric motor, stepper motors, half step mode operation, micro step 8
mode. Types of stepper motors, Direct drive actuator.
SERVO SYSTEMS FOR ROBOT CONTROL: General aspects of
robot control. Basic control techniques, mathematical modeling of robot
servos, error responses and steady state errors in robot servos, feed back
V 8
and feed forward compensations, hydraulic position servo, computer
controlled servo system for robot applications, selection of robot drive
systems.
Total 40
Course Outcomes:
At the end of this course the student should be able to understand
138
Department of Computer Science and Information Technology

1. Various types of drive systems.

2. The selection of drive system for a particular application.
3. Accurate positioning of the robot end effectors with error compensation by servo control

Recommended Books:
1. Francis N-Nagy Andras Siegler, Engineering foundation of Robotics, Prentice Hall Inc.,
1987.
2. Richard D. Klafter, Thomas .A, Chri Elewski, Michael Negin, Robotics Engineering an
Integrated Approach, Phi Learning., 2009.
3. P.A. Janaki Raman, Robotics and Image Processing an Introduction, Tata Mc Graw Hill
Publishing company Ltd., 1995.
4. Mikell P Groover & Nicholas G Odrey, Mitchel Weiss, Roger N Nagel, Ashish Dutta,
Industrial Robotics, Technology programming and Applications, Tata McGraw-Hill
Education, 2012. 8 RB-2013 SRM
5. Bernard Hodges, Industrial Robotics, Second Edition, Jaico Publishing house, 1993.
6. Robert J. Schilling, Fundamentals of Robotics Analysis and Control, PHI Learning., 2009.
7. Tsuneo Yohikwa, Foundations of Robotics Analysis and Control, MIT Press., 2003.
8. John J. Craig, Introduction to Robotics Mechanics and Control, Third Edition, Pearson, 2008.

MEO802 Air Traffic Control 3L:0T:0P 3

Course Objectives:
1. Air traffic control is defined with specified regulations, international and national, that
prescribe minimum requirements for organizations certified for course education.
2. These requirements include creation of the Operations Manual, defining responsible
personnel, programs of training with training objectives and financial plans.

Unit Contents Hours

Definition- organization of air traffic control services in India-Flight
1 information regions-Controls and control zones. 9

Control of traffic on and in the vicinity of the manoeuvring area-Critical

positions of aircraft in the traffic and taxi circuit-control of taxying
2 9
aircraft-determining the proper runway for use for landing and take off-
control of traffic in the traffic circuits
Control of other than aircraft traffic on the manoeuvring area-visual
signal procedures-lights and pyrotechnic signal- radio communication
3 procedure-standard traffic clearances-essential traffic information- 9
information on aerodrome conditions-night operations-fire fighting
equipment’s and safety services
Approach control-expected approach time-approach sequences-altitude
assignment-holding aircraft in flight essential weather information-
4 weather minima-emergency procedure and emergency descent-various 9
system of approach, OGH, BABS let down procedure-GCA_range le
down-Becon let down-GEE-ILS-VOR and DME let down procedure
Area control and flight information services-aircraft movement
messages-air traffic clearances-flight navigation flight plan-dimensional
units used for distance, altitude, speed, direction, temperature, weight,
5
time, position reporting system in india- altitude, time and lateral
separations standards-systems of flight progress boards and progress 9
strips, or plotting.
TOTAL 45
139
Department of Computer Science and Information Technology

Course Outcomes:
1. At the end it can be summarized that ATCO is a specific kind of training which must be
certified by the national authorities according to the prescribed international legislation
2. ATCO training programmes are under the constant supervision of the national authorities and
are harmonized with the specific requirements.

Recommended Books:
1. Annex 2 to the convention on International Civil Aviation Rules of the air.
2. Annex 11 to the convention on International Civil Aviation-Air Traffic Services, Air Traffic
Control Services

MEO803 Solar Thermal Energy 3L:0T:0P 3 Credits

Course Objectives:
To expose the students with the different aspects of measurement, harvesting and utilization of
solar energy.

Unit Topics Lectures

INTRODUCTION: Basic Heat Transfer Principles- Availability of
Solar Energy- Nature of Solar Energy- Solar Energy & Environment-
Sun as the source of radiation- Solar radiation- Measurement of solar
radiation Irradiance- Solar constant- Insolation- Radiosity- Emissive
I 8
power- Earth’s equator- Meridian Longitude- Sun earth angles- Sunrise,
sun set and day length- Solar time- Equation of time Various Methods
of using solar energy- Photo thermal, Photovoltaic, Photosynthesis,
Present & Future Scope of Solar energy.
SOLAR CELLS: Various generations- Semiconductor materials-
Doping- Fermi level- PN junction and characteristics- Photovoltaic
effect- Photovoltaic material- Parameters of solar cells- Effects of
II cell temperature on cell efficiency- Types of solar cells- Solar modules 8
and arrays- Advantages and limitations of solar energy system- Solar
cell power plant- Silicon, thin film and polymer processing- Silicon
wafer based solar cells.
SOLAR THERMAL ENERGY  : Stationary collectors- FPC- CPC-
ETC- Sun tracking concentrating collectors- PTC- PDR-
HFCFresnel collectors- Solar thermal power plants- Solar chimney
III 8
power plant- Solar pond- Solar water heater- Solar cooker- Types-
SODIS- Thermal energy storage- Solar cooling- Limitations of solar
thermal energy.
SOLAR PHOTOVOLTAICS: Photovoltaic cell function- Types of
PV system- Design of PV system- Grid connected PV system
Standalone PV system- Efficiency of PV module- MPPT- Applications
IV of PV system- SPV lighting system- Solar water pumping system- 8
Solar vehicles- Solar dryer- BIPV- Features of SPV system Case study-
Solar water pumping system in Punjab- Performance study on solar
drying system in Nepal.
V ECONOMIC ANALSIS: Life cycle analysis of Solar Energy Systems 8
140
Department of Computer Science and Information Technology

– Time Value of Money – Evaluation of Carbon Credit of Solar Energy

Systems.
Total 40
Course Outcomes:
1. assess solar energy potential
2. describe different direct and indirect solar energy tapping systems including
Solar Photovoltaics, solar cells and solar thermal power plants

Recommended Books:
1. Soteris A. Kalogirou, „Solar Energy Engineering: Processes and Systems‟, Academic Press,
London, 2009
2. Tiwari G.N, “Solar Energy – Fundamentals Design, Modelling and applications,
Narosa Publishing House, New Delhi, 2002.
3. John W. Twidell & Anthony D.Weir, ‘Renewable Energy Resources,2005
4. John A. Duffie, William A. Beckman, Solar Energy: Thermal Processes, 4
th Edition, john Wiley and Sons, 2013
5. Sukhatme S.P. Solar Energy, Tata McGraw Hill Publishing Company Ltd., New Delhi, 1997.

MEO804 Boundary Layer Theory 3L:0T:0P 3

Course Objectives:
1. Gain knowledge of the boundary layer theory of the key issues: hydrodynamic and thermal
boundary layer, laminar and turbulent boundary layer.
2. Skills of evaluation, calculus and empirical relationship application. Ability to use the
boundary theory concepts for equipment thermodynamics, heat transfer and fluid mechanics
calculations and design.

Unit Contents Hours

Derivation of basic equations for viscous fluid flow, including heat
1 conduction and compressibility – exact solutions. 9

Laminar boundary layer approximations – similar and non-similar

boundary layers – momentum integral methods – separation of boundary
2 9
layer – compressible boundary layer equations – recovery factor –
Reynolds analogy – similar solutions
3 Introduction to transition of laminar boundary layers 9
Turbulent flows – phenomenological theories – Reynolds stress –
4 turbulent boundary layer – momentum integral methods – turbulent free 9
shear layer
5 Introduction to axisymmetric and three-dimensional boundary layers 9
TOTAL 45

Course Outcomes:
1. Ability to explain and analyze the heat and mass transfer, hydro-and aerodynamic processes
taking place in nature and technological equipment in the terms and laws of boundary layer
theory
2. The ability to perform independent heat transfer and flow dynamic calculations in technical
facilities and installations with the viscous flow convective heat exchange.
3. Ability to justify the choice of measurement method.

141
Department of Computer Science and Information Technology

Recommended Books:
1. Schlichting, H. and Gersten, K., Boundary Layer Theory, 8th ed., McGraw-Hill (2001).
2. Batchelor, G. K., Introduction to Fluid Dynamics, 2nd ed., Cambridge Univ. Press (2000).
3. White, F. M., Viscous Fluid Flow, 3rd ed., McGraw-Hill (2006).
4. Cebeci, T. and Smith, A. M. O., Analysis of Turbulent Boundary Layers, Academic Press
(1974).
5. Gatski, T. B. and Bonnet, J.-P. Compressibility, Turbulence and High Speed Flow, 2nd ed.,
Academic Press (2013)

ECO801 Satellite & Radar System 3L:0T:0P 3

Course Objectives:
1. To learn Microwave and Radar systems.
2. To study Satellite basics and Satellite communication systems.
3. To understand the concepts of mobile communication and other wireless technologies.

Unit Contents Hours

Introduction to radar, radar block diagram and operation, radar frequencies,
Applications of radar The Radar Equation: Detection of signals in noise ,
Receiver noise and the signal to noise ratio, Probabilities of detection and
1 9
false alarm, Integration of Radar Pulses, Radar cross section of targets,
Radar cross section fluctuations, Transmitter Power, Pulse Reception
Frequency , Antenna Parameters, System Losses.
MTI and Pulse Doppler Radar: Introduction to Doppler and MTI Radar,
Delay Line cancellers, Staggered Pulse Reception Frequencies, Doppler
2 9
Filter Banks, Digital MTI Processing, Moving Target Detector,
Limitations to MTI Performance
Tracking Radar: sequential lobing, conical scan, monopulse Tracking, low
angle tracking, tracking in range. Elements of Satellite Communications,
3 Orbital mechanics, look angle and orbit determination, launches and launch 9
vehicle, orbital effects. Introduction to geo-synchronous and geo-stationary
satellites
Satellite sub-systems: Attitude and Orbit control systems, Telemetry,
Tracking and command control system, Power supply system,
4 Introduction to satellite link design, basic transmission theory, system noise 9
temperature and G/T ratio, design of down link and uplink, design of
satellite links for specified C/N, satellite data communication protocols
Direct broadcast satellite television and radio, satellite navigation and the
global positioning systems, GPS position location principle, GPS
5 9
receivers and codes, Satellite Signal Acquisition, GPS navigation
Message, GPS Signal Levels, Timing Accuracy, GPS Receiver Operation
TOTAL 45

Course Outcomes:
1. Appreciate the importance of microwave signal and learn important microwavedevices.

142
Department of Computer Science and Information Technology

2. Describe the working principle of different RADAR systems and their applications.
3. Understand the Satellite fundamentals and types of satellite.
4. Explain the working of a Satellite communication system and its other subsystems.
5. Know the applications of Satellites in different areas.
6. Explain the working principle of Mobile communication and GSM Services.

Recommended Books:
1. Merrill I. Skolnik “Introduction to Radar Systems”, Mc Graw- Hill.
2. J.C.Toomay, Paul J. Hannen “Principles of Radar”, PHI Learning.
3. B.Pratt, A.Bostian, “Satellite Communications”, Wiley India.
4. D.Roddy,” Satellite Communications”, TMH

EEO801 Non-Conventional Energy Resources 3L:0T:0P 3

Course Objectives:
1. To identify various non-conventional energy resources.
2. To analyse Solar Thermal Energy.
3. To find resources of geothermal energy, thermodynamics of geo-thermal energy to electrical
conversion.
4. To learn Principle of working, performance and limitations.
5. To understand Ocean Thermal Energy Conversion (OTEC).

Unit Contents Hours

Introduction: Various non-conventional energy resources- Introduction,
availability, classification, relative merits and demerits.
1 8
Solar Cells: Theory of solar cells. Solar cell materials, solar cell array, solar cell
power plant, limitations.
Solar Thermal Energy:
Solar radiation, flat plate collectors and their materials, applications and
2 performance, focusing of collectors and their materials, applications and 8
performance; solar thermal power plants, thermal energy storage for solar
heating and cooling, limitations.
Geothermal Energy: Resources of geothermal energy, thermodynamics of
geothermal energy conversion-electrical conversion, non-electrical conversion,
environmental considerations.
3 Magneto-hydrodynamics (MHD): Principle of working of MHD Power plant, 8
performance and limitations.
Fuel Cells: Principle of working of various types of fuel cells and their working,
performance and limitations.
Thermo-electrical and thermionic Conversions: Principle of working,
performance and limitations.
4 Wind Energy: Wind power and its sources, site selection, criterion, momentum 8
theory, classification of rotors, concentrations and augments, wind
characteristics. Performance and limitations of energy conversion systems.
5 Bio-mass: Availability of bio-mass and its conversion theory.
Ocean Thermal Energy Conversion (OTEC): Availability, theory and 8
working principle, performance and limitations.

143
Department of Computer Science and Information Technology

Wave and Tidal Wave: Principle of working, performance and limitations.

Waste Recycling Plants.
TOTAL 40

Course Outcomes:
1. Understand theory of solar cells. Solar cell materials, solar cell array, solar cell power plant,
and its limitations.
2. Understand solar radiation, flat plate collectors and their materials, applications and
performance, focusing of collectors and their materials.
3. Learn principle of working of various types of fuel cells and their working, performance and
limitations.
4. Be aware of wind power and its sources, site selection, criterion, momentum theory,
classification of rotors, concentrations and augments.
5. Understand principle of working, performance and limitations, Waste Recycling Plants.

Recommended Books:
1. Khan, Non-Conventional Energy Resources, McGrawhill Education.
2. Raja etal, “Introduction to Non-Conventional Energy Resources” Scitech Publications.
3. John Twideu and Tony Weir, “Renewal Energy Resources” BSP Publications, 2006.
4. M.V.R. Koteswara Rao, “Energy Resources: Conventional & Non-Conventional “BSP
Publications,2006.
5. D.S. Chauhan,”Non-conventional Energy Resources” New Age International.
6. C.S. Solanki, “Renewal Energy Technologies: A Practical Guide for Beginners ” PHI
Learning.
7. Peter Auer, "Advances in Energy System and Technology". Vol. 1 & II Edited by Academic
Press.
8. Godfrey Boyle,“ Renewable Energy Power For A Sustainable Future”, Oxford University
Press.

144