SYLLABUS with PROGRAM EDUCATIONAL OBJECTIVES 4 …becbapatla.ac.in/it/IT Syllabus with...

BAPATLA ENGINEERING COLLEGE

(Autonomous)

BAPATLA - 522101.

SYLLABUS

with

PROGRAM EDUCATIONAL OBJECTIVES

4 Year B.Tech Program

2010-2011

DEPARTMENT OF INFORMATION TECHNOLOGY

BAPATLA ENGINEERING COLLEGE

(Autonomous)

BAPATLA - 522101

CONTENTS

1 Program Educational Objectives 1

2 Program Outcomes 2

3 Mapping of PEO’s with Program Outcomes 3

4 Schema and Mapping of Course Objectives to Program Outcomes 4

5 Course Objectives, Outcomes, Topics and mapping table for

• Ist

Year, I Semester 20

• Ist

Year, II Semester 40

• IInd

Year, I Semester 59

• IInd


• IIIrd

Year, I Semester 102

• IIIrd


• IVth

Year, I Semester 166

• IVth


Page 1 of 1 Department of Information Technology

Program Educational Objectives

The students graduated in Information Technology will:

I. Be able to choose diverse professional careers in software industry, research, academia,

engineering and administrative services.

II. Be able to apply the principles of Basic Sciences, Mathematics and Information

Technology to solve real world problems using digital computing systems.

III. Be able to analyze, design, implement and evaluate robust, scalable and cost-effective

computer-based systems and processes in the industry.

IV. Be able to lead and work in their profession with multidisciplinary approach,

cooperative attitude, effective communication and interpersonal skills.

V. Be aware of professional and ethical practices in the context of social impacts of

computing.

VI. Be able to engage in sustained learning through higher studies, professional

improvement opportunities and self-directed learning to adopt them to changes in

computing technologies in the local and global context.


Program Outcomes

The graduates in Information Technology will:

a) Demonstrate an ability to apply the knowledge of Mathematics, Information Technology

appropriate to the development of software systems to solve real world problems.

b) Demonstrate an ability to analyze a problem and design a computing system or a

component or a process confirming to standards using various methodologies and

architectures.

c) Be able to analyze and understand an existing software& hardware system and extend

the system to meet evolving requirements.

d) Demonstrate an ability to implement and test a computing system or a component or a

process, to evaluate and compare efficiencies of alternative solutions.

e) Demonstrate an understanding of the emerging technologies and a working knowledge

of software and hardware tools.

f) Be able to interact professionally with peers and clients with diverse cultures and

medium of communication located in geographically dispersed locations in the context

of computing and software engineering.

g) Have the knowledge of professional and ethical responsibilities in the corporate sector

and be aware of contemporary issues.

h) Demonstrate the ability to communicate effectively in both verbal and written form.

i) Have an ability to analyze the social and human context of computing and be aware of

contemporary issues.

j) Recognize the need for continuing education, research and professional development.

k) Possess the knowledge and skills for employability and to succeed in national and

international level competitive examinations.


Mapping of PEO’s with Program Outcomes

Program Outcomes

Pro

gra

m E

du

cati

on

al

Ob

ject

ive

s a b c d e f g h i j k

I. x x x x

II. x x x x x x

III. x x x x

IV. x x

V. x x

VI. x


BAPATLA ENGINEERING COLLEGE : BAPATLA

(Autonomous)

SCHEME OF INSTRUCTION & EXAMINATION

FOR

INFORMATION TECHNOLOGY

w.e.f 2010-2011 (Semester System)

I/IV B.Tech., SEMESTER I

Code No. Subject

Scheme of Instruction

(Periods per week)

Scheme of

Examination

(Maximum marks) No. of

Credits

Theory Tutorial Lab CA FE Total

Marks

IT111 / MA01 Mathematics – I 4 1 - 40 60 100 4

IT112 / PH01 Engineering

Physics – I 3 1 - 40 60 100 3

IT113 / CY01 Engineering

Chemistry – I 3 1 - 40 60 100 3

IT114 / EN01 English Language and

Communication 3 1 - 40 60 100 3

IT115 / CE01 Engineering

Mechanics 4 1 - 40 60 100 4

IT116 / CS01 Computer

Programming with C 4 1 - 40 60 100 4

IT151 / PHL01 Physics lab – I - - 3 40 60 100 2

IT152 / CYL01 Chemistry lab – I - - 3 40 60 100 2

IT153 / CSL01 Computer

Programming lab - - 3 40 60 100 2

TOTAL 21 6 9 360 540 900 27

CA: Continuous Assessment FE: Final Examination


BAPATLA ENGINEERING COLLEGE: BAPATLA

(Autonomous)


FOR


I/IVB.Tech., SEMESTER I

Mapping of Course requirements to Program Outcomes

I/IV Year B.Tech.,SEMESTER I

Subject Program Outcomes

Code Name a b c d e f g h i j K

IT111 /

MA01 Mathematics – I � � � �

� �

IT112 /

PH01

Engineering

Physics – I � � � � � �

IT113 /

CY01

Engineering Chemistry –

I

�

IT114 /

EN01

English Language and

Communication � � � �

IT115 /

CE01 Engineering Mechanics � � � � � �

IT116 /

CS01

Computer Programming

with C � � � �

� � �

IT151 /

PH01 Physics lab – I � � � � � �

IT152 /

CYL01 Chemistry lab – I

�

IT153 /

CSL01

Computer Programming

lab � � � �

� � �



(Autonomous)


FOR



I/IV B.Tech., SEMESTER II

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

IT121 / MA02 Mathematics – II 4 1 40 60 100 4

IT122 / PH02 Engineering

Physics – II 3 1 40 60 100 3

IT123 / CY02 Engineering

Chemistry – II 3 1 40 60 100 3

CS/IT124 Digital Logic Design 3 1 40 60 100 3

IT125 / BT01 Environmental

Studies 3 - 40 60 100 3

IT126 / ME01 Engineering Graphics 3 3 40 60 100 3

IT161 /

PHCYL01

Physics & Chemistry

Lab – II - - 3 40 60 100 2

IT162 / ENL01 English Language

Lab - - 3 40 60 100 2

IT163 /MEL01 Workshop - - 3 40 60 100 2

TOTAL 19 7 9 360 540 900 25




(Autonomous)


FOR


I/IVB.Tech., SEMESTER II

Mapping of Course requirements to Program Outcomes

I/IV Year B.Tech.,SEMESTER II



IT121 /

MA02 Mathematics – II � � � �

� �

IT122 /

PH02

Engineering

Physics – II � � � � � �

IT123 /

CY02

Engineering

Chemistry – II

�

CS/IT124 Digital Logic Design � �

�

�

IT125 /

BT01 Environmental Studies

�

IT126 /

ME01 Engineering Graphics

�

�

IT161 /

PHCYL01

Physics & Chemistry Lab

– II � � � � � � �

IT162 /

ENL01 English Language Lab

� � � �

IT163

/MEL01 Workshop

�



(Autonomous)


FOR



II/IVB.Tech.,SEMESTER I

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

IT 211/

MA03 Mathematics – III 4 - - 40 60 100 4

CS/IT212 Computer Organization 3 1 - 40 60 100 3

CS/IT213 Computer Graphics 3 1 - 40 60 100 3

CS/IT214 Object Oriented

Programming 4 1 - 40 60 100 4

CS/IT215 Discrete Mathematical

Structures 4 1 - 40 60 100 4

CS/IT216 Data Structures 4 1 - 40 60 100 4


Programming Lab - - 3 40 60 100 2

CS/IT252 Data Structures Lab - - 3 40 60 100 2

CS/IT253 Computer Hardware &

Software Lab - - 3 40 60 100 2

TOTAL 22 5 9 360 540 900 28




(Autonomous)


FOR


II/IVB.Tech.,SEMESTER I

Mapping of Course Objectives to Program Outcomes

II/IV Year B.Tech.,SEMESTER I


Code Name a b c d e f g h i j k

IT 211/

MA03 Mathematics – III � � � �

� �

CS/IT212 Computer Organization �

� � � �

CS/IT213 Computer Graphics � � � � � � � �


Programming � � � �

� � �

CS/IT215 Discrete Mathematical

Structures �

� � �

CS/IT216 Data Structures � � � � � � �


Programming Lab � � � �

� � �

CS/IT252 Data Structures Lab � � � � � � �

CS/IT253 Computer Hardware &

Software Lab � � � � �



(Autonomous)


FOR



II/IVB.Tech.,SEMESTER II

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

IT221/

MA05 Probability & Statistics 4 1 - 40 60 100 4

IT222/

EC01

Electronic Devices &

Circuits 3 1 - 40 60 100 3

IT223 /

EE04 Electrical Technology 3 1 - 40 60 100 3

CS/IT224 GUI Programming 4 1 - 40 60 100 4

CS/IT225 System Software 3 1 - 40 60 100 3

CS/IT226 Microprocessors &

Microcontrollers 4 1 - 40 60 100 4

CS/IT261 Electronic Devices &

Circuits Lab - - 3 40 60 100 2


Microcontrollers Lab - - 3 40 60 100 2

CS/IT263 GUI Programming Lab - - 3 40 60 100 2

TOTAL 21 6 9 360 540 900 27




(Autonomous)


FOR


II/IVB.Tech.,SEMESTER II


II/IVB.Tech., SEMESTER II



IT221/ MA05 Probability & Statistics � � � �

� �

IT222/ EC01 Electronic Devices &

Circuits �

�

IT223/ EE04 Electrical Technology

� �

CS/IT224 GUI Programming � � � � � � �

CS/IT225 System Software � � �

�


Microcontrollers � � �

�

�

CS/IT261 EDC Lab

� �


Microcontrollers Lab � � �

�

�

CS/IT263 GUI Programming Lab � � � � � � �



(Autonomous)


FOR



III/IV B.Tech., SEMESTER I

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

CS/IT 311 Professional Ethics

& Human Values 3 1 - 40 60 100 3

CS/IT 312 Data

Communications 3 1 - 40 60 100 3

CS/IT 313 Automata Theory &

Formal Languages 3 1 - 40 60 100 3

CS/IT 314 Operating Systems 4 1 - 40 60 100 4

CS/IT 315

Database

Management

Systems

4 1 - 40 60 100 4

CS/IT 316 Web Technologies 4 1 - 40 60 100 4

IT 351/

ENL02 Soft Skills Lab - - 3 40 60 100 2

CS/IT 352 RDBMS Lab - - 3 40 60 100 2

CS/IT 353 Web Technologies

Lab - - 3 40 60 100 2

TOTAL 21 6 9 360 540 900 27




(Autonomous)


FOR


III/IV B.Tech.,SEMESTER I


III/IV B.Tech., SEMESTER I



CS/IT 311 Professional Ethics &

Human Values

�

CS/IT 312 Data Communications � � � �

�

CS/IT 313 Automata Theory &

Formal Languages � � � �

� � �

CS/IT 314 Operating Systems �

� �

�

CS/IT 315 Database Management

Systems � � � � � � �

CS/IT 316 Web Technologies � � � � � � � �

IT 351/

ENL02 Soft Skills Lab

� � � �

CS/IT 352 RDBMS Lab � � � � � � �

CS/IT 353 Web Technologies Lab � � � � � � � �



(Autonomous)


FOR



III/IV B.Tech., SEMESTER II

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

CS/IT 321 Computer Networks 4 - - 40 60 100 4

CS/IT 322 Compiler Design 3 1 - 40 60 100 3

CS/IT 323 UNIX Programming 4 1 - 40 60 100 4

CS/IT 324 Software

Engineering 4 - - 40 60 100 4

CS/IT 325 Enterprise

Programming 4 1 - 40 60 100 4

CS/IT 326 Elective – I 4 1 - 40 60 100 4

CS/IT 361 UNIX Programming

Lab - - 3 40 60 100 2


Programming Lab - - 3 40 60 100 2

CS/IT 363 Elective – I Lab - - 3 40 60 100 2

TOTAL 23 4 9 360 540 900 29


Elective – I

CS/IT 326 (A) Bioinformatics

CS/IT 326 (B) Digital Image Processing

CS/IT 326 (C) Open Source Systems

CS/IT 326 (D) Soft Computing

CS/IT 326 (E) .Net Technologies



(Autonomous)


FOR


III/IV B.Tech.,SEMESTER II

Mapping of Course Objectives to ProgramOutcomes

III/IV B.Tech., SEMESTER II



CS/IT 321 Computer

Networks � � � � � � �

CS/IT 322 Compiler Design �

CS/IT 323 UNIX

Programming � � � � �

CS/IT 324 Software

Engineering � � � � � � � �


Programming � � � � � �

CS/IT 326 Elective – I

(A) Bioinformatics � � � � �

(B) Digital Image

Processing � � � �

(C) Open Source

Systems � � � � � � � �

(D) Soft Computing � � � � � � �

(E) .Net Technologies � � � � � � �

CS/IT 361 UNIX

Programming Lab � � � � �


Programming Lab � � � � � �

CS/IT 363 Elective – I Lab

(A) Bioinformatics � � � � �

(B) Digital Image

Processing � � � �

(C) Open Source

Systems � � � � � � � �

(D) Soft Computing � � � � � � �

(E) .Net Technologies � � � � � � �



(Autonomous)


FOR



IV/IV B.Tech., SEMESTER I

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits


Marks

CS/IT 411 Cryptography &

Network Security 3 1 - 40 60 100 3

CS/IT 412 Distributed Systems 3 1 - 40 60 100 3

CS/IT 413 Object Oriented

Analysis & Design 4 1 - 40 60 100 4

CS/IT 414 Design & Analysis of

Algorithms 4 1 - 40 60 100 4

CS/IT 415 Elective – II 4 1 - 40 60 100 4

CS/IT 416 Open Elective 3 1 - 40 60 100 3

CS/IT 451 Term Paper - - 3 40 60 100 2

CS/IT 452 OOAD Lab - - 3 40 60 100 2

CS/IT 453 Algorithms Lab - - 3 40 60 100 2

TOTAL 21 6 9 360 540 900 27


Elective – II Open Elective

CS/IT 415 (A) Operations Research The Students of IT will choose one of

the Open Electives offered by other

Departments except CSE.

CS/IT 415 (B) Advanced Database

Management Systems

CS/IT 415 (C) Grapy Theory

CS/IT 415 (D) Principals of Programming

Languages

CS/IT 415 (E) Machine Learning



(Autonomous)


FOR


IV/IV B.Tech.,SEMESTER I


IV/IV B.Tech., SEMESTER I


Code Name a b c d e f g h i J K

CS/IT 411 Cryptography &

Network Security � � � � � � �

CS/IT 412 Distributed

Systems � � � � �

CS/IT 413 Object Oriented

Analysis & Design � � � � � � � �

CS/IT 414 Design & Analysis

of Algorithms � � � � � �

CS/IT 415 Elective – II

(A) Operations

Research � �

(B)

Advanced

Database

Management

Systems

� � � � � � �

(C) Grapy Theory � � � �

(D)

Principles of

Programming

Languages

� � �

(E) Machine Learning � � � � �

CS/IT 416 Open Elective

CS/IT 451 Term Paper � � � � � � � �

CS/IT 452 OOAD Lab � � � � � � � �

CS/IT 453 Algorithms Lab � � � � � � � �



(Autonomous)


FOR



IV/IV B.Tech., SEMESTER II

Code No. Subject


(Periods per week)

Scheme of

Examination


Credits

Theory Tutorial Lab/

Project CA FE

Total

Marks

IT 421 /

ME05

Industrial

Management&

Entrepreneurship

Development

3 1 - 40 60 100 3

CS/IT 422 Data Engineering 4 1 - 40 60 100 4

CS/IT 423 Elective – III 4 1 - 40 60 100 4

CS/IT 424 Elective – IV 4 1 - 40 60 100 4

CS/IT 461 Project Work - - 9 50 100 150 10

CS/IT 462 Data Engineering Lab - - 3 40 60 100 2

TOTAL 15 4 12 250 400 650 27


Elective – III Elective – IV

IT 423 (A) Ecommerce & ERP CS/IT 424 (A) Advanced Computer Architecture

CS/IT 423 (B) Grid Computing CS/IT 424 (B) Natural Language Processing

CS/IT 423 (C) Wireless Networks CS/IT 424 (C) Information Retrieval

IT 423 (D) Storage Area Networks CS/IT 424 (D) Multimedia Systems

CS/IT 423 (E) Network Management

Systems

CS/IT 424 (E) Software Testing Methodologies



(Autonomous)


FOR


IV/IV B.Tech.,SEMESTER II


IV/IV B.Tech., SEMESTER II



IT421/

ME05

Industrial

Management&

Entrepreneurship

Development

� � � �

CS/IT 422 Data Engineering � � � � � �

Elective –III

IT 423(A) Ecommerce & ERP � � � � � �

CS/IT 423

(B) Grid Computing � � � � � � �

CS/IT 423

(C) Wireless Networks � � � � � � �

IT 423(D) Storage Area

Networks � � � � � � �

CS/IT 423

(E)

Network

Management

Systems

� � � � � � � �

CS/IT 424 Elective – IV

(A) Advanced Computer

Architecture � � � � �

(B) Natural Language

Processing � � � � � � � � �

(C) Information Retrieval � � � � � � � � �

(D) Multimedia Systems � � � � � � �

(E) Software Testing

Methodologies � � � �

CS/IT 461 Project Work � � � � � � � �

CS/IT 462 Data Engineering Lab � � � � � �


MATHEMATICS – I

(Common for all branches)

IT111/ MA01

Lectures : 4 Periods/Week, Tutorial: 1 Continuous Assessment : 40

Final Exam : 3 hours Final Exam Marks : 60

Prerequisites: Elementary differential and integral calculus, Elementary Matrix algebra.

Course Objectives:

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

1. Compute the rank and inverse of a matrix.

2. Solve the system of the algebraic equations.

3. Verify whether the given set of vectors form a vector space or not.

4. Determine the dimension and basis of a vector space.

5. Compute Eigen values and Eigen vectors of a given matrix.

6. Understand the geometrical interpretation of mean value theorems.

7. Compute the extreme values of a given function in two variables.

8. Describe the diagonalization of a matrix.

9. Identify the order and degree of a differential equation.

10. Know how to solve the first order ordinary differential equations.

11. Apply the first order ordinary differential equations to physical problems.

12. Compute the general solution of 2nd

order ordinary differential equations and apply them to

solve the L-C-R circuits.

Course Outcomes:

Provide students with the knowledge of

1. Modeling of certain physical phenomena into appropriate matrices and their

transformations.

2. Geometrical transformations using basic analytical concepts.

3. Representation of certain mechanical, electrical, biological systems in terms of

ordinarydifferential equations and provision of effective solutions to them.

Topics:

• Matrix Algebra

• Differential Calculus

• First Order Differential Equations

• Linear Differential Equations of Second Order

Reference Book:

1. George B, Thomas, Jr. and Ross L. Finney, “Calculus and Analytic Geometry”, Addison

Wesley.


RELATIONSHIP OF COURSE OUTCOMES TO PROGRAM OUTCOMES FOR DEPARTMENT OF INFORMATION TECHNOLOGY

S.No Program Out Comes None Low High

a.

Demonstrate an ability to apply the knowledge of Mathematics, Computer Science and Engineering appropriate to the development of software systems to solve real world problems.

�

b. Demonstrate an ability to analyze a problem and design a computing system or a component or a process confirming to standards using various methodologies and architectures.

�

c. Be able to analyze and understand an existing software & hardware system and extend the system to meet evolving requirements.

�

d. Demonstrate an ability to implement and test a computing system or a component or a process, to evaluate and compare efficiencies of alternative solutions.

�

e. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools.

f.

Be able to interact professionally with peers and clients with diverse cultures and medium of communication located in geographically dispersed locations in the context of computing and software engineering.

g. Have the knowledge of professional and ethical responsibilities in the corporate sector and be aware of contemporary issues.

h. Demonstrate the ability to communicate effectively in both verbal and written form.

i. Have an ability to analyze the social and human context of computing and be aware of contemporary issues.

j. Recognize the need for continuing education, research and professional development.

�

k. Possess the knowledge and skills for employability and to succeed in national and international level competitive examinations.

�


ENGINEERING PHYSICS – I

(Common to all branches)

IT112/ PH01



Course Description: Develops a scientific temper and analytical capability in the engineering

graduates through the learning of physical concepts and their application in engineering and

technology. Comprehension of some basic physical concepts will enable graduates to think

logically the engineering problems that would come across due to rapidly developing new

technologies.

Course Objectives:

1. It provides students with fundamental understanding of physics and the engineering

knowledge required to work in a variety of technical positions.

2. Lab work stimulates the scientific temper and analytical capabilities in solving problems.

3. It links the core scientific theory with the practical applications of day-to-day in advance.

4. Brings awareness of social and scientific implications of physics.

5. Explains the role of the engineer in today’s society.

Topics:

• Optics

• Interference

• Diffraction

• Polarization

• Lasers & Fiber Optics

• Lasers

• Holography

• Fiber Optics

• Electricity & Magnetism

• Modern Physics

Reference Books:

1. “Optics”, A. Ghatak (TMH).

2. “Concepts of Modern Physics”, AurthurBeiser (TMG).

3. “A text book of engineering physics”, M.N. Avadhanulu, P.G. Kshirasagar, S.Chand& Co.,.

4. Serway and jewett, “Physics for scientist and engineers with Modern physics”, 6th

edition,

Tomson Brooks/Cole, Indian reprint.




a.


�


�


�


�


�

f.






�



ENGINEERING CHEMISTRY – I


IT113/ CY01



Course Objectives:

The student should be conversant:

1. With the principles of water characterization and treatment of water for potable and

industrial purposes.

2. With the principles of polymer chemistry and engineering applications of polymers

3. With Industrial applications of surface chemistry

4. With the conventional and non-conventional energy sources and energy storage devices

and Chemistry of engineering materials

Course Outcomes:

Imparting sound fundamental knowledge in the principles of chemistry involving the different

application oriented topics required for all engineering branches.

Topics:

• Water Technology

• Polymers

• Surface Chemistry

• Renewable And Non Renewable Energy Sources

• Engineering Materials

Reference Books:

1. B.K.Sharma, “Engineering chemistry”, Krishna Prakasan Media (P) Ltd., Meerut (2001).

2. B. Sivasankar, “Engineering Chemistry”, Tata McGraw-Hill Pub.Co.Ltd, New Delhi (2008).

3. “Enginering Chemistry”, J.C. Kuriacase& J. Rajaram, Tata McGraw Hill co.,

New Delhi 1. (2004).

4. “Chemistry of Engineering Materials”, R.P Mani and K.N.Mishra, CENGAGE learning.

5. “Applied Chemistry – A text for Engineering & Technology”, Springar (2005).

6. “Text Book of Engineering Chemistry”, ShasiChawla, DhantpatRai Publishing Company, New

Delhi (2008).

7. “Engineering Chemistry”, R. Gopalan, D. Venkatappayya, D.V. SulochanaNagarajan, Vikas

Publishers (2008).




a.






f.



�






ENGLISH LANGUAGE AND COMMUNICATION


IT114/ EN01



Prerequisites: Basic knowledge in English grammar, Intermediary writing, Reading Skills.

Course Description: Develop the knowledge of Communicative grammar, enhancement of

lexical capabilities by extensive practice exercises, building the vocabulary, and develop

skimming and scanning skills using reading materials on different topics to revamp

comprehension flair of English.

Course Objectives:

Student will learn how to do the following:

1. Understand basic grammatical units and their usage;

2. Learn to think, Write critically and coherently;

3. Recognize writings as a process rather than a product;

4. Upgrading comprehension skills of English Material of various types; and

5. Enhancing range of vocabulary to communicate in varied contexts

Course outcomes:

On Completing this course students will

1. Understand various Grammatical Units of English and structures of Sentences.

2. Be able to write complex and compound sentences with coherence.

3. Acquire considerable flair in using broad range of vocabulary.

Topics: Grammar, Writing skills, Vocabulary, and Reading skills.

Reference Books:

1. “Effective Technical Communication”, M.AshrafRizvi, Tata McGraw Hill.

2. “Cambridge Preparation Guide for TOFEL”.

3. “Dictionary of Technical Terms”.

4. “Cambridge Advanced Learner’s Dictionary”.

5. “Cambridge Idioms Dictionary”.

6. “Basic Correspondence & Report Writing”, Sharma, Tata McGraw Hill.

7. “Business Correspondences and Report Writing”, R.C.Sharma, Krishna Mohan, Tata McGraw

Hill.

8. “Dictionary of Misspelled and Easily Confused Words”, David Downing, Deborah K.Williams,

Tata McGraw Hill.




a.






f.


�


�

h. Demonstrate the ability to communicate effectively in both verbal and written form. �


�




ENGINEERING MECHANICS

(Common to all branches except Mechanical Engineering)

IT115/ CE01



Prerequisites: Intermediate Maths and Physics

Course Objectives: The Engineering Mechanics is considered as one of the basic subjects for

engineering students irrespective of branch as it develops thinking and imaginative capacity of

the students. An Engineer who can successfully cope with new problems in the field must have

a sound understanding of fundamental principles. The present course is designed to prepare

the students in this direction. The contents of the syllabus have been developed keeping this in

mind, so that students are exposed to a variety of situations that will test their understanding

of the subject both at the concepted and analytical skills.

In view of this, Engineering Mechanics is introduced at the first year. It is common to all

branches of Engineering. Engineering Mechanics deals with Statics and Dynamics. Statics deals

with equilibrium of bodies at rest. Dynamics deals with the motion of bodies and the forces that

cause them.

Course Outcomes:

At the end of this section of the course, the student will be capable of

1. Use vectors to represent forces.

2. Summing forces and moments.

3. Developing force and moment equilibrium equations.

4. To understand the concepts and apply the equations of static equilibrium for pulley and

cable, truss and beam systems.

5. Students will demonstrate an ability to draw free body diagrams for the purposes of

determining internal forces in members and reactions.

6. Students will demonstrate an ability to determine the centroids of areas of various shapes

using both integration and summation.

7. Students will demonstrate an ability to determine moments of inertia about axes using both

integration and summation

8. Students will demonstrate an ability to analyze the behavior of simple systems with friction.

9. The motion, velocity and acceleration of a point.

10. The use of the instantaneous state to derive equations of motion.

11. The use of F = ma to relate force to motion for particles and rigid bodies.

12. The use of work-energy to solve motion problems.

13. Conservative and non-conservative system

14. The use of impulse and moment principle, and solve the problems related to impact.


Topics:

• General Principles

• Force Vectors

• Equilibrium Of A Particle

• Force System Resultants

• Equilibrium Of A Rigid Body

• Friction

• Center Of Gravity And Centroid

• Moments Of Inertia

• Kinematics Of A Particle

• Kinetics Of A Particle: Force And Acceleration

• Kinetics Of Particle: Work And Energy

• Kinetics Of Particle

• Impulse And Momentum

Reference Books:

1. “Vector mechanics for Engineers Statics and Dynamics”, Beer and Johnston, Tata McGraw-

Hill publishing company, New Delhi.

2. “Engineering Mechanics”, S. Timoshenko and D. H. Young – McGraw-Hill International

Edition.

3. “Engineering Mechanics Statics and Dynamics”, J. L. Meriam and L. Kraige.

4. “Engineering Mechanics for Engineers. Statics and Dynamics”, Beer and Irving H. Shames,

Pearson Education.




a.


�


�


�


�


�

f.






�



COMPUTER PROGRAMMING WITH C

(Common to all Branches)

IT116/ CS01



Prerequisites:Mathematics,English.

Course Objectives:

To impart knowledge so that the student will

1. know how to write and debug programs using an IDE

2. know The principles of designing structured programs

3. know when and how to use the appropriate statements available in the C language

4. explain the principles of structured program design

5. understand what is meant by a well designed program

6. describe when and how to use the stand C statement

7. Write, Compile and Debug basic C programs using an IDE and using a workstation

8. Write basic C programs using

i. Selection statements,

ii. Repetitive statements,

iii. Functions,

iv. Pointers,

v. Arrays,

vi. Strings

Course Outcomes:

Upon completing this course, the student will be able to

1. Use Common terminology or Jargon related to the software development process

2. Understand the importance of the software development process - from specification to

design to implementation to testing and review.

3. Recognize of the value of documentation at different stages of the software development

process, including the production of a specification document, a design document, flow

chart, a test plan and results.

4. Understand the function and operation of development of software such as the compiler,

interpreter, editor, Integrated Development Environment and debugger.

5. Understand general principles of computer languages such as loops (while/for), conditional

branching (if/switch), block structure, functions (including parameter passing, prototypes

and recursion), input/output, arithmetic rules.

6. Learn how these principles are implemented in the C programming language.

7. Develop problem-solving skills to translate 'English' described problems into programs

written using the C language.

8. Understand how to use and manipulate variables and types to change the program state,

including numeric, character, array and pointer types, as well as the use of structures and

typedefs.

9. Understand the purpose of pointers for parameter passing, referencing and dereferencing,

and linking data structures.

10. Understand the purpose and use of function libraries.

Topics:

• C Tokens

• Operators & Expressions

• Control Statements


• Arrays

• Functions

• Scope & Extent

• Pointers And Dynamic Memory Allocation

• Structures

• Files

Reference Books:

1. Kernighan BW and Dennis Ritchie M, “C programming language”, 2nd

ed, Prentice Hall.

2. Yashavant P. Kanetkar, “Let us C”, BPB Publications.

3. E.Balagurusamy, “Programming in ANSI C”, 4th

ed, Tata Mcgraw-Hill.

4. Herbert Schildt, “C: The Complete Reference”, 4th

edition, Tata Mcgraw-Hill.




a.


�


�


�


�

e. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools. �

f.


�


�


i. Have an ability to analyze the social and human context of computing and be aware of contemporary issues. �


�


�


PHYSICS LAB – I


IT151/ PHL01

Lectures : 3 Periods/Week Continuous Assessment : 40


Course Description:

Develops a scientific temper and analytical capability in the engineering graduates

through the learning of physical concepts and their application in engineering and technology.

Comprehension of some basic physical concepts will enable graduates to think logically the

engineering problems that would come across due to rapidly developing new technologies.

Course Objectives:










a.


�


�


�


�


�

f.






�



CHEMISTRY LAB – I


IT152/ CYL01



Course Objectives:

The student should be conversant:

1. With the principles of water characterization and treatment of water for potable and

industrial purposes.

2. With the principles of polymer chemistry and engineering applications of polymers

3. With Industrial applications of surface chemistry

4. With the conventional and non-conventional energy sources and energy storage devices

and Chemistry of engineering materials

Course Outcomes:

Imparting sound fundamental knowledge in the principles of chemistry involving the different

application oriented topics required for all engineering branches.




a.






f.



�






COMPUTER PROGRAMMING LAB

(Common to all Branches)

IT153/ CSL01



Prerequisites:Mathematics,English.

Course Objectives:


1. know how to write and debug programs using an IDE

2. know The principles of designing structured programs

3. know when and how to use the appropriate statements available in the C language

4. explain the principles of structured program design

5. understand what is meant by a well designed program

6. describe when and how to use the stand C statement

7. Write, Compile and Debug basic C programs using an IDE and using a workstation

8. Write basic C programs using

vii. Selection statements,

viii. Repetitive statements,

ix. Functions,

x. Pointers,

xi. Arrays,

xii. Strings

Course Outcomes:

Upon completing this course, the student will be able to

1. Use Common terminology or Jargon related to the software development process

2. Understand the importance of the software development process - from specification to

design to implementation to testing and review.

3. Recognize of the value of documentation at different stages of the software development

process, including the production of a specification document, a design document, flow

chart, a test plan and results.

4. Understand the function and operation of development of software such as the compiler,

interpreter, editor, Integrated Development Environment and debugger.

5. Understand general principles of computer languages such as loops (while/for), conditional

branching (if/switch), block structure, functions (including parameter passing, prototypes

and recursion), input/output, arithmetic rules.

6. Learn how these principles are implemented in the C programming language.

7. Develop problem-solving skills to translate 'English' described problems into programs

written using the C language.

8. Understand how to use and manipulate variables and types to change the program state,

including numeric, character, array and pointer types, as well as the use of structures and

typedefs.

9. Understand the purpose of pointers for parameter passing, referencing and dereferencing,

and linking data structures.

10. Understand the purpose and use of function libraries.




a.


�


�


�


�

e. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools. �

f.


�


�


i. Have an ability to analyze the social and human context of computing and be aware of contemporary issues. �


�


�


MATHEMATICS – II


IT121/ MA02



Prerequisites: Elementary integral calculus, linear differential equations of second and higher order,

Elementary calculus.

Course objectives:

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

1. Compute the Fourier series expansion of f(x) with period 2L.

2. Compute complex form of Fourier series.

3. Compute errors and approximations.

4. To compute Laplace transformation for different functions and their inverses.

5. Properties of Laplace transformations.

6. Compute Laplace transformation using properties.

7. Compute solution of a differential equation using Laplace transformation.

8. To evaluate double and Triple integrals over a region.

9. Compute volume of solids between the surfaces.

10. Computing multiple integrals in polar form.

11. Compute normal vector of a surface and angle between the surfaces.

12. Significance of gradient.

13. Computing integration over curves and integration over surfaces.

Course Outcomes:

Provide students with the knowledge of

1. Representation of periodic functions corresponding to objects following periodic phenomenain

terms of sine and cosine functions.

2. Solving engineering problems that can be modeled as ordinary differential equations without

finding general solutions.

3. Transforming line integrals, double and triple integrals into one another in solving mathematical

models of some engineering applications.

Topics:

• Fourier Series

• Laplace Transforms

• Integral Calculus

• Vector Calculus

Reference Books:

1. “Advanced Engineering Mathematics”, Peter V. O’Neil, Thomsons Brooks/Cole.

2. “Advanced Calculus”, Murray R Spiegel, Schaum’s outline series.




a.


�


�


�


�


f.






�


�


ENGINEERING PHYSICS – II


IT122/ PH02







technologies.

Course Objectives:







Topics:

• Electron theory of solids & semiconductor physics

• Magnetic, Dielectric and Ferro-electric materials

• Advanced materials

• Analytical techniques

Reference Books:

1. “Material Science for scientists and Engineers”, Srinivasan&Srivastava, TMH Publishers.

2. “A text book of engineering physics”, M.N.Avadhanulu& P. Krushisagar, S.Chand Pub.

3. “Material Science”, VijayaRangarajan.




a.


�


�


�


�


�

f.






�



ENGINEERING CHEMISTRY – II


IT123/ CY02



Course Objectives:

The student should be conversant with the:

1. Principles of electrochemistry, electrochemical cells, emf and applications of emf

measurements.

2. mechanism of corrosion and Principles of corrosion control

3. Chemistry of Fuels and combustion

4. Industrial importance of Phase rule and alloys

5. Analytical techniques and their importance.

Course Outcome:

To make the student acquainted with the principles of corrosion, electrochemical cells, fuels,

alloys and different modern analytical techniques.

Topics:

• Electro Chemistry

• Corrosion And Corrosion Control

• Green Chemistry

• Liquid And Gaseous Fuels And Combustion

• Phase Rule And Alloys

• Analytical Techniques

Reference Books:

1. B.K.Sharma, “Engineering Chemistry”, Krishna Prakasan Media (P) Ltd., Meerut (2001).

2. “Enginering Chemistry”, J.C.Kuriacase&J.Rajaram, Tata McGraw Hill, New Delhi (2004).

3. “Chemistry of Engineering Materials”, R.P Mani, K.N.Mishra, CENGAGE learning.

4. “Applied Chemistry - A text for Engineering & Technology”, – Springar (2005).

5. “Text Book of Engineering Chemistry”, ShasiChawla, DhantpatRai Publishing Company,

NewDelhi (2008).

6. “Engineering Chemistry”, R. Gopalan, D. Venkatappayya, D.V. SulochanaNagarajan, Vikas

Publishers (2008).




a.






f.



�






DIGITAL LOGIC DESIGN

(Common to Computer Science & Information Technology)

CS/IT124



Prerequisite: Boolean algebra and Number System Fundamentals

Course Description: course focused on the fundamentals of number systems, Boolean algebra,

logic design, combinational circuits, and sequential circuits, Registers and Program Logic

Devices.

Course Objective:

1. Represent numbers and perform arithmetic in bases 2, 8, 10, and 16.

2. Encode symbols and numbers in binary codes.

3. Add and subtract using 2’s complement code.

4. Evaluate and simplify logical functions using Boolean algebra.

5. Represent logical functions in Canonical form and with AND, OR, NOT, XOR, NAND, NOR

logic gates.

6. Analyze and design combinatorial circuits.

7. Simplify combinatorial circuits using Karnaugh maps.

8. Implement functions with NAND-NAND and NOR-NOR logic.

9. Analyze and design modular combinatorial logic circuits containing decoders, multiplexers,

demultiplexers, 7-segments display decoders and adders.

10. Use the concepts of state and state transition for analysis and design of sequential circuits.

11. Use the functionality of flip-flops for analysis and design of sequential circuits.

Course Outcomes:

1. Students should be able to solve basic binary math operations using the logic gates.

2. Students should be able to demonstrate programming proficiency using the various

logical elements to design practically motivated logical units.

3. Students should be able to design different units that are elements of typical

computer’s CPU.

4. Students should be able to apply knowledge of the logic design course to solve

problems of designing of control units of different input/output devices.

5. Students should be able to wiring different logical elements, to analyze and

demonstrate timing diagrams of the units modeled.

6. Students should be able to design electrical circuitry using logical elements realized on

the base of different technologies.


Topics:

• Simplification Of Boolean Functions

• Combinational Logic

• Combinational Logic With Msi And Lsi

• Sequential Logic

• Registers, Counters

• Memories

• Programmable Logic

Reference Books:

1. Morris Mano, “Computer Engineering Hardware Design”, PHI.

2. R.P.Jain, “Modern digital electronics”, 3rd

edition, TMH.

3. A.Anandkumar, “Fundamentals of digital circuits”, 4th

edition, PHI.




a.



�


�



�

f.







�


ENVIRONMENTAL STUDIES


IT125/ BT01



Topics:

• Ecosystems

• Biodiversity

• Values of Biodiversity

• Threats to Biodiversity

• Conservation of Biodiversity

• Natural Resources: Exploitation and Related Pollution Problems

• Land, Forest, Water, and Energy

• Causes, Effects and Control of Air Pollution and Noise Pollution.

• Solid Waste Management

• Sustainability

• Environmental acts

• International Conventions

Reference Books:

1. Text Book of environmental studies, ErachBharucha, UGC.

2. Environmental Studies, AnubhaKaushik and C. P. Kaushik.

3. A basic course in environmental studies, S. Deswal and A. Deswal, DhanapathRai& Co.

4. Essentials of environmental studies, Kurian Joseph and R.Nagendram, Pearson Education Pt

Ltd, Delhi.

5. Environmental studies, R.Rajagopalan, Oxford University Press.

6. Environmental Pollution Control Engineering, C. S. Rao, Wiley Eastern Ltd., New Age

International Ltd.,

7. Introduction to Environmental Science, Anjaneyulu Y, B S Publications

8. Principles of Environmental Studies, Manoharachary C and Jayarama Reddy P, B S

Publications.

9. Comprehensive environmental studies- JP Sharma, Laxmi Publications.

10. Environmental Science, 11th

Edition – Thomson Series – By G Tyler Miller, Jr.

Environmental Science and Engineering by Dr. Suresh, K.Dhaneja, Publishers SK Kataria&

Sons, New Delhi-110006.




a.






f.



�






ENGINEERING GRAPHICS


IT126/ ME01



Prerequisites: Geometry in Mathematics of High School level and Coordinate Geometry in

Mathematics of 10+2 level.

Course Objectives:

On completion of the study of this subject, the student should be able to

1. Understand the importance of Engineering Drawing as an engineering communication

medium.

2. Learn the usage of drawing instruments to draw the objects according to the BIS code of

practice.

3. Understand the geometrical construction procedures with dimensioning.

4. Construct the curves like ellipse, parabola, hyperbola, cycloid and involutes.

5. Understand orthographic projection of points and lines along with traces of lines.

6. Understand and draw the projections of plane figures and regular solids.

7. Prepare isometric projections for the given orthographic drawings.

8. Prepare an engineering drawing of a given simple engineering part in first angle projection.

Course Outcomes:

On completion of this course, students will

1. Enhance their visualization skills

2. Improve the drawing communication skills

3. Read the engineering drawings

4. Implement the skills acquired in usage of Modeling software packages

5. Prepare the engineering drawing of the component useful for industries.

Topics:

• Curves

• Method Of Projections

• Projections Of Planes

• Projections Of Solids

• Isometric Projections

• Orthographic Projections

Reference Book:

1. Engineering Drawing by Dhananjay A Jolhe, Tata McGraw hill publishers Engineering

Drawing by Prof.K.L.Narayana& Prof. R.K.Kannaiah.




a.




�



f.


�







PHYSICS & CHEMISTRY LAB – II


IT161/ PHCYL01







technologies.

Course Objectives of Physics:







Course Objectives of Chemistry:

The student should be conversant with the:

1. Principles of electrochemistry, electrochemical cells, emf and applications of emf

measurements.

2. mechanism of corrosion and Principles of corrosion control

3. Chemistry of Fuels and combustion

4. Industrial importance of Phase rule and alloys

5. Analytical techniques and their importance.

Course Outcome:

To make the student acquainted with the principles of corrosion, electrochemical cells, fuels,

alloys and different modern analytical techniques.




a.


�


�


�

d.

Demonstrate an ability to implement and test a computing system or a component or a process, to evaluate and compare efficiencies of alternative solutions.

�


�

f.


g.

Have the knowledge of professional and ethical responsibilities in the corporate sector and be aware of contemporary issues.

�




�



ENGLISH LANGUAGE LAB


IT162/ ENL01



Prerequisites:

Course Objectives:

Course Outcomes:

Topics:

• Introduction to communication

• Introduction to skills

• Pronunciation drills

• Conversational skills

• Professional writings & skills

• Practical

Recommended Software:

1. Digital Language Lab - Networking Software, HiClass – Software.

2. English Language – Listening, Speaking Reading, Writing Skills: A lania series – English

Mastery, Levels A, B (Set of 2 CDs), English Discoveries (Set 0f 12 CDs).

3. English Grammar / Pronunciation: Live Action English Interactive, Speech Solutions

4. Dictionaries: Cambridge Advanced Learner’s, Oxford Genie & Advanced

5. Writing: Easy writer, Creative writing

6. Professional English: Telephonic English, English in mind

7. English for ETS: Barron’s, TOEFL Mastery, IELTS, GRE




a.




d.



f.


�

g.


�



�




WORKSHOP


IT163/ MEL01



Course Description:

Prerequisites:

Course Objectives:

Course Outcomes:

Topics:

1. Carpentry

2. Welding using electric arc welding process/gas welding

3. Sheet metal operations with hand tools

4. House wiring




a.




d.



f.


g.







MATHEMATICS–III

IT211/ MA03



Prerequisites: Elementary integral calculus, Ordinary linear differential equations and Fourier

series, Elementary calculus.

Course objectives:

On completing this course student will be able to

1. Obtain the Fourier integral representation of a given non periodic function over the given

interval.

2. Obtain the Fourier integral transform and inverse of that transform for a given function over

the given interval.

3. Use various properties of Fourier transform to obtain The Fourier transforms and their

inverses in various applications.

4. Study the basic concepts and definitions of partial differential equations.

5. Apply the basic series and transform for solution to partial differential equations.

6. Provide an application oriented computation for solving wave equation, heat equation and

steady state two dimensional heat flow.

7. Obtain the solution of equations by employing iteration and Newton Raphson method.

8. Construct Lagrange and Newton forward/backward difference interpolation polynomials for

a given set of data.

9. State and use the formulas for bounding the error in polynomial interpolation based on

derivatives, and for estimating error based on differences.

10. Fit a straight line or second degree polynomial to the given data by using method of least

squares.

11. Ordinary differential equations will be dealt with using numerical computational methods.

12. Apply numerical methods to obtain the solution of elliptic partial differential equations.

Course Outcomes:

On completing this course students will

1. Modeling and solving partial differential equations corresponding to vibration and radiation

phenomena.

2. Scientific computing techniques to overcome common computational difficulties in

engineering applications involving interpolation, integration and differential equations.

Topics:

• Fourier Integrals

• Fourier Cosine And Sine Transforms

• Partial Differential Equations

• Numerical Methods In General

• Numerical Integration And Differentiation

• Numerical Methods In Linear Algebra

Reference Book:

1. “Advanced Engineering Mathematics”, Peter V. O’Neil, Thomsons Brooks/Cole.




a.


�


�


�

d.


�


f.


g.





�


�


COMPUTER ORGANIZATION

CS/IT 212


Exam : 3 hours Final Exam Marks : 60

Prerequisites:IT 116/CS01–Computer Programming with C Language.

Course Objectives:On completing this course student will be able to

1. Understand the basic structure and operation of a digital computer.

2. Discuss in detail the operation of the arithmetic unit including the algorithms &

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

division.

3. Study the different ways of communicating with I/O devices and standard I/O interfaces.

4. Study the hierarchical memory system including cache memories and virtual memory.

5. Identify where, when and how enhancements of computer performance can be

accomplished.

6. Use concepts of computer organization in real-life settings using various PC performance

improvements.

Course Outcomes:On completing this course students will

1. Understand basic structure of a digital computer.

2. Perform arithmetic operations of binary number system.

3. Understand the organization of the Control unit, Arithmetic and Logical unit, Memory unit

and the I/O unit.

4. Become proficient in quantitative performance evaluation of computer systems.

5. Understand how programs and data are stored and represented in a computer system.

6. Master the foundations of computer arithmetic.

7. Understand the design and implementation of single-cycle, multi-cycle, pipelined, and

super-scalar architectures.

Topics:

• Basic Structure Of Computers

• Machine Instructions And Programs

• Basic Processing Unit

• Arithmetic

• The Memory System

• Pipelining

• Input/Output Organization

Reference Books:

1. “Computer Architecture and Organization”, John P. Hayes, Third Edition, McGraw Hill.

2. “Computer Organization and Architecture”, William Stallings, 6th Edition, Pearson/PHI.

3. “Computer Systems Architecture”, M. Morris Mano, Third Edition, Pearson/PHI.




a.


�



d.


�


�

f.


g.





�


�


COMPUTER GRAPHICS

CS/IT 213

Lectures : 3Periods/Week, Tutorial: 1 Continuous Assessment : 40


Prerequisites: IT 116/CS01–Computer Programming with C Language.

Course Objectives:

On completing this course students will be able to

1. Analyze where to apply computer graphics.

2. Analyze different display systems and their techniques.

3. Design the algorithms for generating geometric shapes.

4. Design and analyze the 2D&3D geometric transformations.

5. Design the clipping.

6. Design and analyze the animation.

Course Outcomes:


1. Have the clear idea regarding the applications of the computer graphics.

2. Design algorithms for different geometric shapes line, circle, ellipse...etc.

3. Perform scan line polygon filling, boundary filling.

4. Perform transformations (rotation, scaling, translation,shearing) on geometric objects.

5. Perform line clipping by different techniques against viewing window.

6. Perform polygon clipping against viewing window.

7. Understand the working of animation technique.

Topics:

• Introduction Computer Graphics

• Output Primitives

• 2-D Geometrical Transforms

• 2-D Viewing

• Three Dimensional Concepts

• 3-D Geometric Transformations

• 3-D Viewing

• Computer Animation

Reference Books:

1. “Computer Graphics Principles & practice”, second edition in C, Foley, VanDam, Feiner and

Hughes, Pearson Education.

2. “Computer Graphics”, Steven Harrington, TMH.

3. “Computer Graphics Second edition”, Zhigandxiang, Roy Plastock, Schaum’s outlines, Tata

Mc- Graw hill edition.




a.


�


�


�


�


�

f.


�




�


�



OBJECT ORIENTED PROGRAMMING

CS/IT 214


University Exam : 3 hours Final Exam Marks : 60


Course Objectives:


1. Demonstrate mastery of C++ syntax and semantics.

2. Create class hierarchies using OOP design.

3. Demonstrate mastery of fundamental object-oriented programming techniques using C++

data abstraction, information hiding, encapsulation, inheritance, and polymorphism.

4. Overload and override methods and understand the difference.

5. Demonstrate mastery of integrating STL components with C++ programs.

6. Create modular programs using accepted structured programming.

Course Outcomes:


1. Create correctly formatted C++ constants and variables of type int, float, and double. They

will know the different characteristics of these data types and where each type should be

used.

2. Create correctly formatted C++ expressions using operator precedence.

3. Understand object-oriented design and programming.

4. Understand the use of virtual functions to implement polymorphism.

5. Implement Files in C++.

6. Understanding overloading and overriding concepts.

7. Build programs units consisting of the sequence, selection, and repetition programming

structures of C++.

8. Understand dynamic memory allocation and pointers.

9. Create and call functions having arguments and return values. They will know when

arguments should be passed by value or reference.

10. Create simple classes having data members and member functions.

11. Understand the concept of template classes and be able to instantiate objects from both

regular and template classes.




Topics:

• An Overview Of C++

• Classes And Objects

• Arrays, Pointers, References And The Dynamic Memory Allocation

• Function Overloading, Copy Constructors And Default Arguments

• Operator Overloading

• Virtual Functions &Polymorphism

• Templates

• Exception Handling

• The C++ I/O System Basics

• C++ File I/O

• Runtime Type ID And The Casting Operators

• Namespaces, Conversion Functions And Other Advanced Topics

• Introducing Standard Template Library

Reference Books:

1. BjarneStroustrup, “The C++ Programming Language”, Special Edition, Pearson Education.

2. “C++ - How to Program”, Dietel&Dietel.

3. “Programming in C++”, Barkakati.

4. “Mastering C++”, Venugopal.




a.


�


�


�

d.


�


f.


�

g.





�


�


DISCRETE MATHEMATICAL STRUCTURES

CS/IT 215



Prerequisites: Mathematics, and logical reasoning

Course Objectives:


1. Construct simple mathematical proofs and possess the ability to verify them.

2. Understand logical arguments and logical constructs.

3. Get a better understanding of sets, functions, and relations.

4. Acquire ability to describe computer programs in a formal mathematical manner.

5. Possess the mathematical knowledge and maturity that are required for upper level

computer science courses.

6. Solve counting problems involving the multiplication rule, permutations, and combinations.

7. Work with graphs, and problems involved in the study of graphs.

8. Demonstrate the importance of graphs as a tool in a variety of areas.

Course Outcomes:


1. Perform operations on discrete structures such as sets, functions, relations, and sequences.

2. Formulate short proofs using the following methods: direct proof, indirect proof, and proof

by contradiction, and case analysis etc.

3. Apply algorithms and use definitions to solve problems to prove statements in elementary

number theory.

4. Construct mathematical arguments using logical connectives and quantifiers.

5. Verify the correctness of an argument using propositional and predicate logic and truth

tables.

6. Demonstrate the ability to solve problems using counting techniques and combinatorics in

the context of discrete probability.

7. Solve problems involving recurrence relations and generating functions.

8. Know the properties of equivalence relations and partial orderings.

9. Understand lattices and Boolean algebras.

10. Explain basic definitions and properties associated with simple planar graphs, including

isomorphism, connectivity, and Euler's formula, and describe the difference between

Eulerian and Hamiltonian graphs.

11. Use graphs and trees as tools to visualize and simplify situations.


Topics:

• Foundations

• Fundamentals Of Logic

• Mathematical Induction

• Elementary Combinatorics

• Recurrence Relations

• Recurrence Relations

• Relations And Digraphs

• Lattices And Enumerations

• Graphs

REFERENCE BOOKS:

1. C.L. Liu, “Elements of Discrete Mathematics”.

2. Rosen, “Discrete Mathematics”.




a.


�



d.


�


f.


g.





�


�


DATA STRUCTURES

CS/IT 216




Course Objectives:


1. Understand the concept behind an abstract data type.

2. Know how to correctly implement various abstract data types.

3. Understand how to select and use various data structures to solve problems and implement

algorithms.

4. Discuss the computational efficiency of inserting and retrieving data from various data

structures and of the principal algorithms for sorting, searching and hashing.

5. Discuss factors other than computational efficiency that influence the choice of certain data

structures and algorithms.

Course Outcomes:


1. Be familiar with basic techniques of algorithm analysis.

2. Be familiar with writing recursive methods.

3. Master the implementation of linked data structures such as linked lists and binary trees.

4. Be familiar with advanced data structures such as balanced search trees, hash tables,

priority queues and the disjoint set union/find data structure.

5. Be familiar with several sub-quadratic sorting algorithms including quick sort, merge sort

and heap sort.

6. Be familiar with some graph algorithms such as shortest path and minimum spanning tree.

7. Master the standard data structure library of a major programming language.

Topics:

• Algorithm Analysis

• Lists

• Stacks And Queues

• Sorting Preliminaries

• Trees

• Hashing

• Graphs

Reference Books:

1. Y.Langsam, M.J.Augeustein 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”, ThomsonBrooks / COLE, 1998.

3. Aho, J.E. Hopcroft and J.D. Ullman, “Data Structures and Algorithms”, Pearson Education

Asia, 1983.




a.


�


�


�


�


�

f.






�


�


OBJECT ORIENTED PROGRAMMING LAB

CS/IT 251



Prerequisites :IT 116/CS01–Computer Programming with C Language.

Course Objectives:


1. Justify the philosophy of object-oriented design and the concepts of encapsulation,

abstraction, inheritance, and polymorphism.

2. Design, implement, test, and debug simple programs in an object-oriented programming

language.

3. Describe how the class mechanism supports encapsulation and information hiding.

4. Design, implement, and test the implementation of "is-a" relationships among objects using

a class hierarchy and inheritance.

5. Compare and contrast the notions of overloading and overriding methods in an object-

oriented language.

6. Explain the relationship between the static structure of the class and the dynamic structure

of the instances of the class.

Course Outcomes:


1. Able to create correctly formatted C++ constants and variables of type int, float, and

double. They will know the different characteristics of these data types and when each type

should be used.

2. Able to create correctly formatted C++ expressions using the operator precedence.


4. Understand the use of virtual functions to implement polymorphism.

5. Implement Files in C++.

6. Understanding overloading and overriding concepts.

7. Be able to build programs units consisting of the sequence, selection, and repetition

programming structures of C++.


9. Able to create and call functions having arguments and return values. They will know when

arguments should be passed by value or reference.

10. Able to create simple classes having data members and member functions.

11. Understand the concept of template classes and be able to instantiate objects from both

regular and template classes.






a.


�


�


�

d.


�


f.


�

g.





�


�


DATA STRUCTURES LAB

CS/IT 252



Prerequisites : IT 116/CS01–Computer Programming with C Language.

Course Objectives:


1. Familiar with good programming design methods, particularly Top-Down design to solve all

sorts of complicated problems.

2. Understand the study of the Topics related to courses like “Principles of Programming

Languages”, “programming methodologies”, and “design & analysis of algorithms” through

knowledge of Data Structures.

3. Develop algorithms for manipulating stacks, queues, linked lists, trees, and graphs, Hashing

Techniques, searching and sorting.

4. Develop the data structures for implementing the above algorithms.

5. Develop recursive algorithms as they apply to trees and graphs.

6. Familiar with the issues of Time complexity and examine various algorithms from this

perspective.

7. Familiar the student with the concepts and help in mastering their applications in real

software projects.

Course Outcomes:


1. Write well-structured complex programs using the Concepts of data structures.

2. Implement and analyze different sorting algorithms like Bubble, Insertion, Selection, and

Quick, Merge, Shell and Heap sorting.

3. Understand and implement the List Abstract Data Type (ADT) using both array based and

linked-list based data structures, including single, double and circular linked-lists and its

applications.

4. Understand and implement the Stack ADT using both array based and linked-list based data

structures and also implement Stack applications;

5. Understand and implement the Queue ADT and Circular Queue ADT using both array based

and linked-list based Data structures.

6. Understand and implement binary tree ADT using linked list based data structures

7. Understand and implement AVL tree operations and implement graph traversal techniques.

8. Understand and implement different hashing techniques like separate chaining and open

addressing;




a.


�


�


�

d.


�


�

f.


g.





�


�


COMPUTER HARDWARE AND SOFTWARE LAB

CS/IT 253



Prerequisites : Having Computer Knowledge

Course Objectives:


1. Understand basic concepts of computer’s hardware and software

2. Assemble the computer.

3. Connect the computers in Network.

4. Troubleshoot the system.

Course Outcomes:


1. Identify external ports and interfacing.

2. Explore Mother Board components and Layouts.

3. Partition and format Hard disks.

4. Install and Uninstall system and application software.

5. Understand BIOS configuration.




a.




�



�

f.





�


�


�


PROBABILITY & STATISTICS

IT221/ MA05



Prerequisites: Basic Arithmetic

Course objectives:


1. Understand the theory of probability, both discrete and continuous, including some

combinatorics, a variety of useful distributions, expectation and variance, analysis of sample

statistics

2. Develop the ability to solve problems using probability.

3. Introduce students to some of the basic methods of statistics and prepare them for further

study in statistics.

4. Develop abstract and critical reasoning by studying logical proofs and the axiomatic method

as applied to basic probability.

5. Make connections between probability and other branches of mathematics, and to see

some of the history of probability.

6. Understand the concepts of probability, random variables and their distributions, in

particular the binomial distribution and normal distributions.

Course Outcomes:


1. Use the principles of hypothesis testing, including power, and appropriately apply a range of

statistical tests.

2. Use a statistical package, both for numerical work and to help to analyze the data.

3. Demonstrate an understanding of basic principles of probability, and sample spaces.

4. Demonstrate understanding of conditional probability, independence.

5. Know the basic continuous distributions (Uniform, Normal, Student t, Gamma and Beta) and

know how to work with them.

6. Know how to calculate fundamental concepts such as the cumulative distribution function,

expectations, and distributions for functions of random variables.

7. Know how to describe distributions using graphs and numerical descriptors.

8. Use the basic methods of point estimation.

9. Evaluate estimators, construct confidence intervals, and perform hypothesis tests in the

context of a single population sample.

10. Set up probability models for a range of random phenomena, both discrete and continuous.

11. Apply the notions of conditional probability.


Topics:

• Probability Densities

• Sampling Distribution

• Inferences Concerning Means

• Inferences Concerning Variances

• Inferences Concerning Proportions

• Analysis Of Variance

• Statistical Content Of Quality-Improvement Programs

• Applications To Reliability And Life Testing

Reference Books:

1. “Probability & Statistics for Engineers and Scientists”, R.E Walpole, R.H. Myers & S.L. Myers,

6th

Edition, PHI.

2. “Probability & Statistics”, Murray R Spiegel, John J.Schiller, R.AluSrinivasa, Schaum’s Outline

series.




a.


�


�


�

d.


�


f.


g.





�


�


ELECTRONIC DEVICES & CIRCUITS

IT222/ EC01



Prerequisites: Physics

Course objectives:


1. Understand the operating principles of major electronic devices, circuit models and

connections to the physical operation of devices.

2. Identify and analyze various passive and active electronic components from observation

and symbols.

3. Analyze the characteristics and properties of major electronic devices.

4. Utilize the properties of electronic devices to design electronic circuits.

5. Evaluate results by varying design parameters directly or by computer simulation

6. Solve problem by designing electronic circuits with computer simulation software

7. Operate, read, and analyze data from various measurement instruments such as, multi-

meters, Oscilloscopes, and signal generators.

8. Analyze and interpret functions of an electronic circuit from the properties of each

component in the circuit.

9. Correlate inputs and outputs of a circuit from the properties of circuit elements.

10. Explain discrepancies between the results of a theoretical circuit and physical

implementation.

11. Troubleshoot an electronic circuit in steps, component by component, as well as by blocks

of circuit diagram, or groups of components.

12. Apply this knowledge to the analysis and design of basic circuits.

13. Have the ability to analyze and design discrete or integrated electronic circuits.

Course Outcomes:


1. Understand the semiconductor physics of the intrinsic, p and n materials

2. Give an overview of various semiconductor devices.

3. Understand amplifier circuits, oscillators and filter circuits employing BJT,FET devices.

4. Understand the function and operation of diodes, transistors and logic gates

5. Build and test operational amplifier-based analogue circuits

6. Build and test combinational and sequential logic circuits

7. Use computer-based simulation software packages to construct and test the operation of

analogue and digital circuits.


Topics:

• Semiconductor Diodes

• Bipolar Junction Transistor

• Unipolar Devices

• Feedback And Oscillator Circuits

• Operational Amplifiers

• Linear Ics

Reference Books:

1. Milliman&Halkias, “Integrated Electronics”, Tata McGrawHill Publishers.

2. S.Salivahanan, Vallavaraj, “Electronic Devices and Circuits”, Tata McGraw Hill Publishers.




a.




�



�

f.








ELECTRICAL TECHNOLOGY

IT223/ EE04




Course objectives:


1. Learn the basic principles of electricity and terminology.

2. Learn to use the resistor color code.

3. Measure the fundamental electrical quantities using digital and analog multi-meters and an

oscilloscope.

4. Understand and apply fundamental electrical theory and laws in basic series dc circuits

including Ohm's Law, Power, and Kirchhoff's Voltage Law.

5. Understand and apply fundamental electrical theory and laws in basic parallel dc circuits to

Ohm's Law.

6. Understand and apply fundamental electrical theory and laws in basic parallel dc circuits to

Power and Kirchhoff's Voltage Law.

7. Learn how to use a signal generator to obtain a desired voltage or frequency.

8. Learn why and how safety precautions must be practiced.

Course Outcomes:


1. The student will be able to analyze and solve technical problems.

2. The student will be able to use correct technical jargon.

3. The student will be able to analyze and solve problems in basic dc circuits including series

circuits and parallel circuits using correct theory, laws, and formulas.

Topics:

• DC Machines

• Transformers

• Three Phase Induction Motors

• Single Phase Induction Motors

• Stepper Motors

• Synchronous Machines

Reference Books:

1. Vincent Del Toro, “Fundamentals of Electrical Engineering”, Pearson Education.

2. H Cotton, “Advanced Electrical Technology”, AH Wheeler & Co., 1990.

3. Eugene C Lister, “Electric Circuits and Machines”, New York, MCGraw-Hill, 1975.

4. B.L Theraja&A.K.Theraja, “A Text Book of Electrical Technology”, 23rd Revised Edition,

S.Chand& Company Ltd., New Delhi, 2005.




a.




�



�

f.








GUI PROGRAMMING

CS/IT 224



Prerequisites:IT 116/CS01–Computer Programming with C, IT 214 – Object Oriented

Programming.

Course objectives:


1. Understand fundamentals of object-oriented programming in Java, including defining

classes, invoking methods, using class libraries, etc.

2. To write a computer program to solve specified problems.

3. Use the Java SDK environment to create, debug and run simple Java programs.

4. Understand the fundamental concepts of object-oriented design, including information

hiding, inheritance and polymorphism.

5. Understand the fundamentals of object-oriented programming in Java.

6. Write applets and applications.

7. Compare and contrast procedural and object-oriented programming.

8. Design and implement object-oriented solutions to simple and moderately complex

problems.

9. Write programs that use File I/O in Java.

10. Learn the essentials of the Java class library, and learn how to learn about other parts of the

library when you need them.

11. Introduce event driven Graphical User Interface (GUI) programming

12. Compile and execute them under the Sun Microsystems, Inc. Java 2 Platform, Standard

Edition, or other Integrated Development Environments (IDEs) such as NetBeans.

Course Outcomes:


1. Understand the format and use of objects.

2. Understand basic input/output methods and their use.

3. Understand object inheritance and its use.

4. Understand development of JAVA applets vs. JAVA applications.

5. Understand the use of various system libraries.

6. Write, debug, and document well-structured Java applications of up to 500 lines.

7. Implement Java classes from specifications.

8. Effectively create and use objects from predefined class libraries.

9. Understand the behavior of primitive data types, object references, and arrays.

10. Use decision and iteration control structures to implement algorithms.

11. Write simple recursive algorithms.

12. Use interfaces, inheritance, and polymorphism as programming techniques.

13. Use exceptions.

Topics:

• Introduction

• Classes And Objects

• Inheritance, Interfaces, Packages, Strings

• Library

• Exception Handling

• Multithreading

• I/O Streams

• Applets


• Event Handling

• AWT, Swing – I, Swing- II

• JDBC Connectivity

• Networking

Reference Books:

1. “Java How to Program”, Sixth Edition, H.M.Dietel and P.J.Dietel, Pearson Education/PHI.

2. “Core Java 2”, Vol 1, Fundamentals, Cay.S.Horstmann and Gary Cornell, Seventh Edition,

Pearson Education.

3. “Core Java 2”, Vol 2, Advanced Features, Cay.S.Horstmann and Gary Cornell, Seventh

Edition, Pearson Education.

4. “Beginning in Java 2”, Iver Horton, Wrox Publications.

5. “Java”, Somasundaram, Jaico.

6. “Introduction to Java programming”, By Y.DanielLiang,Pearson Publication.




a.


�


�


�


�


f.


�





�


�


SYSTEM SOFTWARE

CS/IT 225



Prerequisites: Basic knowledge of Computer and Programming, IT 253 – Computer Hardware

and Software lab, IT 116/CS 01 – Computer Programming with C.

Course Objectives:


1. Understand the relationship between system software and machine architecture.

2. Know the design and implementation of assemblers.

3. Know the design and implementation of Linkers and Loaders.

4. Have an understanding of macro processors.

5. Have an understanding of System software tools.

Course Outcomes:


1. Have an understanding of foundation to design of assemblers.

2. Have an understanding of foundation to design of loaders.

3. Have an understanding of foundation to design of linkers.

4. Have an understanding of foundation to design of macro processors.

Topics:

• Introduction To System Software

• Assemblers

• Loaders and Linkers

• Machine Independent Loader Features

• Loader Design Options

• Macro Processors & Other System Software

• Interactive Debugging Systems

Reference Book:

1. “System Programming and Operating Systems”, D.M.Dhamdhere, 2nd

Edition, Tata McGraw

- Hill, 1999.




a.



�


�



�

f.







�


MICROPROCESSORS AND MICROCONTROLLERS

CS/IT 226



Prerequisites: IT 124 – Digital Logic Design, IT 212 – Computer Organization

Course Objectives:


1. Understand the architecture of 8086 microprocessor.

2. Understand the interfacing of peripheral devices with 8086 microprocessor.

3. Understand the programming of 8086 microprocessor.

4. Understand the architecture, programming and interfacing of 8051 micro controller

5. Over view the Microcomputer Structure and operation

6. Understand the Internal Architecture of 8086 Microprocessor

7. Understand 8086 Instruction set

8. View of the main Assembly Instructions

9. 8086 Interrupt System

10. Peripherals and its interfacing with processors

11. Troubleshoot and design problems

12. Study the addressing modes & instruction set of 8086 microprocessor&8051

microcontroller.

13. Introduce the need & use of Interrupt structure.

14. Develop skill in simple program writing.

15. Introduce commonly used peripheral/ interfacing ICs.

Course Outcomes:


1. Use the standard ports and interface devices on a typical microcontroller.

2. Write simple assembly language programs which utilize microcontroller resources.

3. Gain adept knowledge in Microprocessor terminologies.

4. Explain the basics of Microprocessors including their structure, operation and interface with

systems.

5. Understand the basics of interfacing various types of Memory with Microprocessors.

6. Understand the basics of programming Input/Output.

7. Convert ideas into programs written with the 8086 instruction set.

8. Understand the industrial standards in Microprocessors and Microcontrollers.

9. Design a simple microcontroller system for real applications.

Topics:

• The 8086 Microprocessor Family

• 8086 System Connections, Timing

• 8086 Interrupts And Interrupts Responses

• Interfacing Peripherals And Applications

• The 8051 Microcontrollers

• Micro Controllers

Reference Books:

1. Yu-cheng Liu, Glenn A. Gibson, “Microcomputer systems: The 8086 /8088 Family

architecture, Programming and Design”, Second edition, Prentice Hall of India, 2003.


2. Barry B. Brey, “The Intel Microprocessors, 8086/8088, 80186/80188, 80286, 80386, 80486,

Pentium, PentiumPro Processor, PentiumII, PentiumIII, PentiumIV, Architecture,

Programming & Interfacing”, Sixth Edition, Pearson Education / Prentice Hall of India, 2002.

3. “8051 Micro Controller Architecture-Programming and Applications”, Kenneth J.Ayala.




a.


�


�


�

d.



�

f.


g.






�


ELECTRONIC DIVICES AND CIRCUITSLAB

IT 261/ ECL01




Course Objectives:


1. The objective of this Lab is to give to the students a through growing about the

experimental techniques.

2. The Laboratory covers all the experiments relating to various facts of using semiconductor

devices in electronic circuits.

3. It deals mail with the characteristics of the device and its utilization.

4. This Lab is broadly divided into circuits using special semiconductor devices such as uni-

junction transistor and silicon controlled rectifier.

5. In each experiment the student gets an insight into the working of the device and its

optimum utilization.

6. Where ever necessary a brief theory of the working of the device is included.

7. The Laboratory can be regarded as a self contained one.

8. Methods of performing the experiment, tabulating the results and where ever necessary

graphical representation is given.

9. Student receives good training to handled with confidence, the measuring equipment

available in ay electronics and it is able to conduct more experiments about which he

receives theoretical knowledge during lecture hours.

10. Ability to assemble basic circuits concerning the characteristics of diodes and bipolar and

field-effects transistors.

11. Ability to verify theoretical concepts concerning the characteristics of diodes and bipolar

and field-effects transistors.

12. Ability to interpret experimental results concerning the characteristics of diodes and bipolar


13. Ability to assemble basic circuits concerning the characteristics of diodes and bipolar and

field-effects transistors.

14. Ability to verifies theoretical concepts concerning the characteristics of diodes and bipolar


15. Ability to interpret experimental results concerning device applications including multistage

amplifiers, differential amplifiers, operational amplifiers, and oscillators.


Course Outcomes:


1. To apply the concepts and analytical principles to analyze electronic (diodes, transistors, op-

amps) circuits.

2. Understanding of the operation of op-amps, diodes and transistors in order to build circuits.

3. Learning to conduct experiments involving electric and electronic components and to

analyze and interpret the measurements results.

4. Designing, contruct and characterize electric and electronic circuits according to

specification.

5. Getting familiar with state of the art electronic test equipment and hardware/software

tools to characterize the behavior of electric and electronic devices and circuits.

6. Improve your ability to communicate effectively through weekly written reports and lab

notebooks.




a.




�

d.



�

f.


g.







MICROPROCESSORS AND MICROCONTROLLER LAB

CS/IT 262



Prerequisites: IT 124 – Digital Logic Design, IT 212 – Computer Organization

Course Objectives:

In this course students will

1. Familiarize with Architecture of 8086 processor,Assembly language programming &

Interfacing with various modules.

2. Get practical experience with microcontroller systems;

3. Gain experience with assembly language programming.

4. Be provided a "hands-on" experience with microprocessor system studied in theCS 325

lecture course.

5. Be able to do Simple arithmetic operations using assembly language programming.

6. Be able to do Programming with control instructions.

7. Be able to do Interface Experiments.

8. Be able to do Programming practice on assembler and simulator tools.

9. Be able to do Demonstration of basic instructions with 8051 Micro controller execution.

Course Outcomes:


1. Have knowledge to program using 8086 microprocessor.

2. Be equipped with the basic knowledge of microprocessor and microcontroller interfacing

and their applications.

3. Develop flow charts that outline the sequence of instructions to accomplish an assigned

task.

4. Interpret programs in assembly language Format.

5. Analyze the interfacing circuitry and programs required for peripheral support chips and

other hardware.

6. Explains the different analog/digital hardware and software interfacing approach.

7. Be able to modify existing programs.

8. Develop control specific programs.




a.


�


�


�

d.



�

f.


g.






�


GUI PROGRAMMING LAB

CS/IT 263



Prerequisites: IT 116/CS 01–Computer Programming with C Language, IT 214 – Object Oriented

Programming

Course Objectives:

In this course students will

1. Understand basic GUI concepts.

2. Learn the Java Programming Language.

3. Become familiar with the Java API.

4. Understand and be comfortable developing software using the three programming

paradigms: procedural programming, object-oriented programming, and event driven

programming.

5. The goal of this courseis to guide you into a way to be an intermediate or advanced

developer.

6. Learn thread programming with Java.

7. Learn Input/Output Stream in java.

8. Learn Java Networking programming.

9. Learn JDBC (Java Database Connectivity) programming.

Course Outcomes:


1. Design, write, debug, and execute applets and programs in Java using one of the popular

development environments.

2. Design, write, debug, and execute applets and programs in Java using an object-oriented

approach.

3. Design, write, and debug applets in Java that run in a World Wide Web browser such as

Netscape Navigator, Microsoft Explorer, or Mozilla.

4. Use the existing standard Java class libraries and their Application Programming Interfaces

(APIs) to develop applets and programs in Java.

5. Design, write, and debug applets and programs in Java that include use of class data

members and member methods.

6. Use the standard Java data types (e.g., integers, double, arrays) to write applets and

programs in Java.

7. Use the standard Java control structures to write applets and programs in Java.

8. Design, write, and debug applets and programs in Java that use a multi-level class hierarchy

and inheritance.

9. Design, write, and debug applets and programs in Java that use method and variable

overriding and overloading.

10. Design, write, and debug applets/programs in Java that include graphics components.

11. Design, write, and debug applets/programs in Java that include graphical user interfaces

(GUIs) and components.

12. Design, write, and debug applets/programs in Java that use files and streams.

13. Write documentation that is included in the internal program modules.




a.


�


�


�

d.


�


f.


�

g.





�


�


PROFESSIONAL ETHICS & HUMAN VALUES

CS/IT 311



Prerequisites:Pursuing moral ideals and virtues

Course Objectives:

1. The student will understand definitions and key terms associated with ethical issues in

modern computing technology

2. Become familiar with the different approaches to identifying and resolving ethical concerns

3. Identify distinctions between relevant terms that are often loosely used or poorly defined in

commonspeech

4. Become familiar with some of the more common professional codes of ethics

5. Analyze and interpret ethical arguments for validity and applicability

6. Examine the underlying logic and rules for moral and ethical standards

7. Evaluate the moral and ethical responsibilities held by computing professionals

8. Analyze the arguments and issues relating to security and privacy in cyberspace

9. Propose and defend ethical points in the field of computing and communication

technologies

10. Participate in a debate in favor of an ethics-based resolution.

Course Outcomes:

On the completion of the course the students will be able to

1. Comprehend basic issues in engineering and computer ethics

2. Analyze the impacts of information and communication technologies.

3. Look at the connection between ethics and technology, the ethical issues emerged in the

information society

4. Gain an understanding about the ethical principles, professional responsibilities and codes

of conduct via surveying the engineer’s obligations to society, employer and client.

5. Acquire a broad perspective on the social and ethical impacts and implications of

information technology.

6. Understand various ethical issues surrounding computers.

7. Acquire specific knowledge about major issues in several different areas of the field of

computer ethics.

8. Understand information privacy, Intellectual property, and security.

9. Acquire in-depth knowledge of at least one significant ethical issue generated by

information technology.

Topics:

• Human Values


• Understanding Ethics

• Moral Reasoning and Ethical Theories – I

• Moral Reasoning and Ethical Theories – II

• Engineering as Social Experimentation

• Engineers' Responsibility for Safety and Risk

• Responsibilities and Rights

• Global Issues

• Ethical Audit

• Case Studies

Reference Books:

1. “Ethics in Engineering”, Mike W Martin, Ronald Schinzinger, TMH Publications.




a.






f.



�






DATA COMMUNICATIONS

CS/IT 312



Prerequisites:IT116 / CS01,IT 111 / MA01, IT 121 / MA02, IT 211/MA03 - Sound knowledge in

mathematics.

Course Objectives:

The student will

1. Understand the basics of computer communication, and the ways in which the various

methods of accomplishing this are implemented.

2. Become familiar with widely- used Internet protocols such as HTTP, TCP/IP, UDP, etc.

3. Identify the specific features of various types of computer networks, and explain how their

characteristics suit them for use in different situations.

4. Examine and explain advanced research projects and present advanced concepts in

networking.

5. Obtain hands-on experience using network sockets.

6. Implement a basic networking system such as a generic client-server model.

Course Outcomes:

After completion of this course, the student will be able to:

1. Identify various network services, characteristics, elements, standards and technologies.

2. Describe the layered architecture of computer networks and the operation of main

protocols in the TCP/IP model.

3. Identify, compare and contrast different techniques and design issues of core functions such

as addressing, routing, internetworking, switching, multiplexing, error and flow control,

medium access and coding.

4. Implement simple client-server applications using socket programming.

5. Effectively use commonly used network-related commands, monitoring tools, traffic

analyzers and network simulators. [Program Outcome i]

6. Demonstrate the ability to setup a small network and properly configure network

components including switches, routers and services (such as RAS, FTP, DNS, Web, DHCP,

POP3).

7. Explain potential threats to network resources and various security mechanisms.


Topics:

• Data Communications & Networking Overview

• Protocol Architecture

• Data Transmission

• Guided and Wireless Transmission

• Signal Encoding Techniques

• Digital Data Communication Techniques

• Data Link Control

• Multiplexing

• Circuit Switching & Packet Switching

• Local Area Network Overview

• High-speed LANs

Reference Books:

1. Wayne Tomasi, “Introduction to Data Communications and Networking”, PHI.

2. BehrouzA.Forouzan, “Data Communications and Networking”, Fourth edition, TMH.

3. GodBole, “Data Communications & Networking”, TMH.




a.


�


�


�

d.


�


f.


g.






�


AUTOMATA THEORY & FORMAL LANGUAGES

CS/IT 313



Prerequisites:CS/IT215-Basic Discrete Mathematics and logic. Introduce concepts in Automata

Theory and Theory of Computation.

Course Objectives:

1. Get the students will understanding of the theory of automata and formal languages.

2. Construct finite accepters, and convert between deterministic and

nondeterministicimplementations.

3. Demonstrate the connection between regular expressions, languages, and grammars.

4. Describe and simplify a context-free grammar for a given language.

5. Demonstrate the connection between pushdown automata and context-free languages.

6. Analyze and design Turing machines for a given task.

Course Outcomes:

After completion of this course the graduates in Information Technology will be able to

1. Demonstrate an ability to apply the knowledge of Mathematics, Computer Science and

Engineering appropriate to the development of software systems to solve real world

problems.

2. Demonstrate an ability to analyze a problem and design a computing system or a

component or a process confirming to standards using various methodologies and

architectures.

3. Analyze and understand an existing software system and extend the system to meet

evolving requirements.

4. Demonstrate an ability to implement and test a computing system or a component or a

process, to evaluate and compare efficiencies of alternative solutions.

5. Demonstrate an understanding of the emerging technologies and a working knowledge of

software and hardware tools.

6. Interact professionally with peers and clients with diverse cultures and medium of

communication located in geographically dispersed locations in the context of computing

and software engineering.

7. Exhibit the knowledge of professional and ethical responsibilities in the corporate sector

and be aware of contemporary issues.

8. Demonstrate the ability to communicate effectively in both verbal and written form.

9. Show ability to analyze the social and human context of computing and be aware of

contemporary issues.

10. Recognize the need for continuing education, research and professional development.

11. Possess the knowledge and skills for employability and to succeed in national and

international level competitive examinations.


Topics:

• Automata

• Finite Automata

• Automata with ∈ transitions

• Regular Expressions and Languages

• Properties of Regular Languages

• Context Free Grammars

• Pushdown Automata

• Context free languages

• Properties of Context free languages

• Introduction to Turing Machines

• Undecidability

Reference Books:

1. Cohen, “Computer Theory”, KLP Mishra &N.Chandrasekharan, “Theory of Computation”,

PHI.

2. H.R.Lewis, C.H.Papadimitriou, “Elements of The theory of Computation”, Second Edition,

Pearson Education, 2003.

3. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition, Tata

McGraw Hill, 2003.

4. MichealSipser, “Introduction of the Theory and Computation”, Thomson Brokecole, 1997.

5. Ragade, “Automata and Theoretical Computer Science”, First Edition, Pearson Education,

2004.

6. John E Hopcroft& Jeffery D Ullman, “Introduction to Automata Theory & Languages and

Computation”, Narosa Publishing House.




a.


�


�


�


�


f.


�





�


�


OPERATING SYSTEMS

CS/IT 314



Prerequisites: IT 116/ CS01–Computer Programming with C, CS/IT214 - Object-Oriented

Programming using C++, CS/IT225 – System Software.

Course Objectives: The student will

1. Understand semaphores, IPC abstractions, shared memory regions, etc.

2. Understand how the operating system abstractions can be used in the development of

application programs, or to build higher level abstractions

3. Understand how the operating system abstractions can be implemented

4. Understand the principles of concurrency and synchronization, and apply them to write

correct concurrent programs/software

5. Understand basic resource management techniques (scheduling or time management,

space management) and principles and how they can be implemented. These also include

issues of performance and fairness objectives, avoiding deadlocks, as well as security and

protection.

Course Outcomes:

By the completion of the course, the students will be able to:

1. Explain the objectives and functions of modern operating systems.

2. List the different architectures of single/multiple processor systems.

3. Cite the advantages and disadvantages of using interrupt processing.

4. Compare kernel and user mode in an operating system.

5. Describe how operating systems have evolved over time from primitive batch systems to

sophisticated multiuser systems.

6. Compare and contrast the various ways of structuring an operating system such as object-

oriented, modular, micro-kernel, and layered.

7. Describe reasons for using interrupts, dispatching, and context switching to support

concurrency in an operating system.

8. Define the types of processor scheduling such as short-term, medium-term, and long-term.

9. Describe the difference between processes and threads.

10. Compare and contrast the common algorithms used for both preemptive and non-

preemptive scheduling of tasks in operating systems, such as FCFS, SJF, priority, Round

Robin, Multilevel queue and multilevel feedback queue.

11. Cite the various approaches to solving the problem of mutual exclusion in an operating

system.

12. Describe conditions that lead to deadlock.

13. Identify memory hierarchy and cost-performance trade-offs.

14. Describe the concept of virtual memory and how it is realized in hardware and software.

15. Cite the features and limitations of an operating system used to provide protection.

Topics:

• Computer System Overview

• Operating System Overview

• Process Description & Control

• Threads, SMP and Microkernels

• Concurrency: Mutual exclusion and Synchronization

• Concurrency: Deadlock and Starvation

• Memory Management


• Virtual Memory

• Uniprocessor Scheduling

• Multiprocessor and Real-Time Scheduling

• I/O Management and Disk Scheduling

• File Management

Reference Books:

1. William Stallings, “Operating Systems – Internals and Design Principles”, 5/e, Pearson.

2. Charles Crowley, “Operating Systems: A Design-Oriented Approach”, Tata McGraw Hill Co.,

1998 edition.

3. Andrew S.Tanenbaum, “Modern Operating Systems”, 2nd

edition, 1995, PHI.




a.


�



�


�


f.







�


DATABASE MANAGEMENT SYSTEMS

CS/IT 315



Prerequisites: High Level Programming Languages, CS/IT 214 – Object-Oriented Programming

using C++, and CS/IT 216 - Data Structures.

Course Objectives: In this course the student will

1. Develop an understanding of the nature of database-management systems (DBMSs),

including their structure, design, and evaluation.

2. Develop an understanding of the relationship between DBMSs and the analysis of

information systems in libraries and in business.

3. Develop an understanding of the distinctions among flat-file systems, network systems,

hierarchical systems, relational systems, and text-oriented systems.

4. Develop an understanding of the process of normalization of relational databases.

5. Develop an understanding of the role of the Structured Query Language (SQL) standards in

the current and future development of DBMSs.

6. Develop an understanding of management and social issues such as database security and

privacy.

7. Acquire an introductory level of skill in the use of selected microcomputer database-

management systems.

Course Outcomes:

On the completion of the course, the students will be able to: 1. Define a Database, characteristics and functions of Database Management System and

types of Database Users.

2. Distinguish between a Traditional File System and a Database System.

3. Describe Data Models, Schemas, Instances, Three Schema Architecture and DBMS

Component Modules.

4. Describe the Entity–Relationship (ER) modeling tool using Unified Modeling Language

(UML).

5. Model the real world database systems using Entity Relationship Diagrams (ERD) from the

requirements specification.

6. Define the Relational Data Model, its Constraints and the Relational Database Schemas.

7. Illustrate the Definition of Functional Dependencies , Inference Rules, Equivalence of Sets of

Functional Dependencies FDs, Minimal Sets of FDs.

8. List the three Normal Forms Based on Partial and Transitive Dependencies

9. Apply normalization techniques to normalize a database

10. Define the concept of Relational Algebra and the Relational Operations from Set Theory.

11. Design queries in Relational Algebra and Relational Calculus

12. Define disk storage devices, files of records, unordered files, ordered files and hashed files.

13. Demonstrate the use of SQL for database creation and maintenance

14. Use SQL queries for data aggregation, calculations, views, sub-queries, embedded queries,

manipulation, and report generation.

15. Implement PL/SQL triggers, functions. Procedures and packages for ensuring data integrity

and security.

Topics:

• Databases and Database Users

• Database System Concepts and Architecture

• Data Modeling Using the Entity-Relationship (ER) Model


• The Relational Data Model and Relational Database Constraints

• The Relational Algebra and Relational Calculus

• SQL-99: Schema Definition, Constraints, Queries, and Views

• Disk Storage, Basic File Structures

• Functional Dependencies and Normalization for Relational Databases

• Relational Database Design Algorithms and Further Dependencies

• Introduction to Transaction Processing Concepts and Theory

• Concurrency Control Techniques

• Database Recovery Techniques

• Database Security

Reference Books:

1. “Introduction to Database Systems”, C.J.Date Pearson Education.

2. “Data Base Management Systems”, Raghurama Krishnan, Johannes Gehrke,

TATAMcGrawHill, 3rd

Edition.

3. “Data base System Concepts”, Silberschatz, Korth, McGraw hill, 5th

edition.




a.


�


�


�

d.


�


�

f.


g.





�


�


WEB TECHNOLOGIES

CS/IT 316



Prerequisites: Introduction to the Internet,CS/IT216 - Data Structures.

Course Objectives:

1. To describe the basic infrastructure and architecture of the Internet, including the main

protocols.

2. To use tools to query parts of the Internet infrastructure including name servers, individual

machines, and web sites.

3. To list and describe contemporary Internet applications, their purpose, internal

architectures, and related security, commercial and social issues.

4. To design and to develop simple database driven web applications using a server-side

scripting language.

5. Given a screen shot or access to a web application, students will be able to apply for

appropriate techniques and principals to evaluate its usability and accessibility.

Course Outcomes:

After the completion of the course the student will

1. Understand the need for and be able to write validated XHTML 1.0.

2. Understand the principles of W3C WCAG 1.0 (as a minimum) and be able to write compliant

XHTML documents.

3. Understand and be able to apply sound, non-browser specific web design principles.

4. Understand and be able to use Javascript to access the DOM to reference web document

object CSS properties.

5. Understand the application of XHTML for document structure and content.

6. Understand and apply CSS definitions for document presentation.

7. Understand and apply Javascript, CSS & XHTML to create dynamic XHTML.

8. Be aware of emerging technologies and developing W3C recommendations.


Topics:

• Introduction to XHTML

• Cascading Style Sheets (CSS)

• JavaScript

• Dynamic HTML

• Building Ajax

• Servlets and Java Server Pages.

Reference Books:

1. Jason Cranford Teague, “Visual Quick Start Guide CSS, DHTML &AJAX”, 4e, Pearson

Education.

2. Tom NerinoDoli smith, “JavaScript & AJAX for the web”, Pearson Education 2007.

3. Joshua Elchorn, “Understanding AJAX”, Prentice Hall 2006.

4. Hal Fulton, “The Ruby Way”, 2e, Pearson Education 2007.

5. David A. Black, “Ruby for rails”, Dreamtech Press 2006.

6. Marty Hall, Larry Brown, “Core Servlets and JavaServer Pages™: Volume 1: Core

Technologies”,2nd Edition, Prentice Hall.




a.


�


�


�

d.


�


�

f.


g.




�


�


�


SOFT SKILLS LAB

IT 351 / ENL02



Pre Requisites: Politeness and respect towards others.

Course Objectives: In this course students will get

1. Effective communication and interpersonal skills are crucial to increase employment

opportunities and to compete successfully in the business environment.

2. Soft skills provide students with a strong conceptual and practical framework to build,

develop and manage teams.

3. A chance the development of the students’ overall personality, thereby enhancing their

career prospects

4. The soft skills training provides strong practical orientation to the students and helps them

in building and improving their skills in communication, the effective use of English,

business correspondence, presentations, team building, leadership, time management,

group discussions, interviews, and inter-personal skills.

5. Effective resume writing and dealing with placement consultants and headhunters.

Course Outcomes:Onthe completion of the course the students should be able to

1. Develop effective communication skills (spoken and written)

2. Develop effective presentation skills.

3. Conduct effective business correspondence and prepare business reports which produce

results.

4. Become self-confident individuals by mastering inter-personal skills, team management

skills, and leadership skills.

5. Develop all-round personalities with a mature outlook to function effectively in different

circumstances.

6. Develop broad career plans, evaluate the employment market, identify the organizations to

get good placement, match the job requirements and skill sets.

7. Take part effectively in various selection procedures adopted by the recruiters.

Reference Books:

1. “The Definitive Book Of Body Language”, Allan & Barbara Pease

2. “You Can Win”, Shiv Khera.

3. “Lateral Thinking”, Edward De Bono.

4. “How To Prepare For Group Discussions And Interview”, Hari Mohan Prasad, Rajnish Mohan,

2nd

Edition, TMH.

5. “Emotional Intelligence”, Daniel Goleman.

6. “The 7 Habits of Highly Effective People”, Stephen R. Covey.

7. “Working in Teams”, Sandy Pokras.




a.




d.



f.


�

g.


�



�




RDBMS LAB USING

ORACLE: SQL*PLUS, FORMS & REPORT TOOLS

CS/IT 352



Course Objectives:

1. To provide a sound introduction to the discipline of database management as a subject in

its own right, rather than as a compendium of techniques and product-specific tools.

2. To familiarize the participant with the nuances of database environments towards an

information-oriented data-processing oriented framework.

3. To give a good formal foundation on the relational model of data.

4. To present SQL and procedural interfaces to SQL comprehensively.

5. To give an introduction to systematic database design approaches covering conceptual

design, logical design and an overview of physical design.

6. To motivate the participants to relate all these to one or more commercial product

environments as they relate to the developer tasks.

7. To present the concepts and techniques relating to query processing by SQL engines.

8. To present the concepts and techniques relating to ODBC and its implementations.

9. To introduce the concepts of transactions and transaction processing .

10. To present the issues and techniques relating to concurrency and recovery in multi-user

database environments.

Course Outcomes:

On the completion of this course the student will be able to:

1. Understand, appreciate and effectively explain the underlying concepts of database

technologies

2. Design and implement a database schema for a given problem-domain

3. Normalize a database

4. Populate and query a database using SQL DML/DDL commands.

5. Declare and enforce integrity constraints on a database using a state-of-the-art RDBMS

6. Programme PL/SQL including stored procedures, stored functions, cursors, packages.

7. Design and build a GUI application using a 4GL




a.


�


�


�

d.


�


�

f.


g.





�


�


WEB TECHNOLOGIESLAB

CS/IT 353



Course Objectives:

To impart the knowledge of

1. Emerging web technologies used to create an e-commerce site.

2. The process of a development of complete e-commerce site (both front and back end).

3. Construction of e-commerce web site.

4. Exploring the advantages of emerging web technologies and what environment they are

being used in.

Course Outcomes:

After completion of this course the student will be ableto

1. Design and implement a basic website.

2. Implement different navigation strategies.

3. Use client-side technologies (XHTML, CSS, forms, JavaScript, and

4. Use server-side technologies (Servlets and JSP) to implementwebsites.

5. Develop simple back-end database to support a website.

6. Recognize and evaluate website organizational structure and design elements.

7. Communicate their evaluations orally and in writing.

8. Create an XML application.

9. Create a small Ruby on Rails application.




a.


�


�


�

d.


�


�

f.


g.




�


�


�


COMPUTER NETWORKS

CS/IT 321



Prerequisites:CS/IT 323 - UNIX Programming,CS/IT 312-Data Communications.

Course Objectives:

1. To provide the students with a sound theoretical and practical knowledge in computer

networks.

2. Providing good back ground in networking.

3. Prepare students for easy transfer from academia to real world.

Course Outcomes:


1. Understand the difference between circuit and packet switching

2. Be able to analyze different MAC mechanisms (Aloha, Slotted Aloha, TDMA, FDMA) and

understand their pros and cons

3. Learn the differences between random access and scheduled MAC mechanisms

4. Understand the difference between link state and distance vector routing.

5. Learn to carry out Dijkstra’s shortest path algorithm in a given network.

6. Understand how error control is implemented in telecommunication networks.

7. Mathematically model various error control schemes.

8. Understand the basics of the TCP/IP layer model, as well as the OSI 7 layer model.

9. Get an introduction on discrete and continuous stochastic processes.

10. Understand why Geometric and Exponential Distributions are often used in Communication

Systems modeling.

11. Be able to apply Littles formula to analyze the waiting time and system time of queuing

systems.

12. Be able to analyze and design any queuing system with exponential arrivals and service

rates.

13. Be able to simulate exponential and geometric processes as well as their respective

counting processes. (Computer Workout) to model traffic processes loading

communications network systems under design.


Topics:

• Introduction to Computer Networks

• Network Hardware

• Network Software

• Reference Models

• Network Layer

• Routing Algorithms

• Congestion Control Algorithms

• Quality of Service

• Internetworking

• The Network Layer in the Internet

• The Transport Layer

• Elements of Transport Protocols

• The Internet Transport Protocol (UDP)

• The Internet Transport Protocols (TCP)

• Application Layer

• The World Wide Web

• Multimedia

Reference Books:

1. Kurose & Ross, “COMPUTER NETWORKS– A Top-down approach featuring the Internet”,

Pearson Education, Alberto Leon,Garciak.

2. LeonGartia, IndraWidjaja, “Communication Networks Fundamental Concepts and Key

Architectures”, TMH.

3. Nader F.Mir, “Computer and Communication Networks”, PHI.




a.


�



�

d.


�


�

f.


g.




�


�


�


COMPILER DESIGN

CS/IT 322



Prerequisites:CS/IT 313 - Formal languages and Automata.

Course Objectives:The student will

1. Understand the theory and practice of compiler implementation.

2. Learn finite state machines and lexical scanning.

3. Learn context free grammars, compiler parsing techniques, construction of abstract syntax

trees, symbol tables, intermediate machine representations and actual code generation.

Course Outcomes:


1. Understand how the design of a compiler requires most of the knowledge acquire during

their study

2. Develop a firm and enlightened grasp of concepts learned earlier in their study like higher

level programming, assemblers, automata theory, and formal languages, languages,

languages specifications, data structure and algorithms, operating systems

3. Develop an in-depth knowledgestages of compiling.

4. Apply the ideas, the techniques, and the knowledge acquired for the purpose of other

software design

5. Develop fundamental knowledge of language specifications using context and free

grammars (CFG).

Topics:

• Introduction to compiling

• Simple one-pass compiler

• Lexical Analysis

• Syntax analysis

• Runtime Environment

• Symbol Tables

• Intermediate code Generation

• Code Generation

Reference Books:

1. Alfred V.Aho, Jeffrey D. Ullman, “Principles of Compiler Design”, Narosa publishing.

2. “Lex&Yacc”, John R. Levine, Tony Mason, Doug Brown, O’reilly.

3. “Modern Compiler Implementation in C”, Andrew N. Appel, CambridgeUniversity Press.

4. “Engineering a Compiler”, Cooper & Linda, Elsevier.

5. “Compiler Construction”, Louden, Thomson.




a.


�





f.








UNIX PROGRAMMING

CS/IT 323



Prerequisites:Students must have the prerequisite knowledge on the following topics:

• Basic Unix commands

• IT116 / CS01/CS/IT214 C/C++ programming knowledge

Course Objectives:

In this course student will

1. Understand the major components and describe the architecture of the UNIX operating

system

2. Log on and off of the UNIX system

3. Use the UNIX system documentation

4. Communicate with other users on a system using the mail and write commands

5. Organize and manipulate files and directories

6. Use of the vi text editor to create and modify files

7. Use selected features of the korn shell

8. Use UNIX utilities to create simple tools for the information processing

9. Understand how the shell functions at the user interface and command line interpreter.

10. Modify built-in shell variables and create and use user-defined shell variables.

11. Use I/O redirection, pipes, quoting, and filename expansion mechanisms.

12. Create structured shell programming which accept and use positional parameters and

exported variables.

13. Use shell flow control and conditional branching constructs (while, for, case, if, etc.)

14. Create shell programs which process interrupts, pass signals, invoke sub-shells and

functions, and trap signals.

15. Use shell debugging mechanisms to improve shell program efficiency and detect and correct

errors.

16. Develop the user interface menu system using shell programming constructs.

Course Outcomes:

On successful completion of the course, the student will be able to:

1. tell the difference between conventional function calls versus system calls in UNIX

2. classify system calls in UNIX

3. use threads in programs

4. Describe the relation of a thread to the concept of a process.

5. Differentiatecommunication between processes and between threads in the same process.

6. Define mechanisms for local and remote interprocess communication in UNIX.

7. Implement the client-server paradigm of computing with mechanisms of IPC.

8. Identify the System calls, protection, and interrupts of any UNIX.

Topics:

• Introduction to UNIX,UNIX Internals

• The STREAM EDITOR

• Programmable text processing

• Bourne Shell programming

• File management system calls

• Process Management

• Signals

• Inter process communication

Reference Books:

1. “The Design of UNIX operating System”, Maurice J.Bach, PHI.


2. “Advanced programming in the UNIX environment”, W Richard Stevens, 2nd

Edition,

Pearson education.

3. “UNIX programming environment”, Kernighan and pike, Pearson education.

4. “Your UNIX the ultimate guide”,Sumitabha Das, TMH, 2nd

edition.

5. “Advanced UNIX programming”, Marc J. Rochkind, 2nd

edition, Pearson Education.




a.


�


�


�



f.






�


�


SOFTWARE ENGINEERING

CS/IT 324



Prerequisites:High-Level languages.

Course Objectives:

1. To Impart the knowledge of basic SW engineering methods and practices, and their

appropriate application;

2. To give a general understanding of software process models such as the waterfall and

evolutionary models.

3. To give an understanding of the role of project management including planning, scheduling,

risk management, etc.

4. To give an understanding of software requirements and the SRS document.

5. An understanding of different software architectural styles.

6. To give an understanding of implementation issues such as modularity and coding

standards.

7. To give an understanding of approaches to verification and validation including static

analysis, and reviews.

8. To give anunderstanding of software testing approaches such as unit testing and integration

testing.

9. To give an understanding of software evolution and related issues such as version

management.

10. To give an understanding on quality control and how to ensure good quality software.

11. To give an understanding of some ethical and professional issues those are Important for

software engineers.

Course Outcomes:


1. Learn the basics of the life cycle of software

2. Analyze the requirements of a software development project

3. Implement a software development project in a team

4. Verify and validate a software development project.

5. Understand and manage the core ethical issues of software development process

6. Appreciate the importance of software engineering for the development of a software

project

7. Develop a positive attitude towards the development of a software project in a team

8. Develop the skills to work as a software designer and developer.


Topics:

• Introduction to Software Engineering

• A Generic View of Process

• Process Models

• An Agile View of Process

• Software Engineering Practice

• System Engineering

• Requirements Engineering

• Building the Analysis Model

• Design Engineering

• Creating an Architectural Design

• Modeling Component-Level Design

• Performing User Interface Design

• Software Process and Project Metrics

• Software Quality Assurance

• Software Testing Strategies

• Testing Tactics

• Product Metrics

Reference Books:

1. Ian Sommerville, “Software Engineering”, Sixth Edition, Pearson Education.

2. Carlo Ghezzi, Mehdi Jazayeri, Dino Mandrioli, “Fundamentals of Software Engineering”,

Second Edition, PHI.

3. RajibMall, “Fundamentals of Software Engineering”, Second Edition, PHI.




a.


�


�


�


�


�

f.





�


�


�


ENTERPRISE PROGRAMMING

CS/IT 325



Prerequisites: IT 224: GUI PROGRAMMING andIT 316: WEB TECHNOLOGY

Course Objectives:

To impart the in depth knowledge so that the student will

1. Understand the need of Enterprise JAVA applications.

2. Understand J2EE as an architecture and platform for building and deploying web-based, n-

tier, transactional, component-based enterprise applications.

3. Learn Java web programming with J2EE.

4. Understanding the object-oriented programming with J2EE and learn how to write

increasingly sophisticated J2EE programs.

5. Explore core object-oriented design patterns and their application to Java.

6. Learn core J2EE design patterns and know about various JEE components such as Servlets,

JDBC, Javabeans and RMI.

7. Learn how to build database-driven, Web applications using Java.

8. Learn the fundamentals of using the latest Java Web application development features,

such as the Java Standard Tag Library (JSTL).

9. Learn the numerous innovations introduced in JSP 2.0 Understand the role of EJB in the

broader Java EE platform.

10. Build stateless session beans as part of a service layer or SOA.

11. Invoke EJB sessions from Java web applications.

12. Implement message-driven beans to process queued messages asynchronously.

13. Understand the fundamental concepts of XML and related technologies.

Course Outcomes:

After the successful completion of the course the student will be able to

1. Demonstrate the understanding of Multi-tier architectures.

2. Demonstrate the functionality of Java Servlets and JSP applications.

3. Familiar the functionality of sessions and Cookies with java servlets and JSP.

4. Acquire knowledge on how XML is currently being used in various application areas

5. Demonstrate Know how to parse and transform XML documents via tools and through

programming APIs

6. Understand the EJB architecture and have a good grasp on when to use and how to use

various EJB bean types and acquire relevant Java programming experience.

7. Develop application with JavaEE components.

8. Develop applications with Remote Method Invocation (RMI).


Topics:

• Introduction

• The Presentation Tier

• The Service Tier

• The Enterprise Information System Tier

• Web Services

• Patterns

References Books:

1. Eric Armstrong, Jennifer Ball etal., “The J2EE™ 1.4 Tutorial for Sun Java SystemApplication

Server Platform Edition 8.2”, Sun Microsystems, Inc. available at the link

http://java.sun.com/j2ee/1.4/docs/tutorial/doc/index.html

2. SubrahmanyamAllamarajuetal, “Professional Java Server Programming”, Wrox Publications.

3. Rima Patel Sriganesh, Gerald Brose and Micah Silverman “Mastering Enterprise

JavaBeans3.0”, Wiley Publishing. Inc.

4. David R. Heffelfinger, “Java EE 5 Development with NetBeans 6”, PACKT Publishing.

5. Marty Hall, Larry Brown, “Core Servlets and JavaServer Pages™: Volume 1: Core

Technologies”, 2nd Edition, Prentice Hall.




a.


�


�


�

d.


�


�

f.


g.






�


BIOINFORMATICS

CS/IT 326(A)



Prerequisites: Knowledge of Chemistry & Mathematics

Course Objectives:

To impart the knowledge so that the student will

1. Have a broad, fundamental and mathematically rigorous understanding of theoretical and

applied bioinformatics.

2. Have a broad and fundamental knowledge of theoretical and experimental biological

chemistry;

3. Understand and value the ethical implications of the bioinformatics field; and

4. Be able to pursue advanced studies in Bioinformatics, Computer Science, Chemistry,

Biochemistry, Molecular Biology, or Medicine.

Course Outcomes:

Upon the successful completion of this course the students will be able to

1. Do sequencing Alignment and Dynamic Programming.

2. Develop Sequence Databases.

3. Develop Evolutionary Trees and Phylogeny.

4. To give effective scientific explanations from the theory.

5. To read and critically evaluate the primary scientific literature.

Topics:

• Introduction

• Information Resources

• DNA Sequence Analysis

• Pair Wise Alignment Techniques

• Multiple sequence alignment & Phylogenetic Analysis

• Secondary database Searching

• Gene Expression and Microarrays

• Analysis Packages

Reference Books:

1. “Introduction to Bioinformatics”, Arthur M. Lesk, OXFORD Publishers (Indian Edition).

2. “Elementary Bioinformatics”, ImtiyazAlam Khan, Pharma Book Syndicate.




a.


�



�


�


f.





�


�



DIGITAL IMAGE PROCESSING

CS/IT 326 (B)



Pre-requisites:Mathematics

Course Objectives:

The student will

1. Understand basic analytical methods which are widely used in image processing.

2. Understand the topics such as deterministic and stochastic modeling of images; linear and

nonlinear filtering; and image transformations for coding and restoration.

3. Understand issues and technologies which are specific to images and image Processing

systems.

4. Study the related areas such as human visual modeling, and display/printing device

characteristics.

5. Study the image compression and image segmentation methods.

Course Outcomes:

Upon the completion of the course the Student will be able to

1. Explain why the ability to perform digital processing of radiographic images is a significant

advantage.

2. Identify the quality characteristics of medical images that can be changed by digital

processing.

3. Describe the general relationship between image contrast and pixel values.

4. Describe the general process of changing image contrast by using look up tables.

5. Draw and explain graphs comparing LUT processing that produces different image contrast

characteristics.

6. Describe how LUT processing can produce an image with an inverted brightness scale.

7. Briefly describe the possible advantages of viewing radiographs in the inverted form.

8. Identify the operator controlled functions on a digital radiography system that selects a

specific LUT for image processing.

9. Draw a simple scale representing the range of pixel values in a recorded digital image and

use it to illustrate and describe the process of windowing.

10. Describe the general relationship between window with and the contrast in a displayed

image.

11. Describe a possible clinical advantage of changing window level (center) when viewing an

image.

12. Describe the image contrast characteristics in the three segments or regions of the pixel

value scale produced by the window.

13. Describe how the process of blurred (un-sharp) mask subtraction can increase the visibility

of detail in images.


Topics:

• Introduction

• Digital Image Fundamentals

• Image Enhancement In The Spatial Domain

• Image Enhancement In The Frequency Domain

• Image Restoration

• Wavelets And Multiresolution Processing

• Image Compression

• Image Segmentation

Reference Books:

1. Milan Sonka, Vaclav Hlavac, Roger Boyle Image Processing. Analysis, and Machine Vision

(Second Edition).

2. A.K.Jain, 'Fundamentals of Digital Image Processing' PHI.

3. Philips, 'Image Processing in C', BPB Publications.




a.


�



d.


�


�

f.


g.





�



OPEN SOURCE SYSTEMS

CS/IT 326(C)

On this PHP MySQL course you will build a database driven website. You will learn the basics of

PHP, SQL (a language used to query a database) and MySQL

Pre-requisites: OS, OOPS, Web Technologies, DBMS.

Course Objectives: Upon successful completion of this PHP MySQL Training course students will be

able to:

• Install Linux, PHP and MySQL.

• Use Linux operating system environment.

• Publish MySQL Data on the Web.

• Relational Database Design.

• Build a Content Management System.

• Content Formatting and Submission.

• MySQL Administration.

• Advanced SQL Queries.

• Binary Data.

• Cookies and Sessions in PHP.

• Structured PHP programming.

• MySQL Syntax.

Course Outcomes:

• Demonstrate knowledge of working in Linux Operating System environment.

• Design and implement a small to medium size web-enabled information storage and

retrieval system using PHP & MySQL.

• Write session control PHP code for a web site

Topics:

• Introduction

• Open Source Operating Systems

• Advanced Concepts

• Linux Networking

• Using PHP

• Using MySQL

• Advanced PHP Techniques

Reference Books:

1. Red Hat Linux Bible by Christoopher Negus Wiley Dreamtech.

2. Core Web Applications Development with PHP and MySQL by Marc Wandschneider.

3. Beginning PHP5, Apache, MySQL Web Development by Elizabeth Naramore, Jason Gerner,

Yann Le Scouarnec, JermyStolz, Michael K. Glass, Wiley Dreamtech (Wrox) 2006.

4. PHP5 and MySQL Bible by Tim Converse, Joyce Park, Clark Morgan Wiley India 2004.

Lectures : 4Periods/Week Continuous Assessment : 40





a.


�


�


�


�


�

f.





�


�


�


SOFT COMPUTING

CS/IT 326(D)

Pre-requisites: M1, M2,M3,P&S.

Course Objectives: Introduce students to soft computing concepts and techniques and foster their abilities in

designing and implementing soft computing based solutions for real-world problems.

Course Outcomes: Upon completion of the course, you should be able to:

1. Identify and describe soft computing techniques and their roles in building intelligent machines

2. Recognize the feasibility of applying a soft computing methodology for a particular problem

3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

4. Apply genetic algorithms to combinatorial optimization problems

5. Apply neural networks to pattern classification and regression problems

6. Effectively use existing software tools to solve real problems using a soft computing approach

7. Evaluate and compare solutions by various soft computing approaches for a given problem.

Topics:

• Basic Tools Of Soft Computing

• Fuzzy Logic System

• Fuzzy Inference System

• Neural Network

• Unsupervised Nn And Other Nn

• Neuro-Fuzzy Modeling

• Evolutionary and Bio Inspired Computing

Reference Books:

1. S.haykins- Neural Networks: A comprehensive foundation.






a.


�


�


�


�


�

f.






�


�


.NET TECHNOLOGIES

CS/IT 326 (E)

Course Objectives:The Objective of the course is the student should be able to do the following

things:

1. Develop programs using C# programming language.

2. Learn Assemblies, AppDomains, COM, Code Access Security, Code Optimization,

Cryptography and data protection.

3. Develop data driven applications using ADO.NET, data providers.

4. Data base programming using sql server 2005 programming .

5. Learn ASP.NET fundamentals, state management, master pages, web parts, security, Web

Services.

6. Learn Advanced Web Services Programming.

7. Develop Windows Applications using Windows Forms, Control Library, Advanced UI

Programming, Data Binding concepts.

8. Learn Smart Clients, ClickOnce technology, Enterprise Services, Remoting.

Course Outcomes:After the completion of the course the student will be able to:

1. Develop programs using C# programming language.

2. Create fully functional data driven applications using ADO.Net

3. Build secure web applications using ASP.Net.

4. Create dynamic Web applications that interact with a database using server-side

programming.

5. Create Web Services.

6. Develop Windows Forms Applications and data driven applications using various controls.

7. Develop Enterprise Services and Remote Applications.

Topics:

• Introduction to C# 2.0

• Assemblies and AppDomains,

• ADO.NET fundamentals

• Advanced ADO.NET techniques

• Programming with SQL Server 2005

• Introduction to ASP.NET 2.0

• Introduction to Windows Forms 2.0

Reference Books:

1. Core C# and .NET by Stephen C.Pary, Prentice Hall (Pearson Education), 2006.

2. C#: The complete reference by Herbert Schildt, Tata McGraw Hill, 2006 2/e.

3. Pro C# 2005 and the .NET Platform by Andrew Troelson, Apless 2005 3/e






a.


�


�


�

d.


�


�

f.


g.





�


�


UNIX PROGRAMMING LAB

CS/IT 361



Prerequisites:High Level Programming Languages.

Course Objectives:

The student will

1. Familiarize with the Linux environment.

2. Learn the fundamentals of shell scripting/programming.

3. Familiarize with basic linux administration.

Course Outcomes:

After the completion of this course the student will

1. Understand the role of systems programming

2. Have hands-on knowledge of the basic principles of Unix system calls

3. Have hands-on knowledge of the basic principles of Unix file system

4. Have hands-on knowledge of the basic principles of Unix IO system

5. Work confidently in Unix/Linux environment

6. Write shell scripts to automate various tasks

7. Design and implement system-level applications for open-source operating systems.

Topics:

• AWK Programming

• Shell scripts and Programming

• Shell scripts

• Shell programs

• File & Process Management Programming

• Signal and IPC Programming




l.


�

m. Demonstrate an ability to analyze a problem and design a computing system or a component or a process confirming to standards using various methodologies and architectures.

�

n. Be able to analyze and understand an existing software & hardware system and extend the system to meet evolving requirements.

�

o.


p. Demonstrate an understanding of the emerging technologies and a working knowledge of software and hardware tools.

q.


r.


s. Demonstrate the ability to communicate effectively in both verbal and written form.

t. Have an ability to analyze the social and human context of computing and be aware of contemporary issues.

u. Recognize the need for continuing education, research and professional development.

�

v. Possess the knowledge and skills for employability and to succeed in national and international level competitive examinations.

�


ENTERPRISE PROGRAMMING LAB

CS/IT 362



Prerequisites:IT 224 - GUI Programming and IT 316- Web Technology.

Course Objective:

This course provides a continuation to IT 224 and IT 316 using the Java Enterprise Edition (JEE)

programming architecture. Topics include database connectivity, Enterprise Java Beans,

servlets, collection frameworks, JNDI, RMI, JSP, multithreading XML and multimedia

development.

Course Outcomes:

Upon completion, students should be able to program a client/server enterprise application

using the JEE framework.

Course Syllabus:

1. Write an application to integrate JSP & Servlets.

2. Write a program to demonstrate Session Bean.

3. Write a program to demonstrate Entity Bean.

4. Write a program to demonstrate Java Mail.

5. Write a program to demonstrate Remote Method Invocation.

6. Write a program to demonstrate Java Message service.

7. Write a program to demonstrate JNDI.

8. Develop an e-business application using XML.

9. Develop an application for Client Request / Responses using SOAP.

10. Demonstrate how to describe web services using WSDL.




a.


�


�


�

d.


�


�

f.


g.






�


BIO-INFORMATICS LAB

CS/IT 363 (A)

Prerequisites: Knowledge of Chemistry & Mathematics

Course Objectives:

To impart the knowledge so that the student will

5. Have a broad, fundamental and mathematically rigorous understanding of theoretical and

applied bioinformatics.

6. Have a broad and fundamental knowledge of theoretical and experimental biological

chemistry;

7. Understand and value the ethical implications of the bioinformatics field; and

8. Be able to pursue advanced studies in Bioinformatics, Computer Science, Chemistry,

Biochemistry, Molecular Biology, or Medicine.

Course Outcomes:

Upon the successful completion of this course the students will be able to

6. Do sequencing Alignment and Dynamic Programming.

7. Develop Sequence Databases.

8. Develop Evolutionary Trees and Phylogeny.

9. To give effective scientific explanations from the theory.

10. To read and critically evaluate the primary scientific literature.

LIST OF EXPERIMENTS

1. Searching Bibliographic databases for relevant information

2. Sequence retrieval from DNA and protein databases.

3. Pair wise comparison of sequences.

4. BLAST services

5. FASTA services.

6. Multiple sequence alignment (CLUSTAL).

7. Evolutionary/PHYLOGENITIC analysis.

8. Protein data bank retrial and visualization.

9. Structure exploration of proteins.

10. Restriction mapping.

11. Identification of genes in genomes.

12. Primer Design

Lectures : 3Periods/week Continuous Assessment : 40





a.




d.



f.


g.







DIGITAL IMAGE PROCESSING LAB

CS/IT 363 (B)

Pre-requisites:Mathematics

Course Objectives:

The student will

6. Understand basic analytical methods which are widely used in image processing.

7. Understand the topics such as deterministic and stochastic modeling of images; linear and

nonlinear filtering; and image transformations for coding and restoration.

8. Understand issues and technologies which are specific to images and image Processing

systems.

9. Study the related areas such as human visual modeling, and display/printing device

characteristics.

10. Study the image compression and image segmentation methods.

Course Outcomes:

Upon the completion of the course the Student will be able to

14. Explain why the ability to perform digital processing of radiographic images is a significant

advantage.

15. Identify the quality characteristics of medical images that can be changed by digital

processing.

16. Describe the general relationship between image contrast and pixel values.

17. Describe the general process of changing image contrast by using look up tables.

18. Draw and explain graphs comparing LUT processing that produces different image contrast

characteristics.

19. Describe how LUT processing can produce an image with an inverted brightness scale.

20. Briefly describe the possible advantages of viewing radiographs in the inverted form.

21. Identify the operator controlled functions on a digital radiography system that selects a

specific LUT for image processing.

22. Draw a simple scale representing the range of pixel values in a recorded digital image and

use it to illustrate and describe the process of windowing.

23. Describe the general relationship between window with and the contrast in a displayed

image.

24. Describe a possible clinical advantage of changing window level (center) when viewing an

image.

25. Describe the image contrast characteristics in the three segments or regions of the pixel

value scale produced by the window.

26. Describe how the process of blurred (un-sharp) mask subtraction can increase the visibility

of detail in images.




LIST OF EXPERIMENTS

1. Write a program to read, show access image pixel values and write image in MAT lab.

2. Write a program to find set of connected components in binary images based on 4 adjacent

neighbors and 8 adjacent neighbors.

3. Write a program to perform various gray level transformations on gray scale image.

4. Write a program to calculate histogram of a digital image and perform histogram

equalization and histogram matching.

5. Write a program for image enhancement using various in spatial domain.

6. Write a program for image enhancement using various in frequency domain.

7. Write a program to detect edges in a digital image using various edge detection operators.

8. Write a program for image restoration.

9. Write a program for image segmentation.

10. Write a program for image compression using wavelets.




a.


�



d.


�


�

f.


g.





�



OPEN SOURCE SYSTEMS LAB

CS/IT 363 (C)

On this PHP MySQL course you will build a database driven website. You will learn the basics of

PHP, SQL (a language used to query a database) and MySQL

Pre-requisites: OS, OOPS, Web Technologies, DBMS.

Course Objectives: Upon successful completion of this PHP MySQL Training course students will be

able to:

• Install Linux, PHP and MySQL.

• Use Linux operating system environment.

• Publish MySQL Data on the Web.

• Relational Database Design.

• Build a Content Management System.

• Content Formatting and Submission.

• MySQL Administration.

• Advanced SQL Queries.

• Binary Data.

• Cookies and Sessions in PHP.

• Structured PHP programming.

• MySQL Syntax.

Course Outcomes:

• Demonstrate knowledge of working in Linux Operating System environment.

• Design and implement a small to medium size web-enabled information storage and

retrieval system using PHP & MySQL.

• Write session control PHP code for a web site

LIST OF EXPERIMENTS

1. Demonstrate the configuration of Apache, MySQL and PHP.

2. Write PHP Script to demonstrate String processing and regular Expressions in PHP.

3. Program to demonstrate Object Oriented features of PHP.

4. Write Script that takes user input data and validates it and write the data into the

database.

5. Program to demonstrate DML commands in MySQL.

6. Program to demonstrate exception handling in PHP.

7. Program to demonstrate Passing of Information between Web pages.

8. Program to demonstrate the use of Cookies.

9. Program to demonstrate user management and authentication.

10. Program to demonstrate file Uploading.

11. Program to demonstrate source code control and Testing.






a.


�


�


�

d.


�


�

f.


g.




�


�


�


SOFTCOMPUTING LAB

CS/IT 363(D)

Pre-requisites: M1, M2,M3,P&S.

Course Objectives: Introduce students to soft computing concepts and techniques and foster their abilities in

designing and implementing soft computing based solutions for real-world problems.

Course Outcomes: Upon completion of the course, you should be able to:

1. Identify and describe soft computing techniques and their roles in building intelligent machines

2. Recognize the feasibility of applying a soft computing methodology for a particular problem

3. Apply fuzzy logic and reasoning to handle uncertainty and solve engineering problems

4. Apply genetic algorithms to combinatorial optimization problems

5. Apply neural networks to pattern classification and regression problems

6. Effectively use existing software tools to solve real problems using a soft computing approach

7. Evaluate and compare solutions by various soft computing approaches for a given problem.

LIST OF EXPERIMENTS

ARTIFICIAL NEURAL NETWORK

1. Write a program to implement and function using adaline with bipolar inputs and outputs.

2. Write a program to implement and function using madaline with bipolar inputs and

outputs.

3. Write a matlab program to implement discrete hopfield network and test for input pattern.

4. Write a matlab program to implement full counter propagation network for a given input

pattern.

5. Write a matlab program to implement back propagation network for a given input pattern.

6. Write a program to implement art 1 network for clustering input vectors with vigilance

parameter.

FUZZY LOGIC

7. Write a MAT Lab program to implement FUZZY set operation and properties..

8. Write a program to implement composition of fuzzy and crisprelations.

9. Write a program to perform MAX-MIN composition of two matrices obtained from

Cartesian product.

10. Write a program to verify the various laws associated with fuzzy set.

GENETIC ALGORITHM

11. Write a MAL lab program for maximizing F(X)=X2 using GA, where X is ranges from 0 to 31.

Perform only 5 iterations.






a.


�


�


�

d.


�


�

f.


g.





�


�


.NET TECHNOLOGIES LAB

CS/IT 363(E)

LIST OF EXPERIMENTS

1. Write a program to demonstrate OOPs concepts in C#.

2. Write a program to demonstrate Exception handling in C#.

3. Write a program to illustrate the concepts of events & delegates in C#.

4. Write a program to demonstrate multi-threaded programming in C#.

5. Write a program to demonstrate generics.

6. Write a program to demonstrate StreamWriters and StreamReaders.

7. Write a program to demonstrate Building and consuming a multi file assembly.

8. Write a program to demonstrate DML and DDL Commands using ADO.NET.

9. Write a program to build a data driven ASP.NET Web application.

10. Write a program to demonstrate ASP.NET controls.

11. Write a program to demonstrate Windows Forms Controls.

12. Write a program to demonstrate the building of a simple Windows Forms Application.






a.


�


�


�

d.


�


�

f.


g.





�


�


CRYPTOGRAPHY AND NETWORK SECURITY

CS/IT 411



Prerequisites:

IT 314: Operating Systems

IT 321: Computer Networks

Course Objectives:


1. Information security.

2. Tradeoffs inherent in security.

3. Application of each of confidentiality, integrity, and availability.

4. The basic categories of threats to computers and networks.

5. Issues for creating security policy for a large organization.

6. Defense for protection and security, and the role of ethical considerations in computer use.

7. Efficient basic number-theoretic algorithms, including greatest common divisor,

multiplicative inverse mod n, and raising to powers mod n.

8. Public-key cryptosystems, including a necessary complexity-theoretic assumption for their

security.

9. Simple extensions of cryptographic protocols, using known protocols and Cryptographic

primitives.

Course Outcomes:

After the completion of this course the student will able to:

1. Understand theory of fundamental cryptography, encryption and decryption algorithms,

2. Show the ability to encrypt “Plain Text” into “Cipher Text” and vice versa, using different

encryption algorithms.

3. Choose a suitable ciphering algorithm according to the required security level

4. Build secure authentication systems by use of message authentication techniques.

5. Understand a given ciphering algorithm and to analyze it.

6. Learn program and apply the encryption algorithms.

7. Build cryptosystems by applying encryption algorithms.

8. Apply the crypto systems so far learned to building of information and network security

mechanisms.

9. Identity the techniques for authentication message authentication develop identity

management.


Topics:

• Classical Encryption Techniques

• Block Ciphers and the Data Encryption standard

• Introduction to Number Theory

• Message Authentication and Hash Functions

• Hash Algorithms

• Authentication Applications

• IP Security

• Malicious Software

• Web Security

• Intruders

• Firewalls

Reference Books:

1. AtulKahate, “Cryptography and Network Security”, Tata McGraw Hill.




a.


�


�


�


�


f.





�


�


�


DISTRIBUTED SYSTEMS

CS/IT 412



Prerequisites: IT 314 - Operating Systems and IT 321 - Computer Networks

Course Objectives:

To impart the in depth knowledge so that the Student will learn

1. Distributed processes (synchronization, communication and scheduling)

2. Concurrent processes and programming

3. Process interaction and Process scheduling

4. Distributed file systems and Distributed shared memory

5. Security issues in network and distributed environments

6. Present the principles underlying the functioning of distributed systems;

7. To create an awareness of the major technical challenges in distributed systems design and

implementation;

8. Get exposure to modern and classic technology used in distributed systems and their

software;

9. Get exposure to current research issues in the field of distributed systems;

10. To provide experience in the implementation of typical algorithms used in distributed

systems.

Course Outcomes:

Upon the completion of the course the students will be able to:

1. Explain what a distributed system is, why one would design a system as a distributed

system, and what are the desired properties of such systems.

2. List the principles underlying the functioning of distributed systems.

3. Design a distributed system that fulfills requirements with regards to key distributed

systems properties (such as scalability, transparency, etc)

4. Build distributed system software using basic OS mechanisms as well as higher-level

middleware and languages.


Topics:

• Introduction

• Communication

• Message-Oriented Communication

• Processes

• Naming

• Synchronization

• Consistency and Replication

• Fault tolerance

• Distributed File Systems

Reference Books:

1. Coulouris, Dollimore, Kindberg, “Distributed Systems-Concepts and Design”, 3rd

edition,

Pearson Education.

2. Mukesh, Singhal&NiranjanG.Shivarathri, “Advanced Concepts in Operating Systems”, TMH.

3. Sinha, “Distributed Operating System – Concepts and Design”, PHI.




a.


�


�


�



f.






�


�


OBJECT ORIENTED ANALYSIS AND DESIGN

CS/IT 413



Prerequisite: IT 214: C++ Programming, IT 324: Software Engineering

Course Objective:

To impart the in depth knowledge of

1. OO analysis and design skills through an elaborate case study.

2. UML design diagrams

3. appropriate design patterns

4. the importance of Object Oriented Analysis and Design concepts and apply them to solve

problems

5. the process of Object Oriented Analysis and Design documents for a given problem

using Unified Modeling Language

6. the importance and function of each UML model throughout the process of object-oriented

analysis and design.

Course Outcomes:

Upon the successful completion of this course the student will be able to

1. Use object-oriented technologies

2. Use Unified Modeling Language

3. Perform object-oriented analysis and design

4. Explain how the Unified Modeling Language (UML) represents an object-oriented system

using a number of modeling views.

5. Construct various UML models (including use case diagrams, class diagrams, interaction

diagrams, State chart diagrams, activity diagrams, and implementation diagrams) using the

appropriate notation.


Topics:

• What is Object-Orientation

• Modeling Concepts

• Requirements Capture

• Requirements Analysis

• Refining the Requirements Model

• Object Interaction

• Specifying Operations

• Specifying Control

• Moving Into Design

• System Design

• Object Design

• Human-Computer Interaction

• Designing Boundary Classes

• Implementation

• Reusable Components

• Managing Object-Oriented Projects

Reference Books:

1. James Rumbaugh, Jacobson, Booch, “Unified Modeling Language Reference Manual”, PHI.

2. Jacobson et al., “The Unified Software Development Process”, AW, 1999.

3. AtulKahate, “Object Oriented Analysis &Design”, The McGraw-Hill Companies, 2004.




a.


�


�


�

d.


�


f.


�

g.


�



�



�


DESIGN AND ANALYSIS OF ALGORITHMS

CS/IT 414



Prerequisites:IT216-Data Structures

Course Objectives:

1. To analyze the asymptotic performance of algorithms.

2. To demonstrate a familiarity with major algorithms and data structures.

3. To apply important algorithmic design paradigms and methods of analysis.

4. To synthesize efficient algorithms in common engineering design situations.

5. To understand the difference between tractable and intractable problems, and be familiar

with strategies to deal with intractability.

Course Outcomes:

Students who complete the course will have the ability to

1. Argue the correctness of algorithms using inductive proofs and loop invariants.

2. Analyze worst-case running times of algorithms using asymptotic analysis. Compare

theAsymptotic behaviors of functions obtained by elementary composition of polynomials,

exponentials, and logarithmic functions. Describe the relative merits of worst-, average-,

and best-case analysis.

3. Analyze average-case running times of algorithms whose running time is probabilistic.

Employ indicator random variables and linearity of expectation to perform the analyses.

Recite analyses of algorithms that employ this method of analysis.

4. Explain the basic properties of randomized algorithms and methods for analyzing them.

5. Recite algorithms that employ randomization. Explain the difference between a

6. Randomized algorithm and an algorithm with probabilistic inputs.

7. Describe the divide-and-conquer paradigm and explain when an algorithmic design

situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide-and-

conquer algorithms. Derive and solve recurrences describing the performance of divide-

and-conquer algorithms.

8. Describe the dynamic-programming paradigm and explain when an algorithmic design

situation calls for it. Recite algorithms that employ this paradigm. Synthesize

dynamicprogramming algorithms, and analyze them.

9. Describe the greedy paradigm and explain when an algorithmic design situation calls for

it.Recite algorithms that employ this paradigm. Synthesize greedy algorithms, and analyze

them.

10. Explain the major graph algorithms and their analyses. Employ graphs to model engineering

problems, when appropriate. Synthesize new graph algorithms and algorithms that employ

graph computations as key components, and analyze them.

11. Describe a linear program and cite problems that can be solved using linear

programming.Reduce problems to linear programming formulations. Understand the

complexity of various linear programming approaches.

12. Explain basic complexity classes such as P, NP, and NP-complete, and be able to use analysis

and reduction techniques to show membership or non-membership of a problem in these

classes.

13. Understand and explain approaches to dealing with problems that are NP-complete such as

the design of heuristic, approximation, or fixed-parameter algorithms.

Topics:

• Introduction


• Divide and Conquer

• Greedy Programming

• Dynamic Programming

• Graph Searching and Traversal

• Back tracking

• Branch and Bound

• Computational Complexity

Reference Books:

1. T. H. Cormen, Leiserson, Rivest and Stein, “Introduction of Computer Algorithm”, PHI.

2. Sara Basse, A.V. Gelder, “Computer Algorithms”, Addison Wesley.




a.


�


�


d.


�


f.


�

g.





�


�


OPERATIONS RESEARCH

CS/IT 415 (A)



Prerequisites:Calculus and Computer Principles of Modeling & Simulation.

Course Objectives:


1. Methods of Operations Research

2. Mathematical procedures of nonlinear programming search techniques

3. Advanced topics such as probabilistic models (Markov chain & queuing theory) and dynamic

programming.

4. Course material to research activities.

Course Outcomes:

After completion of the course the student will

1. Demonstrate probabilistic modeling.

2. Understand the key results for discrete and continuous markov chains,queuing models and

poisson point processes.

3. Be able to apply stochastic models to a variety of operations problems.

4. Understand the basic models, methods and techniques used in optimization.

5. Be able to classify optimization problems according the following classes:

a. Combinatorial (transportation, network flow, integer programming problems).

b. Continuous optimization problems (linear programming, quadratic programming,linear

complementarily, convex programming and general nonlinear programming problems).

6. Understand methods for solving combinatorial and continuous optimization problems.

7. Conduct sensitivity analysis of solutions, and report on this in a matterUnderstandable and

useful to a client.

8. Cognitive abilities and non-subject specific skills.

9. Read mathematical texts to broaden and deepen understanding of probabilityand its

applications.

10. Write about models and analysis in a coherent manner.

11. Improve problem structuring skills.

Topics:

• Linear Programming

• Transportation Problem

• Theory Of Games

• Inventory Control

• Dynamic Programming

• Project Planning Through Networks

• Simulation

Reference Books:

1. KanthiSwarup, PK Gupta &Manmohan, ‘Operations Research’ Sultanchand& Sons, New

Delhi.

2. Operations Research – Gupta and Hira

3. Pert and CPM Principles and Applications – L.S. Srinath.




a. Demonstrate an ability to apply the knowledge of Mathematics, Computer Science and Engineering appropriate to the development of software systems to solve real world problems.

�


�




f.








ADVANCED DATABASE MANAGEMENT SYSTEMS

CS/IT 415 (B)

Prerequisites: IT 315- Database Systems, foundations of Computer Science.

Course Objectives:

To impart the knowledge to

1. Define a Database Management System.

2. Give a description of the Database Management structure.

3. Design a Database.

4. Define basic foundational terms of Database.

5. Understand the applications of Databases.

6. Know the advantages and disadvantages of the different models.

7. Compare relational model with the Structured Query Language (SQL).

8. Know the constraints and controversies associated with relationaldatabase model.

9. Know the rules guiding to ACID.

10. Identify the major types of relational management systems.

Course Outcomes:

1. Compare and contrast the types of RDBMS based on several criteria.

2. Understand the concept of data planning and Database design.

3. Know the steps in the development of Databases.

4. Trace the history and development process of SQL.

5. Know the scope and extension of SQL.

6. Differentiate Discretionary and. Mandatory Access Control Policies.

7. Know the Proposed OODBMS Security Models.

8. Identify the various functions of Database Administrator.

9. Trace the history and development process of datawarehouse.

10. List various benefits of datawarehouse.

11. Compare and contrast document management system and content managementsystems.

12. Know the basic components of document management systems.




Topics:

• Algorithms for Query Processing and Optimization

• Data base systems architecture and the system Catalog

• Practical database design and tuning

• Distributed DBMS Concepts and Design

• Distributed DBMS-Advanced Concepts

• Introduction to Object DBMSs

• Object-Oriented DBMSs-Concepts and Design

• Object-Oriented DBMSs-Standards and Systems

• Object relational DBMSs

• Emerging database technologies and applications

• XML and Internet Databases

• Enhanced data models for advanced applications

References Books:

1. “Principles of Distributed Database Systems”, Ozsu, 2/e, PHI.




a.


�


�


�


�


�

f.






�


�


GRAPH THEORY

CS/IT 415 (C)

Pre-requisites: DMS

Course Objectives: To be able to carry out and understand the following algorithms. (All graphs considered are

finite)

• An algorithm to find the component of a graph containing a given vertex.

• Dijkstra's algorithm.

• Prim's algorithm.

• Algorithms to organize suitable data in binary trees.

• Tarry's algorithm.

• An algorithm to construct Eulerian walks.

• The Chinese Postman's problem.

• An algorithm for finding a maximal flow in a network.

• Algorithms for finding an (x; y) edge cut set and vertex cut set in directed and undirected graphs.

• Algorithms for calculating the chromatic polynomial of a graph.

Course Outcomes: On successful completion of the module, students should be able to:

• Define the standard objects of graph theory.

• Understand and apply some of the classical theorems of graph theory.

Topics:

• Graphs, Sub graphs

• Trees and fundamental circuits

• Cuts sets and cut vertices

• Network flows

• Vector space of a graph and vectors

• Coloring

Reference Books:

1. Gary Chartrand and Ping Zhang, Introduction to Graph Theory, TMH

2. Robin J. Wilson, Introduction to Graph Theory, Pearson Education

3. Harary, F, Graph Theory, Narosa

4. Bondy and Murthy: Graph theory and application. Addison Wesley.

5. V. Balakrishnan, Schaum's Outline of Graph Theory, TMH

6. GeirAgnarsson, Graph Theory: Modeling, Applications and Algorithms, Pearson Education.

Lectures : 4Periods/week, Tutorial: 1 Continuous Assessment : 40





a.


�



d.


�


f.


g.





�


�


PRINCIPLES OF PROGRAMMING LANGUAGES

CS/IT 415 (D)



Prerequisites: High level Programming.

Course Objectives:

To impart knowledge so that the students will

1. Understand the necessity of a high level language.

2. Understand what a good programming language is.

3. Understand the features of language.

4. Understand what a user friendly language is.

Course Outcomes:

After the successful completion of this course the student will be able to

1. Understand the syntax and semantics of the any high level language.

2. Understand various data types.

3. Understand scope and extent of variables.

4. Understand statements and control structures.

5. Understand sub program concepts.

6. Judge the suitability of a language for a particular task.

Topics:

• Preliminaries, Evolution of Programming Languages.

• Describing syntax and Semantics

• Primitive data types and variables

• Scope and Extent

• Data Types

• Expression and the Assignment Statement

• Statement level Control Structures

• Subprograms

• Implementing Subprograms

• Data Abstraction

• Symmetric and Concurrent Subprograms

• Concurrency

• Exception handling

Reference Books:

1. Ellis Horowitz, ‘Fundamentals of Programming Languages’, Galgotia Publications (P) Ltd.,

1994.

2. Pratt Terrence.W, ‘Programming Languages, Design & Implemented’ Prentice Hall of India,

1993.




a.



�


�


�


f.








MACHINE LEARNING

CS/IT 415 (E)



Prerequisites: IT 214 - Object Oriented Programming.

IT 215 - Discrete Mathematical Structures

IT 216 - Data structures

IT 414 - Design & Analysis of Algorithms

Course Objective:

To impart the in depth knowledge of

1. Models, methods and tools used to solve regression, classification, feature selection,

dimensionality reduction and density estimation problems.

2. Learning and adaptation in supervised, unsupervised and semi-supervised modes of

learning.

3. Advanced knowledge of recognition, decision making and statistical learning problems.

4. Advanced knowledge of current research topics and issues in machine learning.

5. Conducting and presenting a literature review on a research topic.

6. Hands-on experience in analyzing and developing solutions/algorithms capable of learning.

Course Outcomes:

Upon the successful completion of the course the student will be able to

1. Describe the challenges in machine learning research

2. Describe the strength and limitations of available techniques in machine learning

3. Develop learning algorithms for supervised, unsupervised and semi- supervised tasks.

4. Estimate parameters and classifier performance

5. Describe how to resolve computational learning machine learning problems

Topics:

• Introduction to machine learning

• Decision Tree Learning

• Artificial Neural Networks

• Evaluating Hypotheses

• Bayesian Learning

• Computational learning theory

• Instance Based Learning

• Genetic Algorithms




a.


�


�


�


�


f.






�



OPEN ELECTIVE

INTELLECTUAL PROPERTY RIGHTS, PATENT LAWS &ETHICAL ISSUES

IT 416 / BT 100



UNIT – I

Intellectual Property Rights: Introduction, forms of Intellectual property, international &

regional agreements/ treaties in IPR; IPR related Legislations in India; IPR and Agricultural

Technology- implications in India and other developing countries; GATT, TRIPS, and WIPO;

Other IPR issues:Trade Secrets, Copy Rights, Trade Marks and their legal implications; Farmer’s

Rights, Plant Breeder’s rights; Traditional knowledge and their commercial exploitation and

protection.

UNIT – II

Patents and Patent processing:Introduction, Essential requirements, Patent application, Procedures and

granting, Patent search, PCT, UPOV, Patents in Biotechnology and controversies involved.

UNIT – III

Regulatory Affairs: Regulatory affairs: Indian contest- requirements and guidelines of GMP,

understanding of Drugs and cosmetic act 1940 and rules 1945 with reference schedule M, U &

Y. Related quality systems- objectives and guidelines of USFDA, WHO &ICH, Introduction to ISO

series.

Documentation and Protocols: Documentation: Types related to pharmaceuticals industry,

protocols, harmonizing formulation development for global fillings, NDA, ANDA, CTD, Dealing

with post approval changes- SUPAC, handling and maintenance including electronic

documentation.

UNIT – IV

Ethics:Research and ethical issues; Ethical issues in use of animals in research and testing;

ethical issues in research involving human participants; Protecting Genetic Privacy; Gene testing

– Pros & Cons. Human Cloning & Human Dignity – an ethical enquiry; Ethical, Legal and Social

Issues (ELSI) concerning recent advancements in key areas of biotechnology- pre-natal

diagnostics.

TEXTBOOKS:

1. Good manufacturing practices for pharmaceuticals, S.H.Willing

2. Protection of Industrial property Rights, P.Das&Gokul Das

3. Intellectual property rights on Biotechnology, Singh K, BCIL, New Delhi

4. Biotechnologies in developing countries present and future, Sasson A, UNESCO

Publications.

5. Bioethics and Biosafety- M.K.Sateesh, I.K. International, New Delhi.


OPEN ELECTIVE

BIOINFORMATICS ALGORITHMS

IT 416 / BT 200

Lectures : 3 Periods/Week, 1 Tutorial Continuous Assessment : 40


UNIT – I

INTRODUCTION: Algorithms and Complexity- Biological algorithms versus computer algorithms

– The change problem –Correct versus Incorrect Algorithms – Recursive Algorithms – Iterative

versus Recursive Algorithms – Big-O Notations– Algorithm Design Techniques.

GREEDY ALGORITHMS: Molecular Biology Primer – Exhaustive Search – Mapping Algorithms –

Motif-Search Trees – Finding Motifs –Finding a Median String – Greedy Algorithm – Genome

Rearrangements – Sorting by Reversals – Approximation Algorithms – A Greedy Approach to

Motif Finding.

UNIT – II

DYNAMIC PROGRAMMING ALGORITHMS:DNA Sequence comparison – Manhattan Tourist

Problem – Edit Distance and Alignments – Longest Commons Sub sequences – Global Sequence

Alignment – Scoring Alignment – Local Sequence Alignment – Alignment with Gap Penalties –

Multiple Alignment-Gene Predictions – Approaches to Gene Prediction – Spiced Alignment –

Divide and Conquer Algorithms.

UNIT – III

GRAPH ALGORITHMS: Graphs – Graphs and Genetics – DNA Sequencing – Shortest Superstring

Problem – DNA arrays as alternative sequencing techniques – Sequencing by Hybridization –

Path Problems – Fragment assembly in

DNA Sequencing – Protein Sequencing and Identification – The Peptide Sequencing Problem –

Spectrum Graphs – Spectral Convolution and Alignment – Combinatorial Patter matching.

UNIT – IV

CLUSTERING AND TREES: Clustering and trees – Gene expression analysis – Hierarchical

clustering-k-means clustering – Clustering and corrupted Cliques – Evolutionary Trees –

Distance-based tree reconstruction – Reconstruction trees from additive matrices –

Evolutionary trees and hierarchical clustering – Character-based tree reconstruction – Small

and large Parsimony Problem – Hidden Markov Models- Randomized Algorithms.

TEXTBOOKS:

1. Neil C. Jones and Pavel A. Pevzner, An Introduction to Bioinformatics Algorithms, MIT Press,

FirstIndian Reprint 2005.

2. Gary Benson Roderic page (Eds), Algorithms in Bioinformatics, Springer International Edition,

FirstIndian Reprint 2004.

REFERENCE BOOKS

1. Gusfields G, Algorithms on strings, trees and sequences- Computer Science and

ComputationalBiology, Cambridge University Press 1997.

2. Steffen Schulze-Kremer, Molecular Bioinformatics: Algorithms and Applications, Walter de

Gruyter, 1996.


OPEN ELECTIVE

INDUSTRIAL POLLUTION & CONTROL

IT 416 / ChE 100



UNIT – I

Man & Environment, Types of Pollution, Pollution control aspects, Industrial emissions-Liquids,

Gases, Environmental Legislation, Water quality management in India, Air (Prevention &

Control of Pollution) Act.

UNIT – II

Removal of BOD, Biological oxidation, Anaerobic treatment, Removal of Chromium, Removal of

Mercury, Removal of Ammonia, Urea, Treatment of Phenallic effluents.

UNIT – III

Removal of Particulate matter, Removal of Sulfur Oxides, Removal of Oxides of Nitrogen, Removal of Organic vapors from Effluent.

UNIT – IV

Pollution control in Chemical Industries, General considerations, pollution control aspects of

Fertilizer industries, Pollution control in Petroleum Refineries and Petrochemical units, Pollution

control in Pulp and Paper Industries.

TEXT BOOK:

1. Pollution control in Process Industries, S.P .Mahajan, Tata McGraw Hill Publishing Company

Ltd, New Delhi

REFERENCE BOOKS:

1. Environmental Pollution Control Engineering, C.S.Rao, Wiley Eastern Ltd., New Age

International Ltd.,

2. Air pollution, M.N.Rao, H.V.N.Rao, Tata McGrawhill.

3. Water Pollution control, W.Wesley Eckenfelder Jr.Industrial, Tata McGrawHill.


OPEN ELECTIVE

ENERGY ENGINEERING

IT 416 / ChE 200



UNIT – I

Conventional energy resources, the present scenario, scope for future development.

Coal: Origin, occurrence and reserves, classification, ranking, analysis and testing, coal

carbonization, manufacture of coke, coal gasification, coal liquefaction.

UNIT – II

Petroleum: Origin, occurrence and reserves, composition, classification, characteristics,

exploration and production.

Petroleum Refining: Refinery processes, petroleum products, testing and analysis of petroleum

products.

UNIT – III

Non conventional energy sources: Solar energy, solar radiation, principles of heating and

cooling, photo voltaic cells.

Bio gas products, bio-mass, wind energy, hydrogen energy, geothermal and ocean thermal

energy, fuel cells.

UNIT – IV

Energy storage, mechanical energy storage, water storage, solar pond, phase change storage,

chemical storage.

Energy Conservation: Conservation methods in process industries, Theoretical analysis,

practical limitations, equipment for energy saving / recovery.

TEXT BOOKS:

1. Conventional Energy technology, S.B.Pandy, Tata McGraw Hill

2. Fuel Science, Harker and Allen, Oliver & Boyd.

3. Energy conversion, Culp, McGraw Hill.


OPEN ELECTIVE

AIR POLLUTION AND CONTROL

IT 416 / CE 100



UNIT –I

Air Pollution –Definitions, AirPollutants–Classifications –NaturalandArtificial– Primaryand

Secondary,pointandNon-Point,Line and ArealSourcesofairpollution-stationaryand mobilesources.

EffectsofAirpollutantsonman,materialand vegetation:Globaleffects ofairpollution – Green

Houseeffect,HeatIslands, Acid Rains,Ozone Holesetc.

UNIT –II

MeteorologyandplumeDispersion;properties ofatmosphere;Heat,Pressure,

Windforces,MoistureandrelativeHumidity, Influence ofMeteorologicalphenomenaon Air Quality-

windrosediagrams.

UNIT – III

Lapse Rates,PressureSystems,Windsandmoistureplume behaviourandplumeRiseModels;

GaussianModelfor PlumeDispersion.

Control ofparticulates –Control atSources,Process Changes,Equipmentmodifications,Design

andoperation ofcontrol. Equipment’s–SettlingChambers, Centrifugalseparators, filtersDryand

Wetscrubbers,Electrostatic precipitators.

UNIT – IV

GeneralMethodsofControl ofNOxandSox emissions–In-plantControl Measures,

processchanges,dryand wetmethods ofremovaland recycling.

Air QualityManagement–Monitoring ofSPM,SO;NOand COEmission Standards.

NOTE:

Two questions of 12 marks each will be given from each unit out of which one is to be

answered. Twelve questions of one mark each will be given from entire syllabus which is a

compulsory question.

TEXTBOOKS:

1.Air pollutionByM.N.Raoand H.V.N.Rao –Tata Mc.GrawHillCompany.

2.Air pollutionbyWarkand Warner.-Harper&Row,NewYork.

REFERENCE BOOKS:

1.An introductiontoAirpollution by R.K.Trivedy andP.K.Goel,B.S.Publications.


OPEN ELECTIVE

REMOTE SENSING AND GIS

IT 416 / CE 200



UNIT – I

Concepts and Foundations of Remote Sensing: Introduction, Energy sources and radiation

principles, Energy interactions in the atmosphere, Energy interactions with Earth surface

features, an ideal remote sensing system, characteristics of remote sensing systems, application

of remote sensing .

UNIT – II

Visual Image Interpretation: Introduction, Fundamentals of visual image interpretation, basic

visual image interpretation equipment, land use and land cover mapping, geologic and soil

mapping, agricultural applications, forestry applications, water resources applications, urban

and regional planning applications.

UNIT – III

Digital Image Processing: Introduction, Image rectification and restoration, Image

enhancement, contrast manipulation, spatial feature manipulation, Image Classification,

Supervised classification, the classification stage, the training stage, Un-supervised

classification, Classification accuracy assessment.

UNIT – IV

Geo-graphical Information Systems (GIS):Introduction, spatial information system: an overview,

conceptual model of spatial information, concept of databases, digitizing, editing, and

structuring map data, data quality and sources of errors in GIS, spatial data analysis (vector

based), spatial data analysis (raster based), Fundamental concepts of GPS, Types of GPS, GPS

satellite, Application of GPS in resource surveys, mapping and navigation.

TEXT BOOKS:

1. Lillisand.T.M, Keifer.R.W, and Chipman.J.WRemotesensind Image interpretation, 2004, John

Wlley and Sons.

2. Chrisman, N.R. (1997), Exploring Geographic Information systems, John Willey and sons

3. Remote Sensing and its applications by LRA Narayana University Press 1999.

4. Principals of Geo physical Information Systems - Peter A Burragh and Rachael A. Me Donnell, Oxford

Publishers 2004.

REFERENCE BOOKS:

1. Concepts & Techniques of GIS by C.P.Lo Albert, K.W. Yonng, Prentice Hall (India)

Publications.

2. Remote Sensing and Geographical Information systems by M.Anji Reddy JNTU Hyderabad

2001,

3. B.S.Publications.GIS by Kang - tsungchang, TMH Publications & Co.

4. Basics of Remote sensing & GIS by S.Kumar, Laxmi Publications.

5. Fundamental of GIS by Mechanical designs John Wiley & Sons.


OPEN ELECTIVE

OPTIMIZATION TECHNIQUES

IT 416 / EE100



UNIT – I

Linear Programming:Introduction and formulation of models – Convexity - simplex method -

Bid method - two phase method – degeneracy – non existent and unbounded solutions -

duality in L.P. - dual simplex method - sensitivity analysis - revised simplex method -

transportation and assignment problems.

UNIT – II

Non-linear Programming:Classical optimization methods - equality and inequality constraints -

Lagrange multipliers and Kuhn-Tucker conditions - quadratic forms - quadratic programming

and Bessel’s method.

UNIT – III

Search Methods:One dimensional optimization - sequential search - Fibonacci search - multi

dimensional search method - Univariate search - gradient methods - steepest descent / ascent

methods - conjugate gradient method -Fletcher – Reeves method - penalty function approach.

UNIT – IV

Dynamic Programming:Principle of optimality recursive relation - solution of linear

programming problem - simple examples

TEXT BOOKS:

1. Engineering Optimization: Theory and Practice by S.S. Rao, 3rd

Ed., New Age International,

1998

2. Optimization Methods in Operations Research and Systems Analysis by K.V. Mittal and C.

Mohan, 3rd

Ed, New Age International, 1996.

REFERENCE BOOKS:

1. Non-linear Programming by P.L. Mangassarian.

2. Operations Research by S.D. Sharma.

3. Operations Research: An introduction by H.A. Taha, 6th

Edition, PHI.

4. Linear Programming by G. Hadley.


OPEN ELECTIVE

NON-CONVENTIONAL ENERGY SOURCES

IT 416 / EE 200



UNIT – I

Principle of Renewable Energy: Comparison of renewable and conventional energy sources -

Ultimate energy sources - natural energy currents on earth - primary supply to end use -

Spaghetti & Pie diagrams - energy planning - energy efficiency and management.

UNIT – II

Solar Radiation: Extra terrestrial solar radiation - terrestrial solar radiation - solar thermal

conversion - solar thermal central receiver systems - photovoltaic energy conversion - solar cells

– 4 models.

UNIT – III

Wind energy: Planetary and local winds - vertical axis and horizontal axis wind mills - principles

of wind power - maximum power - actual power - wind turbine operation - electrical generator.

UNIT – IV

Energy from Oceans: Ocean temperature differences - principles of OTEC plant operations -

wave energy - devices for energy extraction – tides - simple single pool tidal system.

Geothermal energy: Origin and types - Bio fuels – classification - direct combustion for heat and

electricity generator - anaerotic digestion for biogas - biogas digester - power generation.

TEXT BOOKS:

1. Renewable Energy Sources by John Twidell& Toney Weir : E&F.N. Spon.

REFERENCE BOOKS:

1. Power plant technology by EL-Wakil, McGraw-Hill.

2. Non-Conventional Energy Sources by G.D.Rai, Khanna Pub.


OPEN ELECTIVE

CONSUMER ELECTRONICS

IT 416 / EC 100



UNIT – I

Microphones, Headphones and Headsets, Loud Speakers, Disc Recording and Reproduction ,

Amplifying Systems Equalizers and Mixers, Electronic Music Synthesizers.

UNIT – II

Commercial Sound, Theatre Sound System, Audio Systems , Color TV standards and Systems,

Remote Controls, Video Systems.

UNIT – III

Electronic Gadgets and Home Appliances:

Telecommunication Systems, Switching Systems, Modulation Techniques, Carrier Systems, Fibre

Optics

UNIT – IV

Data Services, Mobile Systems, Facsimile fax, Xerography

TEXT BOOK:

1. Consumer Electronics by S.P.Bali, Pearson Education, ISBN: 9788131717592.

REFERENCE BOOKS:

1. Consumer Electronics for Engineers by Philip Herbert Hoff, Cambridge University Press (July

28, 1998), ISBN-10: 0521582075

2. Digital Consumer Electronics Handbook by RonadlK.Jurgen, (Editor) by McGraw Hill

Professional Publishing, 1997. ISBN-10: 0070341435.


OPEN ELECTIVE

EMBEDDED SYSTEMS

IT 416 / EC 200



UNIT – I

Introduction to embedded systems, design challenges, processor technology, ICtechnology,

design technology, tradeoffs, single purpose processor, RT levelcombinational logic, sequential

logic (RT level) custom single purpose processordesign, optimizing custom single purpose

processors.General purpose processors: basic architecture, pipelining, programmers

view,development environment, ASIPS, microcontrollers and digital signal processors

UNIT – II

State machine and concurrent process models: models vs. languages, FSMD, usingstate

machines, PSMM, concurrent process model, concurrent processes,communication and

synchronization among processes, data flow model and realtimesystems.Need for

communication interfaces, RS232/UART, RS422/RS485, USB, Infrared, IEEE 802.11, and

Bluetooth.

UNIT – III

Embedded system and RTOS concepts: Architecture of kernel, tasks and taskscheduler,

interrupt service routines, semaphores, mutex. Mail boxes, messagequeues, event registers,

pipes and signals.

UNIT – IV

Embedded system and RTOS concepts: Timers, memory management, priorityinversion

problem, embedded OS and real time OS, RT Linux, and Handheld OS.Design technology:

Introduction, automation, synthesis, parallel evolution ofcompilation and synthesis, logic

synthesis, RT synthesis, behavioral synthesis,system synthesis, HW / SW co- design, verification,

and co-simulation.

TEXT BOOKS:

1. Frank Vahid, Tony D Givargis, Embedded system design – A unified HW/ SW Introduction,

John Wily & sons, 2002.

2. KVKK Prasad, Embedded and real time systems, Dreemtech Press, 2005.

REFERENCE BOOKS:

1. Raj Kamal, Embedded system architecture, programming and design, TMH edition.

2. Mohammad Ali Mazidi, Janice G., The 8051 microcontroller and embedded systems, Pearson

edition.

3. Jonathan W Valvano, Embedded Microcomputer Systems, Brooks/cole, Thompson Learning.

4. David E. Simon, An Embedded Software Primer, Pearson edition.


OPEN ELECTIVE

VIRTUAL INSTRUMENTATION USING LABVIEW

IT 416 / EI 100



UNIT – I

REVIEW OF VIRTUAL INSTRUMENTATION: Historical perspective, Need of VI, Advantages of VI,

Define VI, block diagram & architecture of VI, data flow techniques, graphical programming in

data flow, comparison with conventional programming.

PROGRAMMING TECHNIQUES: VIS and sub-VIS, loops & charts, arrays, clusters, graphs, case &

sequence structures, formula modes, local and global variable, string & file input. Graphical

programming in data flow, comparison with conventional programming.

UNIT – II

DATA ACQUISITION BASICS: ADC, DAC, DIO, Counters & timers, PC Hardware structure, timing,

interrupts, DMA, Software and Hardware Installation. GPIB/IEEE 488 concepts, and embedded

system buses - PCI, EISA, CPCI, and USB & VXI. A

UNIT – III

COMMON INSTRUMENT INTERFACES: Current loop, RS 232C/RS 485, GPIB, System basics,

interface basics: USB, PCMCIA, VXI, SCXI, PXI etc,networking basics for office & industrial

application VISA & IVI, image acquisition & processing, MotionControl. ADC, DAC, DIO, DMM,

waveform generator.

UNIT – IV

USE OF ANALYSIS TOOLS AND APPLICATION OF VI: Fourier transforms, Power spectrum,

Correlation methods, windowing & flittering. Application in ProcessControl projects, Major

equipments- Oscilloscope, Digital Multimeter, Pentium Computers, temperature data

acquisition system, motion control employing stepper motor.

TEXT BOOKS:

1. Gary Johnson, LABVIEW Graphical Programming , 2nd Edition, McGraw Hill, 1997.

2. Lisa K. Wells and Jeffrey Travis, LABVIEW for Everyone , PHI, 1997.

3. Skolkoff, Basic concepts of LABVIEW 4 , PHI, 1998.

REFERENCE BOOKS:

1. S. Gupta, J.P. Gupta, PC Interfacing for Data Acquisition and Process Control, ISA, 2nd Edition,

1994.

2. Technical Manuals for DAS Modules of Advantech and National Instruments.

3. L.T. Amy, Automation System for Control and Data Acquisition, ISA, 1992.


OPEN ELECTIVE

SENSORS AND TRANSDUCERS

IT 416 / EI 200



UNIT – I

Introduction: Definition related to measurements /instrumentation, static and dynamic

characteristics of instruments, classification of transducers.

UNIT – II

Displacement Measurement: Variable resistance devices, variable inductance devices, variable

capacitance devices, digital displacement transducers.

Strain measurement: Stress-strain relations, resistance strain guages, types of strain gauges,

strain gauge measurement techniques, static measurements ,dynamic measurements.

Calibration of strain gauge, strain gauge load cell, force and torque measurements using strain

gauge.

UNIT – III

Pressure measurement: Diaphragm, Bellows, Bourdon tubes, Resistive inductive and capacitive

transducers, piezo-electric transducers.

Low pressure measurement: McLeod gauge, Knudson gauge, Ionization gauge.

Temperature measurement: RTD, Thermocouple and thermistor.

UNIT – IV

Flow measurement: Head type flowmeters, Rotometer, Electromagnetic flow meter.

Measurement of liquid level, viscocity, humidity and moisture.

TEXT BOOKS:

1. A.K.Ghosh,Introduction to Instrumentation and Control, PHI.

2. BC Nakra, KK Chaudhry,Instrumentation measurement and analysis, TMH, New Delhi second

edition.

REFERENCE BOOKS:

1. PatranabisD,”Sensors and transducers”, second edition, PHI,New Delhi 2003.

2. Ernest O Doeblin, ”Measurement Systems Application and Design”, TMH.


OPEN ELECTIVE

WEB TECHNOLOGY

CS 416 / IT 100



UNIT – I

(15Periods)

Introduction to XHTML, Cascading Style Sheets (CSS), JavaScript: Introduction to Scripting,

Control Statements, Part 1, Control Statements, Part 2, Functions, Arrays, Objects.

UNIT – II

(16Periods)

Dynamic HTML: Object Model and Collections, Dynamic HTML: Event Model, XML, RSS (Really

Simple Syndication).

UNIT – III

(15 Periods)

Building Ajax-Enabled Web Applications, Web Servers (IIS and Apache).

UNIT – IV

(18 Periods)

Servlets and Java Server Pages.

TEXT BOOK:

1. Harvey M. Deitel and Paul J. Deitel, “Internet & World Wide Web How to Program”, 4/e,

Pearson Education.

REFERENCE BOOKS:

1. Jason Cranford Teague, “Visual Quick Start Guide CSS, DHTML &AJAX”, 4e, Pearson

Education.

2. Tom NerinoDoli smith, “JavaScript & AJAX for the web”, Pearson Education, 2007.

3. Joshua Elchorn, “Understanding AJAX”, Prentice Hall, 2006.

4. Marty Hall, Larry Brown, “Core Servlets and Java Server Pages™: Volume 1: Core

Technologies”, 2nd Edition, Prentice Hall.


OPEN ELECTIVE

.NET TECHNOLOGIES

CS 416 / IT200



UNIT – I

Introduction to C# 2.0, Expressions and control structures, Strings and regular expressions,

Arrays and collections, Object-oriented programming in C#, Introduction to generics, I/O and

persistence, Working with XML, Events and delegates, Multithreaded programming, Reflection

fundamentals

UNIT – II

Assemblies and AppDomains, COM and windows interoperability, Code access security,

Cryptography and data protection, Optimizing your .NET 2.0 code, ADO.NET fundamentals,

Advanced ADO.NET techniques, Working with ADO.NET data providers, Programming with SQL

Server 2005.

UNIT – III

HTML, Introduction to ASP.NET 2.0 and Web forms, ASP.NET Web Controls, Statemanagement

in ASP-NET 2.0, Using master pages, ASP.NET personalization and customization, Building rich,

database-driven Web applications, Securing your ASP.NETapplications, Exposing functionality

with Web services.

UNIT – IV

Introduction to Windows Forms 2.0, The Windows Forms control library, Advanced user,

interface programming, Data binding with Windows Forms 2.0, Remoting

TEXT BOOKS:

1. Microsoft Visual C# 2005 Unleashed by Kevin Hoffman, Sams (Pearson India), 2006.

REFERENCE BOOKS:

1. Core C# and .NET by Stephen C.Pary, Prentice Hall (Pearson Education), 2006.

2. C#: The complete reference by Herbert Schildt, Tata McGraw Hill, 2006 2/e.

3. Pro C# 2005 and the .NET Platform by Andrew Troelson, Apless 2005 3/e.


OPEN ELECTIVE

ROBOTICS

IT 416 / ME 100



UNIT – I

Introduction to Robotics, major components of a robot, robotic like devices, classification of

robots – Classification by coordinate system and by control method, Specifications of robots,

fixed versus flexible automation, economic analysis, overview of robot application.

UNIT – II

Robot end Effectors : Introduction, end effectors, interfacing, types of end effectors, grippers

and tools, considerations in the selection and design of remote centered devices.

UNIT – III

Robotic sensory devices : Objective, Non-optical position sensors – potentiometers, synchros,

inductocyn, optical position sensors – optic interrupters, optical encoders (absolute &

incremental).

Proximity sensors: Contact type, non contact type – reflected light scanning laser sensors.

Touch & slip sensors: Touch sensors – proximity rod & photo detector sensors, slip sensors –

Forced oscillation slip sensor, interrupted type slip sensors, force and torque sensors.

UNIT – IV

Transformations and Kinematics: Objectives, homogenous coordinates, basic transformation

operations, forward solution – DenavitHartenberg procedure. Simple problems involving planar

manipulators, inverse or backward solution – problems involved, techniques.

Introduction to Trajectory Planning, the manipulator jacobian.

TEXT BOOKS:

1. Robotic Engineering by Richard D.Klafter.

2. Industrial Robotics by MikellP.Groover.

REFERENCE BOOKS:

1. Introduction to Robotics – John J.Craig.

2. Robotics – K.S.Fu, Gonzalez & Lee.

3. Robotics for Enginers by YoramKoren.

4. Robotics Technology and Flexible Automation by S.R.Deb.

5. Robotics by Saeed.B.Niku.


OPEN ELECTIVE

POWER PLANT ENGINEERING

IT 416 / ME 200



UNIT – I

INTRODUCTION: Various Energy sources, types of power plants.

HYDRO ELECTRIC POWER PLANT: Hydrology, Rainfall, Run off and their measurement,

hydrograph, Flow duration curve, Mass curve and calculation of storage capacity, site selection

of hydro plant, different types of hydro plants.

DIESEL AND GAS TURBINE POWER PLANTS: Classification, main components of plant, plant

layout, application and comparison with other plants.

UNIT – II

THERMAL POWER PLANT: General layout, Fuels, Coal analysis, Coal handling, burning of coal -

stoker and pulverized systems, Ash handling systems, ESP, Need for Draught, High-pressure

boilers, Condensers, cooling ponds and towers (wet and dry types), Deaeration.

UNIT – III

NUCLEAR POWER PLANTS: Nuclear Fission, Nuclear Fuels, Components of Reactor, types of

Nuclear Reactors, Breeding, Fast Breeder Reactor, Radiation shields, nuclear waste disposal.

FLUCTUATING LOADS ON POWER PLANTS: Various performance Factors (load factor, diversity

factor, use factor etc.).

POWER PLANT ECONOMICS: Fixed costs, operating costs, cost per kWh, comparison of fixed

and operating costs of hydro, thermal, nuclear plants, power tariffs.

POLLUTION AND CONTROL: Introduction, particulate and gaseous pollutants, thermal pollution

and solid waste pollution, methods to control pollution - brief description.

UNIT – IV

SOLAR ENERGY: Solar collectors, solar energy storage, solar ponds, solar energy utilization and

applications.POWER: Basic principle, different types of wind mills, wind energy conversion

systems, other applications.

GEOTHERMAL POWER: sources, energy conversion system.

OTEC: ocean thermal energy conversion systems, introduction to tidal power.

DIRECT ENERGY CONVERSION SYSTEMS: Fuel cells, MHD, Solar cell.

TEXT BOOKS:

1. Power Plant Engineering - G.R. Nagpal, Khannapubl, New Delhi

2. Power Plant Engineering –P.K.Nag, TMH

3. Non Conventional Energy Sources - G.D. Rai, Khannapubl, New Delhi.

REFERENCE BOOKS:

1. Power Plant Technology - M.M. El Wakil, MGH, New York.

2. Principles of Energy Conversion - A.W.Culp, MGH, New York.


TERM PAPER

CS/IT 451



It is aimed as a precursor to the project work done in the second semester of the final year

B.Tech. It should help the students to identify their Research area/topic and should form the

groundwork and preliminary research required for the project work. The batches formed for

pursuing the project work in the final year shall select some research article published in the

latest journals of IEEE, ACM and other related journals. Each batch should refer to a minimum

of FIVE reference sources outside their prescribed textbooks. The batch must gain an

understanding of the research tools used and the related material, available both in printed and

digital formats. Each project batch must make the presentation for two rounds on the same

research article about their understanding, conclusion and if possible propose the extensions

for the work. Each individual of the batch must give the presentation in both the rounds.

At the end of the semester, the batch must submit a report in IEEE format, on the work they

have pursued throughout the semester containing

� The aim and objective of the study.

� The Rationale behind the study.

� The work already done in the field and identified.

� Hypothesis, experimentation and discussion.

� Conclusion and further work possible.

� Appendices consisting of illustrations, Tables, Graphs etc.,




a.


�


�



�


�

f.


�





�


�


OBJECT ORIENTED ANALYSIS AND DESIGNLABORATORY

CS/IT 452



Prerequisites:IT 214 Object Oriented Programming and IT 224 GUI Programming

Course Objectives:

To impart in depth knowledge so that the student will

1. Develop a problem statement.

2. Develop an IEEE standard SRS document. Also develop risk management and project plan

(Gantt chart).

3. Identify Use Cases and develop the Use Case model.

4. Identify the business activities and develop an UML Activity diagram.

5. Identity the conceptual classes and develop a domain model with UML Class diagram.

6. Be using the identified scenarios find the interaction between objects and representthose

using UML Interaction diagrams.

7. Draw the State Chart diagram.

8. Identify the User Interface, Domain objects, and Technical services.

9. Develop architecture diagram with UML package diagram notation.

10. Implement the User Interface layer.

11. Draw Component and Deployment diagrams.

Suggested domains for Mini-project

• Bank Management

• Online Exam Registration

• E-Seva

• Safe Railway System

• Safe Home System

Topics:

• Analysis

• Use Case View

• Logical View

• Design




a.


�


�


�

d.


�


f.


�

g.


�



�



�


ALGORITHMSLAB

CS/IT 453



Course Objectives:


1. Basic data structures for searching and sorting –hash tables, trees, heaps, and the

computational complexity of the searching and sorting algorithms that use these structures.

2. Advanced sorting algorithm and their computational complexity.

3. Basic graph algorithms and their computational complexity.

4. Basic classes of algorithms, such as greedy algorithms, divide-and-conqueralgorithms,

branch-and-bound algorithms, genetic algorithms, backtracking algorithms.

5. Concepts of computational complexity and computability and be able to apply in practice

the Big-Oh notation technique for complexity evaluation.

Course Outcomes:

After the completion of this course the student will be able to

1. Analyze the complexity of a given algorithm.

2. Apply classical sorting, searching, optimization and graph algorithms.

3. Compare, contrast, and choose appropriate algorithmic design techniques to present an

algorithm that solves a given problem.

4. Explain NP-Completeness and deal with NP-complete problems.

5. Use different algorithm-design techniques, including, but not limited to, greedy, divide-and

conquer, and dynamic programming techniques, to solve particular problems.

6. Model real problems abstractly using the language of graphs and flows.

7. Make intelligent decisions about alternative data structures and algorithmic techniques in

the context of practical software problems, choosing from existing data structures and

algorithms or designing your own when necessary.


Course Syllabus:

1. Implement Strassen’s Multiplication.

2. Implement Dijkstra’s Algorithm.

3. Implement Prim’s Algorithm.

4. Implement Kruskal’s Algorithm.

5. To determine Shortest Path in Multi-stage graph using Forward & Backward approach.

6. Implement Traveling Salesman Problem using Dynamic Programming.

7. Implement longest common sequence algorithm.

8. Implement DFS traversal of a given graph.

9. Find the strongly connected components of a graph.

10. Find the articulation bi-connected components.

11. Implement FIFO branch and bound algorithm for 0/1 Kanpsack problem.

12. Implement LC branch and bound algorithm for Traveling Salesman problem.




a.


�


�


d.


�


�

f.


g.


�


�



�


�


INDUSTRIAL MANAGEMENT & ENTREPRENEURSHIP DEVELOPMENT

IT421 / ME05



Topics:

• General management

• Marketing Management

• Production and Materials Management

• Financial Management

• Depreciation

• Personnel Management

• Entrepreneur Development

Reference Books:

1. Operations Management, Joseph G Monk.

2. Production, Planning and Control, Samuel Eilon.

3. Marketing Management, Phillip Kotler.

4. Financial Management I.M.Pandey.

5. Projects, Prasanna Chandra.

6. The Essence of Small Business, Barrow colin.

7. Small Industry Ram K Vepa.




a.


�





f.



�



�


�



DATA ENGINEERING

CS/IT 422



Prerequisites: IT 315: Database Management Systems.

Course Objectives:

To impart knowledge so that the Student will

1. Understanding of the fundamental theories and concepts of data warehouse

2. Be able to Understanding of the fundamental theories and concepts of data mining.

3. Be able to conduct dimensional modeling.

4. Understand the process of data mining and the key concepts involved.

5. Be able to learn data preprocessing techniques, and too learn basic algorithms and

techniques for mining frequent patterns, associations, and correlations.

6. Identify new decision alternatives and making predictions.

7. Develop a thorough understanding of popular classification and prediction techniques as

well as unsupervised data mining techniques and the mathematical theory behind them.

8. Be ability to conduct data extraction, transformation and loading (ETL).

9. Develop their ability to conduct online analytic processing (OLAP)

10. Understand their ability to implement typical data mining techniques.

Course Outcomes:

Upon the completion of this course the student will be able to:

1. Describe and utilise a range of techniques for designing data mining and data warehousing

systems.

2. Appreciate the strengths and limitations of various data mining models.

3. Appreciate the practical implications and limitations of data mining analyses applied to real-

life situations.

4. Demonstrate understanding of neural networks, fuzzy logic, evolutionary computation

(genetic algorithms), intelligent agents and machine learning, and some of the major

applications associated with them.

5. Demonstrate understanding of the functionality of the various web mining and web search

components and appreciate the strengths and limitations of various web mining and web

search models.

6. Use the tools and techniques employed in data mining for different application domains.

7. Describe different types of research and understand alternative research paradigms.


Topics:

• Data Warehouse

• Data Mining

• Data Preprocessing

• Mining Association roles in large databases

• Cluster Analysis

• Classification & Prediction

• Mining Complex Type of Data

Reference Books:

1. “Data Warehouse Toolkit”, Ralph Kinball, John Wiley Publishers.

2. “Data Mining (Introductory and Advanced Topics)”, Margaret H.Dunham, Pearson

Education.

3. “Data Warehousing in the real world – A Practical guide for Building decision support

systems”, Sam Anahory, Dennis Murray, Pearson Education.

4. “Introduction to Data Mining with case studies”,G.K.Gupta, PHI Publications, 2006.




a.


�



�


�


�

f.






�


�


E-COMMERCE & ERP

IT 423 (A)



Course Description:

E-COMMERCE:

Electronic commerce technologies provide new strategic opportunities that must be

considered by any business that wants to have a global presence. The convergence of

computing and communications technologies impacts such organizational processes as new

product development, resource acquisition, order fulfillment and customer service.

This course provides tools, skills, and an understanding of technology, business concepts

and issues that surround the emergence of electronic commerce on the Internet.

The student will develop an understanding of the current practices and opportunities in

electronic publishing, electronic shopping, electronic distribution, and electronic

collaboration. We also explore several of the problems surrounding electronic commerce such

as security - authentication, privacy - encryption, safeguarding of intellectual property rights,

acceptable use policies, and legal liabilities.

ERP:

ERP focus is on people-and how to provide them with superior decision-making

processes for customer order fulfillment, supply chain management, financial planning, e-

commerce, asset management, and more. Successful implementation of Enterprise resource

planning Effective forecasting, planning, and scheduling is fundamental to productivity.

Properly implementing ERP will give you a competitive advantage and help in running business

more effectively, efficiently, and responsively.

COURSE OBJECTIVES:

This course has specific objectives that are focused on these concepts:

1. The scope of e-commerce in the realm of modern business.

2. The technologies used to develop and deliver e-commerce applications.

3. The marketing methods used in e-commerce.

4. The legal and regulatory framework in which e-commerce must operate.

5. The methods and metrics used to measure effectiveness of e-commerce activities.


Outcomes

Upon successful course completion, students should have an understanding of contemporary

ecommerce concepts and terminology, and the processes and management decisions that are

involved in launching, operating and managing business activity on the World Wide Web.

Students will be introduced to the technology used in e-commerce, and become familiar with

important business, legal and ethical issues. Given that almost any modern business will be

involved with some aspect of e-commerce as a means of providing or obtaining goods and

services, familiarity with e-commerce concepts will benefit all students.

TOPICS:

• Introduction

• B2B E-Commerce

• Support Services

• Other Ecommerce Models and Applications

• Strategy and Implementation

• Introduction to ERP

• Company Wide Implementation

TEXT BOOK:

1. E-commerce 2004:a managerial perspective -- Efraim Turban, David King, Jae Lee and

Dennis Viehland, pearson edition.(Unit I,II,III)

2. ERP: Making It Happen: The Implmenters Guide to Success with Enterprise Resource

Planning - Thomas F. Wallace, Michael H.Kremzar, Wiley Publications, Aug 2001.(Unit

IV).

REFERENCE BOOKS:

1. Frontiers of E-Commerce - Ravi Kalakota, Andrew B.Whinston, Pearson Education.

2. E-Commerce: Business, Technology, Society - Kenneth C.Laudon, Carol GuercioTraver.

3. Introduction to Information Systems: Essentials for the E-Business Enterprise, 11th

Edition - James A.O'Brien.

4. E-Business and ERP - Rapid Implementation and Project Planmning - Morrell G. Shields,

May 2001, Wiley Publications.

5. ERP a managerial perspective, by SADAGOPAN, S.Tata McGraw Hill .




a.


�


�


�


�


f.






�


�


GRID COMPUTING

CS/IT 423(B)



Pre-requisite:

• Knowledge of network protocols

• Experiences with object-oriented programming

• Good working knowledge in java

• Basics of client/server programming

• Fundamental knowledge of xml

CS/IT415 Distributed Systems

CS/IT214 Object Oriented Programming,

CS/IT224 GUI Programming,

CS/IT321 Computer Networks,

CS/IT323 Web Technologies

CS/IT 361 Computer Networks Lab

CS/IT362 Web Technologies Lab

CS/IT411 Cryptography & Network Security

Course objectives:


1. Understand the need for and evolution of Grids in the context of processor- and data-

intensive applications

2. Be familiar with the fundamental components of Grid environments, such as

authentication, authorization, resource access, and resource discovery

3. Be able to design and implement Grid computing applications using Globus or similar

toolkits

4. Be able to justify the applicability, or non-applicability, of Grid technologies for a specific

application

5. Be providing with an overview of the basic concepts of Grid Computing.

6. Highlight the advantages of deploying Grid Computing.

7. Illustrate the practical adoption of a Grid deployment through real life case studies.

8. Have in-depth introduction to Grid technologies and applications.

9. Understand the technologies and software in the area of grid computing.

10. Programs on Linux platform.

CourseOutcomes:

Upon the completion of this course the student will be able to

1. Understand and explain the basic concepts of Grid Computing;

2. Explain the advantages of using Grid Computing within a given environment;

3. Prepare for any upcoming Grid deployments and be able to get started with a potentially

available Grid setup.

4. Discuss some of the enabling technologies e.g. high-speed links and storage area networks.

5. Build computer grids.

6. Explain the use of some of the grid computing and clustering middleware used to

implement.

7. Develop Virtual super computers.

8. Explain programming toolkits such as Parallel Virtual Machine and Message Passing

9. Interface (MPI) for writing parallel computer applications.

10. Explain HPC Portals, peer-to-peer (P2P) networking and semantic grids.

11. Elaborate some of the significant grid computing areas of application e.g. Bio-Technology.


12. Develop E-Health and E-Medicine, Finance, applications on Computer Networks.

Topics:

• Grid Computing

• Grid Computing Organizations And Their Roles

• Merging The Grid Services Architecture With The Web Services Architecture

• Open Grid Services Architecture (OGSA)

• Open Grid Services Infrastructure (OGSI)

• OGSA Basic Services

• Globus Gt3 Toolkit

Reference Books:

1. Fran Berman, Geoffrey Fox, Anthony J.G. Hey, “Grid Computing: Making the Global

Infrastructure a Reality “, John Wiley and Sons,2003.

2. Ahmar Abbas, “Grid Computing: A Practical Guide to Technology and Applications”, Charles

River Media, 2003.

3. D Janaki Ram, “Grid Computing”, TMH.




a.


�


�


�


�


�

f.


�





�



WIRELESS NETWORKS

CS/IT 423(C)



Prerequisite: Data Communications, Computer Networks, High-level programming experience

(C is a must).

Course Objectives:

To impart the knowledge to the students so that they will

1. Understand the elements of wireless communication systems

2. Understand and apply multiple access techniques for mobile systems

3. Understand mobile systems and standards

4. Understand and apply cellular systems design fundamentals

5. Have the ability to analyze and design cellular systems in the physical layer

6. Understand and apply characterization of wireless channels

7. Have the ability to analyze wireless channel parameters and relate them to wireless systems

Course Outcomes:

Students who have successfully completed this course will be able

1. To have a good understanding of Mobile Communication

2. To understand the existing Cellular Systems

3. To know the concept of switching systems

4. To understand the concept of Base station subsystems

5. To design layers appropriate to frame a wireless network

6. To design necessary protocols for wireless framework


Topics:

• Introduction

• Wireless Transmission

• Medium Access Control

• Telecommunication Systems

• Satellite Systems

• Broadcast Systems

• Wireless LAN

• Mobile Network Layer

• Mobile Transport Layer

• Wireless Application Protocol

Reference Books:

1. William Stallings, “Wireless Communication Networks”, Pearson Education.

2. UWE Hansmann, LotherMerk, Martin S.Nicklous, Thomas Stober, “Principles of Mobile

Computing”, 2nd

Edition.




a.


�



�

d.


�


�

f.


g.




�


�


�


STORAGE AREA NETWORKS

IT 423 (D)



Prerequisites: CS 211 MATHEMATICS – III

CS 116 ‘C’ Programming

CS 315 Database Management Systems.

Course Objectives:


1. Understand the Benefits of Biometric Security.

2. Be able to do Verification and identification.

3. Understand Finger scan, Features, Components, Operation (Steps), Competing finger Scan

technologies, also their Strength and weakness.

4. Do Facial Scan. Can Understand Features, Components, Operation (Steps), Competing facial

Scan technologies, and their Strength and weakness.

5. Be able to understand other physiological biometrics, Hand scan, Retina scan, AFIS

(Automatic Finger Print Identification Systems), Behavioral Biometrics, Signature scan,

keystroke scan.

6. Be able to Develop Biometrics Application, Biometric Solution Matrix.

7. Be able to Understand Biometric standards, Biometrics for Network Security.

8. Do statistical measures of Biometrics and Biometric Transactions.

Course Outcomes:

After the completion of this course the Student will be able to

1. Grasp the benefits of Biometric security.

2. Develop effective security systems.

3. Develop applications for finger scan and other biometric techniques.

4. Develop applications for facial scan security systems.

5. Compare different technologies of biometric systems.

6. Develop biometric solution matrix.

7. Do bio metric transactions.

8. Do research and improve existing systems.


Topics:

• Introduction

• Verification and identification

• Basic working of biometric matching

• Finger scan

• Facial Scan

• Iris Scan

• Voice Scan

• Other physiological biometrics

• Hand scan

• Retina scan

• Biometrics Application

• Biometric standards

• Biometric middleware.

• Biometrics for Network Security

Reference Books:

1. “Biometrics for Network Security”, Paul Reid, Pearson Education.

2. “Biometrics – TheUltimate Reference”, John D. Woodward, Jr. Wiley Dreamtech.




a.


�


�


�


�


�

f.





�


�



NETWORK MANAGEMENT SYSTEMS

CS/IT 423 (E)



Prerequisites:CS/IT323-Basic UNIX skills, Ethernet, CS/IT 321-Ipv4 operation and routing.

Course Objectives:

To Impart to knowledge of

1. The major issues in network and computer system security, focusing mainly on threats from

malicious software.

2. Understanding of common attacks on computer networks and methods to detect and

remediate such attacks.

3. Understanding of the guiding principles of computer system security.

4. Evaluating information security procedures and practices.

5. Design and implement information security procedures and practices.

Course Outcomes:

After completion of the course the student will

1. Master TCP/IP version 4 addressing and network design.

2. Master modern network infrastructure support systems (DNS, DHCP, NTP, syslog).

3. Master network issue debugging techniques with tools such as Ethereal and tcpdump.

4. Master installation and configuration of multiple vendors routing equipment.

5. Be familiar with modern ethernet systems, including spanning tree and 802.1q.

6. Modern VLANS.

7. Be familiar with modern routing protocols (BGP, OSPF).

8. Be familiar with IPv6 addressing and network design.

9. Be familiar with SNMP protocol and its uses in managing and monitoring networks.

10. Be familiar with Stateless IP firewalling concepts and commands.

Topics:

• Data Communications And Network Management Overview

• SNMPV1 Network Management

• SNMPV1 Network Management

• SNMP Managementsnmpv2

• SNMP Management RMON

• Telecommunications Management Network

• Network Management Tools And Systems

• Web-Based Management

References Books:

1. “Network management”, Morris, Pearson Education.

2. “Principles of Network System Administration”, Mark Burges, Wiley Dreamtech.

3. “Distributed Network Management”, Paul, John Wiley.




a.




d.



f.


g.







ADVANCED COMPUTER ARCHITECTURE

CS/IT 424 (A)



Prerequisite:IT212 - Computer Organization.

Course Objectives:

To impart knowledge to the student in

1. Parallel Computer Models

2. Multiprocessor Interconnection Networks

3. Technology Trends / Performance Metrics / Methodology

4. Pipelining

5. Advanced Instruction Level Parallel Processing

6. Control Flow/Data Flow Prediction

7. Multiprocessor Memory Architectures

8. Scalable, Multi-Threaded Architectures

9. Parallel Programming Models, Languages and Compilers

Course Outcomes:

After the successful completion of this course the student will have

1. Knowledge and understanding of advanced concepts of computer architecture.

2. Exposure to differentials of shared memory multiprocessors and distributed memory multi-

computers.

3. Ability to understand and explain the performance observed and degree of parallelism

4. Knowledge in modern design structures of Pipelined and Multiprocessors systems.

5. Skills in evaluating and optimizing the performance of parallel computer architectures

6. Capability to study more advanced topics in computer architecture

7. Acquainted with recent computer architectures, as well as the low-level language required

to drive/manage these types of advanced hardware.

Topics:

• Parallel Computer Models

• Program and network properties

• System Interconnect Architectures

• Principles of Scalable Performance

• Pipelining

• MULTI Processors

• Scalable, Multi-Threaded and Dataflow Architectures

• Parallel Models, Languages and Compilers

Reference Books:

1. D.A. Patterson and J.L.Hennessey, “Computer organization and Design”, Morgan Kaufmann,

2nd

Edition.

1. V.Rajaram&C.S.R.Murthy, “Parallel Computer”, PHI.

2. Barry Wilkinson and Michael Allen, “Parallel Programming”, Pearson Education.




a.


�




�


�

f.






�


�


NATURAL LANGUAGE PROCESSING

CS/IT 424 (B)



Prerequisites:IT 313 Automate theory and Formal Language, IT322 Compiler Design

Course Objective:

The student will

1. Learn how Natural Language Processing seeks to analyze, generate, and understand human

language via computational techniques.

2. Understand specific applications include part-of-speech tagging, machine translation, and

authorship attribution.

3. Develop familiarity with lexical, syntactic, semantic and pragmatic aspects of NLP.

4. Develop an understanding of NLP Models and Algorithms.

5. Develop background in statistical and machine learning approaches to NLP.

6. Be knowledgeable in various approaches—symbolic, empirical, and artificial network to

Natural Language Processing

7. Apply appropriate techniques to NLP problem-solving situations

8. Compare and contrast techniques in each approach

Course Outcomes:

The student will be able to

1. Know the main methods of processing required for computers to analyze and understand

texts in a human language

2. Understand the strengths and weaknesses of current Natural Language Processing (NLP)

technology

3. Know the main models and algorithms used in NLP, such as in morphological analysis, part-

of-speech tagging, and parsing, semantic analysis, and discourse and dialogue analysis.

4. Know at least one programming language suitable for text processing be able to write

simple NLP applications and present their work both orally and in writing

5. Be able to evaluate the performance/accuracy of NLP systems

6. Be aware of current research in NLP.

Topics:

• Introduction to Natural Language Understanding, Syntactic Processing

• Features and Augmented Grammars, Toward Efficient Parsing, Ambiguity Resolution

• Semantic Interpretation

• Context and World Knowledge

Reference Books:

1. Speech and Language Processing – Daniel Jurafsky, James H.Martin.

2. Foundations of Statistical Natural Language Processing – Christopher Manning,

HinrichSchutze, MIT Press.

3. Artificial Intelligence, Elaine Rich and Kevin Knight, Second Edition, Tata McGraw Hill.




a.


�


�


�



�

f.


�


�


�


�


�



INFORMATION RETRIVAL

CS/IT 424 (C)



Pre-requisites: IT 221: Probability and Statistics and IT 315: DBMS

Course Objective:

To impart the in depth knowledge so that the student will

1. Understand the dimensions of the information retrieval "problem";

2. Understand the functions of an information retrieval system;

3. Analyze the components of an information retrieval system;

4. Understand the factors which optimize the information retrieval process;

5. Understand current issues in information retrieval

6. Understand the principles and techniques of information retrieval.

Course Outcomes:

Upon the successful completion of this course the student will be able

1. Learn history of information retrieval research and development of information retrieval

systems.

2. Explain core concepts and terms of information retrieval.

3. Explain different retrieval models and basic algorithms involved in processing and retrieval

of information.

4. Identify the essential components and functions of an information retrieval system.

5. Evaluate existing information retrieval systems and suggest how the systems can be

improved.

6. Apply theories to effectively solve information retrieval problems in real world situations.

7. Design information retrieval systems using principles and techniques.

Topics:

• Boolean retrieval

• Index compression

• Relevance feedback & query expansion

• Text classification & Naive Bayes

References Books:

1. Ricardo Baeza, Yates, BerthierRibeiro, Neto, “Modern Information Retrieval”, Addison

Wesley.

2. http://www.dcs.gla.ac.uk/Keith.




a.


�


�


�


�


�

f.


�




�


�


�


MULTIMEDIA SYSTEMS

CS/IT 424(D)

Lectures : 4 Periods/week, Tutorial: 1 Continuous Assessment : 40


Prerequisites: IT213 - Computer Graphics

IT 116- Computer Programming with C

IT 214 - Object Oriented Programming

IT 224 - GUI Programming

Course Objectives:

The Student will

1. Be able to design and implementation of hypermedia & multimedia systems.

2. Develop an interactive multimedia application to display their ability to use multimedia

tools including multimedia authoring.

3. Understand the constraints on multimedia systems and the range of technologies available

to multimedia systems designers and integrators.

4. Have an insight into how the quality of multimedia systems is perceived and how this

relates to the design of multimedia input, output and editing systems.

5. Be able to understand different compression principles and different compression techniques.

6. Be able to design and develop multimedia systems according to the requirements of multimedia

applications.

7. Be able to understand the particular issues of operating stored and interactive multimedia

systems within a distributed/networked environment.

Course Outcomes:


1. Analyze and explain various technologies involved to support multimedia application

development.

2. Achieve an in-depth understanding of the impact of multimedia on personal and distributed

computer systems, the range of media types and tools to support their digital conversion

and manipulation;

3. Explore case-studies of multimedia information systems.

4. Evaluate and Discuss Excellent and ineffective interactive multimedia design.

5. Produce Multimedia Presentation and interactive web page design.

6. Design and implement a number of multimedia applications.

7. Solve multimedia project development problems and capable to lead a multimedia

development project, also to market their multimedia products.

8. Do research in multimedia industry.


Topics:

• Multimedia Authoring and data representations

• Multimedia Authoring and Tools

• Graphics and Image data representation

• Color in image and Video

• Basics of Digital Audio

• Lossless compression algorithms

• Lossy Compression Algorithms

• Image compression Standards

• Basic Video Compression Techniques

• MPEG Video Coding

• Multimedia Network Communications and applications

• Content Based retrieval in Digital Libraries

Reference Books:

1. Multimedia Applications, Steinmetz, Naharstedt, Springer.

2. Multimedia Communications, Applications, Networks, Protocols and Standards Fred Halsall,

Pearson education.

3. Multimedia systems design, Prabhat K. Andeliegh, KiranThakrar, PHI, 2007.

4. Multimedia producers Bible, Ron Goldberg, comdex computer publishing.




a.


�



�


�


�

f.


�




�


�



SOFTWARE TESTING METHODOLOGIES

CS/IT 424 (E)



Prerequisite: IT 324 Software Engineering and IT 413 Object oriented analysis and design

Course Objective:

The student will

1. Have a clear understanding and knowledge of the foundations, techniques, and tools in the

area of software testing and its practice in the industry.

2. Be able to discuss the distinctions between validation testing and defect testing

3. Understand the principles and need for various types of testing

4. Know to describe strategies for generating system test cases

5. Understand the essential characteristics of tool used for test automation

6. Identify the applications of testing techniques in various fields

7. Understand the behavior of a program on a finite set of test cases

8. Learn strengths and weakness of a variety of software testing techniques

9. Understand the significance of metrics.

Course Outcomes:


1. Perform the tests reliably precisely the same operations each time they are run, thereby

eliminating human error.

2. Test how the software reacts under repeated execution of the same operations.

3. Do sophisticated tests that bring out hidden information from the application.

4. Build a suite of tests that covers every feature in an application.

5. Know howto reuse tests on different versions of an application, even if the users interface

changes.

6. Obtain better quality software because more tests can be done in less time with fewer

resources

7. Know howautomated tools run tests significantly faster than human users.

8. Reduce the costas the number of resources for regression test is reduced.


Topics:

• Principles of Testing; Software Development Life Cycle Models

• Testing

• Black Box Testing

• Integration Testing

• System and Acceptance Testing

• Regression Testing

• Ad hoc Testing

• Usability and Accessibility Testing

• Common People Issues

• Organization Structures for Testing Teams

• Test Planning, Management, Execution and Reporting

• Software Test Automation

• Test Metrics and Measurements

References Books:

1. “Software Testing techniques”, BarisBeizer, Dreamtech, second edition.

2. “The craft of software testing”, Brian Marick, Pearson Education.

3. “Software Testing Techniques”, SPD(Oreille).

4. “Software Testing – Effective Methods, Tools and Techniques”, RenuRajani, Pradeep Oak,

TMK.

5. “Effective methods of Software Testing”, Perry, John Wiley.




a.



�



�


�

f.







�


PROJECT WORK

CS/IT 461



The Project work shall be carried out by a batch consisting not more than four students for one

semester. It should help the students to comprehend and apply different theories and

technologies that they have learnt through and are learning. It should lead to a substantial

result as a comparative study, a new application of the technologies available or some

extension to the works carried out by some researcher and published in referred journals. Each

batch must carryout the analysis, design, implementation and testing of the entire project

basing on the Software Engineering principles. There shall be a total of four reviews made by

the batch regarding:

1. 0th

Review : The idea/concept which forms the basis for their

project shall be presented to the guide, concerned in

charge and classmates and shall get the approval for

continuation.

2. 1st

Review : The analysis and design carried out.

3. 2nd

Review : The implementation and the testing done.

4. 3rd

Review : Over all Presentation of the work carried out and the

results found out for the valuation under the internal

assessment.

A comprehensive report on the lines of IEEE Format is to be submitted at the end of the

semester, which is certified by the concerned guide and the HOD.

There shall be an external guide appointed by the University to make an assessment and to

carryout the Viva-Voce examination.




a.


�


�


d.


�


�

f.


�

g.





�


�


DATA ENGINEERING LAB USING

ORACLE 9i & 10g, ORACLE OWB, INFORMATICA, Clementine Tools

CS/IT 462



Prerequisites: IT 352 Relational Database Management Systems lab.

Course Objectives:

The Student will

1. Analyze data with ROLLAP, CUBE, CUBE Slicing, Drill-Down or Roll-Down operations.

2. Create Data Ware House Architectures.

3. Be able to conduct data preprocessing.

4. Understand the process of data mining and the key concepts involved.

5. Be able to learn data preprocessing techniques, and too learn basic algorithms and

techniques for mining frequent patterns, associations, and correlations.

6. Identify alternatives and making predictions.

7. Develop a thorough understanding of popular classification and prediction techniques as

well as unsupervised data mining techniques and the mathematical theory behind them.

8. Be ability to conduct data extraction, transformation and loading (ETL).

9. Develop their ability to conduct online analytic processing (OLAP)

10. Understand their ability to implement typical data mining techniques.

Course Outcomes:

The student will be able to:

1. Describe and utilise a range of techniques for designing data mining and data warehousing

systems.

2. Appreciate the strengths and limitations of various data mining models.

3. Appreciate the practical implications and limitations of data mining analyses applied to real-

life situations.

4. Demonstrate understanding of neural networks, fuzzy logic, evolutionary computation

(genetic algorithms), intelligent agents and machine learning, and some of the major

applications associated with them.

5. Demonstrate understanding of the functionality of the various web mining and web search

components and appreciate the strengths and limitations of various web mining and web

search models.

6. Be able to use the tools and techniques employed in data mining for different application

domains.

7. Describe different types of research and understand alternative research paradigms.




a.


�



�

d.


�


�

f.


g.





�


�

Date post:	09-Apr-2018
Category:	Documents
Upload:	donguyet
View:	218 times
Download:	4 times

SYLLABUS with PROGRAM EDUCATIONAL OBJECTIVES 4 …becbapatla.ac.in/it/IT Syllabus with...

Documents