FACULTY OF ENGINEERING - Christ UniversityCSE)_2012.pdf · Christ University Faculty of Engineering...

FACULTY OF ENGINEERING Kengeri Campus, Kanminike, Kumbalgodu, Bangalore – 560060

DEPARTMENT OF COMPUTER SCIENCE AND ENGINEERING

BACHELOR OF TECHNOLOGY

COMPUTER SCIENCE AND ENGINEERING

JANUARY 2012

Christ University Faculty of Engineering Department of Computer Science and Engineering

B.Tech(CSE) - 2012 Page 1

S.NO TABLE OF CONTENTS PAGE NO 01 INTRODUCTION 2 02 COURSES OFFERED 4 03 ELIGIBILITY CRITERIA 4 04 SELECTION PROCESS 5 05 ADMISSION PROCESS 5 06 GENERAL RULES 6 07 GRADING SCHEME FOR EACH PAPER:UNDER GRADUATE

COURSES 7

08 GRADING SCHEME FOR EACH PAPER:POST GRADUATE COURSES

7

09 COURSE OVERVIEW 8 10 COURSE OBJECTIVE 8 11 TEACHING PEDAGOGY 8 12 ASSESSMENT RULES 9 13 BRIEF OF PHYSICS AND CHEMISTRY CYCLE 10 14 QUESTION PAPER PATTERN 10 15 COURSE STRUCTURE 12 16 DETAILED SYLLABUS 17



1.INTRODUCTION

Christ University was formerly Christ College (Autonomous) affiliated to Bangalore

University. Established in July 1969, Christ College became the most preferred educational

institution in the city of Bangalore within the first three decades. From 1990 onwards it scaled from

heights to heights. By the introduction of innovative and modern curriculum, insistence on

academic discipline, imparting of Holistic Education and with the help of the creative and dedicated

staff, Christ College has been continually rated among the top 10 educational institutions of the

country. It has the rare distinction to be the first institution in Karnataka to be accredited by

National Assessment and Accreditation Council (NAAC) UGC for quality education. On 7 October

2004, UGC has conferred Autonomy to Christ College (No.F.13-1/2004).

On May 20, 2005, it became the first College in South India to be reaccredited with A+ by NAAC.

UGC has identified it as an Institution with Potential for Excellence in June 2006.

July 22, 2008 is the most glorious day in the history of the institution. Under Section 3 of the UGC

Act, 1956, Ministry of Human Resources Development of the Union Government of India, vide

Notification No. F. 9-34/2007-U.3 (A), has declared it a Deemed to be University, in the name and

style of Christ University



VISION

"EXCELLENCE AND SERVICE"

� Christ University, a premier educational institution, is an academic fraternity of individuals

dedicated to the motto of excellence and service. We strive to reach out to the star of perfection

through an earnest academic pursuit for excellence and our efforts blossom into ‘service’

through our creative and empathetic involvement in the society to transform it.

� Education prepares one to face the challenges of life by bringing out the best in him/her. If this

is well accepted, education should be relevant to the needs of the time and address the

problems of the day. Being inspired by Blessed Kuriakose Elias Chavara, the founder of

Carmelites of Mary Immaculate and the pioneer in innovative education, Christ University was

proactive to define and redefine its mission and strategies reading the signs of the time.

MISSION STATEMENT

"Christ University is a nurturing ground for an individuals holistic development to make effective

contribution to the society in a dynamic environment."

CORE VALUES

The values which guide us at Christ University are:

Faith in God

Moral Uprightness

Love of Fellow Beings

Social Responsibility

Pursuit of Excellence



2.COURSE OFFERED

• Undergraduate Programmes (B. Tech) (4 Years Program)

- Computer Science and Engineering (CSE)

• Int. BTech with MBA (5 Years Program)

Int. BTech(CSE) with MBA (Finance/HR/Marketing/Lean Operations &

Systems)

• Int. BTech with M. Tech (5 Years Program)

- Int. BTech(CSE) with MTech (CSE)

• Postgraduate Programmes (M. Tech) (2 Years Program)

- Master of Technology in Computer Science & Engineering

• Doctoral Programmes (Ph.D.) (Doctor of Philosophy)

- Doctor of Philosophy (Ph.D.) in Computer Science and Engineering

3.ELIGIBLITY CRITERIA

� For Undergraduate Programmes and Int. B Tech with MBA & Int. B. Tech with M.

Tech:

• A pass in PUC (10+2) or equivalent with 50% marks in aggregate with Mathematics,

Physics and Chemistry is the minimum eligibility for admission

Lateral Entry:

Candidates who have successfully completed 3 year diploma in Engineering or Bachelor

of Science (as approved by AICTE) are eligible to apply for lateral entry into: ,

i) BTech Computer Science & Engineering,

Candidates will be admitted to second year of the programme only after appearing the

Christ University selection process for Engineering programmes.

� For Postgraduate Programmes:

o For Master of Technology in Computer Science & Engineering

� A Pass in B.Tech/B.E or M.Sc with 55% aggregate.



4.SELECTION PROCESS

1) Candidates can process the admission based on the Undergraduate Entrance Test and

Ranking by COMEDK.

OR

2) Christ University Selection Process as given below:

Process Particulars Date Venue/Centre

Entrance Test Christ University Entrance

test for each candidate

As per the E-

Admit Card

As per the E- Admit

Card

Personal

Interview

Personal interview for 15

minutes for each candidate by

an expert panel

As per the E-

Admit Card

As per the E- Admit

Card

Academic

Performance

Assessment of past

performance in Class 10,

Class 11/12 during the

Personal Interview

As per the E-

Admit Card

As per the E- Admit

Card

5.ADMISSION PROCESS

Candidates will be intimated about the Selection status (Selected/Wait Listed/Not Selected)

through the University Notice Board/on the “Application Status” link on University website. The

Selection results will be declared within 24 hours of Personal Interview session.

The selected candidates must process admission at Office of Admissions, Central Block,

Christ University within 3 working days of declaration of Selection Process results/as per the

stipulated date and time mentioned by Office of Admissions.

Selected candidates should collect the Fee Challan from the Office of Admissions and remit

the Annual fee at the South Indian Bank, Christ University Branch. The Offer of Admission will

stand cancelled, if failing to remit the fee within the stipulated date and time.

Admission will not be processed without the presence of the candidate and the mandatory

original documents mentioned below;

1. The Offer of Admission Card (E-Admission Card/Mail)

2. Class 10 Marks Statement

3. Class 11 Marks Statement, if Candidate is pursuing class 12 and appearing for final

examination during March-April 2012



4. Class 12 Marks Statement, if candidate has appeared and passed the Class 12 examination

The University ID card is a smart card, which is both an ID card as well as a South Indian

Bank ATM card with a chip containing the student personal details. All transactions within the

University campus after commencement of classes, including fees payment will be processed only

through this card. It is also an access card for Library and other restricted places. Candidates are

advised to collect the South Indian Bank account opening form along with fees challan and process

it at the Bank branch within the University premises.

Candidates who fall under International student category (ISC), If selected, should register

with the Foreigner Regional Registration Officer (FRRO/FRO) of the Local Police in Bangalore,

India within 14 working days from the date of admission or arriving in Bangalore.

All International student category (ISC) candidates if studied in India should obtain an NOC from

the previous qualifying institution.

6.GENERAL RULES

• There is a grading scheme for each paper and for all the courses.

• All marks will indicate the marks, percentage obtained, grade and grade point average.

• The grade point average will be calculated as follows: for each subject, multiply the grade

point with the number of credits; divide the sum of product by the total number of credits.

• The CGPA [Cumulative GPA] is calculated by adding the total number of earned points

[GP x Cr] for all semesters and dividing by the total number of credit hours for all

semesters.

CGPA=



7.GRADING SCHEME FOR EACH PAPER: UNDERGRADUATE COUR SES

Percentage Grade Grade Point Interpretation Class

80 and above A 4.0 Outstanding First Class with Distinction

73-79 A- 3.67 Excellent

First Class 66-72 B+ 3.33 Very Good

60-65 B 3.0 Good

55-59 B- 2.67 Average Second Class

50-54 C+ 2.33 Satisfactory

45-49 C 2.00 Pass Pass Class

40-44 D 1.0 Pass

39 and below F 0 Fails Fail

8.GRADING SCHEME FOR EACH PAPER: POSTGRADUATE COURSES

Percentage Grade Grade Point Interpretation Class

80 and above A+ 4.0 Excellent First Class with

Distinction 70-79 A 3.5 Very Good

65-69 B+ 3.0 Good

First Class 60-64 B 2.5 Above Average

55-59 C+ 2.0 Average

Second Class 50-54 C 1.5 Satisfactory

40-49 C- 1.0 Exempted if aggregate is

more than 50% Pass Class

39 and below F 0 Fails Fail



9. COURSE OVERVIEW

The fundamental objective of the Department of Computer Science & Engineering of the Christ

University is to provide the opportunity for our students to develop a firm foundation in

mathematics, science, and design methodology applied to the disciplines of Computer Science &

Engineering. Our course covers all fundamentals, working and expert subjects that provides enough

learning environment where students understand and are able to apply the most contemporary and

essential tools needed in the breadth and depth of computer science & engineering.

Our course gives skills essential to practicing engineering professionals; it is also an objective to

provide experience in leadership, management, planning, and organization. In order to synthesize

what students have learned in studying engineering science, it is an objective to provide real world,

hands-on engineering experience. Because engineering continues to change, it is essential that we

assist our students in developing and evaluating methods that encourage them to continue to learn

after leaving the university. We believe that student opportunities and experiences should lead to an

appreciation of the holistic development of individual. And finally, an objective is to pass on to our

students our passion for what we do, and to have the students comprehend that we also desire to

continue to learn.

10. COURSE OBJECTIVE

The need for professionals with a background of Computer Science & Engineering is always on the

rise. Those with problem solving skills are the ones in demand. Professionals with these skills are

sure to land up with successful careers in the years to come. This programme will thus cater to the

above needs by providing with theoretical and practical knowledge and with a goal to equip the

students face the vast world of technology.

11. TEACHING PEDAGOGY

� Team/Class room teaching.

� PowerPoint presentations and handouts.

� Simulated situations and role-plays.

� Video films on actual situations.

� Assignments.

� Case Studies.

� Exercises are solved hands on.

� Seminars



� Industry / Field visits.

� Information and Communication Technology.

� Project work.

� Learning Management System- Moodle

12.DETAILS OF CIA (Continuous Internal Assessment):

Assessment is based on the performance of the student throughout the semester.

Assessment of each paper

• Continuous Internal Assessment (CIA) for Theory papers: 50% (50 marks out

of 100 marks)

• End Semester Examination(ESE) : 50% (50 marks out of 100 marks)

Components of the CIA

CIA I : Mid Semester Examination (Theory) : 25 marks

CIA II : Assignments : 10 marks

CIA III : Quizzes/Seminar/Case Studies/Project Work : 10 marks

Attendance : 05 marks

Total : 50 marks

For subjects having practical as part of the subject

End semester practical examination : 25 marks

Records : 05 marks

Mid semester examination : 10 marks

Class work : 10 marks

Total : 50 marks

Mid semester practical examination will be conducted during regular practical hour with prior intimation

to all candidates. End semester practical examination will have two examiners an internal and external examiner.



� Assessment of Project Work

� Continuous Internal Assessment:100 Marks ♦ Presentation assessed by Panel Members ♦ Assessed by Guide

� End Semester Examination:100 Marks

♦ Viva Voce ♦ Demonstration ♦ Project Report

� Assessment of Seminar

� Continuous Internal Assessment:50 Marks ♦ Presentation assessed by Panel Members

13.BRIEF OF PHYSICS AND CHEMISTRY CYCLE:

• All the student in B. Tech first year are divided into two groups i.e. Circuit and Non-Circuit

branches (i.e. Physics and Chemistry Cycle respectively)

• The students in Physics Cycle and Chemistry Cycle being swapped between Chemistry &

Physics Cycle respectively in next Semester (i.e. Second semester).

14.QUESTION PAPER PATTERN:

End Semester Examination (ESE) :

Theory Papers:

The ESE is conducted for 100 marks of 3 hours duration.

The syllabus for the theory papers is divided into FIVE units and each unit carries equal weightage in terms of

marks distribution.

Question paper pattern is as follows.

Two full questions with either or choice, will be drawn from each unit. Each question carries 20 marks. There

could be a maximum of three sub divisions in a question. The emphasis on the questions is broadly based on

the following criteria:

50 % - To test the objectiveness of the concept

30 % - To test the analytical skill of the concept

20 % - To test the application skill of the concept

Laboratory / Practical Papers:

The ESE is conducted for 50 marks of 3 hours duration. Writing, Execution and Viva – voce will carry

weightage of 20, 20 and 10 respectively.

Mid Semester Examination (MSE) :



Theory Papers:

The MSE is conducted for 50 marks of 2 hours duration.

Question paper pattern; Five out of Six questions have to be answered. Each question carries 10 marks.

Laboratory / Practical Papers:

The MSE is conducted for 50 marks of 2 hours duration. Writing, Execution and Viva – voce will carry

weightage of 20, 20 and 10 respectively.

Holistic Education:

End Semester Examination 25 Marks Participation 25 Marks Total 50 Marks



15 .COURSE STRUCTURE

PHYSICS CYCLE SEMESTER-I

SEMESTER-II CHEMISTRY CYCLE

S. No.

Course No. Course Name L T P Marks Credits

THEORY 1 MA 131 Mathematics – I 4 0 0 100 4 2 PH 132 Engineering Physics 4 0 2 100 4

3 EE 133 Basic Electrical Engineering 4 0 2 100 4 4 CE 134 Engineering Mechanics 4 0 0 100 4 5 EG 135 Engineering Graphics 4 0 2 100 4

6 PD 136 Professional Development-I 4 0 0 100 4 7 HE 171 Holistic Education 1 0 0 1

PRACTICAL

8 PH 151 Engineering Physics Laboratory 0 0 2 50 2

9 EE 152 Basic Electrical Engineering Laboratory 0 0 2 50 2

Total 700 29

S. No.

Course No. Course Name L T P Marks Credits

THEORY 1 MA231 Mathematics – II 4 0 0 100 4 2 CH 232 Engineering Chemistry 4 0 2 100 4

3 EC 233 Basic Electronics 4 0 2 100 4

4 CS 234 Problem Solving and Programming Concepts 4 0 2 100 4

5 ME 235 Elements of Mechanical Engineering 4 0 0 100 4

6 HE 271 Holistic Education 1 0 0 1 7 ME 251 Workshop Practice 4 0 0 50 2

PRACTICAL

8 CS 252 Computer Programming Laboratory 0 0 2 50 2

9 CH 253 Engineering Chemistry Laboratory 0 0 2 50 2 Total 650 27



SEMESTER III

S.No Course

No Course Name L T P Marks Credit THEORY

1 CS331 Mathematics – III 3 1 0 100 4

2 CS332 Data Structures 3 1 2 100 4

3 CS333 Electronic Circuits and Digital Systems 3 1 2 100 4

4 CS334 Object Oriented Programming 3 1 2 100 4

5 CS335 Computer Architecture 3 1 0 100 4

6 HE371 Holistic Education 1 1

PRACTICAL

7 CS351 Object Oriented Programming Laboratory 0 0 2 50 2

8 CS352 Electronic Circuits and Digital Systems Laboratory 0 0 2 50 2

9 CS353 Data Structures Laboratory 0 0 2 50 2 Total 650 27

SEMESTER IV

S.No Course


1 CS431 Probability and Queuing Theory 3 1 0 100 4

2 CS432 Design and Analysis of Algorithms 3 1 0 100 4

3 CS433 Analog and Digital Communication 3 1 0 100 4

4 CS434 Professional Development -II 4 0 100 4

5 CS435 Operating Systems 3 1 2 100 4

6 CS436 Visual Programming 3 1 2 100 4

7 HE471 Holistic Education 1 1

PRACTICAL

8 CS451 Operating Systems Laboratory 0 0 2 50 2

9 CS452 Visual Programming Laboratory 0 0 2 50 2 Total 700 29



SEMESTER V

S.No Course


1 CS531 Discrete Mathematics 3 1 0 100 4

2 CS532 Database Management Systems 3 1 2 100 4

3 CS533 Computer Networks 3 1 2 100 4

4 CS534 Theory of Computation 3 0 0 100 4

5 CS535 Microprocessors and its Application 3 0 2 100 4

PRACTICAL

6 CS551 Network Laboratory 0 0 2 50 2

7 CS552 Microprocessors Laboratory 0 0 2 50 2

8 CS553 DBMS Laboratory 0 0 2 50 2 Total 650 26

SEMESTER VI

S.No Course


1 CS631 Elective - I 3 1 0 100 4

2 CS632 Digital Signal Processing 3 1 0 100 4

3 CS633 System Software 3 1 2 100 4

4 CS634 Software Engineering 3 1 0 100 4

5 CS635 Numerical Methods 3 1 0 100 4

6 CS636 Graphics and Multimedia 3 1 2 100 4

PRACTICAL

7 CS651 Graphics and Multimedia Laboratory 3 1 2 50 2

8 CS652 System Software Laboratory 3 1 2 50 2 Total 700 28



SEMESTER VII

SEMESTER VIII

S.No Course

No Course Name L T P Marks Credit

1 CS831 Elective V 3 1 0 100 4

2 CS832 Elective VI 3 1 0 100 4

3 CS833 Elective VII 3 1 0 100 4

4 CS871 Project Work 0 0 0 200 6

5 CS872 Seminar 50 2

6 BTCY01 Cyber Security 3 1 0 100 4

Total 650 20

ELECTIVES SEMESTER VI

S.No Ref.No Course Name L T P Marks Credit

1 CS1001

Resource Management Techniques 3 1 0 100 4

2 CS1002

UNIX Internals 3 1 0 100 4

3 CS1003

High Performance Microprocessors 3 1 0 100 4

4 CS1004

Data Warehousing and Mining 3 1 0 100 4

5 IT1353

Embedded Systems 3 1 0 100 4

6 CS1006

Advanced Databases 3 1 0 100 4

7 GE1001

Intellectual Property Rights 3 1 0 100 4

8 GE1002

Indian Constitution and Society 3 1 0 100 4

S.No Course


1 CS731 Elective - II 3 1 0 100 4

2 CS732 Elective - III 3 1 0 100 4 3 CS733 Elective - IV 3 1 0 100 4

4 CS734 Internet Programming 3 1 2 100 4

5 CS735 Artificial Intelligence 3 1 0 100 4

6 CS736 Java Programming 3 1 2 100 4

PRACTICAL

7 CS751 Java Programming Laboratory 0 0 2 50 2

8 CS752 Internet Programming Laboratory 0 0 2 50 2 Total 700 28



SEMESTER VII

OPEN ELECTIVES

S.No Ref.No Course Name L T P Marks Credit 1 CS1007 Advanced Operating Systems 3 1 0 100 4

2 CS1008 Real Time Systems 3 1 0 100 4

3 CS1009 TCP/IP Design and Implementation 3 1 0 100 4

4 CS1010 C# and .NET Framework 3 1 0 100 4

5 CS1011 System Modeling and Simulation 3 1 0 100 4

6 IT1352 Cryptography and Network Security 3 1 0 100 4

7 CS1012 Natural Language Processing 3 1 0 100 4

8 CS1013 Advanced Computer Architecture 3 1 0 100 4

9 CS1014 Information Security 3 1 0 100 4

10 CS1015 User Interface Design 3 1 0 100 4

11 CS1016 Graph Theory 3 1 0 100 4

12 MG1401 Total Quality Management 3 1 0 100 4 13 CS1017 Object Oriented Analysis and Design 3 1 0 100 4

SEMESTER VIII

OPEN ELECTIVES:CS831, CS832, CS833

S.No Ref.No Course Name L T P Marks Credit

1 CS1018

Parallel Computing 3 1 0 100 4

2 CS1019

Soft Computing 3 1 0 100 4

3 EC1008

High Speed Networks 3 1 0 100 4

4 EC1009

Digital Image Processing 3 1 0 100 4

5 CS1020

Robotics 3 1 0 100 4

6 IT1401

Component Based Technology 3 1 0 100 4

7 CS1021

Software Quality Management 3 1 0 100 4

8 CS1022

Quantum Computing 3 1 0 100 4

9

CS1023

Knowledge Based Decision Support Systems 3 1 0 100 4

10 IT1012

Grid Computing 3 1 0 100 4

11 GE1301

Professional Ethics and Human Values 3 1 0 100 4

12 CS1024

Mobile Computing 3 1 0 100 4

13 CS1025

Advanced Java Programming 3 1 0 100 4





MATHEMATICS - I MA 131

PAPER DESCRIPTION:

This paper contains five units which are Matrix Theory, Differential and Integral Calculus,

Differential Equation and Vector Calculus. This paper aims at enabling the students to know

various concepts and principles of calculus. Successive differentiation to any order, calculus of

functions of several variables, application of calculus to find area, volume etc and drawing

complicated curves, classification of different type of differential equation with an introduction to

vector calculus are covered in this paper.

PAPER OBJECTIVES:

This course is addressed to those who intend to apply the subject at the proper place and time, while

keeping him/her aware to the needs of the society where he/she can lend his/her expert service, and

also to those who can be useful to the community without even going through the formal process of

drilling through rigorous treatment of mathematics.

UNIT –I: Matrix Theory 12 Hours

Basic concepts of matrix, matrix addition, scalar multiplication, matrix multiplication; Inverse of a

matrix; Determinants; Systems of linear equations, Eigenvalues, eigenvectors, and applications,

Cayley – Hamilton Theorem; Symmetric, skew-symmetric, and orthogonal matrices, Hermitian,

skew-Hermitian and unitary matrices; Properties of eigenvalues, diagonalization

UNIT - II: Differential Calculus - I 10 Hours

nth order derivative of standard functions. Leibnitz’s theorem (without proof) and Problems.

Partial Derivatives, Euler’s Theorem. Total differentiation. Differentiation of Composite and

implicit functions. Jacobians and their properties.

UNIT - III: Integral Calculus – I 14 Hours

Reduction formulae for the integration of sinn x , cosn x , tann x , cotn x , secn x , cos nec x and

sin cosmx nx and evaluation of these integrals with standard limits - Problems. Tracing of standard

curves in Cartesian, Parametric and Polar form.



Derivative of arc length, Applications of integration to find surfaces of revolution and volumes of

solids of revolution.

UNIT – IV: Differential Equation - I 10 Hours

Solution of first order and first degree differential equations: homogeneous, linear, Bernoulli and

exact equations, Applications of differential equations.

UNIT –V: Vector Calculus - I 14 Hours

Vector differentiation. Velocity, Acceleration of a particle moving on a space curve. Vector point

function. Gradient, Divergence, Curl, Laplacian. Solenoidal and Irrotational vectors - Problems.

TEXT BOOK

1. Dr. B. S. Grewal, “Higher Engineering Mathematics”, 39th Edition, Khanna Publishers, July

2005.

2. K. A. Stroud, “Engineering Mathematics”, 6th Edition, Palgrave Macmillan, 2007.

REFERENCE BOOKS

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley & Sons,

Inc, 2005

2. Thomas and Finney, “Calculus”, 9th Edition, Pearson Education, 2004

3. Peter V. O’Neil, “Advanced Engineering Mathematics”, Thomson Publication, Canada,

2007

4. B. V. Ramana, “Higher Engineering Mathematics”, Tata McGraw – Hill, 2009.

5. Michael Artin, “Algebra”, 2nd Edition, Prentice Hall of India Private Limited, New Delhi,

2002

6. Kenneth Hoffman and Ray Kunze, “Linear Algebra”, 2nd Edition, Prentice Hall of India

Private Limited, New Delhi, 2002

7. George F. Simmons and Steven G. Krantz, “Differential Equation, Theory, Technique and

Practice”, Tata McGraw – Hill, 2006.

8. M. D. Raisinghania, “Ordinary and Partial Differential Equation”, Chand (S.) & Co. Ltd.,

India, March 17, 2005.

9. H. K. Das & Rajnish Verma, “Higher Engineering Mathematics”, S. Chand &

Company Ltd., 2011.



ENGINEERING PHYSICS – PH 132 / PH 232

(Common for all branches)

PAPER DESCRIPTION:

This paper contains five UNITs which are

• Modern Physics and Quantum Mechanics

• Conductivity in Metals( Electrical and thermal)

• Elastic, Dielectric, Magnetic and Optical Properties of Materials

• Lasers, Optical Fibers and Ultrasonics

• Crystal Structure and Modern Engineering materials.

This paper aims at enabling the students to know fundamentals covered in this paper.

PAPER OBJECTIVES:

• To impart the basic concepts and ideas in physics.

• To develop scientific attitudes and enable the students to correlate the concepts of physics

with the core programmes.

LEVEL OF KNOWLEDGE: Basic/working

UNIT – I Modern Physics 14 Hours

Introduction to Blackbody radiation spectrum - Planck’s theory(qualitative) – Deduction of Wien’s

displacement law and Rayleigh Jean’s law from Planck’s theory – Quantum theory applied to

Einstein’s Photo-electric effect - Photo Multiplier Tube -Compton effect - Wave particle Dualism -

de Broglie hypothesis – de Broglie wavelength - extension to electron particle – Davisson and

Germer Experiment - Matter waves and their Characteristic properties. Phase velocity, group

velocity and Particle velocity. (qualitative).Elementary particles – QUARKS – Types – Properties.

Quantum Mechanics

Heisenberg’s uncertainty principle and its physical significance(no derivation). Application of

uncertainty principle (Non-existence of electron in the nucleus).

Wave function. Properties and Physical significance of a wave function Schroedinger’s - Time

independent wave equation – Application: Setting up of a one dimensional Schrödinger wave

equation of a particle in a potential well of infinite depth : Probability density and Normalisation of

wave function – Energy eigen values and eigen function.

UNIT – II Conductivity in metals – Electrical and Thermal 11 Hours

Classical free-electron theory. Assumptions. Drift velocity. Mean collision time and mean free

path. Relaxation time. Expression for drift velocity. Expression for electrical conductivity in



metals. Effect of impurity and temperature on electrical resistivity of metals. Failure of classical

free-electron theory. Thermal Conductivity. Wiedmann-Franz Law( relation between thermal

conductivity & electrical conductivity).

Quantum free-electron theory - Assumptions. Fermi - Dirac Statistics. Fermi-energy – Fermi

factor. Density of states (with derivation). Carrier concentration in metals. Expression for electrical

resistivity/conductivity Temperature dependence of resistivity of metals. Merits of Quantum free –

electron theory.

UNIT – III Properties of Materials 12 Hours

Elasticity: Elasticity – types of moduli of elasticity – stress strain diagram – Young’s modulus of

elasticity – rigidity modulus – bulk modulus – Poisson’s ratio –Bending of beams – Single

Cantilever - Young’s modulus-Non uniform bending.

Dielectric: Dielectric constant and polarisation of dielectric materials. Types of polarisation.

Equation for internal fields in liquids and solids (one dimensional). Clausius – Mossotti equation.

Ferro and Piezo – electricity(qualitative). Frequency dependence of dielectric constant. Important

applications of dielectric materials.

Optics : Phenomenon of diffusion, absorption and scattering of a light – Snell’s Law - Interference

– thin films - Air wedge theory and experiment Testing of flat surfaces. Anti reflection coating

single and multi layer.

UNIT – IV 12 Hours

Lasers : Principle and production. Einstein’s coefficients (expression for energy density).

Requisites of a Laser system. Condition for Laser action. Principle, Construction and working of

Nd YAG and semiconductor diode Laser. Applications of Laser – Laser welding, cutting and

drilling. Measurement of atmospheric pollutants.

Optical Fibers : Principle and Propagation of light in optical fibers. Angle of acceptance.

Numerical aperture. Types of optical fibers and modes of propagation. Applications – block

diagram discussion of point to point communication.

Ultrasonics : Ultrasonics production – Magnetostriction and Piezoelectric methods – Application

(NDT) non-destructive testing of materials- Flaw detection- Measurement of velocity in liquids.

Determination of elastic constants in liquids using Ultrasonic Interferometer.

UNIT - V Material Science 12 Hours



Crystal Structure : Space lattice, Bravais lattice - UNIT cell, primitive cell. Lattice parameters.

Crystal systems. Direction and planes in a crystal. Miller indices. Expression for inter-planar

spacing. Co-ordination number. Atomic packing factor. Bragg’s Law. Determination of crystal

structure by Bragg’s x-ray spectrometer. Crystal structure of Na Cl.

Modern Engineering Materials:

Metallic Glasses: Properties – Applications.

Shape Memory Alloys : Characteristics - Applications.

Cryogenics : Properties – Applications.

Nano-materials : Molecular Manufacturing. Fabrication technology. Scaling of classical

mechanical systems – Basic assumptions. Mechanical scaling. Carbon nano-tubes.

TEXT BOOKS:

1. M.N.Avadhanulu and P.G. Kshirsagar, “A Text Book of Engineering Physics”, S.Chand &

Company Ltd, 9th Edition 2012.

2. S.O. Pillai, “Solid State Physics”, New Age International, 6th Edition 2009.

3. S.P. Basavaraju, “ Engineering Physics”, Revised Edition 2009.

REFERENCE BOOKS:

1. R.K. Gaur and S.L. Gupta, "Engineering Physics", Dhanpatrai and Sons,

New Delhi, 2001.

2. Sehgal Chopra Sehgal, “ Modern Physics ", Tata McGraw-Hill,

6th Edition, 2005.

3. Halliday, Resnick and Krane, "Fundamentals of Physics Extended",

John Wiley and Sons Inc., New York, 5th Edition, 1997.

4. P.Mani, “Engineering Physics”, Dhanam publishers, Revised Edition 2011.

5. H.J. Sawant, "Engineering Physics", Technical Publications, 1st Edition, 2010.

6. V. Rajendran, “Engineering Physics”, Tata Mcgraw Hill Publishing Company Limited, 1st

Edition, 2009.

7. K.Eric Drexler, “Nanosystems - Molecular Machinery, Manufacturing and Computation”,

John Wiely & Sons, 2005.

8. J David, N Cheeke , “Fundamentals and Applications of Ultrasonic Waves”, CRC Press 1st

Edition, 2002.

9. Frederick J Bueche and Eugene Hecht “Schaum Outline of Theory and Problems of College

Physics”, Tata McGraw-Hill, 11th Edition, 2012.



BASIC ELECTRICAL ENGINEERING – EE 133 / EE 233


PAPER DESCRIPTION:

This paper contains five units which are Analysis of DC circuits, Single phase & three phase A C

circuits, DC and AC machines and transformers. This paper aims at enabling the students to

provide comprehensive idea about circuit analysis, working principles of machines covered in this

paper.

PAPER OBJECTIVES:

At the end of the course students will be able

� To understand the basic concepts of magnetic circuits, AC & DC circuits.

� To solve the electrical network using mesh and nodal analysis

� To understand the concept of active, reactive and apparent powers, power factor and

resonance in series and parallel circuits.

� To know the basic concepts of three phase loads and power measurement.

� To explain the working principle, construction, applications of DC & AC machines

UNIT – I 12 Hours

Introduction to electrical power generation and distribution

ELECTRIC CIRCUIT ELEMENTS:

Sources: Ideal voltage source, practical voltage source, ideal current source, practical current

source, source transformation, Controlled sources.

Resistor: Resistance, linear and non-linear resistors, resistors in series, resistors in parallel, current

division, power consumed by a resistor.

Capacitor: Capacitance, equivalent capacitance of capacitors in series, voltage division, capacitors

in parallel, energy stored by a capacitor.



Inductor: Inductance, self-induced emf, energy stored by an inductor, inductors in series, inductors

in parallel mutual Inductance, Co-efficient of coupling.

Resistive networks: star- delta and delta – star transformations, network reduction technique.

UNIT – II SINGLE-PHASE AC CIRCUITS 12Hours

Alternating voltages and currents, generation of single phase alternating voltage, average value and

rms value of periodic sinusoidal and non- sinusoidal wave forms, form factor.

Representation of time-varying quantities as phasors; the operator j; Representation of complex

quantities; Addition, subtraction, multiplication and division of phasors.

Basic ac circuits, sinusoidal alternating current in a pure resistor, pure inductor and a pure

capacitor, waveforms of voltage, current, and power, phasor diagram, inductive and capacitive

reactances.

RL, RC, and RLC circuits, concept of impedance and phasor diagram, expression for average

power, power factor, parallel ac circuits, conductance, susceptance and admittance, analysis of

series parallel circuits and phasor diagrams, active power, reactive power, and apparent power,

complex power and power triangle.

UNIT III THREE-PHASE AC CIRCUITS 12 Hours

Generation of 3-phase balanced sinusoidal voltages, waveform of 3-phase voltages, star and

delta connections, line voltage and phase voltage, line current and phase current, analysis of 3-

phase circuit with balanced supply voltage and with star/delta connected balanced loads,

measurement of active power using two-wattmeter method with balanced loads.

UNIT – IV ELECTROMAGNETISM 12 Hours

Introduction to electromagnetism, comparison of electrical circuit with magnetic

circuit, Magnetic flux, Flux density, Fleming's left hand rule, Faraday’s laws, Fleming's right hand

rule, Lenz’s law,

DC MACHINES:

Working principle of DC machine as a generator and motor. Constructional features. E.M.F.

equation of generator and illustrative examples. Back E.M.F. and torque equations of D.C. motors.

Types of D.C. motors.



UNIT – V 12 Hours

TRANSFORMERS: Types, constructional features, principle of operation, equation for induced

emf, transformation ratio, ideal transformer, transformer under no-load, losses, efficiency,

applications.

THREE-PHASE INDUCTION MOTORS:

Types, constructional details, production of rotating magnetic field, synchronous speed, principle

operation, slip, Necessity of a starter for 3-phase induction motor, Star –Delta starter.

TEXT BOOKS:

1. Arthur Eugene Fitzgerald, David E. Higginbotham, Arvin Grabel, “Basic electrical engineering:

circuits, electronics, machines, controls”, McGraw-Hill, Fifth Edition.

2. E. Hughes; “Electrical Technology", 9th Edition”, Pearson, 2005.

REFERENCE BOOKS:

1. Kothari D. P. & Nagarath I. J, “Basic Electrical Technology”, TMH, 2004

2. Rajendra Prasad, “Fundamentals of Electrical Engineering”, Prentice Hall of India Pvt Ltd., 2005

3. K.A. Krishnamurthy and M.R Raghuveer, “Electrical, Electronics and Computer Engineering”,

2nd Edition, T.M.H., 2001

4. D C Kulshreshtha, “Basic Electrical Engineering”, TMH.

5. Abhijit Chakrabarti, Sudipta Nath & Chandan Kumar Chanda, “Basic Electrical Engineering”,

TMH, 2009.



ENGINEERING MECHANICS – CE 134 / CE 234


SUBJECT DESCRIPTION: This paper aims at enabling the students to know the fundamentals

Engineering Mechanics covered in this paper. This paper contains five units which are Engineering

Mechanics and its classification, Composition of Forces, Equilibrium of Forces, Types of Supports,

Analysis of trusses, Centriod and Moment of Inertia and Friction.

SUBJECT OBJECTIVES:

• The students will understand the basics of Engineering Mechanics

• The students will understand the basic principles, laws, measurements, calculations and SI

units.

• The students will understand mechanics that studies the effects of forces and moments

acting on rigid bodies that are either at rest or moving with constant velocity along a straight

path for static condition only.

• The students will understand the basic concepts of forces in the member, centriod, moment

of inertia & friction

LEVEL OF KNOWLEDGE: Basic

UNIT – I: INTRODUCTION TO ENGINEERING MECHANICS 15 HOURS

Basic idealizations – Practical, Continuum, Rigid body and Point force; Newton’s laws of motion,

Definition of force, Introduction to SI units, Elements of a force, classification of force and force

systems; Principle of physical independence of forces, Principle of superposition of forces,

Principle of transmissibility of forces; Moment of a couple, characteristics of couple, Equivalent

force – couple system; Resolution of forces, composition of forces; Numerical problems on

moment of forces and couples, on equivalent force – couple system.

COMPOSITION OF FORCES: Definition of Resultant; Composition of coplanar – concurrent

force system, Principle of resolved parts; Numerical problems on composition of coplanar

concurrent force systems



COMPOSITION OF COPLANAR: Non-concurrent force system, Varignon’s principle of

moments; Numerical problems on composition of coplanar non-concurrent force systems.

UNIT – II: EQUILIBRIUM OF FORCES 13 HOURS

Definition of Equilibrant; Conditions of static equilibrium for different force systems, Lami’s

theorem; Numerical problems on equilibrium of coplanar – concurrent force system.

TYPES OF SUPPORTS: Statically determinate beams, Numerical problems on equilibrium of

coplanar-non- concurrent force system and support reactions for statically determinate beams

UNIT – III: ANALYSIS OF PLANE TRUSSES 09 HOURS

Introduction to Determinate and Indeterminate plane trusses - Analysis of simply supported and

cantilevered trusses by method of joints and method of sections

UNIT – IV: CENTROID OF PLANE FIGURES 15 HOURS

Locating the centroid of triangle, semicircle, quadrant of a circle and sector of a circle using

method of integration, centroid of simple built up sections; Numerical problems.

MOMENT OF INERTIA OF AN AREA : polar moment of inertia, Radius of gyration,

Perpendicular axis theorem and Parallel axis theorem; Moment of Inertia of rectangular, circular

and triangular areas from method of integration; Moment of inertia of composite areas; Numerical

problems.

UNIT – V: FRICTION 08 HOURS

Types of friction, Laws of static friction, Limiting friction, Angle of friction, angle of

repose; Impending motion on horizontal and inclined planes; Wedge friction; Ladder friction;

Numerical problems.



TEXT BOOKS:

1. Bhavikatti S.S. “Elements of Civil Engineering (IV Edition) and Engineering Mechanics”,

2/E, Vikas Publishing House Pvt. Ltd., New Delhi, 2008

2. Jagadeesh T.R. and Jay Ram, “Elements of Civil Engineering and Engineering

Mechanics”, 2/E, Sapana Book House, Bangalore, 2008.

3. Shesh Prakash and Mogaveer, “Elements of Civil Engineering and Engineering

Mechanics”, 1/E, PHI learning Private Limited, New Delhi, 2009.

REFERENCE BOOKS:

1. Bansal R. K, “Engineering Mechanics”, Laxmi Publications(P) Ltd, New Delhi, 1995

2. Ferdinand P. Beer and E. Russel Johnston Jr., “Mechanics for Engineers: Statics”, 8/E,

McGraw-Hill Book Company, New Delhi. 2007

3. Goyal and Raghuvanshi., “Engineering Mechanics”, New Edition, PHI learning Private

Limited, New Delhi.

4. Irvingh H Shames, “Engineering Mechanics”, 4/E, PHI learning Private Limited, New

Delhi, 2008

5. Jivan khachane & Ruchishrivasatava, “Engineering Mechanics”, Ane’s Student Edition,

Anne Book India, New Delhi, 2006.

6. Kolhapure B.K., “Elements of Civil Engineering & Engineering Mechanics”, 1/E, EBPB

Publications, Belgaum, 2003.

7. Lakshmana Rao, et al., “Engineering Mechanics - Statics and Dynamics”, New Edition, PHI

learning Private Limited, 2009.

8. Meriam J. L, and Kraige., L. G , “Engineering Mechanics”, 5/E, Volume I, Wiley India

Edition, India, 2009.

9. Nelson, “Engineering Mechanics”, New Edition, Tata McGraw-Hill Education Pvt. Ltd,

2009

10. Palanichamy M.S., “Engineering Mechanics (Statics & Dynamic)”, 3/E, Tata McGraw-Hill

Education Pvt. Ltd, New Delhi, 2008.

11. Sawant H. J, & Nitsure., “Elements of Civil Engineering (IV Edition) and Engineering

Mechanics”, New Edition, Technical publications, Pune, India, 2010.

12. Sawhney, “Engineering Mechanics”, New Edition, PHI learning Private Limited, New

Delhi, 2008. Timoshenko and Yong, “Engineering Mechanics”, 5/E, Tata McGraw-Hill

Book Company, New Delhi, 2007.



ENGINEERING GRAPHICS – EG 135 / EG 235


PAPER DESCRIPTION:

Provides basic knowledge about Orthographic projections, Projections of points, Projection of

lines, Projection of Planes and Projection of Solids, development of Surfaces & isometric

projections & also helps students learn Solid Edge.

PAPER OBJECTIVES:

• To draw and interpret various projections of 1D, 2D and 3D objects..

• To prepare and interpret the drawings.

• Hands on training in Solid Edge.

LEVEL OF KNOWLEDGE: Working

UNIT - I Introduction to Computer Aided Sketching 6 Hours

Introduction, Drawing Instruments and their uses, BIS conventions, Lettering, Dimensioning and

free hand practicing. Computer screen, layout of the software, standard tool bar/menus and

description of most commonly used tool bars, navigational tools. Co-ordinate system and reference

planes. Definitions of HP, VP, RPP & LPP. Creation of 2D/3D environment. Selection of drawing

size and scale. Commands and creation of Lines, Co-ordinate points, axes, poly-lines, square,

rectangle, polygons, splines, circles, ellipse, text, move, copy, off-set, mirror, rotate, trim, extend,

break, chamfer, fillet, curves, constraints viz. tangency, parallelism, inclination and

perpendicularity. Dimensioning, line conventions, material conventions and lettering

UNIT – II Orthogonal Projections 15 Hours

Introduction, Definitions - Planes of projection, reference line and conventions employed,

Projections of points in all the four quadrants, Projections of straight lines (located in First

quadrant/first angle only), True and apparent lengths, True and apparent inclinations to reference

planes (No application problems).



UNIT – III 15 Hours

Orthographic Projections of Plane Surfaces (First Angle Projection Only)

Introduction, Definitions – projections of plane surfaces – triangle, square, rectangle, rhombus,

pentagon, hexagon and circle, planes in different positions by change of position method only (No

problems on punched plates and composite plates)

UNIT – IV PROJECTIONS OF SOLIDS 18 Hours

Introduction, Definitions – Projections of right regular tetrahedron, hexahedron (cube),

prisms, pyramids, cylinders and cones in different positions. (No problems on octahedrons and

combination solid) 4. Projections of Solids:

UNIT – V 15 Hours

SECTIONS AND DEVELOPMENT OF LATERAL SURFACES OF SOL IDS:

Introduction, Section planes, Sections, Section views, Sectional views, Apparent shapes and True

shapes of Sections of right regular prisms, pyramids, cylinders and cones resting with base on HP.

(No problems on sections of solids) Development of lateral surfaces of above solids, their frustums

and truncations. (No problems on lateral surfaces of trays, tetrahedrons, spheres and transition

pieces).

UNIT – VI 15 Hours

ISOMETRIC PROJECTION (USING ISOMETRIC SCALE ONLY):

Introduction, Isometric scale, Isometric projection of simple plane figures, Isometric projection of

tetrahedron, hexahedron(cube), right regular prisms, pyramids, cylinders, cones, spheres, cut

spheres and combination of solids (Maximum of three solids).

TEXT BOOKS:

1. K.R. Gopalakrishna, “Engineering Graphics”, 15th Edition, Subash Publishers Bangalore.

2. Basant Agrawal, C. M. Agrawal, “Engineering Drawing”, TMH.

3. N.D. Bhatt, “Engineering Graphics, Elementary Engineering Drawing”, 48th Edition, Charotar

Publishing House, 2005.

4. S. Trymbaka Murthy, “Computer Aided Engineering Drawing”, I.K. International Publishing



House Pvt. Ltd., New Delhi.

5. P. J. Shah, “A Text Book og Engineering Graphics”, S. Chand & Company Ltd., New Delhi

6. Arunoday Kumar, “Engineering Graphics – I and II”, Tech – Max Publication, Pune.

7. T. Jeyapoovan, “Engineering Drawing & Graphics using Auro CAD 2000”, Vikas Publishing

Hoise Pvt. Ltd. , New Delhi.

8. R. K. Dhawan, “A Text Book of Engineering Drawing”, by S. Chand & Company Ltd., New

Delhi.

9. P. S. Gill, “A Text Book of Engineering Drawing”, S K Kataria & sons, Delhi.

10. D. A. Jolhe, “Engineering Drawing with an Introduction to Auto CAD”, D. A. Jolhe Tata

McGraw – Hill Publishing Co. Ltd., New Delhi.

11. S. Trymbaka Murthy, “Computer Aided Engineering Drawing”, I.K. International

Publishing House Pvt. Ltd., New Delhi.



PROFESSIONAL DEVELOPMENT–I PD136/PD236


AIM

The aim of the course is to develop effective oral and written business and executive

communication skills and negotiation strategies of the students and also in the areas of boundary

value problems and transform techniques.

OBJECTIVES

At the end of the course the students would

• Be capable of an acceptable level of oral and written communication.

• Be able to make effective presentations.

• Be able to apply negotiation strategies

• Be able to use technology advancements in communication.

EXECUTIVE AND BUSINESS COMMUNICATION

PART A – BUSINESS COMMUNICATION

UNIT 1 Introduction 5 Hours

Role of communication – defining and classifying communication – purpose of communication –

process of communication – characteristics of successful communication – importance of

communication in management – communication structure in organization – communication in

crisis

UNIT 2 Oral communication 5 Hours

What is oral Communication – principles of successful oral communication – barriers to

communication – what is conversation control – reflection and empathy: two sides of effective oral

communication – effective listening – non – verbal communication

UNIT 3 Written communication 9 Hours



Functional English Grammar, Purpose of writing – clarity in writing – Vocabulary – commonly

confused and misused words, principles of effective writing – approaching the writing process

systematically: The 3X3 writing process for business communication: Pre writing – Writing –

Revising – Specific writing features – coherence – electronic writing process.

UNIT 4 Business letters and reports 6 Hours

Introduction to business letters – writing routine and persuasive letters – positive and negative

messages- writing memos – what is a report purpose, kinds and objectives of reports- writing

reports

UNIT 5 Case method of learning 6Hours

Understanding the case method of learning – different types of cases – overcoming the difficulties

of the case method – reading a case properly (previewing, skimming, reading, scanning) – case

analysis approaches (systems, Behavioural, decision, strategy) – analyzing the case – dos and

don’ts for case preparation

UNIT 6 Presentation skills 8 Hours

What is a presentation – elements of presentation – designing a presentation. Advanced visual

support for business presentation- types of visual aid

Negotiations skills: What is negotiations – nature and need for negotiation – factors affecting

negotiation – stages of negotiation process – negotiation strategies

UNIT 7 6 Hours

Employment communication: Introduction – writing CVs – Group discussions – interview skills

Impact of Technological Advancement on Business Communication

Communication networks – Intranet – Internet – e mails – SMS – teleconferencing –

videoconferencing

PART –B EXECUTIVE COMMUNICATION

UNIT 8 7 Hours



Group communication: Meetings – Planning meetings – objectives – participants – timing –

venue of meetings – leading meetings.

Media management – the press release- press conference – media interviews

Seminars – workshop – conferences.

Business etiquettes.

UNIT 9 8 Hours

Harnessing Potential & Developing Competencies in the areas of : Leadership Skills, Body

Language, Phonetics, Stress, Rhythm, Voice & Intonation, Eye Contact, Understanding Personal

Space, Team Building, Motivational Skills, Assertiveness Communication Skills, Active Listening,

Lateral & Creative Thinking, Cross Cultural Communication, Conflict Resolution, Time

Management, Stress Management, Selling Skills & Customer Relationship Management,

Appropriate Humour at the Workplace.

RECOMMENDED BOOKS :

1. Business Communication : Concepts, Cases And Applications – P D Chaturvedi, Mukesh

Chaturvedi Pearson Education, 1/e, 2004 (UNIT 1, 2, 4, 5, & 7 )

2. Business Communication, Process And Product – Mary Ellen Guffey – Thomson Learning ,

3/E, 2002 (UNIT 3)

3. Basic Business Communication – Lesikar, Flatley TMH 10/E, 2005 (UNIT 1, 2, 4, 5, & 7)

4. Advanced Business Communication – Penrose, Rasberry, Myers Thomson Learning, 4/e,

2002 (UNIT 6 & 8)

5. Business Communication, M.K. Sehgal & V. Khetrapal, Excel Books.

6. Effective Technical Communication By M Ashraf Rizvi .- TMH, 2005

7. Business Communication Today by Bovee Thill Schatzman – Pearson & Education, 7th Ed,

, 2003

8. Contemporary Business Communication - Scot Ober-Biztanntra, 5/e

9. Business Communication – Krizan, Merrier, Jones- Thomson Learning, 6/e, 2005



HOLISTIC EDUCATION- HE 171 / HE 271


PAPER DESCRIPTION:

This paper contains three units which are Introduction to Life skills, Personal skills, Inter-personal

Skills and Societal Skills. This paper aims at enabling the students to various skills in life.

PAPER OBJECTIVE:

• Holistic development of the individual adult in every student

• Knowing life and its principles

• Broadening the outlook to life

• Training to face the challenges of life

• Confidence creation and personality development

• Emotional control and stress management

• Creating awareness on duties, rights and obligations as member of the Society

• Realizing Personal Freedom-its limits and limitations

• Developing the attitude to be a contributor and giver

• Realizing the real happiness in life


1. INTRODUCTION TO LIFE SKILLS (I Semester) 4 Hours

2. PERSONAL SKILLS

• Creative thinking and Problem solving (I Semester)

• Critical thinking and Decision making(I Semester)

• Study skills and Time management(II Semester)

• Health (II Semester)



3. INTER-PERSONAL SKILLS 4 Hours

• Non verbal Communication(I Semester)

• Empathy and active listening(I Semester)

• Assertiveness Training (II Semester)

• Conflict Management(II Semester)

4. SOCIETAL SKILLS 4 Hours

• Human Rights(I Semester)

• Civil Society and Civic sense(I Semester)

• Equality and Justice(II Semester)

• Gender Sensation(II Semester)

TEXT BOOK: Holistic Education by Christ College publication, Bangalore-560029



ENGINEERING PHYSICS LABORATORY – PH 151 / PH 251


SUBJECT DESCRIPTION:

This paper contains twelve experiments and aims at enabling the students to Practical Engineering

Physics.

SUBJECT OBJECTIVES:

• To develop scientific and experimental skills of the students

• To correlate the theoretical principles with application based studies.

LEVEL OF KNOWLEDGE: Basic/working (Any 8 only)

1. Planck’s Constant (Determination of Planck’s constant using LED or using the principle of

photoelectric effect)

2. Verification of Stefan’s law

3. Thermal Conductivity of a bad conductor – Lee’s disc apparatus.

4. Determination of Fermi Energy

5. Young’s modulus – Non-uniform bending/Strain gauge/Travelling Microscope

6. Measurement of Dielectric Constant( Charging & discharging of capacitor)

7. Interference at a wedge.

8. Laser Diffraction (Determination of grating constant and number of rulings per inch using

diffraction grating)

9. Ultrasonic Interferometer.

10. Frequency determination – Melde’s apparatus

11. Magnetic properties (B-H Graph Method...........[Demo]

12. Particle size determination – Laser diffraction method...........[Demo]

Text Books:

1. Engineering Physics Laboratory Manual for the First / Second Semester B. Tech, CUFE,

2012.

2. B.L.Worsnop and H.T.Flint, Advanced Practical Physics for Students, Methuen and Co.,

London, 9th Edition, 1957.



Reference Book:

1. Engineering Physics Laboratory Manual for the First / Second Semester, Department of Physics,

R.V. College of Engineering, 2011.

2. Sathyaseelan H, “ Laboratory Manual in Applied Physics”, New Age International, 3rd Edition,

2012.



ELECTRICAL ENGINEERING LABORATORY – EE 152/EE 252

SUBJECT DESCRIPTION:

This paper contains twelve experiments and aims at enabling the students to learn the concepts of

electric circuits, machines, wiring, basic appliances, safety issues etc pertaining to Electrical

engineering.

SUBJECT OBJECTIVES:

• To develop scientific and experimental skills of the students

• To correlate the theoretical principles with application based studies.

LIST OF EXPERIMENTS

1. Familiarization with Electrical Symbols, tools and materials.

2. Verification of Ohm’s law.

3. Verification of Kirchhoff’s Circuit laws. (KVL, KCL)

4. Two way control of lamp & Fluorescent Lamp

5. Two Way Plus Intermediate Switching Control Of Lamp And Fluorescent Lamp

6. Two Way Plus Intermediate Switching 3-Wire Control Of Lamp And Fluorescent Lamp

7. Measurement Of Single Phase Ac Power using RL Load

8. Measurement Of Power Factor Using Fluorescent Lamp

9. Error Calculations In Single Phase Energy Meter

10. O.C & S.C Tests On 1-φ Transformer.

REFERENCE BOOKS:

1. Nagasarkar T. K. & Sukhija M. S., “Basic Electrical Engineering”, OUP 2005

2. Kothari D. P. & Nagarath I. J, “Basic Electrical Technology”, TMH 2004

3. Rajendra Prasad, “Fundamentals of Electrical Engineering”, Prentice Hall of India Pvt. Ltd.,

2005

REFERENCE BOOKS

10. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley & Sons,

Inc, 2005




12. Peter V. O’Neil, “Advanced Engineering Mathematics”, Thomson Publication, Canada,

2007


14. Michael Artin, “Algebra”, 2nd Edition, Prentice Hall of India Private Limited, New Delhi,

2002

15. Kenneth Hoffman and Ray Kunze, “Linear Algebra”, 2nd Edition, Prentice Hall of India

Private Limited, New Delhi, 2002

16. George F. Simmons and Steven G. Krantz, “Differential Equation, Theory, Technique and

Practice”, Tata McGraw – Hill, 2006.

17. M. D. Raisinghania, “Ordinary and Partial Differential Equation”, Chand (S.) & Co. Ltd.,

India, March 17, 2005.


Company Ltd., 2011.



ENGINEERING CHEMISTRY – CH 132 / CH 232


PAPER DESCRIPTION:

This paper contains five units which are Chemical Energy Sources, Solar Energy, Electrochemical

Energy Systems, Conversion and Storage of Electrochemical Energy Systems, Corrosion of

Science and Control. Metal finishing and Electroless plating, Liquid Crystals and their

Applications, High polymers and Water Technology This paper aims at enabling the students to

know various energy sources. Corrosion and its control metal finishing and method of plating,

crystals and their applications, types of polymers and water technology covered in this paper.

PAPER OBJECTIVES:

1. To familiarise the students on application oriented themes like the chemistry of

materials used in engineering discipline

2. To focus the students on the chemistry of compounds resulting from pollution, waste

generation and environmental degradation and to apply the knowledge in solving

these current environmental problems effectively.


UNIT – I: CHEMICAL ENERGY SOURCES 9 Hours

Introduction to energy; Fuels - definition, classification, importance of hydrocarbons as fuels;

Calorific value-definition, Gross and Net calorific values (SI units). Determination of calorific

value of a solid / liquid fuel using Bomb calorimeter. Petroleum cracking-fluidised catalytic

cracking. Reformation of petrol. Knocking - mechanism, octane number, cetane number,

prevention of knocking, anti-knocking agents, unleaded petrol; synthetic petrol – Bergius process

and Fischer Tropsch process; power alcohol. Solar Energy : Photovoltaic cells- Introduction,

definition, importance, working of a PV cell; solar grade silicon, physical and chemical properties

of silicon relevant to photovoltaics, production of solar grade (crystalline) silicon and doping of

silicon.

UNIT – II: ELECTROCHEMICAL ENERGY SYSTEMS (ELECTROD E POTENTIAL

AND CELLS) 7 Hours



Single electrode potential-definition, origin, sign conventions. Derivation of Nernst equation.

Standard electrode potential l-definition. Construction of Galvanic cell–classification - primary,

secondary and concentration cells, EMF of a cell–definition, notation and conventions. Reference

electrodes–calomel electrode, Ag/AgCl electrode. Measurement of single electrode potential.

Numerical problems on electrode potential and EMF. Ion-selective electrode- glass electrode,

determination of pH using glass electrode

CONVERSION AND STORAGE OF ELECTROCHEMICAL ENERGY 7 Hours

BATTERY TECHNOLOGY –

Batteries-Basic concepts, battery characteristics. Classification of batteries–primary, secondary and

reserve batteries. Classical Batteries–Construction working and applications of Zn–air, Nickel-

Metal hydride and Lithium-MnO2 batteries, Fuel Cells - Introduction, types of fuel cells-Alkaline,

Phosphoric acid and Molten carbonate fuel cells. Solid polymer electrolyte and solid oxide fuel

cells. Construction and working of H2O2and Methanol-Oxygen fuel cell

UNIT – III CORROSION SCIENCE 7 Hours

Corrosion - definition, Chemical corrosion and Electro-chemical theory of corrosion, Types of

corrosion, Differential metal corrosion, Differential aeration corrosion (pitting and water line

corrosion), Stress corrosion. Factors affecting the rate of corrosion, Corrosion control: Inorganic

coatings – Anodizing and Phosphating, Metal coatings –Galvanization and Tinning, Corrosion

Inhibitors, Cathodic and Anodic protection

METAL FINISHING 7 Hours

Technological importance of metal finishing. Significance of polarization, decomposition potential

and over-voltage in electroplating processes. Electroplating – Process, Effect of plating variables on

the nature of electro deposit, surface preparation and electroplating of Cr and Au. Electroless

Plating, Distinction between electroplating and electroless plating, advantages of electroless

plating. Electroless plating of copper on PCB and Nickel

UNIT – IV LIQUID CRYSTALS AND THEIR APPLIC ATIONS: 6 Hours



Introduction, classification-Thermotropic and Lyotropic with examples. Types of mesophases-

nematic, chiral nematic (cholesteric), smectic and columnar. Homologues series (PAA and

MBBA); Applications of liquid crystals in display systems

HIGH POLYMERS: 7 Hours

Definition, Classification - Natural and synthetic with examples. Polymerization – definition, types

of polymerization – Addition and Condensation with examples. Mechanism of polymerization -

free radical mechanism (ethylene as an example), Methods of polymerization - bulk, solution,

suspension and emulsion polymerization. Glass transition temperature, structure and property

relationship. Compounding of resins. Synthesis, properties and applications of Teflon. PMMA,

Polyurethane and Phenol – formaldehyde resin. Elastomers - Deficiencies of natural rubber and

advantages of synthetic rubber. Synthesis and application of Neoprene, Butyl rubber. Adhesives-

Manufacture and applications of Epoxy resins. Conducting polymers - definition, mechanism of

conduction in polyacetylene. Structure and applications of conducting Polyaniline

UNIT – V WATER TECHNOLOGY: 7 Hours

Impurities in water, Water analysis - Determination of different constituents in water - Hardness,

Alkalinity, Chloride, Fluoride, Nitrate, Sulphate and Dissolved Oxygen. Numerical problems on

hardness and alkalinity. Biochemical Oxygen Demand and Chemical Oxygen Demand. Numerical

problems on BOD and COD. Sewage treatment. Potable water, purification of water - Flash

evaporation, Electro dialysis and Reverse Osmosis. Hazardous chemicals with ill effects

INSTRUMENTAL METHODS OF ANALYSIS:

2 HOURS

Theory, Instrumentation and Applications of Colorimetry, Potentiometry, Conductometry

TEXT BOOKS

1. Dr. B.S. Jai Prakash, “Chemistry for Engineering Students”, Subhas Stores, Bangalore,

Revised Edition 2009

2. M. M. Uppal, “Engineering Chemistry”, Khanna Publishers, Sixth Edition, 2001



3. Jain and Jain, “A text Book of Engineering Chemistry”, S. Chand & Company Ltd. New

Delhi, 2009

REFERENCE BOOKS

1. Alkins P.W. “physical chemistry” ELBS IV edition 1998, London

2. F. W. Billmeyer, “Text Book of Polymer Science”, John Wiley & Sons, 1994

3. G. W. Gray and P. A. Winsor, “Liquid crystals and plastic crystals”, Vol - I, Ellis Horwood

series in Physical Chemistry, New York. (P. No. 106-142)

4. M. G. Fontana, “Corrosion Engineering”, Tata Mc Graw Hill Publications 1994.

5. Stanley E. Manahan, “Environmental Chemistry”, Lewis Publishers, 2000

6. B. R. Puri, L. R. Sharma & M. S. Pathania, ”Principles of Physical Chemistry”, S. Nagin

Chand & Co., 33rd Ed.,1992

7. Kuriakose J.C. and Rajaram J. “ Chemistry in Engineering and Technology” Vol I & II,

Tata Mc Graw – Hill Publications Co Ltd, NewDelhi, 1996.



BASIC ELECTRONICS EC 233


PAPER DESCRIPTION:

The course aims to develop the skills of the students in the areas of electronics by learning

fundamentals. This will be necessary for their effective studies in a large number of

engineering subjects like Electronics circuits and devices, Digital Electronics,

communication systems. The course will also serve as a prerequisite for post graduate and

specialized studies and research.

PAPER OBJECTIVES:

• To impart basic knowledge about electronic and digital systems

• To give basic ideas about various communication systems


UNIT – I: Introduction to semiconductors and basic diode theory 9 + 3 Hours

Conductors, semiconductors and insulators, Intrinsic and Extrinsic semiconductors, Flow of charge

carriers in a semiconductor, Mass Action Law, energy levels and barrier potential, PN junction as a

diode, Unbiased diode, forward bias diode, reverse bias, VI characteristics of a diode, Variation of

diode parameters with temperature. Ideal diodes, diode approximations, resistance of a diode, Load

lines, comparison between Silicon and Germanium

UNIT – II: Semiconductor diode applications 9 + 3 Hours

Half-wave rectifier, ripple factor and efficiency, Full-wave and bridge rectifier, ripple factor and

efficiency, Peak inverse voltage, working of capacitor input filter, Approximate analysis of

capacitor filter, Zener diode characteristics, Zener and Avalanche breakdown, Zener diode voltage

regulator, power supply performance, Clipper and Clamper.

UNIT – III : Bipolar Junction Transistors 9 + 3 Hours



Bipolar junction transistor, transistor voltages and currents, Unbiased transistor, Biased transistor,

Transistor configurations- CB, CE, CC, DC load line Base Bias, Collector to Base Bias, Voltage

divider Bias, Comparison of basic bias circuits, Bias circuit design, Comparison of basic bias

circuits.

UNIT – IV : Introduction to Operational Amplifier s & Oscillators 9 + 3 Hours

Block diagram, Op-amp transfer characteristics, Basic Op-amp parameters and its value for IC 741-

offset voltage and current, input and output impedance, Gain, slew rate, bandwidth, CMRR,

Concept of negative feedback, Inverting and Non-inverting amplifiers, Summing Amplifier,

Subtractor, integration, differentiation, Voltage follower, Introduction to Oscillators, the

Barkhausen Criterion for Oscillations, Applications of Oscillator

UNIT – V : Digital Electronics 9 + 3 Hours

Sampling theorem, Introduction, decimal system, Binary, Octal and Hexadecimal number systems,

addition and subtraction, fractional number, Binary Coded Decimal numbers. Boolean algebra,

Logic gates, Half-adder, Full-adder, Parallel Binary adder.

TEST BOOKS:

1. "Electronic Devices and Circuit Theory", 3rd Edition, Robert L Boylestad & Louis

Nashelsky

2. Fundamentals of Electrical Engineering, 2nd Edition, L S Bobrow

3. Albert Malvino, David. J. Bates, “Electronic Principles”, 7th Edition, Tata McGraw Hill,

2007

4. Morris Mano, “Digital Logic and Computer Design”, PHI, EEE

5. "Digital Design", John F Wakerly

REFERENCE BOOKS:

1. Jacob Millman, Christos C. Halkias“Electronic Devices and Circuits”, TMH, 1991 Reprint 2001



2. David. A. Bell, “Electronic Devices and Circuits”, PHI, New Delhi, 2004

3. Albert Paul Malvino, Donald P Leach, Goutamsaha, “Digital Principles and applications”, 6th

Edition, Tata McGraw Hill, 2007.

4. Roy Choudhary and Shail Jain, “Linear Integrated Circuits”,ThirdEdition,New Age

international Publishers,2007



PROBLEM SOLVING AND PROGRAMMING CONCEPTS – CS 134/ 234


PAPER DESCRIPTION:

This paper contains five units which gives the programming concepts of C Language. This paper

aims at enabling the students to learn C programming Language in detail.

PAPER OBJECTIVES:

1. To develop skill in problem solving concepts through learning C programming.


Unit – I: Algorithms and Flowcharts 12 Hours

Algorithms, Flowcharts, Divide and conquer strategy. Examples on algorithms and flowcharts.

Constants, Variables, and Data types: Characters set, C tokens, Keywords and Identifiers,

Constants, Variables, Data types, Declaration of variables.

Operators and Expressions:

Arithmetic operators, Relational operators, Logical operators, Assignment operators, Increment and

Decrement operators, Conditional operator, Bitwise operators, Special operators, Arithmetic

expressions, Evaluation of expressions, Precedence of Arithmetic operators, Type conversions in

expressions, Operator precedence and associatively.

Unit – II: Managing Input and Output Operations 12 Hours

Reading a character, writing a character, Formatted Input, Formatted Output

Decision making and Branching:



Decision making with if statement, Simple if statement, The if…else statement, Nesting of if…else

statements, The else … if ladder, The switch statement, The ?: operator, The Goto statement

Looping:

The while statement, The do statement, The for statement, Jumps in Loops

Unit – III: Arrays 13 Hours

One-dimensional Arrays, Declaration of one-dimensional Arrays, Initialization of one-dimensional

Arrays, Two-dimensional Arrays, Initializing two-dimensional Arrays.

User-defined Functions:

Need for User-defined Functions, A multi-function Program, Elements of user - defined Functions,

Definition of Functions, Return Values and their types, Function Calls, Function Declaration,

Category of Functions, No Arguments and no Return Values, Arguments but no Return Values,

Arguments with Return Values, No Argument but Returns a Value, Functions that Return Multiple

Values.

Unit – IV: Pointers 10 Hours

Understanding the pointers, Accessing the Address of a Variable, Declaring Pointer Variables,

Initialization of Pointer Variables, Accessing a Variable through its Pointer, Pointer Expressions,

Pointer Increments and Scale Factor, Pointers and Arrays, Pointers and Character Strings, Pointers

as Function Arguments, Functions Returning Pointers.

Unit – V: Strings, Structure, Union, Files 13 Hours

Strings: String concepts, C strings, String I/O functions, Array of strings, String manipulation

function, Memory formatting, Derived types-Enumerated, Structure, and Union: The type

definition, Enumerated types, Structure, Accessing structures, Complex structures, Array of

structures, Structures and functions, Union , Files: Classification of Files, Standard Library

Functions for Files



TEXT BOOKS:

1. Deitel and Deitel, "C How to Program", Prentice Hall 2010.

2. Anil Bikas Chaudhuri, "The Art of Programming through Flowcharts and Algorithms",

Firewall Media.

REFERENCE BOOKS:

1. Introduction to Computer Science, ITL Education Solutions Ltd., Pearson Education, 2007.

2. E. Balagurusamy, “Programming in ANSI C”, Tata McGraw Hill – III Edition.

3. V. Rajaraman, “Fundamentals of Computers”, 4th Edition, PHI 2005.

4. M. G. V. Murthy, “Programming Techniques through C”, Pearson Education, 2007.

5. Yashvant Kanetkar, “Let Us C”, BPB Publications - 8th Edition, 2008.



ELEMENTS OF MECHANICAL ENGINEERING – ME 135 / ME 23 5


PAPER DESCRIPTION:

Mechanical Engineering basically deals with three basic concepts Design engineering, Thermal

engineering & Manufacturing engineering, this subject ELEMENTS OF MECHANICAL

ENGINEERING gives the basic insight of theoretically knowledge of these aspects.

PAPER OBJECTIVES:

To familiarize with

1. The Source of Energy and Power Generation.

2. The various metal processing and metal working.

3. The Basic theory of machine tools.


UNIT – I: Energy and Steam Forms 9 Hours

Sources and Classification of energy, Utilization of energy with simple block diagrams, Steam

formation. Types of steam, Steam properties – Specific Volume, Enthalpy and Internal energy. (simple

numerical problems) Steam boilers classification, Lancashire boiler, Babcock and Wilcox boiler

mountings, accessories, their locations and application. (No sketches for mountings and accessories).

UNIT-II: TURBINES 16 Hours

Steam turbines–Classification, Principle of operation of Impulse and reaction. Delaval’s turbine,

Parson’s turbine. Compounding of Impulse turbines. Gas turbines – Classification, Working

principles and Operations of Open cycle and Closed cycle gas turbines. Water turbines –

Classification, Principles and operations of Pelton wheel, Francis turbine and Kaplan turbine

INTERNAL COMBUSTION ENGINES:



Classification, I.C. Engines parts, 2/4 – Stroke Petrol and 4-stroke diesel engines. P-V diagrams of

Otto and Diesel cycles. Simple problems on indicated power, brake power, indicated thermal

efficiency, brake thermal efficiency, mechanical efficiency and specific fuel consumption.

UNIT – III: REFRIGERATION AND AIR CONDITIONING 9 Hours

Refrigerants, properties of refrigerants, list of commonly used refrigerants. Refrigeration -

Definitions - Refrigerating effect, Ton of Refrigeration, Ice making capacity, COP, Relative COP,

Unit of Refrigeration. Principle and working of vapor compression refrigeration and vapor

absorption refrigeration. Principles and applications of air conditioners, Room air conditioner

UNIT – IV: LATHE AND DRILLING 16 Hours

Machines Lathe - Principle of working of a Centre Lathe. Parts of a lathe. Operations on lathe -

Turning, Facing, Knurling, Thread Cutting, Drilling, Taper Turning by Tailstock offset method and

Compound slide swiveling method. Specification of Lathe.

Drilling Machine – Principle of working and classification of Drilling Machines. Bench Drilling

Machine, Radial Drilling Machine. Operations on Drilling Machine - Drilling, Boring, Reaming,

Tapping, Counter Sinking, Counter Boring and Spot facing. Specification of radial drilling

machine.

MILLING AND GRINDING MACHINES:

Milling Machine – Principle of Milling, Types of Milling Machines. Principle & Working of

Horizontal and Vertical Milling Machines. Milling Processes - Plane Milling, End Milling, Slot

Milling, Angular Milling, Form Milling, Straddle Milling and Gang Milling. Specification of

Universal Milling Machine.

Grinding Machine – Principle and classification of Grinding Machines. Abrasives - Definition,

types and Applications. Bonding Materials. Type of Grinding Machines, Principle and Working of

Surface Grinding, Cylindrical Grinding and Centerless Grinding.



UNIT – V: 10 Hours

JOINING PROCESSES, LUBRICATION AND BEARINGS:

Soldering, Brazing and Welding, Definitions. Classification and method of Soldering, Brazing and

Welding and Differences. Brief Description of Arc Welding and Oxy - Acetylene Welding

Lubrication and Bearings Lubricants - Classification and properties. Screw cap, Tell - Tale, Drop

feed, Wick feed and Needle Lubricators. Ring, Splash and Full pressure lubrication. Classification

of Bearings, Bushed bearing, Pedestal bearing, Pivot bearing, Collar Bearings and Antifriction

Bearings.

POWER TRANSMISSION: Belt Drives - Classification and applications, Derivations on Length

of belt. Definitions - Velocity ratio, Creep and slip, Idler pulley, stepped pulley and fast & loose

pulley. Gears - Definitions, Terminology, types and uses. Gear Drives and Gear Trains –

Definitions and classifications, Simple problems.

TEXT BOOKS:

1. K.R. Gopalkrishna, “ A text Book of Elements of Mechanical Engineering”,

Subhash Publishers, Bangalore.

2. S. Trymbaka Murthy, “ A Text Book of Elements of Mechanical Engineering”, 3rd

revised edition,I .K. International Publishing House Pvt. Ltd., New Delhi. 2010.

3. Dr. R. P. Reddy, N. Kapilan, “Elements of Mechanical Engineering”, 1st Edition,

Himalaya Publishing House, New Delhi.

REFERENCE BOOKS:

1. SKH Chowdhary, AKH Chowdhary, Nirjhar Roy, “ The Elements of Workshop

Technology”, Vol. I & II, Media Promotors and Publishers, Mumbai.

2. Ghosh Mallik, “Manufacturing Technology”, TMH. HMT, Production Technology,

TMH



HOLISTIC EDUCATION- HE 171 / HE 271


PAPER DESCRIPTION:

This paper contains three units which are Introduction to Life skills, Personal skills, Inter-personal

Skills and Societal Skills. This paper aims at enabling the students to various skills in life.

PAPER OBJECTIVE:

• Holistic development of the individual adult in every student

• Knowing life and its principles

• Broadening the outlook to life

• Training to face the challenges of life

• Confidence creation and personality development

• Emotional control and stress management

• Creating awareness on duties, rights and obligations as member of the Society

• Realizing Personal Freedom-its limits and limitations

• Developing the attitude to be a contributor and giver

• Realizing the real happiness in life


1. INTRODUCTION TO LIFE SKILLS (I Semester) 4 Hours

2. PERSONAL SKILLS

• Creative thinking and Problem solving (I Semester)

• Critical thinking and Decision making(I Semester)

• Study skills and Time management(II Semester)

• Health (II Semester)

3. INTER-PERSONAL SKILLS 4 Hours

• Non verbal Communication(I Semester)

• Empathy and active listening(I Semester)



• Assertiveness Training (II Semester)

• Conflict Management(II Semester)

4. SOCIETAL SKILLS 4 Hours

• Human Rights(I Semester)

• Civil Society and Civic sense(I Semester)

• Equality and Justice(II Semester)

• Gender Sensation(II Semester)

TEXT BOOK: Holistic Education by Christ College publication, Bangalore-560029



WORKSHOP PRACTICE – ME 151 / ME 251


PAPER DESCRIPTION:

This paper provides working knowledge of fitting welding, sheet metal and carpentary.

PAPER OBJECTIVES:

To provide the students with the hands on experience on different trades of engineering like fitting,

welding, carpentary & sheet metal.

LEVEL OF KNOWLEDGE: Working

1. Fitting

a) Study of fitting tools

b) Study of fitting operations & joints

c) Minimum 5 models involving rectangular, triangular, semi circular and dovetail joints.

2. Welding

d) Study of electric arc welding tools & equipments

e) Minimum 4 Models - electric arc welding - Butt joint, Lap joint, T joint & L joint.

3. Sheet metal

f) Study of development of surfaces

g) Minimum 03 models ( Tray,Funnel,Cone)

4. Study and demonstration of Carpentry tools, joints and operations.

TEXT BOOK:

S. K. H. Choudhury, A. K. H. Choudhury, Nirjhar Roy, “ The Elements of Workshop

Technology”, Vol 1 & 2, Media Publishers, Mumbai



COMPUTER PROGRAMMING LABORATORY- CS 152 / 252


PAPER DESCRIPTION:

Paper contains the programs which include Operations in C, Loop Control Structures, and Function

sand file handling methods. This paper aims at enabling the students to know fundamentals of

computer concepts and C programming.

PAPER OBJECTIVES:

• To impart the basic concepts of computer and information technology

• To develop skill in problem solving concepts through learning C programming in practical

approach.

LEVEL OF KNOWLEDGE: Basic/working

PART- A

1. Write a C program to find and output all the roots of a given quadratic equation, for non-

zero coefficients. (Using if…else statement)

2. Write a C program to simulate a simple calculator that performs arithmetic operations like

addition, subtraction, multiplication, and division only on integers. Error message should be

reported, if any attempt is made to divide by zero. (Using switch statement)

3. Write a C program to generate and print first ‘N’ Fibonacci numbers. (Using looping

constructs)

4. Write a C program to find the GCD and LCM of two integers and output the results along

with the given integers. Use Euclid’s algorithm. (Using looping constructs)



5. Write a C program to reverse a given four digit integer number and check whether it is a

palindrome or not. Output the given number with suitable message. (Using looping

constructs)

6. Write a C program to find whether a given number is prime or not. Output the given number

with suitable message. (Using looping constructs)

PART - B

7. Write a C program to input N real numbers in into a single dimension array. Conduct linear

search for a given key integer number and report success or failure in the form of a suitable

message.

8. Write a C program to input N integer numbers into a single dimension array. Sort them in

ascending order using bubble sort technique. Print both the given array and the sorted array

with suitable headings.

9. Write a C program to evaluate the given polynomial f(x) = a4x4 +a3x

3 + a2x2 + a1x

1 + a0 for

given value of x and the coefficients using Horner’s method. (Using single dimension arrays

to store coefficients)

10. Write a C program to input N real numbers in ascending order into a single dimension array.

Conduct a binary search for a given key integer number and report success or failure in the

form of a suitable message.

11. Write a C program to input N integer numbers into a single dimension array. Sort them in

ascending order using bubble sort technique. Print both the given array and the sorted array


12. Write C user defined functions

i. To input N real numbers into a single dimension array.

ii. Compute their mean.

iii. Compute their variance

iv. Compute their standard deviation.

Using these functions, write a C program to input N real numbers into a single dimension

array, and compute their mean, variance & standard deviation. Output the computed results


13. Write C user defined functions



i. To read the elements of a given matrix of size M x N.

ii. To print the elements of a given matrix of size M x N.

iii. To compute the product of two matrices.

Using these functions, write a C program to read two matrices A(M x N) and B(P x Q) and

compute the product of A and B after checking compatibility for multiplication. Output the

input matrices and the resultant matrix with suitable headings and format (Using two

dimension arrays)

14. Write a C program to read a matrix A(M x N) and to find the following using user defined

functions:

i. Sum of the elements of the specified row.

ii. Sum of the elements of the specified column.

iii. Sum of all the elements of the matrix.

Output the computed results with suitable headings.

15. Write a C Program to create a sequential file with at least 5records, each record having

USN, name, mark1, mark2, and mark3. Write necessary functions

i. To display all the records in the file.

ii. To search for a specific record based on the USN. In case the record is not found,

suitable message should be displayed. Both the options in this case must be

demonstrated.



ENGINEERING CHEMISTRY LABORATORY- CH 153 / CH 253


Paper Description:

This paper contains eleven experiments and aims at enabling the students to Practical Engineering

Chemistry.

Paper objectives:

1. To equip the students with the working knowledge of chemical principles, nature and

transformation of materials and their applications.

2. To develop analytical capabilities of students so that they can understand the role of

chemistry in the field of Engineering and Environmental Sciences

Level of knowledge: Basic/working

(For Examination, one experiment from Part-A and Part-B shall be set. Different

experiments may be set from Part-A and common experiment from Part-B).

PART-A

1. Determination of viscosity coefficient of a given liquid using Ostwald’s viscometer.

2. Estimation of copper by colorimetric method using spectrophotometer.

3. Conductometric estimation of strength of an acid using standard NaOH solution

4. Determination of pKa value of a weak acid using pH meter.

5. Potentiometric estimation of FAS using standard K2Cr2O7 solution.

PART-B

1. Determination of Total Hardness of a sample of water using disodium salt of EDTA.

2. Determination of Calcium Oxide (CaO) in the given sample of cement by Rapid EDTA method.

3. Determination of percentage of Copper in brass using standard sodium thiosulphate solution.

4. Determination of Iron in the given sample of Haematite ore solution using potassium dichromate

crystals by external indication method.

5. Determination of Chemical Oxygen Demand (COD) of the given industrial waste Water sample.

(for demonstration)



6. Determination of Dissolved Oxygen in the given water sample by Winkler method. (for

demonstration)

Examination – First experiment is a common experiment from Part B. Second experiment is

different, from Part A or Part B.

Reference books:

1. J. Bassett, R.C. Denny, G.H. Jeffery, “ Vogels text book of quantitative inorganic analysis”, 4th

Edition

2. Sunita and Ratan “Practical Engineering Chemistry”



MATHEMATICS – II MA 231

Paper Description:

This paper contains five units which are Analytical Geometry in three dimensions, Differential

Calculus, Multiple integrals, Differential Equation of higher order and Laplace transformation and

its Inverse with Vector integration. This paper aims at enabling the students to study the application

of integration to various fields along with the different techniques to solve higher order linear

differential equation.

Paper objectives:

Mathematics is a necessary avenue to scientific knowledge which opens new vistas of mental

activity. A sound knowledge of engineering mathematics is a ‘sine qua non’ for the modern

engineer to attain new heights in all aspects of engineering practice. This course provides the

student with plentiful opportunities to work with and apply the concepts, and to build skills and

experience in mathematical reasoning and engineering problem solving.

UNIT –I: Analytical Geometry in three dimensions 10 Hours

Direction cosines and direction ratios. Planes, Straight lines, Angle between planes / straight lines,

Coplanar lines. Shortest distance between two skew lines

UNIT – II: Differential Calculus – II 10 Hours

Polar curves and angle between Polar curves. Pedal equations of polar curves, Radius of curvature

– Cartesian, parametric, polar and pedal forms.

UNIT –III: Integral Calculus – II 12 Hours

Double integrals, Cartesian and polar co – ordinates, change of order of integration, change of

variables between cartesian and polar co – ordinates, triple integration, area as a double integral,

volume as a triple integral



UNIT –IV: Differential Equations - II and Vector Calculus – II 14 Hours

Linear differential equations of second and higher order with constant coefficients. Method of

undetermined coefficients. Method of variation of parameters.

Vector Integration - Green’s theorem in a plane, Gauss’s divergence theorems, Stoke’s, (without

proof) and simple application.

UNIT -V: Laplace Transforms 14 Hours

Definition - Transforms of elementary functions. Derivatives and integrals of transforms- Problems.

Periodic function. Unit step function and unit impulse function Inverse transforms – Properties.

Solutions of linear differential equations

TEXT BOOK

1. Dr. B. S. Grewal, “Higher Engineering Mathematics”, 39th Edition, Khanna

Publishers, July 2005.

2. K. A. Stroud, “Engineering Mathematics”, 6th Edition, Palgrave Macmillan, 2007.

REFERENCE BOOKS

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley &

Sons, Inc, 2005


3. Peter V. O’Neil, “Advanced Engineering Mathematics”, Thomson Publication,

Canada, 2007


5. George F. Simmons and Steven G. Krantz, “Differential Equation, Theory,

Technique and Practice”, Tata McGraw – Hill, 2006.

6. M. D. Raisinghania, “Ordinary and Partial Differential Equation”, Chand (S.) &

Co. Ltd., India, March 17, 2005.


Company Ltd., 2011.



CS 331 MATHEMATICS - III

Paper Description:

The course aims to develop the skills of the students in the areas of boundary value problems and

transform techniques. This will be necessary for their effective studies in a large number of

engineering subjects like transformation between different coordinate systems, heat conduction,

communication systems, electro-optics and electromagnetic theory. The course will also serve as a

prerequisite for post graduate and specialized studies and research.

Paper objective:


•Be helpful in understanding the subject Electromagnetic field in a better way.

•Be capable of mathematically formulating certain practical problems in terms of partial

differential equations, solve them and physically interpret the results.

•Have gained a well founded knowledge of Fourier series, their different possible forms and

the frequently needed practical harmonic analysis that an engineer may have to make from

discrete data.

•Have obtained capacity to formulate and identify certain boundary value problems

encountered in engineering practices, decide on applicability of the Fourier series method of

solution, solve them and interpret the results.

•Have grasped the concept of expression of a function, under certain conditions, as a double

integral leading to identification of transform pair, and specialization on Fourier transform

pair, their properties, the possible special cases with attention to their applications.

•Have learnt the basics of Z – transform in its applicability to discretely varying functions,

gained the skill to formulate certain problems in terms of difference equations and solve

them using the Z – transform technique bringing out the elegance of the procedure involved.

UNIT – I: Coordinate Systems 10 Hours

Curvilinear Coordinate System, Gradient, divergent, curl and Laplacian in cylindrical and

Spherical Coordinate system, Cylindrical Coordinates, Spherical Coordinates, Transformation

between systems.



UNIT – II: Partial Differential Equation 12 Hours

Formation of partial differential equations by elimination of arbitrary constants and arbitrary

functions – Solution of standard types of first order partial differential equations – Lagrange’s

linear equation – Linear partial differential equations of second and higher order with constant

coefficients.

UNIT – III: Fourier Series & Fourier Transform 14 Hours

Fourier series – Odd and even functions – Half range Fourier sine and cosine series – Complex

form of Fourier series – Harmonic Analysis. Discrete Fourier Sine and Cosine transform

Complex Fourier transform – Sine and Cosine transforms – Properties – Transforms of simple

functions – Convolution theorem – Parseval’s identity. Solution of equations using Fourier

transform, Limitation of Fourier series and Fourier transform and need for Wavelet.

UNIT – IV: Boundary Value Problems 12 Hours

Classification of second order quasi linear partial differential equations – Solutions of one

dimensional wave equation – One dimensional heat equation – Two dimensional Laplace equation

– Steady state solution of two-dimensional heat equation (Insulated edges excluded) – Fourier

series solutions in Cartesian coordinates.

UNIT – V: Z – Transform and Difference Equations 12 Hours

Z-transform - Elementary properties – Inverse Z – transform – Convolution theorem -Formation of

difference equations – Solution of difference equations using Z - transform.

TEXT BOOKS

1 Grewal, B.S., “Higher Engineering Mathematics”, Thirty Sixth Edition , Khanna Publishers,

Delhi, 2005.

2. Kandasamy, P., Thilagavathy, K., and Gunavathy, K., “Engineering Mathematics Volume

III”, S. Chand & Company ltd., New Delhi, 2003.



REFERENCES

1. Erwin Kreyszig, “Advanced Engineering Mathematics”, 8th Edition, John Wiley &

Sons,Inc. 2005.

2. Narayanan, S., Manicavachagom Pillay, T.K. and Ramaniah, G., “Advanced Mathematics

for Engineering Students”, Volumes II and III, S. Viswanathan (Printers and Publishers)

Pvt. Ltd. Chennai, 2002.

3. Ramana B.V “ Higher Engineering Mathematics”, Tata McGraw – Hill Publishing

Company.New Delhi, 2009.

4. Churchill, R.V. and Brown, J.W., “Fourier Series and Boundary Value Problems”, Fourth

Edition, McGraw-Hill Book Co., Singapore, 1987.

5. T.Veera Rajan, “Engineering Mathematics [For Semester III]. Third Edition. Tata

McGraw-Hill Publishing Company. New Delhi, 2007.

6. S. L. Loney, “Plane Trigonometry”, Cambridge: University Press.



DATA STRUCTURES - CS332

AIM:

To provide an in-depth knowledge in problem solving techniques and data structures.

OBJECTIVES:

• To learn the systematic way of solving problems

• To understand the different methods of organizing large amounts of data

• To learn to program in C

• To efficiently implement the different data structures

• To efficiently implement solutions for specific problems

UNIT I: PROBLEM SOLVING 9 + 3

Problem solving – Top-down Design – Implementation – Verification – Efficiency – Analysis –

Sample algorithms.

UNIT II: LISTS, STACKS AND QUEUES 8 + 3

Abstract Data Type (ADT) – The List ADT – The Stack ADT – The Queue ADT

UNIT III: TREES 10 + 3

Preliminaries – Binary Trees – The Search Tree ADT – Binary Search Trees – AVL Trees – Tree

Traversals – Hashing – General Idea – Hash Function – Separate Chaining – Open Addressing –

Linear Probing – Priority Queues (Heaps) – Model – Simple implementations – Binary Heap

UNIT IV: SORTING 9 + 3

Preliminaries – Insertion Sort – Shellsort – Heapsort – Mergesort – Quicksort – External Sorting



UNIT V: GRAPHS 9 + 3

Definitions – Topological Sort – Shortest-Path Algorithms – Unweighted Shortest Paths –

Dijkstra’s Algorithm – Minimum Spanning Tree – Prim’s Algorithm – Applications of Depth-First

Search – Undirected Graphs – Biconnectivity – Introduction to NP-Completeness

L= 45; T=15; TOTAL= 60

TEXT BOOKS

1. R. G. Dromey, “How to Solve it by Computer” (Chaps 1-2), Pearson Education 2006.

2. M. A. Weiss, “Data Structures and Algorithm Analysis in C”, 2nd ed, Pearson Education

Asia, 2002. (chaps 3, 4.1-4.4 (except 4.3.6), 4.6, 5.1-5.4.1, 6.1-6.3.3, 7.1-7.7 (except 7.2.2,

7.4.1, 7.5.1, 7.6.1, 7.7.5, 7.7.6), 7.11, 9.1-9.3.2, 9.5-9.5.1, 9.6-9.6.2, 9.7)

REFERENCES

1. Y. Langsam, M. J. Augenstein and A. M. Tenenbaum, “Data Structures using C”,

Pearson Education Asia, 2004

2. Richard F. Gilberg, Behrouz A. Forouzan, “Data Structures – A Pseudocode Approach

with C”, Thomson Brooks / COLE, 1998. Aho, J. E. Hopcroft and J. D. Ullman, “Data

Structures and Algorithms”, Cengage Learning 2007.



ELECTRONIC CIRCUITS AND DIGITAL SYSTEMS - CS333

UNIT –I: BASIC SEMICONDUCTOR DEVICES AND APPLICAT IONS 9 + 3

Semiconductor Basics- Junction diode Characteristics and applications – Zener diode

characteristics and applications – BJT characteristics in CE,CB & CC configurations – MOSFET

characteristics and types – SCR , DIAC , TRIAC characteristics.

UNIT – II: AMPLIFIERS AND OSCILLATORS 9 + 3

Transistor Amplifiers – CE,CB,CC characteristics – RC Coupled transformer coupled – tuned

amplifiers – Power Amplifiers – Small Signal and large signal amplifiers – Oscillators – criteria for

oscillations – RC oscillators- LC oscillators, Multivibrators – Astable, Monostable and Bistable.

UNIT III: INTEGRATED CIRCUITS 9 + 3

Fabrication of monostable IC process – Operational amplifier – Characteristics, specifications,

Applications – Wein Bridge Oscillator, Active low pass & band pass filter, Schmitt trigger –

Astable multivibrator – Monolithic timer IC 555 – Application of astable & Monostable

multivibrator

UNIT IV: COMBINATIONAL AND SEQUENTIAL LOGIC 9 + 3

Combinational circuits – Analysis and design procedures - Circuits for arithmetic operations - Code

conversion –Decoders and encoders - Multiplexers and demultiplexers - Memory and

programmable logic - Introduction to Hardware Description Language (HDL).

UNIT V: SYNCHRONOUS AND ASYNCHRONOUS SEQUENTIAL LO GIC 9 + 3

Analysis and design of synchronous and asynchronous sequential circuits - Race-free state

assignment – Hazards

L= 45; T=15; TOTAL= 60



TEXT BOOKS:

1. Sedra. A.S., Smith. K.C ., Microelectronic Circuits, Oxford University Press, 2004

2. M.Morris Mano, “Digital Design”, 3rd edition, Pearson Education, 2002

REFERENCES:

1. Robert L. Boylestad, Louis Nashelsky – Electronic Devices and Circuit Theory, Prentice Hall

of India Pvt. Ltd., Sixth Edition-2000.

2. Jaeger.R.C and Blalock.T.N., Microelectronic Circuit Design, Tata McGraw Hill, 2006.

3. Donald D.Givone, “Digital Principles and Design”, Tata McGraw-Hill, 2003.



OBJECT ORIENTED PROGRAMMING - CS334

AIM:

To present the concept of object oriented programming and discuss the important elements of C++.

OBJECTIVES:

Since C++ play a predominant role in software development it is felt that the following objectives

can be achieved after studying this subject.

• Understand the concepts of Object oriented Programming.

• Write simple applications using C++.

UNIT I: INTRODUCTION 8 + 3

Object-oriented paradigm, elements of object oriented programming – Merits and demerits of OO

methodology – C++ fundamentals – data types, operators and expressions, control flow, arrays,

strings, pointers and functions.

UNIT II: PROGRAMMING IN C++ 10 + 3

Classes and objects – constructors and destructors, operator overloading – inheritance, Friend

functions and Friend classes.

UNIT III: VIRTUAL FUNCTIONS 9 + 3

Memory management: New and Delete, pointers to objects,Virtual Function, friend function, Static

function, Assignment and copy initialization, this pointer, dynamic type information

UNIT IV: FILE HANDLING 9 + 3

C++ streams – console streams – console stream classes-formatted and unformatted console I/O

operations, manipulators - File streams - classes file modes file pointers and manipulations file I/O



UNIT V: TEMPLATES AND EXCEPTIONS 9 + 3

Function templates, Class templates ,Exceptions. The Standard Template Library, Introduction

algorithms, sequence containers, iteators, specialized iteators, associative containers, strong user-

defined object, function objects.

L=45; T=15; TOTAL= 60

TEXT BOOKS:

1. H. M. Deitel - Deitel & Associates, Inc., P. J. Deitel - Deitel & Associates, Inc., “C++ How

to program”, Publisher: Prentice Hall, 2005

2. K.R.Venugopal, Rajkumar Buyya, T.Ravishankar, "Mastering C++", TMH, 2003 (Unit I,

Unit II, Unit III)

3. Object Oriented Programming in C++ by Robert Lafore 4th Edition Pearson Education

2008.

REFERENCES:

1. Ira Pohl, “Object oriented programming using C++”, TMG 2012.

2. Bjarne Stroustrup, “The C++ programming language”, Pearson Education 2002

3. John R.Hubbard, “Progranning with C++”, Schaums outline series, TMH, 2003

4. E.Balagurusamy “ Object Oriented Programming with C++”, TMH 2/e 2011.



COMPUTER ARCHITECTURE – CS335

AIM:

To discuss the basic structure of a digital computer and to study in detail the organization of the

Control unit, the Arithmetic and Logical unit, the Memory unit and the I/O unit.

OBJECTIVES:

• To have a thorough understanding of the basic structure and operation of a digital computer.

• To discuss in detail the operation of the arithmetic unit including the algorithms &

implementation of fixed-point and floating-point addition, subtraction, multiplication &

division.

• To study in detail the different types of control and the concept of pipelining.

• To study the hierarchical memory system including cache memories and virtual memory.

• To study the different ways of communicating with I/O devices and standard I/O interfaces.

UNIT I. Introduction 9+4

Basic Model of a Computer – Computer Components.

Register transfer and Microoperations

Register Transfer Language – Register Transfer – Bus and Memory Transfers – Arithmetic

Microoperations – Logic Microoperations – Shift Microoperations – Arithmetic Logic and Shift

Unit.

Basic Computer Organization and Design

Instruction Codes – Computer Registers – Computer Instructions – Timing and Control –

Instruction Cycle – Memory – Reference Instructions – Input-Output and Interrupt.

UNIT II. Microprogrammed Control 9+3

Control Memory – Address Sequencing – Microprogram Example – Design of Control Unit.

Central Processing Unit

Introduction – Stack Organization – Instruction Formats – Addressing modes – Data transfer and

manipulation – Program Control.



UNIT III. Computer Arithmetic 9+3

Introduction – Addition and Subtraction – Multiplication Algorithms – Division Algorithms

– Floating-point Arithmetic operations – Decimal Arithmetic unit – Decimal Arithmetic

Operations.

UNIT IV. Input-Output Organization 9+3

Peripheral devices – Input-Output Interface - Asynchronous data transfer – Modes of

transfer – Priority Interrupt – Direct Memory Access – Input-Output Processor – Serial

Communication.

UNIT V. Memory Organization 9+3

Memory hierarchy – Main memory – Auxiliary memory – Associative memory – Cache

memory – Virtual memory – Memory management hardware.

For Internal Assessment Only:

Complete Computer Organization – Design of Basic Computer – Design of Accumulator

Logic.

TEXT BOOK:

1. Mano M Morris, Computer System Architecture, Pearson Education 2007.

REFERENCE BOOKS:

1. Stalling Williams. Computer Organization and Architecture, Prentice Hall, 4th

Edition, 2004

2. John P.Hayes, Computer Architecture & Organization, McGraw Hill International

Editions, 3rd Edition, 2003



OBJECT ORIENTED PROGRAMMING LABORATORY - CS351

C++:

1.Programs Using Functions

2.Functions with default arguments

3.Implementation of Call by Value, Call by Address and Call by Reference

4.Simple Classes for understanding objects, member functions and Constructors

a. Classes with primitive data members

b. Classes with arrays as data members

c. Classes with pointers as data members – String Class

d. Classes with constant data members

e. Classes with static member functions

5.Compile time Polymorphism

a. Operator Overloading including Unary and Binary Operators.

6.Function Overloading

7.Friend Functions and Friend Classes

8.Inheritance and Virtual Base Classes

9.Virtual functions

10.Templates : Classes and Funtions

11.File Handling- Sequential access

12.File Handling - Random access



ELECTRONIC CIRCUITS AND DIGITAL SYSTEMS LABORATORY - CS352

1. PN Diode Characteristics, HW & FW Rectifiers

2. Zener Diode Characteristics & Regulators

3. Transistor Characteristics CE,CB &CC

4. frequency response of CE,CB &CC amplifier in self bias & fixed bias

5. Op-amp application

6. RC & LC oscillations

7. Application of 555

8. Design and implementation of binary adder / subtractor using basic gates

9. Design and implementation of applications using multiplexers

10. Design and implementation of Synchronous & Asynchronous Counters

11. Design and implementation of Shift Registers

12. Coding Combinational Circuits using Hardware Description Language (HDL)



DATA STRUCTURES LABORATORY - CS353

AIM:

To teach the principles of good programming practice and to give a practical training in writing

efficient programs in C

OBJECTIVES:

• To teach the students to write programs in C

• To implement the various data structures as Abstract Data Types

• To write programs to solve problems using the ADTs

Implement the following exercises using C:

1. Array implementation of List Abstract Data Type (ADT)

2. Linked list implementation of List ADT

3. Cursor implementation of List ADT

4. Array implementations of Stack ADT

5. Linked list implementations of Stack ADT

The following three exercises are to be done by implementing the following source files

a. Program for ‘Balanced Paranthesis’

b. Array implementation of Stack ADT

c. Linked list implementation of Stack ADT

d. Program for ‘Evaluating Postfix Expressions’

An appropriate header file for the Stack ADT should be #included in (a) and (d)

6. Implement the application for checking ‘Balanced Paranthesis’ using array implementation

of Stack ADT (by implementing files (a) and (b) given above)

7. Implement the application for checking ‘Balanced Paranthesis’ using linked list

implementation of Stack ADT (by using file (a) from experiment 6 and implementing file

(c))



8. Implement the application for ‘Evaluating Postfix Expressions’ using array and linked list

implementations of Stack ADT (by implementing file (d) and using file (b), and then by

using files (d) and (c))

9. Queue ADT

10. Search Tree ADT - Binary Search Tree

11. Heap Sort

12. Quick Sort



PROBABILITY AND QUEUING THEORY Paper Description: The probabilistic models are employed in countless applications in all areas of science and

engineering. Queuing theory provides models for a number of situations that arise in real life. The

course aims at providing necessary mathematical support and confidence to tackle real life

problems.

Paper objective: At the end of the course, the students would

• Have a fundamental knowledge of the basic probability concepts.

• Have a well – founded knowledge of standard distributions which can describe real life

phenomena.

• Acquire skills in handling situations involving more than one random variable and functions of

random variables.

• Understand and characterize phenomena which evolve with respect to time in a probabilistic

manner.

• Be exposed to basic characteristic features of a queuing system and acquire skills in analyzing

queuing models.

UNIT – I: Probability and Random Variable 12 Hours

Axioms of probability - Conditional probability - Total probability – Baye’s theorem

Random variable - Probability mass function - Probability density function - Properties –

Moments - Moment generating functions and their properties.

UNIT – II: Standard Distributions 12 Hours

Binomial, Poisson, Geometric, Negative Binomial, Uniform, Exponential, Gamma,

Weibull and Normal distributions and their properties - Functions of a random variable.

UNIT – III: Two Dimensional Random Variables 12 Hours

Joint distributions - Marginal and conditional distributions – Covariance – Correlation

and regression - Transformation of random variables - Central limit theorem.



UNIT – IV: Random Processes and Markov Chains 12 Hours

Classification - Stationary process - Markov process - Poisson process - Birth and death process -

Markov chains - Transition probabilities - Limiting distributions. Transition Diagram.

UNIT – V: Queuing Theory 12 Hours

Markovian models – M/M/1, M/M/C , finite and infinite capacity - M/M/∞ queues - Finite source

model - M/G/1 queue (steady state solutions only) – Pollaczek – Khintchine formula – Special

cases. Single and Multiple Server System.

TEXT BOOKS

1. Ross, S., “A first course in probability”, Sixth Edition, Pearson Education, Delhi, 2002. 2. Medhi J., “Stochastic Processes”, New Age Publishers, New Delhi, 1994. (Chapters 2, 3, & 4)

3. T.Veerarajan, “Probability, Statistics and Random process”, Second Edition, Tata McGraw

Hill, New Delhi, 2003

REFERENCE BOOKS

1. Allen., A.O., “Probability, Statistics and Queuing Theory”, Academic press, New

Delhi, 1981.

2. Taha, H. A., “Operations Research-An Introduction”, Seventh Edition, Pearson Education

Edition Asia, Delhi, 2002.

3. Gross, D. and Harris, C.M., “Fundamentals of Queuing theory”, John Wiley and

Sons, Second Edition, New York, 1985.



DESIGN AND ANALYSIS OF ALGORITHM - CS432

AIM:

To create analytical skills, to enable the students to design algorithms for various applications, and

to analyze the algorithms.

OBJECTIVES:

• To introduce basic concepts of algorithms

• To introduce mathematical aspects and analysis of algorithms

• To introduce sorting and searching algorithms

• To introduce various algorithmic techniques

• To introduce algorithm design methods

UNIT I: BASIC CONCEPTS OF ALGORITHMS 8 + 3

Introduction – Notion of Algorithm – Fundamentals of Algorithmic Solving – Important Problem

types – Fundamentals of the Analysis Framework – Asymptotic Notations and Basic Efficiency

Classes.

UNIT II: MATHEMATICAL ASPECTS AND ANALYSIS OF ALGOR ITHMS 8 + 3

Mathematical Analysis of Non-recursive Algorithm – Mathematical Analysis of Recursive

Algorithm – Example: Fibonacci Numbers – Empirical Analysis of Algorithms – Algorithm

Visualization.

UNIT III: ANALYSIS OF SORTING AND SEARCHING ALGOR ITHMS 10+ 3

Brute Force – Selection Sort and Bubble Sort – Sequential Search and Brute-force string matching

– Divide and conquer – Merge sort – Quick Sort – Binary Search – Binary tree- Traversal and

Related Properties – Decrease and Conquer – Insertion Sort – Depth first Search and Breadth First

Search.



UNIT IV: ALGORITHMIC TECHNIQUES 10+ 3

Transform and conquer – Presorting – Balanced Search trees – AVL Trees – Heaps and Heap sort –

Dynamic Programming – Warshall’s and Floyd’s Algorithm – Optimal Binary Search trees –

Greedy Techniques – Prim’s Algorithm – Kruskal’s Algorithm – Dijkstra’s Algorithm – Huffman

trees.

UNIT V: ALGORITHM DESIGN METHODS 9 + 3

Backtracking – n-Queen’s Problem – Hamiltonian Circuit problem – Subset-Sum problem –

Branch and bound – Assignment problem – Knapsack problem – Traveling salesman problem.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Anany Levitin, “Introduction to the Design and Analysis of Algorithm”, Pearson Education

Asia, 2008.

REFERENCES

1. T.H. Cormen, C.E. Leiserson, R.L. Rivest and C. Stein, “Introduction to Algorithms”, PHI

Pvt. Ltd., 2010

2. Sara Baase and Allen Van Gelder, “Computer Algorithms - Introduction to Design and

Analysis”, Pearson Education Asia, 2003.

3. A.V.Aho, J.E. Hopcroft and J.D.Ullman, “The Design and Analysis Of Computer

Algorithms”, Pearson Education Asia, 2003.



ANALOG AND DIGITAL COMMUNICATION - CS433

AIM:

To study about the various modulation techniques like amplitude and angle modulation, that is used

for data transmission and reception of analog signals and also to understand about the modulation

techniques used for digital transmission along with spread spectrum and multiple access techniques.

OBJECTIVES:

• To study about the amplitude modulation techniques.

• To study bout the angle modulation techniques.

• To understand about the modulation techniques used for digital data transmission.

• To have the knowledge about the digital communication.

• To study about the spread spectrum and multiple access techniques.

UNIT I: AMPLITUDE MODULATION: TRANSMISSION AND REC EPTION 9 + 3

Principles of amplitude modulation - AM envelope, frequency spectrum and bandwidth,

modulation index and percent modulation, AM power distribution, AM modulator circuits – low

level AM modulator, medium power AM modulator, AM transmitters – Low level transmitters,

high level transmitters, receiver parameters, AM reception – AM receivers – TRF, super

heterodyne receiver, double conversion AM receivers.

UNIT II: ANGLE MODULATION: TRANSMISSION AND RECEPT ION 9 + 3

Angle modulation - FM and PM waveforms, phase deviation and modulation index, frequency

deviation, phase and frequency modulators and demodulators, frequency spectrum of Angle –

modulated waves. Bandwidth requirements for Angle-modulated waves, commercial Broadcast

band FM, Average power of an angle-modulated wave, frequency and phase modulators, A direct

FM transmitters, Indirect transmitters, Angle modulation Vs amplitude modulation, FM receivers:

FM demodulators, PLL FM demodulators, FM noise suppression, frequency verses phase

modulation.



UNIT III DIGITAL TRANSMISSION AND DATA COMMUNIC ATION 9 + 3

Introduction, pulse modulation, PCM – PCM sampling, sampling rate, signal to quantization noise

rate, companding – analog and digital – percentage error, delta modulation, adaptive delta

modulation, differential pulse code modulation, pulse transmission – ISI, eyepattern, Data

communication history, standards, data communication circuits, data communication codes, Error

control, Hardware, serial and parallel interfaces, data modems, - Asynchronous modem,

Synchronous modem, low-speed modem, medium and high speed modem, modem control.

UNIT IV: DIGITAL COMMUNICATION 9 + 3

Introduction, Shannon limit for information capacity, digital amplitude modulation, frequency shift

keying, FSK bit rate and baud, FSK transmitter, BW consideration of FSK, FSK receiver, phase

shift keying – binary phase shift keying – QPSK, Quadrature Amplitude modulation, bandwidth

efficiency, carrier recovery – squaring loop, Costas loop, DPSK.

UNIT V: SPREAD SPECTRUM AND MULTIPLE ACCESS TECH NIQUES 9 + 3

Introduction, Pseudo-noise sequence, DS spread spectrum with coherent binary PSK, processing

gain, FH spread spectrum, multiple access techniques – wireless communication, TDMA and

FDMA, wireless communication systems, source coding of speech for wireless communications.

L= 45 ; T=15; TOTAL= 60

TEXT BOOKS

1. Wayne Tomasi, “Electronic Communication Systems: Fundamentals Through Advanced”,

Pearson Education, 2001. (UNIT I-IV Chapters- 3,4,6,7,12,13,15).

2. Simon Haykin, “Communication Systems”, 4th Edition, John Wiley & Sons., 2001. (Unit V

Chapters- 7,8).



REFERENCES

1. Blake, “Electronic Communication Systems”, Thomson Delmar Publications, 2002.

2. Martin S.Roden, “Analog and Digital Communication System”, 3rd Edition, PHI, 2002.

3. Sanjay Sharma, “Analog and digital communication systems”, Katson Publications, 2007.



PROFESSIONAL DEVELOPMENT - CS434

AIM:

The subject makes an attempt to incorporate all basic concepts and practices of management,

human resources management and economics that provides the foundation and legal framework to

guide the formative knowledge of Management Concepts and also the Concepts of Economic

Systems, Economic behavior of individuals and organizations.

OBJECTIVES:


• Be capable of relating the principles of management and economics with the environment of

management & economics, personal experiences and cases which will be attempted in the

class.

PRINCIPLES OF MANAGEMENT, HUMAN RESOURCES MANAGEMEN T &

PRINCIPLES OF ECONOMICS

PART A – PRINCIPLES OF MANAGEMENT

MODULE 1 (8 Hours)

Management: Introduction: Definition of management, nature, purpose and functions, level and

types of managers, Manager/Non-Manager, Managerial Roles, Essential Managerial Skills, Key

personal characteristics for Managerial success. Evolution and various schools to management

thoughts, continuing management themes – quality and performance excellence, global awareness,

learning organization, Characteristics of 21st century Executives. Social responsibility of managers.

MODULE 2 (8 Hours)

Planning: Meaning and nature of planning, types of plans, steps in planning process; Objectives:

meaning, setting and managing objectives – MBO method: concept and process of managing by

objectives; Strategies: definition, levels of strategies, its importance in an Organization;



Policies: meaning, formulation of policies; Programs: meaning, nature; Planning premises: concept,

developing effective planning premises; Decision making, steps in decision making, approaches to

decision making, types of decisions and various techniques used for decision making.

MODULE 3 (8 Hours)

Organizing: Organizing as managerial function – organization structure, formal and informal

organization.

Traditional Organization Structures – Functional, Divisional and Matrix Structure

Directions in organizational Structures – Team structure, network structure, boundary less structure

Organizing Trends and Practices – Chain of command, unity of command, span of control,

delegation and empowerment, decentralization and use of staff, organizational design and

organizational configuration.

MODULE 4 (7 Hours)

Leading as a function of management, Leadership and vision, Leadership traits, classic Leadership

styles, Leaders behaviour – Likert’s four systems, Managerial Grid. Overlapping role of leader and

managers. The organizational context of communication, Directions of communications, channels

of communication, Barriers to communication. Motivation and rewards, Rewards and

performance. Hierarchy of need theory and two factory theory. Integrated model of motivation.

MODULE 5 (7 Hours)

Controlling: Control function in management, The basic control process. Types of control – feed

forward, concurrent and feedback controls. Factors in control effectiveness.

RECOMMENDED BOOKS:

1. Management– J.R. Schermerhorn Jr. Wiley India, New Delhi 2004.

2. Management-Concepts and Cases-V.S.P.Rao, Excel Books

3. Management - A Global and Entrepreneurial Perspective - Harold Koontz, Heinz Weihrich

- TMH 12th edition, 2008.

4. Management – Stephen P. Robbins, M. Caulter, Pearson, PHI, 9e, 2008.

5. Management - Ricky W. Griffin Eigth Edition, 2005, Biztantra

6. Fundamentals of Management-Stephen P Robbins et all, Pearson Publications, Fifth edition

7. Management-Richard L. Daft, Cegage learning



PART B – PRINCIPLES OF HUMAN RESOURCES MANAGEMENT

MODULE 7 (6 Hours)

HRM - Introduction, meaning, definition, nature and scope of HRM and HRD, evolution of HRM,

Difference between Personnel Management and HRM, features of HRM, HRM functions,

objectives of HRM, policies, procedures and programmes, practices, Organization of HRM, line

and staff responsibility role of personnel manager and HR manager, qualities of HR, HR Manager

as a Strategic partner, factors influencing HRM, Opportunities and Challenges in Human

Resource Management.

RECOMMENDED BOOKS:

1. Human Resource Management, Text & Cases – VSP Rao, Excel Books, 2005

2. Human Resource Management – Text & Cases – K. Ashwatappa; 5th Edition, TMH.

PART C – PRINCIPLES OF ECONOMICS

MODULE 8 (10 Hours)

Introduction to economics. Basics of demand, supply and equilibrium, demand theory and analysis,

theory of consumer choice, business and economic forecasting, production theory and analysis, cost

theory and analysis, market structures – perfect competition, monopoly, monopolistic competition,

oligopoly and barriers to entry.

MODULE 9 (6 Hours)

Fundamental Principles of Economics – Opportunity Costs, Incremental Principle, Time

Perspective, Discounting and Equi-Marginal principles.

RECOMMENDED BOOKS:

1. Economics by Samuelson Nordhavs 18th Edition, Mc-Graw Hill Education

2. Managerial Economics by Christopher R Thomas, S Charless Maurice – Special Indian, 8th

Ed., Mc-Graw Hill Education.



3. Managerial Economics by D N Dwivedi – 6th Ed., Vikas Publication, 2005

4. Micro Economics by Dominick Salvotore, Oxford Publishers, 4/e, 2004

5. Managerial Economics, Atmanand, Excel Books

6. Managerial Economics by Craig H Petersen, W. Chris Lewis & Sudhir K Jain – Pearson

Education, 4th Ed. PHI.

7. Managerial Economics – Theory and Applications by Dr. D. M Mithani : Himalaya

Publication, 2/e, 2005



OPERATING SYSTEMS - CS435

AIM:

To have a thorough knowledge of processes, scheduling concepts, memory management, I/O and

file systems in an operating system.

OBJECTIVES:

• To have an overview of different types of operating systems

• To know the components of an operating system.

• To have a thorough knowledge of process management

• To have a thorough knowledge of storage management

• To know the concepts of I/O and file systems.

UNIT I 9 + 3

Introduction - Mainframe systems – Desktop Systems – Multiprocessor Systems – Distributed

Systems – Clustered Systems – Real Time Systems – Handheld Systems - Hardware Protection -

System Components – Operating System Services – System Calls – System Programs - Process

Concept – Process Scheduling – Operations on Processes – Cooperating Processes – Inter-process

Communication.

UNIT II 9 + 3

Threads – Overview – Threading issues - CPU Scheduling – Basic Concepts – Scheduling Criteria

– Scheduling Algorithms – Multiple-Processor Scheduling – Real Time Scheduling - The Critical-

Section Problem – Synchronization Hardware – Semaphores – Classic problems of Synchronization

– Critical regions – Monitors.

UNIT III 9 + 3

System Model – Deadlock Characterization – Methods for handling Deadlocks -Deadlock

Prevention – Deadlock avoidance – Deadlock detection – Recovery from Deadlocks - Storage



Management – Swapping – Contiguous Memory allocation – Paging – Segmentation –

Segmentation with Paging.

UNIT IV 9 + 3

Virtual Memory – Demand Paging – Process creation – Page Replacement – Allocation of frames

– Thrashing - File Concept – Access Methods – Directory Structure – File System Mounting – File

Sharing – Protection

UNIT V 9 + 3

File System Structure – File System Implementation – Directory Implementation – Allocation

Methods – Free-space Management. Kernel I/O Subsystems - Disk Structure – Disk Scheduling –

Disk Management – Swap-Space Management. Case Study: The Linux System, Windows

L=45; T=15; TOTAL= 60

TEXT BOOK

1. Abraham Silberschatz, Peter Baer Galvin and Greg Gagne, “Operating System Concepts”,

Sixth Edition, John Wiley & Sons (ASIA) Pvt. Ltd, 2003.

REFERENCES

1. Harvey M. Deitel, “Operating Systems”, Third Edition, Pearson Education Pvt. Ltd, 2007.

2. Andrew S. Tanenbaum, “Modern Operating Systems”, Prentice Hall of India Pvt. Ltd, 2009.

3. William Stallings, “Operating System”, Pearson Education 2009

4. Pramod Chandra P. Bhatt – “An Introduction to Operating Systems, Concepts and Practice”,

PHI, 2010.



VISUAL PROGRAMMING -CS436

PAPER DESCRIPTION:

This course covers the fundamentals of visual language theory, iconic and symbolic

representations, parsing techniques, semantics and pragmatics of visual languages, visual

programming systems, visual querying systems, visual information systems and visual software

engineering. There has been growing research interest in visual languages and visual programming.

Its applications are diverse: visual user interface, visual specifications, visual reasoning, visual

database systems and multimedia computing, to name but a few. This course will prepare the

student to pursue research in these new and exciting fields of theory and application of visual

languages.

OBJECTIVES:

• To know and program in GUI based visual programming languages.

• To be familiar with event driven programming.

LEVEL OF KNOWLEDGE: WORKING

UNIT I: 12 HRS

Visual Basic Background – Understanding Program progress, maintenance – Creating First

program – Event-Driven Programming – Working with Visual Basic – The Visual Basic Integrated

Development Environment – Getting Help – Creating Application from scratch – Managing

Controls – Study of controls – Control Focus – Event procedures.

UNIT II: 12 HRS

Customizing a form and writing simple programs – Starting New project – Properties Window-

Common Form properties – Scale, Color properties – Making a form Responsive – Printing visual

representation of form – Typos – Creating stand alone windows programs – Displaying Information

– Displaying Information on a Form – The Format Function – Picture Boxes – Rich Textboxes –



The Printer Object - Controlling Program Flow – Determinate Loops – Indeterminate Loops –

Making decisions – Select Case – Nested If-Then – Go To.

UNIT III: 12 HRS

Built-in Functions – String Functions – Numeric Functions – Date and Time Functions - Writing

Your Own Functions and Procedures - Function Procedures – Sub Procedures – Advanced use of

Functions and Procedures – Pass by Reference, Pass by Value – Building Larger Projects – Project

with multiple forms – Code modules – Global Procedures and Global variables – Do Events – Sub

Main – Accessing Windows Functions.

UNIT IV: 14 HRS

Connecting To Databases – Data Access Objects – Remote Data Objects – ActiveX Data Objects –

OLE-DB – Using DAO to build simple DB interface – Programming with ADO in Depth. - Tools

and Techniques for Testing, Debugging and Optimization – Testing – Bugs – Immediate window –

Debugging Tools – Stopping Programs Temporarily – Final Remarks on Debugging – File System

Controls and File. System Objects - File System Controls – The File System Objects.

UNIT V: 10 HRS

Objects and Visual Basic – OLE for outside objects – Working with objects – Object Browser -

Building Internet Applications – Internet Basics – HTML Basics – IIS and Active Server Pages –

Building IIS Applications.

TEXT BOOKS:

1. Jim McKeown, “Programming in Visual Basic 2010: The Very Beginner's Guide”.

Dreamtech press 2011.

2. David I. Schneider, “An Introduction to programming using Visual Basic”, Prentice Hall

Inc. 2010

REFERENCE BOOKS:

1. Gary Cornell , “VB from Ground Up” –– Tata McGRaw Hill Edition.1999.

2. Noel Jerke , “VB Complete Reference” –- Tata McGRaw Hill Edition. 1999

3. Stephen Walther , “Active Server Pages Unleashed “–– Techmedia.



OPERATING SYSTEM LABORATORY - CS451

(Implement the following on LINUX platform. Use C for high level language implementation)

1. Shell programming

- command syntax

- write simple functions

- basic tests

2. Shell programming

- loops

- patterns

- expansions

- substitutions

3. Write programs using the following system calls of UNIX operating system: fork,

exec, getpid, exit, wait, close, stat, opendir, readdir

4. Write programs using the I/O system calls of UNIX operating system (open, read, write,

etc)

5. Write C programs to simulate UNIX commands like ls, grep, etc.

6. Given the list of processes, their CPU burst times and arrival times, display/print the

Gantt chart for FCFS and SJF. For each of the scheduling policies, compute and print

the average waiting time and average turnaround time

7. Given the list of processes, their CPU burst times and arrival times, display/print the

Gantt chart for Priority and Round robin. For each of the scheduling policies, compute

and print the average waiting time and average turnaround time

8. Implement the Producer – Consumer problem using semaphores.

9. Implement some memory management schemes – I

10. Implement some memory management schemes – II



Example for expt 9 & 10:

Free space is maintained as a linked list of nodes with each node having the starting byte address

and the ending byte address of a free block. Each memory request consists of the process-id and the

amount of storage space required in bytes. Allocated memory space is again maintained as a linked

list of nodes with each node having the process-id, starting byte address and the ending byte

address of the allocated space.

When a process finishes (taken as input) the appropriate node from the allocated list should be

deleted and this free disk space should be added to the free space list. [Care should be taken to

merge contiguous free blocks into one single block. This results in deleting more than one node

from the free space list and changing the start and end address in the appropriate node]. For

allocation use first fit, worst fit and best fit.



VISUAL PROGRAMMING LABORATORY - CS 452

1. Develop a Visual Basic Application to search an item from list of items using Binary Search.

2. Develop an Visual Basic Application to Check the given number in one of categories like

i. Strong Number.

ii. Perfect Number.

iii. Palindrome.

(Note: Use Sub Program Concept)

3. Develop a Visual Basic Application for copying the elements from one list to the other list and

Vice-versa. (Note: Implement Single Element, Multiple Element Transfer between the lists)

4. Develop a Visual Basic Application to Implement the Traffic Signal Operations by using the

following conditions

i. Three Traffic Signal named “RED”, “GREEN” and “YELLOW”

ii. Signal Flow should be RED->YELLOW->GREEN.

iii. Time Out for Red signal is 10, Green signal is 10 and Yellow signal is 5.

iv. Always Yellow Signal follows either Red or Green.

v. Red and Green Signals will not appear one by one.

5. Develop a Visual Basic Application to Read the Details of the Candidate using following

Conditions

i. Read the Name, Father Name, Address, Qualifications and respective percentages

and Experience if any.

ii. Candidate may choose any TWO OS Types (MAX)

iii. Candidate may Choose any THREE Database (MAX)

iv. Candidate may choose any FIVE Programming Languages (MAX)

(Note: No Control in the Form will be NULL)

6. Develop a Visual Basic Application to generate the Telephone Bill.

7. Develop a Visual Basic Application to make survey on different age groups.

Example:

Age groups may be (25-34), (35-44), (45-54) and >=55 and display the no of people on a

particular age group.



8. Develop a Visual Basic Application to implement the Arithmetic operations.

i. Project Consists of Four Forms

ii. Form1 is used to Read the numbers and read the operation.

iii. Operations are partitioned into two categories like Integer Arithmetic and Real

Arithmetic should follow the normalization principles.

iv. Choose the appropriate arithmetic operation under Integer and Real arithmetic under

Addition, Subtraction, Multiplication and Division.

v. Form2 is for doing Integer Arithmetic and Form3 is for doing Real Arithmetic.

vi. Form 4 is for Display the result.

9. Develop a Visual Basic Application to make the following database operations by using

ADO,

i. Insert an New Employee into the database.

ii. Delete an Existing Employee from the database.

iii. Update the employee information on the basis of Employee number.

iv. Search an employee details on the basis of department number.

v. Search an Employee on the basis of Employee number.

vi. Navigate and display the records on MOVE FIRST, MOVE NEXT, MOVE

PREVIOUS, MOVE LAST.

10. Develop a Visual Database application by using Data Environment and PL/SQL

procedures.

i. Insert the employee details into the database by using PL/SQL Procedure.

ii. Update the employee information in basis of employee number by using PL/SQL

procedure.

iii. Delete a employee information in basis of employee number by using PL/SQL

procedure.

iv. Generate a report for

a. Recently joined employees

b. Department wise and in the order of experience.

c. Complete Employee Details.



DISCRETE MATHEMATICS CS531

Paper Description:

To extend student’s mathematical maturity and ability to deal with abstraction and to introduce most of the basic terminologies used in computer science courses and application of ideas to solve practical problems.

Paper Objective:

At the end of the course, students would

• Have knowledge of the concepts needed to test the logic of a program.

• Have gained knowledge which has application in expert system, in data base and a basic for

the prolog language.

• Have an understanding in identifying patterns on many levels.

• Be aware of a class of functions which transform a finite set into another finite set which

relates to input output functions in computer science.

• Be exposed to concepts and properties of algebraic structures such as semigroups, monoids

and groups.

UNIT – I: Propositional Calculus 13 Hours

Propositions – Logical connectives – Compound propositions – Conditional and bi conditional

propositions – Truth tables – Tautologies and contradictions – Contrapositive – Logical

equivalences and implications – De Morgan’s Laws - Normal forms – Principal conjunctive and

disjunctive normal forms – Rules of inference – Arguments - Validity of arguments.

UNIT – II: Predicate Calculus 12 Hours

Predicates – Statement function – Variables – Free and bound variables – Quantifiers – Universe of

discourse – Logical equivalences and implications for quantified statements – Theory of inference –

The rules of universal specification and generalization – Validity of arguments.

UNIT – III: Set Theory 13 Hours

Basic concepts – Notations – Subset – Algebra of sets – The power set – Ordered pairs and

Cartesian product – Relations on sets –Types of relations and their properties – Relational matrix

and the graph of a relation – Partitions – Equivalence relations – Partial ordering – Poset – Hasse

diagram – Lattices and their properties – Sublattices – Boolean algebra – Homomorphism.



UNIT – IV: Functions 10 Hours

Definitions of functions – Classification of functions –Type of functions - Examples – Composition

of functions – Inverse functions – Binary and n - ary operations – Characteristic function of a set –

Hashing functions – Recursive functions – Permutation functions.

UNIT – V: Groups 12 Hours

Algebraic systems – Semigroups - Monoids – Groups - Properties – Subgroups and

Homomorphisms - Cosets and Lagrange’s theorem – Normal subgroups – Algebraic system with

two binary operations - Codes and group codes – Basic notions of error correction - Error recovery

in group codes.

TEXT BOOKS

1. Trembly J.P and Manohar R, “Discrete Mathematical Structures with Applications to

Computer Science”, Tata McGraw–Hill Pub. Co. Ltd, New Delhi, 2003.

2. Ralph. P. Grimaldi, “Discrete and Combinatorial Mathematics: An Applied Introduction”,

Fourth Edition, Pearson Education Asia, Delhi, 2002.

REFERENCE BOOKS

1. Bernard Kolman, Robert C. Busby, Sharan Cutler Ross, “Discrete Mathematical

Structures”, Fourth Indian reprint, Pearson Education Pvt Ltd., New Delhi, 2003.

2. Kenneth H. Rosen, “Discrete Mathematics and its Applications”, Fifth Edition, Tata

McGraw – Hill Pub. Co. Ltd., New Delhi, 2003.

3. Richard Johnsonbaugh, “Discrete Mathematics”, Fifth Edition, Pearson Education Asia,

New Delhi, 2002.



DATABASE MANAGEMENT SYSTEM - CS532

AIM

To provide a strong foundation in database technology and an introduction to the current trends in

this field.

OBJECTIVES

• To learn the fundamentals of data models and to conceptualize and depict a database system

using ER diagram.

• To make a study of SQL and relational database design.

• To understand the internal storage structures using different file and indexing techniques

which will help in physical DB design.

• To know the fundamental concepts of transaction processing- concurrency control

techniques and recovery procedure.

• To have an introductory knowledge about the emerging trends in the area of distributed DB-

OO DB- Data mining and Data Warehousing and XML.

UNIT I INTRODUCTION AND CONCEPTUAL MODELING 9 + 3

Introduction to File and Database systems- Database system structure – Data Models – Introduction

to Network and Hierarchical Models – ER model – Relational Model – Relational Algebra and

Calculus.

UNIT II RELATIONAL MODEL 9 + 3

SQL – Data definition- Queries in SQL- Updates- Views – Integrity and Security – Relational

Database design – Functional dependences and Normalization for Relational Databases (up to

BCNF).



UNIT III DATA STORAGE AND QUERY PROCESSING 9 + 3

Record storage and Primary file organization- Secondary storage Devices- Operations on Files-

Heap File- Sorted Files- Hashing Techniques – Index Structure for files –Different types of

Indexes- B-Tree - B+Tree – Query Processing.

UNIT IV TRANSACTION MANAGEMENT 9 + 3

Transaction Processing – Introduction- Need for Concurrency control- Desirable properties of

Transaction- Schedule and Recoverability- Serializability and Schedules – Concurrency Control –

Types of Locks- Two Phases locking- Deadlock- Time stamp based concurrency control –

Recovery Techniques – Concepts- Immediate Update- Deferred Update - Shadow Paging.

UNIT V CURRENT TRENDS 9 + 3

Object Oriented Databases – Need for Complex Data types- OO data Model- Nested relations-

Complex Types- Inheritance Reference Types - Distributed databases- Homogenous and

Heterogenous- Distributed data Storage – XML – Structure of XML- Data- XML Document-

Schema- Querying and Transformation. – Data Mining and Data Warehousing.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Abraham Silberschatz, Henry F. Korth and S. Sudarshan- “Database System Concepts”,

sixth Edition, McGraw-Hill, 2010.

REFERENCES

1. Ramez Elmasri and Shamkant B. Navathe, “Fundamental Database Systems”, Third

Edition, Pearson Education, 2008.

2. Raghu Ramakrishnan, “Database Management System”, Tata McGraw-Hill Publishing

Company, 2003.

3. Hector Garcia–Molina, Jeffrey D.Ullman and Jennifer Widom- “Database System

Implementation”- Pearson Education- 2003.

4. Peter Rob and Corlos Coronel- “Database System, Design, Implementation and

Management”, Thompson Learning Course Technology- Fifth edition, 2003.



COMPUTER NETWORKS - CS533

AIM

To introduce the concepts, terminologies and technologies used in modern days data

communication and computer networking.

OBJECTIVES

• To understand the concepts of data communications.

• To study the functions of different layers.

• To introduce IEEE standards employed in computer networking.

• To make the students to get familiarized with different protocols and network components.

UNIT I DATA COMMUNICATIONS 8 + 3

Components – Direction of Data flow – networks – Components and Categories – types of

Connections – Topologies –Protocols and Standards – ISO / OSI model – Transmission Media –

Coaxial Cable – Fiber Optics – Line Coding – Modems – RS232 Interfacing sequences.

UNIT II DATA LINK LAYER 10 + 3

Error – detection and correction – Parity – LRC – CRC – Hamming code – low Control and Error

control - stop and wait – go back-N ARQ – selective repeat ARQ- sliding window – HDLC. - LAN

- Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11 – FDDI - SONET – Bridges.

UNIT III NETWORK LAYER 10 + 3

Internetworks – Packet Switching and Datagram approach – IP addressing methods – Subnetting –

Routing – Distance Vector Routing – Link State Routing – Routers.



UNIT IV TRANSPORT LAYER 9 + 3

Duties of transport layer – Multiplexing – Demultiplexing – Sockets – User Datagram Protocol

(UDP) – Transmission Control Protocol (TCP) – Congestion Control – Quality of services (QOS) –

Integrated Services.

UNIT V APPLICATION LAYER 8 + 3

Domain Name Space (DNS) – SMTP – FTP – HTTP - WWW – Security – Cryptography.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Behrouz A. Forouzan, “Data communication and Networking”, Tata McGraw-Hill, 2006.

REFERENCES

1. James F. Kurose and Keith W. Ross, “Computer Networking: A Top-Down Approach

Featuring the Internet”, Pearson Education, 2012.

2. Larry L.Peterson and Peter S. Davie, “Computer Networks”, Harcourt Asia Pvt. Ltd.,

Second Edition.

3. Andrew S. Tanenbaum, “Computer Networks”, 5th Edition, Pearson 2012.

4. William Stallings, “Data and Computer Communication”, Sixth Edition, Pearson Education,

2007.



THEORY OF COMPUTATION - CS534

AIM

To have a introductory knowledge of automata, formal language theory and computability.

OBJECTIVES

• To have an understanding of finite state and pushdown automata.

• To have a knowledge of regular languages and context free languages.

• To know the relation between regular language, context free language and corresponding

recognizers.

• To study the Turing machine and classes of problems.

UNIT I AUTOMATA 9 + 3

Introduction to formal proof – Additional forms of proof – Inductive proofs –Finite Automata (FA)

– Deterministic Finite Automata (DFA)– Non-deterministic Finite Automata (NFA) – Finite

Automata with Epsilon transitions.

UNIT II REGULAR EXPRESSIONS AND LANGUAGES 9 + 3

Regular Expression – FA and Regular Expressions – Proving languages not to be regular – Closure

properties of regular languages – Equivalence and minimization of Automata.

UNIT III CONTEXT-FREE GRAMMAR AND LANGUAGES 9 + 3

Context-Free Grammar (CFG) – Parse Trees – Ambiguity in grammars and languages – Definition

of the Pushdown automata – Languages of a Pushdown Automata – Equivalence of Pushdown

automata and CFG, Deterministic Pushdown Automata.



UNIT IV PROPERTIES OF CONTEXT-FREE LANGUAGES 9 + 3

Normal forms for CFG – Pumping Lemma for CFL - Closure Properties of CFL – Turing Machines

– Programming Techniques for TM.

UNIT V UNDECIDABILITY 9 + 3

A language that is not Recursively Enumerable (RE) – An undecidable problem that is RE –

Undecidable problems about Turing Machine – Post’s Correspondence Problem - The classes P and

NP.

L=45; T=15; TOTAL= 60

TEXT BOOK

1. J.E.Hopcroft, R.Motwani and J.D Ullman, “Introduction to Automata Theory, Languages

and Computations”, Pearson Education, 2008.

REFERENCES

1. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second

Edition, Pearson Education/PHI, 2003

2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition,

TMH, 2003.

3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.



MICROPROCESSORS AND ITS APPLICATIONS CS535

AIM

To learn the architecture programming and interfacing of microprocessors.

OBJECTIVES

• To introduce the architecture and programming of 8086 microprocessor. • To introduce the interfacing of peripheral devices with 8086 microprocessor. • To introduce the architecture and programming of 80286, 80386 and 80486

microprocessor. UNIT I 8086 MICROPROCESSOR Intel 8086 Microprocessor - Internal architecture – Block diagram – Minimum and maximum mode operation – Interrupt and Interrupt applications – DMA data transfer –8086 memory organization – even and odd memory banks – segment registers - logical and physical address – advantages and disadvantages of physical memory. UNIT II 8086 MICROPROCESSOR I/O INTERFACING

Intel 8086 microprocessor – Architecture – Instruction set and assembler directives –

Addressing modes – Assembly language programming- Memory Interfacing and I/O interfacing -

Parallel communication interface – Serial communication interface – Timer – Keyboard /display

controller – Interrupt controller – DMA controller – Programming and applications.

UNIT III 80286 MICROPROCESSOR Intel 80286 Microprocessor - 80286 Architecture, system connection – Real address mode operation – Protected mode operation UNIT IV 80386 MICROPROCESSOR Intel 80386 Microprocessor - 80386 Architecture and system connection – Real operating mode – 386 protected mode operation – segmentation and virtual memory – segment privilege levels and protection – call gates – I/O privilege levels – Interrupts and exception handling – task switching – paging mode – 80386 virtual 86 mode operation. UNIT V 80486 MICROPROCESSOR Advanced Intel Microprocessors - 80486 – Processor model – Reduced Instruction cycle – five stage instruction pipe line – Integrated coprocessor – On board cache – Burst Bus mode. Pentium – super scalar architecture – u-v pipe line – branch prediction logic – cache structure – BIST (built in self test) – Introduction to MMX technology.

L=45 ; T=15; TOTAL= 60



References 1. Ramesh S.Gaonkar, “Microprocessor - Architecture, Programming and Applications with

the 8085”, Penram International publishing private limited, fifth edition. 2. A.K. Ray & K.M.Bhurchandi, “Advanced Microprocessors and peripherals- Architectures,

Programming and Interfacing”, Tata McGraw Hill, 2002 reprint. 3. Barry B. Brey, “The Intel Microprocessors” Pearson Education India., 8th Edition 4. Douglous V. Hall “Microprocessor and Interfacing” Tata McGraw Hill, 2006 revised, 2003. 5. Gibson, “Microprocessor and Interfacing” Tata McGraw Hill,II edition



NETWORK LABORATORY - CS551

(All the programs are to be written using C)

1. Simulation of ARP / RARP.

2. Write a program that takes a binary file as input and performs bit stuffing and CRC

Computation.

3. Develop an application for transferring files over RS232.

4. Simulation of Sliding-Window protocol.

5. Simulation of BGP / OSPF routing protocol.

6. Develop a Client – Server application for chat.

7. Develop a Client that contacts a given DNS Server to resolve a given host name.

8. Write a Client to download a file from a HTTP Server.

9 &10 Study of Network Simulators like NS2/Glomosim / OPNET .



MICROPROCESSORS LABORATORY - CS552

1. Programs for 8/16 bit Arithmetic operations (Using 8085).

2. Programs for Sorting and Searching (Using 8085, 8086).

3. Programs for String manipulation operations (Using 8086).

4. Programs for Digital clock and Stop watch (Using 8086).

5. Interfacing ADC and DAC.

6. Parallel Communication between two MP Kits using Mode 1 and Mode 2 of 8255.

7. Interfacing and Programming 8279, 8259, and 8253.

8. Serial Communication between two MP Kits using 8251.

9. Interfacing and Programming of Stepper Motor and DC Motor Speed control.



DATABASE MANAGEMENT SYSTEMS LABORATORY - CS553

LIST OF EXPERIMENTS

1. Data Definition Language (DDL) commands in RDBMS.

2. Data Manipulation Language (DML) and Data Control Language (DCL) commands in

RDBMS.

3. High-level language extension with Cursors.

4. High level language extension with Triggers

5. Procedures and Functions.

6. Embedded SQL.

7. Database design using E-R model and Normalization.

8. Design and implementation of Payroll Processing System.

9. Design and implementation of Banking System.

10. Design and implementation of Library Information System.



DIGITAL SIGNAL PROCESSING - CS632

AIM

To review signals and systems, study DFT and FFT, discuss the design of IIR & FIR filters and

study typical applications of digital signal processing.

OBJECTIVES

• To have an overview of signals and systems.

• To study DFT & FFT

• To study the design of IIR filters.

• To study the design of FIR filters.

• To study the effect of finite word lengths & applications of DSP

UNIT I SIGNALS AND SYSTEMS 9 + 3

Basic elements of digital signal Processing –Concept of frequency in continuous time and discrete

time signals –Sampling theorem –Discrete time signals. Discrete time systems –Analysis of Linear

time invariant systems –Z transform –Convolution and correlation.

UNIT II FAST FOURIER TRANSFORMS 9 +3

Introduction to DFT – Efficient computation of DFT Properties of DFT – FFT algorithms – Radix-

2 and Radix-4 FFT algorithms – Decimation in Time – Decimation in Frequency algorithms – Use

of FFT algorithms in Linear Filtering and correlation.

UNIT III IIR FILTER DESIGN 9 + 3

Structure of IIR – System Design of Discrete time IIR filter from continuous time filter – IIR filter

design by Impulse Invariance. Bilinear transformation – Approximation derivatives – Design of IIR

filter in the Frequency domain.



UNIT IV FIR FILTER DESIGN 9 + 3

Symmetric & Antisymteric FIR filters – Linear phase filter – Windowing technique – Rectangular,

Kaiser windows – Frequency sampling techniques – Structure for FIR systems.

UNIT V FINITE WORD LENGTH EFFECTS 9 + 3

Quantization noise – derivation for quantization noise power – Fixed point and binary floating

point number representation – comparison – over flow error – truncation error – co-efficient

quantization error - limit cycle oscillation – signal scaling – analytical model of sample and hold

operations – Application of DSP – Model of Speech Wave Form – Vocoder.

L=45; T=15; TOTAL= 60

TEXT BOOK

1. John G Proakis and Dimtris G Manolakis, “Digital Signal Processing Principles, Algorithms

and Application”, PHI/Pearson Education, 2000, 3rd Edition.

REFERENCES

1. Alan V Oppenheim, Ronald W Schafer and John R Buck, “Discrete Time Signal

Processing”, PHI/Pearson Education, 2000, 2nd Edition.

2. Johny R.Johnson, “Introduction to Digital Signal Processing”, Prentice Hall of

India/Pearson Education, 2002.

3. Sanjit K.Mitra, “Digital Signal Processing: A Computer – Based Approach”, Tata McGraw-

Hill, 2001, Second Edition.



SYSTEM SOFTWARE - CS633

AIM

To have an understanding of foundations of design of assemblers, loaders, linkers, and macro

processors.

OBJECTIVES

• To understand the relationship between system software and machine architecture.

• To know the design and implementation of assemblers

• To know the design and implementation of linkers and loaders.

• To have an understanding of macroprocessors.

• To have an understanding of system software tools.

UNIT-I Machine Structure and Evolution of a programming system (11)

Introduction to System Software, Components of System Software, Evolution of System Software,

Assembler, Loader, Macros, Compilers, Simplified Instructional Computer: SIC machine

architecture, SIC/XE machine architecture, SIC programming examples.

UNIT=II Assembler (13)

Basic assembler functions (SIC assembler, algorithm and data structure), Machine dependent assembler features

(Instruction formats and addressing modes, program relocation), Machine independent assembly features

(Literals, Symbol defining statements, expressions, program blocks, control sections and program linking),

Assembler design options (One pass assembler, multi pass assembler)

UNIT=III

Loaders and Linkers (12)

Basic loader functions (Design of an absolute loader, simple bootstrap loader), Machine dependent loader features

(Relocation, program linking, algorithm and data structures for a linking loader), Machine independent loader

features (Automatic library search, loader options), Loader design options (Linkage editor, dynamic linking,

bootstrap loaders).



UNIT-IV

Macro Processor (11)

Macro Instructions, Features of a macro facility (Macro instruction arguments, Conditional macro expansion,

Macro calls within macro, Macro instructions defining macros), Implementation (Two pass algorithm, Single pass

algorithm)

UNIT V

Compilers (13)

Part1: Basic elements, Syntactic units and interpreting meaning, Intermediate form (Arithmetic statements, Non-

arithmetic statements, Non-executable statements), Storage allocation, Code generation, Optimization (Machine

independent, Machine dependent, Assembly phase).

Part2: Phases of the compiler (Lexical phase, Syntax phase, Interpretation phase, Optimization, Storage

assignment, Code generation, Assembly phase), Passes of a compiler.

Text books:

1. Donovan, John, System programming, Tata McGraw-Hill, 2003

2. Beck, Leland, System Software An Introduction to System Programming, Addison-Wesley,

3rd Edition, 1997

Reference Book:

1. Dhamdhere D M, Systems programming and operating systems, Tata McGraw-Hill, 1994.



SOFTWARE ENGINEERING - CS634

AIM

To introduce the methodologies involved in the development and maintenance of software (i.e)

over its entire life cycle.

OBJECTIVES: To be aware of

• Different life cycle models

• Requirement dictation process

• Analysis modeling and specification

• Architectural and detailed design methods

• Implementation and testing strategies

• Verification and validation techniques

• Project planning and management

• Use of CASE tools

UNIT I SOFTWARE PROCESS 9 + 3

Introduction –S/W Engineering Paradigm – life cycle models (water fall, incremental, spiral,

WINWIN spiral, evolutionary, prototyping, object oriented) - system engineering – computer based

system – verification – validation – life cycle process – development process –system engineering

hierarchy.

UNIT II SOFTWARE REQUIREMENTS 9 + 3

Functional and non-functional - user – system –requirement engineering process – feasibility

studies – requirements – elicitation – validation and management – software prototyping –

prototyping in the software process – rapid prototyping techniques – user interface prototyping -

S/W document. Analysis and modeling – data, functional and behavioral models – structured

analysis and data dictionary.



UNIT III DESIGN CONCEPTS AND PRINCIPLES 9 + 3

Design process and concepts – modular design – design heuristic – design model and document.

Architectural design – software architecture – data design – architectural design – transform and

transaction mapping – user interface design – user interface design principles. Real time systems -

Real time software design – system design – real time executives – data acquisition system -

monitoring and control system. SCM – Need for SCM – Version control – Introduction to SCM

process – Software configuration items.

UNIT IV TESTING 9 + 3

Taxonomy of software testing – levels – test activities – types of s/w test – black box testing –

testing boundary conditions – structural testing – test coverage criteria based on data flow

mechanisms – regression testing – testing in the large. S/W testing strategies – strategic approach

and issues - unit testing – integration testing – validation testing – system testing and debugging.

UNIT V SOFTWARE PROJECT MANAGEMENT 9 + 3

Measures and measurements – S/W complexity and science measure – size measure – data and

logic structure measure – information flow measure. Software cost estimation – function point

models – COCOMO model- Delphi method.- Defining a Task Network – Scheduling – Earned

Value Analysis – Error Tracking - Software changes – program evolution dynamics – software

maintenance – Architectural evolution. Taxonomy of CASE tools.

L=45; T=15; TOTAL= 60



TEXT BOOK

1. Roger S.Pressman, Software engineering- A practitioner’s Approach, McGraw-Hill

International Edition, 2009.

REFERENCES

1. Ian Sommerville, Software engineering, Pearson education Asia, 2010.

2. Pankaj Jalote- An Integrated Approach to Software Engineering, Narosa publishing house

2011.

3. James F Peters and Witold Pedryez, “Software Engineering – An Engineering Approach”,

John Wiley and Sons, New Delhi, 2007.

4. Ali Behforooz and Frederick J Hudson, “Software Engineering Fundamentals”, OUP India

2012.



NUMERICAL METHODS CS635 Paper Description:

With the present development of the computer technology, it is necessary to develop efficient algorithms for solving problems in science, engineering and technology. This course gives a complete procedure for solving different kinds of problems occur in engineering numerically. Paper objective:

At the end of the course, the students would be acquainted with the basic concepts in numerical methods,

• The roots of nonlinear (algebraic or transcendental) equations, solutions of large system

of linear equations and eigenvalue problem of a matrix can be obtained numerically where

analytical methods fail to give solution.

• When huge amounts of experimental data are involved, the methods discussed on

interpolation will be useful in constructing approximate polynomial to represent the data

and to find the intermediate values.

• The numerical differentiation and integration find application when the function in the

analytical form is too complicated or the huge amounts of data are given such as series of

measurements, observations or some other empirical information.

• Since many physical laws are couched in terms of rate of change of one/two or more

independent variables, most of the engineering problems are characterized in the form of

either nonlinear ordinary differential equations or partial differential equations. The

methods introduced in the solution of ordinary differential equations and partial differential

equations will be useful in attempting any engineering problem.

UNIT – I: Solution of Equations and Eigenvalue Problems 12 Hours Linear interpolation methods (method of false position) – Newton’s method – Statement of Fixed

Point Theorem – Fixed point iteration: x = g(x) method – Solution of linear system by Gaussian

elimination and Gauss-Jordan methods- Iterative methods: Gauss Jacobi and Gauss-Seidel

methods- Inverse of a matrix by Gauss Jordon method – Eigenvalue of a matrix by power method.

UNIT – II: Interpolation and Approximation 12 Hours

Lagrangian Polynomials – Divided differences – Interpolating with a cubic spline – Newton’s

forward and backward difference formulas.

UNIT – III: Numerical Differentiation and Integrati on 12 Hours



Derivatives from difference tables – Divided differences and finite differences –Numerical

integration by trapezoidal and Simpson’s 1/3 and 3/8 rules – Romberg’s method – Two and Three

point Gaussian quadrature formulas – Double integrals using trapezoidal and Simpson’s rules.

UNIT – IV: Initial Value Problems for Ordinary Diff erential Equations 12 Hours

Single step methods: Taylor series method, Euler method, Fourth order Runge – Kutta method for

solving first and second order equations and modified Euler methods – Multistep methods: Milne’s

and Adam’s predictor and corrector methods.

UNIT – V: Boundary Value Problems in Ordinary and Partial Differential

Equations 12 Hours

Finite difference solution of second order ordinary differential equation – Finite difference solution

of one dimensional heat equation by explicit and implicit methods – One dimensional wave

equation and two dimensional Laplace and Poisson equations.

TEXT BOOKS

1. Gerald, C.F, and Wheatley, P.O, “Applied Numerical Analysis”, Sixth Edition, Pearson

Education Asia, New Delhi, 2002.

2. Balagurusamy, E., “Numerical Methods”, Tata McGraw-Hill Pub. Co. Ltd, New Delhi, 1999.

REFERENCES

1. Kandasamy, P., Thilagavathy, K. and Gunavathy, K., “Numerical Methods”, S.Chand Co.

Ltd., New Delhi, 2003.

2. Burden, R.L and Faires, T.D., “Numerical Analysis”, Seventh Edition, Thomson Asia Pvt.

Ltd., Singapore, 2002.



GRAPHICS AND MULTIMEDIA - CS636

AIM

To impart the fundamental concepts of Computer Graphics and Multimedia.

OBJECTIVES

• To study the graphics techniques and algorithms.

• To study the multimedia concepts and various I/O technologies.

• To enable the students to develop their creativity

UNIT I OUTPUT PRIMITIVES 9 + 3

Introduction - Line - Curve and Ellipse Drawing Algorithms – Attributes – Two-Dimensional

Geometric Transformations – Two-Dimensional Clipping and Viewing.

UNIT II THREE-DIMENSIONAL CONCEPTS 9 + 3

Three-Dimensional Object Representations – Three-Dimensional Geometric and Modeling

Transformations – Three-Dimensional Viewing – Color models – Animation.

UNIT III MULTIMEDIA SYSTEMS DESIGN 9 + 3

An Introduction – Multimedia applications – Multimedia System Architecture – Evolving

technologies for Multimedia – Defining objects for Multimedia systems – Multimedia Data

interface standards – Multimedia Databases.

UNIT IV MULTIMEDIA FILE HANDLING 9 + 3

Compression & Decompression – Data & File Format standards – Multimedia I/O technologies -

Digital voice and audio – Video image and animation – Full motion video – Storage and retrieval

Technologies.



UNIT V HYPERMEDIA 9 + 3

Multimedia Authoring & User Interface – Hypermedia messaging - Mobile Messaging –

Hypermedia message component – Creating Hypermedia message – Integrated multimedia

message standards – Integrated Document management – Distributed Multimedia Systems.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Donald Hearn and M.Pauline Baker, “Computer Graphics C Version”, Pearson Education,

2011.

(UNIT I : Chapters 1 to 6; UNIT 2: Chapter 9 – 12, 15, 16)

2. Prabat K Andleigh and Kiran Thakrar, “Multimedia Systems and Design”, PHI, 2009.

(UNIT 3 to 5)

REFERENCES

1. Judith Jeffcoate, “Multimedia in practice technology and Applications”, Pearson 2006

2. Foley, Vandam, Feiner, Huges, “Computer Graphics: Principles & Practice”, Pearson

Education, second edition 2003.



GRAPHICS AND MULTIMEDIA LABORATORY - CS651

1. To implement Bresenham’s algorithms for line, circle and ellipse drawing

2. To perform 2D Transformations such as translation, rotation, scaling, reflection and sharing.

3. To implement Cohen-Sutherland 2D clipping and window-viewport mapping

4. To perform 3D Transformations such as translation, rotation and scaling.

5. To visualize projections of 3D images.

6. To convert between color models.

7. To implement text compression algorithm

8. To implement image compression algorithm

9. To perform animation using any Animation software

10. To perform basic operations on image using any image editing software



SYSTEM SOFTWARE LABORATORY - CS652

(Using C or C++)

1. Implement a symbol table with functions to create, insert, modify, search, and display.

2. Implement pass one of a two pass assembler.

3. Implement pass two of a two pass assembler.

4. Implement a single pass assembler.

5. Implement a macro processor.

6. Implement an absolute loader.

7. Implement a relocating loader.

8. Implement pass one of a direct-linking loader.

9. Implement pass two of a direct-linking loader.

10. Implement a simple text editor with features like insertion / deletion of a character, word,

sentence.

(For loader exercises, output the snap shot of the main memory as it would be, after the loading has

taken place)



INTERNET PROGRAMMING - CS734

AIM

To explain Internet Programming concepts and related programming and scripting languages.

OBJECTIVES

• To describe basic Internet Protocols.

• Explain JAVA and HTML tools for Internet programming.

• Describe scripting languages – Java Script.

• Explain dynamic HTML programming.

• Explain Server Side Programming tools.

UNIT I BASIC NETWORK AND WEB CONCEPTS 9 + 3

Internet standards – TCP and UDP protocols – URLs – MIME – CGI – Introduction to SGML.

UNIT II JAVA PROGRAMMING 9 + 3

Java basics – I/O streaming – files – Looking up Internet Address - Socket programming –

client/server programs – E-mail client – SMTP - POP3 programs – web page retrieval – protocol

handlers – content handlers - applets – image handling - Remote Method Invocation.

UNIT III SCRIPTING LANGUAGES 9 + 3

HTML – forms – frames – tables – web page design - JavaScript introduction – control structures –

functions – arrays – objects – simple web applications

UNIT IV DYNAMIC HTML 9 + 3

Dynamic HTML – introduction – cascading style sheets – object model and collections – event

model – filters and transition – data binding – data control – ActiveX control – handling of

multimedia data



UNIT V SERVER SIDE PROGRAMMING 9 + 3

Servlets – deployment of simple servlets – web server (Java web server / Tomcat / Web logic) –

HTTP GET and POST requests – session tracking – cookies – JDBC – simple web applications –

multi-tier applications.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Deitel, Deitel and Nieto, “Internet and World Wide Web – How to program”, Pearson

Education Publishers, 2009.

2. Elliotte Rusty Harold, “Java Network Programming”, O’Reilly Publishers, 2005

REFERENCES

1. R. Krishnamoorthy & S. Prabhu, “Internet and Java Programming”, New Age International

Publishers, 2002.

2. Thomno A. Powell, “The Complete Reference HTML and XHTML”, fourth edition, Tata

McGraw Hill, 2010.

3. “The Complete Reference – Java2”, Tata McGraw-Hill, 8rd edition, 2011. Herbert Scheldt



ARTIFICIAL INTELLIGENCE - CS735

AIM

Artificial Intelligence aims at developing computer applications, which encompasses perception,

reasoning and learning and to provide an in-depth understanding of major techniques used to

simulate intelligence.

OBJECTIVES

• To provide a strong foundation of fundamental concepts in Artificial Intelligence

• To provide a basic exposition to the goals and methods of Artificial Intelligence

• To enable the student to apply these techniques in applications which involve perception,

reasoning and learning.

UNIT I Introduction 8 + 3

Intelligent Agents – Agents and environments - Good behavior – The nature of environments –

structure of agents - Problem Solving - problem solving agents – example problems – searching for

solutions – uniformed search strategies - avoiding repeated states – searching with partial

information.

Unit II SEARCHING TECHNIQUES 10 + 3

Informed search and exploration – Informed search strategies – heuristic function – local search

algorithms and optimistic problems – local search in continuous spaces – online search agents and

unknown environments - Constraint satisfaction problems (CSP) – Backtracking search and Local

search for CSP – Structure of problems - Adversarial Search – Games – Optimal decisions in

games – Alpha – Beta Pruning – imperfect real-time decision – games that include an element of

chance.



Unit III KNOWLEDGE REPRESENTATION 10 + 3

First order logic – representation revisited – Syntax and semantics for first order logic – Using first

order logic – Knowledge engineering in first order logic - Inference in First order logic –

prepositional versus first order logic – unification and lifting – forward chaining – backward

chaining - Resolution - Knowledge representation - Ontological Engineering - Categories and

objects – Actions - Simulation and events - Mental events and mental objects

UNIT IV LEARNING 9 + 3

Learning from observations - forms of learning - Inductive learning - Learning decision trees -

Ensemble learning - Knowledge in learning – Logical formulation of learning – Explanation based

learning – Learning using relevant information – Inductive logic programming - Statistical learning

methods - Learning with complete data - Learning with hidden variable - EM algorithm - Instance

based learning - Neural networks - Reinforcement learning – Passive reinforcement learning -

Active reinforcement learning - Generalization in reinforcement learning.

UNIT V APPLICATIONS 8 + 3

Communication – Communication as action – Formal grammar for a fragment of English –

Syntactic analysis – Augmented grammars – Semantic interpretation – Ambiguity and

disambiguation – Discourse understanding – Grammar induction - Probabilistic language

processing - Probabilistic language models – Information retrieval – Information Extraction –

Machine translation.

L=45; T=15; TOTAL= 60

TEXT BOOK

1. Stuart Russell, Peter Norvig, “Artificial Intelligence – A Modern Approach”, 2nd Edition,

Pearson Education / Prentice Hall of India, 2004.



REFERENCES

1. Nils J. Nilsson, “Artificial Intelligence: A new Synthesis”, Harcourt Asia Pvt. Ltd., 2000.

2. Elaine Rich and Kevin Knight, “Artificial Intelligence”, 2nd Edition, Tata McGraw-Hill,

2012.

3. George F. Luger, “Artificial Intelligence-Structures And Strategies For Complex Problem

Solving”, Pearson Education / PHI, 2008.



JAVA PROGRAMMING CS736

Unit I.

Introduction to java Programming (12)

History of Java. Characteristics of Java. The Java Environment – JVM, JDK & JRE. Different

versions of Java. OOP Principles. Comparison of Java with C and C++.

Language Fundamentals

Data Types, Expressions, Keywords, Operators and Control Flow Statements. Arrays – Special

Types. Java File Structure. Creating and Running Java Programs. Comments in Java.

Class and Objects

Creating class and Objects, Methods, this keyword, Constructors. Garbage Collection, the finalize()

method. Access Control. Static Blocks. Finals. Nested and Inner Classes. String Class. Command

Line Arguments

Unit II.

Inheritance in Java (13)

Inheritance in classes, Using super, Method overriding, Dynamic Method Dispatch. Abstract

Classes, Using final with inheritance, the Object Class.

Interfaces and Packages

Inheritance in java with Interfaces – Defining Interfaces, Implementing Interfaces, Extending

Interfaces. Creating Packages, CLASSPATH variable, Access protection, Importing Packages

Exception Handling in Java

try-catch-finally mechanism, throw statement, throws statement. Packages and Classes for

Exception Handling

Unit III.

Input / Output in java (13)

java.io package, I/O Streams, Readers and Writers, Tokenizing input, Using various I/O classes and

FilenameFilter class.

Multithreading



Life cycle of a thread, Java thread priorities, Runnable interface and Thread Class. Sharing limited

Resources, Shared Object with Synchronization.

Applets

Life cycle of Applet, Applet Architecture, Applet restrictions, Applet advantages. Creation and

Execution of java Applets.

Unit IV.

GUI Components (AWT & SWING) (11)

GUI concepts in java, Basic GUI Components in AWT, Container Classes, Layout Managers.

Difference between AWT and SWING. SWING Components an Introduction

Writing GUI programs in java (with AWT or SWING). GUI Programming with Applications and

Applets, Event Handling.

Unit V.

Distributed Computing an Introduction (11)

Network Programming with Java. JDBC (Java Database Connectivity). Servlets. Java Server Pages.

RMI (Remote Method Invocation).

Text Books:

1. Schildt Herbert, Java 2: The Complete Reference, Tata McGraw-Hill, 4th Edition, 2002

2. Deitel & Deitel, Java How to Program, Pearson Education Asia, 3rd Edition, 2001

Reference Books:

1. Horton Ivor, Beginning Java2, Wiley publishing Inc., 1st Edition, 2005.

2. Holzner Steven, Java2 Black Book, dreamtech press, 1st Edition, 2002.

3. Gaddis Tony, Starting out with Java, dreamtech press, 2004.

4. Eckel Bruce, Thinking in Java, Pearson Education Asia, 2nd Edition, 2001

5. Flanagan David, Java in a nutshell, O’REILLY, 4th Edition, 2002



JAVA PROGRAMMING LABORATORY - CS751

Section – A

1. Write a program to demonstrate various data types and operators.

2. Demonstrate arrays with arraycopy() method.

3. Demonstrate method overloading and constructor overloading.

4. Demonstrate the usage of static keyword in java – use static data and static block.

5. Demonstrate final keyword with respect to variable, method and class.

6. Demonstrate inner classes in java.

7. Write a program to demonstrate multilevel inheritance and usage of the keywords this &

super.

8. Demonstrate abstract class.

9. Demonstrate the usage of interface for multiple inheritance.

10. Differentiate the usage of throw, throws and try-catch-finally by writing a java program.

Section – B

11. Demonstrate various I/O streams in java.

12. Demonstrate the Reader/Writer classes in java.

13. Demonstrate the multithreading concept by implementing Runnable interface.

14. Demonstrate the multithreading concept by extending Thread class.

15. Write an applet program and using paint function make some graphics.

16. Write a program to demonstrate the usage of different Layouts in java.

17. Write a java program to demonstrate various GUI components in java (AWT / SWING)

with appropriate Event Handling.



INTERNET PROGRAMMING LABORATORY - CS752

LIST OF EXPERIMENTS

1. Write programs in Java to demonstrate the use of following components Text fields,

buttons, Scrollbar, Choice, List and Check box

2. Write Java programs to demonstrate the use of various Layouts like Flow Layout, Border

Layout, Grid layout, Grid bag layout and card layout

3. Write programs in Java to create applets incorporating the following features:

• Create a color palette with matrix of buttons

• Set background and foreground of the control text area by selecting a color from

color palette.

• In order to select Foreground or background use check box control as radio buttons

• To set background images

4. Write programs in Java to do the following.

• Set the URL of another server.

• Download the homepage of the server.

• Display the contents of home page with date, content type, and Expiration date. Last

modified and length of the home page.

5. Write programs in Java using sockets to implement the following:

• HTTP request

• FTP

• SMTP

• POP3

6. Write a program in Java for creating simple chat application with datagram sockets and

datagram packets.



7. Write programs in Java using Servlets:

• To invoke servlets from HTML forms

• To invoke servlets from Applets

8. Write programs in Java to create three-tier applications using servlets

• for conducting on-line examination.

• for displaying student mark list. Assume that student information is available in a

database which has been stored in a database server.

9. Create a web page with the following using HTML

• To embed a map in a web page

• To fix the hot spots in that map

• Show all the related information when the hot spots are clicked.

10. Create a web page with the following.

• Cascading style sheets.

• Embedded style sheets.

• Inline style sheets.

• Use our college information for the web pages.



LIST OF ELECTIVES FOR VI SEMESTER

RESOURCE MANAGEMENT TECHNIQUES – CS1001

UNIT I LINEAR PROGRAMMING: 9 + 3

Principal components of decision problem – Modeling phases – LP Formulation and graphic

solution – Resource allocation problems – Simplex method – Sensitivity analysis.

UNIT II DUALITY AND NETWORKS: 9 + 3

Definition of dual problem – Primal – Dual relation ships – Dual simplex methods – Post

optimality analysis – Transportation and assignment model shortest route problem.

UNIT III INTEGER PROGRAMMING: 9 + 3

Cutting plan algorithm – Branch and bound methods, Multistage (Dynamic) programming.

UNIT IV CLASSICAL OPTIMISATION THEORY: 9 + 3

Unconstrained external problems, Newton – Ralphson method – Equality constraints –

Jacobean methods – Lagrangian method – Kuhn – Tucker conditions – Simple problems.

UNIT V OBJECT SCHEDULING: 9 + 3

Network diagram representation – Critical path method – Time charts and resource leveling –

PERT.

L=45; T=15; TOTAL= 60

REFERNECES:

1. Anderson ‘Quantitative Methods for Business’, 8th Edition, Thomson Learning, 2002.

2. Winston ‘Operation Research’, Thomson Learning, 2003.

3. H.A.Taha, ‘Operation Research’, Prentice Hall of India, 2002.

4. Vohra, ‘Quantitative Techniques in Management’, Tata McGraw Hill, 2002.

5. Anand Sarma, ‘Operation Research’, Himalaya Publishing House, 2003.



UNIX INTERNALS – CS1002

AIM

To understand the kernel, I/O & files, process control, scheduling and memory management

policies in UNIX.

OBJECTIVES

• To get thorough understanding of the kernel..

• To understand the file organization and management.

• To know the various system calls.

• To have knowledge of process architecture, process control & scheduling and memory

management.

UNIT I GENERAL OVERVIEW OF THE SYSTEM 9 + 3

History – System structure – User perspective – Operating system services – Assumptions about

hardware. Introduction to the Kernel : Architecture of the UNIX operating system – Introduction to

system concepts – Kernel data structures – System administration – Summary and Preview.

UNIT II BUFFER CACHE 9 + 3

Buffer headers – Structure of the buffer pool – Advantages and disadvantages of the buffer cache.

Internal representation of files : Inodes – Structure of a regular file – Directories – Conversion of a

path name to an Inode – Super block – Other file types.

UNIT III SYSTEM CALLS FOR FILE SYSTEM 9 + 3

Open – Read – Write – File and record locking – Adjusting the position of file I/O –LSEEK –

Close – File creation – Creation of special files – Pipes – Dup – Mounting and unmounting file

systems



UNIT IV THE STRUCTURE OF PROCESSES 9 + 3

Process states and transitions – Layout of system memory – The context of a process – Saving the

context of a process. Process Control: Process creation – Signals – Process termination – Awaiting

process termination – Invoking other programs – The shell – System boot and the INIT process.

UNIT V PROCESS SCHEDULING AND MEMORY MANAGEMENT POL ICIES

9 + 3

Process Scheduling – Memory Management Policies : Swapping – A hybrid system with swapping

and demand paging. The I/O Subsystem : Driver Interfaces– Disk Drivers-Terminal Drivers.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Maurice J. Bach, “The Design of the Unix Operating System”, Prentice Hall of India, 2012.

REFERENCES

1. Vahalia, “Unix Internals: The New Frontiers”, Pearson Education Inc, 2003.



HIGH PERFORMANCE MICROPROCESSORS - CS1003

AIM

To do a detailed study of CISC and RISC principles, study the architecture & special features of the

Pentium processors and typical RISC processors and to study the architecture of special purpose

processors.

OBJECTIVES

• To study the principles of CISC

• To study the Pentium processor family

• To study the principles of RISC

• To study the architecture & special features of typical RISC processors.

• To study the architecture & function of special purpose processors.

UNIT I CISC PRINCIPLES 9 + 3

Classic CISC microprocessors, Intel x86 Family: Architecture - register set - Data formats -

Addressing modes - Instruction set - Assembler directives – Interrupts - Segmentation, Paging, Real

and Virtual mode execution – Protection mechanism, Task management 80186, 286, 386 and 486

architectures.

UNIT II PENTIUM PROCESSORS 10 + 3

Introduction to Pentium microprocessor – Special Pentium Registers – Pentium Memory

Management – New Pentium instructions – Introduction to Pentium Pro and its special features –

Architecture of Pentium-II, Pentium-III and Pentium4 microprocessors.

UNIT III RISC PRINCIPLES 10 + 3

RISC Vs CISC – RISC properties and evaluation – On chip register File Vs Cache evaluation –

Study of a typical RISC processor – The PowerPC – Architecture & special features – Power PC

601 – IBM RS/6000, Sun SPARC Family – Architecture – Super SPARC.



UNIT IV RISC PROCESSOR 8 + 3

MIPS Rx000 family – Architecture – Special features – MIPS R4000 and R4400 – Motorola 88000

Family – Architecture – MC 88110 – MC 88100 and MC 88200.

UNIT V SPECIAL PURPOSE PROCESSORS 8 + 3

EPIC Architecture – ASIPs – Network Processors – DSPs – Graphics / Image Processors.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Daniel Tabak, “Advanced Microprocessors”, Tata McGraw-Hill, 2011, 2nd Edition.

REFERENCES

1. www.intel.com/products/server/processors/server/itanium2 (Unit V:EPIC)

2. www.hpl.hp.com/techreports/1999/HPL-1999-111.html (Unit V: Network Processor)

3. www.intel.com/design/network/products/npfamily (Unit V: Network Processor)

4. www.national.com/appinfo/imaging/processors.html(Unit V: Image Processor)

5. Barry B.Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286, 80386, 80486,

Pentium, PentiumPro Processor, PentiumII, PentiumIII, PentiumIV, Architecture,

Programming & Interfacing”, 6th Edition, Pearson Education/PHI, 2002.



DATA WAREHOUSING AND MINING – CS1004

AIM

To serve as an introductory course to under graduate students with an emphasis on the design

aspects of Data mining and Data Warehousing

OBJECTIVE

This course has been designed with the following objectives:

• To introduce the concept of data mining with in detail coverage of basic tasks, metrics,

issues, and implication. Core topics like classification, clustering and association rules are

exhaustively dealt with.

• To introduce the concept of data warehousing with special emphasis on architecture and

design.

UNIT I INTRODUCTION AND DATA WAREHOUSING 8 + 3

Introduction, Data Warehouse, Multidimensional Data Model, Data Warehouse Architecture,

Implementation, Further Development, Data Warehousing to Data Mining

UNIT II DATA PREPROCESSING, LANGUAGE, ARCHITECTURES , CONCEPT

DESCRIPTION 8 + 3

Why Preprocessing, Cleaning, Integration, Transformation, Reduction, Discretization, Concept

Hierarchy Generation, Data Mining Primitives, Query Language, Graphical User Interfaces,

Architectures, Concept Description, Data Generalization, Characterizations, Class Comparisons,

Descriptive Statistical Measures.

UNIT III ASSOCIATION RULES 9 + 3



Association Rule Mining, Single-Dimensional Boolean Association Rules from Transactional

Databases, Multi-Level Association Rules from Transaction Databases

UNIT IV CLASSIFICATION AND CLUSTERING 12 + 3

Classification and Prediction, Issues, Decision Tree Induction, Bayesian Classification, Association

Rule Based, Other Classification Methods, Prediction, Classifier Accuracy, Cluster Analysis, Types

of data, Categorisation of methods, Partitioning methods, Outlier Analysis.

UNIT V RECENT TRENDS 8 + 3

Multidimensional Analysis and Descriptive Mining of Complex Data Objects, Spatial Databases,

Multimedia Databases, Time Series and Sequence Data, Text Databases, World Wide Web,

Applications and Trends in Data Mining

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Harcourt India / Morgan

Kauffman, 2011.

REFERENCES

1. Margaret H.Dunham, “Data Mining: Introductory and Advanced Topics”, Pearson

Education 2004.

2. Sam Anahory, Dennis Murry, “Data Warehousing in the real world”, Pearson Education

2003.

3. David Hand, Heikki Manila, Padhraic Symth, “Principles of Data Mining”, PHI 2004.

4. W.H.Inmon, “Building the Data Warehouse”, 3rd Edition, Wiley, 2003.

5. Alex Bezon, Stephen J.Smith, “Data Warehousing, Data Mining & OLAP”, MeGraw-Hill

Edition, 2001

6. Paulraj Ponniah, “Data Warehousing Fundamentals”, Wiley-Interscience Publication, 2003.



EMBEDDED SYSTEMS – CS1005

AIM

To give sufficient background for undertaking embedded systems design.

OBJECTIVES

• To introduce students to the embedded systems, its hardware and software.

• To introduce devices and buses used for embedded networking.

• To explain programming concepts and embedded programming in C and C++.

• To explain real time operating systems, inter-task communication and an exemplary case of

MUCOS – IIRTOS.

UNIT I INTRODUCTION TO EMBEDDED SYSTEMS 9 + 3

Definition and Classification – Overview of Processors and hardware units in an embedded system

– Software embedded into the system – Exemplary Embedded Systems – Embedded Systems on a

Chip (SoC) and the use of VLSI designed circuits

UNIT II DEVICES AND BUSES FOR DEVICES NETWORK 9 + 3

I/O Devices - Device I/O Types and Examples – Synchronous - Iso-synchronous and Asynchronous

Communications from Serial Devices - Examples of Internal Serial-Communication Devices -

UART and HDLC - Parallel Port Devices - Sophisticated interfacing features in Devices/Ports-

Timer and Counting Devices - ‘12C’, ‘USB’, ‘CAN’ and advanced I/O Serial high speed buses-

ISA, PCI, PCI-X, cPCI and advanced buses.

UNIT III PROGRAMMING CONCEPTS AND EMBEDDED PROGRAMM ING IN C,

C++ 9 + 3

Programming in assembly language (ALP) vs. High Level Language - C Program Elements,

Macros and functions -Use of Pointers - NULL Pointers - Use of Function Calls – Multiple

function calls in a Cyclic Order in the Main Function Pointers – Function Queues and Interrupt



Service Routines Queues Pointers – Concepts of EMBEDDED PROGRAMMING in C++ -

Objected Oriented Programming – Embedded Programming in C++, ‘C’ Program compilers –

Cross compiler – Optimization of memory codes.

UNIT IV REAL TIME OPERATING SYSTEMS – PART - 1 9 + 3

Definitions of process, tasks and threads – Clear cut distinction between functions – ISRs and tasks

by their characteristics – Operating System Services- Goals – Structures- Kernel - Process

Management – Memory Management – Device Management – File System Organisation and

Implementation – I/O Subsystems – Interrupt Routines Handling in RTOS, REAL TIME

OPERATING SYSTEMS : RTOS Task scheduling models - Handling of task scheduling and

latency and deadlines as performance metrics – Co-operative Round Robin Scheduling – Cyclic

Scheduling with Time Slicing (Rate Monotonics Co-operative Scheduling) – Preemptive

Scheduling Model strategy by a Scheduler – Critical Section Service by a Preemptive Scheduler –

Fixed (Static) Real time scheduling of tasks - INTER PROCESS COMMUNICATION AND

SYNCHRONISATION – Shared data problem – Use of Semaphore(s) – Priority Inversion Problem

and Deadlock Situations – Inter Process Communications using Signals – Semaphore Flag or

mutex as Resource key – Message Queues – Mailboxes – Pipes – Virtual (Logical) Sockets –

Remote Procedure Calls (RPCs).

UNIT V REAL TIME OPERATING SYSTEMS – PART - 2 9 + 3

Study of Micro C/OS-II or Vx Works or Any other popular RTOS – RTOS System Level Functions

– Task Service Functions – Time Delay Functions – Memory Allocation Related Functions –

Semaphore Related Functions – Mailbox Related Functions – Queue Related Functions – Case

Studies of Programming with RTOS – Understanding Case Definition – Multiple Tasks and their

functions – Creating a list of tasks – Functions and IPCs – Exemplary Coding Steps.

L=45; T=15; TOTAL= 60



TEXT BOOKS

1. Rajkamal, Embedded Systems Architecture, Programming and Design, TATA McGraw-

Hill, First reprint Oct. 2003

REFERENCES

1. Steve Heath, Embedded Systems Design, Second Edition-2003, Newnes,

2. David E.Simon, An Embedded Software Primer, Pearson Education Asia, First Indian

Reprint 2002

3. Wayne Wolf, Computers as Components; Principles of Embedded Computing System

Design – Harcourt India, Morgan Kaufman Publishers, First Indian Reprint 2001

4. Frank Vahid and Tony Givargis, Embedded Systems Design – A unified Hardware /

Software Introduction, John Wiley, 2002.



ADVANCED DATABASES – CS1006

AIM

Advanced database aims at developing computer application with different kinds of data models. It

is also deals with the Transaction management of these different databases.

OBJECTIVES

• To study the needs of different databases.

• To understand about different data models that can be used for these databases.

• To make the students to get familiarized with transaction management of the database

• To develop in-depth knowledge about web and intelligent database.

• To provide an introductory concept about the way in which data can be stored in

geographical information systems etc.,

UNIT I DISTRIBUTED DATABASES 9 + 3

Distributed DBMS Concepts and Design – Introduction – Functions and Architecture of DDBMS –

Distributed Relational Database Design – Transparency in DDBMS – Distributed Transaction

Management – Concurrency control – Deadlock Management – Database recovery – The X/Open

Distributed Transaction Processing Model – Replication servers – Distributed Query Optimisation -

Distribution and Replication in Oracle.

UNIT II OBJECT ORIENTED DATABASES 9 + 3

Object Oriented Databases – Introduction – Weakness of RDBMS – Object Oriented Concepts

Storing Objects in Relational Databases – Next Generation Database Systems – Object Oriented

Data models – OODBMS Perspectives – Persistence – Issues in OODBMS – Object Oriented

Database Management System Manifesto – Advantages and Disadvantages of OODBMS – Object

Oriented Database Design – OODBMS Standards and Systems – Object Management Group –

Object Database Standard ODMG – Object Relational DBMS –Postgres - Comparison of

ORDBMS and OODBMS.



UNIT III WEB DATABASES 9 + 3

Web Technology And DBMS – Introduction – The Web – The Web as a Database Application

Platform – Scripting languages – Common Gateway Interface – HTTP Cookies – Extending the

Web Server – Java – Microsoft’s Web Solution Platform – Oracle Internet Platform – Semi

structured Data and XML – XML Related Technologies – XML Query Languages

UNIT IV INTELLIGENT DATABASES 9 + 3

Enhanced Data Models For Advanced Applications – Active Database Concepts And Triggers –

Temporal Database Concepts – Deductive databases – Knowledge Databases.

UNIT V CURRENT TRENDS 9 + 3

Mobile Database – Geographic Information Systems – Genome Data Management – Multimedia

Database – Parallel Database – Spatial Databases - Database administration – Data Warehousing

and Data Mining.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Thomas M. Connolly, Carolyn E. Begg, “Database Systems - A Practical Approach to

Design , Implementation , and Management”, Third Edition , Pearson Education, 2009

REFERENCES

1. Ramez Elmasri & Shamkant B.Navathe, “Fundamentals of Database Systems”, Fourth

Edition , Pearson Education , 2004.

2. M.Tamer Ozsu , Patrick Ualduriel, “Principles of Distributed Database Systems”, Second

Edition, Pearso nEducation, 2003.

3. C.S.R.Prabhu, “Object Oriented Database Systems”, PHI, 2003.

4. Peter Rob and Corlos Coronel, “Database Systems – Design, Implementation and

Management”, Thompson Learning, Course Technology, 5th Edition, 2003.



INTELLECTUAL PROPERTY RIGHTS (IPR) – GE1001

UNIT I 5 + 3

Introduction – Invention and Creativity – Intellectual Property (IP) – Importance – Protection of

IPR – Basic types of property (i. Movable Property ii. Immovable Property and iii. Intellectual

Property).

UNIT II 10 + 3

IP – Patents – Copyrights and related rights – Trade Marks and rights arising from Trademark

registration – Definitions – Industrial Designs and Integrated circuits – Protection of Geographical

Indications at national and International levels – Application Procedures.

UNIT III 10 + 3

International convention relating to Intellectual Property – Establishment of WIPO – Mission and

Activities – History – General Agreement on Trade and Tariff (GATT).

UNIT IV 10 + 3

Indian Position Vs WTO and Strategies – Indian IPR legislations – commitments to WTO-Patent

Ordinance and the Bill – Draft of a national Intellectual Property Policy – Present against unfair

competition.

UNIT V 10 + 3

Case Studies on – Patents (Basumati rice, turmeric, Neem, etc.) – Copyright and related rights –

Trade Marks – Industrial design and Integrated circuits – Geographic indications – Protection

against unfair competition.



TEXT BOOKS

1. Subbaram N.R. “Handbook of Indian Patent Law and Practice “, S. Viswanathan (Printers

and Publishers) Pvt. Ltd., 1998.

2. Indian Patent Law and Practice by Kalyan C. Kankanala, Arun k. Narasani, Vinita

Radhakrishnan Publisher: Oxford University Press 2012

REFERENCES

1. Eli Whitney, United States Patent Number : 72X, Cotton Gin, March 14, 1794.

2. Intellectual Property Today : Volume 8, No. 5, May 2001, [www.iptoday.com].

3. Using the Internet for non-patent prior art searches, Derwent IP Matters, July 2000.

[www.ipmatters.net/features/000707_gibbs.html.



INDIAN CONSTITUTION AND SOCIETY - GE1002

UNIT I 9 + 3

Historical Background – Constituent Assembly of India – Philosophical foundations of the Indian

Constitution – Preamble – Fundamental Rights – Directive Principles of State Policy –

Fundamental Duties – Citizenship – Constitutional Remedies for citizens.

UNIT II 9 + 3

Union Government – Structures of the Union Government and Functions – President – Vice

President – Prime Minister – Cabinet – Parliament – Supreme Court of India – Judicial Review.

UNIT III 9 + 3

State Government – Structure and Functions – Governor – Chief Minister – Cabinet – State

Legislature – Judicial System in States – High Courts and other Subordinate Courts.

UNIT IV 9 + 3

Indian Federal System – Center – State Relations – President’s Rule – Constitutional Amendments

– Constitutional Functionaries - Assessment of working of the Parliamentary System in India.

UNIT V 9 + 3

Society : Nature, Meaning and definition; Indian Social Structure; Castle, Religion, Language in

India; Constitutional Remedies for citizens – Political Parties and Pressure Groups; Right of

Women, Children and Scheduled Castes and Scheduled Tribes and other Weaker Sections.



TEXT BOOKS

1. Durga Das Basu, “Introduction to the Constitution of India “, Prentice Hall of India, New

Delhi.

2. R.C.Agarwal, “(1997) Indian Political System “, S.Chand and Company, New Delhi.

3. Maciver and Page, “Society: An Introduction Analysis “, Mac Milan India Ltd., New Delhi.

4. K.L.Sharma, “(1997) Social Stratification in India: Issues and Themes “, Jawaharlal Nehru

University, New Delhi.

REFERENCES

1. Sharma, Brij Kishore, “Introduction to the Constitution of India:, Prentice Hall of India,

New Delhi.

2. U.R.Gahai, “(1998) Indian Political System “, New Academic Publishing House,.

3. Jalaendhar..R.N. Sharma, “Indian Social Problems “, Media Promoters and Publishers Pvt.

Ltd.

4. Yogendra Singh, “(1997) Social Stratification and Charge in India “, Manohar, New Delhi.



ELECTIVES FOR VII SEMESTER

ADVANCED OPERATING SYSTEMS - CS1007

AIM

To understand the principles in the design of modern operating systems, distributed and

multiprocessor operating systems

OBJECTIVES

• To get a comprehensive knowledge of the architecture of distributed systems.

• To understand the deadlock and shared memory issues and their solutions in distributed

environments.

• To know the security issues and protection mechanisms for distributed environments.

• To get a knowledge of multiprocessor operating system and database operating systems.

UNIT I 9 + 3

Architectures of Distributed Systems - System Architecture types - issues in distributed operating

systems - communication networks – communication primitives. Theoretical Foundations - inherent

limitations of a distributed system – lamp ports logical clocks – vector clocks – casual ordering of

messages – global state – cuts of a distributed computation – termination detection. Distributed

Mutual Exclusion – introduction – the classification of mutual exclusion and associated algorithms

– a comparative performance analysis.

UNIT II 9 + 3

Distributed Deadlock Detection -Introduction - deadlock handling strategies in distributed systems

– issues in deadlock detection and resolution – control organizations for distributed deadlock

detection – centralized and distributed deadlock detection algorithms –hierarchical deadlock

detection algorithms. Agreement protocols – introduction-the system model, a classification of

agreement problems, solutions to the Byzantine agreement problem, applications of agreement

algorithms. Distributed resource management: introduction-architecture – mechanism for building

distributed file systems – design issues – log structured file systems.



UNIT III 9 + 3

Distributed shared memory-Architecture– algorithms for implementing DSM – memory coherence

and protocols – design issues. Distributed Scheduling – introduction – issues in load distributing –

components of a load distributing algorithm – stability – load distributing algorithm – performance

comparison – selecting a suitable load sharing algorithm – requirements for load distributing -task

migration and associated issues. Failure Recovery and Fault tolerance: introduction– basic concepts

– classification of failures – backward and forward error recovery, backward error recovery-

recovery in concurrent systems – consistent set of check points – synchronous and asynchronous

check pointing and recovery – check pointing for distributed database systems- recovery in

replicated distributed databases.

UNIT IV 9 + 3

Protection and security -preliminaries, the access matrix model and its implementations.-safety in

matrix model- advanced models of protection. Data security – cryptography: Model of

cryptography, conventional cryptography- modern cryptography, private key cryptography, data

encryption standard- public key cryptography – multiple encryption – authentication in distributed

systems.

UNIT-V 9 + 3

Multiprocessor operating systems - basic multiprocessor system architectures – inter connection

networks for multiprocessor systems – caching – hypercube architecture. Multiprocessor Operating

System - structures of multiprocessor operating system, operating system design issues- threads-

process synchronization and scheduling.

Database Operating systems :Introduction- requirements of a database operating system

Concurrency control : theoretical aspects – introduction, database systems – a concurrency control

model of database systems- the problem of concurrency control – serializability theory- distributed

database systems, concurrency control algorithms – introduction, basic synchronization primitives,

lock based algorithms-timestamp based algorithms, optimistic algorithms – concurrency control

algorithms, data replication.

L=45; T=15; TOTAL= 60



TEXT BOOKS

1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating systems:

Distributed, Database and multiprocessor operating systems", TMH, 2001

REFERENCES

1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003

2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.

3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003



REAL TIME SYSTEMS - CS1008

AIM

To understand the basic concepts, design and integration of Real Time Systems.

OBJECTIVES

• To know about the specification and design techniques of a Real Time System.

• To understand about real time task communication and synchronization

• To have a vast knowledge of queuing models and Real Time System integration.

UNIT I BASIC REAL TIME CONCEPTS 9 + 3

Basic computer architecture – some terminology - real time design issues – example real time

systems – input and output – other devices – language features.

UNIT II REAL TIME SPECIFICATION AND DESIGN TECHNI QUES 9 + 3

Natural languages – mathematical specification – flow charts – structured charts – pseudocode and

programming design languages – finite state automata – data flow diagrams – petri nets – Warnier

Orr notation – state charts – polled loop systems – phase / sate driven code – coroutines – interrupt

– driven systems – foreground/background system – full featured real time operating systems

UNIT III INTERTASK COMMUNICATION AND SYNCHRONIZATIO N 9 + 3

Buffering data – mailboxes – critical regions – semaphores – deadlock – process stack management

– dynamic allocation – static schemes – response time calculation – interrupt latency – time loading

and its measurement – scheduling is NP complete – reducing response times and time loading –

analysis of memory requirements – reducing memory loading – I/O performance



UNIT IV QUEUING MODELS 9 + 3

Probability functions – discrete- basic buffering calculation – classical queuing theory – little's law

– erlong's formula – faults, failures, bugs and effects – reliability-testing – fault tolerance –

classification of architecture – distributing systems – Non Von Neuman architecture

UNIT V HARDWARE/SOFTWARE INTEGRATION 9 + 3

Goals of real time system integration – tools - methodology -software Heinsberg uncertainity

principle – real time applications

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Philip A.Laplante, “Real time system design and analysis – an engineer's handbook 2006

wiley India Pvt Ltd.,

REFERENCES

1. C.M.Krishna and Kang G Shin, "Real time systems", TMH, 2009

2. Stuart Bennelt, "Real time computer control – and introduction", Pearson education, 2003.

3. Allen Burns, Andy Wellings, “Real Time Systems and Programming Languages”, Pearson

Education, 2003.



TCP / IP DESIGN AND IMPLEMENTATION - CS1009

AIM

Having learned about computer networks, this subject helps the students to learn TCP/IP protocol

indepth considering design alternatives and implementation techniques.

OBJECTIVES

• To understand the internals of the TCP/IP protocols

• To understand how TCP/IP is actually implemented

• To understand the interaction among the protocols in a protocol stack.

UNIT I INTRODUCTION 9 + 3

Internetworking concepts and architectural model- classful Internet address – CIDR-Subnetting and

Supernetting –ARP- RARP- IP – IP Routing –ICMP – Ipv6

UNIT II TCP 9 + 3

Services – header – connection establishment and termination- interactive data flow- bulk data

flow- timeout and retransmission – persist timer - keepalive timer- futures and performance

UNIT III IP IMPLEMENTATION 9 + 3

IP global software organization – routing table- routing algorithms-fragmentation and reassembly-

error processing (ICMP) –Multicast Processing (IGMP)

UNIT IV TCP IMPLEMENTATION I 9 + 3

Data structure and input processing – transmission control blocks- segment format- comparison-

finite state machine implementation-Output processing- mutual exclusion-computing the TCP data

length



UNIT V TCP IMPLEMENTATION II 9 + 3

Timers-events and messages- timer process- deleting and inserting timer event- flow control and

adaptive retransmission-congestion avoidance and control – urgent data processing and push

function.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Douglas E.Comer – “Internetworking with TCP/IP Principles, Protocols and Architecture”,

Vol. 1 & 2 fourth edition, PHI 2010.

(Unit I in Comer Vol. I, Units II, IV & V – Comer Vol. II )

2. W.Richard Stevens “TCP/IP illustrated” Volume 1 Pearson Education, 2012 (Unit II )

REFERENCES

1. TCP/IP protocol suite, Forouzan, 2nd edition, TMH, 2003

2. W.Richard Stevens “TCP/IP illustrated” Volume 2 Pearson Education 2003.



C # AND .NET FRAMEWORK - CS1010

AIM

To cover the fundamental concepts of the C# language and the .NET framework.

OBJECTIVE

• The student will gain knowledge in the concepts of the .NET framework as a whole and the

technologies that constitute the framework.

• The student will gain programming skills in C# both in basic and advanced levels.

• By building sample applications, the student will get experience and be ready for large-scale

projects.

UNIT I INTRODUCTION TO C# 8 + 3

Introducing C#, Understanding .NET, Overview of C#, Literals, Variables, Data Types, Operators,

Expressions, Branching, Looping, Methods, Arrays, Strings, Structures, Enumerations.

UNIT II OBJECT ORIENTED ASPECTS OF C# 9 + 3

Classes, Objects, Inheritance, Polymorphism, Interfaces, Operator Overloading, Delegates, Events,

Errors and Exceptions.

UNIT III APPLICATION DEVELOPMENT ON .NET 8 + 3

Building Windows Applications, Accessing Data with ADO.NET.

UNIT IV WEB BASED APPLICATION DEVELOPMENT ON .NET 8 + 3

Programming Web Applications with Web Forms, Programming Web Services.



UNIT V THE CLR AND THE .NET FRAMEWORK 12 + 3

Assemblies, Versioning, Attributes, Reflection, Viewing MetaData, Type Discovery, Reflecting on

a Type, Marshaling, Remoting, Understanding Server Object Types, Specifying a Server with an

Interface, Building a Server, Building the Client, Using SingleCall, Threads.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. E. Balagurusamy, “Programming in C#”, Tata McGraw-Hill, 2010 (Unit I, II)

2. J. Liberty, “Programming C#”, 2nd ed., O’Reilly, 2008. (Unit III, IV, V)

REFERENCES

1. Herbert Schildt, “The Complete Reference: C#”, Tata McGraw-Hill, 2004.

2. Robinson et al, “Professional C#”, 2nd ed., Wrox Press, 2002.

3. Andrew Troelsen, “C# and the .NET Platform”, A! Press, 2003.

4. S. Thamarai Selvi, R. Murugesan, “A Textbook on C#”, Pearson Education, 2003.



SYSTEM MODELING AND SIMULATION - CS1011

AIM

To build knowledge on system modeling and system study on various applications.

OBJECTIVES

• To provide a strong foundation on concept of simulation, and modeling.

• To understand the techniques of random number generations.

• To understand the techniques of testing randomness.

• To design simulation models for various case studies like inventory, traffic flow networks,

etc.

• To practice on simulation tools and impart knowledge on building simulation systems.


Systems, modeling, general systems theory, Concept of simulation, Simulation as a decision

making tool, types of simulation.

UNIT II RANDOM NUMBERS 9 + 3

Pseudo random numbers, methods of generating random variables, discrete and continuous

distributions, testing of random numbers.

UNIT III DESIGN OF SIMULATION EXPERIMENTS 10 + 3

Problem formulation, data collection and reduction, time flow mechanism, key variables, logic flow

chart, starting condition, run size, experimental design consideration, output analysis and

interpretation validation.

UNIT I V SIMULATION LANGUAGES 8 + 3

Comparison and selection of simulation languages, study of anyone simulation language.



UNIT V CASE STUDIES 10 + 3

Development of simulation models using simulation language studied for systems like queuing

systems, Production systems, Inventory systems, maintenance and replacement systems and

Investment analysis.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Geoffrey Gordon, “System Simulation”, 2nd Edition, Prentice Hall, India, 2011

2. Narsingh Deo, “System Simulation with Digital Computer, “Prentice Hall, India, 2009.

REFERENCES

1. Jerry Banks and John S.Carson, Barry L. Nelson, David M.Nicol, “Discrete Event System

Simulation”, 3rd Edition, Prentice Hall, India, 2002.

2. Shannon, R.E. Systems simulation, The art and science, Prentice Hall, 1975.

3. Thomas J. Schriber, Simulation using GPSS, John Wiley, 1991.



CRYPTOGRAPHY AND NETWORK SECURITY - IT1352

AIM

To understand the principles of encryption algorithms; conventional and public key cryptography.

To have a detailed knowledge about authentication, hash functions and application level security

mechanisms.

OBJECTIVES

• To know the methods of conventional encryption.

• To understand the concepts of public key encryption and number theory

• To understand authentication and Hash functions.

• To know the network security tools and applications.

• To understand the system level security used.


OSI Security Architecture - Classical Encryption techniques – Cipher Principles – Data Encryption

Standard – Block Cipher Design Principles and Modes of Operation - Evaluation criteria for AES –

AES Cipher – Triple DES – Placement of Encryption Function – Traffic Confidentiality

UNIT II PUBLIC KEY CRYPTOGRAPHY 10 + 3

Key Management - Diffie-Hellman key Exchange – Elliptic Curve Architecture and Cryptography -

Introduction to Number Theory – Confidentiality using Symmetric Encryption – Public Key

Cryptography and RSA.

UNIT III AUTHENTICATION AND HASH FUNCTION 9 + 3

Authentication requirements – Authentication functions – Message Authentication Codes – Hash

Functions – Security of Hash Functions and MACs – MD5 message Digest algorithm - Secure

Hash Algorithm – RIPEMD – HMAC Digital Signatures – Authentication Protocols – Digital

Signature Standard



UNIT IV NETWORK SECURITY 8 + 3

Authentication Applications: Kerberos – X.509 Authentication Service – Electronic Mail Security –

PGP – S/MIME - IP Security – Web Security.

UNIT V SYSTEM LEVEL SECURITY 8 + 3

Intrusion detection – password management – Viruses and related Threats – Virus Counter

measures – Firewall Design Principles – Trusted Systems.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. William Stallings, “Cryptography And Network Security – Principles and Practices”,

Pearson Education, 2011

REFERENCES

1. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.

2. Bruce Schneier, “Applied Cryptography”, John Wiley & Sons Inc, 2001.

3. Charles B. Pfleeger, Shari Lawrence Pfleeger, “Security in Computing”, Third Edition,

Pearson Education, 2003.



NATURAL LANGUAGE PROCESSING - CS1012

AIM

The aim is to expose the students to the basic principles of language processing and typical

applications of natural language processing systems

OBJECTIVE

• To provide a general introduction including the use of state automata for language

processing

• To provide the fundamentals of syntax including a basic parse

• To explain advanced feature like feature structures and realistic parsing methodologies

• To explain basic concepts of remotes processing

• To give details about a typical natural language processing applications


Introduction: Knowledge in speech and language processing – Ambiguity – Models and Algorithms

– Language, Thought and Understanding. Regular Expressions and automata: Regular expressions

– Finite-State automata. Morphology and Finite-State Transducers: Survey of English morphology

– Finite-State Morphological parsing – Combining FST lexicon and rules – Lexicon-Free FSTs:

The porter stammer – Human morphological processing.

UNIT II SYNTAX 10 + 3

Word classes and part-of-speech tagging: English word classes – Tag sets for English – Part-of-

speech tagging – Rule-based part-of-speech tagging – Stochastic part-of-speech tagging –

Transformation-based tagging – Other issues. Context-Free Grammars for English: Constituency –

Context-Free rules and trees – Sentence-level constructions – The noun phrase – Coordination –

Agreement – The verb phase and sub categorization – Auxiliaries – Spoken language syntax –

Grammars equivalence and normal form – Finite-State and Context-Free grammars – Grammars

and human processing. Parsing with Context-Free Grammars: Parsing as search – A Basic Top-

Down parser – Problems with the basic Top-Down parser – The early algorithm – Finite-State

parsing methods.



UNIT III ADVANCED FEATURES AND SYNTAX 1 1 + 3

Features and Unification: Feature structures – Unification of feature structures – Features structures

in the grammar – Implementing unification – Parsing with unification constraints – Types and

Inheritance. Lexicalized and Probabilistic Parsing: Probabilistic context-free grammar – problems

with PCFGs – Probabilistic lexicalized CFGs – Dependency Grammars – Human parsing.

UNIT IV SEMANTIC 10 + 3

Representing Meaning: Computational desiderata for representations – Meaning structure of

language – First order predicate calculus – Some linguistically relevant concepts – Related

representational approaches – Alternative approaches to meaning. Semantic Analysis: Syntax-

Driven semantic analysis – Attachments for a fragment of English – Integrating semantic analysis

into the early parser – Idioms and compositionality – Robust semantic analysis. Lexical semantics:

relational among lexemes and their senses – WordNet: A database of lexical relations – The

Internal structure of words – Creativity and the lexicon.

UNIT V APPLICATIONS 8 + 3

Word Sense Disambiguation and Information Retrieval: Selectional restriction-based

disambiguation – Robust word sense disambiguation – Information retrieval – other information

retrieval tasks. Natural Language Generation: Introduction to language generation – Architecture

for generation – Surface realization – Discourse planning – Other issues. Machine Translation:

Language similarities and differences – The transfer metaphor – The interlingua idea: Using

meaning – Direct translation – Using statistical techniques – Usability and system development.

L=45; T=15; TOTAL= 60



TEXT BOOKS

1. Daniel Jurafsky & James H.Martin, “ Speech and Language Processing”, Pearson Education

(Singapore) Pte. Ltd., 2002.

REFERENCES

1. James Allen, “Natural Language Understanding”, Pearson Education, 2003.



ADVANCED COMPUTER ARCHITECTURE - CS1013

AIM

To do an advanced study of the Instruction Set Architecture, Instruction Level Parallelism with

hardware and software approaches, Memory and I/O systems and different multiprocessor

architectures with an analysis of their performance.

OBJECTIVES

• To study the ISA design, instruction pipelining and performance related issues.

• To do a detailed study of ILP with dynamic approaches.

• To do a detailed study of ILP with software approaches.

• To study the different multiprocessor architectures and related issues.

• To study the Memory and I/O systems and their performance issues.


Fundamentals of Computer Design – Measuring and reporting performance – Quantitative

principles of computer design. Instruction set principles – Classifying ISA – Design issues.

Pipelining – Basic concepts – Hazards – Implementation – Multicycle operations.

UNIT II INSTRUCTION LEVEL PARALLELISM WITH DYNAMIC APPROACHES

9 + 3

Concepts – Dynamic Scheduling – Dynamic hardware prediction – Multiple issue – Hardware

based speculation – Limitations of ILP.

UNIT III INSTRUCTION LEVEL PARALLELISM WITH SO FTWARE APPROACHES

9 + 3

Compiler techniques for exposing ILP – Static branch prediction – VLIW – Advanced compiler

support – Hardware support for exposing more parallelism – Hardware versus software speculation

mechanisms.



UNIT IV MEMORY AND I/O 9 + 3

Cache performance – Reducing cache miss penalty and miss rate – Reducing hit time – Main

memory and performance – Memory technology. Types of storage devices – Buses – RAID –

Reliability, availability and dependability – I/O performance measures – Designing an I/O system.

UNIT V MULTIPROCSSORS AND THREAD LEVEL PARALLELI SM 9 + 3

Symmetric and distributed shared memory architectures – Performance issues – Synchronization –

Models of memory consistency – Multithreading.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. John L. Hennessey and David A. Patterson," Computer Architecture: A Quantitative Approach", Third Edition, Elsevier 2011.

REFERNCES 1. D. Sima, T. Fountain and P. Kacsuk, " Advanced Computer Architectures: A Design Space Approach", Pearson 2002.

2. Kai Hwang " Advanced computer architecture Parallelism Scalability Programmability" Tata Mcgraw Hill Edition 2001.

3. Vincent P.Heuring, Harry F.Jordan, “ Computer System Design and Architecture” ,



INFORMATION SECURITY - CS1014

AIM

To study the critical need for ensuring Information Security in Organizations

OBJECTIVES

• To understand the basics of Information Security

• To know the legal, ethical and professional issues in Information Security

• To know the aspects of risk management

• To become aware of various standards in this area

• To know the technological aspects of Information Security

UNIT 1 INTRODUCTION 9 + 3

History, what is Information Security, Critical Characteristics of Information, NSTISSC Security

Model, Components of an Information System, Securing the Components, Balancing Security and

Access, The SDLC, The Security SDLC

UNIT II SECURITY INVESTIGATION 9 + 3

Need for Security, Business Needs, Threats, Attacks, Legal, Ethical and Professional Issues

UNIT III SECURITY ANALYSIS 9 + 3

Risk Management: Identifying and Assessing Risk, Assessing and Controlling Risk

UNIT IV LOGICAL DESIGN 9 + 3

Blueprint for Security, Information Security Poicy, Standards and Practices, ISO 17799/BS 7799,

NIST Models, VISA International Security Model, Design of Security Architecture, Planning for

Continuity



UNIT V PHYSICAL DESIGN 9 + 3

Security Technology, IDS, Scanning and Analysis Tools, Cryptography, Access Control Devices,

Physical Security, Security and Personnel

L=45; T=15; TOTAL= 60

TEXT BOOKS:

1. Michael E Whitman and Herbert J Mattord, “Principles of Information Security”, Cengage

Learning India 2011.

1. Micki Krause, Harold F. Tipton, “Handbook of Information Security Management”, Vol 1-3

CRC Press LLC, 2004.

2. Stuart Mc Clure, Joel Scrambray, George Kurtz, “Hacking Exposed”, Tata McGraw-Hill,

2003

3. Matt Bishop, “Computer Security Art and Science”, Pearson/PHI, 2002.



USER INTERFACE DESIGN - CS1015

AIM

To implement the basics and in-depth knowledge about UID. It enables the students to take up the

design the user interface, design, menu creation and windows creation and connection between

menu and windows.

OBJECTIVES

• To study the concept of menus, windows, interfaces.

• To study about business functions.

• To study the characteristics and components of windows.

• To study the various controls for the windows.

• To study about various problems in windows design with color, text, graphics.

• To study the testing methods

UNIT I 8 + 3

Introduction-Importance-Human-Computer interface-characteristics of graphics interface-Direct

manipulation graphical system - web user interface-popularity-characteristic & principles.

UNIT II 10 + 3

User interface design process- obstacles-usability-human characteristics in design - Human

interaction speed-business functions-requirement analysis-Direct-Indirect methods-basic business

functions-Design standards-system timings - Human consideration in screen design - structures of

menus - functions of menus-contents of menu-formatting -phrasing the menu - selecting menu

choice-navigating menus-graphical menus.



UNIT III 9 + 3

Windows: Characteristics-components-presentation styles-types-managements-organizations-

operations-web systems-device-based controls: characteristics-Screen -based controls: operate

control - text boxes-selection control-combination control-custom control-presentation control.

UNIT IV 9 + 3

Text for web pages - effective feedback-guidance & assistance-Internationalization-accesssibility-

Icons-Image-Multimedia -coloring.

UNIT V 9 + 3

Windows layout-test :prototypes - kinds of tests - retest - Information search - visualization -

Hypermedia - www - Software tools.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Wilbent. O. Galitz ,“The Essential Guide to User Interface Design”, John Wiley& Sons,

2002.

REFERENCES

1. Ben Sheiderman, “Design the User Interface”, Pearson Education, 1998.

2. Alan Cooper, “The Essential of User Interface Design”, Wiley – Dream Tech Ltd., 2002.



GRAPH THEORY - CS1016

AIM

To provide fundamental ideas on graph theory required for the study of Computer Science.

OBJECTIVES

• Understand basic notions of Graph Theory

• Knowing Fundamental Theorems in Graph Theory

• Study of algorithmic Graph Theory

UNIT I 9 + 3

Graphs – Introduction – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness –

Components – Euler Graphs – Hamiltonian Paths and Circuits – Trees – Properties of trees –

Distance and Centers in Tree – Rooted and Binary Trees.

UNIT II 9 + 3

Spanning trees – Fundamental Circuits –Spanning Trees in a Weighted Graph – Cut Sets –

Properties of Cut Set – All Cut Sets – Fundamental Circuits and Cut Sets – Connectivity and

Separability – Network flows – 1-Isomorphism – 2-Isomorphism – Combinational and Geometric

Graphs – Planer Graphs – Different Representation of a Planer Graph.

UNIT III 9 + 3

Incidence matrix – Submatrices – Circuit Matrix – Path Matrix – Adjacency Matrix – Chromatic

Number – Chromatic partitioning – Chromatic polynomial - Matching - Covering – Four Color

Problem – Directed Graphs – Types of Directed Graphs – Digraphs and Binary Relations –

Directed Paths and Connectedness – Euler Graphs – Adjacency Matrix of a Digraph.



UNIT IV 9 + 3

Algorithms: Connectedness and Components – Spanning tree – Finding all Spanning Trees of a

Graph –Set of Fundamental Circuits – Cut Vertices and Separability – Directed Circuits.

UNIT V 9 + 3

Algorithms: Shortest Path Algorithm – DFS – Planarity Testing – Isomorphism

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Narsingh Deo, “Graph Theory: With Application to Engineering and Computer Science”,

PHI, 2009.

REFERENCES

1. R.J. Wilson, “Introduction to Graph Theory”, Fourth Edition, Pearson Education, 2003.



TOTAL QUALITY MANAGEMENT - MG1401

OBJECTIVE

• To understand the Total Quality Management concept and principles and the various tools

available to achieve Total Quality Management.

• To understand the statistical approach for quality control.

• To create an awareness about the ISO and QS certification process and its need for the

industries.

1. INTRODUCTION 9 + 3

Definition of Quality, Dimensions of Quality, Quality Planning, Quality costs - Analysis

Techniques for Quality Costs, Basic concepts of Total Quality Management, Historical Review,

Principles of TQM, Leadership – Concepts, Role of Senior Management, Quality Council, Quality

Statements, Strategic Planning, Deming Philosophy, Barriers to TQM Implementation.

2. TQM PRINCIPLES 9 + 3

Customer satisfaction – Customer Perception of Quality, Customer Complaints, Service Quality,

Customer Retention, Employee Involvement – Motivation, Empowerment, Teams, Recognition and

Reward, Performance Appraisal, Benefits, Continuous Process Improvement – Juran Trilogy,

PDSA Cycle, 5S, Kaizen, Supplier Partnership – Partnering, sourcing, Supplier Selection, Supplier

Rating, Relationship Development, Performance Measures – Basic Concepts, Strategy,

Performance Measure.

3. STATISTICAL PROCESS CONTROL (SPC) 9 + 3

The seven tools of quality, Statistical Fundamentals – Measures of central Tendency and

Dispersion, Population and Sample, Normal Curve, Control Charts for variables and attributes,

Process capability, Concept of six sigma, New seven Management tools.



4. TQM TOOLS 9 + 3

Benchmarking – Reasons to Benchmark, Benchmarking Process, Quality Function Deployment

(QFD) – House of Quality, QFD Process, Benefits, Taguchi Quality Loss Function, Total

Productive Maintenance (TPM) – Concept, Improvement Needs, FMEA – Stages of FMEA.

5. QUALITY SYSTEMS 9 + 3

Need for ISO 9000 and Other Quality Systems, ISO 9000:2000 Quality System – Elements,

Implementation of Quality System, Documentation, Quality Auditing, TS 16949, ISO 14000 –

Concept, Requirements and Benefits.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Dale H.Besterfiled, et al., Total Quality Management, Pearson Education, Inc. 2003. (Indian

reprint 2004). ISBN 81-297-0260-6.

REFERENCES

1. James R.Evans & William M.Lidsay, The Management and Control of Quality, (5th

Edition), South-Western (Thomson Learning), 2002 (ISBN 0-324-06680-5).

2. B Valarmathi, N Srinivasa Gupta. “Total Quality Management, McGraw-Hill, 2009

3. Oakland.J.S. “Total Quality Management Butterworth – Publisher: Elsevier Butterworth-

Heinemann Released: 06-2004

4. Narayana V. and Sreenivasan, N.S. Quality Management – Concepts and Tasks, New Age

International 1996.

5. Zeiri. “Total Quality Management for Engineers Wood Head Publishers, 1991.



OBJECT ORIENTED ANALYSIS AND DESIGN CS1017

AIM

To understand the concepts of object oriented analysis and design.

OBJECTIVES

• To understand the object oriented life cycle.

• To know how to identify objects, relationships, services and attributes through UML.

• To understand the use-case diagrams.

• To know the Object Oriented Design process.

• To know about software quality and usability.


An Overview of Object Oriented Systems Development - Object Basics – Object Oriented Systems

Development Life Cycle.

UNIT II OBJECT ORIENTED METHODOLOGIES 12 + 3

Rumbaugh Methodology - Booch Methodology - Jacobson Methodology - Patterns – Frameworks

– Unified Approach – Unified Modeling Language – Use case - class diagram - Interactive

Diagram - Package Diagram - Collaboration Diagram - State Diagram - Activity Diagram.

UNIT III OBJECT ORIENTED ANALYSIS 9 + 3

Identifying use cases - Object Analysis - Classification – Identifying Object relationships -

Attributes and Methods.

UNIT IV OBJECT ORIENTED DESIGN 8 + 3

Design axioms - Designing Classes – Access Layer - Object Storage - Object Interoperability.



UNIT V SOFTWARE QUALITY AND USABILITY 8 + 3

Designing Interface Objects – Software Quality Assurance – System Usability - Measuring User

Satisfaction

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw-Hill, 2008 (Unit I,

III, IV, V).

2. Martin Fowler, “UML Distilled”, Second Edition, PHI/Pearson Education, 2002. (UNIT II)

REFERENCES

1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw-

Hill, 2003.

2. James Rumbaugh, Ivar Jacobson, Grady Booch “The Unified Modeling Language

Reference Manual”, Pearson, 2005.

3. Hans-Erik Eriksson, Magnus Penker, Brain Lyons, David Fado, “UML Toolkit”, OMG

Press Wiley Publishing Inc., 2004.



ELECTIVES FOR VIII SEMESTER

PARALLEL COMPUTING - CS1018

AIM

To study the scalability & clustering issues, understand the technologies used for parallel

computation, study the different inter connection networks and the different software programming

models.

OBJECTIVES

• To study the scalability and clustering issues and the technology necessary for them.

• To understand the technologies enabling parallel computing.

• To study the different types of interconnection networks.

• To study the different parallel programming models.

• To study the software support needed for shared memory programming.

UNIT I SCALABILITY AND CLUSTERING 9 + 3

Evolution of Computer Architecture – Dimensions of Scalability – Parallel Computer Models –

Basic Concepts Of Clustering – Scalable Design Principles – Parallel Programming Overview –

Processes, Tasks and Threads – Parallelism Issues – Interaction / Communication Issues –

Semantic Issues In Parallel Programs.

UNIT II ENABLING TECHNOLOGIES 9 + 3

System Development Trends – Principles of Processor Design – Microprocessor Architecture

Families – Hierarchical Memory Technology – Cache Coherence Protocols – Shared Memory

Consistency – Distributed Cache Memory Architecture – Latency Tolerance Techniques –

Multithreaded Latency Hiding.



UNIT III SYSTEM INTERCONNECTS 9 + 3

Basics of Interconnection Networks – Network Topologies and Properties – Buses, Crossbar and

Multistage Switches, Software Multithreading – Synchronization Mechanisms.

UNIT IV PARALLEL PROGRAMMING 9 + 3

Paradigms And Programmability – Parallel Programming Models – Shared Memory Programming.

UNIT V MESSAGE PASSING PROGRAMMING 9 + 3

Message Passing Paradigm – Message Passing Interface – Parallel Virtual Machine.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Kai Hwang and Zhi.Wei Xu, “Scalable Parallel Computing”, Tata McGraw-Hill, New

Delhi, 2003.

REFERENCES

1. David E. Culler & Jaswinder Pal Singh, “Parallel Computing Architecture: A

Hardware/Software Approach”, Morgan Kaufman Publishers, 1999.

2. Michael J. Quinn, “Parallel Programming in C with MPI & OpenMP”, Tata McGraw-Hill,

New Delhi, 2003.

3. Kai Hwang, “Advanced Computer Architecture” Tata McGraw-Hill, New Delhi, 2003.



SOFT COMPUTING - CS1019

AIM

To introduce the techniques of soft computing and adaptive neuro-fuzzy inferencing systems which

differ from conventional AI and computing in terms of its tolerance to imprecision and uncertainty.

OBJECTIVES

• To introduce the ideas of fuzzy sets, fuzzy logic and use of heuristics based on human

experience

• To become familiar with neural networks that can learn from available examples and

generalize to form appropriate rules for inferencing systems

• To provide the mathematical background for carrying out the optimization associated with

neural network learning

• To familiarize with genetic algorithms and other random search procedures useful while

seeking global optimum in self-learning situations

• To introduce case studies utilizing the above and illustrate the intelligent behavior of

programs based on soft computing

UNIT I FUZZY SET THEORY 10 + 3

Introduction to Neuro – Fuzzy and Soft Computing – Fuzzy Sets – Basic Definition and

Terminology – Set-theoretic Operations – Member Function Formulation and Parameterization –

Fuzzy Rules and Fuzzy Reasoning – Extension Principle and Fuzzy Relations – Fuzzy If-Then

Rules – Fuzzy Reasoning – Fuzzy Inference Systems – Mamdani Fuzzy Models – Sugeno Fuzzy

Models – Tsukamoto Fuzzy Models – Input Space Partitioning and Fuzzy Modeling.

UNIT II OPTIMIZATION 8 + 3

Derivative-based Optimization – Descent Methods – The Method of Steepest Descent – Classical

Newton’s Method – Step Size Determination – Derivative-free Optimization – Genetic Algorithms

– Simulated Annealing – Random Search – Downhill Simplex Search.



UNIT III NEURAL NETWORKS 10 + 3

Supervised Learning Neural Networks – Perceptrons - Adaline – Backpropagation Mutilayer

Perceptrons – Radial Basis Function Networks – Unsupervised Learning Neural Networks –

Competitive Learning Networks – Kohonen Self-Organizing Networks – Learning Vector

Quantization – Hebbian Learning.

UNIT IV NEURO FUZZY MODELING 9 + 3

Adaptive Neuro-Fuzzy Inference Systems – Architecture – Hybrid Learning Algorithm – Learning

Methods that Cross-fertilize ANFIS and RBFN – Coactive Neuro Fuzzy Modeling – Framework

Neuron Functions for Adaptive Networks – Neuro Fuzzy Spectrum.

UNIT V APPLICATIONS OF COMPUTATIONAL INTELLIGENCE 8 + 3

Printed Character Recognition – Inverse Kinematics Problems – Automobile Fuel Efficiency

Prediction – Soft Computing for Color Recipe Prediction.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. J.S.R.Jang, C.T.Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, PHI, 2004,

Pearson Education 2004.

REFERENCES

. Timothy J.Ross,”Fuzzy Logic with Engineering Application “, Wiley 2011.

3. Davis E.Goldberg,”Genetic Algorithms:Search, Optimization and Machine Learning” Pearson 2002.

4. S.Rajasekaran and G.A.V.Pai,”Neural Networks, Fuzzy Logic and Genetic Algorithms”,PHI, 2003.

5. R.Eberhart, P.simpson and R.Dobbins,”Computional Intelligence” PC Tools”,AP

Professional,Boston 1996.



HIGH SPEED NETWORKS - EC1008

AIM

To highlight the features of different technologies involved in High Speed Networking and their

performance.

OBJECTIVES

• Students will get an introduction about ATM and Frame relay.

• Students will be provided with an up-to-date survey of developments in High Speed

Networks.

• Enable the students to know techniques involved to support real-time traffic and congestion

control.

• Students will be provided with different levels of quality of service (Q.S) to different

applications.

UNIT I HIGH SPEED NETWORKS 8 + 3

Frame Relay Networks – Asynchronous transfer mode – ATM Protocol Architecture, ATM logical

Connection, ATM Cell – ATM Service Categories – AAL. High Speed LAN’s: Fast Ethernet,

Gigabit Ethernet, Fibre Channel – Wireless LAN’s: applications, requirements – Architecture of

802.11

UNIT II CONGESTION AND TRAFFIC MANAGEMENT 8 + 3

Queuing Analysis- Queuing Models – Single Server Queues – Effects of Congestion – Congestion

Control – Traffic Management – Congestion Control in Packet Switching Networks – Frame Relay

Congestion Control.



UNIT III TCP AND ATM CONGESTION CONTROL 12 + 3

TCP Flow control – TCP Congestion Control – Retransmission – Timer Management –

Exponential RTO backoff – KARN’s Algorithm – Window management – Performance of TCP

over ATM.

Traffic and Congestion control in ATM – Requirements – Attributes – Traffic Management Frame

work, Traffic Control – ABR traffic Management – ABR rate control, RM cell formats, ABR

Capacity allocations – GFR traffic management.

UNIT IV INTEGRATED AND DIFFERENTIATED SERVICES 8 + 3

Integrated Services Architecture – Approach, Components, Services- Queuing Discipline, FQ, PS,

BRFQ, GPS, WFQ – Random Early Detection, Differentiated Services

UNIT V PROTOCOLS FOR QOS SUPPORT 8 + 3

RSVP – Goals & Characteristics, Data Flow, RSVP operations, Protocol Mechanisms –

Multiprotocol Label Switching – Operations, Label Stacking, Protocol details – RTP – Protocol

Architecture, Data Transfer Protocol, RTCP.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. William Stallings, “HIGH SPEED NETWORKS AND INTERNET”, Pearson Education,

Second Edition, 2002. [Chapter – 4-6, 8, 10, 12, 13, 17,18]

REFERENCES

1. Warland & Pravin Varaiya, “HIGH PERFORMANCE COMMUNICATION

NETWORKS”, Jean Harcourt Asia Pvt. Ltd., II Edition, 2001.

2. Irvan Pepelnjk, Jim Guichard and Jeff Apcar, “MPLS and VPN architecture”, Cisco Press,

Volume 1 and 2, 2003



DIGITAL IMAGE PROCESSING - EC1009

AIM

To introduce the student to various image processing techniques.

OBJECTIVES

• To study the image fundamentals and mathematical transforms necessary for image

processing.

• To study the image enhancement techniques

• To study image restoration procedures.

• To study the image compression procedures.

• To study the image segmentation and representation techniques.

UNIT I: DIGITAL IMAGE FUNDAMENTALS AND TRANSFORMS 9 + 3

Elements of visual perception – Image sampling and quantization Basic relationship between pixels

– Basic geometric transformations-Introduction to Fourier Transform and DFT – Properties of 2D

Fourier Transform – FFT – Separable Image Transforms -Walsh – Hadamard – Discrete Cosine

Transform, Haar, Slant – Karhunen – Loeve transforms.

UNIT II : IMAGE ENHANCEMENT TECHNIQUES 9 + 3

Spatial Domain methods: Basic grey level transformation – Histogram equalization – Image

subtraction – Image averaging –Spatial filtering: Smoothing, sharpening filters – Laplacian filters –

Frequency domain filters: Smoothing – Sharpening filters – Homomorphic filtering.

UNIT III IMAGE RESTORATION 9 + 3

Model of Image Degradation/restoration process – Noise models – Inverse filtering -Least mean

square filtering – Constrained least mean square filtering – Blind image restoration – Pseudo

inverse – Singular value decomposition.



UNIT IV IMAGE COMPRESSION 9 + 3

Lossless compression: Variable length coding – LZW coding – Bit plane coding- predictive coding-

DPCM.

Lossy Compression: Transform coding – Wavelet coding – Basics of Image compression standards:

JPEG, MPEG,Basics of Vector quantization.

UNIT V IMAGE SEGMENTATION AND REPRESENTATION 9 + 3

Edge detection –Thresholding - Region Based segmentation – Boundary representation: chair

codes- Polygonal approximation –Boundary segments –boundary descriptors: Simple descriptors-

Fourier descriptors - Regional descriptors –Simple descriptors- Texture

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Rafael C Gonzalez, Richard E Woods 2nd Edition, Digital Image Processing - Pearson

Education 2003.

REFERENCES

1. William K Pratt, Digital Image Processing John Willey (2001)

2. Image Processing Analysis and Machine Vision – Millman Sonka, Vaclav hlavac, Roger

Boyle, Broos/colic, Thompson Learniy (1999).

3. A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing.

4. Chanda Dutta Magundar – Digital Image Processing and Applications, Prentice Hall of

India, 2000



ROBOTICS - CS1020

AIM

Robots are slowly and steadily replacing human beings in many fields. The aim of this course is to

introduce the students into this area so that they could use the same when they enter the industries.

OBJECTIVES

The course has been so designed to give the students an overall view of the mechanical

components:

• The mathematics associated with the same.

• Actuators and sensors necessary for the functioning of the robot.

UNIT I ROBOTIC MANIPULATION 8 + 3

Robotic manipulation – Automation and Robots – Robot Classification – Applications – Robot

Specifications – Notation. Direct Kinematics: The ARM Equation – Dot and Cross products –

Coordinate frames – Rotations – Homogeneous coordinates – Link coordinates – The arm equation

– A five-axis articulated robot (Rhino XR-3) – A four-axis SCARA Robot (Adept One) – A six-

axis articulated Robot (Intelledex 660). Inverse Kinematics: Solving the arm equation – The inverse

kinematics problem – General properties of solutions – Tool configuration – Inverse kinematics of

a five-axis articulated robot (Rhino XR-3) – Inverse kinematics of a four-axis SCARA robot (Adept

one) - Inverse kinematics of a six-axis articulated robot (Intelledex 660) - Inverse kinematics of a

three-axis articulated robot – A robotic work cell.

UNIT II DYNAMIC OF ROBOTS 12 + 3

Workspace analysis and trajectory planning: Workspace analysis – Work envelop of a five-axis

articulated robot – Work envelope of a four-axis SCARA robot – Workspace fixtures – The pick-

and-place operation – Continuous-path motion – Interpolated motion – Straight-line motion.

Differential motion and statics: The tool-configuration Jacobian matrix – Joint-space singularities –



Generalized Inverses – Resolved-Motion rate control:n<=6 – Rate control of redundant robots:n>6

– rate control using {1}-inverses – The manipulator Jacobian – Induced joint torques and forces.

Manipulator Dynamics: Lagrange’s equation – Kinetic and Potential energy – Generalized force –

Lagrange -Euler dynamic model – Dynamic model of a two-axis planar articulated robot - Dynamic

model of a three-axis SCARA robot – Direct and Inverse dynamics – Recursive Newton-Euler

formulation – Dyamic model of a one-axis robot.

UNIT III ROBOT CONTROL 6 + 3

Robot control: The control problem – State equation – Constant solutions – Linear feedback

systems - Single-axis PID control – PD-Gravity control – Computed-Torque control – Variable-

Structure control – Impedance control

UNIT IV SENSORS AND ACTUATORS 9 + 3

Actuators - Introduction – Characteristics of actuating systems – Comparison of actuating systems

– Hydraulic devices – Pneumatic devices – Electric motors – Microprocessor control of electric

motors – Magnetostricitve actuators – Shape-memory type metals – Speed reduction. Sensors –

Introduction – Sensor characteristics – Position sensors – Velocity sensors – Acceleration sensors –

Force and pressure sensors – Torque sensors – Microswitches – Light and Infrared sensors – Touch

and Tactile sensors – Proximity sensors – Range-finders – Sniff sensors – Vision systems – Voice

Recognition devices – Voice synthesizers – Remote center compliance device.

UNIT V VISION AND TASK PLANNING 9 + 3 Robot vision – Image representation – Template matching – Polyhedral objects – Shape analysis –

Segmentation – Iterative processing – Perspective Transformations – Structured illumination –

Camera calibration. Task planning: Task-level programming – Uncertainty – Configuration space –

Gross-Motion planning – Grasp planning – Fine- Motion planning – Simulation of planar motion –

A task-planning problem.

L=45; T=15; TOTAL= 60



TEXT BOOKS

1. Robert J.Schilling, “Fundamentals of Robotics – Analysis & Control”, Prentice Hall of

India Pvt. Ltd., 2002. (Chapters 1 to 9 – Unit I, II, III, V)

2. Saeed B.Niku, “Introduction to Robotics – Analysis, Systems, Applications”, Prentice Hall

of India Pvt. Ltd., 2003. (Chapters 6 & 7 – Unit IV)



COMPONENT BASED TECHNOLOGY - IT1401

AIM

To introduce different software components and their application.

OBJECTIVES

• Introduces in depth JAVA, Corba and .Net Components

• Deals with Fundamental properties of components, technology and architecture and

middleware.

• Component Frameworks and Development are covered in-depth.


Software Components – objects – fundamental properties of Component technology – modules –

interfaces – callbacks – directory services – component architecture – components and middleware

UNIT II JAVA BASED COMPONENT TECHNOLOGIES 9 + 3

Threads – Java Beans – Events and connections – properties – introspection – JAR files – reflection

– object serialization – Enterprise Java Beans – Distributed Object models – RMI and RMI-IIOP

UNIT III CORBA COMPONENT TECHNOLOGIES 9 + 3

Java and CORBA – Interface Definition language – Object Request Broker – system object model

– portable object adapter – CORBA services – CORBA component model – containers –

application server – model driven architecture

UNIT IV NET BASED COMPONENT TECHNOLOGIES 9 + 3

COM – Distributed COM – object reuse – interfaces and versioning – dispatch interfaces –

connectable objects – OLE containers and servers – Active X controls – .NET components -

assemblies – appdomains – contexts – reflection – remoting



UNIT V COMPONENT FRAMEWORKS AND DEVELOPMENT 9 + 3

Connectors – contexts – EJB containers – CLR contexts and channels – Black Box component

framework – directory objects – cross-development environment – component-oriented

programming – Component design and implementation tools – testing tools - assembly tools

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Clemens Szyperski, “Component Software: Beyond Object-Oriented Programming”,

Pearson Education publishers, 2003

REFERENCES

2. Ed Roman, “Enterprise Java Beans”,3rd Edition, Wiley, 2004.

3. Andreas Vogel, Keith Duddy, “Java Programming with CORBA”, John Wiley & Sons 2009

4. Corry, Mayfield, Cadman, “COM/DCOM Primer Plus”, Bpb Publicatons 2008.



SOFTWARE QUALITY MANAGEMENT - CS1021

AIM

To introduce an integrated approach to software development incorporating quality management

methodologies.

OBJECTIVES

• Software quality models

• Quality measurement and metrics

• Quality plan, implementation and documentation

• Quality tools including CASE tools

• Quality control and reliability of quality process

• Quality management system models

• Complexity metrics and Customer Satisfaction

• International quality standards – ISO, CMM

UNIT I INTRODUCTION TO SOFTWARE QUALITY 9 + 3

Software Quality – Hierarchical models of Boehm and McCall – Quality measurement – Metrics

measurement and analysis – Gilb’s approach – GQM Model

UNIT II SOFTWARE QUALITY ASSURANCE 9 + 3

Quality tasks – SQA plan – Teams – Characteristics – Implementation – Documentation –

Reviews and Audits

UNIT III QUALITY CONTROL AND RELIABILITY 9 + 3

Tools for Quality – Ishikawa’s basic tools – CASE tools – Defect prevention and removal –

Reliability models – Rayleigh model – Reliability growth models for quality assessment



UNIT IV QUALITY MANAGEMENT SYSTEM 9 + 3

Elements of QMS – Rayleigh model framework – Reliability Growth models for QMS –

Complexity metrics and models – Customer satisfaction analysis.

UNIT V QUALITY STANDARDS 9 + 3

Need for standards – ISO 9000 Series – ISO 9000-3 for software development – CMM and CMMI

– Six Sigma concepts.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Allan C. Gillies, “Software Quality: Theory and Management”, Thomson Learning, 2003.

(UI : Ch 1-4 ; UV : Ch 7-8)

2. Stephen H. Kan, “Metrics and Models in Software Quality Engineering”, Pearson Education

(Singapore) Pte Ltd., 2002. (UI : Ch 3-4; UIII : Ch 5-8 ; UIV : Ch 9-11)

REFERENCES

1. Norman E. Fenton and Shari Lawrence Pfleeger, “Software Metrics” Thomson, 2003

2. Mordechai Ben – Menachem and Garry S.Marliss, “Software Quality”, Thomson Asia Pte

Ltd, 2003.

3. Mary Beth Chrissis, Mike Konrad and Sandy Shrum, “CMMI”, Pearson Education

(Singapore) Pte Ltd, 2003.

4. ISO 9000-3 “Notes for the application of the ISO 9001 Standard to software development”.



QUANTUM COMPUTING - CS1022

AIM

To understand the fundamental principles of quantum computing.

OBJECTIVES

• To understand the building blocks of a quantum computer.

• To understand the principles, quantum information and limitation of quantum operations

formalizing.

• To understand the quantum error and its correction.

UNIT I FUNDAMENTAL CONCEPTS 9 + 3

Global Perspectives, Quantum Bits, Quantum Computation, Quantum Algorithms, Quantum

Information, Postulates of Quantum Mechanisms.

UNIT II QUANTUM COMPUTATION 9 + 3

Quantum Circuits – Quantum algorithms, Single Orbit operations, Control Operations,

Measurement, Universal Quantum Gates, Simulation of Quantum Systems, Quantum Fourier

transform, Phase estimation, Applications, Quantum search algorithms – Quantum counting –

Speeding up the solution of NP – complete problems – Quantum Search for an unstructured

database.

UNIT III QUANTUM COMPUTERS 9 + 3

Guiding Principles, Conditions for Quantum Computation, Harmonic Oscillator Quantum

Computer, Optical Photon Quantum Computer – Optical cavity Quantum electrodynamics, Ion

traps, Nuclear Magnetic resonance.



UNIT IV QUANTUM INFORMATIONS 9 + 3

Quantum noise and Quantum Operations – Classical Noise and Markov Processes, Quantum

Operations, Examples of Quantum noise and Quantum Operations – Applications of Quantum

operations, Limitations of the Quantum operations formalism, Distance Measures for Quantum

information.

UNIT V QUANTUM ERROR CORRECTION 9 + 3

Introduction, Shor code, Theory of Quantum Error –Correction, Constructing Quantum Codes,

Stabilizer codes, Fault – Tolerant Quantum Computation, Entropy and information – Shannon

Entropy, Basic properties of Entropy, Von Neumann, Strong Sub Additivity, Data Compression,

Entanglement as a physical resource.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Micheal A. Nielsen. & Issac L. Chiang, “Quantum Computation and Quantum

Information”, Cambridge University Press 2007



KNOWLEDGE BASED DECISION SUPPORT SYSTEM - CS1023

AIM

There has been a radical shift in the management parlance. Organizations can use Intranets and

Internets to analyze various aspects about the performance and predict the future. This course aims

at exposing the student to one of the important applications of the computer.

OBJECTIVES

The course has been so designed as to include.

• Development of support system

• Methods of managing knowledge

• Intelligent decision system development


Decision making, Systems, Modeling, and support – Introduction and Definition – Systems –

Models – Modeling process – Decision making: The intelligence phase – The design phase - The

choice phase – Evaluation: The implementation phase –Alternative Decision – Making models –

Decision support systems – Decision makers - Case applications.

UNIT II DECISION SUPPORT SYSTEM DEVELOPMENT 9 + 3

Decision Support System Development: Introduction - Life cycle – Methodologies – prototype –

Technology Levels and Tools – Development platforms – Tool selection – Developing DSS

Enterprise systems: Concepts and Definition – Evolution of information systems – Information

needs – Characteristics and capabilities – Comparing and Integrating EIS and DSS – EIS data

access, Data Warehouse, OLAP, Multidimensional analysis, Presentation and the web – Including

soft information enterprise on systems - Organizational DSS – supply and value chains and

decision support – supply chain problems and solutions – computerized systems MRP, ERP, SCM

– frontline decision support systems.

UNIT III KNOWLEDGE MANAGEMENT 9 + 3



Introduction – Organizational learning and memory – Knowledge management –Development –

methods, Technologies, and Tools – success –Knowledge management and Artificial intelligence –

Electronic document management.

Knowledge acquisition and validation: Knowledge engineering – Scope – Acquisition methods -

Interviews – Tracking methods – Observation and other methods – Grid analysis – Machine

Learning: Rule induction, case-based reasoning – Neural computing – Intelligent agents – Selection

of an appropriate knowledge acquisition methods – Multiple experts – Validation and verification

of the knowledge base – Analysis, coding, documenting, and diagramming – Numeric and

documented knowledge acquisition – Knowledge acquisition and the Internet/Intranets.

Knowledge representation: Introduction – Representation in logic and other schemas – Semantic

networks – Production rules – Frames – Multiple knowledge representation – Experimental

knowledge representations - Representing uncertainty.

UNIT IV INTELLIGENT SYSTEM DEVELOPMENT 9 + 3

Inference Techniques: Reasoning in artificial intelligence – Inference with rules: The Inference tree

– Inference with frames – Model-based and case-based reasoning - Explanation and Meta

knowledge – Inference with uncertainty – Representing uncertainty – Probabilities and related

approaches – Theory of certainty – Approximate reasoning using fuzzy logic.

Intelligent Systems Development: Prototyping: Project Initialization – System analysis and design

– Software classification: Building expert systems with tools – Shells and environments – Software

selection – Hardware –Rapid prototyping and a demonstration prototype - System development –

Implementation – Post implementation.

UNIT V MANAGEMENT SUPPORT SYSTEMS 9 + 3

Implementing and integrating management support systems – Implementation: The major issues -

Strategies – System integration – Generic models MSS, DSS, ES – Integrating EIS, DSS and ES,



and global integration – Intelligent DSS – Intelligent modeling and model management – Examples

of integrated systems – Problems and issues in integration.

Impacts of Management Support Systems – Introduction – overview – Organizational structure and

related areas – MSS support to business process reengineering – Personnel management issues –

Impact on individuals – Productivity, quality, and competitiveness – decision making and the

manager manager’s job – Issues of legality, privacy, and ethics – Intelligent systems and

employment levels – Internet communication – other societal impacts – managerial implications

and social responsibilities.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Efrain Turban, Jay E.Aronson, “Decision Support Systems and Intelligent Systems” 6th

Edition, Pearson Education, 2001.

REFERENCES

1. Ganesh Natarajan, Sandhya Shekhar, “Knowledge management – Enabling Business

Growth”, Tata McGraw-Hill, 2002.

2. George M.Marakas, “Decision Support System”, Prentice Hall, India, 2003.

3. Efrem A.Mallach, “Decision Support and Data Warehouse Systems”, Tata McGraw-Hill,

2002.



GRID COMPUTING - IT1012

AIM

To understand the technology application and tool kits for grid computing

OBJECTIVES

• To understand the genesis of grid computing

• To know the application of grid computing

• To understanding the technology and tool kits to facilitated the grid computing

·

UNIT I GRID COMPUTING 9 + 3

Introduction - Definition and Scope of grid computing

UNIT II GRID COMPUTING INITIALIVES 9 + 3

Grid Computing Organizations and their roles – Grid Computing analog – Grid Computing road

map.

UNIT III GRID COMPUTING APPLICATIONS 9 + 3

Merging the Grid sources – Architecture with the Web Devices Architecture.

UNIT IV TECHNOLOGIES 9 + 3

OGSA – Sample use cases – OGSA platform components – OGSI – OGSA Basic Services.

UNIT V GRID COMPUTING TOOL KITS 9 + 3

Globus GT 3 Toolkit – Architecture, Programming model, High level services – OGSI .Net

middleware Solutions.

L=45; T=15; TOTAL= 60



TEXT BOOKS

1. Joshy Joseph & Craig Fellenstein, “Grid Computing”, Pearson/PHI PTR-2004.

REFERENCES

1. Ahmar Abbas, “Grid Computing: A Practical Guide to technology and Applications”,

Laxmi Publications 2006.



PROFESSIONAL ETHICS AND HUMAN VALUES - GE1301

OBJECTIVE

• To create an awareness on Engineering Ethics and Human Values.

• To instill Moral and Social Values and Loyalty

• To appreciate the rights of Others

1. HUMAN VALUES 10 + 3

Morals, Values and Ethics – Integrity – Work Ethic – Service Learning – Civic Virtue – Respect

for Others – Living Peacefully – caring – Sharing – Honesty – Courage – Valuing Time – Co-

operation – Commitment – Empathy – Self-Confidence – Character – Spirituality

2. ENGINEERING ETHICS 9 + 3

Senses of 'Engineering Ethics' - variety of moral issued - types of inquiry - moral dilemmas - moral

autonomy - Kohlberg's theory - Gilligan's theory - consensus and controversy – Models of

Professional Roles - theories about right action - Self-interest - customs and religion - uses of

ethical theories.

3. ENGINEERING AS SOCIAL EXPERIMENTATION 9 + 3

Engineering as experimentation - engineers as responsible experimenters - codes of ethics - a

balanced outlook on law - the challenger case study

4. SAFETY, RESPONSIBILITIES AND RIGHTS 9 + 3

Safety and risk - assessment of safety and risk - risk benefit analysis and reducing risk - the Three

Mile Island and Chernobyl case studies.

Collegiality and loyalty - respect for authority - collective bargaining - confidentiality - conflicts of

interest - occupational crime - professional rights - employee rights - Intellectual Property Rights

(IPR) - discrimination.



5. GLOBAL ISSUES 8 + 3

Multinational corporations - Environmental ethics - computer ethics - weapons development -

engineers as managers-consulting engineers-engineers as expert witnesses and advisors -moral

leadership-sample code of Ethics like ASME, ASCE, IEEE, Institution of Engineers (India), Indian

Institute of Materials Management, Institution of electronics and telecommunication engineers

(IETE),India, etc.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Mike Martin and Roland Schinzinger, “Ethics in Engineering”, McGraw-Hill, New York

1996.

2. Govindarajan M, Natarajan S, Senthil Kumar V. S, “Engineering Ethics”, Prentice Hall of

India, New Delhi, 2004.

REFERENCES

1. Charles D. Fleddermann, “Engineering Ethics”, Pearson Education / Prentice Hall, New

Jersey, 2004 (Indian Reprint)

2. Charles E Harris, Michael S. Protchard and Michael J Rabins, “Engineering Ethics –

Concepts and Cases”, Wadsworth Thompson Learning, United States, 2000 (Indian Reprint

now available)

3. John R Boatright, “Ethics and the Conduct of Business”, Pearson Education, New Delhi,

2003.

4. Edmund G Seebauer and Robert L Barry, “Fundamentals of Ethics for Scientists and

Engineers”, Oxford University Press, Oxford, 2001.



MOBILE COMPUTING – CS1024

AIM

To provide basics for various techniques in Mobile Communications and Mobile Content services.

OBJECTIVES

• To learn the basics of Wireless voice and data communications technologies.

• To build working knowledge on various telephone and satellite networks.

• To study the working principles of wireless LAN and its standards.

• To build knowledge on various Mobile Computing algorithms.

• To build skills in working with Wireless application Protocols to develop mobile

content applications.

UNIT I WIRELESS COMMUNICATION FUNDAMENTALS 9 + 3

Introduction – Wireless transmission – Frequencies for radio transmission – Signals – Antennas –

Signal Propagation – Multiplexing – Modulations – Spread spectrum – MAC – SDMA – FDMA –

TDMA – CDMA – Cellular Wireless Networks.

UNIT II TELECOMMUNICATION NETWORKS 11 + 3

Telecommunication systems – GSM – GPRS – DECT – UMTS – IMT-2000 – Satellite Networks -

Basics – Parameters and Configurations – Capacity Allocation – FAMA and DAMA – Broadcast

Systems – DAB - DVB.

UNIT III WIRLESS LAN 9 + 3

Wireless LAN – IEEE 802.11 - Architecture – services – MAC – Physical layer – IEEE 802.11a -

802.11b standards – HIPERLAN – Blue Tooth.



UNIT IV MOBILE NETWORK LAYER 9 + 3

Mobile IP – Dynamic Host Configuration Protocol - Routing – DSDV – DSR – Alternative

Metrics.

UNIT V TRANSPORT AND APPLICATION LAYERS 7 + 3

Traditional TCP – Classical TCP improvements – WAP, WAP 2.0.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Jochen Schiller, “Mobile Communications”, PHI/Pearson Education, Second Edition, 2003. (Unit I Chap 1,2 &3- Unit II chap 4,5 &6-Unit III Chap 7.Unit IV Chap 8-Unit V Chap 9&10.) 2. William Stallings, “Wireless Communications and Networks”, PHI/Pearson Education, 2009.

(Unit I Chapter – 7&10-Unit II Chap 9)

REFERENCES

1. Kaveh Pahlavan, Prasanth Krishnamoorthy, “Principles of Wireless Networks”, PHI/Pearson Education, 2003.

2. Uwe Hansmann, Lothar Merk, Martin S. Nicklons and Thomas Stober, “Principles of Mobile

Computing”, Springer, New York, 2003.

3. . Hazysztof Wesolowshi, “Mobile Communication Systems”, John Wiley and Sons Ltd, 2002.



ADVANCED JAVA PROGRAMMING – CS1025

AIM

To enable the students to design and develop enterprise strength distributed and multi-tier

applications – Using Java Technology.

OBJECTIVES

• To learn advanced Java programming concepts like reflection, native code interface,

threads, etc.

• To develop network programs in Java

• To understand Concepts needed for distributed and multi-tier applications

• To understand issues in enterprise applications development.

UNIT I JAVA FUNDAMENTALS 9 + 3

Java I/O streaming – filter and pipe streams – Byte Code interpretation - reflection – Dynamic

Reflexive Classes – Threading – Java Native Interfaces- Swing.

UNIT II NETWORK PROGRAMMING IN JAVA 9 + 3

Sockets – secure sockets – custom sockets – UDP datagrams – multicast sockets – URL classes –

Reading Data from the server – writing data – configuring the connection – Reading the header –

telnet application – Java Messaging services

UNIT III APPLICATIONS IN DISTRIBUTED ENVIRONMENT 9 + 3

Remote method Invocation – activation models – RMI custom sockets – Object Serialization –

RMI – IIOP implementation – CORBA – IDL technology – Naming Services – CORBA

programming Models - JAR file creation



UNIT IV MULTI-TIER APPLICATION DEVELOPMENT 9 + 3

Server side programming – servlets – Java Server Pages - Applet to Applet communication – applet

to Servlet communication - JDBC – Using BLOB and CLOB objects – storing Multimedia data

into databases – Multimedia streaming applications – Java Media Framework.

UNIT V ENTERPRISE APPLICATIONS 9 + 3

Server Side Component Architecture – Introduction to J2EE – Session Beans – Entity Beans –

Persistent Entity Beans – Transactions.

L=45; T=15; TOTAL= 60

TEXT BOOKS

1. Elliotte Rusty Harold, “ Java Network Programming”, O’Reilly publishers, 2004 (UNIT II)

2. Ed Roman, “Mastering Enterprise Java Beans”, John Wiley & Sons Inc., 2006. (UNIT III

and UNIT V)

3. Hortsmann & Cornell, “CORE JAVA 2 ADVANCED FEATURES, VOL II”, Pearson

Education, 2008. (UNIT I and UNIT IV)

REFERENCES

1. Web reference: http://java.sun.com.

2. Patrick Naughton, “COMPLETE REFERENCE: JAVA2”, Tata McGraw-Hill, 2003.

Date post:	14-May-2020
Category:	Documents
Upload:	others
View:	1 times
Download:	0 times

FACULTY OF ENGINEERING - Christ UniversityCSE)_2012.pdf · Christ University Faculty of Engineering...

Documents