JAYPEE UNIVERSITY, ANOOPSHAHR Jaypee University

JAYPEE UNIVERSITY, ANOOPSHAHR

1 | P a g e

Jaypee University, Anoopshahr

B.Tech (CSE &IT )

Course Curriculum

First Semester

I Semester

Sr.

No. Category

Course Contact Hours Credits

Code Name L T P Total

1 HSS 18B11HS111 English 2 0 0 2 2

2 Basic Sc. 18B11PH111 Physics 3 1 0 4 4

3 Basic Sc. 18B11MA111 Mathematics - I 3 1 0 4 4

4 Engg. Sc. 18B11EC111 Basic Electrical Engineering 3 1 0 4 4

5 HSS 18B17HS171 English Language Lab 0 0 2 2 1

6

Basic Sc. 18B17PH171 Physics Lab 0 0 2 2 1

7 Engg. Sc. 18B17EC171 Electrical Engineering Lab 0 0 2 2 1

8 Engg. Sc. 18B17ME171 Engineering Graphics &

Design Lab 0 0 6 6 3

Total 10 3 12 25 20

*3 week Induction Training Programme at the beginning of the Semester

18B11MA111 Mathematics-I L-T-P

3-1-0 4 Credits

Course Objectives:

The objectives are to study


2 | P a g e

1. Various techniques of differential calculus and integral calculus.

2. Fundamentals of Laplace and Fourier transformation and their applications,

3. The concepts of matrices to understand and solve the linear systems.

Course Contents:

Unit 1: Differential Calculus:

Successive Differentiation, Leibnitz’s Theorem, Mean value theorems, Rolle’s Theorem, Taylor’s and

Maclaurin theorems with remainders; indeterminate forms and L'Hospital's rule; Maxima and minima.

Unit 2: Multivariable Calculus (Differentiation):

Limit, continuity and partial derivatives, directional derivatives, total derivative; Tangent plane and

normal line; Maxima, minima and saddle points; Method of Lagrange multipliers; Gradient, curl and

divergence.

Unit 3: Integral Calculus:

Reduction formulae, Beta and Gamma functions and their properties; Applications of definite integrals

to evaluate surface areas and volumes of revolutions.

Unit 4: Transforms

Laplace Transforms, Fourier series and Transforms.

Unit 5: Matrices

Inverse and rank of a matrix, rank-nullity theorem; System of linear equations; Symmetric, skew-

symmetric and orthogonal matrices; Determinants; Eigenvalues and eigenvectors; Diagonalization of

matrices; Cayley-Hamilton Theorem, and Orthogonal transformation.

Course Outcomes: After studying this course the students will avail to gain the fundamental concepts of calculus, Laplace

transform, Fourier transform and matrices that are applicable in engineering.

Teaching Methodology:

The entire content has been distributed in 5 units. The entire syllabi will be completed in approximately

42 lectures along with 12-14 Tutorial classes. Two units will be completed before T-1 examination and

next two units will be completed before T-2 examination and remaining syllabus will be covered before

final examination.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks

Teacher’s Assessment 25 Marks (Attendance: 5 & Continuous Evaluation: 20 Marks)

Total 100 Marks

Suggested Text/Reference Books

1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint,

2002.

2. R. K. Jain and S. R. K. Iyengar: Advanced Engineering Mathematics, Alpha Science Intl Ltd.

3. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010.

4. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th Reprint, 2010.


3 | P a g e

5. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006.

6. Veerarajan T., Engineering Mathematics for first year, Tata McGraw-Hill, New Delhi, 2008.

18B11EC111 Basic Electrical Engineering L-T-P

3-1-0 4 Credits

Course Objectives:

1. To understand and analyze basic electric and magnetic circuits.

2. To study the working principles of electrical machines.

3. To introduce the measuring instruments.

4. To study the basics of semiconductor and basic electronic components.

Course Contents:

Unit 1: DC Circuits (8 Lectures)

Electrical circuit elements (R, L and C), voltage and current sources, Kirchhoff current and voltage

laws, analysis of simple circuits with DC excitation. Superposition, Thevenin and Norton Theorems,

Maximum power transfer theorem.

Unit 2: AC Circuits (6 Lectures)

Representation of sinusoidal waveforms, peak and rms values, phasor representation, real power,

reactive power, apparent power, power factor. Analysis of single-phase ac circuits consisting of R, L,

C, RL, RC, RLC combinations (Series and Parallel), Resonance.

Unit 3: Transformers (6 Lectures)

Magnetic materials, BH characteristics, ideal and practical transformer, equivalent circuit, losses in

transformers, regulation and efficiency. Auto-transformer and three-phase transformer connections.

Unit 4: Electrical Machines (8 Lectures)

Generation of rotating magnetic fields, Construction and working of a three-phase induction motor,

Significance of torque-slip characteristic. Loss components and efficiency, starting and speed control of

induction motor. Single-phase induction motor. Construction, working, torque-speed characteristic and

speed control of separately excited dc motor. Construction and working of synchronous generators.

Unit 5: Measurements and Instrumentation (8 Hours)

PMMC instrument, Galvanometer, DC ammeter, DC voltmeter, Ohmmeter, Meter Sensitivity, Loading

Effect, Multimeter, Digital Meters, Dynamometer Wattmeter, Cathode Ray Oscilloscope (CRO),

Wheatstone bridge, Low resistance measurements, AC bridge theory, Capacitance bridges, Inductance

bridges.

Unit 6: Semiconductor Devices (6 Hours)

Semiconductor Theory, Diode: Operation & Applications, Introduction to transistors and Operation

Amplifier.

Course Outcomes:

At the end of the course completion, students will be:

1. Able to analyze circuits using Kirchhoff’s voltage & current laws and different theorems.

2. Able to use op-amps, diodes, and transistors in circuits,

3. Able to understand the working of motors and generator,

4. Able to compute power dissipation, power factor, and maximum power transfer,

5. Able to use transformers, digital oscilloscopes, meters, and waveform generators in laboratory.


4 | P a g e


The whole content has been distributed in 6 units. The whole syllabi will be completed in about 42

Lecture along with around 12 Tutorial classes. First 2 units will be completed before T-1 Examination,

so that around 15 lectures are covered till T1. Next 2 units will be completed by T-2 Examination, to

make around 13 lectures. The remaining units will be completed before final (T3) Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

Suggested Text/Reference Books:

1. W.H. Hayt, J. E. Kemmerly & S.M. Durbin, “Engineering Circuit Analysis”, McGraw Hill, 2012

2. D. P. Kothari and I. J. Nagrath, “Basic Electrical Engineering”, Tata McGraw Hill, 2010

3. V. D. Toro, “Electrical Engineering Fundamentals”, Prentice Hall India, 1989

4. A. Chakarbarti, “Circuit Theory: Analysis and Synthesis”, Dhanpat Rai & Co.

5. R.C. Dorf & J.A. Svoboda, “Introduction to Electric Circuits”, John Wiley, 2004

18B17HS171 English Language Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. To make students recognize the sounds of English through Audio-Visual aids.

2. To help students build their confidence and help overcome their inhibitions and self-consciousness

while speaking in English. The focus shall be on fluency.

3. To familiarize the students with stress and intonation and enable them to speak English effectively.

Course Contents:

1. Listening Comprehension

Worksheet-1

2. Pronunciation, Intonation, Stress and Rhythm

Worksheet-2

3. Common Everyday Situations: Conversations and Dialogues

Worksheet-3

4. Communication at Workplace

Worksheet-4

5. Interviews

Worksheet-5

6. Formal Presentations

Worksheet-6

Course Outcomes:


5 | P a g e

The Language Lab involves interactive practice sessions and focuses on the Oral Communication i.e,

production and practice of sounds of language and familiarizes the students with the use of English in

everyday situations and contexts

Evaluation Scheme:

Day to Day Evaluation 60 Marks

Mid-Semester Practical Examination (P1) 20 Marks

End-Semester Practical Examination (P2) 20 Marks

Total 100 Marks


1. Cambridge English Pronouncing Dictionary with CD, Cambridge University Press, India, 2012.

2. Exercises in Spoken English. Parts. I-III. CIEFL, Hyderabad. Oxford University Press

3. A Textbook of English Phonetics for Indian Students by T. Balasubramanian, Macmillan Publisher,

1981.

4. Spoken English for You by G Radhakrishna Pallai. Publisher – Emerald Publishers. (Spoken

English)

5. A Course of English Pronunciation J D O’ Connor. Publisher –BBC. (Phonetics)

6. Essential English Grammar with book and audiocassettes by Raymond Murphy. Publisher -

Cambridge University Press.(Basic Grammar any Level)

7. The Rosetta Stone English Library

8. Clarity Pronunciation Power

9. Language in Use, Foundation Books Pvt Ltd with CD.

10. Learning to Speak English - 4 CDs

11. Microsoft Encarta with CD

12. English Pronouncing Dictionary Daniel Jones Current Edition with CD.

13. Spoken English- R. K. Bansal and J. B. Harrison, Orient Longman 2006 Edn.

14. A Practical course in English Pronunciation, (with two Audio cassettes) by J. Sethi, Kamlesh

Sadanand & D.V. Jindal, Prentice-Hall of India Pvt. Ltd., New Delhi.

15. English Skills for Technical Students, WBSCTE with British Council, OL

18B17PH171 Physics Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. To make the students understand the concepts of basic physics using mechanics,

electronic/semiconductor devices experiments.

2. To correlate the theory with the experiments and also introduces the basics of physics and material

science in instruments used in our daily life.

3. To develop understanding of various physical phenomenon which may be used in the subsequent

courses in next semesters of the engineering students.

Course Contents:

List of Experiments:


6 | P a g e

1. To determine the band gap in a semiconductor using a PN junction diode.

2. To determine the Moment of Inertia of a Flywheel.

3. To measure resistivity of semiconductor at different temperatures by Four Probe Method.

4. To study the Motion of a Spring and calculate (a) Spring Constant (b) Value of g, and (c) Modulus

of Rigidity

5. To determine the value of specific charge (e/m) of an electron by Thomson’s method.

6. To determine the value of specific charge (e/m) of an electron by Magnetron method.

7. To investigate the Motion of Coupled Oscillators.

8. Study the magneto resistance of given semiconductor material.

9. Study the Hall Effect in semi-conductor and determination of allied coefficients.

10. To determine the Modulus of Rigidity of a Wire by Maxwell’s needle

11. To determine the resistance per unit length of bridge wire and specific resistance of material of

thegiven wire using Carey Foster’s bridge.

12. To determine the numerical aperture and bending loss of a given multimode optical fibre.

Course Outcomes: 1. Familiarization with various devices such as junction diodes, Hall Effect, Four probe setup, which

are also taught theoretically in class.

2. Understanding of basic mechanics experiments and study of electronic/semiconductor devices.

3. Concept of lasers, basic of optical fibre communications and losses in fibres.

Evaluation Scheme

Attendance + Lab Record 20 marks

Lab Performance (Day to Day evaluation) 40 marks

Mid Semester Lab Exam (P1) 20 marks

End Semester Lab Exam (P2) 20 marks

Total 100 marks


1. Practical Physics: S.K. Gupta

2. Practical Physics: V. Kumar and S.L. Gupta

3. B. L. Worsnop and H. T. Flint, Advanced Practical Physics, Asia Publishing House, New Delhi.

18B17EC171 Electrical Engineering Lab L-T-P

0-0-2 1 Credit

Laboratory Objectives:

1. Get an exposure to common electrical components and their ratings.

2. Make electrical connections by wires of appropriate ratings.

3. Understand the usage of common electrical measuring instruments.

4. Understand the basic characteristics of transformers and electrical machines.

5. Get an exposure to the working of diode and operational amplifier.


1. (a) Familiarization with the DMM and measure various circuit elements.

(b) Familiarization with the CRO, function generator and power supply.


7 | P a g e

2. (a) To study the loading effect of a voltmeter.

(b)To observe & sketch the V-I characteristics of the resistor.

3. To verify the Kirchhoff’s law (KVL and KCL).

4. To verify the Thevenin’s theorem.

5. To verify the Superposition theorem.

6. To verify the Reciprocity theorem

7. To sketch the transient response of RC low pass and high filters.

8. Study and measure ratio & load test of single phase transformer. To plot efficiency vs load and

regulation vs load curve.

9. Study of open circuit and short circuit characteristics of single phase transformer.

10. To study speed control of DC shunt motor by armature resistance and field control and plot curve.

11. Load test of three phase induction motor.

12. To study and Measure unknown impedance by bridges (Wheatstone and Schering Bridge).

13. To observe & sketch of V-I characteristics of p-n junction diode.

14. (a) To realize and study of inverting amplifier using Op-Amp.

(b) To realize and study of non-inverting amplifier using Op-Amp.

Laboratory Outcomes: At the end of this course, students will be able to:

1. Demonstrate different components used in Electrical Engineering.

2. Implement the circuits on the breadboard.

3. Measure the different electrical quantity with the help of Multimeter and CRO.

4. Generate different types of electrical quantity with the help of function generator.

Teaching Methodology: This lab course consists of 14 experiments. At the start of the semester,

students will be demonstrated by the different Electrical components and instruments. First 7

experiments will be completed before P1 examination and remaining will be completed afterwards. All

experiments will be completed till P2 so that all experiments are in syllabus of P2 examination.

Evaluation Scheme:


Mid-Sem Lab Test (P1) 20 Marks

End-Sem Lab Test (P2) 20 Marks

Total 100 Marks

18B17ME171 Engineering Graphics & Design Lab L-T-P

0-0-6 3 Credits

Course Objectives:

The subject in general is designed to impart the following skills.

1. Ability to read & prepare engineering drawings and to make free - hand sketching of objects.

2. Power to imagine, analyse and communicate, and capacity to understand other subjects.

Course Contents:


8 | P a g e

Unit 1: Introduction to Engineering Drawing Principles of Engineering Graphics and their significance, usage of Drawing instruments, lettering,

Conic sections including the Rectangular Hyperbola (General method only); Cycloid, Epicycloid,

Hypocycloid and Involute; Scales – Plain, Diagonal and Vernier Scales;

Unit 2: Orthographic Projections Principles of Orthographic Projections-Conventions - Projections of Points and lines inclined to both

planes; Projections of planes inclined Planes - Auxiliary Planes;

Unit 3: Projections of Regular Solids Solids such as Prism, Cylinder, Pyramid, and Cone inclined to both the Planes- Auxiliary Views; Draw

simple annotation, dimensioning and scale.

Unit 4: Sections and Sectional Views of Right Angular Solids Prism, Cylinder, Pyramid, Cone – Auxiliary Views; Development of surfaces of Right Regular Solids -

Prism, Pyramid, Cylinder and Cone; Draw the sectional orthographic views of geometrical solids.

Unit 5: Isometric Projections covering

Principles of Isometric projection – Isometric Scale, Isometric Views, Conventions; Isometric Views of

lines, Planes, Simple and compound Solids; Conversion of Isometric Views to Orthographic Views and

Vice-versa, Conventions;

Unit 6: Overview of Computer Graphics listing the computer technologies that impact on graphical communication, Demonstrating knowledge

of the theory of CAD software [such as: The Menu System, Toolbars, Drawing, Dialog boxes and

windows, Shortcut menus (Button Bars), The Command Line (where applicable), The Status Bar,

Different methods of zoom as used in CAD, Select and erase objects.; Isometric Views of lines, Planes,

Simple and compound Solids];

Unit 7: Customisation & CAD Drawing

Setting up of units and drawing limits; ISO and ANSI standards for coordinate dimensioning and

tolerancing; Orthographic constraints, Snap to objects manually and automatically; Producing drawings

by using various coordinate input entry methods to draw straight lines, Applying various ways of

drawing circles;

Unit 8: Annotations, layering & other functions Setting up and use of Layers, layers to create drawings, Create, edit and use customized layers;

Changing line lengths through modifying existing lines (extend/lengthen); Printing documents to paper

using the print command; orthographic projection techniques; Drawing sectional views of composite

right regular geometric solids and project the true shape of the sectioned surface; Drawing annotation,

Computer-aided design (CAD) software modelling of parts and assemblies. Parametric and non-

parametric solid, surface, and wireframe models. Part editing and two-dimensional documentation of

models. Planar projection theory, including sketching of perspective, isometric, multiview, auxiliary,

and section views. Spatial visualization exercises. Dimensioning guidelines, tolerancing techniques;

dimensioning and scale multi views of dwelling;

Unit 9: Demonstration of a simple team design project (Optional) Geometry and topology of engineered components: creation of engineering models and their

presentation in standard 2D blueprint form and as 3D wire-frame and shaded solids; meshed topologies

for engineering analysis and tool-path generation for component manufacture; geometric dimensioning

and tolerancing.

Course Outcomes:


9 | P a g e

1. To prepare you to design a system, component, or process to meet desired needs within realistic

constraints such as economic, environmental, social, political, ethical, health and safety,

manufacturability, and sustainability.

2. To prepare you to communicate effectively.

3. To prepare you to use the techniques, skills, and modern engineering tools necessary for

engineering practice.

Evaluation Scheme:




Total 100 Marks


1. N. D. Bhatt “Engineering Drawing”, Charotar Publishing House, Edition, 2012.

2. K. L. Narayana “Engineering Drawing”, Scitech Publication, Edition, 2011.

3. Basant Agrawal & C. M. Agrawal “Engineering Drawing”, TMH Publication, Edition, 2008 &

2013.

4. Shah, M.B. & Rana B.C. (2008), Engineering Drawing and Computer Graphics, Pearson Education.

5. Agrawal B. & Agrawal C. M. (2012), Engineering Graphics, TMH Publication.

6. (Corresponding set of) CAD Software Theory and User Manuals


10 | P a g e


B.Tech. (CSE & IT)

Course Curriculum

Second Semester

II Semester (B2)

Category Course Contact Hours

Credits Code Name L T P Total

HSS 18B11HS211 Organizational Behaviour 3 0 0 3 3

Basic Sc. 18B11CH211 Engineering Chemistry 3 1 0 4 4

Basic Sc. 18B11MA211 Mathematics - II 3 1 0 4 4

Engg. Sc. 18B11CI211 Programming for Problem Solving 3 0 0 3 3

Engg. Sc. 18B11ME211 Engineering Mechanics 3 1 0 4 4

Engg. Sc. 18B17ME271 Workshop Practices Lab 0 0 6 6 3

Basic Sc. 18B17CH271 Engineering Chemistry Lab 0 0 2 2 1

Engg. Sc. 18B17CI271 Computer Programming Lab 0 0 4 4 2

Mandatory 18B19GE291 Environmental Sciences 2 0 0 2 0

Total 17 3 12 32 24

#1 hour Lecture and 4 hours of Lab

18B11HS211 Organizational Behaviour L-T-P

3-0-0 3 Credits

Course Objectives:


11 | P a g e

The major objective of this course is to provide students with a better understanding of behavioural

processes as well as to provide a basic knowledge of main ideas, key theories relating to

organizational behaviour and thereby enable them to function more effectively in their present or

future roles as managers.

Course Contents:

Unit 1: Fundamentals of Organizational Behaviour

Understanding Organizational Behaviour - Fundamental Concepts, Organizational processes,

Organizational structure, Organizational Change and Innovation processes.

Effectiveness in organizations - Models of Organizational Behaviour, Systems theory and time

dimension of effectiveness, Developing competencies, Limitations of Organizational Behaviour,

Continuing challenges.

Social systems and organizational culture - Understanding a Social System, Social Culture, Role,

Status, Organizational culture, Influencing culture change, Sustaining the culture, Characteristics of

effective socialization.

Unit 2: Understanding and Managing Individual Behaviour

Individual differences and work behaviour - Why individual differences are important, the basis for

understanding Work Behaviour, Individual differences influencing Work Behaviour. Personality -

Sources of personality differences, Personality structure, Personality and Behaviour, Measuring

Personality. Attitudes - The nature of Employee Attitudes, Effects of Employee Attitudes, Studying

Job satisfaction, Changing Employee Attitudes. Perceptions, Attributions and Emotions - The

perceptual process, Perceptual grouping, Impression management, Emotions, Emotional Intelligence.

Motivation - Concept of Motivation, Content approaches, Process approaches, Motivation and

psychological contract. Job Design, Work and Motivation - Job design and quality of work life, A

conceptual model of job design, Job performance outcomes, Job analysis, Job designs: the result of

job analysis, The way people perceive their jobs, Designing Job range: Job rotation and job

Enlargement, Designing Job depth: Job enrichment, Total quality management and job design.

Evaluation, Feedback and Rewards - Evaluation of Performance, Performance Evaluation feedback,

Reinforcement theory A model of Individual rewards, Rewards Affect Organizational concerns,

Innovative reward system. Managing misbehaviour - The emergence in Management of the study of

misbehaviour, selected misbehaviours. Stress and Counselling - What is stress?, Stress model, Work

stressors, Stress outcomes, Stress moderators, Stress prevention and management, Employee

counselling, Types of counselling.

Unit 3: Group Behaviour and Interpersonal Influence

Informal and Formal Groups - Group Dynamics, The nature of informal, Organizations, Formal

groups. Teams and Team Building - Organizational context for teams, Teamwork, Team building.

Managing Conflict and Negotiation - Conflict in Organizations, A contemporary perspective on

intergroup conflict, what causes intergroup conflict, the causes of dysfunctional intergroup conflict,

managing intergroup conflict through Resolution, Stimulating Constructive intergroup conflict,

Negotiations, Negotiation tactics, increasing negotiation effectiveness? Power and Politics - The


12 | P a g e

concept of power, Sources of power, Interdepartmental power, Illusion of power, Political strategies

and tactics, Ethics, power and politics, Using power to manage effectively. Empowerment and

Participation - The nature of empowerment and participation, How participation works, Programs for

participation, Important considerations in participation. Assertive Behaviour - Interpersonal

Orientations, Facilitating smooth relations, Stroking.

Unit 4: Organizational Processes

Communication - The importance of communication, The communication process, Communicating

within organizations, Information richness, How technology affects communication, Interpersonal

communication, Multicultural communication, Barriers to effective communication, Improving

Communication in organizations, Promoting ethical communications. Decision Making - Types of

decisions, A Rational Decision-making Process, Alternatives to Rational Decision making,

Behavioural influences on decision making, Group decision making, Creativity on group decision

making. Leadership - What is leadership, Trait approaches, Behavioural approaches, Situational

approaches, Other perspectives, concepts and issues of leadership, Multicultural leadership,

Emerging approaches to leadership.

Unit 5: Organizational Design, Change and Innovation

Organizational Structure and Design - Designing an organizational structure, Division of labour,

Delegation of authority, Departmental biases, Span of control, Dimensions of structure,

Organizational design models, Multinational Structure and Design, Virtual Organizations. Managing

Change and Innovation - Change at work, Resistance to change, Alternative change management

approaches, Learning principles in change management, Change agents : forms of interventions, A

model for managing organizational change, Diagnosis of a problem, Selection of appropriate

methods, Impediments and limiting conditions, Implementing change successfully, Understanding

Organizational development.

Unit 6: Emerging Aspects of Organizational Behaviour

Organizational behaviour across cultures - Conditions affecting multinational operations, Managing

International Workforce, Productivity and cultural contingencies, Cross cultural communication.

Course outcomes:

After taking this course, the students will be able to answer the following questions:

1. Why do people behave as they do at work?

2. What can managers do to motivate employees toward greater productivity?

3. What responsibility do managers have for ensuring employee satisfaction?

4. What can be learned from theory and research to become effective future managers?

5. How can individuals, groups and whole organizations work together more effectively within the

increasing pace of corporate change, dramatic restructuring and downsizing and advanced

global competition?

Teaching Methodology: The syllabus will be completed in about 42 Lectures including power

point presentations. 2 units will be completed before T-1 Examination and the next 2 unit will be

completed by T-2 Examination. The remaining 2 unit will be completed between T-2 and the final

Examinations.


13 | P a g e

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1 Stephen P. Robins, Organisational Behavior, PHI Learning / Pearson Education, 11th edition,

2008.

2 Fred Luthans, Organisational Behavior, McGraw Hill, 11th Edition, 2001.

3 Schermerhorn, Hunt, and Osborn, Organisational Behavior, John Wiley, 9th Edition, 2008.

4 Udai Pareek, Understanding Organisational Behaviour, 2nd Edition, Oxford Higher Education,

2004.

5 Mc Shane & Von Glinov, Organisational Behaviour, 4th Edition, Tata Mc Graw Hill, 2007.

6 Hellrigal, Slocum and Woodman, Organisational Behavior, Cengage Learning, 11th Edition

2007.

7 Ivancevich, Konopaske & Maheson, Oranisational Behaviour & Management, 7th edition, Tata

McGraw Hill, 2008.

18B11CH211 Engineering Chemistry L-T-P

3-1-0 4 Credits

Course Objectives:

Concepts of quantum chemistry, bonding, stereochemistry, and those of Synthesis methodologies

and reactivity of organic compounds.

Course Contents:

Unit-1 Atomic and molecular structure (12 lectures)

Schrodinger equation. Particle in a box solutions and their applications for conjugated molecules

and nanoparticles. Forms of the hydrogen atom wave functions and the plots of these functions to

explore their spatial variations. Molecular orbitals of diatomic molecules and plots of the

multicentre orbitals. Equations for atomic and molecular orbitals. Energy level diagrams of

diatomic. Pi-molecular orbitals of butadiene and benzene and aromaticity. Crystal field theory and

the energy level diagrams for transition metal ions and their magnetic properties. Band structure of

solids and the role of doping on band structures.

Unit-2 Spectroscopic techniques and applications (8 lectures)

Principles of spectroscopy and selection rules. Electronic spectroscopy. Fluorescence and its

applications in medicine. Vibrational and rotational spectroscopy of diatomic molecules.

Applications. Nuclear magnetic resonance and magnetic resonance imaging, surface

characterisation techniques. Diffraction and scattering.

Unit-3 Intermolecular forces and potential energy surfaces (4 lectures)

Ionic, dipolar and van Der Waals interactions. Equations of state of real gases and critical

phenomena. Potential energy surfaces of H3, H2F and HCN and trajectories on these surfaces.

Unit-4 Use of free energy in chemical Equilibria (6 lectures)


14 | P a g e

Thermodynamic functions: energy, entropy and free energy. Estimations of entropy and free

energies. Free energy and emf. Cell potentials, the Nernst equation and applications. Acid base,

oxidation reduction and solubility equilibria. Water chemistry. Corrosion. Use of free energy

considerations in metallurgy through Ellingham diagrams.

Unit-5 Periodic properties (4 Lectures)

Effective nuclear charge, penetration of orbitals, variations of s, p, d and f orbital energies of atoms

in the periodic table, electronic configurations, atomic and ionic sizes, ionization energies, electron

affinity and electronegativity, polarizability, oxidation states, coordination numbers and geometries,

hard soft acids and bases, molecular geometries

Unit-6 Stereochemistry (4 lectures)

Representations of 3 dimensional structures, structural isomers and stereoisomers, configurations

and symmetry and chirality, enantiomers, diastereomers, optical activity, absolute configurations

and conformational analysis. Isomerism in transitional metal compounds

Unit-7 Organic reactions and synthesis of a drug molecule (4 lectures)

Introduction to reactions involving substitution, addition, elimination, oxidation, reduction,

cyclization and ring openings. Synthesis of a commonly used drug molecule.

Course Outcomes:

1. Students will be able to know the concept of Chemistry.

2. To understand Chemical Processes which are involved in Industrial uses like Heat transfer

during the execution of electronic instruments, Power stations, Paint industries, Disaster

Management, Decomposition of Biomedical Waste and our daily life activities.


The Whole content has been distributed in 7 units. The whole syllabi will be completed in about 42

Lecture along with 12-14 Tutorial classes and few descriptive 2 hours lecture including power point

presentations. 3 units will be completed before T-1 Examination and next 2 unit will be compiled

by T-2 Examination and rest syllabus will be completed later before final Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

Suggested Text/Reference Books

1. University chemistry, by B. H. Mahan

2. Chemistry: Principles and Applications, by M. J. Sienko and R. A. Plane

3. Fundamentals of Molecular Spectroscopy, by C. N. Banwell

4. Engineering Chemistry (NPTEL Web-book), by B. L. Tembe, Kamaluddin and M. S. Krishnan

5. Physical Chemistry, by P. W. Atkins

6. Organic Chemistry: Structure and Function by K. P. C. Volhardt and N. E. Schore, 5th Edition

7. Concise Inorganic Chemistry by J.D.Lee


15 | P a g e

18B11MA211 Mathematics-II L-T-P

3-1-0 4 Credits

Course Objectives:

The objectives are to study

1. The various methods of solving the second order differential equations with variable

coefficients, to study the basic properties of Bessel Functions, Legender polynomials, and

their Applications.

2. To obtain the solutions of one dimensional wave equation, heat conduction equation and

Laplace equation.

3. To study calculus of complex variables.

Unit 1: Sequences and series

Convergence of sequence and series, tests for convergence: Comparison test, Ratio test, Integral

test, Raabe’s test, Cauchy nth root test, Logarithmic test. Alternating Series, Conditional &

Absolute Convergence, Uniform Convergence.

Unit 2: Ordinary differential equations of higher orders:

Second order linear differential equations with variable coefficients, method of variation of

parameters, Cauchy-Euler equation; Power series solutions; Legendre polynomials, Bessel

functions of the first kind and their properties.

Unit 3: (Partial Differential Equation)

Basic Concepts, Classification of Second order partial differential equations. Solution of PDEs:

Method of separation of variable. One dimensional wave equation, heat conduction equation and

Laplace equation.

Unit 4: Function of a Complex Variable – Differentiation:

Differentiation, Cauchy-Riemann equations, analytic functions, harmonic functions, finding

harmonic conjugate; elementary analytic functions (exponential, trigonometric, logarithm) and their

properties; Conformal mappings, Mobius transformations and their properties.

Unit 5: Complex Variable – Integration:

Contour integrals, Cauchy-Goursat theorem (without proof), Cauchy Integral formula (without

proof), Liouville’s theorem and Maximum-Modulus theorem (without proof); Taylor’s series, zeros

of analytic functions, singularities, Laurent’s series; Residues, Cauchy Residue theorem (without

proof), Evaluation of definite integral involving sine and cosine, Evaluation of certain improper

integrals.

Course Outcomes:

1. Students will gain enough knowledge to solve the boundary value problems and their

applications.

2. Students will also gain the sufficient knowledge to solve complex variable problems and to find

the solution of improper integral.


16 | P a g e


The entire content has been distributed in 5 units. The entire syllabi will be completed in

approximately 42 lectures along with 12-14 Tutorial classes. Two units will be completed before

T-1 examination and next two units will be completed before T-2 examination and remaining

syllabus will be covered before final examination.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. R. K. Jain and S. R. K. Iyengar: Advanced Engineering Mathematics, Alpha Science Intl Ltd.

2. Kreyszig, Erwin: Advanced Engineering Mathematics, John Wiley & Sons, Inc.

3. Simmons, G.F.: Differential Equations with Applications, 2nd Ed., McGrawHill,

4. Brown, J.W., Churchill, R.V.: Complex Variables and Applications, 6th Ed., McGrawHill,

1996.

5. Spiegel, Murray R.: Theory and Problems of Complex variables Schaum’s series

6. Sneddon I. N. :Introduction to Partial Differential Equations

18B11ME211 Engineering Mechanics L-T-P

3-1-0 4 Credits

Course Objectives:

1. To provides a frame work for most of the branches of engineering.

2. To develop understanding the working of Electrical/Robotic devices.

Course Contents:

Unit 1 (Two Dimensional Concurrent Force Systems)

Basic concepts, Law of mechanics, Concept of rigid body, Introduction of Vectors and Vector

operations, Principle of Transmissibility of forces, Force System, Resultant of a Concurrent force

system. Equilibrium and Equations of Equilibrium, Free body diagrams, Determination of reaction,

Lami’s theorem, Applications of concurrent forces.

Unit 2 (Two Dimensional Non-Concurrent Force Systems & Beams)

Moment of a force, Varigonon’s theorem, Couple. Transfer of a force to parallel position, Distributed

force system, Resultant of a Concurrent force system. Types of supports and loading condition of

Beams. Shear Force Diagram, Bending Moment Diagram of Beams.

Unit 3 (Structures & Friction)

Structure: Plane truss, Perfect and imperfect truss, Assumption in the truss analysis, Analysis of

perfect plane trusses by the method of joints, Method of section.


17 | P a g e

Friction: Introduction, Laws of Coulomb Friction, Equilibrium of Bodies involving Dry-friction,

Ladder friction, wedge, Belt friction.

Unit 4 (Centroid and Moment of Inertia)

Centroid of plane, curve, area and composite bodies, Moment of inertia of plane area, Parallel Axes

Theorem, Perpendicular axes theorems. Mass moment of inertia of Circular ring, Disc, Sphere, and

Cone about their axis of symmetry, Polar moment of inertia

Unit 5 (Kinematics & Kinetics of Rigid Body)

Introduction, Plane rectilinear motion of rigid body, Plane curvilinear Motion of Rigid Body,

Velocity and Acceleration under Translation and Rotational Motion.

Introduction, Force, Mass and Acceleration, D’Alembert’s Principles and Dynamic Equilibrium,

Work and Energy, Impulse and Momentum.

Unit 6 (Virtual Work and Energy Method)

Virtual displacements, principle of virtual work for particle and ideal system of rigid bodies, degrees

of freedom. Active force diagram, systems with friction, mechanical efficiency. Conservative forces

and potential energy (elastic and gravitational), energy equation for equilibrium. Applications of

energy method for equilibrium. Stability of equilibrium.

Course Outcomes:

Student should be able to:

1. Use scalar and vector analytical techniques for analysing forces in statically determinate

structures;

2. Apply fundamental concepts of kinematics and kinetics of particles to the analysis of simple,

practical problems;

3. Apply basic knowledge of maths and physics to solve real-world problems;

4. Understand measurement error, and propagation of error in processed data;

5. Understand basic kinematics concepts – displacement, velocity and acceleration (and their

angular counterparts);

6. Understand basic dynamics concepts – force, momentum, work and energy;

7. Understand and be able to apply Newton’s laws of motion;

8. Understand and be able to apply other basic dynamics concepts - the Work-Energy principle,

Impulse-Momentum principle and the coefficient of restitution;

9. Extend all of concepts of linear kinetics to systems in general plane motion (applying Euler's

Equation and considering energy of a system in general plane motion, and the work of couples

and moments of forces);

10. Learn to solve dynamics problems. Appraise given information and determine which concepts

apply, and choose an appropriate solution strategy.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. S. S. Bhavikatti “Engineering Mechanics”, New Age International Publishers, Second Edition,


18 | P a g e

July 1998.

2. A. Nelson “Engineering Mechanics: Statics and Dynamics”, The McGraw-Hill Companies, 4th

Reprint, 2012

3. A.K Tayal "Engineering Mechanics: Statics and Dynamics", Umesh Publication, 11th Edition,

2000

4. Irving H. Shames, G. Krishna Mohan Rao, Engineering Mechanics Statics and Dynamics,

Pearson Education, 4th Edition.

5. Irving H. Shames (2006), Engineering Mechanics, 4th Edition, Prentice Hall

6. F. P. Beer and E. R. Johnston (2011), Vector Mechanics for Engineers, Vol I - Statics, Vol II, –

Dynamics, 9th Ed, Tata McGraw Hill

7. R. C. Hibbler (2006), Engineering Mechanics: Principles of Statics and Dynamics, Pearson

Press.

18B11CI211

Programming for Problem Solving

L-T-P

3-0-0

3 Credits

Course Objective:

1. To formulate simple algorithms for arithmetic and logical problems.

2. To translate the algorithms to programs (in C language).

3. To test and execute the programs and correct syntax and logical errors.

4. To implement conditional branching, iteration and recursion.

Course contents:

Unit 1: Introduction to Programming (10 Lectures)

Introduction to components of a computer system (disks, memory, processor, where a program is

stored and executed, operating system, compilers etc.) .Idea of Algorithm: steps to solve logical and

numerical problems. Representation of Algorithm: Flowchart/Pseudocode with examples. From

algorithms to programs; source code, variables (with data types) variables and memory locations,

Syntax and Logical Errors in compilation, object and executable code.

Unit 2: Arithmetic Expression (8 Lectures)

Arithmetic expressions and precedence, Conditional Branching and Loops Writing and evaluation of

conditionals and consequent branching Iteration and loops Arrays (1-D, 2-D), Character arrays and

Strings

Unit 3: Algorithm (8 Lectures)

Basic Algorithms, Searching, Basic Sorting Algorithms (Bubble, Insertion and Selection), Finding

roots of equations, notion of order of complexity through example programs (no formal definition

required)

Unit 4: Function (8 Lectures)

Functions (including using built in libraries), Parameter passing in functions, call by value, passing

arrays to functions: idea of call by reference Recursion, as a different way of solving problems.


19 | P a g e

Example programs, such as Finding Factorial, Fibonacci series, Ackerman function etc. Quick sort

or Merge sort.

Unit 5: Structure (8 Lectures)

Structure Structures, Defining structures and Array of Structures Pointers, Idea of pointers, Defining

pointers, Use of Pointers in self-referential structures, notion of linked list (no implementation) File

handling (only if time is available, otherwise should be done as part of the lab)

Course Outcomes:

At the end of the course completion, students will be:

1. Decompose a problem into functions and synthesize a complete program using divide and

conquer approach.

2. Use arrays, pointers and structures to formulate algorithms and programs.

3. Apply programming to solve matrix addition and multiplication problems and searching and

sorting problems.

4. Apply programming to solve simple numerical method problems, namely rot finding of function,

differentiation of function and simple integration.


The syllabus will be completed in about 42 Lectures and a few illustrative 2 hour lectures including

power point presentations. 2 units will be completed before T-1 Examination and the next 2 unit will

be completed by T-2 Examination. The remaining 1 unit will be completed between T-2 and the final

Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

Suggested Text/ Reference Books:

1. Byron Gottfried, Schaum's Outline of Programming with C, McGraw-Hill

2. E. Balaguruswamy, Programming in ANSI C, Tata McGraw-Hill

3. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice Hall of

India

18B17ME271

Workshop Practices Lab

L-T-P

0-0-6

3 Credits

Course Objectives:

Workshop Practice provides a frame work for most of the branches of Engineering to understand

the basic manufacturing processes. Most of the manufacturing in the areas such as Mechanical and


20 | P a g e

Civil are based upon the Workshop Practice. Workshop Practice is first phase of any manufacturing

industry.

A. Workshop Practices

Course Contents:

1. Manufacturing Methods- casting, forming, machining, joining, advanced manufacturing methods

(3 lectures)

2. CNC machining, Additive manufacturing (1 lecture)

3. Fitting operations & power tools (1 lecture)

4. Electrical &Electronics (1 lecture)

5. Carpentry (1 lecture)

6. Plastic moulding, glass cutting (1 lecture)

7. Metal casting (1 lecture)

8. Welding (arc welding & gas welding), brazing (1 lecture)

B. Workshop Practice

Course Content:

1. Machine shop (10 hours)

2. Fitting shop (8 hours)

3. Carpentry shop (6 hours)

4. Electrical & Electronics shop (8 hours)

5. Welding shop (8 hours)

6. Casting (8 hours)

7. Smithy shop (6 hours)

8. Plastic moulding& Glass Cutting (6 hours)

Laboratory Outcomes:

1. Upon completion of this laboratory course, students will be able to fabricate components with

their own hands.

2. They will also get practical knowledge of the dimensional accuracies and dimensional

tolerances possible with different manufacturing processes.

3. By assembling different components, they will be able to produce small devices of their

interest.

Evaluation Scheme:

P1 20 marks

P2 20 marks

Internal Assessment 60 marks (Attendance - 15, Lab Performance – 30, Viva - 15)


1. Hajra Chaudhary “Element of Workshop Technology” (Vol. 1), Media Promotors and

Publication, Edition, 2012.

2. Hajra Chaudhary “Workshop Technology” (Vol. 2), Media Promotors and Publication, Edition,

2012.


21 | P a g e

3. R. S. Khurmi “A Text Book of Workshop and Manufacturing Processes”, S. Chand Publication,

Edition, 2011.

4. R. K. Singal “Workshop Manual”, S. K. Kataria & Sons Publication, Edition, 2008.

5. Kalpakjian S. And Steven S. Schmid, “Manufacturing Engineering and Technology”, 4th

edition, Pearson Education India Edition, 2002.

6. Rao P.N., “Manufacturing Technology”, Vol. I and Vol. II, Tata McGrawHill House, 2017.

18B17CH271 Engineering Chemistry Lab L-T-P

0-0-2 1 credit

Course Objectives:

Concepts of quantum chemistry, bonding, stereochemistry, and those of Synthesis methodologies

and reactivity of organic compounds.


1. Determination of surface tension and viscosity

2. Thin layer chromatography

3. Determination of Constituents and Alkalinity of the given Sample.

4. Ion exchange column for removal of hardness of water

5. Colligative properties using freezing point depression

6. Determination of cell constant and conductance of solutions

7. Synthesis of a polymer/drug

8. Saponification/acid value of an oil

9. Chemical analysis of a salt

10. Determination of the partition coefficient of a substance between two immiscible liquids

11. Adsorption of acetic acid by charcoal

12. Use of the capillary viscometers to demonstrate of the isoelectric point as the pH of minimum

viscosity for gelatine sols and/or coagulation of the white part of egg.


The chemistry laboratory course will consist of experiments illustrating the principles of chemistry

relevant to the study of science and engineering. Measure molecular/system properties such as

surface tension, viscosity, Conductance of solutions. Students will be able to understand the

concept of daily using substances practically say. Hardness, Alkalinity, pH etc.

Evaluation Scheme:




Total 100 Marks


1. Experimental Chemistry by Jain & Jain

2. Inorganic quantitative analysis, by Vogel.

3. Quantitative Analysis by D. Day & Underwood


22 | P a g e

18B17CI271 Computer Programming Lab L-T-P

0-0-4 2 Credits

Laboratory Objective:

1. To formulate the algorithms for simple problems

2. To translate given algorithms to a working and correct program

3. To be able to correct syntax errors as reported by the compilers

4. To be able to identify and correct logical errors encountered at run time


1. Familiarization with programming environment

2. Simple computational problems using arithmetic expressions

3. Problems involving if-then-else structures

4. Iterative problems e.g., sum of series

5. 1D Array manipulation

6. Matrix problems, String operations

7. Simple functions

8. Programming for solving Numerical methods problems

9. Recursive functions

10. Pointers and structures

11. File operations


At the end of this course, students will be able to:

1. Write iterative as well as recursive programs

2. Represent data in arrays, strings and structures and manipulate them through a program

3. Declare pointers of different types and use them in defining self-referential structures.

4. Create, read and write to and from simple text files.


This lab course consists of 14 experiments. At the start of the semester, students will be

demonstrated by the different Electrical components and instruments. First 7 experiments will be

completed before P1 examination and remaining will be completed afterwards. All experiments

will be completed till P2 so that all experiments are in syllabus of P2 examination.

Evaluation Scheme:




Total 100 Marks


23 | P a g e

18B19GE291 Environmental Sciences L-T-P

2-0-0 0 Credit

Course Objectives:

To give students an understanding of how science and the scientific methods work to address

environmental problems. The student will become familiar with the Earth’s major systems

(ecosystems and biogeochemical cycles), how they function and how they are affected by human

activity (population growth, air, water and soil pollution, ozone depletion, global warming, and solid

waste disposal). Students will learn about the interaction of human society (urban sprawl, energy

use/generation, resource consumption and economics) with the Earth’s systems.

Course Contents:

Unit 1: Introduction to environmental studies and Ecosystems Multidisciplinary nature of environmental studies; Scope and importance; Concept of sustainability

and sustainable development. Ecosystem; Structure and function of ecosystem; Energy flow in an

ecosystem: food chains, food webs and ecological succession. Case studies of the following

ecosystems: a) Forest ecosystem, b) Grassland ecosystem, c) Desert ecosystem, d) Aquatic

ecosystems (ponds, streams, lakes, rivers, oceans, estuaries)

Unit 2: Natural Resources: Renewable and Non-renewable Resources Land resources and land use change; Land degradation, soil erosion and desertification.

Deforestation: Causes and impacts due to mining, dam building on environment, forests, biodiversity

and tribal populations. Water: Use and over-exploitation of surface and ground water, floods,

droughts, conflicts over water (international & inter-state). Energy resources: Renewable and non-

renewable energy sources, use of alternate energy sources, growing energy needs, case studies.

Unit 3: Biodiversity and Conservation Levels of biological diversity: genetic, species and ecosystem diversity; Biogeographic zones of

India; Biodiversity patterns and global biodiversity hot spots. India as a mega-biodiversity nation;

Endangered and endemic species of India. Threats to biodiversity: Habitat loss, poaching of wildlife,

man-wildlife conflicts, biological invasions; Conservation of biodiversity: In-situ and Ex-situ

conservation of biodiversity. Ecosystem and biodiversity services: Ecological, economic, social,

ethical, aesthetic and Informational value.

Unit 4: Environmental Pollution Environmental pollution: types, causes, effects and controls; Air, water, soil and noise pollution;

nuclear hazards and human health risks; Solid waste management: Control measures of urban and

industrial waste; Pollution case studies.

Unit 5: Human Communities and the Environment

Human population growth: Impacts on environment, human health and welfare; Resettlement and

rehabilitation of project affected persons; case studies; Disaster management: floods, earthquake,

cyclones and landslides; Environmental movements: Chipko, Silent valley; Bishnois of Rajasthan;

Environmental ethics: Role of Indian and other religions and cultures in environmental conservation;

Environmental communication and public awareness, case studies (e.g., CNG vehicles in Delhi).

Unit 6: Field work

Visit to an area to document environmental assets: river/ forest/ flora/fauna, etc.;Visit to a local

polluted site-Urban/Rural/Industrial/Agricultural; Study of common plants, insects, birds and basic

principles of identification.

Course Outcome:


24 | P a g e

In the end of this course students will learn concepts and methods from ecological and physical

sciences and their application in environmental problem solving. Students will apply systems

concepts and methodologies to analyse and understand interactions between social and environmental

processes.


First 2 units will be covered before T1 exam. 3rd and 4th units will be covered between T1 and T2.

Remaining course will be covered upto T3 exam.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1 Environmental Science by Anubha Kaushik, C P Kaushik.

2 Non-conventional energy sources - G.D Rai - Khanna Publishers, New Delhi.

3 McNeill, John R. 2000. Something New Under the Sun: An Environmental History of the

Twentieth Century.

4 Pepper, I.L., Gerba, C.P. & Brusseau, M.L. 2011. Environmental and Pollution Science.

Academic Press.

5 Rao, M.N. & Datta, A.K. 1987. Waste Water Treatment. Oxford and IBH Publishing Co. Pvt.

Ltd.

6 Perspectives in Environmental Studies by Anubha Kaushik,C.P. Kaushik.


25 | P a g e


B.Tech. (CSE& IT)

Course Curriculum

Third Semester

III Semester (B3)

Sr.

No

.

Category Course Contact Hours


1 HSS 18B11HS311 Finance & Accounting 3 0 0 3 3

2 Basic Sc. 18B11MA31

1 Mathematics - III 3 1 0 4

4

3 Basic Sc. 18B11CH311 Biology for Engineers 3 0 0 3 3

4 Engg. Sc. 18B11EC311 Electronic Devices and Circuits 2 1 0 3 3

5 Core 18B11CI312 Computer Organization and

Architecture 3 1 0 4 4

6 Core 18B11CI311 Data Structure & Algorithms 3 1 0 4 4

7 Engg. Sc. 18B17EC371 Devices & Circuits Lab 0 0 2 2 1

8 Core 18B17CI371 Data Structure & Algorithms

Lab 0 0 2 2

1

9 Core 18B17CI372 Web Technology lab 0 0 2 2 1

10 Mandatory 18B19GE391 Indian Constitution 1 0 0 1 0

Total 18 4 6 28 24


26 | P a g e

18B11HS311 Finance & Accounting L-T-P

3- 0- 0 3 Credits

Course Objectives:

In today’s dynamic world engineers while taking decisions in the technical areas have to understand

the financial implications of such decisions. In order to deal effectively with financial issues they

need to understand, analyze and interpret financial data. This course will help them in

understanding the concepts and principles of accounting and finance with the support of software

packages so that they can make quick informed financial decisions.

Course Contents:

Unit 1: Time value of Money, Compounding, Discounting, Annuity, Perpetuity, Loan Amortization

Unit2: Introduction and Financial statements, Definition and Objectives of Financial management, Basic

financial concepts, Understanding of Balance Sheet and Income Statements

Unit 3:

Analysis of Financial Statements (Ratio Analysis), Common size statements, Ratio Analysis,

Interpretation, Importance and limitations

Unit4:

Capital Budgeting: Principle Techniques Nature of Capital Budgeting, Evaluation Techniques:

Discounting (NPV, IRR etc.) and Non-discounting Techniques (payback, ARR etc)

Unit5:

Cash Flows for Capital Budgeting, Identification and determination of relevant cash flows

Unit6: Long Term Sources of Finance, Definition, various sources of finance, advantages and

disadvantages 4

Unit7: Concept and measurement of cost of capital Definition, measurement of specific costs,

computation of Overall Cost of Capital,

Unit8:

Leverages and Capital structure decision Break Even Analysis, Operating, Financial and

combined leverage, Capital structure EBIT- EPS analysis

Unit9: Working Capital Management Working capital-Concept and Practical Considerations

Course Outcomes:

At the end of this course students will be able to understand:

1. The basic accounting principles.

2. They will be able to measure the financial performance of an organization and evaluate the

impact of business decisions at all levels.

3. Analyze financial statements using standard financial ratios of liquidity, activity, debt,

profitability, and market value.

4. Apply techniques to project financial statements for forecasting long-term financial needs.


27 | P a g e

5. Explain the role of short-term financial management, and the key strategies and techniques used

to manage cash, marketable securities, accounts receivable and inventory.

6. Identify the major sources of short-term financing available to the firm.

7. Apply future value and present value concepts to single sums, mixed streams, and annuities.

8. Apply time value, risk, and return concepts. Apply valuation techniques to bonds.

9. Apply time value, risk, and return concepts to constant and variable growth models.

10. Identify relevant cash flows for capital budgeting projects and apply various methods to analyze

projects.

11. Apply techniques for estimating the cost of each component of the cost of capital and

understand how to assemble this information into a cost of capital.

12. Explain the concept of leverage and the benefits and costs associated with debt financing.

13. Identify the various long-term sources of funds for a firm.


The syllabus will be completed in about 42 Lectures including power point presentations. 3 units

will be completed before T-1 Examination and the next 3 unit will be completed by T-2

Examination. The remaining 3 unit will be completed between T-2 and the final Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. M.Y. Khan, and P.K. Jain, Financial Management: Text, Problems and Cases, 5th ed, Tata

McGraw Hill, 2007.

2. Prasanna Chandra, Financial Management Theory and Practice, 6th ed., Tata McGraw Hill,

2004.

3. I.M. Pandey, Financial management, 9th ed, Vikas Publishing House Pvt Ltd, 2006

4. J.C. Van Horne and J.M. Wachowicz Jr., Fundamentals of Financial Management, 11th ed,

Pearson Education, 2001.

5. R.M. Kishore, Financial Management, 6th ed, Taxmann, 2007

18B11MA311 Mathematics-III L-T-P

3-1-0 4 Credits

Course Objectives:

1. To provide mathematical background and sufficient expertise, so that the student can

understand the sentences in the language of probability theory, as well as solve probabilistic

problems in engineering applications.

2. To study the random variables and probability distributions.

3. To introduce the concept of curve fitting and test the hypothesis for the large and small samples.


28 | P a g e

Course Contents:

Unit 1: Basic Probability:

Probability: Three basic approaches to probability, Conditional probability, total probability

theorem, Bayes theorem.

Unit 2: Random variables:

One dimensional random variables (discrete and continuous), distribution of a random variable

(density function and cdf). MGF and Characteristic function of a random variable and its utility.

Bivariate random variable, joint, marginal and conditional distributions, covariance and correlation,

Chebyshev's Inequality.

Unit 3: Probability Distributions:

Bernoulli, binomial, Poisson, negative binomial, geometric distributions. Uniform, exponential,

normal, gamma, Earlang, and Weibull distributions.

Unit 4: Applied Statistics:

Curve fitting by the method of least squares- fitting of straight lines, second degree parabolas and

more general curves. Test of significance: Large sample test for single proportion, difference of

proportions, single mean, difference of means, and difference of standard deviations.

Unit 5: Small sample test:

Test for single mean, difference of means and correlation coefficients, test for ratio of variances -

Chi-square test for goodness of fit and independence of attributes.

Course Outcomes: After studying this course the students would gain enough knowledge and understanding to solve

the problems related to probability and probability distribution. Also, students will avail to gain

enough knowledge to solve the applied statistics and curve fitting problems.


The entire content has been distributed in 5 units. The entire syllabi will be completed in

approximately 42 lectures along with 12-14 Tutorial classes. Two units will be completed before

T-1 examination and next two units will be completed before T-2 examination and remaining

syllabus will be covered before final examination.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks



29 | P a g e

1. Miller & Freund’s , “ Probability and Statistics for Engineers”, PHI, Eighth edition.

2. T. Veerarajan: ``Probability, statistics and random processes”, Tata McGraw-Hill, 2008.

3. Oliver C. Ibe: ``Fundamentals of applied probability and random processes”, Academic press,

2005.

4. Papoulis and S. U. Pillai: ``Probability, random variables and stochastic processes”, Tata

McGraw-Hill, 4th Edition, 2002.

5. S. Ross, A First Course in Probability, 6th Ed., Pearson Education India, 2002.

6. W. Feller, An Introduction to Probability Theory and its Applications, Vol. 1, 3rd Ed., Wiley,

1968.

18B11CH311 Biology for Engineers L-T-P

3-0-0 3 Credits

Course Objective:

Students will be introduced to the basics of biology such as cell structure and functions, inheritance

& evolution, basic concepts of genetics, and an introduction to microbiology.

Course Contents:

Unit 1. Basics (08 Lectures)

Diversity of life, prokaryotes and eukaryotes, basic cell constituents and macromolecules.

Unit 2. Biochemistry (10 Lectures) Metabolism (Catabolism and Anabolism) and Bioenergetics

Unit 3. Genetics (08 Lectures) Basic principles of Mendel, molecular genetics, structure and function of genes and Chromosomes,

Transcription and Translation, gene expression and regulation.

Unit 4. Cell Biology (07 Lectures) Macromolecules, membranes, organelles, cytoskeleton, signaling, cell division, Differentiation,

motility.

Unit 5. Microbiology (10 Lectures) Host-microbe interactions, physiology, ecology, diversity, and virology.

Course Outcomes:

Students will be able to know the concept of biology and biological terminologies in Biomedical

Engineering based technologies

Teaching Methodology: The Whole content has been distributed in 5 units. The whole syllabi will

be completed in about 42 Lecture including few descriptive 2 hours lecture including power point

presentations. Around 1.5 units will be completed before T-1 Examination and next 1.5 unit will be

compiled by T-2 Examination and rest syllabus will be completed later before final Examinations.

Evaluation Scheme:


30 | P a g e

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. Principles and techniques of Biochemistry and Molecular Biology, by Keith Wilson and

John Walker.

2. Principles of Biochemistry, by Lehninger

3. Fundamentals of Ecology by Eugene Odum

4. Advanced Molecular Genetics by A. Puhler

5. Microbiology and Plant Pathology by P.D. Sharma

18B11EC311 Electronic Devices and Circuits L-T-P

2-1-0 3 Credits

Course Objectives:

To acquaint the students with the construction, theory and operation of the basic electronic devices

such as PN junction diode, Bipolar and Field effect Transistors, Power control devices and Opto-

electronic devices.

Course Contents:

Unit 1:

Semiconductor Diodes: Introduction, Material: Conductor, Semiconductor and Insulator, Energy

levels, Type of Semiconductor: Intrinsic and Extrinsic (N- type and P-type material), PN junction

diode, Depletion layer, V-I characteristics: ideal and practical, Diode resistance, Diode capacitance:

transition and diffusion, Diode equivalent Circuits, Zener Diode and its breakdown mechanism

Diode Applications: Series, Parallel and Series-Parallel Diode Circuits, Rectifier: Half and full

wave, Clippers, Clampers, Zener diode as shunt regulator.

Unit 2:

Bipolar Junction Transistors: Introduction, Structure, Operation and Characteristics, Types of

BJT.

BJT Applications: Load-line and Operating point, Fixed-Bias, Emitter Bias, Voltage-Divider Bias

Configuration. Collector Feedback, Emitter-Follower configuration. Bias Stabilization,

Amplification Action, Common Base, Common Emitter and Common Collector amplifier,

Unit 3:


31 | P a g e

Field Effect Transistors: Introduction, Construction and Characteristic of JFETs. Transfer

Characteristic, MOSFET (Depletion and Enhancement) Type, Transfer Characteristic.

FET Applications: JFET biasing, FET Amplification, Common Source, Common Drain, Common

Gate amplifier,

Unit 4:

Operational Amplifiers: Introduction, Op-Amp basic, Feedback and its effect, Practical Op-Amp

Circuits, Inverting Amplifier, Non-inverting Amplifier, Input follower, Summing Amplifier,

Integrator, Differentiator, Differential Amplifier.

Unit 5:

Oscillators: Introduction, Feedback Oscillator principles, Barkhausen Criteria, RC Oscillator

circuits: Wien-bridge Oscillator, Phase- shift Oscillator, LC Oscillator, Crystal oscillator

Course Outcomes:

Upon completion of the subject, students will be able to:

1. Acquire some understanding in the fundamental of electronic devices and principles.

2. Solve basic problems in electronic circuits.



Lecture along with around 12 Tutorial classes. First 2 units will be completed before T-1

Examination, so that around 14 lectures are covered till T1. Next 2 units will be completed by T-2

Examination, to make around 14 lectures. Last two units will be completed before final (T3)

Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. Robert Boylestad and Louis Nashelsky, “Electron Devices and Circuit Theory”, Pearson

Prentice Hall.

2. R.A. Gayakwad, “OP-Amp and Linear integrated Circuit Technology”, PHI

3. Jacob Millman and Arvin Grabel,”Microelectronics”, TMH

4. Sedra and Smith, ”Microelectronic Circuits”, Oxford University Press

5. Salivahanan. S, Suresh Kumar. N, Vallavaraj ,”Electronic Devices and circuits”, TMH

6. Donald A Neaman, “Semiconductor Physics and Devices”, TMH


32 | P a g e

18B11CI311 Data Structure & Algorithms L-T-P

3-1-0 4 Credits

Course Objectives:

1. To impart the basic concepts of data structures and algorithms.

2. To understand concepts about searching and sorting techniques

3. To understand basic concepts about stacks, queues, lists, trees and graphs.

4. To enable them to write algorithms for solving problems with the help of fundamental data

structures

Course contents:

Unit 1: Introduction:

Basic Terminologies: Elementary Data Organizations, Data Structure Operations: insertion,

deletion, traversal etc.; Analysis of an Algorithm, Asymptotic Notations, Time-Space trade off.

Searching: Linear Search and Binary Search Techniques and their complexity analysis.

Unit 2: Stacks and Queues:

ADT Stack and its operations: Algorithms and their complexity analysis, Applications of Stacks:

Expression Conversion and evaluation – corresponding algorithms and complexity analysis. ADT

queue, Types of Queue: Simple Queue, Circular Queue, Priority Queue; Operations on each types

of Queues: Algorithms and their analysis.

Unit 3: Linked Lists:

Singly linked lists: Representation in memory, Algorithms of several operations: reversing,

Searching, Insertion into, Deletion from linked list; Linked representation of Stack and Queue,

Header nodes, doubly linked list: operations on it and algorithmic analysis; Circular Linked Lists:

all operations their algorithms and the complexity analysis.

Unit 4: Trees:

Basic Tree Terminologies, Different types of Trees: Binary Tree, Threaded Binary Tree, Binary

Search Tree, AVL Tree; Tree operations on each of the trees and their algorithms with complexity

analysis. Applications of Binary Trees. B Tree, B+ Tree: definitions, algorithms and analysis.

Unit 5: Sorting and Hashing:

Objective and properties of different sorting algorithms: Selection Sort, Bubble Sort, Insertion Sort,

Quick Sort, Merge Sort, Heap Sort; Performance and Comparison among all the methods, Hashing.

Unit 6:


33 | P a g e

Graph: Basic Terminologies and Representations, Graph search and traversal algorithms and

complexity analysis.


1 “Fundamentals of Data Structures”, Illustrated Edition by Ellis Horowitz, Sartaj Sahni,

Computer Science Press.

2 Algorithms, Data Structures, and Problem Solving with C++”, Illustrated Edition by Mark

Allen Weiss, Addison-Wesley Publishing Company

3 “How to Solve it by Computer”, 2nd Impression by R. G. Dromey, Pearson Education.

Course Outcomes:

1. For a given algorithm student will able to analyze the algorithms to determine the time and

computation complexity and justify the correctness.

2. For a given Search problem (Linear Search and Binary Search) student will able to implement it.

3. For a given problem of Stacks, Queues and linked list student will able to implement it and

analyse the same to determine the time and computation complexity.

4. Student will able to write an algorithm Selection Sort, Bubble Sort, Insertion Sort, Quick Sort,

Merge Sort, Heap Sort and compare their performance in term of Space and Time complexity.

5. Student will able to implement Graph search and traversal algorithms and determine the time and

computation complexity.

Teaching Methodology: The syllabus will be completed in about 42 Lectures and a few illustrative

2 hour lectures including power point presentations. 2 units will be completed before T-1

Examination and the next 2 unit will be completed by T-2 Examination. The remaining 2 units will

be completed between T-2 and the final Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

18B11CI312 Computer Organization and

Architecture

L-T-P

3-1-0 4 Credits

Course Objectives:

To expose the students to the following:

1. How Computer Systems work & the basic principles

2. Instruction Level Architecture and Instruction Execution

3. The current state of art in memory system design


34 | P a g e

4. How I/O devices are accessed and its principles.

5. To provide the knowledge on Instruction Level Parallelism

6. To impart the knowledge on micro programming

7. Concepts of advanced pipelining techniques.

Course contents:

Unit 1 Functional blocks of a computer:

CPU, memory, input-output subsystems, control unit.Instruction set architecture of a CPU –

registers, instruction execution cycle, RTL interpretation of instructions, addressing modes,

instruction set. Case study – instruction sets of some common CPUs.

Data representation: signed number representation, fixed and floating point representations,

character representation. Computer arithmetic – integer addition and subtraction, ripple carry adder,

carry look-ahead adder, etc. multiplication – shift-andadd, Booth multiplier, carry save multiplier,

etc. Division restoring and non-restoring techniques, floating point arithmetic.

Unit 2: Introduction to x86 architecture.

CPU control unit design: hardwired and micro-programmed design approaches, Case study –

design of a simple hypothetical CPU.

Memory system design: semiconductor memory technologies, memory organization.

Peripheral devices and their characteristics: Input-output subsystems, I/O device interface, I/O

transfers – program controlled, interrupt driven and DMA, privileged and non-privileged

instructions, software interrupts and exceptions. Programs and processes – role of interrupts in

process state transitions, I/O device interfaces – SCII, USB

Unit 3:

Pipelining: Basic concepts of pipelining, throughput and speedup, pipeline hazards.

Parallel Processors: Introduction to parallel processors, Concurrent access to memory and cache

coherency.

Unit 4:

Memory organization: Memory interleaving, concept of hierarchical memory organization, cache

memory, cache size vs. block size, mapping functions, replacement algorithms, write policies.

Course Outcomes:


35 | P a g e

1. Draw the functional block diagram of a single bus architecture of a computer and describe the

function of the instruction execution cycle, RTL interpretation of instructions, addressing modes,

instruction set.

2. Write assembly language program for specified microprocessor for computing 16 bit

multiplication, division and I/O device interface (ADC, Control circuit, serial port communication).

3. Write a flowchart for Concurrent access to memory and cache coherency in Parallel Processors

and describe the process.

4. Given a CPU organization and instruction, design a memory Unit and analyze its operation by

interfacing with the CPU.

5. Given a CPU organization, assess its performance, and apply design techniques to Enhance

performance using pipelining, parallelism and RISC methodology





Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

Suggested Text/Reference books:

1 “Computer Organization and Design: The Hardware/Software Interface”, 5th Edition by David

A. Patterson and John L. Hennessy, Elsevier.

2 “Computer Organization and Embedded Systems”, 6th Edition by CarlHamacher, McGraw Hill

Higher Education.

3 “Computer Architecture and Organization”, 3rd Edition by John P. Hayes, WCB/McGraw-Hill

4 “Computer Organization and Architecture: Designing for Performance”, 10th Edition by

William Stallings, Pearson Education.

5 “Computer System Design and Architecture”, 2nd Edition by Vincent P. Heuring and Harry F.

Jordan, Pearson Education.

18B17CI371 Data Structure & Algorithms Lab L-T-P

0-0-2 1 credit

Course Objectives:


36 | P a g e

1. To teach efficient storage mechanisms of data for an easy access.

2. To design and implementation of various basic and advanced data structures.

3. To introduce various techniques for representation of the data in the real world.

4. To develop application using data structures.

5. To teach the concept of protection and management of data.

6. To improve the logical ability

Course Contents:


Program in C or C++ for following:

1. To implement addition and multiplication of two 2D arrays.

2. To transpose a 2D array.

3. To implement stack using array.

4. To implement queue using array.

5. To implement circular queue using array.

6. To implement stack using linked list.

7. To implement queue using linked list.

8. To implement circular queue using linked list.

9. To implement binary tree using linked list.

10. To implement binary search tree using linked list.

11. To implement tree traversals using linked list.

12. To implement BFS using Stack.

13. To implement DFS using Queue.

14. To implement Linear Search.

15. To implement Binary Search.

16. To implement Bubble Sorting.

17. To implement Selection Sorting.


37 | P a g e

18. To implement Insertion Sorting.

19. To implement Merge Sorting.

20. To implement Heap Sorting.

Note: The Instructor may add/delete/modify/tune experiments, wherever he/she feels in a justified

manner.

Course Outcomes:

1 Student will be able to choose appropriate data structure as applied to specified problem

definition.

2 Student will be able to handle operations like searching, insertion, deletion, traversing

mechanism etc. on various data structures.

3 Students will be able to apply concepts learned in various domains like DBMS, compiler

construction etc.

4 Students will be able to use linear and non-linear data structures like stacks, queues , linked list

etc

Evaluation Scheme:




Total 100 Marks

18B17EC371 Devices & Circuits Lab L-T-P

0-0-2 1 Credit


On completion of the course students will have the skills and confidence to conceive and

implement a complex electronic circuits. More broadly, they will be ready to handle substantial and

challenging design problems.


1. Introduction to CRO, function generator and power supply.

2. Plot the V-I Characteristics of junction diode under forward biased condition.

3. Plot the V-I Characteristics of Zener junction diode under forward biased and reverse biased

condition

4. To design clipping circuit for the giving specification and hence to plot its input and output.

5. To design clamping circuit for the giving specification and hence to plot its input and output.

6. To draw wave shape of the electrical signal at input and output points of the half wave rectifiers.


38 | P a g e

7. To draw wave shape of the electrical signal at input and output points of the full wave center

tapped and full wave bridge rectifier.

8. To design voltage multiplier circuit for the giving specification and hence to plot its input and

output.

9. To obtain input and output characteristics of Common emitter Configuration.

10. To obtain the transfer and output characteristic of FET.

11. To design and test the performance of non-inverting and inverting amplifier using op-amp.

12. To design and test the performance of differentiator and integrator circuit using op-amp.


1. Get an exposure to common electronic components.

2. Get an exposure to the working of diode and operational amplifier.

3. Develop the ability to analyze and design analog electronic circuits using discrete components


This lab course consists of 12 experiments. At the start of the semester, students will be

demonstrated by the different components (Diodes, Transistors etc.) and instruments. First 6

experiments will be completed before P1 examination and remaining will be completed afterwards.

All experiments will be completed till P2 so that all experiments are in syllabus of P2 examination.

Evaluation Scheme:




Total 100 Marks

18B17CI372 Web Technology Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1 Describe the concepts of WWW including browser and HTTP protocol.

2 List the various HTML tags and use them to develop the user-friendly web pages.

3 Define the CSS with its types and use them to provide the styles to the web pages at various

evels.

4 Develop the modern web pages using the HTML and CSS features with different layouts as

per need of applications.

5 Use the JavaScript to develop the dynamic web pages.

6 Use server side scripting with PHP to generate the web pages dynamically using the

database connectivity.

7 Develop the modern Web applications using the client and server side technologies and the

web design fundamentals.


39 | P a g e


1 Write programs in Java to demonstrate the use of following components:Text fields,

buttons, Scrollbar, Choice, List and Check box.

2 Write Java programs to demonstrate the use of various Layouts like Flow Layout, Border

Layout, Grid Layout and card layout.

3 Write programs in Java to create applets incorporating the following features:

a. Create a color palette with matrix of buttons

b. Set background and foreground of the control text area by selecting a color from

color palette.

c. In order to select Foreground or background use check box control as radio buttons

4 Write programs in Java to do the following.

i. Set the URL of another server.

ii. Download the homepage of the server.

iii. Display the contents of homepage with date, content type, and Expiration

date. Last modified and length of the home page.

5 Write programs in Java using sockets to implement the following:

a. HTTP request

b. FTP

c. SMTP

d. POP3

6 Write a program in Java for creating simple chat application with datagram sockets and

datagram packets.

Course Outcomes:

1. Employ fundamental computer theory to basic programming techniques.

2. Use fundamental skills to maintain web server services required to host a website.

3. Select and apply markup languages for processing, identifying, and presenting of information

in web pages.

4. Use scripting languages and web services to transfer data and add interactive components to

web pages.

5. Create and manipulate web media objects using editing software.

6. Incorporate aesthetics and formal concepts of layout and organization to design websites that

effectively communicate using visual elements.

7. Conceptualize and plan an internet-based business that applies appropriate business models and

web technologies.

8. Combine multiple web technologies to create advanced web components.

9. Design websites using appropriate security principles, focusing specifically on the

vulnerabilities inherent in common web implementations.


40 | P a g e

10. Incorporate best practices in navigation, usability and written content to design websites that

give users easy access to the information they seek.

Evaluation Scheme




Total 100 Marks


1. Burdman, Jessica, “Collaborative Web Development” Addison Wesley

2. Xavier, C, “ Web Technology and Design” , New Age International

3. Ivan Bayross,” HTML, DHTML, Java Script, Perl & CGI”, BPB Publication

4. Bhave, “Programming with Java”, Pearson Education

5. Herbert Schieldt, “The Complete Reference:Java”, TMH.

6. Hans Bergsten, “Java Server Pages”, SPD O’Reilly

7. Ullman, “PHP for the Web: Visual QuickStart Guide”, Pearson Education

8. Margaret Levine Young, “The Complete Reference Internet”, TMH

9. Naughton, Schildt, “The Complete Reference JAVA2”, TMH

18B19GE391 Indian Constitution L-T-P

1-0-0 0 credit

Course Objectives:

The students will be able to understand the need for a constitution in a democratic society and

appreciate the fundamental rights of the citizens of India.

Course Contents:

1. Introduction to Indian Constitution

a. Meaning of the term Constitution

b. Preamble of the Constitution

c. Constituent Assembly

d. The Salient Features of Indian Constitution

2. Fundamental Rights

a. Fundamental Rights

b. Fundamental Duties

c. The Directive Principles of State Policy

3. Union Government

a. Union Government

b. Union Legislature (Parliament)

c. Lok Sabha and Rajya Sabha (with Powers and Functions)

d. Union Excecutive

e. President of India (with Powers and Functions)

f. Prime Minister of India (with Powers and Functions)

g. Union Judiciary (Supreme Court)

http://indianconstitution4ba.blogspot.in/2012/10/what-is-constitution.html

http://indianconstitution4ba.blogspot.in/2012/08/preamble.html

http://indianconstitution4ba.blogspot.in/2012/10/the-constituent-assembly.html

http://indianconstitution4ba.blogspot.in/2012/08/salient-features-of-indian-constitution.html

http://indianconstitution4ba.blogspot.in/2012/10/union-government-of-india.html


41 | P a g e

h. Jurisdiction of the Supreme Court

4. State Government

a. State Government

b. State Legislature (Legislative Assembly / Vidhan Sabha, Legislative Council / Vidhan

Parishad)

c. Powers and Functions of the State Legislature

d. State Executive

e. Governor of the State (with Powers and Functions)

f. The Chief Minister of the State (with Powers and Functions)

g. State Judiciary (High Courts)

5. Local Self Government (with Special Reference to Karnataka State)

a. Election Commission of India (with Powers and Functions)

b. The Union Public Service Commission (with Powers and Functions)


1. ‘Indian Polity’ by Laxmikanth

2. ‘Indian Administration’ by Subhash Kashyap

3. ‘Indian Constitution’ by D.D. Basu

4. ‘Indian Administration’ by Avasti and Avasti

http://indianconstitution4ba.blogspot.in/2012/10/state-government.html

http://indianconstitution4ba.blogspot.in/2012/10/vidhan-sabha.html

http://indianconstitution4ba.blogspot.in/2012/10/vidhan-sabha.html

http://indianconstitution4ba.blogspot.in/2012/10/powers-and-functions-of-state.html

http://indianconstitution4ba.blogspot.in/2012/10/state-executive.html

http://indianconstitution4ba.blogspot.in/2012/10/state-executive.html

http://indianconstitution4ba.blogspot.in/2012/10/state-judiciary.html


42 | P a g e


B. Tech. (CSE & IT)

Course Curriculum

Fourth Semester

IV Semester (B4)

Sr.

No. Category



1 HSS 18B11HS411 Professional Practice Law &

Ethics 3 0 0 3 3

2 Core 18B11CI411 Database Management Systems 3 1 0 4 4

3 Core 18B11CI412 Design and Analysis of

Algorithms 3 1 0 4 4

4 Core 18B11CI413 Object Oriented Programming 3 1 0 4 4

5 Core 18B11EC313 Digital Electronics 3 1 0 4 4

6 Core 18B17CI471 Database Systems Lab 0 0 2 2 1

7 Core 18B17CI472 Algorithms Lab 0 0 4 4 2

8 Core 18B17CI473 Object Oriented Programming

Lab 0 0 2 2 1

9 Core 18B17EC373 Digital Electronics Lab 0 0 2 2 1

10 Mandatory 18B19GE491 Essence of Indian Traditional

Knowledge 1 0 0 1 0

Total 16 4 10 30 24

18B11HS411 Professional Practice, Law & Ethics L-T-P

3-0-0 3 Credits


43 | P a g e

Course Objectives:

This course will make the students understand the type of roles they are expected to play in the

society as practitioners of the engineering profession.

Course Contents:

Unit 1 A- Professional Practice – Respective roles of various stakeholders:

Government (constituting regulatory bodies and standardization organizations, prescribing norms to

ensure safety of the citizens); Standardization Bodies (ex. Bureau of Indian Standards)

(formulating standards of practice); professional bodies (ex. Institution of Engineers (India), Indian

Roads Congress,IIA/ COA, ECI, Local Bodies/ Planning Authorities) (certifying professionals and

offering platforms for interaction); Clients/ owners (role governed by contracts); Developers (role

governed by regulations such as RERA); Consultants (role governed by bodies such as CEAI);

Contractors (role governed by contracts and regulatory Acts and Standards); Manufacturers/

Vendors/ Service agencies (role governed by contracts and regulatory Acts and Standards)

Unit 1 B- Professional Ethics –

Definition of Ethics, Professional Ethics, Business Ethics,Corporate Ethics, Engineering Ethics,

Personal Ethics; Code of Ethics as defined in the website of Institution of Engineers (India);

Profession, Professionalism, Professional Responsibility, Professional Ethics; Conflict of Interest,

Gift Vs Bribery, Environmental breaches, Negligence, Deficiencies in state-of-the-art; Vigil

Mechanism, Whistleblowing,protected disclosures.RTI .

Unit 2: General Principles of Contracts Management:

Indian Contract Act, 1972 andamendments covering General principles of contracting; Contract

Formation & Law; Privacy of contract; Various types of contract and their features; Valid &

Voidable Contracts; Prime and sub-contracts; Joint Ventures & Consortium; Complex contract

terminology; Tenders, Request for Proposals, Bids & Proposals; Bid Evaluation; Contract

Conditions & Specifications; Critical /“Red Flag” conditions; Contract award & Notice To Proceed;

Variations & Changes in Contracts; Differing site conditions; Cost escalation; Delays, Suspensions

& Terminations; Time extensions & Force Majeure; Delay Analysis; Liquidated damages &

Penalties; Insurance & Taxation; Performance and Excusable Non-performance;Contract

documentation; Contract Notices; Wrong practices in contracting (Bid shopping,Bid fixing,

Cartels); Reverse auction; Case Studies; Build-Own-Operate & variations; Public-Private

Partnerships; International Commercial Terms.

Unit 3: Arbitration, Conciliation and ADR (Alternative Dispute Resolution) system: Arbitration – meaning, scope and types – distinction between laws of 1940 and 1996;UNCITRAL

model law – Arbitration and expert determination; Extent of judicialintervention; International

commercial arbitration; Arbitration agreements – essential and kinds, validity, reference and

interim measures by court; Arbitration tribunal – appointment,challenge, jurisdiction of arbitral

tribunal, powers, grounds of challenge, procedure and court assistance; Award including Form and

content, Grounds for setting aside an award, Enforcement, Appeal and Revision; Enforcement of

foreign awards – New York and Geneva Convention Awards; Distinction between conciliation,

negotiation, mediation and arbitration,confidentiality, resort to judicial proceedings, costs; Dispute

Resolution Boards; Lok Adalats.

Unit 4: Engagement of Labour and Labour & other construction-related Laws:


44 | P a g e

Role of Labour in Engineering; Methods of engaging labour- on rolls, labour sub-contract, piece

rate work; Industrial Disputes Act, 1947; Collective bargaining; Industrial Employment (Standing

Orders) Act, 1946; Workmen’s Compensation Act, 1923; Building & Other Construction Workers

(regulation of employment and conditions of service) Act (1996) andRules (1998); RERA Act

2017, NBC 2017.

Unit 5: Law relating to Intellectual property:

Introduction – meaning of intellectual property, main forms of IP, Copyright, Trademarks, Patents

and Designs, Secrets; Law relating to Copyright in India including Historical evolution of Copy

Rights Act, 1957,Meaning of copyright – computer programs, Ownership of copyrights and

assignment, Criteria of infringement, Piracy in Internet – Remedies and procedures in India; Law

relating to Patents under Patents Act, 1970 including Concept and historical perspective of patents

law in India, Patentable inventions with special reference to biotechnology products, Patent

protection for computer programs, Process of obtaining patent – application, examination,

opposition and sealing of patents, Patent cooperation treaty and grounds for opposition,Rights and

obligations of patentee, Duration of patents – law and policy considerations, Infringement and

related remedies.

Unit 6: Cyber Laws:

Computer Crimes (Fraud and Embezzlement, Sabotage & Information Theft, Intruders, Hacking&

Cracking), Computer Crime Laws, Digital Forgery, Cyber Terrorism, Wiretapping & IT Act.

Course Outcomes:

It will develop some ideas of the legal and practical aspects of their profession including several

new areas of law such as IPR, ADR


The syllabus will be completed in about 42 Lectures including power point presentations. 2 units

will be completed before T-1 Examination and the next 2 unit will be completed by T-2

Examination. The remaining 2 unit will be completed between T-2 and the final Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. Meena Rao (2006), Fundamental concepts in Law of Contract, 3rd Edn. Professional

2. Avtarsingh (2002), Law of Contract, Eastern Book Co.

3. Dutt (1994), Indian Contract Act, Eastern Law House

4. Anson W.R. (1979), Law of Contract, Oxford University Press

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

6. T. Ramappa (2010), Intellectual Property Rights Law in India, Asia Law House

7. O.P. Malhotra, Law of Industrial Disputes, N.M. Tripathi Publishers

8. Rustamji R.F., Introduction to the Law of Industrial Disputes, Asia Publishing House


45 | P a g e

9. Ethics in Engineering- M.W.Martin& R.Schinzinger, McGraw-Hill

10. Engineering Ethics, National Institute for Engineering Ethics, USA

11. www.ieindia.org

12. Engineering ethics: concepts and cases – C. E. Harris, M.S. Pritchard, M.J.Rabins

13. Contracts, http://206.127.69.152/jgretch/crj/211/ch7.ppt

14. Types of Contracts, http://cmsu2.cmsu.edu/public/classes/rahm/meiners.con.ppt

15. Cyber law,Govt of India by Nandan Kamat

16. Ghosh,B.(2006) Ethics in Management and Indian Ethos,2006 Second Edition, Vikas

Publishing house,New Delhi

17. Diwan,P. & Kapoor,S (2000) Cyber And E-Commerce Laws with information Technology Act,

& Rules,2nd edition,Prakesh Publication House,Jaipur

18B11CI412 Design and Analysis of Algorithms L-T-P

3-1-0 4 Credits

Course Objectives:

1. Analyze the asymptotic performance of algorithms.

2. Write rigorous correctness proofs for algorithms.

3. Demonstrate a familiarity with major algorithms and data structures.

4. Apply important algorithmic design paradigms and methods of analysis.

5. Synthesize efficient algorithms in common engineering design situations.

Course contents:

Unit 1:

Introduction: Characteristics of algorithm. Analysis of algorithm: Asymptotic analysis of

complexity bounds – best, average and worst-case behavior; Performance measurements of

Algorithm, Time and space trade-offs, Analysis of recursive algorithms through recurrence

relations: Substitution method, Recursion tree method and Masters’ theorem.

Unit 2:

Fundamental Algorithmic Strategies: Brute-Force, Greedy,Dynamic Programming, Branchand-

Bound and Backtracking methodologies for the design of algorithms; Illustrations of these

techniques for Problem-Solving , Bin Packing, Knap Sack TSP. Heuristics – characteristics and

their application domains.

Unit 3:

Graph and Tree Algorithms: Traversal algorithms: Depth First Search (DFS) and Breadth First

Search (BFS); Shortest path algorithms, Transitive closure, Minimum Spanning Tree, Topological

sorting, Network Flow Algorithm.

Unit 4:


46 | P a g e

Tractable and Intractable Problems: Computability of Algorithms, Computability classes – P,NP,

NP-complete and NP-hard. Cook’s theorem, Standard NP-complete problems and Reduction

techniques.

Unit 5:

Advanced Topics: Approximation algorithms, Randomized algorithms, Class of problems beyond

NP – P SPACE

Suggested text/Reference books:

1 Introduction to Algorithms, 4TH Edition, Thomas H Cormen, Charles E Lieserson, Ronald L

Rivest and Clifford Stein, MIT Press/McGraw-Hill.

2 Fundamentals of Algorithms – E. Horowitz et al.

3 Algorithm Design, 1ST Edition, Jon Kleinberg and ÉvaTardos, Pearson.

4 Algorithm Design: Foundations, Analysis, and Internet Examples, Second Edition, Michael T

Goodrich and Roberto Tamassia, Wiley.

5 Algorithms -- A Creative Approach, 3RD Edition, UdiManber, Addison-Wesley, Reading, MA.

Course Outcomes:

1 For a given algorithms analyze worst-case running times of algorithms based on asymptotic

analysis and justify the correctness of algorithms.

2 Describe the greedy paradigm and explain when an algorithmic design situation calls for it. For

a given problem develop the greedy algorithms.

3 Describe the divide-and-conquer paradigm and explain when an algorithmic design situation

calls for it. Synthesize divide-and-conquer algorithms. Derive and solve recurrence relation.

4 Describe the dynamic-programming paradigm and explain when an algorithmic design situation

calls for it. For a given problems of dynamic-programming and Develop the dynamic

programming algorithms, and analyze it to determine its computational omplexity.

5 For a given problem model it using graph and write the corresponding algorithm to solve the

problems.

6 Explain the ways to analyze randomized algorithms (expected running time, probability of

error).

7 Explain what an approximation algorithm is. Compute the approximation factor of an

approximation algorithm (PTAS and FPTAS).



Examination and the next 2 unit will be completed by T-2 Examination. The remaining 1 unit will



47 | P a g e

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

18B11CI411 Database Management Systems L-T-P

3-1-0 4 Credits

Course Objectives:

1. To understand the different issues involved in the design and implementation of a database

system.

2. To study the physical and logical database designs, database modelling, relational, hierarchical,

and network models

3. To understand and use data manipulation language to query, update, and manage a database

4. To develop an understanding of essential DBMS concepts such as: database security, Integrity,

concurrency, distributed database, and intelligent database, Client/Server (Database Server),

Data Warehousing.

5. To design and build a simple database system and demonstrate competence with the

fundamental tasks involved with modelling, designing, and implementing a DBMS.

Course contents:

Unit 1:

Database system architecture: Data Abstraction, Data Independence, Data Definition Language

(DDL), Data Manipulation Language (DML).

Data models: Entity-relationship model, network model, relational and object oriented data

models, integrity constraints, data manipulation operations.

Unit 2:

Relational query languages: Relational algebra, Tuple and domain relational calculus,SQL3, DDL

and DML constructs, Open source and Commercial DBMS - MYSQL,ORACLE, DB2, SQL server.

Relational database design: Domain and data dependency, Armstrong's axioms, Normal forms,

Dependency preservation, Lossless design.

Query processing and optimization: Evaluation of relational algebra expressions, Query

equivalence, Join strategies, Query optimization algorithms.

Unit 3:

Storage strategies: Indices, B-trees, hashing.


48 | P a g e

Unit 4:

Transaction processing: Concurrency control, ACID property, Serializability of scheduling,

Locking and timestamp based schedulers, Multi-version and optimistic Concurrency Control

schemes, database recovery.

Unit 5:

Database Security: Authentication, Authorization and access control, DAC, MAC and RBAC

models, Intrusion detection, SQL injection.

Unit 6:

Advanced topics: Object oriented and object relational databases, Logical databases, Web

databases, Distributed databases, Data warehousing and data mining.

Course Outcomes:

1 For a given query write relational algebra expressions for that query and optimize the developed

expressions

2 For a given specification of the requirement design the databases using E_R method and

normalization.

3 For a given specification construct the SQL queries for Open source and Commercial DBMS -

MYSQL, ORACLE, and DB2.

4 For a given query optimize its execution using Query optimization algorithms

5 For a given transaction-processing system, determine the transaction atomicity, consistency,

isolation, and durability.

6 Implement the isolation property, including locking, time stamping based on concurrency

control and Serializability of scheduling.





Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1 “Database System Concepts”, 6th Edition by Abraham Silberschatz, Henry F.Korth, S.

Sudarshan, McGraw-Hill.


49 | P a g e

2 “Principles of Database and Knowledge – Base Systems”, Vol 1 by J. D. Ullman,Computer

Science Press.

3 “Fundamentals of Database Systems”, 5th Edition by R. Elmasri and S. Navathe,Pearson

Education

4 “Foundations of Databases”, Reprint by Serge Abiteboul, Richard Hull, Victor Vianu, Addison-

Wesley.

18B11CI413 Object Oriented Programming L-T-P

3-1-0 4 Credits

Course Objectives:

The course will introduce standard tools and techniques for software development, using object

oriented approach, use of a version control system, an automated build process, an appropriate

framework for automated unit and integration tests.

Course contents:

Unit 1:

Abstract data types and their specification.How to implement an ADT. Concrete state space,

concrete invariant, abstraction function. Implementing operations, illustrated by the Text example.

Features of object-oriented programming. Encapsulation, object identity, polymorphism – but not

inheritance.

Unit 2:

Inheritance in OO design. Design patterns. Introduction and classification. The iterator pattern

Model-view-controller pattern.

Unit 3:

Commands as methods and as objects. Implementing OO language features Memory management.

Generic types and collections GUIs. Graphical programming with Scala and Swing The software

development process.

Unit 4:

Polymorphism and Virtual Functions in C++ ,RTTI and Casting types in C++,Function and

Operator overloading in C++, Namespace and Templates in C++,STL-Container classes, Sequence,

Iterators.

Unit 5:


50 | P a g e

Java GUI and AWT, Introduction to Swing and Applet, Arrays, Inheritance and Abstract Classes in

JAVA, Packages, Class path, Interfaces in JAVA, Basic OO Testing and Exception Handling in

C++ and JAVA.

Course Outcomes:

After taking the course, students will be able to:

1 Specify simple abstract data types and design implementations, using abstraction functions to

document them.

2 Recognise features of object-oriented design such as encapsulation, polymorphism, inheritance,

and composition of systems based on object identity.

3 Name and apply some common object-oriented design patterns and give examples of their use.

4 Design applications with an event-driven graphical user interface.





Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1 Barbara Liskov, Program Development in Java, Addison-Wesley, 2001

2 Object Oriented Programming in C++ by E. Balagurusamy, TMH, New Delhi.

3 OO Programming in C++ by Robert Lafore, Galgotia Publication

18B11EC313 Digital Electronics L-T-P

3-1-0 4 Credits

Course Objectives:

1. To introduce basic postulates of Boolean algebra and shows the correlation between Boolean

expressions

2. To introduce the methods for simplifying Boolean expressions

3. To outline the formal procedures for the analysis and design of combinational circuits and

sequential circuits

4. To introduce the concept of memories and programmable logic devices

Course Contents:


51 | P a g e

Unit 1: (8 hours)

Introduction: Introduction to Digital system, Comparison of Digital system with Analog system,

Number System and Codes: Decimal, Binary, Hexadecimal and Octal number systems, base

conversions, Binary, octal and hexadecimal arithmetic (addition, subtraction by complement

method, multiplication), representation of signed and unsigned numbers, Weighted codes-BCD

code, Excess-3 code, Gray code, Error detection and correction,

Logic Gates and Boolean algebra: Introduction to Boolean Algebra and Boolean operators, Truth

Tables of OR, AND, NOT, Basic postulates and fundamental theorems of Boolean algebra, Truth

tables, construction and symbolic representation of XOR, XNOR, Universal (NOR and NAND)

gates, Standard representation of logic functions (SOP and POS), Karnaugh map minimization,

Quine-McClusky Method,

Unit 2: (10 hours)

Combinational Logic Analysis and Design: Introduction and Analysis procedure, Design

procedure, Half adder, Full adder, Half Subtractor, Full Subtractor, Magnitude comparator, BCD

adder, Carry look ahead adder, Multipliers, Multiplexers, De-multiplexers, Encoders and Decoders,

Unit 3: (8 hours)

Sequential logic design: Latches and Flip flops , S-R Flip flop, J-K Flip flop, T and D type Flip

flop, Conversion of Flip-flops, Race around condition and Master slave flip flop ,Clocked and edge

triggered Flip flops, Registers, Counters (synchronous and asynchronous), State Table, State

Diagrams, counter design using excitation table and equations and Analysis of clocked sequential

circuits,

Unit 4: (8 hours)

Analog to Digital and Digital to Analog converters: Design of various Analog to Digital and

Digital to Analog converters

Digital Logic families: Parameters of Logic Families: Fan-in, Fan out, Noise Margin, Power

Dissipation, Figure of merit, Speed power product, Introduction to Logic Families: DTL, RTL,

TTL, ECL and MOS families and their comparison.

Unit 5: (8 hours)

Digital Memories and Programmable Logic: Introduction to Semiconductor Memories, RAM,

ROM, Digital design with PROM, PLA, PAL, FPGA and sequential Programmable devices.

Waveform generation and shaping: 555 Timer, A stable and monostable Multivibrators.

Introduction to VHDL

Course Outcomes:

After studying this course the students would gain enough knowledge

1 Have a thorough understanding of the fundamental concepts and techniques used in digital

electronics.

2 To understand and examine the structure of various number systems and its application in

digital design.

3 The ability to understand, analyze and design various combinational and sequential circuits.

4 Ability to identify basic requirements for a design application and propose a cost effective

solution.

5 The ability to identify and prevent various hazards and timing problems in a digital design.

6 To develop skill to build, and troubleshoot digital circuits.


52 | P a g e



Lecture along with around 12 Tutorial classes. First 2 units will be completed before T-1

Examination, so that around 14 lectures are covered till T1. Next 2 units will be completed by T-2

Examination, to make around 14 lectures. Last 2 units will be completed before final (T3)

Examinations.

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1. M. Morris Mano and M. D. Ciletti, “Digital Design”, 4th Edition, Pearson Education

2. Anil K. Maine, “Digital Circuits: Principle and Integrated Circuits”, Wiley India

3. R. P. Jain, “Modern Digital Electronics”, McGraw Hill Education.

4. Thomas L. Floyd, “Digital Fundamentals”, Pearson Education

5. Charles H. Roth. “Fundamentals of Logic Design”, Thomson Learning

18B17CI471 Database Systems Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. have a broad understanding of database concepts and database management system software

2. have a high-level understanding of major DBMS components and their function

3. Be able to model an application’s data requirements using conceptual modeling tools like

ER diagrams and design database schemas based on the conceptual model.

4. Be able to write SQL commands to create tables and indexes, insert/update/delete data, and

query data in a relational DBMS.

5. Be able to program a data-intensive application using DBMS APIs.

Course Contents:


1. Study of DBMS, RDBMS and ORDBMS.

2. To study Data Definition language Statements.

3. To study Data Manipulation Statements.

4. Study of SELECT command with different clauses.

5. Study of SINGLE ROW functions (character, numeric, Data functions).


53 | P a g e

6. Study of GROUP functions (avg, count, max, min, Sum).

7. Study of various type of SET OPERATORS (Union, Intersect, Minus).

8. Study of various type of Integrity Constraints.

9. Study of Various type of JOINS.

10. To study Views and Indices.

Course Outcomes:

1. Describe DBMS architecture, physical and logical database designs, database modeling,

relational, hierarchical and network models.

2. Identify basic database storage structures and access techniques such as file organizations,

indexing methods including B‐tree, and hashing.

3. Learn and apply structured query language (SQL) for database definition and database

manipulation.

4. Demonstrate an understanding of normalization theory and apply such knowledge to the

normalization of a database.

5. Understand various transaction processing, concurrency control mechanisms and database

protection mechanisms

Evaluation Scheme: Day to Day Evaluation 60 Marks



Total 100 Marks

18B17CI472 Algorithms Lab L-T-P

0-0-4 2 Credits

Course Objectives:

1. Analyze the asymptotic performance of algorithms.

2. Write rigorous correctness proofs for algorithms.

3. Demonstrate a familiarity with major algorithms and data structures.

4. Apply important algorithmic design paradigms and methods of analysis.

5. Synthesize efficient algorithms in common engineering design situations.

Course Contents:


1. Analysis of common problems

2. Analysis of sorting algorithms

3. Designing of time and space efficient algorithms

4. Sorting Algorithms

5. Heaps and Heapsort

6. Greedy Algorithms

7. Dynamic Programming

8. Graph Algorithms


54 | P a g e

9. Balanced Search Tree Structures

10. Advanced Tree Structures

11. Fibonacci Heap

12. String Matching Algorithms

13. Backtracking

Course Outcomes:

1. Argue the correctness of algorithms using inductive proofs and invariants.

2. Analyse worst-case running times of algorithms using asymptotic analysis.

3. 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.




Total 100 Marks

18B17CI473 Object Oriented Programming Lab L-T-P

0-0-2 1 credit

Course Objectives:

1. Be able to understand the difference between object oriented programming and procedural

oriented language and data types in C++.

2. Be able to program using C++ features such as composition of objects, Operator

overloading, inheritance, Polymorphism etc.

3. At the end of the course students will able to simulate the problem in the subjects like

Operating system, Computer networks and real world problems

Course Contents:


1. Class with static Data Member

2. Class with Static Member Function

3. Function with Default Argument

4. Matrix class using default argument, static data members and friend function

5. Arithmetic Operations on Complex Number using Operator Overloading

6. Dynamic Memory Allocation-Matrix using copy constructor and assignment Operator

Overloading new and delete operator

7. Template for Linked List Class and its Methods

8. A Bubble sort, Insertion sort using class template

9. Merge sort, Quick sort using class template

10. Implementation of Stack-Exception Handling, Queue-Exception Handling.


55 | P a g e

11. Demonstration of Dynamic Polymorphism and RTTI on Shape Hierarchy

12. Operations on Complex Number using Files

Course Outcomes:

1. Understand fundamentals of programming such as variables, conditional and iterative

execution, methods, etc.

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

classes, invoking methods, using class libraries, etc.

3. Be aware of the important topics and principles of software development.

4. Have the ability to write a computer program to solve specified problems.

5. Be able to use the Java SDK environment to create, debug and run simple Java programs.




Total 100 Marks

18B17EC373 Digital Electronics Lab L-T-P

0-0-2 1 Credits


On the completion of this laboratory course, the students will be able to:

1. Demonstrate the truth table of various expressions and combinational circuits using logic gates.

2. Design, test and evaluate various combinational circuits such as adders, subtractors,

comparators, multiplexers and de-multiplexers.

3. Construct flips-flops, counters and shift registers.

4. Simulate full adder and up/down counters.


1. Introduction to Digital Electronics lab- nomenclature of digital IC’s specifications, study of the

data sheet, concept of VCC and ground, verification of the truth tables of logic gates using TTL

ICs.

2. Implementation of the given Boolean function using logic gates in both SOP and POS forms.

3. To design and implement Half Adder and Full Adder circuit using basic logic gates and

universal logic gates.

4. To design and implement Half Subtractor and Full Subtractor circuit using basic logic gates and

universal logic gates.

5. To design & verify the operation of magnitude comparator.

6. To verify NAND and NOR gate as universal logic gates.

7. Implementation of 2x1 and 4x1 multiplexer using basic logic gates and verify their truth tables.

8. Implementation and verification of decoder operation using logic gates.

9. Verification of state tables of RS, JK, T and D flip-flops using 3 NAND & NOR gates.

10. Design and verify the 4-bit synchronous counter.


56 | P a g e

11. Design and verify the 4-bit asynchronous counter.

12. To realize the Ring Counter and Johnson Counter using IC7476.

13. Design, and Verify the 4-bit Serial in - Parallel out Shift Registers.


With the help of this laboratory, students will learn about the basics of digital electronics that how a

data is being converted to digital form and how the data communicates in the digital form and how

to interface the Logic gates IC with each other. The base of this subject will be helpful in further

laboratory of Microprocessor and Interfacing. The entire practical are running smoothly and we

keep on checking each practical kit separately time to time for its working.


Lab work will be divided and covered in two parts. First 7 experiments will be completed before P1

examination and remaining will be completed afterwards. All experiments will be completed till P2

so that all experiments are in syllabus of P2 examination.

Evaluation Scheme:




Total 100 Marks


57 | P a g e


B. Tech. (CSE & IT)

Course Curriculum

Fifth Semester

V Semester (B5)

Sr.

No

.

Category

Course Contact Hours


1 OE - I 3 0 0 3 3

2 DE - I 3 0 0 3 3

3 DE -II 3 0 0 3 3

4 Core 18B11CI511 Operating Systems 3 1 0 4 4

5 Core 18B11CI512 Theory of Computation 3 1 0 4 4

6 Core 18B17CI571 Operating Systems Lab 0 0 2 2 1

7 Core 18B17CI572 Advance Programming Lab 0 0 2 2 1

8 Project 18B19CI591 Minor Project 0 0 2 2 1

Total 15 2 6 23 20


58 | P a g e

18B11CI511 Operating Systems L-T-P

3-1-0 4 Credits

Course Objectives:

To learn the fundamentals of Operating Systems.

1 To learn the mechanisms of OS to handle processes and threads and their communication

2 To learn the mechanisms involved in memory management in contemporary OS

3 To gain knowledge on distributed operating system concepts that includes architecture, Mutual

exclusion algorithms, deadlock detection algorithms and agreement protocols

4 To know the components and management aspects of concurrency management

Course contents:

Unit 1:

Introduction: Concept of Operating Systems, Generations of Operating systems, Types of

Operating Systems, OS Services, System Calls, Structure of an OS - Layered, Monolithic,

Microkernel Operating Systems, Concept of Virtual Machine. Case study on UNIX and

WINDOWS Operating System.

Unit 2:

Processes: Definition, Process Relationship, Different states of a Process, Process State transitions,

Process Control Block (PCB), Context switching

Thread: Definition, Various states, Benefits of threads, Types of threads, Concept of multithreads

Process Scheduling: Foundation and Scheduling objectives, Types of Schedulers, Scheduling

criteria: CPU utilization, Throughput, Turnaround Time, Waiting Time, Response Time;

Scheduling algorithms: Pre-emptive and Non pre-emptive, FCFS, SJF, RR; Multiprocessor

scheduling: Real Time scheduling: RM and EDF.

Unit 3:

Inter-process Communication: Critical Section, Race Conditions, Mutual Exclusion, Hardware

Solution, Strict Alternation, Peterson’s Solution, The Producer\Consumer Problem, Semaphores,

Event Counters, Monitors, Message Passing, Classical IPC Problems: Reader’s & Writer Problem,

Dinning Philosopher Problem etc.

Unit 4:

Deadlocks: Definition, Necessary and sufficient conditions for Deadlock, Deadlock Prevention,

and Deadlock Avoidance: Banker’s algorithm, Deadlock detection and Recovery.


59 | P a g e

Unit 5:

Memory Management: Basic concept, Logical and Physical address map, Memory allocation:

Contiguous Memory allocation – Fixed and variable partition– Internal and External fragmentation

and Compaction; Paging: Principle of operation – Page allocation – Hardware support for paging,

Protection and sharing, Disadvantages of paging.

Virtual Memory: Basics of Virtual Memory – Hardware and control structures – Locality of

reference, Page fault , Working Set , Dirty page/Dirty bit – Demand paging, Page Replacement

algorithms: Optimal, First in First Out (FIFO), Second Chance (SC), Not recently used (NRU) and

Least Recently used (LRU).

Unit 6:

I/O Hardware: I/O devices, Device controllers, Direct memory access Principles of I/O Software:

Goals of Interrupt handlers, Device drivers, Device independent I/O software, Secondary-Storage

Structure: Disk structure, Disk scheduling algorithms

File Management: Concept of File, Access methods, File types, File operation, Directory structure,

File System structure, Allocation methods (contiguous, linked, indexed), Free-space management

(bit vector, linked list, grouping), directory implementation (linear list, hash table), efficiency and

performance.

Disk Management: Disk structure, Disk scheduling - FCFS, SSTF, SCAN, C-SCAN, Disk

reliability, Disk formatting, Boot-block, Bad blocks

Course Outcomes:

6 Create processes and threads.

7 Develop algorithms for process scheduling for a given specification of CPU utilization,

Throughput, Turnaround Time, Waiting Time, and Response Time.

8 For a given specification of memory organization develop the techniques for optimally

allocating memory to processes by increasing memory utilization and for improving the access

time.

9 Design and implement file management system.

10 For a given I/O devices and OS (specify) develop the I/O management functions in OS as part

of a uniform device abstraction by performing operations for synchronization between CPU and

I/O controllers.







60 | P a g e

1 Operating System Concepts Essentials, 9th Edition by AviSilberschatz, Peter Galvin, Greg

Gagne, Wiley Asia Student Edition.

2 Operating Systems: Internals and Design Principles, 5th Edition, William Stallings, Prentice

Hall of India.

3 Operating System: A Design-oriented Approach, 1st Edition by Charles Crowley, Irwin

Publishing

4 Operating Systems: A Modern Perspective, 2nd Edition by Gary J. Nutt, Addison-Wesley

5 Design of the Unix Operating Systems, 8th Edition by Maurice Bach, Prentice-Hall of India

6 Understanding the Linux Kernel, 3rd Edition, Daniel P. Bovet, Marco Cesati, O'Reilly and

Associates

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

18B11CI512 Theory of Computation L-T-P

3-1-0 4 Credits

Course Objectives:

1. Develop a formal notation for strings, languages and machines.

2. Design finite automata to accept a set of strings of a language.

3. Prove that a given language is regular and apply the closure properties of languages.

4. Design context free grammars to generate strings from a context free language and convert

them into normal forms.

5. Prove equivalence of languages accepted by Push Down Automata and languages generated by

context free grammars

6. Identify the hierarchy of formal languages, grammars and machines.

7. Distinguish between computability and non-computability and Decidability and undecidability.

Course contents:

Unit 1:

Introduction: Alphabet, languages and grammars, productions and derivation, Chomsky hierarchy

of languages.

Unit 2:

Regular languages and finite automata: Regular expressions and languages, deterministic finite

automata (DFA) and equivalence with regular expressions, nondeterministic finite automata (NFA)


61 | P a g e

and equivalence with DFA, regular grammars and equivalence with finite automata, properties of

regular languages, pumping lemma for regular languages, minimization of finite automata.

Unit 3:

Context-free languages and pushdown automata: Context-free grammars (CFG) and languages

(CFL), Chomsky and Greibach normal forms, nondeterministic pushdown automata (PDA) and

equivalence with CFG, parse trees, ambiguity in CFG, pumping lemma for context-free languages,

deterministic pushdown automata, closure properties of CFLs.

Unit 4:

Context-sensitive languages: Context-sensitive grammars (CSG) and languages, linear bounded

automata and equivalence with CSG.

Unit 5:

Turing machines: The basic model for Turing machines (TM), Turing recognizable (recursively

enumerable) and Turing-decidable (recursive) languages and their closure properties, variants of

Turing machines, nondeterministic TMs and equivalence with deterministic TMs, unrestricted

grammars and equivalence with Turing machines, TMs as enumerators. Undecidability: Church-

Turing thesis, universal Turing machine, the universal and diagonalization languages, reduction

between languages and Rice s theorem, undecidable problems about languages.

Course Outcomes:

1 Write a formal notation for strings, languages and machines.

2 Design finite automata to accept a set of strings of a language.

3 For a given language determine whether the given language is regular or not. Design context

free grammars to generate strings of context free language.

4 Determine equivalence of languages accepted by Push Down Automata and languages

generated by context free grammars

5 Write the hierarchy of formal languages, grammars and machines.

6 Distinguish between computability and non-computability and Decidability and undecidability.





Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


62 | P a g e


1 John E. Hopcroft, Rajeev Motwani and Jeffrey D. Ullman, Introduction to Automata Theory,

Languages, and Computation, Pearson Education Asia.

2 Harry R. Lewis and Christos H. Papadimitriou, Elements of the Theory of Computation,

Pearson Education Asia.

3 Dexter C. Kozen, Automata and Computability, Undergraduate Texts in Computer Science,

Springer.

4 Michael Sipser, Introduction to the Theory of Computation, PWS Publishing.

5 John Martin, Introduction to Languages and the Theory of Computation, Tata McGraw Hill.

18B17CI571 Operating Systems Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. To familiarize students with the architecture of Unix OS.

2. To provide necessary skills for developing and debugging programs in UNIX environment.

Course Contents:


1 Study and Identification of standard desktop personal computer

2 Understanding of Motherboard and its interfacing components

3 Install and configure computer drivers and system components.

4 Disk formatting, partitioning and Disk operating system commands

5 Install, upgrade and configure Windows operating systems.

6 Remote desktop connections and file sharing.

7 Identify, Install and manage network connections Configuring IP address and Domain name

system

8 Install, upgrade and configure Linux operating systems.

9 Installation Antivirus and configure the antivirus.

10 Installation of printer and scanner software.

11 Disassembly and Reassembly of hardware.

12 Trouble shooting and Managing Systems

Course Outcomes:

1. Appreciate the advantages of Unix OS

2. Develop and debug, C programs created on UNIX platforms.

3. Use and if necessary install standard libraries.

Evaluation Scheme:




Total 100 Marks


63 | P a g e

18B17CI572

Advance Programming Lab

L-T-P

0-0-4

2 Credits

Course Objectives:

In this laboratory after completing experiments student has to learn how to analyze a problem &

design the solution for the problem. In addition to that, solution must be optimum, i.e., time

complexity & memory usage of the solution must be very low. They will be able to find the optimal

solution of the problems using advance algorithms design technique.

Course Contents:


1 Dynamic Programming

2 Greedy Programming

3 Van Emde Boas Priority Queues

4 Pattern finding and Design Problems

5 Randomized Algorithms

6 Advance Graph Algorithms

7 Advance tree structures

8 Linear Programming

9 Parallel Algorithms

Course Outcomes:

1 Develop the dynamic programming algorithms, and analyze it to determine its computational

complexity.

2 For a given model engineering problem model it using graph and write the corresponding

algorithm to solve the problems.

3 Explain the ways to analyze randomized algorithms (expected running time, probability of

error).

4 Explain what an approximation algorithm is. Compute the approximation factor of an

approximation algorithm (PTAS and FPTAS).

Evaluation Scheme:




Total 100 Mark


64 | P a g e

18B19CI591

Minor Project

L-T-P

0-0-2

1 Credit

Course Objectives:

Student should learn to implementation of real world problems and their solution

Course Contents:

Students works in teams on projects related to real world problems based on advance field of

studies like machine learning , data mining, Artificial Intelligence , Image processing, Cloud

Computing , Big data and data analytics

Course Outcomes:

Student should be able to analyse the real world software requirement and should be able to

implement the project according to customer need

Evaluation Scheme:

Project Report and Continuous Evaluation 50 Marks



Total 100 Marks


65 | P a g e


B.Tech. (CSE& IT)

Course Curriculum

Sixth Semester

VI Semester (B6)

Sr.

No. Category



1 OE - II 3 0 0 3 3

2 DE - III 3 0 0 3 3

3 DE - IV 3 0 0 3 3

4 Core 18B11CI611 Computer Networks 3 1 0 4 4

5 Core 18B11CI612 Compiler Design 3 1 0 4 4

6 Core 18B17CI671 Computer Networks Lab 0 0 2 2 1

7 Core 18B17CI672 Compiler Design Lab 0 0 2 2 1

8 Project 18B19CI691 Minor project 0 0 2 2 1

9 Mandatory 18B19GE691 Industrial Training ($) 0 0 0 0 0

Total 15 2 6 23 20

$ 6 weeks Industrial Training during summer break after VIth Semester. Evaluation will be done at the

start of VIIth Semester.


66 | P a g e

18B11CI611 Computer Networks L-T-P

3-1-0 4 Credits

Course Objectives:

1. To develop an understanding of modern network architectures from a design and performance

perspective.

2. To introduce the student to the major concepts involved in wide-area networks (WANs), local

area networks (LANs) and Wireless LANs (WLANs).

3. To provide an opportunity to do network programming

4. To provide a WLAN measurement ideas.

Course contents:

Unit 1:

Data communication Components: Representation of data and its flow Networks , Various

Connection Topology, Protocols and Standards, OSI model, Transmission Media, LAN:Wired

LAN, Wireless LANs, Connecting LAN and Virtual LAN, Techniques for Bandwidth utilization:

Multiplexing - Frequency division, Time division and Wave division, Concepts on spread

spectrum.

Unit 2:

Data Link Layer and Medium Access Sub Layer: Error Detection and Error Correction -

Fundamentals, Block coding, Hamming Distance, CRC; Flow Control and Error control protocols -

Stop and Wait, Go back – N ARQ, Selective Repeat ARQ, Sliding Window, Piggybacking,

Random Access, Multiple access protocols -Pure ALOHA, Slotted ALOHA,

CSMA/CD,CDMA/CA

Unit 3:

Network Layer: Switching, Logical addressing – IPV4, IPV6; Address mapping – ARP, RARP,

BOOTP and DHCP–Delivery, Forwarding and Unicast Routing protocols.

Unit 4:

Transport Layer: Process to Process Communication, User Datagram Protocol (UDP),

Transmission Control Protocol (TCP), SCTP Congestion Control; Quality of Service, QoS

improving techniques: Leaky Bucket and Token Bucket algorithm.

Unit 5:

Application Layer: Domain Name Space (DNS), DDNS, TELNET, EMAIL, File Transfer

Protocol (FTP), WWW, HTTP, SNMP, Bluetooth, Firewalls, Basic concepts of Cryptography


67 | P a g e

Course Outcomes:

1 Explain the functions of the different layer of the OSI Protocol.

2 Draw the functional block diagram of wide-area networks (WANs), local area networks (LANs)

and Wireless LANs (WLANs) describe the function of each block.

3 For a given requirement (small scale) of wide-area networks (WANs), local area networks

(LANs) and Wireless LANs (WLANs) design it based on the market available component

4 For a given problem related TCP/IP protocol developed the network programming.

5 Configure DNS DDNS, TELNET, EMAIL, File Transfer Protocol (FTP), WWW, HTTP,

SNMP, Bluetooth, Firewalls using open source available software and tools.



Examination and the next 2 unit will be completed by T-2 Examination. The remaining 1 unit will


Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks


1 Data Communication and Networking, 4th Edition, Behrouz A. Forouzan, McGraw- Hill.

2 Data and Computer Communication, 8th Edition, William Stallings, Pearson Prentice Hall

India.

3 Computer Networks, 8th Edition, Andrew S. Tanenbaum, Pearson New International Edition.

4 Internetworking with TCP/IP, Volume 1, 6th Edition Douglas Comer, Prentice Hall of India.

5 TCP/IP Illustrated, Volume 1, W. Richard Stevens, Addison-Wesley, United States of America.

18B11CI612 Compiler Design L-T-P

3-1-0 4 Credits

Course Objectives:

1. To understand and list the different stages in the process of compilation.

2. Identify different methods of lexical analysis

3. Design top-down and bottom-up parsers

4. Identify synthesized and inherited attributes

5. Develop syntax directed translation schemes

6. Develop algorithms to generate code for a target machine


68 | P a g e

Course contents:

The aim is to learn how to design and implement a compiler and also to study the underlying

theories. The main emphasis is for the imperative language.

Unit 1:

Introduction: Phases of compilation and overview. Lexical Analysis (scanner): Regular languages,

finite automata, regular expressions, from regular expressions to finite automata, scanner generator

(lex, flex).

Unit 2:

Syntax Analysis (Parser): Context-free languages and grammars, push-down automata, LL(1)

gram-mars and top-down parsing, operator grammars, LR(O), SLR(1), LR(1), LALR(1) grammars

and bottom up parsing, ambiguity and LR parsing, LALR(1) parser generator (yacc, bison)

Unit 3:

Semantic Analysis: Attribute grammars, syntax directed definition, evaluation and flow of attribute

in a syntax tree. Symbol Table: Its structure, symbol attributes and management.

Unit 4:

Run-time environment: Procedure activation, parameter passing, value return, memory allocation,

and scope. Intermediate Code Generation: Translation of different language features, different types

of intermediate forms. Code Improvement (optimization): Analysis: control-flow, data-flow

dependence etc.

Unit 5:

Code improvement local optimization, global optimization, loop optimization, peep-hole

optimization etc. Architecture dependent code improvement: instruction scheduling (for pipeline),

loop optimization (for cache memory) etc. Register allocation and target code generation Advanced

topics: Type systems, data abstraction, compilation of Object Oriented features and non-imperative

programming languages.

Course Outcomes:

1. For a given grammar specification develop the lexical analyser

2. For a given parser specification design top-down and bottom-up parsers

3. Develop syntax directed translation schemes

4. Develop algorithms to generate code for a target machine.






69 | P a g e

Evaluation Scheme:

Test 1 20 Marks

Test 2 20 Marks

Test 3 35 Marks


Total 100 Marks

18B17CI671 Computer Networks Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. To make students aware about various types of cables used in guided media like coaxial cable,

optical fibre cable, twisted pair cables and its categories.

2. To understand the working difference between straight cable and cross over cable.

3. To use the packet tracer to simulate various networks.

Course Contents:


1 Write a socket Program for Echo/Ping/Talk commands.

2 Create a socket (TCP) between two computers and enable file transfer between them.

3 Create a socket (UDP) between two computers and enable file transfer between them.

4 Write a program to implement Remote Command Execution. (Two M/Cs maybe used)

5 Write a code simulating ARP /RARP protocols.

6 Create a socket for HTTP for web page upload and download.

7 Write a program for TCP Unit implementation.(TCP services)

8 Write a program for File Transfer in client-server architecture using following methods.

9 RS232C (b) TCP/IP

10 Write a program to implement RMI (Remote Method Invocation)

11 Perform a case study about the different routing algorithms to select the network path with its

optimum and economical during data transfer.

a. Shortest path routing

b. Flooding

c. Distance vector

12 Implement client in C and server in Java and initiate communication between them

Course Outcomes:

1. Student will become familiar with the network simulator Packet Tracer.

2. Student will have the ability to create straight-through and cross over cables.


70 | P a g e

Evaluation Scheme:




Total 100 Marks

18B17CI672 Compiler Design Lab L-T-P

0-0-2 1 Credit

Course Objectives:

1. To understand the basics of system programs like editors, compiler, assembler, linker, loader,

interpreter and debugger.

2. Describe the various concepts of assemblers and microprocessors.

3. To understand the various phases of compiler and compare its working with assembler.

Course Contents:


1. Practice of Lex/Yacc of Compiler writing. 2. Write a program to check whether a string belongs to the grammar or not. 3. Write a program to generate a parse tree. 4. Write a program to find leading terminals. 5. Write a program to find trailing terminals. 6. Write a program to compute FIRST of non-terminals. 7. Write a program to compute FOLLOW of non-terminals. 8. Write a program to check whether a grammar is left recursive and remove recursion. 9. Write a program to remove left factoring. 10. Write a program to check whether a grammar is Operator precedent. 11. To show all the operations of a stack. 12. To show various operations i.e read, write and modify in a text file.

Course Outcomes:

1. Understand how linker and loader create an executable program from an object Unit created by

assembler and compiler.

2. Know various editors and debugging techniques.

Evaluation Scheme:




Total 100 Marks


71 | P a g e

18B19CI691

Minor Project

L-T-P

0-0-2

1 Credit

Course Objectives:


Course Contents:

Students works in teams ton projects related to real world problems based on advance field of



Course Outcomes:



Evaluation Scheme:




Total 100 Marks

18B19GE691 Industrial Training L-T-P

0-0-0 0 Credit

Course Objectives:

Objective of this course is to give the industrial exposure to student.

Course Contents:

Students work on real world projects in companies for at least 6 weeks. Satisfactory performance in

the training is required to pass the course for the partial fulfillment of the degree.

Course Outcomes:




72 | P a g e


B.Tech. (CSE& IT)

Course Curriculum

Seventh Semester

VII Semester (B7)

Sr.

No. Category



1 OE - III 3 0 0 3 3

2 DE - V 3 0 0 3 3

3 DE - VI 3 0 0 3 3

5 Project 18B19CI791 Project Part I 0 0 10 10 5

Total 9 0 10 19 14


73 | P a g e


B.Tech. (CSE& IT)

Course Curriculum

Eighth Semester

VIII Semester (B8)

Sr.

No. Category



1 OE - IV 3 0 0 3 3

2 DE - VII 3 0 0 3 3

3 Project 18B19CI891 Project Part II 0 0 16 16 8

Total 6 0 16 22 14

18B19CI791

Project Part -I

L-T-P

0-0-16

8 Credit

Course Objectives:


Course Contents:





74 | P a g e

Course Outcomes:



Evaluation Scheme:




Total 100 Marks

18B19CI891

Project Part -II

L-T-P

0-0-2

1 Credit

Course Objectives:


Course Contents:




Course Outcomes:



Evaluation Scheme:




Total 100 Marks


75 | P a g e

SYLLABUS FOR THE BASKETS OF ELECTIVE COURSES

IMPORTANT NOTE: Only keywords/topics of the course are mentioned. Faculty teaching the

course must create a detailed syllabus.

Information Retrieval & Data Mining

(18B1ACI531)

Theory of information retrieval, Information retrieval on data and information retrieval on the web

Information retrieval tools and their architecture, An example information retrieval problem,

Processing Boolean queries, The extended Boolean model versus ranked retrieval, Wild card

queries, Spelling correction , Phonetic correction , Term frequency and weighting, Vector space

model, Variant tf-idf scoring, Web as graph, PageRank, Web directory, Search engine, Meta search

engines, Web searching and search engine architecture, Searching algorithms and Page ranking

algorithms, Enhancing Technical Q&A System, Data extraction, Data cleaning, Data Integration

and transformation, Data reduction, loading and post loading, Usability and complexity analysis of

Bayesian, Nearest neighbor, Decision tree based and rule based algorithms, Usability and

complexity analysis of Agglomerative Hierarchical, K-means partitioning algorithms, Usability and

complexity analysis of Apriori, sampling, partitioning, and multiple minimum support algorithms.

Software Engineering (18B1ACI533)

Introduction to Software Engineering Principles, Software process models, Personal software

process, Team software process, Requirement engineering, Software requirement

specifications, Analysis and UML modelling, Software Construction, Coding style and practices,

Design patterns. Software estimation – COCOMO model, Putnam model. Software metrics. Coding

standard and practices. Software testing. Software maintenance. CASE Tools. Introduction to

software engineering for web and mobile applications.

Cloud Computing (18B1ACI534)

Trends of computing, Overview of Distributed Computing, Introduction to Cloud Computing,

Issues and Challenges, Cloud Architecture , Cloud Services, Infrastructure as a Service (IaaS),

Platform as a Service (PaaS), Software as a Service (SaaS), Virtualization Technology, Role of

Virtualization in Cloud Computing, Virtual Machines Monitors (VMM), Virtualization Techniques,

Virtualization of resources, Managing data-storage & processing. Scaling, Cloud Security, Case

Studies. Open source and Commercial clouds Amazon Web Services- Elastic Cloud Compute,

Google Application Engine, windows Azure.

Advance Computer Architecture (18B1ACI535)

Context for modern computer systems engineering, including: Dimensions for the classification of

computer systems, Persistent trends in embedded systems Forms of parallelism, Performance


76 | P a g e

evaluation Architectural developments. Interleaved memory - structure, performance, Virtual

memory - utilisation, locality of reference, performance, Paged memory - structure, challenges,

address translation, optimisation, Cache memory - structure, performance, implementation,

optimisation. SIMD architectures - vector computation, SIMD instruction set extensions, MIMD

architectures - cache coherence, cache restriction, broadcast-based cache writes, snoop bus,

directory coherence, MESI, models of consistency, Processor interconnection - principles of

processor interconnection, network topologies, implementations, properties, performance, cost.

Soft Computing (18B1ACI631)

Genetic Algorithms: Introduction to Genetic Algorithms, Genetic Operators and Parameters,

Genetic Algorithms in Problem Solving, Theoretical Foundations of Genetic Algorithms,

Implementation Issues. Artificial Neural Networks: An Introduction, Supervised Learning

Networks, Associative Memory Network, Unsupervised Learning Networks, Computing with

Neural Nets and Applications of Neural Network. Fuzzy Sets: Introduction to Fuzzy Sets,

Operations on Fuzzy sets, Fuzzy Relations, Fuzzy Measures, Applications of Fuzzy Set Theory to

different branches of Science and Engineering.

Microprocessor and Controllers (18B1ACI632)

Interactive systems. Evolution of microprocessors. Intel 8086 family Processors and 8051

controller – Architecture, Functions, Programming. Addressing modes. Hardware specification.

Memory interface. Interrupts. I/O interfacing. Direct memory access and DMA controlled I/O.

Serial data communications. Introduction to Embedded systems. System design notations. System

testing. Introduction to processors for Mobile devices.

Distributed and Parallel Computing (18B1ACI633)

Review of principles and concepts as a foundation to Distributed Systems. Clock Synchronization,

Global state collection mechanisms. Election Algorithms. Termination Detection. Distributed

mutual exclusion, Solutions using message passing. Process deadlocks in DS. Agreement Protocols.

Consistency and Replicated Data Management. Fault Tolerance and Reliability. Self-Stabilizing

Systems. Distributed Computing Vs Cloud Computing.

Artificial Intelligence (18B1ACI634)

History and foundations of AI. Problem solving and intelligent agents. Problem solving and search

(blind, informed, constraint satisfaction, adversarial). Knowledge representation and reasoning in

deterministic environments (logic, semantic networks, frames). Knowledge representation and

reasoning in probabilistic environments (Bayesian networks). Decision making. Planning.

Learning.

Cryptography and Network Security (18B1ACI636)


77 | P a g e

Network security services, cryptography as security mechanism, Mathematics for Cryptography –

Modular arithmetic, Finite fields, Primality testing, Discrete Logarithms and Chinese Remainder

theorem, Symmetric key cryptosystems – Fiestel Cipher, DES, AES,RC4 Asymmetric

Cryptosystems – Diffie Hellman Protocol, RSA, ECC etc. Message Authentication and Integrity

Codes, Hashing – MD5, SHA-1. Virtual private networks, IPSec and Transport Layer Security,

Security in Diverse Networked Devices e.g. Mobile Phones / RFID Based Systems / Sensors,

Intrusion Detection Systems, Trusted Computing Base.

Embedded System (18B1ACI635)

Introduction: Definition; Scope; Common properties: Growing importance of embedded system;

Examples. Design Issues: Timing; Quality of services; Dependability; Safety critical; Resource

management; PSP for Embedded system. Embedded Processors and its Memory: 8 bit

accumulator processors; Example 8 bit architectures; Microcontrollers; Data processors;

Comparison of various embedded processors (Intel, Motorola, etc).Peripheral Programming

: Timer and Counter; Serial communication; Interrupt; LCD Interface; DMA controller; Analogue

to digital conversion techniques; GPS Interface; Bluetooth and Ethernet Interface; Wireless

communication (XBee); Camera and various other sensors. Specification Techniques : Models of

computation; Communication methods; State charts; Petri Nets; Real-Time UML diagram;

Software for embedded systems; Debugging techniques Design Technologies : Synthesis Levels-

logic, register, behavior and system synthesis; Hardware/Software Co-design. Detailed design of

Embedded Autonomous system: Sensors; Actuators; Feedback control system; Using Arduino

boards. Validation and verification : Formal verification and simulation; Simulation speed;

Testing issues; Hardware/Software co-simulators; Emulators; Fault tolerance; Power consumption.

Mobile Computing (18B1ACI731)

Introduction to mobile computing: Applications, mobile and wireless devices, history of wireless

communication, open research topics, simplified reference model, Wireless Transmission, Medium

Access Control. Telecommunication Systems: GSM, UMTS, UTRAN, Core Network, Handover.

Wireless LAN, IEEE802.11, 802.11b, 802.11a, HIPERLAN, Bluetooth. Mobile network Layer,

Mobile transport layer, Mobility, Mobile Operating Systems: Android OS, IOS , Mobile

networking, Quality of Service in Mobile Networks, Mobile access to World-Wide-Web, Mobile

Data Management, Mobile Transactions, Mobile Computing Models.

Image Processing (18B1ACI733)

Taxonomy of digital images and applications, Color Models: RGB, CMYK, HLS, HSV, YIQ,

YUV, YCrCb. Spatial domain processing-Half toning, dithering, geometric transformations,

enhancement of gray images, color images, and range images. Frequency domain processing-

Fourier and Cosine transformation based processing of gray and color images. Image Registration

& Morphological Processing, color image processing, Computer Vision Algorithms, Domain

specific applications.

Machine Learning

(18B1ACI732)


78 | P a g e

This course provides a broad introduction to machine learning and statistical pattern recognition.

Topics include: supervised learning (generative/discriminative learning, parametric/non-parametric

learning, neural networks, and support vector machines); unsupervised learning (clustering,

dimensionality reduction, kernel methods); learning theory (bias/variance tradeoffs; VC theory;

large margins); reinforcement learning and adaptive control. The course will also discuss recent

applications of machine learning, such as to robotic control, data mining, autonomous navigation,

bioinformatics, speech recognition, and text and web data processing.

Computer Graphics & Applications

(18B1ACI735)

Introduction: Context, Requirements, and Application, Graphics Pipeline and Hardware: Display

Unit, Frame buffer, DPU, GPU, Data structures and algorithms for Raster Graphics: Line, circle,

ellipse, polygon,, Area filling, 2D and 3D Planer and Curved objects: Data structures

for modelling; Algorithms for Mesh generation, Clipping, 2D and 3D

Geometric Transformations, etc. Rendering and animation: Data Structures, Algorithms and

hardware support. Procedural modelling: Fractals and particle systems.

Graph Algorithms and Applications

(18B1ACI734)

Overview graph – Isomorphism – Sub graphs – Walks, Paths, Circuits – Connectedness –

Components – Euler Graphs – Hamiltonian Paths and Circuits, trees, planar graphs Spanning trees

– Fundamental Circuits –Spanning Trees in a Weighted Graph – Cut Sets –Fundamental Circuits,

Connectivity and Separability – Network flows, 1-Isomorphism – 2-Isomorphism –Planer Graphs –

Different Representation of a Planer Graph. Incidence matrix – Sub matrices – Circuit Matrix –

Path Matrix – Adjacency Matrix, Chromatic partitioning –- Matching – Covering – Four Color

Problem – Directed, Algorithms: Connectedness and Components – Spanning tree – Finding all

Spanning Trees of a Graph, Cut Vertices and Separability Algorithms: Shortest Path Algorithm –

DFS – Planarity Testing – Isomorphism, General applications of graphs such as scheduling,

bioinformatics, circuit design and communication networks, Genetic algorithms for graph

applications Neural networks for graph applications Graph, applications in Bioinformatics

,Algorithms for transportation problems, Graph algorithms for networks/telecommunication

problems.

Software Construction (18B1ACI736)

Introduction to software constructions, Design concepts, heuristics, challenges and practices.

Software Design Patterns, Designing Good OO design, High quality routines, Layouts and Styles in

coding, Self-documenting code, Assertions, Secure Coding practices, Defensive programming,

Generic Programming, Concurrency in programming and Pseudo code Programming process.

Collaborative construction, Debugging, Refactoring, Code Tuning, Logging, Code Profiling.

Programming Tools: design, source code, executable code, build, release and version control tools.

Natural Language Processing (18B1ACI831)

Applications and Challenges, Rationalist and Empiricist approach, Dirty Hands, NLTK,

Gensim, LingPipe, Probability Theory, Bayes Theorem, Expectation and Variance, Standard


79 | P a g e

distributions, Information Theory, Entropy, Relative Entropy, Joint Entropy, Entropy of English,

Frequency, Mean and Variance, Hypothesis Testing, MI, Parsing, Morphology, Building Ngram

Model, Statistical Estimator, MLE, Cross validation, Combining Estimators, Simple Linear

estimators, General Linear Interpolation, Pseudo-words, Supervised, Bayesian, Dictionary Based,

Disambiguation based on sense definition, Thesaurus Based, Unsupervised Disambiguation,

Linguistic Essentials, Markov Models, Hidden Markov models, HMM properties, variants, POS,

Markov model taggers, Hidden Markov model taggers , Tagging Accuracy and applications of

tagging, Probabilistic parsing , RE and Automata, LSI, Machine Translation, Text Categorization.

Advanced Data Structures (18B1ACI832)

This course covers major results and current research in data structures. The course includes

following topics: Introduction to Persistence and Retroactivity in data structures, Memory Efficient

List, Skip List. Self-Organizing Lists and Competitive Analysis, Red Black Trees, Splay trees,

Geometric view, Link-cut trees, Heavy-light decomposition, Euler tour trees, Suffix tree, Suffix

array, Linear-time construction for large alphabets, Suffix tray, Rank, Select, Tries, Compact suffix

arrays and trees, Models, Predecessor problem, Van Emde Boas, x-fast and y-fast trees, indirection,

Fusion trees.

Multimedia Computing (18B1ACI833)

Introduction to multimedia, multimedia authorizing and processing tools, multimedia data

representation; basics of digital video and audio; text, image, and video compression standards;

image and video formats – GIF, TIFF, JPEG, MPEG-2, MPEG-4, MPEG-7, H.261, H.264; audio

representation on computers, audio coders, acoustic models and speech signal processing and

modulation, speech input and output, speech transmission, audio and video synchronization;

multimedia content analysis, metrics and measures for image, video, and audio quality; standards

for multimedia communications, multimedia streaming, live / on-demand broadcasting.

Documents

JAYPEE UNIVERSITY, ANOOPSHAHR Jaypee University