JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD B.Tech.

in COMPUTER SCIENCE AND

ENGINEERING
COURSE STRUCTURE & SYLLABUS (R18)
Applicable From 2018-19 Admitted Batch
I YEAR I SEMESTER
S. No. Course Course Title L T P
Code
1 MA101BS Mathematics - I 3 1 0
2 CH102BS Chemistry 3 1 0
3 EE103ES Basic Electrical Engineering 3 0 0
4 ME105ES Engineering Workshop 1 0 3
5 EN105HS English 2 0 0
6 CH106BS Engineering Chemistry Lab 0 0 3
7 EN107HS English Language and Communication Skills Lab 0 0 2
8 EE108ES Basic Electrical Engineering Lab 0 0 2
Induction Programme
Total Credits 12 2 10
I YEAR II SEMESTER
S. No. Course Course Title L T P
Code
1 MA201BS Mathematics - II 3 1 0
2 AP202BS Applied Physics 3 1 0
3 CS203ES Programming for Problem Solving 3 1 0
4 ME204ES Engineering Graphics 1 0 4
5 AP205BS Applied Physics Lab 0 0 3
6 CS206ES Programming for Problem Solving Lab 0 0 3
7 *MC209ES Environmental Science 3 0 0
Total Credits 13 3 10
II YEAR I SEMESTER
S. No. Course Course Title L T P
Code
1 CS301ES Analog and Digital Electronics 3 0 0
2 CS302PC Data Structures 3 1 0
3 MA303BS Computer Oriented Statistical Methods 3 1 0
4 CS304PC Computer Organization and Architecture 3 0 0
5 CS305PC Object Oriented Programming using C++ 2 0 0
6 CS306ES Analog and Digital Electronics Lab 0 0 2
7 CS307PC Data Structures Lab 0 0 3
8 CS308PC IT Workshop Lab 0 0 3
9 CS309PC C++ Programming Lab 0 0 2
10 *MC309 Gender Sensitization Lab 0 0 2
Total Credits 14 2 12
UTER SCIENCE AND

Credits

4
4
3
2.5
2
1.5
1
1

19

Credits

4
4
4
3
1.5
1.5
0
18

Credits

3
4
4
3
2
1
1.5
1.5
1
0
21
 II YEAR II SEMESTER
S. No. Course Course Title L T P Credits
Code
1 CS401PC Discrete Mathematics 3 0 0 3
2 SM402MS Business Economics & Financial Analysis 3 0 0 3
3 CS403PC Operating Systems 3 0 0 3
4 CS404PC Database Management Systems 3 1 0 4
5 CS405PC Java Programming 3 1 0 4
6 CS406PC Operating Systems Lab 0 0 3 1.5
7 CS407PC Database Management Systems Lab 0 0 3 1.5
8 CS408PC Java Programming Lab 0 0 2 1
9 *MC409 Constitution of India 3 0 0 0
Total Credits 18 2 8 21
III YEAR I SEMESTER
S. No. Course Course Title L T P Credits
Code
1 CS501PC Formal Languages & Automata Theory 3 0 0 3
2 CS502PC Software Engineering 3 0 0 3
3 CS503PC Computer Networks 3 0 0 3
4 CS504PC Web Technologies 3 0 0 3
5 Professional Elective-I 3 0 0 3
6 Professional Elective -II 3 0 0 3
7 CS505PC Software Engineering Lab 0 0 3 1.5
8 CS506PC Computer Networks & Web Technologies Lab 0 0 3 1.5
9 EN508HS Advanced Communication Skills Lab 0 0 2 1
10 *MC510 Intellectual Property Rights 3 0 0 0
Total Credits 21 0 8 22
III YEAR II SEMESTER
S. No. Course Course Title L T P Credits
Code
1 CS601PC Machine Learning 3 1 0 4
2 CS602PC Compiler Design 3 1 0 4
3 CS603PC Design and Analysis of Algorithms 3 1 0 4
4 Professional Elective – III 3 0 0 3
5 Open Elective-I 3 0 0 3
6 CS604PC Machine Learning Lab 0 0 3 1.5
7 CS605PC Compiler Design Lab 0 0 3 1.5
8 Professional Elective-III Lab 0 0 2 1
9 *MC609 Environmental Science 3 0 0 0
Total Credits 18 3 8 22
IV YEAR I SEMESTER
S. No. Course Code Course Title L T P

1 CS701PC Cryptography & Network Security 3 0 0

2 CS702PC Data Mining 2 0 0
3 Professional Elective -IV 3 0 0
4 Professional Elective -V 3 0 0
5 Open Elective - II 3 0 0
6 CS703PC Cryptography & Network Security Lab 0 0 2
7 CS704PC Industrial Oriented Mini Project/ Summer Internship 0 0 0
8 CS705PC Seminar 0 0 2
9 CS706PC Project Stage - I 0 0 6
Total Credits 14 0 10
Credits

3
3
3
4
4
1.5
1.5
1
0
21

Credits

3
3
3
3
3
3
1.5
1.5
1
0
22

Credits

4
4
4
3
3
1.5
1.5
1
0
22

Credits

3
2
3
3
3
1
2*
1
3
21
 IV YEAR II SEMESTER
S. No. Course Course Title L T P
Code
1 SM801MS Organizational Behaviour 3 0 0
2 Professional Elective - VI 3 0 0
3 Open Elective - III 3 0 0
4 CS802PC Project Stage - II 0 0 14
Total Credits 9 0 14
*MC - Environmental Science – Should be Registered by Lateral Entry Students Only.
*MC – Satisfactory/Unsatisfactory
Note: Industrial Oriented Mini Project/ Summer Internship is to be carried out during the summer
vacation between 6th and 7th semesters. Students should submit report of Industrial Oriented Mini Projec
Summer Internship for evaluation.
Professional Elective - I
CS511PE Information Theory & Coding
CS512PE Advanced Computer Architecture
CS513PE Data Analytics
CS514PE Image Processing
CS515PE Principles of Programming Languages
Professional Elective - II
CS521PE Computer Graphics
CS522PE Advanced Operating Systems
CS523PE Informational Retrieval Systems
CS524PE Distributed Databases
CS525PE Natural Language Processing
Professional Elective - III
CS611PE Concurrent Programming
CS612PE Network Programming
CS613PE Scripting Languages
CS614PE Mobile Application Development
CS615PE Software Testing Methodologies
#
Courses in PE - III and PE - III Lab must be in 1-1 correspondence.
Professional Elective - IV
CS711PE Graph Theory
CS712PE Introduction to Embedded Systems
CS713PE Artificial Intelligence
CS714PE Cloud Computing
CS715PE Ad-hoc & Sensor Networks
 Credits

3
3
3
7
16

during the summer

al Oriented Mini Project/
 Professional Elective - V
CS721PE Advanced Algorithms
CS722PE Real Time Systems
CS723PE Soft Computing
CS724PE Internet of Things
CS725PE Software Process & Project Management
Professional Elective – VI
CS811PE Computational Complexity
CS812PE Distributed Systems
CS813PE Neural Networks & Deep Learning
CS814PE Human Computer Interaction
CS815PE Cyber Forensics
MA101BS: MATHEMATICS - I
B.Tech. I Year I Sem. L T P
3 1 0
Course Objectives: To learn
 Types of matrices and their properties.
 Concept of a rank of the matrix and applying this concept to know the consistency and solving the syst
of linear equations.
 Concept of Eigen values and eigenvectors and to reduce the quadratic form to canonical form.
 Concept of Sequence.
 Concept of nature of the series.
 Geometrical approach to the mean value theorems and their application to the mathematical problems
 Evaluation of surface areas and volumes of revolutions of curves.
 Evaluation of improper integrals using Beta and Gamma functions.
 Partial differentiation, concept of total derivative
 Finding maxima and minima of function of two and three variables.

Course Outcomes: After learning the contents of this paper the student must be able to
 Write the matrix representation of a set of linear equations and to analyse the solution of the system o
equations
 Find the Eigen values and Eigen vectors
 Reduce the quadratic form to canonical form using orthogonal transformations.
 Analyse the nature of sequence and series.
 Solve the applications on the mean value theorems.
 Evaluate the improper integrals using Beta and Gamma functions
 Find the extreme values of functions of two variables with/ without constraints.

UNIT-I: Matrices
Matrices: Types of Matrices, Symmetric; Hermitian; Skew-symmetric; Skew-Hermitian; orthogonal
matrices; Unitary Matrices; rank of a matrix by Echelon form and Normal form, Inverse of Non-singular
matrices by Gauss-Jordan method; System of linear equations; solving system of Homogeneous and Non-
Homogeneous equations. Gauss elimination method; Gauss Seidel Iteration Method.

UNIT-II: Eigen values and Eigen vectors

Linear Transformation and Orthogonal Transformation: Eigen values and Eigenvectors and their
properties: Diagonalization of a matrix; Cayley-Hamilton Theorem (without proof); finding inverse and pow
of a matrix by Cayley-Hamilton Theorem; Quadratic forms and Nature of the Quadratic Forms;
Reduction of Quadratic form to canonical forms by Orthogonal Transformation
UNIT-III: Sequences & Series
Sequence: Definition of a Sequence, limit; Convergent, Divergent and Oscillatory sequences.
Series: Convergent, Divergent and Oscillatory Series; Series of positive terms; Comparison test, p-test, D-
Alembert’s ratio test; Raabe’s test; Cauchy’s Integral test; Cauchy’s root test; logarithmic test.
Alternating series: Leibnitz test; Alternating Convergent series: Absolute and Conditionally
Convergence.

UNIT-IV: Calculus
Mean value theorems: Rolle’s theorem, Lagrange’s Mean value theorem with their Geometrical
Interpretation and applications, Cauchy’s Mean value Theorem. Taylor’s Series.
Applications of definite integrals to evaluate surface areas and volumes of revolutions of curves (Only in
Cartesian coordinates), Definition of Improper Integral: Beta and Gamma functions and their
applications.
UNIT-V: Multivariable calculus (Partial Differentiation and applications)
Definitions of Limit and continuity.
Partial Differentiation; Euler’s Theorem; Total derivative; Jacobian; Functional dependence &
independence, Maxima and minima of functions of two variables and three variables using method of
Lagrange multipliers.

TEXTBOOKS:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006.
3. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint, 2002.

REFERENCES:
1. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications, Repri
2008.
2. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11 thReprint,
2010.

CH102BS/CH202BS: CHEMISTRY
B.Tech. I Year I Sem. L T P
3 1 0
Course Objectives:
 To bring adaptability to the concepts of chemistry and to acquire the required skills to become a perfec
engineer.
 To impart the basic knowledge of atomic, molecular and electronic modifications which makes the stud
to understand the technology based on them.
 To acquire the knowledge of electrochemistry, corrosion and water treatment which are essential for th
Engineers and in industry.
 To acquire the skills pertaining to spectroscopy and to apply them for medical and other fields.
 To impart the knowledge of stereochemistry and synthetic aspects useful for understanding
reaction pathways
Course Outcomes: The basic concepts included in this course will help the student to gain:
 The knowledge of atomic, molecular and electronic changes, band theory related to conductivity.
 The required principles and concepts of electrochemistry, corrosion and in understanding the problem
water and its treatments.
 The required skills to get clear concepts on basic spectroscopy and application to medical and other fie
 The knowledge of configurational and conformational analysis of molecules and reaction
mechanisms.

UNIT - I:
Molecular structure and Theories of Bonding: Atomic and Molecular orbitals. Linear Combination of Atomic
Orbitals (LCAO), molecular orbitals of diatomic molecules, molecular orbital energy level diagrams of N2, O
F molecules. π molecular orbitals of butadiene and benzene.
2
Crystal Field Theory (CFT): Salient Features of CFT – Crystal Field Splitting of transition metal ion d- orbita
in Tetrahedral, Octahedral and square planar geometries. Band structure of solids and effect of
doping on conductance.

UNIT - II:
Water and its treatment: Introduction – hardness of water – Causes of hardness - Types of hardness: tempor
and permanent – expression and units of hardness – Estimation of hardness of water by complexometric
method. Potable water and its specifications. Steps involved in treatment of water – Disinfection of wate
by chlorination and ozonization. Boiler feed water and its treatment – Calgon conditioning, Phosphat
conditioning and Colloidal conditioning. External treatment of water – Ion exchange process.
Desalination of water – Reverse osmosis. Numerical problems.

UNIT - III:
Electrochemistry and corrosion: Electro chemical cells – electrode potential, standard electrode
potential, types of electrodes – calomel, Quinhydrone and glass electrode. Nernst equation
Determination of pH of a solution by using quinhydrone and glass electrode. Electrochemical series and its
applications. Numerical problems. Potentiometric titrations. Batteries – Primary (Lithium cell) and second
batteries (Lead – acid storage battery and Lithium ion battery).
Causes and effects of corrosion – theories of chemical and electrochemical corrosion – mechanism of
electrochemical corrosion, Types of corrosion: Galvanic, water-line and pitting corrosion. Factors
affecting rate of corrosion, Corrosion control methods- Cathodic protection – Sacrificial anode and
impressed current cathodic methods. Surface coatings – metallic coatings – methods of application.
Electroless plating of Nickel.

UNIT - IV:
Stereochemistry, Reaction Mechanism and synthesis of drug molecules: Introduction to representa
of 3-dimensional structures, Structural and stereoisomers, configurations, symmetry and chirality.
Enantiomers, diastereomers, optical activity and Absolute configuration. Conformation alanalysis of n
butane.
Substitution reactions: Nucleophilic substitution reactions: Mechanism of S 1, S 2 reactions.
N N Electrophilic and nucleophilic addition reactio
Addition of HBr to propene. Markownikoff and anti Markownikoff’s additions. Grignard additions on carbo
compounds. Elimination reactions: Dehydro halogenation of alkylhalides. Saytzeff rule. Oxidation reactions: Oxidation of alcohols using KMnO4 and
chromic acid.
Reduction reactions: reduction of carbonyl compounds using LiAlH & NaBH . Hydroboration of olefins.
4 4
Structure, synthesis and pharmaceutical applications of Paracetamol and Aspirin.
UNIT - V:
Spectroscopic techniques and applications: Principles of spectroscopy, selection rules and applications
electronic spectroscopy. vibrational and rotational spectroscopy. Basic concepts of Nuclear magneti
resonance Spectroscopy, chemical shift. Introduction to Magnetic resonance
imaging.

TEXT BOOKS:
1. Physical Chemistry, by P.W. Atkins
2. Engineering Chemistry by P.C.Jain & M.Jain; Dhanpat Rai Publishing Company (P) Ltd., New Delhi.
3. Fundamentals of Molecular Spectroscopy, by C.N. Banwell
4. Organic Chemistry: Structure and Function by K.P.C. Volhardt and N.E.Schore, 5th Edition.
5. University Chemistry, by B.M. Mahan, Pearson IV Edition.
6. Engineering Chemistry (NPTEL Web-book), by B.L. Tembe, Kamaluddin and M.S. Krishnan

EE103ES/EE203ES: BASIC ELECTRICAL ENGINEERING

B.Tech. I Year I Sem. L T P
3 0 0
Course Objectives:
 To introduce the concepts of electrical circuits and its components
 To understand magnetic circuits, DC circuits and AC single phase & three phase circuits
 To study and understand the different types of DC/AC machines and Transformers.
 To import the knowledge of various electrical installations.
 To introduce the concept of power, power factor and its improvement.

Course Outcomes:
 To analyze and solve electrical circuits using network laws and theorems.
 To understand and analyze basic Electric and Magnetic circuits
 To study the working principles of Electrical Machines
 To introduce components of Low Voltage Electrical Installations

UNIT-I: D.C. Circuits

Electrical circuit elements (R, L and C), voltage and current sources, KVL&KCL, analysis of simple circuits
with dc excitation. Superposition, Thevenin and Norton Theorems.
Time-domain analysis of first-order RL and RC circuits.

UNIT-II: A.C. Circuits

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 in series R-L-C circuit.
Three-phase balanced circuits, voltage and current relations in star and delta connections.

UNIT-III: Transformers
Ideal and practical transformer, equivalent circuit, losses in transformers, regulation and efficiency.
Auto-transformer and three-phase transformer connections.
UNIT-IV: Electrical Machines
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 spe
control of separately excited dc motor.
Construction and working of synchronous generators.
UNIT-V: Electrical Installations
Components of LT Switchgear: Switch Fuse Unit (SFU), MCB, ELCB, MCCB, Types of Wires and Cables,
Earthing. Types of Batteries, Important Characteristics for Batteries. Elementary calculations for energy
consumption, power factor improvement and battery backup.

TEXT BOOKS/REFERENCE BOOKS:

1. Basic Electrical Engineering - D.P. Kothari and I.J. Nagrath, 3rd edition 2010, Tata McGraw Hill.
2. D.C. Kulshreshtha, “Basic Electrical Engineering”, McGraw Hill, 2009.
3. L.S. Bobrow, Fundamentals of Electrical Engineering”, Oxford University Press, 2011
4. Electrical and Electronics Technology, E. Hughes, 10th Edition, Pearson, 2010
5. Electrical Engineering Fundamentals, Vincent Deltoro, Second Edition, Prentice Hall India, 1989.

ME105ES/ME205ES: ENGINEERING WORKSHOP

B.Tech. I Year I Sem. L T P
1 0 3
Pre-requisites: Practical skill
Course Objectives:
 To Study of different hand operated power tools, uses and their demonstration.
 To gain a good basic working knowledge required for the production of various engineering products.
 To provide hands on experience about use of different engineering materials, tools, equipments and
processes those are common in the engineering field.
 To develop a right attitude, team working, precision and safety at work place.
 It explains the construction, function, use and application of different working tools, equipment and
machines.
 To study commonly used carpentry joints.
 To have practical exposure to various welding and joining processes.
 Identify and use marking out tools, hand tools, measuring equipment and to work to prescribed
tolerances.

Course Outcomes: At the end of the course, the student will be able to:
 Study and practice on machine tools and their operations
 Practice on manufacturing of components using workshop trades including pluming, fitting, carpentry,
foundry, house wiring and welding.
 Identify and apply suitable tools for different trades of Engineering processes including drilling, materia
removing, measuring, chiseling.
 Apply basic electrical engineering knowledge for house wiring practice.

1. TRADES FOR EXERCISES:

At least two exercises from each trade:
I. Carpentry – (T-Lap Joint, Dovetail Joint, Mortise & Tenon Joint)
II. Fitting – (V-Fit, Dovetail Fit & Semi-circular fit)
III. Tin-Smithy – (Square Tin, Rectangular Tray & Conical Funnel)
IV. Foundry – (Preparation of Green Sand Mould using Single Piece and Split Pattern)
V. Welding Practice – (Arc Welding & Gas Welding)
VI. House-wiring – (Parallel & Series, Two-way Switch and Tube Light)
VII. Black Smithy – (Round to Square, Fan Hook and S-Hook)
2. TRADES FOR DEMONSTRATION & EXPOSURE:
Plumbing, Machine Shop, Metal Cutting (Water Plasma), Power tools in construction and Wood Working

TEXT BOOKS:
1. Workshop Practice /B. L. Juneja / Cengage
2. Workshop Manual / K. Venugopal / Anuradha.
REFERENCE BOOKS:
1. Work shop Manual - P. Kannaiah/ K. L. Narayana/ SciTech
2. Workshop Manual / Venkat Reddy/ BSP
EN105HS/EN205HS: ENGLISH
B.Tech. I Year I Sem. L T P
2 0 0
INTRODUCTION
In view of the growing importance of English as a tool for global communication and the consequent
emphasis on training students to acquire language skills, the syllabus of English has been designed to
develop linguistic, communicative and critical thinking competencies of Engineering students.

In English classes, the focus should be on the skills development in the areas of vocabulary, grammar,
reading and writing. For this, the teachers should use the prescribed text for detailed study. The
students should be encouraged to read the texts leading to reading comprehension and different
passages may be given for practice in the class. The time should be utilized for working out the
exercises given after each excerpt, and also for supplementing the exercises with authentic materials of a
similar kind, for example, newspaper articles, advertisements, promotional material etc. The focus in this
syllabus is on skill development, fostering ideas and practice of language skills in various contexts
and cultures.

Learning Objectives: The course will help to

 Improve the language proficiency of students in English with an emphasis on Vocabulary,
Grammar, Reading and Writing skills.
 Equip students to study academic subjects more effectively and critically using the theoretical and
practical components of English syllabus.
 Develop study skills and communication skills in formal and informal situations.

Course Outcomes: Students should be able to

 Use English Language effectively in spoken and written forms.
 Comprehend the given texts and respond appropriately.
 Communicate confidently in various contexts and different cultures.
 Acquire basic proficiency in English including reading and listening comprehension, writing and speakin
skills.

SYLLABUS UNIT –I
‘The Raman Effect’ from the prescribed textbook ‘English for Engineers’ published by Cambridge Univers
Press.
Vocabulary Building: The Concept of Word Formation --The Use of Prefixes and Suffixes. Grammar: Identifyi
Common Errors in Writing with Reference to Articles and Prepositions. Reading: Reading and Its Importanc
Techniques for Effective Reading.
Basic Writing Skills: Sentence Structures -Use of Phrases and Clauses in Sentences- Importance of Proper
Punctuation- Techniques for writing precisely – Paragraph writing – Types, Structures and
Features of a Paragraph - Creating Coherence-Organizing Principles of Paragraphs in Documents.
UNIT –II
‘Ancient Architecture in India’ from the prescribed textbook ‘English for Engineers’ published by Cambridge
University Press.
Vocabulary: Synonyms and Antonyms.
Grammar: Identifying Common Errors in Writing with Reference to Noun-pronoun Agreement and
Subject-verb Agreement.
Reading: Improving Comprehension Skills – Techniques for Good Comprehension
Writing: Format of a Formal Letter-Writing Formal Letters E.g.., Letter of Complaint, Letter of
Requisition, Job Application with Resume.

UNIT –III
‘Blue Jeans’ from the prescribed textbook ‘English for Engineers’ published by Cambridge University Pre
Vocabulary: Acquaintance with Prefixes and Suffixes from Foreign Languages in English to form Derivative
Words from Foreign Languages and their Use in English.
Grammar: Identifying Common Errors in Writing with Reference to Misplaced Modifiers and Tenses.
Reading: Sub-skills of Reading- Skimming and Scanning
Writing: Nature and Style of Sensible Writing- Defining- Describing Objects, Places and Events –
Classifying- Providing Examples or Evidence

UNIT –IV
‘What Should You Be Eating’ from the prescribed textbook ‘English for Engineers’ published by Cambridge
University Press.
Vocabulary: Standard Abbreviations in English
Grammar: Redundancies and Clichés in Oral and Written Communication.
Reading: Comprehension- Intensive Reading and Extensive Reading
Writing: Writing Practices--Writing Introduction and Conclusion - Essay Writing-Précis Writing.

UNIT –V
‘How a Chinese Billionaire Built Her Fortune’ from the prescribed textbook ‘English for Engineers’ publis
by Cambridge University Press.
Vocabulary: Technical Vocabulary and their usage
Grammar: Common Errors in English
Reading: Reading Comprehension-Exercises for Practice
Writing: Technical Reports- Introduction – Characteristics of a Report – Categories of Reports
Formats- Structure of Reports (Manuscript Format) -Types of Reports - Writing aReport.

TEXT BOOK:
1. Sudarshana, N.P. and Savitha, C. (2018). English for Engineers. Cambridge University Press.
REFERENCE BOOKS:
1. Swan, M. (2016). Practical English Usage. Oxford University Press.
2. Kumar, S and Lata, P. (2018). Communication Skills. Oxford University Press.
3. Wood, F.T. (2007). Remedial English Grammar. Macmillan.
4. Zinsser, William. (2001). On Writing Well. Harper Resource Book.
5. Hamp-Lyons, L. (2006). Study Writing. Cambridge University Press.
6. Exercises in Spoken English. Parts I –III. CIEFL, Hyderabad. Oxford University Press.

CH106BS/CH206ES: ENGINEERING CHEMISTRY LAB

B.Tech. I Year I Sem. L T P C
0 0 3 1.5
Course Objectives: The course consists of experiments related to the principles of chemistry required for
engineering student. The student will learn:
 Estimation of hardness and chloride content in water to check its suitability for drinking purpose.
 To determine the rate constant of reactions from concentrations as an function of time.
 The measurement of physical properties like adsorption and viscosity.
 To synthesize the drug molecules and check the purity of organic molecules by thin layer
chromatographic (TLC) technique.

Course Outcomes: The experiments will make the student gain skills on:
 Determination of parameters like hardness and chloride content in water.
 Estimation of rate constant of a reaction from concentration – time relationships.
 Determination of physical properties like adsorption and viscosity.
 Calculation of R values of some organic molecules by TLC technique.
f

List of Experiments:
1. Determination of total hardness of water by complexometric method using EDTA
2. Determination of chloride content of water by Argentometry
3. Estimation of an HCl by Conductometric titrations
4. Estimation of Acetic acid by Conductometric titrations
5. Estimation of HCl by Potentiometric titrations
6. Estimation of Fe2+ by Potentiometry using KMnO4

7. Determination of rate constant of acid catalysed hydrolysis of methyl acetate

8. Synthesis of Aspirin and Paracetamol
9. Thin layer chromatography calculation of R values. eg ortho and para nitro phenols
f
10. Determination of acid value of coconut oil
11. Verification of freundlich adsorption isotherm-adsorption of acetic acid on charcoal
12. Determination of viscosity of castor oil and ground nut oil by using Ostwald’s viscometer.
13. Determination of partition coefficient of acetic acid between n-butanol and water.
14. Determination of surface tension of a give liquid using stalagmometer.

REFERENCE BOOKS:
1. Senior practical physical chemistry, B.D. Khosla, A. Gulati and V. Garg (R. Chand & Co., Delhi)
2. An introduction to practical chemistry, K.K. Sharma and D. S. Sharma (Vikas publishing, N. Delhi)
3. Vogel’s text book of practical organic chemistry 5th edition
4. Text book on Experiments and calculations in Engineering chemistry – S.S. Dara

EN107HS/EN207HS: ENGLISH LANGUAGE

AND COMMUNICATION SKILLS LAB
B.Tech. I Year I Sem. L T P
0 0 2
The Language Lab focuses on the production and practice of sounds of language and familiarizes the
students with the use of English in everyday situations both in formal and informal contexts.
 Course Objectives:
 To facilitate computer-assisted multi-media instruction enabling individualized and independent
language learning
 To sensitize students to the nuances of English speech sounds, word accent, intonation and rhythm
 To bring about a consistent accent and intelligibility in students’ pronunciation of English by
providing an opportunity for practice in speaking
 To improve the fluency of students in spoken English and neutralize their mother tongue influen
 To train students to use language appropriately for public speaking and interviews
Learning Outcomes: Students will be able to attain
 Better understanding of nuances of English language through audio- visual experience and group
activities
 Neutralization of accent for intelligibility
 Speaking skills with clarity and confidence which in turn enhances their employability skills

Syllabus
English Language and Communication Skills Lab (ELCS) shall have two parts:
a. Computer Assisted Language Learning (CALL) Lab
b. Interactive Communication Skills (ICS) Lab

Listening Skills
Objectives
1. To enable students develop their listening skills so that they may appreciate its role in the LSRW skills
approach to language and improve their pronunciation
2. To equip students with necessary training in listening so that they can comprehend the speech
of people of different backgrounds and regions

Students should be given practice in listening to the sounds of the language, to be able to recognize them and find the
distinction between different sounds, to be able to mark stress and recognize and use the right intonation in sentences.
 Listening for general content
 Listening to fill up information
 Intensive listening
 Listening for specific information

Speaking Skills
Objectives
1. To involve students in speaking activities in various contexts
2. To enable students express themselves fluently and appropriately in social and professional
contexts
• Oral practice: Just A Minute (JAM) Sessions

• Describing objects/situations/people
• Role play – Individual/Group activities
 The following course content is prescribed for the English Language and Communication Skills Lab based on Unit-
AICTE Model Curriculum 2018 for B.Tech First English. As the syllabus is very limited, it is required to prepare
teaching/learning materials by the teachers collectively in the form of handouts based on the needs of the students in
their respective colleges for effective
teaching/learning and timesaving in the Lab)
Exercise – I CALL Lab:
Understand: Listening Skill- Its importance – Purpose- Process- Types- Barriers of Listening.
Practice: Introduction to Phonetics – Speech Sounds – Vowels and Consonants.
ICS Lab:
Understand: Communication at Work Place- Spoken vs. Written language.
Practice: Ice-Breaking Activity and JAM Session- Situational Dialogues – Greetings – Taking Leave – Introduc
Oneself and Others.

Exercise – II CALL Lab:

Understand: Structure of Syllables – Word Stress and Rhythm– Weak Forms and Strong Forms in Context.
Practice: Basic Rules of Word Accent - Stress Shift - Weak Forms and Strong Forms in Context.
ICS Lab:
Understand: Features of Good Conversation – Non-verbal Communication.
Practice: Situational Dialogues – Role-Play- Expressions in Various Situations –Making Requests and Seekin
Permissions - Telephone Etiquette.

Exercise - III CALL Lab:

Understand: Intonation-Errors in Pronunciation-the Influence of Mother Tongue (MTI).
Practice: Common Indian Variants in Pronunciation – Differences in British and American
Pronunciation.
ICS Lab:
Understand: How to make Formal Presentations.
Practice: Formal Presentations.

Exercise – IV CALL Lab:

Understand: Listening for General Details. Practice: Listening Comprehension Tests. ICS Lab:
Understand: Public Speaking – Exposure to Structured Talks.
Practice: Making a Short Speech – Extempore.

Exercise – V CALL Lab:

Understand: Listening for Specific Details. Practice: Listening Comprehension Tests. ICS Lab:
Understand: Interview Skills.
Practice: Mock Interviews.

**************
Minimum Requirement of infrastructural facilities for ELCS Lab:
1. Computer Assisted Language Learning (CALL) Lab:
The Computer Assisted Language Learning Lab has to accommodate 40 students with 40 systems, with one
Master Console, LAN facility and English language learning software for self- study by
students.
System Requirement (Hardware component):
Computer network with LAN facility (minimum 40 systems with multimedia) with the following specifications:
i) Computers with Suitable Configuration
ii) High Fidelity Headphones
2. Interactive Communication Skills (ICS) Lab:
The Interactive Communication Skills Lab: A Spacious room with movable chairs and audio-visual aids with a
Public-Address System, a LCD and a projector etc.

EE108ES/EE208ES: BASIC ELECTRICAL ENGINEERING LAB

B.Tech. I Year I Sem. L T P
0 0 2
Course Objectives:
 To analyze a given network by applying various electrical laws and network theorems
 To know the response of electrical circuits for different excitations
 To calculate, measure and know the relation between basic electrical parameters.
 To analyze the performance characteristics of DC and AC electrical machines

Course Outcomes:
 Get an exposure to basic electrical laws.
 Understand the response of different types of electrical circuits to different excitations.
 Understand the measurement, calculation and relation between the basic electrical parameters
 Understand the basic characteristics of transformers and electrical machines.

List of experiments/demonstrations:
1. Verification of Ohms Law
2. Verification of KVL and KCL
3. Transient Response of Series RL and RC circuits using DC excitation
4. Transient Response of RLC Series circuit using DC excitation
5. Resonance in series RLC circuit
6. Calculations and Verification of Impedance and Current of RL, RC and RLC series circuits
7. Measurement of Voltage, Current and Real Power in primary and Secondary Circuits of a Single-Phase
Transformer
8. Load Test on Single Phase Transformer (Calculate Efficiency and Regulation)
9. Three Phase Transformer: Verification of Relationship between Voltages and Currents (Star- Delta, Del
Delta, Delta-star, Star-Star)
10. Measurement of Active and Reactive Power in a balanced Three-phase circuit
11. Performance Characteristics of a Separately/Self Excited DC Shunt/Compound Motor
12. Torque-Speed Characteristics of a Separately/Self Excited DC Shunt/Compound Motor
13. Performance Characteristics of a Three-phase Induction Motor
14. Torque-Speed Characteristics of a Three-phase Induction Motor
15. No-Load Characteristics of a Three-phase Alternator

MA201BS: MATHEMATICS - II
B.Tech. I Year II Sem. L T P
3 1 0
Course Objectives: To learn
 Methods of solving the differential equations of first and higher order.
 Evaluation of multiple integrals and their applications
 The physical quantities involved in engineering field related to vector valued functions
 The basic properties of vector valued functions and their applications to line, surface and volume integr

Course Outcomes: After learning the contents of this paper the student must be able to
 Identify whether the given differential equation of first order is exact or not
 Solve higher differential equation and apply the concept of differential equation to real world
problems
 Evaluate the multiple integrals and apply the concept to find areas, volumes, centre of mass and Gravit
for cubes, sphere and rectangular parallelopiped
 Evaluate the line, surface and volume integrals and converting them from one to another

UNIT-I: First Order ODE

Exact, linear and Bernoulli’s equations; Applications : Newton’s law of cooling, Law of natural growth
and decay; Equations not of first degree: equations solvable for p, equations solvable for y, equations
solvable for x and Clairaut’s type.

UNIT-II: Ordinary Differential Equations of Higher Order

𝑒𝑎𝑥, sin 𝑎𝑥 , cos 𝑎𝑥, polynomials in 𝑥, 𝑒𝑎𝑥𝑉(𝑥) and 𝑥 𝑉(𝑥); method of variation of parameters;
Second order linear differential equations with constant coefficients: Non-Homogeneous terms of the type

Equations reducible to linear ODE with constant coefficients: Legendre’s equation, Cauchy-Euler
equation.

UNIT-III: Multivariable Calculus (Integration)

Evaluation of Double Integrals (Cartesian and polar coordinates); change of order of integration (only
Cartesian form); Evaluation of Triple Integrals: Change of variables (Cartesian to polar) for double and
(Cartesian to Spherical and Cylindrical polar coordinates) for triple integrals.
Applications: Areas (by double integrals) and volumes (by double integrals and triple integrals), Centre of
mass and Gravity (constant and variable densities) by double and triple integrals (applications
involving cubes, sphere and rectangular parallelopiped).

UNIT-IV: Vector Differentiation

Vector point functions and scalar point functions. Gradient, Divergence and Curl. Directional derivatives,
Tangent plane and normal line. Vector Identities. Scalar potential functions. Solenoidal and Irrotational
vectors.

UNIT-V: Vector Integration

Line, Surface and Volume Integrals. Theorems of Green, Gauss and Stokes (without proofs) and their
applications.
TEXT BOOKS:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons,2006
3. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9thEdition, Pearson, Reprint, 2002.

REFERENCE BOOKS:
1. Paras Ram, Engineering Mathematics, 2nd Edition, CBS Publishes
2. S. L. Ross, Differential Equations, 3rd Ed., Wiley India, 1984.
AP102BS/AP202BS: APPLIED PHYSICS
B.Tech. I Year II Sem. L T P
3 1 0
Course Objectives:
 Students will demonstrate skills in scientific inquiry, problem solving and laboratory techniques.
 Students will be able to demonstrate competency and understanding of the concepts found in Quantum
Mechanics, Fiber optics and lasers, Semiconductor physics and Electromagnetic theory and a broad b
of knowledge in physics.
 The graduates will be able to solve non-traditional problems that potentially draw on knowledge in
multiple areas of physics.
 To study applications in engineering like memory devices, transformer core and electromagnetic
machinery.

Course Outcomes: Upon graduation:

 The student would be able to learn the fundamental concepts on Quantum behaviour of matter in its m
state.
 The knowledge of fundamentals of Semiconductor physics, Optoelectronics, Lasers and fibre optics ena
the students to apply to various systems like communications, solar cell, photo cells and so on.
 Design, characterization and study of properties of material help the students to prepare new materials
various engineering applications.
 The course also helps the students to be exposed to the phenomena of electromagnetism and also to h
exposure on magnetic materials and dielectric materials.

UNIT-I: Quantum Mechanics

Introduction to quantum physics, Black body radiation, Planck’s law, Photoelectric effect, Compton
effect, de-Broglie’s hypothesis, Wave-particle duality, Davisson and Germer experiment, Heisenberg’s
Uncertainty principle, Born’s interpretation of the wave function, Schrodinger’s time independent wave
equation, Particle in one dimensional box.

UNIT-II: Semiconductor Physics

Intrinsic and Extrinsic semiconductors, Dependence of Fermi level on carrier-concentration and
temperature, Carrier generation and recombination, Carrier transport: diffusion and drift, Hall effect, p- n
junction diode, Zener diode and their V-I Characteristics, Bipolar Junction Transistor (BJT):
Construction, Principle of operation.

UNIT-III: Optoelectronics
Radiative and non-radiative recombination mechanisms in semiconductors, LED and semiconductor lasers
Device structure, Materials, Characteristics and figures of merit, Semiconductor photodetectors: Solar cell
PIN and Avalanche and their structure, Materials, working principle and Characteristics.
UNIT-IV: Lasers and Fibre Optics
Lasers: Introduction to interaction of radiation with matter, Coherence, Principle and working of Laser, Popul
inversion, Pumping, Types of Lasers: Ruby laser, Carbon dioxide (CO ) laser, He-Ne laser,
2 Applications of laser. Fibre Optics: Introduction, Optica
fibre as a dielectric wave guide, Total internal reflection, Acceptance angle, Acceptance cone and Numeric
aperture, Step and Graded index fibres,
Losses associated with optical fibres, Applications of optical fibres.

UNIT-V: Electromagnetism and Magnetic Properties of Materials

Laws of electrostatics, Electric current and the continuity equation, Ampere’s and Faraday’s laws,
Maxwell’s equations, Polarisation, Permittivity and Dielectric constant, Internal fields in a solid,
Clausius-Mossotti equation, Ferroelectrics and Piezoelectrics. Magnetisation, permeability and

susceptibility, Classification of magnetic materials, Ferromagnetism and ferromagnetic domains,

Hysteresis, Applications of magnetic materials.
TEXT BOOKS:
1. Engineering Physics, B.K. Pandey, S. Chaturvedi - Cengage Learing.
2. Halliday and Resnick, Physics - Wiley.
3. A textbook of Engineering Physics, Dr. M. N. Avadhanulu, Dr. P.G. Kshirsagar - S. Chand

REFERENCE BOOKS:
1. Richard Robinett, Quantum Mechanics
2. J. Singh, Semiconductor Optoelectronics: Physics and Technology, Mc Graw-Hill inc. (1995).
3. Online Course: “Optoelectronic Materials and Devices” by Monica Katiyar and Deepak Guptha on NPTE

CS103ES/CS203ES: PROGRAMMING FOR PROBLEM SOLVING

B.Tech. I Year II Sem. L T P
3 1 0
Course Objectives:
 To learn the fundamentals of computers.
 To understand the various steps in program development.
 To learn the syntax and semantics of C programming language.
 To learn the usage of structured programming approach in solving problems.

Course Outcomes: The student will learn

 To write algorithms and to draw flowcharts for solving problems.
 To convert the algorithms/flowcharts to C programs.
 To code and test a given logic in C programming language.
 To decompose a problem into functions and to develop modular reusable code.
 To use arrays, pointers, strings and structures to write C programs.
 Searching and sorting problems.

UNIT - I: Introduction to Programming

Introduction to components of a computer system: disks, primary and secondary memory, processor,
operating system, compilers, creating, compiling and executing a program etc., Number systems Introduc
to Algorithms: steps to solve logical and numerical problems. Representation of Algorithm, Flowchart/Pseu
code with examples, Program design and structured programming Introduction to C Programming Langua
variables (with data types and space requirements), Syntax and Logical Errors in compilation, object a
executable code , Operators, expressions and precedence, Expression evaluation, Storage classes (au
extern, static and register), type conversion, The main method and command line arguments
Bitwise operations: Bitwise AND, OR, XOR and NOT operators
Conditional Branching and Loops: Writing and evaluation of conditionals and consequent branching with if
else, switch-case, ternary operator, goto, Iteration with for, while, do-while loops
I/O: Simple input and output with scanf and printf, formatted I/O, Introduction to stdin, stdout and stderr.
Command line arguments

UNIT - II: Arrays, Strings, Structures and Pointers:

Arrays: one- and two-dimensional arrays, creating, accessing and manipulating elements of arrays Strings
Introduction to strings, handling strings as array of characters, basic string functions available in C (strlen,
strcat, strcpy, strstr etc.), arrays of strings
Structures: Defining structures, initializing structures, unions, Array of structures
Pointers: Idea of pointers, Defining pointers, Pointers to Arrays and Structures, Use of Pointers in self-
referential structures, usage of self referential structures in linked list (no implementation) Enumeration d
type
UNIT - III: Preprocessor and File handling in C:
Preprocessor: Commonly used Preprocessor commands like include, define, undef, if, ifdef, ifndef Files: Te
and Binary files, Creating and Reading and writing text and binary files, Appending data to existing files,
Writing and reading structures using binary files, Random access using fseek, ftell and
rewind functions.

UNIT - IV: Function and Dynamic Memory Allocation:

Functions: Designing structured programs, Declaring a function, Signature of a function, Parameters and
return type of a function, passing parameters to functions, call by value, Passing arrays to functions, passi
pointers to functions, idea of call by reference, Some C standard functions and libraries

Recursion: Simple programs, such as Finding Factorial, Fibonacci series etc., Limitations of Recursive
functions
Dynamic memory allocation: Allocating and freeing memory, Allocating memory for arrays of different
data types

UNIT - V: Introduction to Algorithms:

Algorithms for finding roots of a quadratic equations, finding minimum and maximum numbers of a given
finding if a number is prime number, etc.
Basic searching in an array of elements (linear and binary search techniques),
Basic algorithms to sort array of elements (Bubble, Insertion and Selection sort algorithms), Basic concept
order of complexity through the example programs

TEXT BOOKS:
1. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill
2. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3rd Edition)

REFERENCE BOOKS:
1. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice
2. Hall of India
3. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)
4. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
5. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4th Edition

ME104ES/ME204ES: ENGINEERING GRAPHICS

B.Tech. I Year II Sem. L T P
1 0 4
Pre-requisites: Nil Course objectives:
 To provide basic concepts in engineering drawing.
 To impart knowledge about standard principles of orthographic projection of objects.
 To draw sectional views and pictorial views of solids.

Course Outcomes: At the end of the course, the student will be able to:
 Preparing working drawings to communicate the ideas and information.
 Read, understand and interpret engineering drawings.

UNIT – I
Introduction to Engineering Drawing: Principles of Engineering Graphics and their Significance, Conic
Sections including the Rectangular Hyperbola – General method only. Cycloid, Epicycloid and Hypocycloid,
Scales – Plain & Diagonal.

UNIT- II
Orthographic Projections: Principles of Orthographic Projections – Conventions – Projections of Points
and Lines, Projections of Plane regular geometric figures. Auxiliary Planes.
UNIT – III
Projections of Regular Solids – Auxiliary Views - Sections or Sectional views of Right Regular Solids – Prism
Cylinder, Pyramid, Cone – Auxiliary views – Sections of Sphere
UNIT – IV
Development of Surfaces of Right Regular Solids – Prism, Cylinder, Pyramid and Cone, Intersection of Solid
Intersection of – Prism vs Prism- Cylinder Vs Cylinder
UNIT – V
Isometric Projections: Principles of Isometric Projection – Isometric Scale – Isometric Views –
Conventions – Isometric Views of Lines, Plane Figures, Simple and Compound Solids – Isometric
Projection of objects having non- isometric lines. Isometric Projection of Spherical Parts. Conversion of
Isometric Views to Orthographic Views and Vice-versa –Conventions

Introduction to CAD: (For Internal Evaluation Weightage only):

Introduction to CAD Software Package Commands. - Free Hand Sketches of 2D- Creation of 2D
Sketches by CAD Package
TEXT BOOKS:
1. Engineering Drawing N.D. Bhatt / Charotar
2. Engineering Drawing / N. S. Parthasarathy and Vela Murali/ Oxford
REFERENCE BOOKS:
1. Engineering Drawing / Basant Agrawal and McAgrawal/ McGraw Hill
2. Engineering Drawing/ M. B. Shah, B.C. Rane / Pearson.
3. Computer Aided Engineering Drawing – K Balaveera Reddy et al – CBS Publishers

AP105BS/AP205BS: APPLIED PHYSICS LAB

B.Tech. I Year II Sem. L T P
0 0 3
List of Experiments:
1. Energy gap of P-N junction diode:
To determine the energy gap of a semiconductor diode.
2. Solar Cell:
To study the V-I Characteristics of solar cell.
3. Light emitting diode:
Plot V-I and P-I characteristics of light emitting diode.
4. Stewart – Gee’s experiment:
Determination of magnetic field along the axis of a current carrying coil.
5. Hall effect:
To determine Hall co-efficient of a given semiconductor.
6. Photoelectric effect:
To determine work function of a given material.
7. LASER:
To study the characteristics of LASER sources.
8. Optical fibre:
To determine the bending losses of Optical fibres.
9. LCR Circuit:
To determine the Quality factor of LCR Circuit.
10. R-C Circuit:
To determine the time constant of R-C circuit.
Note: Any 8 experiments are to be performed
CS106ES/CS206ES: PROGRAMMING FOR PROBLEM SOLVING LAB
 B.Tech. I Year II Sem. L T P
0 0 3
[Note:The programs may be executed using any available Open Source/ Freely available IDE Some of the Tools available are:CodeL

Course Objectives: The students will learn the following:

 To work with an IDE to create, edit, compile, run and debug programs
 To analyze the various steps in program development.
 To develop programs to solve basic problems by understanding basic concepts in C like operat
control statements etc.
 To develop modular, reusable and readable C Programs using the concepts like functions, arrays etc
 To Write programs using the Dynamic Memory Allocation concept.
 To create, read from and write to text and binary files

Course Outcomes: The candidate is expected to be able to:

 formulate the algorithms for simple problems
 translate given algorithms to a working and correct program
 correct syntax errors as reported by the compilers
 identify and correct logical errors encountered during execution
 represent and manipulate data with arrays, strings and structures
 use pointers of different types
 create, read and write to and from simple text and binary files
 modularize the code with functions so that they can be reused

Practice sessions:
a. Write a simple program that prints the results of all the operators available in C (including pre/ post
increment , bitwise and/or/not , etc.). Read required operand values from standard input.
b. Write a simple program that converts one given data type to another using auto conversion and
casting. Take the values form standard input.

Simple numeric problems:

a. Write a program for fiend the max and min from the three numbers.
b. Write the program for the simple, compound interest.
c. Write program that declares Class awarded for a given percentage of marks, where mark
<40%= Failed, 40% to <60% = Second class, 60% to <70%=First class, >= 70% = Distinction. Read
percentage from standard input.
d. Write a program that prints a multiplication table for a given number and the number of rows in the ta
For example, for a number 5 and rows = 3, the output should be:
e. 5 x 1 = 5
f. 5 x 2 = 10
g. 5 x 3 = 15
h. Write a program that shows the binary equivalent of a given positive number between 0 to 255.
Expression Evaluation:
a. A building has 10 floors with a floor height of 3 meters each. A ball is dropped from the top of the
building. Find the time taken by the ball to reach each floor. (Use the formula s = ut+(1/2)at^2 where u a
a are the initial velocity in m/sec (= 0) and acceleration in m/sec^2 (= 9.8 m/s^2)).
b. Write a C program, which takes two integer operands and one operator from the user, performs the
operation and then prints the result. (Consider the operators +,-,*, /, % and use Switch Statement)
c. Write a program that finds if a given number is a prime number
d. Write a C program to find the sum of individual digits of a positive integer and test given number is
palindrome.
e. A Fibonacci sequence is defined as follows: the first and second terms in the sequence are 0 and 1.
Subsequent terms are found by adding the preceding two terms in the sequence. Write a C program to
generate the first n terms of the sequence.
f. Write a C program to generate all the prime numbers between 1 and n, where n is a value supplied by
the user.
g. Write a C program to find the roots of a Quadratic equation.
h. Write a C program to calculate the following, where x is a fractional value.
i. 1-x/2 +x^2/4-x^3/6
j. Write a C program to read in two numbers, x and n, and then compute the sum of this geometric
progression: 1+x+x^2+x^3+ +x^n. For example: if n is 3 and x is 5, then the program
computes 1+5+25+125.

Arrays and Pointers and Functions:

a. Write a C program to find the minimum, maximum and average in an array of integers.
b. Write a functions to compute mean, variance, Standard Deviation, sorting of n elements in single
dimension array.
c. Write a C program that uses functions to perform the following:
d. Addition of Two Matrices
e. ii. Multiplication of Two Matrices
f. iii. Transpose of a matrix with memory dynamically allocated for the new matrix as row and column
counts may not be same.
g. Write C programs that use both recursive and non-recursive functions
h. To find the factorial of a given integer.
i. ii. To find the GCD (greatest common divisor) of two given integers.
j. iii. To find x^n
k. Write a program for reading elements using pointer into array and display the values using array.
l. Write a program for display values reverse order from array using pointer.
m. Write a program through pointer variable to sum of n elements from array.
Files:
a. Write a C program to display the contents of a file to standard output device.
b. Write a C program which copies one file to another, replacing all lowercase characters with their
uppercase equivalents.
c. Write a C program to count the number of times a character occurs in a text file. The file name and th
character are supplied as command line arguments.
d. Write a C program that does the following:
It should first create a binary file and store 10 integers, where the file name and 10 values are given in the
command line. (hint: convert the strings using atoi function)
Now the program asks for an index and a value from the user and the value at that index should
be changed to the new value in the file. (hint: use fseek function)

The program should then read all 10 values and print them back.
e. Write a C program to merge two files into a third file (i.e., the contents of the firs t file followed by
those of the second are put in the third file).
 L T P C
3 1 0 4

cy and solving the system

anonical form.

mathematical problems

e to
olution of the system of

mitian; orthogonal
rse of Non-singular
mogeneous and Non-
.

vectors and their

nding inverse and power
atic Forms;
 quences.
parison test, p-test, D-
logarithmic test.
and Conditionally

their Geometrical

ns of curves (Only in
tions and their

nal dependence &

s using method of

010
ns,2006.
on, Reprint, 2002.

mi Publications, Reprint,

hi, 11 thReprint,

L T P C
3 1 0 4

lls to become a perfect

which makes the student

ich are essential for the

d other fields.
or understanding
o gain:
to conductivity.
rstanding the problem of

o medical and other fields.

and reaction

ombination of Atomic
nergy level diagrams of N2, O2 and

tion metal ion d- orbitals

nd effect of

es of hardness: temporary
r by complexometric
– Disinfection of water
onditioning, Phosphate
hange process.

ndard electrode
e. Nernst equation
chemical series and its
thium cell) and secondary

n – mechanism of
corrosion. Factors
Sacrificial anode and
ds of application.

duction to representation
y and chirality.
mation alanalysis of n-

ophilic addition reactions:

ard additions on carbonyl
ation of alcohols using KMnO and
4
 rules and applications of
ts of Nuclear magnetic

) Ltd., New Delhi.

th
Edition.

Krishnan

L T P C
3 0 0 3

circuits
rs.

ysis of simple circuits

ntation, real power,

onsisting of R, L, C, RL,

ctions.

ation and efficiency.

ase induction motor,

nd speed control of
characteristic and speed
 of Wires and Cables,
culations for energy

a McGraw Hill.

2011

tice Hall India, 1989.

L T P C
1 0 3 2.5

ngineering products.
ols, equipments and

ols, equipment and

k to prescribed

ing, fitting, carpentry,

luding drilling, material

rn)
 and Wood Working

L T P C
2 0 0 2

the consequent
s been designed to
g students.

abulary, grammar,
detailed study. The
ension and different
for working out the
uthentic materials of a
etc. The focus in this
xts

on Vocabulary,

he theoretical and

on, writing and speaking

by Cambridge University

xes. Grammar: Identifying

ding and Its Importance-

Importance of Proper
and
n Documents.
shed by Cambridge

n Agreement and

laint, Letter of

ambridge University Press.

lish to form Derivatives-

rs and Tenses.

d Events –

shed by Cambridge

Writing.

h for Engineers’ published

ies of Reports
ort.

ersity Press.

ess.
try required for

g purpose.
.

thin layer

TA

coal
iscometer.
er.

& Co., Delhi)

ishing, N. Delhi)

L T P C
0 0 2 1
d familiarizes the
contexts.
 d and independent

onation and rhythm

ation of English by

mother tongue influence

ws

rience and group

bility skills

role in the LSRW skills

end the speech

gnize them and find the

intonation in sentences.

and professional

kills Lab based on Unit-6 of

uired to prepare
eeds of the students in
ening.

aking Leave – Introducing

ng Forms in Context.
n Context.

g Requests and Seeking

and American

S Lab:

S Lab:

h 40 systems, with one

study by
owing specifications:

audio-visual aids with a

L T P C
0 0 2 1

rems

s.

ations.
cal parameters

s circuits
cuits of a Single-Phase

rrents (Star- Delta, Delta-

otor
Motor

L T P C
3 1 0 4
ctions
ace and volume integrals

e to

ation to real world

ntre of mass and Gravity

another

of natural growth
e for y, equations

eous terms of the type

n of parameters;
tion, Cauchy-Euler

integration (only
ar) for double and

e integrals), Centre of
grals (applications

rectional derivatives,
dal and Irrotational

proofs) and their

010
ns,2006
on, Reprint, 2002.

L T P C
3 1 0 4
ory techniques.
epts found in Quantum
c theory and a broad base

w on knowledge in

electromagnetic

viour of matter in its micro

rs and fibre optics enable

s and so on.
prepare new materials for

agnetism and also to have

tric effect, Compton

ment, Heisenberg’s
independent wave

oncentration and
drift, Hall effect, p- n
nsistor (BJT):

d semiconductor lasers:
todetectors: Solar cell,
ics.

d working of Laser, Population

cs: Introduction, Optical
ance cone and Numerical

and Faraday’s laws,

fields in a solid,
permeability and

agnetic domains,
 Chand

nc. (1995).
eepak Guptha on NPTEL

L T P C
3 1 0 4

emory, processor,
mber systems Introduction
orithm, Flowchart/Pseudo
Programming Language:
compilation, object and
n, Storage classes (auto,
rguments

uent branching with if, if-

in, stdout and stderr.

ments of arrays Strings:

s available in C (strlen,

of Pointers in self-
tation) Enumeration data
f, ifdef, ifndef Files: Text
data to existing files,
nd

tion, Parameters and

ays to functions, passing
ries

ions of Recursive

arrays of different

m numbers of a given set,

rithms), Basic concept of

earning, (3rd Edition)

ce

L T P C
1 0 4 3

ects.

ir Significance, Conic
cloid and Hypocycloid,

Projections of Points
 Regular Solids – Prism,

ne, Intersection of Solids:

metric Views –
Solids – Isometric
arts. Conversion of

D- Creation of 2D

L T P C
0 0 3 1.5

B
 L T P C
0 0 3 1.5
e Tools available are:CodeLite: https://codelite.org/ Code::Blocks: http://www.codeblocks.org/DevCpp : http://www.bloodshed.net/devcpp.html Eclipse: h

cepts in C like operators,

e functions, arrays etc.

(including pre/ post

input.
conversion and

where mark
= Distinction. Read

mber of rows in the table.

tween 0 to 255.
om the top of the
+(1/2)at^2 where u and

e user, performs the

tch Statement)

est given number is

quence are 0 and 1.

rite a C program to

is a value supplied by

of this geometric
n the program

tegers.
elements in single

as row and column

alues using array.

acters with their

e. The file name and the

values are given in the

index should

firs t file followed by

Strings:
a. Write a C program to convert a Roman numeral ranging from I to L to its decimal equivalent.
b. Write a C program that converts a number ranging from 1 to 50 to Roman equivalent
c. Write a C program that uses functions to perform the following operations:
d. To insert a sub-string in to a given main string from a given position.
e. ii. To delete n Characters from a given position in a given string.
f. Write a C program to determine if the given string is a palindrome or not (Spelled same in both directi
with or without a meaning like madam, civic, noon, abcba, etc.)
g. Write a C program that displays the position of a character ch in the string S or – 1 if S doesn‘t contain
ch.
h. Write a C program to count the lines, words and characters in a given text.

Miscellaneous:
a. Write a menu driven C program that allows a user to enter n numbers and then choose between findin
the smallest, largest, sum, or average. The menu and all the choices are to be functions. Use a switch
statement to determine what action to take. Display an error message if an invalid choice is entered.

b. Write a C program to construct a pyramid of numbers as follows:

1 * 1 1
12 ** 23 22
123 *** 456 333
4444

Sorting and Searching:

a. Write a C program that uses non recursive function to search for a Key value in a given
b. list of integers using linear search method.
c. Write a C program that uses non recursive function to search for a Key value in a given
d. sorted list of integers using binary search method.
e. Write a C program that implements the Bubble sort method to sort a given list of
f. integers in ascending order.
g. Write a C program that sorts the given array of integers using selection sort in descending order
h. Write a C program that sorts the given array of integers using insertion sort in ascending order
i. Write a C program that sorts a given array of names

Suggested Reference Books for solving the problems:

i. Byron Gottfried, Schaum’s Outline of Programming with C, McGraw-Hill
ii. B.A. Forouzan and R.F. Gilberg C Programming and Data Structures, Cengage Learning, (3 rd Edition)
iii. Brian W. Kernighan and Dennis M. Ritchie, The C Programming Language, Prentice
iv. Hall of India
v. R.G. Dromey, How to solve it by Computer, Pearson (16th Impression)
vi. Programming in C, Stephen G. Kochan, Fourth Edition, Pearson Education.
vii. Herbert Schildt, C: The Complete Reference, Mc Graw Hill, 4 th Edition

*MC109ES/*MC209ES: ENVIRONMENTAL SCIEN

B.Tech. I Year II Sem. L T P
3 0 0
Course Objectives:
 Understanding the importance of ecological balance for sustainable development.
 Understanding the impacts of developmental activities and mitigation measures.
 Understanding the environmental policies and regulations

Course Outcomes:
 Based on this course, the Engineering graduate will understand /evaluate / develop
technologies on the basis of ecological principles and environmental regulations which in turn helps in
sustainable development

UNIT-I
Ecosystems: Definition, Scope, and Importance of ecosystem. Classification, structure, and function of an
ecosystem, Food chains, food webs, and ecological pyramids. Flow of energy, Biogeochemical cycles,
Bioaccumulation, Biomagnification, ecosystem value, services and carrying capacity, Field visits.

UNIT-II
Natural Resources: Classification of Resources: Living and Non-Living resources, water resources:
and over utilization of surface and ground water, floods and droughts, Dams: benefits and problems. Miner
resources: use and exploitation, environmental effects of extracting and using mineral resources, Land
resources: Forest resources, Energy resources: growing energy needs,
renewable and non-renewable energy sources, use of alternate energy source, case studies.

UNIT-III
Biodiversity And Biotic Resources: Introduction, Definition, genetic, species and ecosystem diversity.
Value of biodiversity; consumptive use, productive use, social, ethical, aesthetic and optional values. India
a mega diversity nation, Hot spots of biodiversity. Field visit. Threats to biodiversity: habitat loss, poaching
wildlife, man-wildlife conflicts; conservation of biodiversity: In-Situ and Ex-situ conservation. National
Biodiversity act.

UNIT-IV
Environmental Pollution and Control Technologies: Environmental Pollution: Classification of pollution, Ai
Pollution: Primary and secondary pollutants, Automobile and Industrial pollution, Ambient air quality
standards. Water pollution: Sources and types of pollution, drinking water quality standards. Soil Pollution:
Sources and types, Impacts of modern agriculture, degradation of soil. Noise Pollution: Sources and Hea
hazards, standards, Solid waste: Municipal Solid Waste management, composition and
characteristics of e-Waste and its management. Pollution control technologies: Wastewater Treatment
methods: Primary, secondary and Tertiary.
Overview of air pollution control technologies, Concepts of bioremediation. Global Environmental Issu
and Global Efforts: Climate change and impacts on human environment. Ozone depletion and Ozone
depleting substances (ODS). Deforestation and desertification. International conventions /
Protocols: Earth summit, Kyoto protocol, and Montréal Protocol. NAPCC-GoI Initiatives.

UNIT-V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects Air Act- 1981, Water A
Forest Act, Wild life Act, Municipal solid waste management and handling rules, biomedical waste
management and handling rules, hazardous waste management and handling rules. EIA: EIA structure,
methods of baseline data acquisition. Overview on Impacts of air, water, biological and Socio- economical
aspects. Strategies for risk assessment, Concepts of Environmental Management Plan

(EMP). Towards Sustainable Future: Concept of Sustainable Development Goals, Population and its explosio
Crazy Consumerism, Environmental Education, Urban Sprawl, Human health, Environmental
Ethics, Concept of Green Building, Ecological Foot Print, Life Cycle assessment (LCA), Low carbon life style
TEXT BOOKS:
1 Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha for University
Grants Commission.
2 Environmental Studies by R. Rajagopalan, Oxford University Press.

REFERENCE BOOKS:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL Learning Private
Ltd. New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela. 2008 PHI Learning P
Ltd.
3. Environmental Science by Daniel B. Botkin & Edward A. Keller, Wiley INDIA edition.
4. Environmental Studies by Anubha Kaushik, 4th Edition, New age international publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS Publications.
6. Introduction to Environmental Science by Y. Anjaneyulu, BS. Publications.

CS301ES: ANALOG AND DIGITAL ELECTRONICS

B.TECH II Year I Sem. L T P
3 0 0
Course Objectives:
• To introduce components such as diodes, BJTs and FETs.
• To know the applications of components.
• To give understanding of various types of amplifier circuits
• To learn basic techniques for the design of digital circuits and fundamental concepts used in the desig
of digital systems.
• To understand the concepts of combinational logic circuits and sequential circuits.

Course Outcomes: Upon completion of the Course, the students will be able to:
• Know the characteristics of various components.
• Understand the utilization of components.
• Design and analyze small signal amplifier circuits.
• Learn Postulates of Boolean algebra and to minimize combinational functions
• Design and analyze combinational and sequential circuits
• Know about the logic families and realization of logic gates.

UNIT - I
Diodes and Applications: Junction diode characteristics: Open circuited p-n junction, p-n junction as a rectifi
V-I characteristics, effect of temperature, diode resistance, diffusion capacitance, diode switching
times, breakdown diodes, Tunnel diodes, photo diode, LED.
Diode Applications - clipping circuits, comparators, Half wave rectifier, Full wave rectifier, rectifier with
capacitor filter.

UNIT - II
BJTs: Transistor characteristics: The junction transistor, transistor as an amplifier, CB, CE, CC
configurations, comparison of transistor configurations, the operating point, self-bias or Emitter bias, bias
compensation, thermal runaway and stability, transistor at low frequencies, CE amplifier response, gain
bandwidth product, Emitter follower, RC coupled amplifier, two cascaded CE and multi stage CE amplifiers
UNIT - III
FETs and Digital Circuits: FETs: JFET, V-I characteristics, MOSFET, low frequency CS and CD amplifie
CS and CD amplifiers.
Digital Circuits: Digital (binary) operations of a system, OR gate, AND gate, NOT, EXCLUSIVE OR gate, De
Morgan Laws, NAND and NOR DTL gates, modified DTL gates, HTL and TTL gates, output
stages, RTL and DCTL, CMOS, Comparison of logic families.

UNIT - IV
Combinational Logic Circuits: Basic Theorems and Properties of Boolean Algebra, Canonical and Standard
Forms, Digital Logic Gates, The Map Method, Product-of-Sums Simplification, Don’t-Care Conditions, NAN
and NOR Implementation, Exclusive-OR Function, Binary Adder-Subtractor, Decimal Adder, Binary
Multiplier, Magnitude Comparator, Decoders, Encoders, Multiplexers.

UNIT - V
Sequential Logic Circuits: Sequential Circuits, Storage Elements: Latches and flip flops, Analysis of Clocked
Sequential Circuits, State Reduction and Assignment, Shift Registers, Ripple Counters, Synchronous
Counters, Random-Access Memory, Read-Only Memory.
TEXTBOOKS:
1. Integrated Electronics: Analog and Digital Circuits and Systems, 2/e, Jaccob Millman, Christos Halkias a
Chethan D. Parikh, Tata McGraw-Hill Education, India, 2010.
2. Digital Design, 5/e, Morris Mano and Michael D. Cilette, Pearson, 2011.

REFERENCE BOOKS:
1. Electronic Devices and Circuits, Jimmy J Cathey, Schaum’s outline series, 1988.
2. Digital Principles, 3/e, Roger L. Tokheim, Schaum’s outline series, 1994.
CS302ES: DATA STRUCTURES
B.TECH II Year I Sem. L T P
3 1 0
Prerequisites: A course on “Programming for Problem Solving”.
Course Objectives:
• Exploring basic data structures such as stacks and queues.
• Introduces a variety of data structures such as hash tables, search trees, tries, heaps, graphs.
• Introduces sorting and pattern matching algorithms

Course Outcomes:
• Ability to select the data structures that efficiently model the information in a problem.
• Ability to assess efficiency trade-offs among different data structure implementations or combinations
• Implement and know the application of algorithms for sorting and pattern matching.
• Design programs using a variety of data structures, including hash tables, binary and general tree
structures, search trees, tries, heaps, graphs, and AVL-trees.

UNIT - I
Introduction to Data Structures, abstract data types, Linear list – singly linked list implementation, insertion
deletion and searching operations on linear list, Stacks-Operations, array and linked representations
stacks, stack applications, Queues-operations, array and linked representations.

UNIT - II
Dictionaries: linear list representation, skip list representation, operations - insertion, deletion and
searching.
Hash Table Representation: hash functions, collision resolution-separate chaining, open addressing-
linear probing, quadratic probing, double hashing, rehashing, extendible hashing.
UNIT - III
Search Trees: Binary Search Trees, Definition, Implementation, Operations- Searching, Insertion and Deleti
AVL Trees, Definition, Height of an AVL Tree, Operations – Insertion, Deletion and Searching, Red –Black,
Splay Trees.

UNIT - IV
Graphs: Graph Implementation Methods. Graph Traversal Methods.
Sorting: Heap Sort, External Sorting- Model for external sorting, Merge Sort.
UNIT - V
Pattern Matching and Tries: Pattern matching algorithms-Brute force, the Boyer –Moore algorithm, the Knut
Morris-Pratt algorithm, Standard Tries, Compressed Tries, Suffix tries.
TEXT BOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed,
Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M.J. Augenstein, PHI/Pearson
Education.

REFERENCE BOOK:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B.A. Forouzan, Cengage
Learning.
MA303BS: COMPUTER ORIENTED STATISTICAL METHODS
B.TECH II Year I Sem. L T P
3 1 0
Pre-requisites: Mathematics courses of first year of study.
Course Objectives: To learn
• The theory of Probability, and probability distributions of single and multiple random variables
• The sampling theory and testing of hypothesis and making inferences
• Stochastic process and Markov chains.

Course Outcomes: After learning the contents of this paper the student must be able to
• Apply the concepts of probability and distributions to some case studies
• Correlate the material of one unit to the material in other units
• Resolve the potential misconceptions and hazards in each topic of study.

UNIT - I
Probability: Sample Space, Events, Counting Sample Points, Probability of an Event, Additive Rules,
Conditional Probability, Independence, and the Product Rule, Bayes’ Rule.
Random Variables and Probability Distributions: Concept of a Random Variable, Discrete
Probability Distributions, Continuous Probability Distributions, Statistical Independence.

UNIT - II
Mathematical Expectation: Mean of a Random Variable, Variance and Covariance of Random Variable
Means and Variances of Linear Combinations of Random Variables, Chebyshev’s Theorem. Discrete
Probability Distributions: Introduction and Motivation, Binomial, Distribution, Geometric Distributions a
Poisson distribution.

UNIT - III
Continuous Probability Distributions : Continuous Uniform Distribution, Normal Distribution, Areas under th
Normal Curve, Applications of the Normal Distribution, Normal Approximation to the Binomial, Gamma and
Exponential Distributions.
Fundamental Sampling Distributions: Random Sampling, Some Important Statistics, Sampling
Distributions, Sampling Distribution of Means and the Central Limit Theorem, Sampling Distribution of
S2, t –Distribution, F-Distribution.
UNIT - IV
Estimation & Tests of Hypotheses: Introduction, Statistical Inference, Classical Methods of Estimatio
Estimating the Mean, Standard Error of a Point Estimate, Prediction Intervals, Tolerance Limits, Estimating
the Variance, Estimating a Proportion for single mean , Difference between Two Means, between Two
Proportions for Two Samples and Maximum Likelihood Estimation.
Statistical Hypotheses: General Concepts, Testing a Statistical Hypothesis, Tests Concerning a Single
Mean, Tests on Two Means, Test on a Single Proportion, Two Samples: Tests on Two
Proportions.

UNIT - V
Stochastic Processes and Markov Chains: Introduction to Stochastic processes- Markov process.
Transition Probability, Transition Probability Matrix, First order and Higher order Markov process, n- step
transition probabilities, Markov chain, Steady state condition, Markov analysis.

TEXT BOOKS:
1. Ronald E. Walpole, Raymond H. Myers, Sharon L. Myers, Keying Ye, Probability & Statistics for
Engineers & Scientists, 9th Ed. Pearson Publishers.
2. S C Gupta and V K Kapoor, Fundamentals of Mathematical statistics, Khanna publications.
3. S. D. Sharma, Operations Research, Kedarnath and Ramnath Publishers, Meerut, Delhi

REFERENCE BOOKS:
1. T.T. Soong, Fundamentals of Probability and Statistics for Engineers, John Wiley & Sons Ltd, 2004.
2. Sheldon M Ross, Probability and statistics for Engineers and scientists, Academic Press.

CS304PC: COMPUTER ORGANIZATION AND ARCHITECTURE

B.TECH II Year I Sem. L T P
3 0 0
Co-requisite: A Course on “Digital Logic Design and Microprocessors”.
Course Objectives:
• The purpose of the course is to introduce principles of computer organization and the basic architectu
concepts.
• It begins with basic organization, design, and programming of a simple digital computer and introduce
simple register transfer language to specify various computer operations.
• Topics include computer arithmetic, instruction set design, microprogrammed control unit,
pipelining and vector processing, memory organization and I/O systems, and multiprocessors

Course Outcomes:
• Understand the basics of instructions sets and their impact on processor design.
• Demonstrate an understanding of the design of the functional units of a digital computer system.
• Evaluate cost performance and design trade-offs in designing and constructing a computer processor
including memory.
• Design a pipeline for consistent execution of instructions with minimum hazards.
• Recognize and manipulate representations of numbers stored in digital computers
UNIT - I
Digital Computers: Introduction, Block diagram of Digital Computer, Definition of Computer
Organization, Computer Design and Computer Architecture.
Register Transfer Language and Micro operations: Register Transfer language, Register Transfer, Bus and
memory transfers, Arithmetic Micro operations, logic micro operations, shift micro operations, Arithmetic
logic shift unit.
Basic Computer Organization and Design: Instruction codes, Computer Registers Computer instruction
Timing and Control, Instruction cycle, Memory Reference Instructions, Input – Output and
Interrupt.

UNIT - II
Microprogrammed Control: Control memory, Address sequencing, micro program example, design of contro
unit.
Central Processing Unit: General Register Organization, Instruction Formats, Addressing modes,
Data Transfer and Manipulation, Program Control.

UNIT - III
Data Representation: Data types, Complements, Fixed Point Representation, Floating Point
Representation.
Computer Arithmetic: Addition and subtraction, multiplication Algorithms, Division Algorithms,
Floating – point Arithmetic operations. Decimal Arithmetic unit, Decimal Arithmetic operations.

UNIT - IV
Input-Output Organization: Input-Output Interface, Asynchronous data transfer, Modes of Transfer, Priority
Interrupt Direct memory Access.
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary memory, Associate Memory,
Cache Memory.

UNIT - V
Reduced Instruction Set Computer: CISC Characteristics, RISC Characteristics.
Pipeline and Vector Processing: Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline
RISC Pipeline, Vector Processing, Array Processor.
Multi Processors: Characteristics of Multiprocessors, Interconnection Structures, Interprocessor
arbitration, Interprocessor communication and synchronization, Cache Coherence.

TEXT BOOK:
1. Computer System Architecture – M. Moris Mano, Third Edition, Pearson/PHI.
REFERENCE BOOKS:
1. Computer Organization – Car Hamacher, Zvonks Vranesic, Safea Zaky, Vth Edition, McGraw Hill.
2. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI.
3. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition, PHI/Pearson.

CS305PC: OBJECT ORIENTED PROGRAMMING USING C++

B.TECH II Year I Sem. L T P
2 0 0
Prerequisites: A course on “Programming for Problem Solving using C”.
Course Objectives:
• Introduces Object Oriented Programming concepts using the C++ language.
• Introduces the principles of data abstraction, inheritance and polymorphism;
• Introduces the principles of virtual functions and polymorphism
• Introduces handling formatted I/O and unformatted I/O
• Introduces exception handling
Course Outcomes:
• Able to develop programs with reusability
• Develop programs for file handling
• Handle exceptions in programming
• Develop applications for a range of problems using object-oriented programming techniques

UNIT - I
Object-Oriented Thinking: Different paradigms for problem solving, need for OOP paradigm, differenc
between OOP and Procedure oriented programming, Overview of OOP concepts- Abstraction,
Encapsulation, Inheritance and Polymorphism.
C++ Basics: Structure of a C++ program, Data types, Declaration of variables, Expressions, Operators,
Operator Precedence, Evaluation of expressions, Type conversions, Pointers, Arrays, Pointers and
Arrays, Strings, Structures, References. Flow control statement- if, switch, while, for, do, break,
continue, goto statements. Functions - Scope of variables, Parameter passing, Default arguments,
inline functions, Recursive functions, Pointers to functions. Dynamic memory allocation and de-
allocation operators-new and delete, Preprocessor directives.

UNIT - II
C++ Classes and Data Abstraction: Class definition, Class structure, Class objects, Class scope, this pointer,
Friends to a class, Static class members, Constant member functions, Constructors and
Destructors, Dynamic creation and destruction of objects, Data abstraction, ADT and information hiding.

UNIT - III
Inheritance: Defining a class hierarchy, Different forms of inheritance, Defining the Base and Derived class
Access to the base class members, Base and Derived class construction, Destructors, Virtual base class.
Virtual Functions and Polymorphism: Static and Dynamic binding, virtual functions, Dynamic binding throug
virtual functions, Virtual function call mechanism, Pure virtual functions, Abstract classes,
Implications of polymorphic use of classes, Virtual destructors.

UNIT - IV
C++ I/O: I/O using C functions, Stream classes hierarchy, Stream I/O, File streams and String streams,
Overloading operators, Error handling during file operations, Formatted I/O.
UNIT - V
Exception Handling: Benefits of exception handling, Throwing an exception, The try block, Catching an
exception, Exception objects, Exception specifications, Stack unwinding, Rethrowing an exception, Catchin
all exceptions.

TEXT BOOKS:
1. The Complete Reference C++, 4th Edition, Herbert Schildt, Tata McGraw Hill.
2. Problem solving with C++: The Object of Programming, 4th Edition, Walter Savitch, Pearson Education.

REFERENCE BOOKS:
1. The C++ Programming Language, 3rd Edition, B. Stroutstrup, Pearson Education.
2. OOP in C++, 3rd Edition, T. Gaddis, J. Walters and G. Muganda, Wiley Dream Tech Press.
3. Object Oriented Programming in C++, 3rd Edition, R. Lafore, Galigotia Publications Pvt Ltd.

CS306ES: ANALOG AND DIGITAL ELECTRONICS LAB

B.TECH II Year I Sem. L T P
0 0 2
Course Objectives
• To introduce components such as diodes, BJTs and FETs.
• To know the applications of components.
• To give understanding of various types of amplifier circuits
• To learn basic techniques for the design of digital circuits and fundamental concepts used in the desig
of digital systems.
• To understand the concepts of combinational logic circuits and sequential circuits.

Course Outcomes: Upon completion of the Course, the students will be able to:
• Know the characteristics of various components.
• Understand the utilization of components.
• Design and analyze small signal amplifier circuits.
• Postulates of Boolean algebra and to minimize combinational functions
• Design and analyze combinational and sequential circuits
• Known about the logic families and realization of logic gates.

List of Experiments
1. Full Wave Rectifier with & without filters
2. Common Emitter Amplifier Characteristics
3. Common Base Amplifier Characteristics
4. Common Source amplifier Characteristics
5. Measurement of h-parameters of transistor in CB, CE, CC configurations
6. Input and Output characteristics of FET in CS configuration
7. Realization of Boolean Expressions using Gates
8. Design and realization logic gates using universal gates
9. generation of clock using NAND / NOR gates
10. Design a 4 – bit Adder / Subtractor
11. Design and realization a Synchronous and Asynchronous counter using flip-flops
12. Realization of logic gates using DTL, TTL, ECL, etc.

CS307PC: DATA STRUCTURES LAB

B.TECH II Year I Sem. L T P
0 0 3
Prerequisites: A Course on “Programming for problem solving”.
Course Objectives:
 It covers various concepts of C programming language
 It introduces searching and sorting algorithms
 It provides an understanding of data structures such as stacks and queues.

Course Outcomes:
• Ability to develop C programs for computing and real-life applications using basic elements like contro
statements, arrays, functions, pointers and strings, and data structures like stacks, queues and link
lists.
• Ability to Implement searching and sorting algorithms

List of Experiments
1. Write a program that uses functions to perform the following operations on singly linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal

2. Write a program that uses functions to perform the following operations on doubly linked list.:
 i) Creation ii) Insertion iii) Deletion iv) Traversal
3. Write a program that uses functions to perform the following operations on circular linked list.:

i) Creation ii) Insertion iii) Deletion iv) Traversal

4. Write a program that implement stack (its operations) using
i) Arrays ii) Pointers
5. Write a program that implement Queue (its operations) using
i) Arrays ii) Pointers
6. Write a program that implements the following sorting methods to sort a given list of integers i
ascending order
i) Bubble sort ii) Selection sort iii) Insertion sort
7. Write a program that use both recursive and non recursive functions to perform the
following searching operations for a Key value in a given list of integers:
i) Linear search ii) Binary search
8. Write a program to implement the tree traversal methods.

9. Write a program to implement the graph traversal methods.

TEXT BOOKS:
1. Fundamentals of Data Structures in C, 2nd Edition, E. Horowitz, S. Sahni and Susan Anderson Freed,
Universities Press.
2. Data Structures using C – A. S. Tanenbaum, Y. Langsam, and M. J. Augenstein, PHI/Pearson
Education.

REFERENCE BOOK:
1. Data Structures: A Pseudocode Approach with C, 2nd Edition, R. F. Gilberg and B. A. Forouzan, Cengage
Learning.
CS308PC: IT WORKSHOP LAB
B.TECH II Year I Sem. L T P
0 0 3
Course Objectives:
The IT Workshop for engineers is a training lab course spread over 60 hours. The modules include training
PC Hardware, Internet & World Wide Web and Productivity tools including Word, Excel, Power Point and
Publisher.

PC Hardware introduces the students to a personal computer and its basic peripherals, the process of
assembling a personal computer, installation of system software like MS Windows, Linux and the
required device drivers. In addition hardware and software level troubleshooting process, tips and tricks
would be covered. The students should work on working PC to disassemble and assemble to working conditio
and install Windows and Linux on the same PC. Students are suggested to work similar tasks in the Laptop
scenario wherever possible. Internet & World Wide Web module introduces the different ways of hooking
the PC on to the internet from home and workplace and effectively usage of the internet. Usage of
web browsers, email, newsgroups and discussion forums would be covered. In addition, awareness of cybe
hygiene, i.e., protecting the personal computer from getting infected with the viruses, worms and other
cyber attacks would be introduced. Productivity tools module would enable the students in crafting
professional word documents, excel spread sheets,
power point presentations and personal web sites using the Microsoft suite of office tools and LaTeX.

PC Hardware
Task 1: Identify the peripherals of a computer, components in a CPU and its functions. Draw the block
diagram of the CPU along with the configuration of each peripheral and submit to your instructor.
Task 2: Every student should disassemble and assemble the PC back to working condition. Lab
instructors should verify the work and follow it up with a Viva. Also students need to go through the video
which shows the process of assembling a PC. A video would be given as part of the course content.

Task 3: Every student should individually install MS windows on the personal computer. Lab instructor
should verify the installation and follow it up with a Viva.
Task 4: Every student should install Linux on the computer. This computer should have windows
installed. The system should be configured as dual boot with both windows and Linux. Lab instructors shou
verify the installation and follow it up with a Viva
Task 5: Hardware Troubleshooting: Students have to be given a PC which does not boot due to improper
assembly or defective peripherals. They should identify the problem and fix it to get the compute
back to working condition. The work done should be verified by the instructor and followed up with a Viva.

Task 6: Software Troubleshooting: Students have to be given a malfunctioning CPU due to system software
problems. They should identify the problem and fix it to get the computer back to working
condition. The work done should be verified by the instructor and followed up with a Viva.
Internet & World Wide Web
Task1: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area Network an
access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate, to the instructor, how to access the websites and email. If there is no internet
connectivity preparations need to be made by the instructors to simulate the WWW on the LAN.
Task 2: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy settings
bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for applets
should be configured.
Task 3: Search Engines & Netiquette: Students should know what search engines are and how to use the
search engines. A few topics would be given to the students for which they need to search on Google. This
should be demonstrated to the instructors by the student.
Task 4: Cyber Hygiene: Students would be exposed to the various threats on the internet and would be ask
to configure their computer to be safe on the internet. They need to first install an antivirus software,
configure their personal firewall and windows update on their computer. Then they need to customize the
browsers to block pop ups, block active x downloads to avoid viruses and/or worms.

LaTeX and WORD

Task 1 – Word Orientation: The mentor needs to give an overview of LaTeX and Microsoft (MS) office 2007/
equivalent (FOSS) tool word: Importance of LaTeX and MS office 2007/ equivalent (FOSS) tool Word as wor
Processors, Details of the four tasks and features that would be covered in each, Using LaTeX and word –
Accessing, overview of toolbars, saving files, Using help and resources, rulers, format painter in word.

Task 2: Using LaTeX and Word to create project certificate. Features to be covered:- Formatting Fonts in
word, Drop Cap in word, Applying Text effects, Using Character Spacing, Borders and Colors,
Inserting Header and Footer, Using Date and Time option in both LaTeX and Word.
Task 3: Creating project abstract Features to be covered:-Formatting Styles, Inserting table, Bullets and
Numbering, Changing Text Direction, Cell alignment, Footnote, Hyperlink, Symbols, Spell Check, Track
Changes.
Task 4 : Creating a Newsletter : Features to be covered:- Table of Content, Newspaper columns, Images from
files and clipart, Drawing toolbar and Word Art, Formatting Images, Textboxes, Paragraphs and Mail Merge
word.
Excel
Excel Orientation: The mentor needs to tell the importance of MS office 2007/ equivalent (FOSS) tool Excel
a Spreadsheet tool, give the details of the four tasks and features that would be covered in each. Using Ex
– Accessing, overview of toolbars, saving excel files, Using help and resources.

Task 1: Creating a Scheduler - Features to be covered: Gridlines, Format Cells, Summation, auto fill,
Formatting Text
Task 2 : Calculating GPA - .Features to be covered:- Cell Referencing, Formulae in excel – average,
std.deviation, Charts, Renaming and Inserting worksheets, Hyper linking, Count function,
LOOKUP/VLOOKUP
Task 3: Performance Analysis - Features to be covered:- Split cells, freeze panes, group and outline,
Sorting, Boolean and logical operators, Conditional formatting
LaTeX and MS/equivalent (FOSS) tool Power Point
Task 1: Students will be working on basic power point utilities and tools which help them create basic pow
point presentation. Topic covered during this week includes: - PPT Orientation, Slide Layouts, Inserting Tex
Word Art, Formatting Text, Bullets and Numbering, Auto Shapes, Lines and Arrows in both LaTeX and
PowerPoint. Students will be given model power point presentation which needs to be replicated (exactly
how it’s asked).

Task 2: Second week helps students in making their presentations interactive. Topic covered during
this week includes: Hyperlinks, Inserting –Images, Clip Art, Audio, Video, Objects, Tables and Charts.
Task 3: Concentrating on the in and out of Microsoft power point and presentations in LaTeX. Helps them
learn best practices in designing and preparing power point presentation. Topic covered during this week
includes: - Master Layouts (slide, template, and notes), Types of views (basic, presentation, slide slotter,
notes etc), and Inserting – Background, textures, Design Templates, Hidden slides.

REFERENCE BOOKS:
1. Comdex Information Technology course tool kit Vikas Gupta, WILEY Dreamtech
2. The Complete Computer upgrade and repair book, 3rd edition Cheryl A Schmidt, WILEY Dreamt
3. Introduction to Information Technology, ITL Education Solutions limited, Pearson Education.
4. PC Hardware - A Handbook – Kate J. Chase PHI (Microsoft)
5. LaTeX Companion – Leslie Lamport, PHI/Pearson.
6. IT Essentials PC Hardware and Software Companion Guide Third Edition by David Anfinson and Ken
Quamme. – CISCO Press, Pearson Education.
7. IT Essentials PC Hardware and Software Labs and Study Guide Third Edition by Patrick Regan
– CISCO Press, Pearson Education.

CS309PC: C++ PROGRAMMING LAB

B.TECH II Year I Sem. L T P
0 0 2
Prerequisites: A course on “Programming for Problem Solving”.
Course Objectives:
• Introduces object-oriented programming concepts using the C++ language.
• Introduces the principles of data abstraction, inheritance and polymorphism;
• Introduces the principles of virtual functions and polymorphism
• Introduces handling formatted I/O and unformatted I/O
• Introduces exception handling

Course Outcome:
 Ability to develop applications for a range of problems using object-oriented programming
techniques
List of Experiments
1. Write a C++ Program to display Names, Roll No., and grades of 3 students who have appeared in the
examination. Declare the class of name, Roll No. and grade. Create an array of class objects. Read and
display the contents of the array.

2. Write a C++ program to declare Struct. Initialize and display contents of member variables.
3. Write a C++ program to declare a class. Declare pointer to class. Initialize and display the
contents of the class member.
4. Given that an EMPLOYEE class contains following members: data members: Employee numbe
Employee name, Basic, DA, IT, Net Salary and print data members.
5. Write a C++ program to read the data of N employee and compute Net salary of each employee
(DA=52% of Basic and Income Tax (IT) =30% of the gross salary).

6. Write a C++ to illustrate the concepts of console I/O operations.

7. Write a C++ program to use scope resolution operator. Display the various values of the same
variables declared at different scope levels.
8. Write a C++ program to allocate memory using new operator.
9. Write a C++ program to create multilevel inheritance. (Hint: Classes A1, A2, A3)
10. Write a C++ program to create an array of pointers. Invoke functions using array objects.
11. Write a C++ program to use pointer for both base and derived classes and call the member
function. Use Virtual keyword.
*MC309/*MC409: GENDER SENSITIZATION LAB
(An Activity-based Course)
B.TECH II Year II Sem. L T P
0 0 2
COURSE DESCRIPTION
This course offers an introduction to Gender Studies, an interdisciplinary field that asks critical questions
about the meanings of sex and gender in society. The primary goal of this course is to familiarize
students with key issues, questions and debates in Gender Studies, both historical and contemporar
It draws on multiple disciplines – such as literature, history, economics, psychology, sociology, philosoph
political science, anthropology and media studies – to examine cultural assumptions about sex, gend
and sexuality.

This course integrates analysis of current events through student presentations, aiming to increase
awareness of contemporary and historical experiences of women, and of the multiple ways that sex and
gender interact with race, class, caste, nationality and other social identities. This course also seeks to bu
an understanding and initiate and strengthen programmes combating gender-based violence and
discrimination. The course also features several exercises and reflective activities designed to exam
the concepts of gender, gender-based violence, sexuality, and rights. It will further
explore the impact of gender-based violence on education, health and development.

Objectives of the Course:

 To develop students’ sensibility with regard to issues of gender in contemporary India.
 To provide a critical perspective on the socialization of men and women.
 To introduce students to information about some key biological aspects of genders.
 To expose the students to debates on the politics and economics of work.
 To help students reflect critically on gender violence.
 To expose students to more egalitarian interactions between men and women.
Learning Outcomes:
 Students will have developed a better understanding of important issues related to gender in
contemporary India.
 Students will be sensitized to basic dimensions of the biological, sociological, psychological and legal
aspects of gender. This will be achieved through discussion of materials derived from research, facts,
everyday life, literature and film.
 Students will attain a finer grasp of how gender discrimination works in our society and how to counter
 Students will acquire insight into the gendered division of labour and its relation to politics and
economics.
 Men and women students and professionals will be better equipped to work and live together as equal
 Students will develop a sense of appreciation of women in all walks of life.
 Through providing accounts of studies and movements as well as the new laws that provide protection
and relief to women, the textbook will empower students to understand and respond to gender violence.

UNIT - I: UNDERSTANDING GENDER

Introduction: Definition of Gender-Basic Gender Concepts and Terminology-Exploring Attitudes towards
Gender-Construction of Gender-Socialization: Making Women, Making Men
- Preparing for Womanhood. Growing up Male. First lessons in Caste.

UNIT – II: GENDER ROLES AND RELATIONS

Two or Many? -Struggles with Discrimination-Gender Roles and Relations-Types of Gender Roles- Gender
Roles and Relationships Matrix-Missing Women-Sex Selection and Its Consequences-
Declining Sex Ratio. Demographic Consequences-Gender Spectrum: Beyond the Binary

UNIT – III: GENDER AND LABOUR

Division and Valuation of Labour-Housework: The Invisible Labor- “My Mother doesn’t Work.” “Share the
Load.”-Work: Its Politics and Economics -Fact and Fiction. Unrecognized and Unaccounted work. - Gender
Development Issues-Gender, Governance and Sustainable Development-Gender and Human Rights-Gende
and Mainstreaming

UNIT – IV: GENDER - BASED VIOLENCE

The Concept of Violence- Types of Gender-based Violence-Gender-based Violence from a Human Right
Perspective-Sexual Harassment: Say No! -Sexual Harassment, not Eve-teasing- Coping with Everyday
Harassment- Further Reading: “Chupulu”.
Domestic Violence: Speaking OutIs Home a Safe Place? -When Women Unite [Film]. Rebuilding Lives.
Thinking about Sexual Violence Blaming the Victim-“I Fought for my Life….”

UNIT – V: GENDER AND CULTURE

Gender and Film-Gender and Electronic Media-Gender and Advertisement-Gender and Popular
Literature- Gender Development Issues-Gender Issues-Gender Sensitive Language-Gender and Popula
Literature - Just Relationships: Being Together as Equals
Mary Kom and Onler. Love and Acid just do not Mix. Love Letters. Mothers and Fathers. Rosa Parks-
The Brave Heart.

Note: Since it is Interdisciplinary Course, Resource Persons can be drawn from the fields of English Literature
Sociology or Political Science or any other qualified faculty who has expertise in this field from engineerin
departments.
 Classes will consist of a combination of activities: dialogue-based lectures, discussions, collaborative
learning activities, group work and in-class assignments. Apart from the above prescribed book, Teachers ca
make use of any authentic materials related to the topics given in the syllabus on “Gender”.
 👉 ESSENTIAL READING: The Textbook, “Towards a World of Equals: A Bilingual Textbook on Gender” written
by A.Suneetha, Uma Bhrugubanda, DuggiralaVasanta, Rama Melkote, Vasudha Nagaraj, Asma
Rasheed, Gogu Shyamala, Deepa Sreenivas and Susie Tharu published by Telugu Akademi, Telang
Government in 2015.

ASSESSMENT AND GRADING:

 Discussion & Classroom Participation: 20%
 Project/Assignment: 30%
 End Term Exam: 50%

CS401PC: DISCRETE MATHEMATICS

B.TECH II Year II Sem. L T P
3 0 0
Prerequisites: An understanding of Mathematics in general is sufficient.
Course Objectives
• Introduces the elementary discrete mathematics for computer science and engineering.
• Topics include formal logic notation, methods of proof, induction, sets, relations, graph theory,
permutations and combinations, counting principles; recurrence relations and generating functions.

Course Outcomes:
• Ability to understand and construct precise mathematical proofs
• Ability to use logic and set theory to formulate precise statements
• Ability to analyze and solve counting problems on finite and discrete structures
• Ability to describe and manipulate sequences
• Ability to apply graph theory in solving computing problems

UNIT - I
The Foundations: Logic and Proofs: Propositional Logic, Applications of Propositional Logic, Propositio
Equivalence, Predicates and Quantifiers, Nested Quantifiers, Rules of Inference, Introduction to Proo
Proof Methods and Strategy.

UNIT - II
Basic Structures, Sets, Functions, Sequences, Sums, Matrices and Relations Sets, Functions,
Sequences & Summations, Cardinality of Sets and Matrices Relations, Relations and Their Properties, n-ary
Relations and Their Applications, Representing Relations, Closures of Relations, Equivalence Relations,
Partial Orderings.

UNIT - III
Algorithms, Induction and Recursion: Algorithms, The Growth of Functions, Complexity of Algorith
Induction and Recursion: Mathematical Induction, Strong Induction and Well-Ordering, Recursive
Definitions and Structural Induction, Recursive Algorithms, Program Correctness

UNIT - IV
Discrete Probability and Advanced Counting Techniques: An Introduction to Discrete Probability, Probability
Theory, Bayes’ Theorem, Expected Value and Variance
Advanced Counting Techniques: Recurrence Relations, Solving Linear Recurrence Relations, Divide-an
Conquer Algorithms and Recurrence Relations, Generating Functions, Inclusion-Exclusion,
Applications of Inclusion-Exclusion
UNIT - V
Graphs: Graphs and Graph Models, Graph Terminology and Special Types of Graphs, Representing Graphs
and Graph Isomorphism, Connectivity, Euler and Hamilton Paths, Shortest-Path Problems, Planar Grap
Graph Coloring.
Trees: Introduction to Trees, Applications of Trees, Tree Traversal, Spanning Trees, Minimum
Spanning Trees

TEXT BOOK:
1. Discrete Mathematics and its Applications with Combinatorics and Graph Theory- Kenneth H Rosen, 7 t
Edition, TMH.
REFERENCES BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science-J.P. Tremblay and R. Manohar
TMH,
2. Discrete Mathematics for Computer Scientists & Mathematicians: Joe L. Mott, Abraham Kandel,
Teodore P. Baker, 2nd ed, Pearson Education.
3. Discrete Mathematics- Richard Johnsonbaugh, 7Th Edn., Pearson Education.
4. Discrete Mathematics with Graph Theory- Edgar G. Goodaire, Michael M. Parmenter.
5. Discrete and Combinatorial Mathematics - an applied introduction: Ralph.P. Grimald, 5th edition, Pearso
Education.

SM402MS/SM305MS: BUSINESS ECONOMICS AND FINANCIAL ANALYSIS

B.TECH II Year II Sem. L T P
3 0 0
Prerequisites: None
Course Objective: To learn the basic Business types, impact of the Economy on Business and Firms
specifically. To analyze the Business from the Financial Perspective.
Course Outcome: The students will understand the various Forms of Business and the impact of
economic variables on the Business. The Demand, Supply, Production, Cost, Market Structure, Pricing
aspects are learnt. The Students can study the firm’s financial position by analysing the Financial
Statements of a Company.

UNIT – I
Introduction to Business and Economics:
Business: Structure of Business Firm, Theory of Firm, Types of Business Entities, Limited Liability
Companies, Sources of Capital for a Company, Non-Conventional Sources of Finance.
Economics: Significance of Economics, Micro and Macro Economic Concepts, Concepts and Importan
of National Income, Inflation, Money Supply in Inflation, Business Cycle, Features and Phases of
Business Cycle. Nature and Scope of Business Economics, Role of Business Economist,
Multidisciplinary nature of Business Economics.

UNIT - II
Demand and Supply Analysis:
Elasticity of Demand: Elasticity, Types of Elasticity, Law of Demand, Measurement and Significance of
Elasticity of Demand, Factors affecting Elasticity of Demand, Elasticity of Demand in decision making,
Demand Forecasting: Characteristics of Good Demand Forecasting, Steps in Demand Forecasting, Method
Demand Forecasting.
Supply Analysis: Determinants of Supply, Supply Function & Law of Supply.
UNIT - III
Production, Cost, Market Structures & Pricing:
Production Analysis: Factors of Production, Production Function, Production Function with one variab
input, two variable inputs, Returns to Scale, Different Types of Production Functions.
Cost analysis: Types of Costs, Short run and Long run Cost Functions.
Market Structures: Nature of Competition, Features of Perfect competition, Monopoly, Oligopoly,
Monopolistic Competition.
Pricing: Types of Pricing, Product Life Cycle based Pricing, Break Even Analysis, Cost Volume Profit
Analysis.

UNIT - IV
Financial Accounting: Accounting concepts and Conventions, Accounting Equation, Double-Entry syste
of Accounting, Rules for maintaining Books of Accounts, Journal, Posting to Ledger, Preparation of Trial
Balance, Elements of Financial Statements, Preparation of Final Accounts.

UNIT - V
Financial Analysis through Ratios: Concept of Ratio Analysis, Liquidity Ratios, Turnover Ratios,
Profitability Ratios, Proprietary Ratios, Solvency, Leverage Ratios (simple problems).
Introduction to Fund Flow and Cash Flow Analysis (simple problems).

TEXT BOOKS:
1. D.D. Chaturvedi, S.L. Gupta, Business Economics - Theory and Applications, International Book
House Pvt. Ltd. 2013.
2. Dhanesh K Khatri, Financial Accounting, Tata McGraw Hill, 2011.
3. Geethika Ghosh, Piyali Gosh, Purba Roy Choudhury, Managerial Economics, 2e, Tata McGraw Hill
Education Pvt. Ltd. 2012.

REFERENCE BOOKS:
1. Paresh Shah, Financial Accounting for Management 2e, Oxford Press, 2015.
2. S.N. Maheshwari, Sunil K Maheshwari, Sharad K Maheshwari, Financial Accounting, 5e, Vikas Publicatio
2013.

CS403PC: OPERATING SYSTEMS

B.TECH II Year II Sem. L T P
3 0 0
Prerequisites:
• A course on “Computer Programming and Data Structures”.
• A course on “Computer Organization and Architecture”.

Course Objectives:
• Introduce operating system concepts (i.e., processes, threads, scheduling, synchronization,
deadlocks, memory management, file and I/O subsystems and protection)
• Introduce the issues to be considered in the design and development of operating system
• Introduce basic Unix commands, system call interface for process management, interprocess
communication and I/O in Unix

Course Outcomes:
 Will be able to control access to a computer and the files that may be shared
 Demonstrate the knowledge of the components of computer and their respective roles in
computing.
 Ability to recognize and resolve user problems with standard operating environments.
 Gain practical knowledge of how programming languages, operating systems, and
architectures interact and how to use each effectively.
UNIT - I
Operating System - Introduction, Structures - Simple Batch, Multiprogrammed, Time-shared, Personal
Computer, Parallel, Distributed Systems, Real-Time Systems, System components, Operating
System services, System Calls

UNIT - II
Process and CPU Scheduling - Process concepts and scheduling, Operations on processes, Cooperat
Processes, Threads, and Interposes Communication, Scheduling Criteria, Scheduling Algorithms, Multi
-Processor Scheduling.
System call interface for process management-fork, exit, wait, waitpid, exec

UNIT - III
Deadlocks - System Model, Deadlocks Characterization, Methods for Handling Deadlocks, Deadlock
Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock
Process Management and Synchronization - The Critical Section Problem, Synchronization Hardware,
Semaphores, and Classical Problems of Synchronization, Critical Regions, Monitors Interprocess
Communication Mechanisms: IPC between processes on a single computer system,
IPC between processes on different systems, using pipes, FIFOs, message queues, shared memory.

UNIT - IV
Memory Management and Virtual Memory - Logical versus Physical Address Space, Swapping,
Contiguous Allocation, Paging, Segmentation, Segmentation with Paging, Demand Paging, Page
Replacement, Page Replacement Algorithms.

UNIT - V
File System Interface and Operations -Access methods, Directory Structure, Protection, File System Structur
Allocation methods, Free-space Management. Usage of open, create, read, write, close, lseek, stat, ioc
system calls.

TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John Wiley
2. Advanced programming in the UNIX environment, W.R. Stevens, Pearson education.

REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles Stallings, Fifth Edition–2005, Pearson Education/P
2. Operating System A Design Approach- Crowley, TMH.
3. Modern Operating Systems, Andrew S. Tanenbaum 2nd edition, Pearson/PHI
4. UNIX programming environment, Kernighan and Pike, PHI/ Pearson Education
5. UNIX Internals -The New Frontiers, U. Vahalia, Pearson Education.

CS404PC: DATABASE MANAGEMENT SYSTEMS

B.TECH II Year II Sem. L T P
3 1 0
Prerequisites: A course on “Data Structures”.
Course Objectives:
• To understand the basic concepts and the applications of database systems.
• To master the basics of SQL and construct queries using SQL.
• Topics include data models, database design, relational model, relational algebra, transaction control,
concurrency control, storage structures and access techniques.
Course Outcomes:
 Gain knowledge of fundamentals of DBMS, database design and normal forms
 Master the basics of SQL for retrieval and management of data.
 Be acquainted with the basics of transaction processing and concurrency control.
 Familiarity with database storage structures and access techniques

UNIT - I
Database System Applications: A Historical Perspective, File Systems versus a DBMS, the Data Model, Leve
of Abstraction in a DBMS, Data Independence, Structure of a DBMS
Introduction to Database Design: Database Design and ER Diagrams, Entities, Attributes, and Entity Sets,
Relationships and Relationship Sets, Additional Features of the ER Model, Conceptual Design
With the ER Model

UNIT - II
Introduction to the Relational Model: Integrity constraint over relations, enforcing integrity
constraints, querying relational data, logical data base design, introduction to views, destroying/altering
tables and views.
Relational Algebra, Tuple relational Calculus, Domain relational calculus.

UNIT - III
SQL: QUERIES, CONSTRAINTS, TRIGGERS: form of basic SQL query, UNION, INTERSECT, and
EXCEPT, Nested Queries, aggregation operators, NULL values, complex integrity constraints in SQL, trigge
and active data bases.
Schema Refinement: Problems caused by redundancy, decompositions, problems related to
decomposition, reasoning about functional dependencies, FIRST, SECOND, THIRD normal forms, BCN
lossless join decomposition, multi-valued dependencies, FOURTH normal form, FIFTH normal
form.

UNIT - IV
Transaction Concept, Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for serializability, Lock Base
Protocols, Timestamp Based Protocols, Validation- Based Protocols, Multiple Granularity, Recovery an
Atomicity, Log–Based Recovery, Recovery with Concurrent Transactions.

UNIT - V
Data on External Storage, File Organization and Indexing, Cluster Indexes, Primary and Secondary Indexes
Index data Structures, Hash Based Indexing, Tree base Indexing, Comparison of File Organizations,
Indexes and Performance Tuning, Intuitions for tree Indexes, Indexed Sequential
Access Methods (ISAM), B+ Trees: A Dynamic Index Structure.

TEXT BOOKS:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc Graw Hill
3rd Edition
2. Database System Concepts, Silberschatz, Korth, Mc Graw hill, V edition.

REFERENCE BOOKS:
1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C. J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S.Shah and V. Shah, SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL,Shah, PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student Edition.

CS405PC: JAVA PROGRAMMING

 B.TECH II Year II Sem. L T P
3 1 0
Course Objectives:
• To introduce the object-oriented programming concepts.
• To understand object-oriented programming concepts, and apply them in solving problems.
• To introduce the principles of inheritance and polymorphism; and demonstrate how they relate to the
design of abstract classes
• To introduce the implementation of packages and interfaces
• To introduce the concepts of exception handling and multithreading.
• To introduce the design of Graphical User Interface using applets and swing controls.

Course Outcomes:
• Able to solve real world problems using OOP techniques.
• Able to understand the use of abstract classes.
• Able to solve problems using java collection framework and I/o classes.
• Able to develop multithreaded applications with synchronization.
• Able to develop applets for web applications.
• Able to design GUI based applications

UNIT - I
Object-Oriented Thinking- A way of viewing world – Agents and Communities, messages and metho
Responsibilities, Classes and Instances, Class Hierarchies- Inheritance, Method binding, Overriding an
Exceptions, Summary of Object-Oriented concepts. Java buzzwords, An Overview of Java, Data types,
Variables and Arrays, operators, expressions, control statements, Introducing classes, Methods and
Classes, String handling.
Inheritance– Inheritance concept, Inheritance basics, Member access, Constructors, Creating
Multilevel hierarchy, super uses, using final with inheritance, Polymorphism-ad hoc polymorphism, pure
polymorphism, method overriding, abstract classes, Object class, forms of inheritance- specialization,
specification, construction, extension, limitation, combination, benefits of inheritance, costs of
inheritance.

UNIT - II
Packages- Defining a Package, CLASSPATH, Access protection, importing packages.
Interfaces- defining an interface, implementing interfaces, Nested interfaces, applying interfaces,
variables in interfaces and extending interfaces.
Stream based I/O (java.io) – The Stream classes-Byte streams and Character streams, Reading
console Input and Writing Console Output, File class, Reading and writing Files, Random access file
operations, The Console class, Serialization, Enumerations, auto boxing, generics.

UNIT - III
Exception handling - Fundamentals of exception handling, Exception types, Termination or
resumptive models, Uncaught exceptions, using try and catch, multiple catch clauses, nested try
statements, throw, throws and finally, built- in exceptions, creating own exception sub classes.
Multithreading- Differences between thread-based multitasking and process-based multitasking, Java
thread model, creating threads, thread priorities, synchronizing threads, inter thread communication.

UNIT - IV
The Collections Framework (java.util)- Collections overview, Collection Interfaces, The Collection class
Array List, Linked List, Hash Set, Tree Set, Priority Queue, Array Deque. Accessing a Collection via
an Iterator, Using an Iterator, The For-Each alternative, Map Interfaces and Classes, Comparators, Collectio
algorithms, Arrays, The Legacy Classes and Interfaces- Dictionary, Hashtable, Properties, Stack, Vector
More Utility classes, String Tokenizer, Bit Set, Date, Calendar, Random, Formatter, Scanner

UNIT - V
GUI Programming with Swing – Introduction, limitations of AWT, MVC architecture, components, container
Understanding Layout Managers, Flow Layout, Border Layout, Grid Layout, Card Layout, Grid Bag Layout.
Event Handling- The Delegation event model- Events, Event sources, Event Listeners, Event classes, Handl
mouse and keyboard events, Adapter classes, Inner classes, Anonymous Inner classes.
A Simple Swing Application, Applets – Applets and HTML, Security Issues, Applets and Applications, passing
parameters to applets. Creating a Swing Applet, Painting in Swing, A Paint example, Exploring Swing
Controls- JLabel and Image Icon, JText Field, The Swing Buttons- JButton, JToggle Button,
JCheck Box, JRadio Button, JTabbed Pane, JScroll Pane, JList, JCombo Box, Swing Menus, Dialogs.

TEXT BOOKS:
1. Java The complete reference, 9th edition, Herbert Schildt, McGraw Hill Education (India) Pvt. Ltd.
2. Understanding Object-Oriented Programming with Java, updated edition, T. Budd, Pearson
Education.

REFERENCE BOOKS:
1. An Introduction to programming and OO design using Java, J. Nino and F.A. Hosch, John Wiley & sons
2. Introduction to Java programming, Y. Daniel Liang, Pearson Education.
3. Object Oriented Programming through Java, P. Radha Krishna, University Press.
4. Programming in Java, S. Malhotra, S. Chudhary, 2nd edition, Oxford Univ. Press.
5. Java Programming and Object-oriented Application Development, R. A. Johnson, Cengage Learning.

CS406PC: OPERATING SYSTEMS LAB

(Using UNIX/LINUX)
B.TECH II Year II Sem. L T P
0 0 3
Prerequisites:
 A course on “Programming for Problem Solving”.
 A course on “Computer Organization and Architecture”.

Co-requisite:
 A course on “Operating Systems”.
Course Objectives:
 To provide an understanding of the design aspects of operating system concepts through
simulation
 Introduce basic Unix commands, system call interface for process management, interprocess
communication and I/O in Unix

Course Outcomes:
 Simulate and implement operating system concepts such as scheduling, deadlock
management, file management and memory management.
 Able to implement C programs using Unix system calls
List of Experiments:
1. Write C programs to simulate the following CPU Scheduling algorithms
a) FCFS b) SJF c) Round Robin d) priority
2. Write programs using the I/O system calls of UNIX/LINUX operating system (open, read, write, close,
fcntl, seek, stat, opendir, readdir)
3. Write a C program to simulate Bankers Algorithm for Deadlock Avoidance and Prevention.
4. Write a C program to implement the Producer – Consumer problem using semaphores using UNIX/LINU
system calls.
5. Write C programs to illustrate the following IPC mechanisms
a) Pipes b) FIFOs c) Message Queues d) Shared Memory
6. Write C programs to simulate the following memory management techniques
a) Paging b) Segmentation

TEXT BOOKS:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 7th Edition, John Wiley
2. Advanced programming in the Unix environment, W.R.Stevens, Pearson education.

REFERENCE BOOKS:
1. Operating Systems – Internals and Design Principles, William Stallings, Fifth Edition–2005, Pearson
Education/PHI
2. Operating System - A Design Approach-Crowley, TMH.
3. Modern Operating Systems, Andrew S Tanenbaum, 2nd edition, Pearson/PHI
4. UNIX Programming Environment, Kernighan and Pike, PHI/Pearson Education
5. UNIX Internals: The New Frontiers, U. Vahalia, Pearson Education

CS407PC: DATABASE MANAGEMENT SYSTEMS LAB

B.TECH II Year II Sem. L T P
0 0 3
Co-requisites:
• Co-requisite of course “Database Management Systems”
Course Objectives:
• Introduce ER data model, database design and normalization
• Learn SQL basics for data definition and data manipulation

Course Outcomes:
• Design database schema for a given application and apply normalization
• Acquire skills in using SQL commands for data definition and data manipulation.
• Develop solutions for database applications using procedures, cursors and triggers

List of Experiments:
1. Concept design with E-R Model
2. Relational Model
3. Normalization
4. Practicing DDL commands
5. Practicing DML commands
6. Querying (using ANY, ALL, IN, Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.)
7. Queries using Aggregate functions, GROUP BY, HAVING and Creation and dropping of Views.
8. Triggers (Creation of insert trigger, delete trigger, update trigger)
9. Procedures
10. Usage of Cursors
TEXT BOOKS:
1. Database Management Systems, Raghurama Krishnan, Johannes Gehrke, Tata Mc Graw Hill, 3rd Editio
2. Database System Concepts, Silberschatz, Korth, McGraw Hill, V edition.

REFERENCES BOOKS:
1. Database Systems design, Implementation, and Management, Peter Rob & Carlos Coronel 7th Edition.
2. Fundamentals of Database Systems, Elmasri Navrate, Pearson Education
3. Introduction to Database Systems, C.J. Date, Pearson Education
4. Oracle for Professionals, The X Team, S. Shah and V. Shah, SPD.
5. Database Systems Using Oracle: A Simplified guide to SQL and PL/SQL, Shah, PHI.
6. Fundamentals of Database Management Systems, M. L. Gillenson, Wiley Student Edition.

CS408PC: JAVA PROGRAMMING LAB

B.TECH II Year II Sem. L T P
0 0 2
Course Objectives:
• To write programs using abstract classes.
• To write programs for solving real world problems using java collection frame work.
• To write multithreaded programs.
• To write GUI programs using swing controls in Java.
• To introduce java compiler and eclipse platform.
• To impart hands on experience with java programming.

Course Outcomes:
• Able to write programs for solving real world problems using java collection frame work.
• Able to write programs using abstract classes.
• Able to write multithreaded programs.
• Able to write GUI programs using swing controls in Java.

Note:
1. Use LINUX and MySQL for the Lab Experiments. Though not mandatory, encourage the use of Eclipse
platform.
2. The list suggests the minimum program set. Hence, the concerned staff is requested to add
more problems to the list as needed.

List of Experiments:
1. Use Eclipse or Net bean platform and acquaint with the various menus. Create a test project, add a tes
class, and run it. See how you can use auto suggestions, auto fill. Try code formatter and code refactoring
like renaming variables, methods, and classes. Try debug step by step with a small program of about 10 t
15 lines which contains at least one if else condition and a for loop.

2. Write a Java program that works as a simple calculator. Use a grid layout to arrange buttons for the dig
and for the +, -,*, % operations. Add a text field to display the result. Handle any possible exceptions like
divided by zero.
3. a) Develop an applet in Java that displays a simple message.
b) Develop an applet in Java that receives an integer in one text field, and computes its factorial Value an
returns it in another text field, when the button named “Compute” is clicked.
4. Write a Java program that creates a user interface to perform integer divisions. The user enters two
numbers in the text fields, Num1 and Num2. The division of Num1 and Num 2 is displayed in the Result fie
when the Divide button is clicked. If Num1 or Num2 were not an integer, the program would throw a
Number Format Exception. If Num2 were Zero, the program would throw an Arithmetic Exception.
Display the exception in a message dialog box.

5. Write a Java program that implements a multi-thread application that has three threads. First thread
generates random integer every 1 second and if the value is even, second thread computes the square of
the number and prints. If the value is odd, the third thread will print the value of cube of
the number.

6. Write a Java program for the following: Create a doubly linked list of elements. Delete a given element
from the above list.

Display the contents of the list after deletion.

7. Write a Java program that simulates a traffic light. The program lets the user select one of three lights
red, yellow, or green with radio buttons. On selecting a button, an appropriate message with “Stop” or
“Ready” or “Go” should appear above the buttons in selected color. Initially, there is no message shown.

8. Write a Java program to create an abstract class named Shape that contains two integers and an emp
method named print Area (). Provide three classes named Rectangle, Triangle, and Circle such that each o
of the classes extends the class Shape. Each one of the classes contains only the method print Area () tha
prints the area of the given shape.

9. Suppose that a table named Table.txt is stored in a text file. The first line in the file is the header, and
the remaining lines correspond to rows in the table. The elements are separated by commas. Write a java
program to display the table using Labels in Grid Layout.
10. Write a Java program that handles all mouse events and shows the event name at the center of the
window when a mouse event is fired (Use Adapter classes).
11. Write a Java program that loads names and phone numbers from a text file where the data is
organized as one line per record and each field in a record are separated by a tab (\t). It takes a name o
phone number as input and prints the corresponding other value from the hash table (hint: use hash table

12. Write a Java program that correctly implements the producer – consumer problem using the
concept of interthread communication.
13. Write a Java program to list all the files in a directory including the files present in all its
subdirectories.
14. Write a Java program that implements Quick sort algorithm for sorting a list of names in ascending
order
15. Write a Java program that implements Bubble sort algorithm for sorting in descending order and
also shows the number of interchanges occurred for the given set of integers.
REFERENCE BOOKS
1. Java for Programmers, P. J. Deitel and H. M. Deitel, 10th Edition Pearson education.
2. Thinking in Java, Bruce Eckel, Pearson Education.
3. Java Programming, D. S. Malik and P. S. Nair, Cengage Learning.
4. Core Java, Volume 1, 9th edition, Cay S. Horstmann and G Cornell, Pearson.

*MC409/*MC309: CONSTITUTION OF INDIA

B.TECH II Year II Sem. L T P
3 0 0
The Constitution of India is the supreme law of India. Parliament of India cannot make any law which
violates the Fundamental Rights enumerated under the Part III of the Constitution. The Parliament
India has been empowered to amend the Constitution under Article 368, however, it cannot use this
power to change the “basic structure” of the constitution, which has been ruled and explained by the
Supreme Court of India in its historical judgments. The Constitution of India reflects the idea of
“Constitutionalism” – a modern and progressive concept historically developed by the thinkers of
“liberalism” – an ideology which has been recognized as one of the most popular political ideology and res
of historical struggles against arbitrary use of sovereign power by state. The historic revolutions in Franc
England, America and particularly European Renaissance and Reformation movement have resulted
into progressive legal reforms in the form of “constitutionalism” in many countries. The Constitution
India was made by borrowing models and principles from many countries including United Kingdom and
America.

The Constitution of India is not only a legal document but it also reflects social, political and economic
perspectives of the Indian Society. It reflects India’s legacy of “diversity”. It has been said that Indian
constitution reflects ideals of its freedom movement; however, few critics have argued that it does not tru
incorporate our own ancient legal heritage and cultural values. No law can be “static” and therefore the
Constitution of India has also been amended more than one hundred times. These amendments
reflect political, social and economic developments since the year 1950. The Indian judiciary and
particularly the Supreme Court of India has played an historic role as the guardian of people. It has been
protecting not only basic ideals of the Constitution but also strengthened the same through progressive
interpretations of the text of the Constitution. The judicial activism of the Supreme Court of India and its
historic contributions has been recognized throughout the world and it gradually
made it “as one of the strongest court in the world”.

Course content
1. Meaning of the constitution law and constitutionalism
2. Historical perspective of the Constitution of India
3. Salient features and characteristics of the Constitution of India
4. Scheme of the fundamental rights
5. The scheme of the Fundamental Duties and its legal status
6. The Directive Principles of State Policy – Its importance and implementation
7. Federal structure and distribution of legislative and financial powers between the Union and the States
8. Parliamentary Form of Government in India – The constitution powers and status of the Presid
of India
9. Amendment of the Constitutional Powers and Procedure
10. The historical perspectives of the constitutional amendments in India
11. Emergency Provisions: National Emergency, President Rule, Financial Emergency
12. Local Self Government – Constitutional Scheme in India
13. Scheme of the Fundamental Right to Equality
14. Scheme of the Fundamental Right to certain Freedom under Article 19
15. Scope of the Right to Life and Personal Liberty under Article 21

CS501PC: FORMAL LANGUAGES AND AUTOMATA THEORY

III Year B.Tech. CSE I-Sem L T P
3 0 0
Course Objectives
 To provide introduction to some of the central ideas of theoretical computer science from the perspect
of formal languages.
 To introduce the fundamental concepts of formal languages, grammars and automata theory.
 Classify machines by their power to recognize languages.
 Employ finite state machines to solve problems in computing.
 To understand deterministic and non-deterministic machines.
 To understand the differences between decidability and undecidability.

Course Outcomes
 Able to understand the concept of abstract machines and their power to recognize the languag
 Able to employ finite state machines for modeling and solving computing problems.
 Able to design context free grammars for formal languages.
 Able to distinguish between decidability and undecidability.
 Able to gain proficiency with mathematical tools and formal methods.

UNIT - I
Introduction to Finite Automata: Structural Representations, Automata and Complexity, the Central Concept
of Automata Theory – Alphabets, Strings, Languages, Problems.
Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite Automata with Epsil
Transitions.
Deterministic Finite Automata: Definition of DFA, How A DFA Process Strings, The language of DFA,
Conversion of NFA with €-transitions to NFA without €-transitions. Conversion of NFA to DFA, Moore and
Melay machines

UNIT - II
Regular Expressions: Finite Automata and Regular Expressions, Applications of Regular Expressions,
Algebraic Laws for Regular Expressions, Conversion of Finite Automata to Regular Expressions.
Pumping Lemma for Regular Languages, Statement of the pumping lemma, Applications of the
Pumping Lemma.
Closure Properties of Regular Languages: Closure properties of Regular languages, Decision
Properties of Regular Languages, Equivalence and Minimization of Automata.

UNIT - III
Context-Free Grammars: Definition of Context-Free Grammars, Derivations Using a Grammar, Leftmos
and Rightmost Derivations, the Language of a Grammar, Sentential Forms, Parse Tress, Applications
of Context-Free Grammars, Ambiguity in Grammars and Languages. Push Down Automat
Definition of the Pushdown Automaton, the Languages of a PDA, Equivalence of PDA's and CFG's, Accepta
by final state, Acceptance by empty stack, Deterministic Pushdown Automata. From CFG to PDA, From PD
to CFG.

UNIT - IV
Normal Forms for Context- Free Grammars: Eliminating useless symbols, Eliminating €-Productions. Chomsk
Normal form Griebech Normal form.
Pumping Lemma for Context-Free Languages: Statement of pumping lemma, Applications

Closure Properties of Context-Free Languages: Closure properties of CFL’s, Decision Properties of CFL's
Turing Machines: Introduction to Turing Machine, Formal Description, Instantaneous description, The
language of a Turing machine
UNIT - V
Types of Turing machine: Turing machines and halting
Undecidability: Undecidability, A Language that is Not Recursively Enumerable, An Undecidable
Problem That is RE, Undecidable Problems about Turing Machines, Recursive languages, Properties of
recursive languages, Post's Correspondence Problem, Modified Post Correspondence problem, Other
Undecidable Problems, Counter machines.

TEXT BOOKS:
1. Introduction to Automata Theory, Languages, and Computation, 3nd Edition, John E. Hopcroft, Rajeev
Motwani, Jeffrey D. Ullman, Pearson Education.
2. Theory of Computer Science – Automata languages and computation, Mishra and
Chandrashekaran, 2nd edition, PHI.

REFERENCE BOOKS:
1. Introduction to Languages and The Theory of Computation, John C Martin, TMH.
2. Introduction to Computer Theory, Daniel I.A. Cohen, John Wiley.
3. A Text book on Automata Theory, P. K. Srimani, Nasir S. F. B, Cambridge University Press.
4. Introduction to the Theory of Computation, Michael Sipser, 3rd edition, Cengage Learning.
5. Introduction to Formal languages Automata Theory and Computation Kamala Krithivasan, Rama
Pearson.

CS502PC: SOFTWARE ENGINEERING

III Year B.Tech. CSE I-Sem L T P
3 0 0
Course Objectives
 The aim of the course is to provide an understanding of the working knowledge of the
techniques for estimation, design, testing and quality management of large software
development projects.
 Topics include process models, software requirements, software design, software testing, softwa
process/product metrics, risk management, quality management and UML diagrams

Course Outcomes
 Ability to translate end-user requirements into system and software requirements, using e.g. UML, and
structure the requirements in a Software Requirements Document (SRD).
 Identify and apply appropriate software architectures and patterns to carry out high level design of a
system and be able to critically compare alternative choices.
 Will have experience and/or awareness of testing problems and will be able to develop a simple testing
report

UNIT - I
Introduction to Software Engineering: The evolving role of software, changing nature of software, software
myths.
A Generic view of process: Software engineering- a layered technology, a process framework, the capabilit
maturity model integration (CMMI), process patterns, process assessment, personal and team proces
models.
Process models: The waterfall model, incremental process models, evolutionary process models, the
unified process.

UNIT - II
Software Requirements: Functional and non-functional requirements, user requirements, system
requirements, interface specification, the software requirements document.
Requirements engineering process: Feasibility studies, requirements elicitation and analysis,
requirements validation, requirements management.
System models: Context models, behavioral models, data models, object models, structured methods.
UNIT - III
Design Engineering: Design process and design quality, design concepts, the design model. Creating an
architectural design: software architecture, data design, architectural styles and patterns, architectural
design, conceptual model of UML, basic structural modeling, class diagrams, sequence diagrams,
collaboration diagrams, use case diagrams, component diagrams.

UNIT - IV
Testing Strategies: A strategic approach to software testing, test strategies for conventional software, blac
box and white-box testing, validation testing, system testing, the art of debugging.
Product metrics: Software quality, metrics for analysis model, metrics for design model, metrics for
source code, metrics for testing, metrics for maintenance.

UNIT - V
Metrics for Process and Products: Software measurement, metrics for software quality.
Risk management: Reactive Vs proactive risk strategies, software risks, risk identification, risk
projection, risk refinement, RMMM, RMMM plan.

Quality Management: Quality concepts, software quality assurance, software reviews, formal technical
reviews, statistical software quality assurance, software reliability, the ISO 9000 quality standards.
TEXT BOOKS:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition, Mc Graw Hill
International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson, Pearson
Education.

REFERENCE BOOKS:
1. Software Engineering, an Engineering approach- James F. Peters, Witold Pedrycz, John Wiley.
2. Software Engineering principles and practice- Waman S Jawadekar, The Mc Graw-Hill Companies
3. Fundamentals of object-oriented design using UML Meiler page-Jones: Pearson Education.
g from I to L to its decimal equivalent.
m 1 to 50 to Roman equivalent
ollowing operations:
given position.
en string.
palindrome or not (Spelled same in both directions
etc.)
cter ch in the string S or – 1 if S doesn‘t contain

cters in a given text.

nter n numbers and then choose between finding

he choices are to be functions. Use a switch
ror message if an invalid choice is entered.

rs as follows:
*
**
***
**
*

search for a Key value in a given

search for a Key value in a given

ethod to sort a given list of

s using selection sort in descending order

s using insertion sort in ascending order

th C, McGraw-Hill
ata Structures, Cengage Learning, (3 rd Edition)
gramming Language, Prentice

16th Impression)
n, Pearson Education.
aw Hill, 4 th Edition

*MC109ES/*MC209ES: ENVIRONMENTAL SCIENCE

L T P C
3 0 0 0
r sustainable development.
and mitigation measures.
ons

will understand /evaluate / develop

ronmental regulations which in turn helps in

em. Classification, structure, and function of an

ds. Flow of energy, Biogeochemical cycles,
rvices and carrying capacity, Field visits.

and Non-Living resources, water resources: use

d droughts, Dams: benefits and problems. Mineral
xtracting and using mineral resources, Land
energy needs,
rnate energy source, case studies.

n, genetic, species and ecosystem diversity.

cial, ethical, aesthetic and optional values. India as
it. Threats to biodiversity: habitat loss, poaching of
: In-Situ and Ex-situ conservation. National

nmental Pollution: Classification of pollution, Air

nd Industrial pollution, Ambient air quality
drinking water quality standards. Soil Pollution:
ation of soil. Noise Pollution: Sources and Health
ste management, composition and
n control technologies: Wastewater Treatment

s of bioremediation. Global Environmental Issues

environment. Ozone depletion and Ozone
fication. International conventions /
ocol. NAPCC-GoI Initiatives.

ection act, Legal aspects Air Act- 1981, Water Act,

nt and handling rules, biomedical waste
ement and handling rules. EIA: EIA structure,
s of air, water, biological and Socio- economical
ironmental Management Plan

Development Goals, Population and its explosion,

ban Sprawl, Human health, Environmental
e Cycle assessment (LCA), Low carbon life style.
ate Courses by Erach Bharucha for University

ersity Press.

y Richard T. Wright. 2008 PHL Learning Private

Masters and Wendell P. Ela. 2008 PHI Learning Pvt.

. Keller, Wiley INDIA edition.

New age international publishers.
Dr. M. Anji Reddy 2007, BS Publications.
u, BS. Publications.

ECTRONICS
L T P C
3 0 0 3

Ts.

cuits
uits and fundamental concepts used in the design

uits and sequential circuits.

dents will be able to:

ombinational functions
uits
ates.

en circuited p-n junction, p-n junction as a rectifier,

ance, diffusion capacitance, diode switching
.
ve rectifier, Full wave rectifier, rectifier with

, transistor as an amplifier, CB, CE, CC

e operating point, self-bias or Emitter bias, bias
low frequencies, CE amplifier response, gain
two cascaded CE and multi stage CE amplifiers.
 MOSFET, low frequency CS and CD amplifiers,

R gate, AND gate, NOT, EXCLUSIVE OR gate, De

es, HTL and TTL gates, output
.

es of Boolean Algebra, Canonical and Standard

ums Simplification, Don’t-Care Conditions, NAND
y Adder-Subtractor, Decimal Adder, Binary
ultiplexers.

ents: Latches and flip flops, Analysis of Clocked

Shift Registers, Ripple Counters, Synchronous

Systems, 2/e, Jaccob Millman, Christos Halkias and

, Pearson, 2011.

m’s outline series, 1988.

ne series, 1994.
CTURES
L T P C
3 1 0 4
ng”.

eues.
bles, search trees, tries, heaps, graphs.

del the information in a problem.

data structure implementations or combinations.
sorting and pattern matching.
cluding hash tables, binary and general tree
es.

ist – singly linked list implementation, insertion,

s-Operations, array and linked representations of
nked representations.

ntation, operations - insertion, deletion and

ion-separate chaining, open addressing-

ng, extendible hashing.
 ion, Operations- Searching, Insertion and Deletion,
Insertion, Deletion and Searching, Red –Black,

Methods.
ting, Merge Sort.

ute force, the Boyer –Moore algorithm, the Knuth-

Suffix tries.

orowitz, S. Sahni and Susan Anderson Freed,

m, and M.J. Augenstein, PHI/Pearson

dition, R. F. Gilberg and B.A. Forouzan, Cengage

TATISTICAL METHODS
L T P C
3 1 0 4

of single and multiple random variables

king inferences

the student must be able to

ome case studies
her units
ach topic of study.

, Probability of an Event, Additive Rules,

le, Bayes’ Rule.
of a Random Variable, Discrete
ns, Statistical Independence.

Variance and Covariance of Random Variables,

ariables, Chebyshev’s Theorem. Discrete
nomial, Distribution, Geometric Distributions and

Distribution, Normal Distribution, Areas under the

mal Approximation to the Binomial, Gamma and

Some Important Statistics, Sampling

ral Limit Theorem, Sampling Distribution of
cal Inference, Classical Methods of Estimation.:
rediction Intervals, Tolerance Limits, Estimating
fference between Two Means, between Two
mation.
tistical Hypothesis, Tests Concerning a Single
on, Two Samples: Tests on Two

ochastic processes- Markov process.

der and Higher order Markov process, n- step
on, Markov analysis.

yers, Keying Ye, Probability & Statistics for

matical statistics, Khanna publications.

Ramnath Publishers, Meerut, Delhi

for Engineers, John Wiley & Sons Ltd, 2004.

s and scientists, Academic Press.

N AND ARCHITECTURE
L T P C
3 0 0 3
rocessors”.

computer organization and the basic architectural

ming of a simple digital computer and introduces

uter operations.
design, microprogrammed control unit,
d I/O systems, and multiprocessors

pact on processor design.

nctional units of a digital computer system.
signing and constructing a computer processor

ns with minimum hazards.

s stored in digital computers
 gital Computer, Definition of Computer
e.
ransfer language, Register Transfer, Bus and
o operations, shift micro operations, Arithmetic

des, Computer Registers Computer instructions,

nstructions, Input – Output and

ncing, micro program example, design of control

Instruction Formats, Addressing modes,

d Point Representation, Floating Point

ation Algorithms, Division Algorithms,

unit, Decimal Arithmetic operations.

nous data transfer, Modes of Transfer, Priority

Auxiliary memory, Associate Memory,

C Characteristics.
lining, Arithmetic Pipeline, Instruction Pipeline,

erconnection Structures, Interprocessor

ation, Cache Coherence.

Edition, Pearson/PHI.

sic, Safea Zaky, Vth Edition, McGraw Hill.

lings Sixth Edition, Pearson/PHI.
aum, 4th Edition, PHI/Pearson.

GRAMMING USING C++

L T P C
2 0 0 2
ng using C”.

ng the C++ language.

ce and polymorphism;
morphism
ect-oriented programming techniques

m solving, need for OOP paradigm, differences

verview of OOP concepts- Abstraction,

aration of variables, Expressions, Operators,

conversions, Pointers, Arrays, Pointers and
atement- if, switch, while, for, do, break,
les, Parameter passing, Default arguments,
ons. Dynamic memory allocation and de-
es.

ucture, Class objects, Class scope, this pointer,

ember functions, Constructors and
Data abstraction, ADT and information hiding.

nheritance, Defining the Base and Derived classes,

s construction, Destructors, Virtual base class.
nding, virtual functions, Dynamic binding through
virtual functions, Abstract classes,
ors.

ream I/O, File streams and String streams,

s, Formatted I/O.

ng an exception, The try block, Catching an

ck unwinding, Rethrowing an exception, Catching

ildt, Tata McGraw Hill.

, 4th Edition, Walter Savitch, Pearson Education.

strup, Pearson Education.

uganda, Wiley Dream Tech Press.
afore, Galigotia Publications Pvt Ltd.

TRONICS LAB
L T P C
0 0 2 1
Ts.

cuits
uits and fundamental concepts used in the design

uits and sequential circuits.

dents will be able to:

ational functions
uits
gates.

CC configurations
tion

us counter using flip-flops

TURES LAB
L T P C
0 0 3 1.5
ng”.

stacks and queues.

ife applications using basic elements like control

d data structures like stacks, queues and linked

ollowing operations on singly linked list.:

raversal
the following operations on doubly linked list.:
 raversal
the following operations on circular linked list.:

raversal
ations) using

rations) using

sorting methods to sort a given list of integers in

d non recursive functions to perform the

en list of integers:

al methods.

sal methods.

orowitz, S. Sahni and Susan Anderson Freed,

m, and M. J. Augenstein, PHI/Pearson

dition, R. F. Gilberg and B. A. Forouzan, Cengage

OP LAB
L T P C
0 0 3 1.5

ead over 60 hours. The modules include training on

tools including Word, Excel, Power Point and

er and its basic peripherals, the process of

m software like MS Windows, Linux and the
level troubleshooting process, tips and tricks
to disassemble and assemble to working condition
suggested to work similar tasks in the Laptop
ule introduces the different ways of hooking
and effectively usage of the internet. Usage of
would be covered. In addition, awareness of cyber
ng infected with the viruses, worms and other
ule would enable the students in crafting

e Microsoft suite of office tools and LaTeX.

s in a CPU and its functions. Draw the block

eripheral and submit to your instructor.
 le the PC back to working condition. Lab
va. Also students need to go through the video
ld be given as part of the course content.

ws on the personal computer. Lab instructor

puter. This computer should have windows

th both windows and Linux. Lab instructors should

en a PC which does not boot due to improper

y the problem and fix it to get the computer
ed by the instructor and followed up with a Viva.

n a malfunctioning CPU due to system software

t the computer back to working
tor and followed up with a Viva.

ld get connected to their Local Area Network and

IP setting. Finally students
websites and email. If there is no internet
ors to simulate the WWW on the LAN.
their web browsers with the LAN proxy settings,
g-ins like Macromedia Flash and JRE for applets

what search engines are and how to use the

ts for which they need to search on Google. This

arious threats on the internet and would be asked

y need to first install an antivirus software,
eir computer. Then they need to customize their
oid viruses and/or worms.

erview of LaTeX and Microsoft (MS) office 2007/

office 2007/ equivalent (FOSS) tool Word as word
ld be covered in each, Using LaTeX and word –
and resources, rulers, format painter in word.

Features to be covered:- Formatting Fonts in

Character Spacing, Borders and Colors,
n both LaTeX and Word.
ormatting Styles, Inserting table, Bullets and
note, Hyperlink, Symbols, Spell Check, Track

ble of Content, Newspaper columns, Images from

Images, Textboxes, Paragraphs and Mail Merge in
 of MS office 2007/ equivalent (FOSS) tool Excel as
eatures that would be covered in each. Using Excel
help and resources.

ines, Format Cells, Summation, auto fill,

ferencing, Formulae in excel – average,

heets, Hyper linking, Count function,

it cells, freeze panes, group and outline,

ing

ies and tools which help them create basic power

s: - PPT Orientation, Slide Layouts, Inserting Text,
hapes, Lines and Arrows in both LaTeX and
entation which needs to be replicated (exactly

ntations interactive. Topic covered during

Audio, Video, Objects, Tables and Charts.
point and presentations in LaTeX. Helps them
nt presentation. Topic covered during this week
pes of views (basic, presentation, slide slotter,
emplates, Hidden slides.

Gupta, WILEY Dreamtech

3rd edition Cheryl A Schmidt, WILEY Dreamtech
Solutions limited, Pearson Education.
oft)

uide Third Edition by David Anfinson and Ken

y Guide Third Edition by Patrick Regan

MMING LAB
L T P C
0 0 2 1
ng”.

ng the C++ language.

ce and polymorphism;
morphism

ems using object-oriented programming

grades of 3 students who have appeared in the
e. Create an array of class objects. Read and

d display contents of member variables.

pointer to class. Initialize and display the

g members: data members: Employee number,

a members.
ee and compute Net salary of each employee
oss salary).

O operations.
tor. Display the various values of the same

w operator.
ce. (Hint: Classes A1, A2, A3)
. Invoke functions using array objects.
nd derived classes and call the member

SITIZATION LAB
ourse)
L T P C
0 0 2 0

terdisciplinary field that asks critical questions

e primary goal of this course is to familiarize
nder Studies, both historical and contemporary.
y, economics, psychology, sociology, philosophy,
examine cultural assumptions about sex, gender,

ugh student presentations, aiming to increase

women, and of the multiple ways that sex and
er social identities. This course also seeks to build
combating gender-based violence and
ses and reflective activities designed to examine
and rights. It will further
, health and development.

f gender in contemporary India.

men and women.
iological aspects of genders.
economics of work.

tween men and women.

f important issues related to gender in

iological, sociological, psychological and legal

n of materials derived from research, facts,

ination works in our society and how to counter it.

of labour and its relation to politics and

ter equipped to work and live together as equals.

n in all walks of life.
as well as the new laws that provide protection
o understand and respond to gender violence.

and Terminology-Exploring Attitudes towards

en, Making Men
ons in Caste.

s and Relations-Types of Gender Roles- Gender

ection and Its Consequences-
Spectrum: Beyond the Binary

Labor- “My Mother doesn’t Work.” “Share the

Unrecognized and Unaccounted work. - Gender
Development-Gender and Human Rights-Gender

e-Gender-based Violence from a Human Rights

ent, not Eve-teasing- Coping with Everyday

hen Women Unite [Film]. Rebuilding Lives.

ht for my Life….”

and Advertisement-Gender and Popular

Gender Sensitive Language-Gender and Popular

etters. Mothers and Fathers. Rosa Parks-

can be drawn from the fields of English Literature or

lty who has expertise in this field from engineering

ogue-based lectures, discussions, collaborative

Apart from the above prescribed book, Teachers can
iven in the syllabus on “Gender”.
rld of Equals: A Bilingual Textbook on Gender” written
nta, Rama Melkote, Vasudha Nagaraj, Asma
usie Tharu published by Telugu Akademi, Telangana

THEMATICS
L T P C
3 0 0 3
is sufficient.

omputer science and engineering.

induction, sets, relations, graph theory,
currence relations and generating functions.

cal proofs
statements
e and discrete structures

blems

Applications of Propositional Logic, Propositional

ifiers, Rules of Inference, Introduction to Proofs,

atrices and Relations Sets, Functions,

s Relations, Relations and Their Properties, n-ary
Closures of Relations, Equivalence Relations,

Growth of Functions, Complexity of Algorithms

duction and Well-Ordering, Recursive
Program Correctness

Introduction to Discrete Probability, Probability

olving Linear Recurrence Relations, Divide-and-

Functions, Inclusion-Exclusion,
d Special Types of Graphs, Representing Graphs
on Paths, Shortest-Path Problems, Planar Graphs,

e Traversal, Spanning Trees, Minimum

atorics and Graph Theory- Kenneth H Rosen, 7 th

Computer Science-J.P. Tremblay and R. Manohar,

athematicians: Joe L. Mott, Abraham Kandel,

, Pearson Education.
odaire, Michael M. Parmenter.
ntroduction: Ralph.P. Grimald, 5th edition, Pearson

S AND FINANCIAL ANALYSIS

L T P C
3 0 0 3

t of the Economy on Business and Firms

rspective.
us Forms of Business and the impact of
Production, Cost, Market Structure, Pricing
financial position by analysing the Financial

es of Business Entities, Limited Liability

ntional Sources of Finance.
o Economic Concepts, Concepts and Importance
Business Cycle, Features and Phases of
Role of Business Economist,

Demand, Measurement and Significance of

d, Elasticity of Demand in decision making,
ecasting, Steps in Demand Forecasting, Methods of

& Law of Supply.

Function, Production Function with one variable
s of Production Functions.
Functions.
Perfect competition, Monopoly, Oligopoly,

Break Even Analysis, Cost Volume Profit

ions, Accounting Equation, Double-Entry system

urnal, Posting to Ledger, Preparation of Trial
Final Accounts.

ysis, Liquidity Ratios, Turnover Ratios,

Ratios (simple problems).
problems).

Theory and Applications, International Book

Hill, 2011.
anagerial Economics, 2e, Tata McGraw Hill

, Oxford Press, 2015.

hwari, Financial Accounting, 5e, Vikas Publications,

SYSTEMS
L T P C
3 0 0 3

ures”.
”.

, threads, scheduling, synchronization,

and protection)
d development of operating system
for process management, interprocess

es that may be shared

computer and their respective roles in

ndard operating environments.

anguages, operating systems, and
tch, Multiprogrammed, Time-shared, Personal
Systems, System components, Operating

cheduling, Operations on processes, Cooperating

heduling Criteria, Scheduling Algorithms, Multiple

t, waitpid, exec

thods for Handling Deadlocks, Deadlock

Recovery from Deadlock
Section Problem, Synchronization Hardware,
ritical Regions, Monitors Interprocess
ingle computer system,
FIFOs, message queues, shared memory.

s Physical Address Space, Swapping,

ation with Paging, Demand Paging, Page

ctory Structure, Protection, File System Structure,

open, create, read, write, close, lseek, stat, ioctl

er B. Galvin, Greg Gagne 7th Edition, John Wiley

. Stevens, Pearson education.

allings, Fifth Edition–2005, Pearson Education/PHI

edition, Pearson/PHI
PHI/ Pearson Education
Education.

EMENT SYSTEMS
L T P C
3 1 0 4

of database systems.
ng SQL.
al model, relational algebra, transaction control,
ques.
esign and normal forms
of data.
g and concurrency control.
s techniques

e Systems versus a DBMS, the Data Model, Levels

a DBMS
iagrams, Entities, Attributes, and Entity Sets,
the ER Model, Conceptual Design

int over relations, enforcing integrity

ign, introduction to views, destroying/altering

onal calculus.

QL query, UNION, INTERSECT, and

ues, complex integrity constraints in SQL, triggers

y, decompositions, problems related to

s, FIRST, SECOND, THIRD normal forms, BCNF,
OURTH normal form, FIFTH normal

n of Atomicity and Durability, Concurrent

of Isolation, Testing for serializability, Lock Based
d Protocols, Multiple Granularity, Recovery and
Transactions.

Cluster Indexes, Primary and Secondary Indexes,

e Indexing, Comparison of File Organizations,
dexes, Indexed Sequential
ure.

, Johannes Gehrke, Tata Mc Graw Hill

aw hill, V edition.

gement, Peter Rob & Carlos Coronel 7th Edition.

Pearson Education
Education
hah, SPD.
SQL and PL/SQL,Shah, PHI.
. Gillenson, Wiley Student Edition.

AMMING
 L T P C
3 1 0 4

ts.
and apply them in solving problems.
phism; and demonstrate how they relate to the

rfaces
multithreading.
ng applets and swing controls.

es.

k and I/o classes.

ronization.

ents and Communities, messages and methods,

es- Inheritance, Method binding, Overriding and
uzzwords, An Overview of Java, Data types,
tatements, Introducing classes, Methods and

Member access, Constructors, Creating

e, Polymorphism-ad hoc polymorphism, pure
t class, forms of inheritance- specialization,
bination, benefits of inheritance, costs of

ion, importing packages.

es, Nested interfaces, applying interfaces,

treams and Character streams, Reading

ing and writing Files, Random access file
, auto boxing, generics.

ndling, Exception types, Termination or

d catch, multiple catch clauses, nested try
creating own exception sub classes.
king and process-based multitasking, Java
izing threads, inter thread communication.
ew, Collection Interfaces, The Collection classes-
ueue, Array Deque. Accessing a Collection via
p Interfaces and Classes, Comparators, Collection
tionary, Hashtable, Properties, Stack, Vector
dar, Random, Formatter, Scanner

AWT, MVC architecture, components, containers.

out, Grid Layout, Card Layout, Grid Bag Layout.
t sources, Event Listeners, Event classes, Handling
s, Anonymous Inner classes.
curity Issues, Applets and Applications, passing
n Swing, A Paint example, Exploring Swing
tons- JButton, JToggle Button,
t, JCombo Box, Swing Menus, Dialogs.

dt, McGraw Hill Education (India) Pvt. Ltd.

a, updated edition, T. Budd, Pearson

ava, J. Nino and F.A. Hosch, John Wiley & sons

rson Education.
Krishna, University Press.
tion, Oxford Univ. Press.
evelopment, R. A. Johnson, Cengage Learning.

STEMS LAB
UX)
L T P C
0 0 3 1.5

of operating system concepts through

or process management, interprocess

pts such as scheduling, deadlock

t.
uling algorithms
d) priority
UX operating system (open, read, write, close,

eadlock Avoidance and Prevention.

mer problem using semaphores using UNIX/LINUX

nisms
d) Shared Memory
anagement techniques

er B. Galvin, Greg Gagne 7th Edition, John Wiley

Stevens, Pearson education.

William Stallings, Fifth Edition–2005, Pearson

edition, Pearson/PHI
PHI/Pearson Education
Education

ENT SYSTEMS LAB

L T P C
0 0 3 1.5

ms”

ization
ation

pply normalization
on and data manipulation.
edures, cursors and triggers

ON, INTERSECT, Constraints etc.)

G and Creation and dropping of Views.
ate trigger)
, Johannes Gehrke, Tata Mc Graw Hill, 3rd Edition
aw Hill, V edition.

gement, Peter Rob & Carlos Coronel 7th Edition.

Pearson Education
ducation
hah, SPD.
SQL and PL/SQL, Shah, PHI.
. Gillenson, Wiley Student Edition.

MMING LAB
L T P C
0 0 2 1

g java collection frame work.

g.

using java collection frame work.

a.

h not mandatory, encourage the use of Eclipse

e concerned staff is requested to add

e various menus. Create a test project, add a test

uto fill. Try code formatter and code refactoring
step by step with a small program of about 10 to
for loop.

. Use a grid layout to arrange buttons for the digits

the result. Handle any possible exceptions like

essage.
ne text field, and computes its factorial Value and
ompute” is clicked.
 erform integer divisions. The user enters two
of Num1 and Num 2 is displayed in the Result field
not an integer, the program would throw a
ogram would throw an Arithmetic Exception.

pplication that has three threads. First thread

is even, second thread computes the square of
will print the value of cube of

y linked list of elements. Delete a given element

program lets the user select one of three lights:

tton, an appropriate message with “Stop” or
ted color. Initially, there is no message shown.

d Shape that contains two integers and an empty

Rectangle, Triangle, and Circle such that each one
asses contains only the method print Area () that

xt file. The first line in the file is the header, and

ements are separated by commas. Write a java

nd shows the event name at the center of the

.
umbers from a text file where the data is
rd are separated by a tab (\t). It takes a name or
value from the hash table (hint: use hash tables).

e producer – consumer problem using the

ctory including the files present in all its

ithm for sorting a list of names in ascending

orithm for sorting in descending order and

ven set of integers.

Edition Pearson education.

Learning.
d G Cornell, Pearson.

TION OF INDIA
L T P C
3 0 0 0
ament of India cannot make any law which
e Part III of the Constitution. The Parliament of
under Article 368, however, it cannot use this
which has been ruled and explained by the
nstitution of India reflects the idea of
pt historically developed by the thinkers of
ne of the most popular political ideology and result
ower by state. The historic revolutions in France,
ce and Reformation movement have resulted
utionalism” in many countries. The Constitution of
many countries including United Kingdom and

t also reflects social, political and economic

y of “diversity”. It has been said that Indian
ever, few critics have argued that it does not truly
ues. No law can be “static” and therefore the
an one hundred times. These amendments
ce the year 1950. The Indian judiciary and
oric role as the guardian of people. It has been
o strengthened the same through progressive
activism of the Supreme Court of India and its
world and it gradually

of India

atus
e and implementation
ancial powers between the Union and the States
constitution powers and status of the President

e
ments in India
Rule, Financial Emergency
a

under Article 19
rticle 21

D AUTOMATA THEORY
L T P C
3 0 0 3
 theoretical computer science from the perspective

ages, grammars and automata theory.

es.
puting.
chines.
d undecidability.

es and their power to recognize the languages.

solving computing problems.
ages.
ility.
rmal methods.

Automata and Complexity, the Central Concepts

ems.
lication, Text Search, Finite Automata with Epsilon-

Process Strings, The language of DFA,

sitions. Conversion of NFA to DFA, Moore and

ons, Applications of Regular Expressions,

te Automata to Regular Expressions.
he pumping lemma, Applications of the

rties of Regular languages, Decision

ation of Automata.

mmars, Derivations Using a Grammar, Leftmost

ar, Sentential Forms, Parse Tress, Applications
mmars and Languages. Push Down Automata:
a PDA, Equivalence of PDA's and CFG's, Acceptance
ushdown Automata. From CFG to PDA, From PDA

ess symbols, Eliminating €-Productions. Chomsky

pumping lemma, Applications

erties of CFL’s, Decision Properties of CFL's

escription, Instantaneous description, The
Recursively Enumerable, An Undecidable
achines, Recursive languages, Properties of
Modified Post Correspondence problem, Other

putation, 3nd Edition, John E. Hopcroft, Rajeev

ages and computation, Mishra and

tion, John C Martin, TMH.

hn Wiley.
S. F. B, Cambridge University Press.
ser, 3rd edition, Cengage Learning.
and Computation Kamala Krithivasan, Rama R,

GINEERING
L T P C
3 0 0 3

ding of the working knowledge of the

ity management of large software

nts, software design, software testing, software

ement and UML diagrams

and software requirements, using e.g. UML, and

cument (SRD).
nd patterns to carry out high level design of a
es.
ems and will be able to develop a simple testing

oftware, changing nature of software, software

technology, a process framework, the capability

rocess assessment, personal and team process

models, evolutionary process models, the

equirements, user requirements, system

ments document.
quirements elicitation and analysis,

models, object models, structured methods.

sign concepts, the design model. Creating an
chitectural styles and patterns, architectural
g, class diagrams, sequence diagrams,
agrams.

, test strategies for conventional software, black-

ng, the art of debugging.
el, metrics for design model, metrics for

metrics for software quality.

, software risks, risk identification, risk

urance, software reviews, formal technical

liability, the ISO 9000 quality standards.

r S. Pressman, 6th edition, Mc Graw Hill

n Education.
h, James Rambaugh, Ivar Jacobson, Pearson

s F. Peters, Witold Pedrycz, John Wiley.

an S Jawadekar, The Mc Graw-Hill Companies.
ler page-Jones: Pearson Education.
 CS503PC: COMPUTER NETWORKS
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites
1. A course on “Programming for problem solving”
2. A course on “Data Structures”
Course Objectives
1. The objective of the course is to equip the students with a general overview of the concepts and
fundamentals of computer networks.
Familiarize the students with the standard models for the layered approach to communication
between machines in a network and the protocols of the various layers.
2
Course Outcomes
1. Gain the knowledge of the basic computer network technology.
2. Gain the knowledge of the functions of each layer in the OSI and TCP/IP reference model.
3. Obtain the skills of subnetting and routing mechanisms.
4. Familiarity with the essential protocols of computer networks, and how they can be applied in network
design and implementation.

UNIT - I
Network hardware, Network software, OSI, TCP/IP Reference models, Example Networks: ARPANET, Intern
Physical Layer: Guided Transmission media: twisted pairs, coaxial cable, fiber optics, Wireless
transmission.

UNIT - II
Data link layer: Design issues, framing, Error detection and correction.
Elementary data link protocols: simplex protocol, A simplex stop and wait protocol for an error-free chann
A simplex stop and wait protocol for noisy channel.
Sliding Window protocols: A one-bit sliding window protocol, A protocol using Go-Back-N, A protocol using
Selective Repeat, Example data link protocols.
Medium Access sub layer: The channel allocation problem, Multiple access protocols: ALOHA, Carrier
sense multiple access protocols, collision free protocols. Wireless LANs, Data link layer switching.

UNIT - III
Network Layer: Design issues, Routing algorithms: shortest path routing, Flooding, Hierarchical routing,
Broadcast, Multicast, distance vector routing, Congestion Control Algorithms, Quality of Service,
Internetworking, The Network layer in the internet.

UNIT - IV
Transport Layer: Transport Services, Elements of Transport protocols, Connection management, TCP and U
protocols.
UNIT - V
Application Layer –Domain name system, SNMP, Electronic Mail; the World WEB, HTTP, Streaming audio an
video.
TEXT BOOK:
1. Computer Networks -- Andrew S Tanenbaum, David. j. Wetherall, 5 th Edition. Pearson
Education/PHI
REFERENCE BOOKS:
1. An Engineering Approach to Computer Networks-S. Keshav, 2nd Edition, Pearson Education
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.
CS504PC: WEB TECHNOLOGIES
 III Year B.Tech. CSE I-Sem L T P
3 0
Course Objectives:
1. To introduce PHP language for server-side scripting
2. To introduce XML and processing of XML Data with Java
3. To introduce Server-side programming with Java Servlets and JSP
4. To introduce Client-side scripting with Javascript and AJAX.

Course Outcomes
1. gain knowledge of client-side scripting, validation of forms and AJAX programming
2. understand server-side scripting with PHP language
3. understand what is XML and how to parse and use XML Data with Java
4. To introduce Server-side programming with Java Servlets and JSP

UNIT- I
Introduction to PHP: Declaring variables, data types, arrays, strings, operators, expressions, control
structures, functions, Reading data from web form controls like text boxes, radio buttons, lists etc., Handl
File Uploads. Connecting to database (MySQL as reference), executing simple queries, handling resu
Handling sessions and cookies
File Handling in PHP: File operations like opening, closing, reading, writing, appending, deleting etc.
on text and binary files, listing directories.

UNIT- II
HTML Common tags- List, Tables, images, forms, Frames; Cascading Style sheets;
XML: Introduction to XML, Defining XML tags, their attributes and values, Document Type Definition, XML
Schemes, Document Object Model, XHTML Parsing XML Data – DOM and SAX Parsers in java.

UNIT - III
Introduction to Servlets: Common Gateway Interface (CGt), Life cycle of a Servlet, deploying a servl
The Servlet API, Reading Servlet parameters, Reading Initialization parameters, Handling Http Request &
Responses, Using Cookies and Sessions, connecting to a database using JDBC.

UNIT - IV
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing, Declarations, Directives,
Expressions, Code Snippets, implicit objects, Using Beans in JSP Pages, Using Cookies and session for sess
tracking, connecting to database in JSP.

UNIT - V
Client-side Scripting: Introduction to Javascript, Javascript language – declaring variables, scope of variable
functions. event handlers (onclick, onsubmit etc.), Document Object Model, Form validation.
TEXT BOOKS:
1. Web Technologies, Uttam K Roy, Oxford University Press
2. The Complete Reference PHP — Steven Holzner, Tata McGraw-Hill
REFERENCE BOOKS
1. Web Programming, building internet applications, Chris Bates 2″ edition, Wiley Dreamtech
2. Java Server Pages —Hans Bergsten, SPD O’Reilly,
3. Java Script, D.Flanagan
4. Beginning Web Programming-Jon Duckett WROX.

5. Programming world wide web, R.W.Sebesta, Fourth Edition, Pearson.

6. Internet and World Wide Web — How to program. Dietel and Nieto, Pearson.
CS511PE: INFORMATION THEORY & CODING (Professional Elective - I)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisite
1. Digital Communications
Course Objectives:
 To acquire the knowledge in measurement of information and errors.
 Understand the importance of various codes for communication systems
 To design encoder and decoder of various codes.
 To known the applicability of source and channel codes

Course Outcomes: Upon completing this course, the student will be able to
 Learn measurement of information and errors.
 Obtain knowledge in designing various source codes and channel codes
 Design encoders and decoders for block and cyclic codes
 Understand the significance of codes in various applications

UNIT - I
Coding for Reliable Digital Transmission and storage
Mathematical model of Information, A Logarithmic Measure of Information, Average and Mutual
Information and Entropy, Types of Errors, Error Control Strategies.
Source Codes: Shannon-fano coding, Huffman coding

UNIT - II
Linear Block Codes: Introduction to Linear Block Codes, Syndrome and Error Detection, Minimum Distance
a Block code, Error-Detecting and Error-correcting Capabilities of a Block code, Standard array and
Syndrome Decoding, Probability of an undetected error for Linear Codes over a BSC, Hamming Cod
Applications of Block codes for Error control in data storage system

UNIT - III
Cyclic Codes: Description, Generator and Parity-check Matrices, Encoding, Syndrome Computation and Er
Detection, Decoding, Cyclic Hamming Codes, shortened cyclic codes, Error-trapping decoding for cyc
codes, Majority logic decoding for cyclic codes.

UNIT - IV
Convolutional Codes: Encoding of Convolutional Codes- Structural and Distance Properties, state, tree, trel
diagrams, maximum likelihood decoding, Sequential decoding, Majority- logic decoding of Convolution
codes. Application of Viterbi Decoding and Sequential Decoding, Applications of Convolutional
codes in ARQ system.

UNIT - V
BCH Codes: Minimum distance and BCH bounds, Decoding procedure for BCH codes, Syndrome
computation and iterative algorithms, Error locations polynomials for single and double error correction.
TEXT BOOKS
1. Error Control Coding- Fundamentals and Applications –Shu Lin, Daniel J.Costello,Jr, Prentice Hall, Inc 20
2. Error Correcting Coding Theory-Man Young Rhee, McGraw – Hill Publishing 1989

REFERENCE BOOKS
1. Digital Communications- John G. Proakis, 5th ed., , TMH 2008.
2. Introduction to Error Control Codes-Salvatore Gravano-oxford
3. Error Correction Coding – Mathematical Methods and Algorithms – Todd K.Moon, 2006, Wiley India.
4. Information Theory, Coding and Cryptography – Ranjan Bose, 2nd Edition, 2009, TMH.

CS512PE: ADVANCED COMPUTER ARCHITECTURE (Professional Elective - I)

III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites: Computer Organization
Course Objectives
 To impart the concepts and principles of parallel and advanced computer architectures.
 To develop the design techniques of Scalable and multithreaded Architectures.
 To Apply the concepts and techniques of parallel and advanced computer architectures to design mode
computer systems

Course Outcomes: Gain knowledge of

 Computational models and Computer Architectures.
 Concepts of parallel computer models.
 Scalable Architectures, Pipelining, Superscalar processors, multiprocessors

UNIT - I
Theory of Parallelism, Parallel computer models, The State of Computing, Multiprocessors and
Multicomputers, Multivector and SIMD Computers, PRAM and VLSI models, Architectural development trac
Program and network properties, Conditions of parallelism, Program partitioning and Schedulin
Program flow Mechanisms, System interconnect Architectures.

UNIT - II
Principals of Scalable performance, Performance metrics and measures, Parallel Processing
applications, Speed up performance laws, Scalability Analysis and Approaches, Hardware
Technologies, Processes and Memory Hierarchy, Advanced Processor Technology, Superscalar and
Vector Processors, Memory Hierarchy Technology, Virtual Memory Technology.

UNIT - III
Bus Cache and Shared memory, Backplane bus systems, Cache Memory organizations, Shared-
Memory Organizations, Sequential and weak consistency models, Pipelining and superscalar
techniques, Linear Pipeline Processors, Non-Linear Pipeline Processors, Instruction Pipeline design, Arithm
pipeline design, superscalar pipeline design.

UNIT - IV
Parallel and Scalable Architectures, Multiprocessors and Multicomputers, Multiprocessor system
interconnects, cache coherence and synchronization mechanism, Three Generations of
Multicomputers, Message-passing Mechanisms, Multivetor and SIMD computers, Vector Processing Princip
Multivector Multiprocessors, Compound Vector processing, SIMD computer Organizations,
The connection machine CM-5,

UNIT - V
Scalable, Multithreaded and Dataflow Architectures, Latency-hiding techniques, Principals of
Multithreading, Fine-Grain Multicomputers, Scalable and multithreaded Architectures, Dataflow and
hybrid Architectures.

TEXT BOOK:
1. Advanced Computer Architecture Second Edition, Kai Hwang, Tata McGraw Hill Publishers.
REFERENCE BOOKS:
1. Computer Architecture, Fourth edition, J. L. Hennessy and D.A. Patterson. ELSEVIER.
2. Advanced Computer Architectures, S.G. Shiva, Special Indian edition, CRC, Taylor &Francis.
3. Introduction to High Performance Computing for Scientists and Engineers, G. Hager and G. Wellein,
CRC Press, Taylor & Francis Group.
4. Advanced Computer Architecture, D. Sima, T. Fountain, P. Kacsuk, Pearson education.
5. Computer Architecture, B. Parhami, Oxford Univ. Press.
CS513PE: DATA ANALYTICS (Professional Elective - I)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites
1. A course on “Database Management Systems”.
2. Knowledge of probability and statistics.
Course Objectives:
 To explore the fundamental concepts of data analytics.
 To learn the principles and methods of statistical analysis
 Discover interesting patterns, analyze supervised and unsupervised models and estimate the accuracy
the algorithms.
 To understand the various search methods and visualization techniques.

Course Outcomes: After completion of this course students will be able to

 Understand the impact of data analytics for business decisions and strategy
 Carry out data analysis/statistical analysis
 To carry out standard data visualization and formal inference procedures
 Design Data Architecture
 Understand various Data Sources

UNIT - I
Data Management: Design Data Architecture and manage the data for analysis, understand various source
of Data like Sensors/Signals/GPS etc. Data Management, Data Quality(noise, outliers, missing
values, duplicate data) and Data Processing & Processing.

UNIT - II
Data Analytics: Introduction to Analytics, Introduction to Tools and Environment, Application of Modeling in
Business, Databases & Types of Data and variables, Data Modeling Techniques, Missing Imputations etc.
Need for Business Modeling.

UNIT - III
Regression – Concepts, Blue property assumptions, Least Square Estimation, Variable Rationalization, and
Model Building etc.
Logistic Regression: Model Theory, Model fit Statistics, Model Construction, Analytics applications to
various Business Domains etc.

UNIT - IV
Object Segmentation: Regression Vs Segmentation – Supervised and Unsupervised Learning, Tree Building
Regression, Classification, Overfitting, Pruning and Complexity, Multiple Decision Trees etc. Time Series
Methods: Arima, Measures of Forecast Accuracy, STL approach, Extract features from generated model as
Height, Average Energy etc and Analyze for prediction

UNIT - V
Data Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection Visualization
Techniques, Icon-Based Visualization Techniques, Hierarchical Visualization Techniques, Visualizing Compl
Data and Relations.

TEXT BOOKS:
1. Student’s Handbook for Associate Analytics – II, III.
2. Data Mining Concepts and Techniques, Han, Kamber, 3 rd Edition, Morgan Kaufmann Publishe

REFERENCE BOOKS:
1. Introduction to Data Mining, Tan, Steinbach and Kumar, Addision Wisley, 2006.
2. Data Mining Analysis and Concepts, M. Zaki and W. Meira
3. Mining of Massive Datasets, Jure Leskovec Stanford Univ. Anand Rajaraman Milliway Labs Jeffrey D
Ullman Stanford Univ.

CS514PE: IMAGE PROCESSING (Professional Elective - I)

 III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites
1. Students are expected to have knowledge in linear signals and systems, Fourier Transform, basic linea
algebra, basic probability theory and basic programming techniques; knowledge of Digital Signal Processin
is desirable.
2. A course on “Computational Mathematics”
3. A course on “Computer Oriented Statistical Methods”

Course Objectives
 Provide a theoretical and mathematical foundation of fundamental Digital Image Processing concepts.
 The topics include image acquisition; sampling and quantization; preprocessing; enhancement;
restoration; segmentation; and compression.

Course Outcomes
 Demonstrate the knowledge of the basic concepts of two-dimensional signal acquisition, samplin
and quantization.
 Demonstrate the knowledge of filtering techniques.
 Demonstrate the knowledge of 2D transformation techniques.
 Demonstrate the knowledge of image enhancement, segmentation, restoration and
compression techniques.

UNIT - I
Digital Image Fundamentals: Digital Image through Scanner, Digital Camera. Concept of Gray Levels.
Gray Level to Binary Image Conversion. Sampling and Quantization. Relationship between Pixels.
Imaging Geometry. 2D Transformations-DFT, DCT, KLT and SVD.

UNIT - II
Image Enhancement in Spatial Domain Point Processing, Histogram Processing, Spatial Filtering,
Enhancement in Frequency Domain, Image Smoothing, Image Sharpening.
UNIT - III
Image Restoration Degradation Model, Algebraic Approach to Restoration, Inverse Filtering, Least M
Square Filters, Constrained Least Squares Restoration, Interactive Restoration.
UNIT - IV
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection, Thresholding,
Region Oriented Segmentation.
UNIT - V
Image Compression Redundancies and their Removal Methods, Fidelity Criteria, Image Compression Mode
Source Encoder and Decoder, Error Free Compression, Lossy Compression.
TEXT BOOK:
1. Digital Image Processing: R.C. Gonzalez & R. E. Woods, Addison Wesley/ Pearson Education, 2 nd Ed, 20

REFERENCE BOOKS:
1. Fundamentals of Digital Image Processing: A. K. Jain, PHI.
2. Digital Image Processing using MAT LAB: Rafael C. Gonzalez, Richard E. Woods, Steven L. Eddins:
Pearson Education India, 2004.
3. Digital Image Processing: William K. Pratt, John Wilely, 3rd Edition, 2004.
CS515PE: PRINCIPLES OF PROGRAMMING LANGUAGES (Professional Elective - I)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites
1. A course on “Mathematical Foundations of Computer Science”
2. A course on “Computer Programming and Data Structures”
Course Objectives
 Introduce important paradigms of programming languages
 To provide conceptual understanding of high-level language design and implementation
 Topics include programming paradigms; syntax and semantics; data types, expressions and statement
subprograms and blocks; abstract data types; concurrency; functional and logic programming languages;
scripting languages

Course Outcomes
 Acquire the skills for expressing syntax and semantics in formal notation
 Identify and apply a suitable programming paradigm for a given computing application
 Gain knowledge of and able to compare the features of various programming languages

UNIT - I
Preliminary Concepts: Reasons for Studying Concepts of Programming Languages, Programming Domains,
Language Evaluation Criteria, Influences on Language Design, Language Categories, Language Desig
Trade-Offs, Implementation Methods, Programming Environments
Syntax and Semantics: General Problem of Describing Syntax and Semantics, Formal Methods of
Describing Syntax, Attribute Grammars, Describing the Meanings of Programs

UNIT - II
Names, Bindings, and Scopes: Introduction, Names, Variables, Concept of Binding, Scope, Scope and Lifetim
Referencing Environments, Named Constants
Data Types: Introduction, Primitive Data Types, Character String Types, User Defined Ordinal Types, Array,
Associative Arrays, Record, Union, Tuple Types, List Types, Pointer and Reference Types, Type Checking,
Strong Typing, Type Equivalence
Expressions and Statements: Arithmetic Expressions, Overloaded Operators, Type Conversions, Relatio
and Boolean Expressions, Short Circuit Evaluation, Assignment Statements, Mixed-Mode Assignment
Control Structures – Introduction, Selection Statements, Iterative Statements, Unconditional
Branching, Guarded Commands.

UNIT - III
Subprograms and Blocks: Fundamentals of Sub-Programs, Design Issues for Subprograms, Local Referencin
Environments, Parameter Passing Methods, Parameters that Are Subprograms, Calling Subprograms
Indirectly, Overloaded Subprograms, Generic Subprograms, Design Issues for Functions, User
Defined Overloaded Operators, Closures, Coroutines
Implementing Subprograms: General Semantics of Calls and Returns, Implementing Simple
Subprograms, Implementing Subprograms with Stack-Dynamic Local Variables, Nested Subprograms, Bloc
Implementing Dynamic Scoping
Abstract Data Types: The Concept of Abstraction, Introductions to Data Abstraction, Design Issues,
Language Examples, Parameterized ADT, Encapsulation Constructs, Naming Encapsulations

UNIT - IV
Concurrency: Introduction, Introduction to Subprogram Level Concurrency, Semaphores, Monitors, Messag
Passing, Java Threads, Concurrency in Function Languages, Statement Level Concurrency. Exception
Handling and Event Handling: Introduction, Exception Handling in Ada, C++, Java, Introduction to Ev
Handling, Event Handling with Java and C#.
UNIT - V
Functional Programming Languages: Introduction, Mathematical Functions, Fundamentals of Functional
Programming Language, LISP, Support for Functional Programming in Primarily Imperative Languages,
Comparison of Functional and Imperative Languages
Logic Programming Language: Introduction, an Overview of Logic Programming, Basic Elements of Prolog,
Applications of Logic Programming.
Scripting Language: Pragmatics, Key Concepts, Case Study: Python – Values and Types, Variables,
Storage and Control, Bindings and Scope, Procedural Abstraction, Data Abstraction, Separate
Compilation, Module Library. (Text Book 2)

TEXT BOOKS:
1. Concepts of Programming Languages Robert. W. Sebesta 10/E, Pearson Education.
2. Programming Language Design Concepts, D. A. Watt, Wiley Dreamtech, 2007.
REFERENCE BOOKS:
1. Programming Languages, 2nd Edition, A.B. Tucker, R. E. Noonan, TMH.
2. Programming Languages, K. C. Louden, 2nd Edition, Thomson, 2003
CS521PE: COMPUTER GRAPHICS (Professional Elective - II)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites
1. Familiarity with the theory and use of coordinate geometry and of linear algebra such as matrix
multiplication.
2. A course on “Computer Programming and Data Structures”

Course Objectives
 The aim of this course is to provide an introduction of fundamental concepts and theory of computer
graphics.
 Topics covered include graphics systems and input devices; geometric representations and 2D/3D
transformations; viewing and projections; illumination and color models; animation;
rendering and implementation; visible surface detection;

Course Outcomes
 Acquire familiarity with the relevant mathematics of computer graphics.
 Be able to design basic graphics application programs, including animation
 Be able to design applications that display graphic images to given specifications

UNIT - I
Introduction: Application areas of Computer Graphics, overview of graphics systems, video-display devices
raster-scan systems, random scan systems, graphics monitors and work stations and input devices
Output primitives: Points and lines, line drawing algorithms (Bresenham’s and DDA Algorithm), mid- point
circle and ellipse algorithms
Polygon Filling: Scan-line algorithm, boundary-fill and flood-fill algorithms

UNIT - II
2-D geometrical transforms: Translation, scaling, rotation, reflection and shear transformations, matrix
representations and homogeneous coordinates, composite transforms, transformations between coordina
systems
2-D viewing: The viewing pipeline, viewing coordinate reference frame, window to view-port coordinate
transformation, viewing functions, Cohen-Sutherland algorithms, Sutherland –Hodgeman
polygon clipping algorithm.
UNIT - III
3-D object representation: Polygon surfaces, quadric surfaces, spline representation, Hermite curve, Bezier
curve and B-Spline curves, Bezier and B-Spline surfaces. Basic illumination models, polygon rendering
methods.

UNIT - IV
3-D Geometric transformations: Translation, rotation, scaling, reflection and shear transformations, compos
transformations.
3-D viewing: Viewing pipeline, viewing coordinates, view volume and general projection transforms
and clipping.

UNIT - V
Computer animation: Design of animation sequence, general computer animation functions, raster animati
computer animation languages, key frame systems, motion specifications
Visible surface detection methods: Classification, back-face detection, depth-buffer, BSP-tree
methods and area sub-division methods
TEXT BOOKS:
1. “Computer Graphics C version”, Donald Hearn and M. Pauline Baker, Pearson Education
2. “Computer Graphics Principles & practice”, second edition in C, Foley, Van Dam, Feiner and Hughes,
Pearson Education.
3. Computer Graphics, Steven Harrington, TMH

REFERENCE BOOKS:
1. Procedural elements for Computer Graphics, David F Rogers, Tata Mc Graw hill, 2nd edition.
2. Principles of Interactive Computer Graphics”, Neuman and Sproul, TMH.
3. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.

CS522PE: ADVANCED OPERATING SYSTEMS (Professional Elective - II)

III Year B.Tech. CSE I-Sem L T P
3 0
Course Objectives
 To study, learn, and understand the main concepts of advanced operating systems (parallel processing
systems, distributed systems, real time systems, network operating systems, and open source operating
systems)
 Hardware and software features that support these systems.

Course Outcomes
 Understand the design approaches of advanced operating systems
 Analyze the design issues of distributed operating systems.
 Evaluate design issues of multi processor operating systems.
 Identify the requirements Distributed File System and Distributed Shared Memory.
 Formulate the solutions to schedule the real time applications.

UNIT - I
Architectures of Distributed Systems: System Architecture Types, Distributed Operating Systems, Issues in
Distributed Operating Systems, Communication Primitives. Theoretical Foundations: Inherent Limitation
of a Distributed System, Lamport’s Logical Clocks, Vector Clocks, Causal Ordering
of Messages, Termination Detection.

UNIT - II
Distributed Mutual Exclusion: The Classification of Mutual Exclusion Algorithms, Non-Token – Based
Algorithms: Lamport’s Algorithm, The Ricart-Agrawala Algorithm, Maekawa’s Algorithm, Token-Based
Algorithms: Suzuki-Kasami’s Broadcast Algorithm, Singhal’s Heurisric Algorithm, Raymond’s Heuristic
Algorithm.
UNIT - III
Distributed Deadlock Detection: Preliminaries, Deadlock Handling Strategies in Distributed Systems, Issues
Deadlock Detection and Resolution, Control Organizations for Distributed Deadlock Detection, Centralized
Deadlock – Detection Algorithms, Distributed Deadlock Detection Algorithms, Hierarchical Deadlock Detec
Algorithms

UNIT - IV
Multiprocessor System Architectures: Introduction, Motivation for multiprocessor Systems, Basic
Multiprocessor System Architectures Multi Processor Operating Systems: Introduction, Structures of
Multiprocessor Operating Systems, Operating Design Issues, Threads, Process Synchronization,
Processor Scheduling.
Distributed File Systems: Architecture, Mechanisms for Building Distributed File Systems, Design
Issues

UNIT - V
Distributed Scheduling: Issues in Load Distributing, Components of a Load Distributed Algorithm, Stability,
Load Distributing Algorithms, Requirements for Load Distributing, Task Migration, Issues in task Migration
Distributed Shared Memory: Architecture and Motivation, Algorithms for Implementing DSM, Memory
Coherence, Coherence Protocols, Design Issues

TEXT BOOK:
1. Advanced Concepts in Operating Systems, Mukesh Singhal, Niranjan G. Shivaratri, Tata McGraw
Edition 2001
REFERENCE BOOK:
1. Distributed Systems: Andrew S. Tanenbaum, Maarten Van Steen, Pearson Prentice Hall, Edition
2007
CS523PE: INFORMATION RETRIEVAL SYSTEMS (Professional Elective - II)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites:
1. Data Structures
Course Objectives:
 To learn the important concepts and algorithms in IRS
 To understand the data/file structures that are necessary to design, and implement information retriev
(IR) systems.

Course Outcomes:
 Ability to apply IR principles to locate relevant information large collections of data
 Ability to design different document clustering algorithms
 Implement retrieval systems for web search tasks.
 Design an Information Retrieval System for web search tasks.

UNIT - I
Introduction to Information Retrieval Systems: Definition of Information Retrieval System, Objectives of
Information Retrieval Systems, Functional Overview, Relationship to Database Management Systems, Digi
Libraries and Data Warehouses
Information Retrieval System Capabilities: Search Capabilities, Browse Capabilities, Miscellaneous
Capabilities
UNIT - II
Cataloging and Indexing: History and Objectives of Indexing, Indexing Process, Automatic Indexing,
Information Extraction
Data Structure: Introduction to Data Structure, Stemming Algorithms, Inverted File Structure, N-Gram Data
Structures, PAT Data Structure, Signature File Structure, Hypertext and XML Data Structures,
Hidden Markov Models

UNIT - III
Automatic Indexing: Classes of Automatic Indexing, Statistical Indexing, Natural Language, Concept Index
Hypertext Linkages
Document and Term Clustering: Introduction to Clustering, Thesaurus Generation, Item Clustering,
Hierarchy of Clusters

UNIT - IV
User Search Techniques: Search Statements and Binding, Similarity Measures and Ranking,
Relevance Feedback, Selective Dissemination of Information Search, Weighted Searches of Boolean Syste
Searching the INTERNET and Hypertext
Information Visualization: Introduction to Information Visualization, Cognition and Perception,
Information Visualization Technologies

UNIT - V
Text Search Algorithms: Introduction to Text Search Techniques, Software Text Search Algorithms, Hardwa
Text Search Systems
Multimedia Information Retrieval: Spoken Language Audio Retrieval, Non-Speech Audio Retrieval,
Graph Retrieval, Imagery Retrieval, Video Retrieval

TEXT BOOK:
1. Information Storage and Retrieval Systems – Theory and Implementation, Second Edition, Gerald J.
Kowalski, Mark T. Maybury, Springer
REFERENCE BOOKS:
1. Frakes, W.B., Ricardo Baeza-Yates: Information Retrieval Data Structures and Algorithms, Prentic
Hall, 1992.
2. Information Storage & Retrieval By Robert Korfhage – John Wiley & Sons.
3. Modern Information Retrieval By Yates and Neto Pearson Education.

CS524PE: DISTRIBUTED DATABASES (Professional Elective - II)

III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites:
1. A course on “Database Management Systems”
Course Objectives:
 The purpose of the course is to enrich the previous knowledge of database systems and expos
the need for distributed database technology to confront with the deficiencies of the centralized database
systems.
 Introduce basic principles and implementation techniques of distributed database systems.
 Equip students with principles and knowledge of parallel and object-oriented databases.
 Topics include distributed DBMS architecture and design; query processing and optimization; distribute
transaction management and reliability; parallel and object database management systems.
Course Outcomes:
 Understand theoretical and practical aspects of distributed database systems.
 Study and identify various issues related to the development of distributed database system.
 Understand the design aspects of object-oriented database system and related development.

UNIT - I
Introduction; Distributed Data Processing, Distributed Database System, Promises of DDBSs, Problem
areas.
Distributed DBMS Architecture: Architectural Models for Distributed DBMS, DDMBS Architecture.
Distributed Database Design: Alternative Design Strategies, Distribution Design issues,
Fragmentation, Allocation.

UNIT - II
Query processing and decomposition: Query processing objectives, characterization of query processo
layers of query processing, query decomposition, localization of distributed data.
Distributed query Optimization: Query optimization, centralized query optimization, distributed query
optimization algorithms.

UNIT - III
Transaction Management: Definition, properties of transaction, types of transactions, distributed
concurrency control: serializability, concurrency control mechanisms & algorithms, time - stamped &
optimistic concurrency control Algorithms, deadlock Management.

UNIT - IV
Distributed DBMS Reliability: Reliability concepts and measures, fault-tolerance in distributed systems
failures in Distributed DBMS, local & distributed reliability protocols, site failures and network partitioning.
Parallel Database Systems: Parallel database system architectures, parallel data placement, parallel
query processing, load balancing, database clusters.

UNIT - V
Distributed object Database Management Systems: Fundamental object concepts and models,
object distributed design, architectural issues, object management, distributed object storage, object quer
Processing.

Object Oriented Data Model: Inheritance, object identity, persistent programming languages,
persistence of objects, comparison OODBMS and ORDBMS
TEXT BOOKS:
1. M. Tamer OZSU and Patuck Valduriez: Principles of Distributed Database Systems, Pearson Edn. Asia,
2001.
2. Stefano Ceri and Giuseppe Pelagatti: Distributed Databases, McGraw Hill.

REFERENCE BOOK:
1. Hector Garcia-Molina, Jeffrey D. Ullman, Jennifer Widom: “Database Systems: The Complete Book”,
Second Edition, Pearson International Edition
CS525PE: NATURAL LANGUAGE PROCESSING (Professional Elective - II)
III Year B.Tech. CSE I-Sem L T P
3 0
Prerequisites: Data structures, finite automata and probability theory
Course Objectives:
 Introduce to some of the problems and solutions of NLP and their relation to linguistics and statistics.
Course Outcomes:
 Show sensitivity to linguistic phenomena and an ability to model them with formal grammars.
 Understand and carry out proper experimental methodology for training and evaluating empirical NLP
systems
 Able to manipulate probabilities, construct statistical models over strings and trees, and estimate
parameters using supervised and unsupervised training methods.
 Able to design, implement, and analyze NLP algorithms
 Able to design different language modeling Techniques.

UNIT - I
Finding the Structure of Words: Words and Their Components, Issues and Challenges,
Morphological Models
Finding the Structure of Documents: Introduction, Methods, Complexity of the Approaches,
Performances of the Approaches

UNIT - II
Syntax Analysis: Parsing Natural Language, Treebanks: A Data-Driven Approach to Syntax,
Representation of Syntactic Structure, Parsing Algorithms, Models for Ambiguity Resolution in Parsing,
Multilingual Issues

UNIT - III
Semantic Parsing: Introduction, Semantic Interpretation, System Paradigms, Word Sense Systems, Softwar

UNIT - IV
Predicate-Argument Structure, Meaning Representation Systems, Software.
UNIT - V
Discourse Processing: Cohension, Reference Resolution, Discourse Cohension and Structure Language
Modeling: Introduction, N-Gram Models, Language Model Evaluation, Parameter Estimation, Langu
Model Adaptation, Types of Language Models, Language-Specific Modeling Problems, Multilingual and
Crosslingual Language Modeling

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to Practice – Daniel M. Bikel and
Imed Zitouni, Pearson Publication
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary

REFERENCE BOOK:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson Publicati

CS505PC: SOFTWARE ENGINEERING LAB

III Year B.Tech. CSE I-Sem L T P
0 0 3
Prerequisites
1. A course on “Programming for Problem Solving”
Co-requisite
1. A Course on “Software Engineering”

Course Objectives:
 To have hands on experience in developing a software project by using various software
engineering principles and methods in each of the phases of software development.
Course Outcomes:
 Ability to translate end-user requirements into system and software requirements
 Ability to generate a high-level design of the system from the software requirements
 Will have experience and/or awareness of testing problems and will be able to develop a simple testing
report

List of Experiments
Do the following 8 exercises for any two projects given in the list of sample projects or any other projects:
1. Development of problem statement.
2. Preparation of Software Requirement Specification Document, Design Documents and Testing Phase
related documents.
3. Preparation of Software Configuration Management and Risk Management related documents.
4. Study and usage of any Design phase CASE tool
5. Performing the Design by using any Design phase CASE tools.
6. Develop test cases for unit testing and integration testing
7. Develop test cases for various white box and black box testing techniques.

Sample Projects:
1. Passport automation System
2. Book Bank
3. Online Exam Registration
4. Stock Maintenance System
5. Online course reservation system
6. E-ticketing
7. Software Personnel Management System
8. Credit Card Processing
9. E-book management System.
10. Recruitment system

TEXT BOOKS:
1. Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition, Mc Graw Hill
International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson Education.
3. The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson, Pearson
Education.

CS506PC: COMPUTER NETWORKS AND WEB TECHNOLOGIES LAB

III Year B.Tech. CSE I-Sem L T P
0 0 3
Course Objectives
 To understand the working principle of various communication protocols.
 To understand the network simulator environment and visualize a network topology and observe its
performance
 To analyze the traffic flow and the contents of protocol frames

Course Outcomes
 Implement data link layer farming methods
 Analyze error detection and error correction codes.
 Implement and analyze routing and congestion issues in network design.
 Implement Encoding and Decoding techniques used in presentation layer
 To be able to work with different network tools
List of Experiments
1. Implement the data link layer framing methods such as character, character-stuffing and bit stuffing.
2. Write a program to compute CRC code for the polynomials CRC-12, CRC-16 and CRC CCIP
3. Develop a simple data link layer that performs the flow control using the sliding window protocol, and
recovery using the Go-Back-N mechanism.
4. Implement Dijsktra’s algorithm to compute the shortest path through a network
5. Take an example subnet of hosts and obtain a broadcast tree for the subnet.
6. Implement distance vector routing algorithm for obtaining routing tables at each node.
7. Implement data encryption and data decryption
8. Write a program for congestion control using Leaky bucket algorithm.
9. Write a program for frame sorting technique used in buffers.
10. Wireshark
i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics & Filters.
11. How to run Nmap scan
12. Operating System Detection using Nmap
13. Do the following using NS2 Simulator
i. NS2 Simulator-Introduction
ii. Simulate to Find the Number of Packets Dropped
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
iv. Simulate to Find the Number of Packets Dropped due to Congestion
v. Simulate to Compare Data Rate& Throughput.
vi. Simulate to Plot Congestion for Different Source/Destination
vii. Simulate to Determine the Performance with respect to Transmission of Packets

Web Technologies Experiments

1. Write a PHP script to print prime numbers between 1-50.
2. PHP script to
a. Find the length of a string.
b. Count no of words in a string.
c. Reverse a string.
d. Search for a specific string.
 3. Write a PHP script to merge two arrays and sort them as numbers, in descending order.4. Write a PHP script that reads data f

TEXT BOOK:
1. WEB TECHNOLOGIES: A Computer Science Perspective, Jeffrey C. Jackson, Pearson Education

REFERENCE BOOKS:
1. Deitel H.M. and Deitel P.J., “Internet and World Wide Web How to program”, Pearson
International, 2012, 4th Edition.
2. J2EE: The complete Reference By James Keogh, McGraw-Hill
3. Bai and Ekedhi, The Web Warrior Guide to Web Programming, Thomson
4. Paul Dietel and Harvey Deitel,” Java How to Program”, Prentice Hall of India, 8th Edition
5. Web technologies, Black Book, Dreamtech press.
6. Gopalan N.P. and Akilandeswari J., “Web Technology”, Prentice Hall of India

EN508HS: ADVANCED COMMUNICATION SKILLS LAB

III Year B.Tech. CSE I-Sem L T P
0 0
1. INTRODUCTION:
The introduction of the Advanced Communication Skills Lab is considered essential at 3rd year level. At thi
stage, the students need to prepare themselves for their careers which may require them to listen to, rea
speak and write in English both for their professional and interpersonal communication in the globalized
context.
The proposed course should be a laboratory course to enable students to use ‘good’ English and
perform the following:
 Gathering ideas and information to organize ideas relevantly and coherently.
 Engaging in debates.
 Participating in group discussions.
 Facing interviews.
 Writing project/research reports/technical reports.
 Making oral presentations.
 Writing formal letters.
 Transferring information from non-verbal to verbal texts and vice-versa.
 Taking part in social and professional communication.

2. OBJECTIVES:
This Lab focuses on using multi-media instruction for language development to meet the following targe
 To improve the students’ fluency in English, through a well-developed vocabulary and enable them to
listen to English spoken at normal conversational speed by educated English speakers and respond
appropriately in different socio-cultural and professional contexts.
 Further, they would be required to communicate their ideas relevantly and coherently in writing.
 To prepare all the students for their placements.

3. SYLLABUS:
The following course content to conduct the activities is prescribed for the Advanced English
Communication Skills (AECS) Lab:
1. Activities on Fundamentals of Inter-personal Communication and Building Vocabulary - Starting a
conversation – responding appropriately and relevantly – using the right body language – Role Play in
different situations & Discourse Skills- using visuals - Synonyms and antonyms, word roots, one-word
substitutes, prefixes and suffixes, study of word origin, business vocabulary, analogy, idioms and
phrases, collocations & usage of vocabulary.
2. Activities on Reading Comprehension –General Vs Local comprehension, reading for facts, guessin
meanings from context, scanning, skimming, inferring meaning, critical reading& effective googling.
3. Activities on Writing Skills – Structure and presentation of different types of writing – letter
writing/Resume writing/ e-correspondence/Technical report writing/ – planning for writing – improving one’s
writing.
4. Activities on Presentation Skills – Oral presentations (individual and group) through JAM
sessions/seminars/PPTs and written presentations through posters/projects/reports/ e-
mails/assignments etc.
5. Activities on Group Discussion and Interview Skills – Dynamics of group discussion,
intervention, summarizing, modulation of voice, body language, relevance, fluency and organization of id
and rubrics for evaluation- Concept and process, pre-interview planning, opening

strategies, answering strategies, interview through tele-conference & video-conference and Mock
Interviews.
4. MINIMUM REQUIREMENT:
The Advanced English Communication Skills (AECS) Laboratory shall have the following infrastructural
facilities to accommodate at least 35 students in the lab:
 Spacious room with appropriate acoustics.
 Round Tables with movable chairs
 Audio-visual aids
 LCD Projector
 Public Address system
 P – IV Processor, Hard Disk – 80 GB, RAM–512 MB Minimum, Speed – 2.8 GHZ
 T. V, a digital stereo & Camcorder
 Headphones of High quality

5. SUGGESTED SOFTWARE:
The software consisting of the prescribed topics elaborated above should be procured and used.
 Oxford Advanced Learner’s Compass, 7th Edition
 DELTA’s key to the Next Generation TOEFL Test: Advanced Skill Practice.
 Lingua TOEFL CBT Insider, by Dream tech
 TOEFL & GRE (KAPLAN, AARCO & BARRONS, USA, Cracking GRE by CLIFFS)

TEXT BOOKS:
1. Effective Technical Communication by M Asharaf Rizvi. McGraw Hill Education (India) Pvt. Ltd. 2 nd Editi
2. Academic Writing: A Handbook for International Students by Stephen Bailey, Routledge, 5th
Edition.

REFERENCE BOOKS:
1. Learn Correct English – A Book of Grammar, Usage and Composition by Shiv K. Kumar and Hemalatha
Nagarajan. Pearson 2007
2. Professional Communication by Aruna Koneru, McGraw Hill Education (India) Pvt. Ltd, 2016.
3. Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University Press 2009.
4. Technical Communication by Paul V. Anderson. 2007. Cengage Learning pvt. Ltd. New Delhi.
5. English Vocabulary in Use series, Cambridge University Press 2008.
6. Handbook for Technical Communication by David A. McMurrey & Joanne Buckley. 2012. Cengag
Learning.
7. Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New Delhi, 2009.
8. Job Hunting by Colm Downes, Cambridge University Press 2008.
9. English for Technical Communication for Engineering Students, Aysha Vishwamohan, Tata Mc Graw-Hi
2009.

*MC510: INTELLECTUAL PROPERTY RIGHTS

III Year B.Tech. CSE I-Sem L T P
3 0
UNIT – I
Introduction to Intellectual property: Introduction, types of intellectual property, international
organizations, agencies and treaties, importance of intellectual property rights.
UNIT – II
Trade Marks: Purpose and function of trademarks, acquisition of trade mark rights, protectable matter,
selecting, and evaluating trade mark, trade mark registration processes.
UNIT – III
Law of copy rights: Fundamental of copy right law, originality of material, rights of reproduction, rights to
perform the work publicly, copy right ownership issues, copy right registration, notice of copy right,
international copy right law.
Law of patents: Foundation of patent law, patent searching process, ownership rights and transfer

UNIT – IV
Trade Secrets: Trade secrete law, determination of trade secrete status, liability for misappropriations of
trade secrets, protection for submission, trade secrete litigation.
Unfair competition: Misappropriation right of publicity, false advertising.

UNIT – V
New development of intellectual property: new developments in trade mark law; copy right law, patent law
intellectual property audits.
International overview on intellectual property, international – trade mark law, copy right law,
international patent law, and international development in trade secrets law.

TEXT & REFERENCE BOOKS:

1. Intellectual property right, Deborah. E. Bouchoux, Cengage learning.
2. Intellectual property right – Unleashing the knowledge economy, prabuddha ganguli, Tata McGra
Hill Publishing company ltd

CS601PC: MACHINE LEARNING

III Year B.Tech. CSE II-Sem L T P
3 1
Prerequisites
1. Data Structures
2. Knowledge on statistical methods
Course Objectives
 This course explains machine learning techniques such as decision tree learning, Bayesian learning etc
 To understand computational learning theory.
 To study the pattern comparison techniques.

Course Outcomes
 Understand the concepts of computational intelligence like machine learning
 Ability to get the skill to apply machine learning techniques to address the real time problems in differe
areas
 Understand the Neural Networks and its usage in machine learning application.

UNIT - I
Introduction - Well-posed learning problems, designing a learning system, Perspectives and issues in mach
learning
Concept learning and the general to specific ordering – introduction, a concept learning task, concept
learning as search, find-S: finding a maximally specific hypothesis, version spaces and the candidate
elimination algorithm, remarks on version spaces and candidate elimination, inductive bias.
Decision Tree Learning – Introduction, decision tree representation, appropriate problems for decision
tree learning, the basic decision tree learning algorithm, hypothesis space search in decision tree
learning, inductive bias in decision tree learning, issues in decision tree learning.
UNIT - II
Artificial Neural Networks-1– Introduction, neural network representation, appropriate problems for neural
network learning, perceptions, multilayer networks and the back-propagation algorithm.
Artificial Neural Networks-2- Remarks on the Back-Propagation algorithm, An illustrative example: face
recognition, advanced topics in artificial neural networks.
Evaluation Hypotheses – Motivation, estimation hypothesis accuracy, basics of sampling theory, a general
approach for deriving confidence intervals, difference in error of two hypotheses, comparing
learning algorithms.

UNIT - III
Bayesian learning – Introduction, Bayes theorem, Bayes theorem and concept learning, Maximum Likelihoo
and least squared error hypotheses, maximum likelihood hypotheses for predicting probabilities,
minimum description length principle, Bayes optimal classifier, Gibs algorithm, Naïve Bayes classifie
an example: learning to classify text, Bayesian belief networks, the EM algorithm.
Computational learning theory – Introduction, probably learning an approximately correct hypothesis, samp
complexity for finite hypothesis space, sample complexity for infinite hypothesis spaces, the mistake boun
model of learning.
Instance-Based Learning- Introduction, k-nearest neighbour algorithm, locally weighted regression,
radial basis functions, case-based reasoning, remarks on lazy and eager learning.

UNIT- IV
Genetic Algorithms – Motivation, Genetic algorithms, an illustrative example, hypothesis space searc
genetic programming, models of evolution and learning, parallelizing genetic algorithms.
Learning Sets of Rules – Introduction, sequential covering algorithms, learning rule sets: summary, learning
First-Order rules, learning sets of First-Order rules: FOIL, Induction as inverted deduction, inverting
resolution.
Reinforcement Learning – Introduction, the learning task, Q–learning, non-deterministic, rewards and action
temporal difference learning, generalizing from examples, relationship to dynamic
programming.

UNIT - V
Analytical Learning-1- Introduction, learning with perfect domain theories: PROLOG-EBG, remarks on
explanation-based learning, explanation-based learning of search control knowledge.
Analytical Learning-2-Using prior knowledge to alter the search objective, using prior knowledge to augmen
search operators.
Combining Inductive and Analytical Learning – Motivation, inductive-analytical approaches to
learning, using prior knowledge to initialize the hypothesis.

TEXT BOOK:
1. Machine Learning – Tom M. Mitchell, - MGH
REFERENCE BOOK:
1. Machine Learning: An Algorithmic Perspective, Stephen Marshland, Taylor & Francis
CS602PC: COMPILER DESIGN
III Year B.Tech. CSE II-Sem L T P
3 1
Prerequisites
1. A course on “Formal Languages and Automata Theory”
2. A course on “Computer Organization and architecture”
3. A course on “Computer Programming and Data Structures”
Course Objectives:
 Introduce the major concepts of language translation and compiler design and impart the
knowledge of practical skills necessary for constructing a compiler.
 Topics include phases of compiler, parsing, syntax directd translation, type checking use of symbol
tables, code optimization techniques, intermediate code generation, code generation
and data flow analysis.

Course Outcomes:
 Demonstrate the ability to design a compiler given a set of language features.
 Demonstrate the the knowledge of patterns, tokens & regular expressions for lexical analysis.
 Acquire skills in using lex tool & yacc tool for devleoping a scanner and parser.
 Design and implement LL and LR parsers
 Design algorithms to do code optimization in order to improve the performance of a program in terms
space and time complexity.
 Design algorithms to generate machine code.

UNIT - I
Introduction: The structure of a compiler, the science of building a compiler, programming language basics
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of Tokens, The Lexi
Analyzer Generator Lex, Finite Automata, From Regular Expressions to Automata, Design of a
Lexical-Analyzer Generator, Optimization of DFA-Based Pattern Matchers.

UNIT - II
Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down Parsing, Botto
Up Parsing, Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous
Grammars and Parser Generators.

UNIT - III
Syntax-Directed Translation: Syntax-Directed Definitions, Evaluation Orders for SDD's, Applications of Synt
Directed Translation, Syntax-Directed Translation Schemes, Implementing L-Attributed SDD's.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and
Declarations, Type Checking, Control Flow, Switch-Statements, Intermediate Code for Procedures.

UNIT - IV
Run-Time Environments: Stack Allocation of Space, Access to Nonlocal Data on the Stack, Heap Manageme
Introduction to Garbage Collection, Introduction to Trace-Based Collection.
Code Generation: Issues in the Design of a Code Generator, The Target Language, Addresses in the Target
Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, A Simple Code Generator,
Peephole Optimization, Register Allocation and Assignment, Dynamic Programming Code-Generation.

UNIT - V
Machine-Independent Optimization: The Principal Sources of Optimization, Introduction to Data-Flow Analysi
Foundations of Data-Flow Analysis, Constant Propagation, Partial-Redundancy Elimination, Loops in Flow
Graphs.

TEXT BOOK:
1. Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica S. Lam, Ravi Sethi,
Jeffry D. Ullman.
REFERENCE BOOKS:
1. Lex & Yacc – John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Compiler Construction, Louden, Thomson.
CS603PC: DESIGN AND ANALYSIS OF ALGORITHMS
 III Year B.Tech. CSE II-Sem L T P
3 1
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Advanced Data Structures”
Course Objectives:
 Introduces the notations for analysis of the performance of algorithms.
 Introduces the data structure disjoint sets.
 Describes major algorithmic techniques (divide-and-conquer, backtracking, dynamic
programming, greedy, branch and bound methods) and mention problems for which each techniqu
appropriate;
 Describes how to evaluate and compare different algorithms using worst-, average-, and best- case
analysis.
 Explains the difference between tractable and intractable problems, and introduces the problem
that are P, NP and NP complete.

Course Outcomes:
 Ability to analyze the performance of algorithms
 Ability to choose appropriate data structures and algorithm design methods for a specified
application
 Ability to understand how the choice of data structures and the algorithm design methods imp
the performance of programs

UNIT - I
Introduction: Algorithm, Performance Analysis-Space complexity, Time complexity, Asymptotic Notatio
Big oh notation, Omega notation, Theta notation and Little oh notation.
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s
matrix multiplication.

UNIT - II
Disjoint Sets: Disjoint set operations, union and find algorithms
Backtracking: General method, applications, n-queen’s problem, sum of subsets problem, graph
coloring

UNIT - III
Dynamic Programming: General method, applications- Optimal binary search trees, 0/1 knapsack proble
All pairs shortest path problem, Traveling sales person problem, Reliability design.
UNIT - IV
Greedy method: General method, applications-Job sequencing with deadlines, knapsack problem,
Minimum cost spanning trees, Single source shortest path problem.
UNIT - V
Branch and Bound: General method, applications - Travelling sales person problem, 0/1 knapsack problem
LC Branch and Bound solution, FIFO Branch and Bound solution.
NP-Hard and NP-Complete problems: Basic concepts, non deterministic algorithms, NP - Hard and
NP-Complete classes, Cook’s theorem.

TEXT BOOK:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharan, University
Press.
REFERENCE BOOKS:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
2. Introduction to Algorithms, second edition, T. H. Cormen, C.E. Leiserson, R. L. Rivest, and C. Stein, PHI
Pvt. Ltd./ Pearson Education.
3. Algorithm Design: Foundations, Analysis and Internet Examples, M.T. Goodrich and R.
Tamassia, John Wiley and sons.

CS611PE: CONCURRENT PROGRAMMING (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
3 0
Prerequisites
1. A course on “Operating Systems”
2. A course on “Java Programming”
Course Objectives: To explore the abstractions used in concurrent programming
Course Outcomes:
1. Ability to implement the mechanisms for communication and co-ordination among concurrent process
2. Ability to understand and reason about concurrency and concurrent objects
3. Ability to implement the locking and non-blocking mechanisms
4. Ability to understand concurrent objects

UNIT - I
Introduction - Shared Objects and Synchronization, A Fable, Properties of Mutual Exclusion, The Moral, The
Producer–Consumer Problem, The Harsh Realities of Parallelization.
Mutual Exclusion - Time, Critical Sections, 2-Thread Solutions, The Peterson Lock, The Filter Lock,
Lamport’s Bakery Algorithm.

UNIT - II
Concurrent Objects - Concurrency and Correctness, Sequential Objects, Quiescent consistency,
Sequential Consistency, Linearizability, Linearization Points, Formal Definitions
Linearizability, Compositional Linearizability, The Nonblocking Property, Progress conditions,
Dependent Progress Conditions, The Java Memory Model, Locks and synchronized Blocks, Volatile Fields, F
Fields.

UNIT - III
Synchronization Operations, Consensus Numbers, Consensus Protocols, The compareAndSet() Operat
Introduction Universality, A Lock-Free Universal, Construction Wait- Free Universal
Construction, Spin Locks , Test-And-Set Locks

UNIT - IV
Linked Lists: The Role of Locking, Introduction, List-Based Sets, Concurrent Reasoning, Coarse-
Grained Synchronization, Fine-Grained Synchronization, Optimistic Synchronization, Lazy
Synchronization, Non-Blocking Synchronization

UNIT - V
Concurrent Queues and the ABA Problem, Concurrent Stacks and Elimination, Transactional Memories
TEXT BOOKS:
1. The Art of Multiprocessor Programming, by Maurice Herlihy and Nir Shavit, Morgan Kaufmman Publishe
1st Edition, Indian Reprint 2012.
REFERENCE BOOKS:
1. Java Concurrency in Practice by Brian Goetz, Tim Peierls, Joshua Block, Joseph Bowbeer, David Holmes
and Doug Lea, Addison Wesley, 1st Edition, 2006.
2. Concurrent Programming in Java™: Design Principles and Patterns, Second Edition by Doug
Lea, Publisher: Addison Wesley, Pub Date: October 01, 1999.
 CS612PE: NETWORK PROGRAMMING (Professional Elective - III)
III Year B.Tech. CSE II-Sem L T P
3 0
Course Objectives:
 To understand inter process and inter-system communication
 To understand socket programming in its entirety
 To understand usage of TCP/UDP / Raw sockets
 To understand how to build network applications

Course Outcomes:
 To write socket API based programs
 To design and implement client-server applications using TCP and UDP sockets
 To analyze network programs

UNIT - I
Introduction to Network Programming: OSI model, Unix standards, TCP and UDP & TCP connection
establishment and Format, Buffer sizes and limitation, standard internet services, Protocol usage by comm
internet application.
Sockets: Address structures, value – result arguments, Byte ordering and manipulation function and relate
functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec
function, concurrent servers. Close function and related function.

UNIT - II
TCP client server: Introduction, TCP Echo server functions, Normal startup, terminate and signal
handling server process termination, Crashing and Rebooting of server host shutdown of server host.
Elementary UDP sockets: Introduction UDP Echo server function, lost datagram, summary of UDP example
Lack of flow control with UDP, determining outgoing interface with UDP.
I/O Multiplexing: I/O Models, select function, Batch input, shutdown function, poll function, TCP Echo
server,

UNIT - III
Socket options: getsockopt and setsockopt functions. Socket states, Generic socket option IPV6 socke
option ICMPV6 socket option IPV6 socket option and TCP socket options.
Advanced I/O Functions-Introduction, Socket Timeouts, recv and send Functions,readv and writev Functio
recvmsg and sendmsg Functions, Ancillary Data, How Much Data Is Queued?, Sockets and
Standard I/O, T/TCP: TCP for Transactions.

UNIT - IV
Elementary name and Address conversions: DNS, gethost by Name function, Resolver option, Functio
and IPV6 support, uname function, other networking information.
Daemon Processes and inetd Superserver – Introduction, syslogd Daemon, syslog Function, daemon_i
Function, inetd Daemon, daemon_inetd Function
Broadcasting- Introduction, Broadcast Addresses, Unicast versus Broadcast, dg_cli Function Using
Broadcasting, Race Conditions
Multicasting- Introduction, Multicast Addresses, Multicasting versus Broadcasting on A LAN,
Multicasting on a WAN, Multicast Socket Options, mcast_join and Related Functions, dg_cli Function Using
Multicasting, Receiving MBone Session Announcements, Sending and Receiving, SNTP: Simple
Network Time Protocol, SNTP (Continued)
UNIT - V
Raw Sockets-Introduction, Raw Socket Creation, Raw Socket Output, Raw Socket Input, Ping Program,
Traceroute Program, An ICMP Message Daemon,
Datalink Access- Introduction, BPF: BSD Packet Filter, DLPI: Data Link Provider Interface, Linux:
SOCK_PACKET, libpcap: Packet Capture Library, Examining the UDP Checksum Field.
Remote Login: Terminal line disciplines, Pseudo-Terminals, Terminal modes, Control Terminals, rlogin
Overview, RPC Transparency Issues.

TEXT BOOKS:
1. UNIX Network Programming, by W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Pearson Education
2. UNIX Network Programming, 1st Edition, - W. Richard Stevens. PHI.

REFERENCE BOOKS:
1. UNIX Systems Programming using C++ T CHAN, PHI.
2. UNIX for Programmers and Users, 3rd Edition Graham GLASS, King abls, Pearson Education
3. Advanced UNIX Programming 2nd Edition M. J. ROCHKIND, Pearson Education

CS613PE: SCRIPTING LANGUAGES (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
3 0
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Object Oriented Programming Concepts”
Course Objectives:
 This course introduces the script programming paradigm
 Introduces scripting languages such as Perl, Ruby and TCL.
 Learning TCL

Course Outcomes:
 Comprehend the differences between typical scripting languages and typical system and application
programming languages.
 Gain knowledge of the strengths and weakness of Perl, TCL and Ruby; and select an appropriate langu
for solving a given problem.
 Acquire programming skills in scripting language

UNIT - I
Introduction: Ruby, Rails, The structure and Excution of Ruby Programs, Package Management with
RUBYGEMS, Ruby and web: Writing CGI scripts, cookies, Choice of Webservers, SOAP and webservices
RubyTk – Simple Tk Application, widgets, Binding events, Canvas, scrolling

UNIT - II
Extending Ruby: Ruby Objects in C, the Jukebox extension, Memory allocation, Ruby Type System,
Embedding Ruby to Other Languages, Embedding a Ruby Interperter
UNIT - III
Introduction to PERL and Scripting
Scripts and Programs, Origin of Scripting, Scripting Today, Characteristics of Scripting Languages, Use
for Scripting Languages, Web Scripting, and the universe of Scripting Languages. PERL- Names and Values
Variables, Scalar Expressions, Control Structures, arrays, list, hashes, strings, pattern and regular
expressions, subroutines.
UNIT - IV
Advanced perl
Finer points of looping, pack and unpack, filesystem, eval, data structures, packages, modules, objects,
interfacing to the operating system, Creating Internet ware applications, Dirty Hands Internet
Programming, security Isses.

UNIT - V TCL
TCL Structure, syntax, Variables and Data in TCL, Control Flow, Data Structures, input/output,
procedures, strings, patterns, files, Advance TCL- eval, source, exec and uplevel commands, Name spaces
trapping errors, event driven programs, making applications internet aware, Nuts and Bolts Internet
Programming, Security Issues, C Interface.
Tk
Tk-Visual Tool Kits, Fundamental Concepts of Tk, Tk by example, Events and Binding, Perl-Tk.

TEXT BOOKS:
1. The World of Scripting Languages, David Barron,Wiley Publications.
2. Ruby Progamming language by David Flanagan and Yukihiro Matsumoto O’Reilly
3. “Programming Ruby” The Pramatic Progammers guide by Dabve Thomas Second edition

REFERENCE BOOKS:
1. Open Source Web Development with LAMP using Linux Apache, MySQL, Perl and PHP, J. Lee and B. Wa
(Addison Wesley) Pearson Education.
2. Perl by Example, E. Quigley, Pearson Education.
3. Programming Perl, Larry Wall, T. Christiansen and J. Orwant, O’Reilly, SPD.
4. Tcl and the Tk Tool kit, Ousterhout, Pearson Education.
5. Perl Power, J. P. Flynt, Cengage Learning.

CS614PE: MOBILE APPLICATION DEVELOPMENT (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
3 0
Prerequisites
1. Acquaintance with JAVA programming
2. A Course on DBMS
Course Objectives
 To demonstrate their understanding of the fundamentals of Android operating systems
 To improves their skills of using Android software development tools
 To demonstrate their ability to develop software with reasonable complexity on mobile platform
 To demonstrate their ability to deploy software to mobile devices
 To demonstrate their ability to debug programs running on mobile devices

Course Outcomes
 Student understands the working of Android OS Practically.
 Student will be able to develop Android user interfaces
 Student will be able to develop, deploy and maintain the Android Applications.

UNIT - I
Introduction to Android Operating System: Android OS design and Features – Android development
framework, SDK features, Installing and running applications on Android Studio, Creating AVDs, Types of
Android applications, Best practices in Android programming, Android tools
Android application components – Android Manifest file, Externalizing resources like values, themes, layou
Menus etc, Resources for different devices and languages, Runtime Configuration Changes
Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring state changes
UNIT - II
Android User Interface: Measurements – Device and pixel density independent measuring UNIT - s Layouts
Linear, Relative, Grid and Table Layouts
User Interface (UI) Components – Editable and non-editable TextViews, Buttons, Radio and Toggle Buttons
Checkboxes, Spinners, Dialog and pickers
Event Handling – Handling clicks or changes of various UI components
Fragments – Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to Activity,
adding, removing and replacing fragments with fragment transactions, interfacing between fragments and
Activities, Multi-screen Activities

UNIT - III
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new Activity, Implicit
Intents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent to dial a numb
or to send SMS
Broadcast Receivers – Using Intent filters to service implicit Intents, Resolving Intent filters, finding and us
Intents received within an Activity
Notifications – Creating and Displaying notifications, Displaying Toasts

UNIT - IV
Persistent Storage: Files – Using application specific folders and files, creating files, reading data from files
listing contents of a directory Shared Preferences – Creating shared preferences, saving and retrievin
data using Shared Preference

UNIT - V
Database – Introduction to SQLite database, creating and opening a database, creating tables, inserting
retrieving and etindelg data, Registering Content Providers, Using content Providers (insert, delete, retriev
and update)

TEXT BOOKS:
1. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox), 2012
2. Android Application Development for Java Programmers, James C Sheusi, Cengage Learning, 2013

REFERENCE BOOK:
1. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
CS615PE: SOFTWARE TESTING METHODOLOGIES (Professional Elective - III)
III Year B.Tech. CSE II-Sem L T P
3 0
Prerequisites
1. A course on “Software Engineering”
Course Objectives
 To provide knowledge of the concepts in software testing such as testing process, criteria,
strategies, and methodologies.
 To develop skills in software test automation and management using latest tools.

Course Outcomes: Design and develop the best test strategies in accordance to the development
model.
UNIT - I
Introduction: Purpose of testing, Dichotomies, model for testing, consequences of bugs, taxonomy of bugs
Flow graphs and Path testing: Basics concepts of path testing, predicates, path predicates and
achievable paths, path sensitizing, path instrumentation, application of path testing.
UNIT - II
Transaction Flow Testing: transaction flows, transaction flow testing techniques. Dataflow testing:
Basics of dataflow testing, strategies in dataflow testing, application of dataflow testing. Domain Testing:
domains and paths, Nice & ugly domains, domain
testing, domains and interfaces testing, domain and interface testing, domains and testability.

UNIT - III
Paths, Path products and Regular expressions: path products & path expression, reduction procedure,
applications, regular expressions & flow anomaly detection.
Logic Based Testing: overview, decision tables, path expressions, kv charts, specifications.

UNIT - IV
State, State Graphs and Transition testing: state graphs, good & bad state graphs, state testing,
Testability tips.
UNIT - V
Graph Matrices and Application: Motivational overview, matrix of graph, relations, power of a matrix, node
reduction algorithm, building tools. (Student should be given an exposure to a tool like JMeter or Win-runn

TEXT BOOKS:
1. Software Testing techniques - Baris Beizer, Dreamtech, second edition.
2. Software Testing Tools – Dr. K. V. K. K. Prasad, Dreamtech.
REFERENCE BOOKS:
1. The craft of software testing - Brian Marick, Pearson Education.
2. Software Testing Techniques – SPD(Oreille)
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley.
5. Art of Software Testing – Meyers, John Wiley.

CS604PC: MACHINE LEARNING LAB

 L T P C
3 0 0 3

of the concepts and

rence model.

can be applied in network

Networks: ARPANET, Internet.

ber optics, Wireless

col for an error-free channel,

o-Back-N, A protocol using

ocols: ALOHA, Carrier

k layer switching.

ng, Hierarchical routing,

s, Quality of Service,

on management, TCP and UDP

, HTTP, Streaming audio and

Edition. Pearson

son Education
TMH.
 L T P C
3 0 0 3

mming

xpressions, control
o buttons, lists etc., Handling
mple queries, handling results,

nding, deleting etc.

s;
ment Type Definition, XML
rsers in java.

Servlet, deploying a servlet,

Handling Http Request &

ns, Directives,
ookies and session for session

ariables, scope of variables,

m validation.

ey Dreamtech

tive - I)
L T P C
3 0 0 3
 Average and Mutual

ection, Minimum Distance of

Standard array and
over a BSC, Hamming Codes.

rome Computation and Error

-trapping decoding for cyclic

Properties, state, tree, trellis

ecoding of Convolution
cations of Convolutional

H codes, Syndrome
double error correction.

ello,Jr, Prentice Hall, Inc 2014.

989

oon, 2006, Wiley India.

09, TMH.

lective - I)
L T P C
3 0 0 3
chitectures.
es.
chitectures to design modern

Multiprocessors and
tectural development tracks,
partitioning and Scheduling,

s, Parallel Processing
proaches, Hardware
y, Superscalar and

organizations, Shared-
ining and superscalar
on Pipeline design, Arithmetic

ultiprocessor system
ree Generations of
, Vector Processing Principals,
nizations,

niques, Principals of
itectures, Dataflow and

Hill Publishers.

SEVIER.
C, Taylor &Francis.
, G. Hager and G. Wellein,

on education.

L T P C
3 0 0 3
and estimate the accuracy of

understand various sources

tliers, missing

, Application of Modeling in
Missing Imputations etc.

riable Rationalization, and

ytics applications to

sed Learning, Tree Building –

n Trees etc. Time Series
from generated model as

rojection Visualization
hniques, Visualizing Complex

Morgan Kaufmann Publishers.

06.

Milliway Labs Jeffrey D

 L T P C
3 0 0 3

urier Transform, basic linear

e of Digital Signal Processing

mage Processing concepts.

ing; enhancement;

signal acquisition, sampling,

restoration and

cept of Gray Levels.

onship between Pixels.

sing, Spatial Filtering,

Inverse Filtering, Least Mean

etection, Thresholding,

Image Compression Models,

arson Education, 2 nd Ed, 2004.

Woods, Steven L. Eddins:

ve - I)
L T P C
3 0 0 3
 ementation
expressions and statements;
programming languages; and

application
g languages

s, Programming Domains,
ategories, Language Design

rmal Methods of

g, Scope, Scope and Lifetime,

fined Ordinal Types, Array,

ce Types, Type Checking,

Type Conversions, Relational

ed-Mode Assignment
ments, Unconditional

programs, Local Referencing

Calling Subprograms
es for Functions, User

menting Simple
Nested Subprograms, Blocks,

on, Design Issues,

capsulations

aphores, Monitors, Message

ncurrency. Exception
+, Java, Introduction to Event
undamentals of Functional
mperative Languages,

Basic Elements of Prolog,

Types, Variables,
straction, Separate

cation.
07.

)
L T P C
3 0 0 3

ebra such as matrix

s and theory of computer

sentations and 2D/3D

nimation;

tions

ems, video-display devices,

s and input devices
DA Algorithm), mid- point

ar transformations, matrix
mations between coordinate

w to view-port coordinate
odgeman
on, Hermite curve, Bezier
els, polygon rendering

r transformations, composite

ojection transforms

n functions, raster animation,

buffer, BSP-tree

n Education
Dam, Feiner and Hughes,

hill, 2nd edition.

tive - II)
L T P C
3 0 0 3

ystems (parallel processing

nd open source operating

mory.

erating Systems, Issues in

dations: Inherent Limitations
ng

ms, Non-Token – Based

Algorithm, Token-Based
hm, Raymond’s Heuristic
stributed Systems, Issues in
ock Detection, Centralized-
erarchical Deadlock Detection

or Systems, Basic
ction, Structures of
ess Synchronization,

Systems, Design

buted Algorithm, Stability,

n, Issues in task Migration
nting DSM, Memory

. Shivaratri, Tata McGraw-Hill

on Prentice Hall, Edition – 2,

ctive - II)
L T P C
3 0 0 3

lement information retrieval

of data

al System, Objectives of
Management Systems, Digital

abilities, Miscellaneous
Automatic Indexing,

File Structure, N-Gram Data

ta Structures,

Language, Concept Indexing,

ation, Item Clustering,

sures and Ranking,

Searches of Boolean Systems,

nition and Perception,

Search Algorithms, Hardware

peech Audio Retrieval,

econd Edition, Gerald J.

es and Algorithms, Prentice

- II)
L T P C
3 0 0 3

abase systems and exposing

f the centralized database

abase systems.
databases.
and optimization; distributed
ent systems.
 s.
database system.
ed development.

mises of DDBSs, Problem

S Architecture.
on Design issues,

rization of query processors,

a.
n, distributed query

sactions, distributed
ms, time - stamped &

nce in distributed systems,

s and network partitioning.
placement, parallel

pts and models,

object storage, object query

mming languages,

stems, Pearson Edn. Asia,

s: The Complete Book”,

ctive - II)
L T P C
3 0 0 3

linguistics and statistics.

 ormal grammars.
d evaluating empirical NLP

d trees, and estimate

and Challenges,

he Approaches,

oach to Syntax,
Resolution in Parsing,

rd Sense Systems, Software.

nd Structure Language
ameter Estimation, Language
Problems, Multilingual and

ice – Daniel M. Bikel and

S. Tiwary

Martin, Pearson Publications

L T P C
0 0 3 1.5

ng various software
ment.
ments
rements
to develop a simple testing

or any other projects:

ments and Testing Phase

elated documents.

tion, Mc Graw Hill

var Jacobson, Pearson

LAB
L T P C
0 0 3 1.5

opology and observe its

r-stuffing and bit stuffing.
and CRC CCIP
ding window protocol, and loss

work
.
each node.

Packets
Write a PHP script that reads data from one file and write into another file.5. Develop static pages (using Only HTML) of an online book store. The pages

earson Education

ogram”, Pearson

8th Edition

L T P C
0 0 2 1
 tial at 3rd year level. At this
quire them to listen to, read,
nication in the globalized

use ‘good’ English and

o meet the following targets:

ulary and enable them to
eakers and respond

oherently in writing.

e Advanced English

Vocabulary - Starting a
nguage – Role Play in
word roots, one-word
ry, analogy, idioms and

reading for facts, guessing

& effective googling.
es of writing – letter
writing – improving one’s

up) through JAM

orts/ e-

discussion,
ncy and organization of ideas
opening

conference and Mock

ollowing infrastructural

ocured and used.

on (India) Pvt. Ltd. 2 nd Edition

ey, Routledge, 5th

K. Kumar and Hemalatha

) Pvt. Ltd, 2016.

d University Press 2009.
. Ltd. New Delhi.

ne Buckley. 2012. Cengage

amohan, Tata Mc Graw-Hill

L T P C
3 0 0 0

l property, international

hts, protectable matter,

 of reproduction, rights to
notice of copy right,

rights and transfer

y for misappropriations of

; copy right law, patent law,

law, copy right law,

ddha ganguli, Tata McGraw

L T P C
3 1 0 4

ning, Bayesian learning etc.

g
eal time problems in different

on.

ectives and issues in machine

earning task, concept

es and the candidate
ductive bias.
problems for decision
search in decision tree
g.
 riate problems for neural
gorithm.
trative example: face

ampling theory, a general

s, comparing

arning, Maximum Likelihood

predicting probabilities,
hm, Naïve Bayes classifier,
m.
y correct hypothesis, sample
s spaces, the mistake bound

ighted regression,
g.

e, hypothesis space search,

gorithms.
ule sets: summary, learning
deduction, inverting

ministic, rewards and actions,

to dynamic

OG-EBG, remarks on
edge.
prior knowledge to augment

l approaches to

Francis

L T P C
3 1 0 4
 ign and impart the

checking use of symbol

ration

s.
or lexical analysis.
er.

nce of a program in terms of

gramming language basics

ition of Tokens, The Lexical-
a, Design of a

Top-Down Parsing, Bottom-

ers, Using Ambiguous

DD's, Applications of Syntax-

-Attributed SDD's.
Code, Types and
de for Procedures.

he Stack, Heap Management,

e, Addresses in the Target

de Generator,
ming Code-Generation.

ction to Data-Flow Analysis,

limination, Loops in Flow

Monica S. Lam, Ravi Sethi,

 L T P C
3 1 0 4

racking, dynamic
for which each technique is

verage-, and best- case

d introduces the problems

hods for a specified

thm design methods impact

lexity, Asymptotic Notations-

rge sort, Strassen’s

bsets problem, graph

rees, 0/1 knapsack problem,

gn.

, knapsack problem,

em, 0/1 knapsack problem -

s, NP - Hard and

Rajasekharan, University
ation.
L. Rivest, and C. Stein, PHI

ch and R.

e - III)
L T P C
3 0 0 3

among concurrent processes.

l Exclusion, The Moral, The

k, The Filter Lock,

iescent consistency,

Progress conditions,
ed Blocks, Volatile Fields, Final

compareAndSet() Operation,
Wait- Free Universal

t Reasoning, Coarse-
nchronization, Lazy

ransactional Memories

Morgan Kaufmman Publishers,

ph Bowbeer, David Holmes

Edition by Doug
 III)
L T P C
3 0 0 3

ets

& TCP connection

s, Protocol usage by common

ulation function and related

fork and exec

terminate and signal

tdown of server host.
summary of UDP example,

l function, TCP Echo

c socket option IPV6 socket

,readv and writev Functions,

ockets and

, Resolver option, Function

yslog Function, daemon_init

cli Function Using

dcasting on A LAN,
ons, dg_cli Function Using
, SNTP: Simple
t Input, Ping Program,

vider Interface, Linux:

Field.
ntrol Terminals, rlogin

Rudoff, Pearson Education

rson Education
n

II)
L T P C
3 0 0 3

l system and application

elect an appropriate language

e Management with
SOAP and webservices

Ruby Type System,

Scripting Languages, Uses

s. PERL- Names and Values,
attern and regular
 ages, modules, objects,
Dirty Hands Internet

ctures, input/output,
l commands, Name spaces,
ts and Bolts Internet

nding, Perl-Tk.

Reilly
cond edition

and PHP, J. Lee and B. Ware

ctive - III)
L T P C
3 0 0 3

ng systems

on mobile platform

s.

droid development
Creating AVDs, Types of

like values, themes, layouts,

on Changes
toring state changes
measuring UNIT - s Layouts –

Radio and Toggle Buttons,

ng fragments to Activity,
ng between fragments and

ting new Activity, Implicit

using Intent to dial a number

ntent filters, finding and using

les, reading data from files,

ces, saving and retrieving

reating tables, inserting

ders (insert, delete, retrieve

Wrox), 2012
ngage Learning, 2013

Wrox), 2013
ective - III)
L T P C
3 0 0 3

g process, criteria,

ools.

the development

of bugs, taxonomy of bugs

, path predicates and
ting.
ques. Dataflow testing:
testing. Domain Testing:

and testability.

, reduction procedure,

cifications.

e graphs, state testing,

ns, power of a matrix, node

ool like JMeter or Win-runner).
 III Year B.Tech. CSE II-Sem L T P
0 0 3
Course Objective: The objective of this lab is to get an overview of the various machine learning
techniques and can able to demonstrate them using python.
Course Outcomes: After the completion of the course the student can able to:
 understand complexity of Machine Learning algorithms and their limitations;
 understand modern notions in data analysis-oriented computing;
 be capable of confidently applying common Machine Learning algorithms in practice and
implementing their own;
 Be capable of performing experiments in Machine Learning using real-world data.

List of Experiments
1. The probability that it is Friday and that a student is absent is 3 %. Since there are 5 school days in a
week, the probability that it is Friday is 20 %. What is theprobability that a student is absent given that tod
is Friday? Apply Baye’s rule in python to get the result. (Ans: 15%)

2. Extract the data from database using python

3. Implement k-nearest neighbours classification using python
4. Given the following data, which specify classifications for nine combinations of VAR1 and VAR2 pred
a classification for a case where VAR1=0.906 and VAR2=0.606, using the result of k- means clustering
with 3 means (i.e., 3 centroids)
VAR1 VAR2
1.713 1.586
0.180 1.786
0.353 1.240
0.940 1.566
1.486 0.759
1.266 1.106
1.540 0.419
0.459 1.799
0.773 0.186
5. The following training examples map descriptions of individuals onto high, medium and low credit
worthiness.
medium skiing design single twenties no -> highRisk high golf trading married forties y
-> lowRisk
low speedway transport married thirties yes -> medRisk medium football banking single thirt
yes -> lowRisk high flying media married fifties yes -> highRisk
low football security single twenties no -> medRisk medium golf media single thirties y
> medRisk medium golf transport married forties yes -> lowRisk high skiing banking single
thirties yes -> highRisk
low golf unemployed married forties yes -> highRisk

Input attributes are (from left to right) income, recreation, job, status, age-group, home-owner. Find the
unconditional probability of `golf' and the conditional probability of `single' given `medRisk' in the
dataset?
6. Implement linear regression using python.
7. Implement Naïve Bayes theorem to classify the English text
8. Implement an algorithm to demonstrate the significance of genetic algorithm
9. Implement the finite words classification system using Back-propagation algorithm
 CS605PC: COMPILER DESIGN LAB
III Year B.Tech. CSE II-Sem L T P
0 0 3
Prerequisites
1. A Course on “Objected Oriented Programming through Java”
Co-requisites:
1. A course on “Web Technologies”
Course Objectives:
 To provide hands-on experience on web technologies
 To develop client-server application using web technologies
 To introduce server-side programming with Java servlets and JSP
 To understand the various phases in the design of a compiler.
 To understand the design of top-down and bottom-up parsers.
 To understand syntax directed translation schemes.
 To introduce lex and yacc tools.

Course Outcomes:
 Design and develop interactive and dynamic web applications using HTML, CSS, JavaScript and XML
 Apply client-server principles to develop scalable and enterprise web applications.
 Ability to design, develop, and implement a compiler for any language.
 Able to use lex and yacc tools for developing a scanner and a parser.
 Able to design and implement LL and LR parsers.

List of Experiments
Compiler Design Experiments
1. Write a LEX Program to scan reserved word & Identifiers of C Language
2. Implement Predictive Parsing algorithm
3. Write a C program to generate three address code.
4. Implement SLR(1) Parsing algorithm
5. Design LALR bottom up parser for the given language
<program> ::= <block>
<block> ::= { <variabledefinition> <slist> }
| { <slist> }
<variabledefinition> ::= int <vardeflist> ;
<vardeflist> ::= <vardec> | <vardec> , <vardeflist>
<vardec> ::= <identifier> | <identifier> [ <constant> ]
<slist> ::= <statement> | <statement> ; <slist>
<statement> ::= <assignment> | <ifstatement> | <whilestatement>
| <block> | <printstatement> | <empty>
<assignment> ::= <identifier> = <expression>
| <identifier> [ <expression> ] = <expression>
<ifstatement> ::= if <bexpression> then <slist> else <slist> endif
| if <bexpression> then <slist> endif
<whilestatement> ::= while <bexpression> do <slist> enddo
<printstatement> ::= print ( <expression> )
<expression> ::= <expression> <addingop> <term> | <term> | <addingop> <term>
<bexpression> ::= <expression> <relop> <expression>
<relop> ::= < | <= | == | >= | > | !=
<addingop> ::= + | -
<term> ::= <term> <multop> <factor> | <factor>
<multop> ::= * | /
<factor> ::= <constant> | <identifier> | <identifier> [ <expression>]
| ( <expression> )
<constant> ::= <digit> | <digit> <constant>
<identifier> ::= <identifier> <letterordigit> | <letter>
<letterordigit> ::= <letter> | <digit>
<letter> ::= a|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z
<digit> ::= 0|1|2|3|4|5|6|7|8|9
<empty> has the obvious meaning
Comments (zero or more characters enclosed between the standard C/Java-style comment brackets
/*...*/) can be inserted. The language has rudimentary support for 1-dimensional arrays. The declaration
a[3] declares an array of three elements, referenced as a[0], a[1] and a[2]. Note also that you should worr
about the scoping of names.
A simple program written in this language is:
{ int a[3],t1,t2; t1=2;
a[0]=1; a[1]=2; a[t1]=3;
t2=-(a[2]+t1*6)/(a[2]-t1);
if t2>5 then print(t2); else {
int t3; t3=99; t2=-25;
print(-t1+t2*t3); /* this is a comment
on 2 lines */

}
endif
}
CS621PE: CONCURRENT PROGRAMMING LAB (Professional Elective - III)
III Year B.Tech. CSE II-Sem L T P
0 0 2
List of Experiments:
1. Design and implement Two-thread mutual exclusion algorithm (Peterson’s Algorithm) using
multithreaded programming.
2. Design and implement Filter Lock algorithm and check for deadlock-free and starvation-free conditions
using multithreaded programming.
3. Design and implement Lamport’s Bakery Algorithm and check for deadlock-free and starvation- free
conditions using multithreaded programming.
4. Design and implement Lock-based concurrent FIFO queue data structure using multithreaded
programming.
5. Design a consensus object using read–write registers by implementing a deadlock-free or
starvation-free mutual exclusion lock. (Use CompareAndSet( ) Primitive).
6. Design and implement concurrent List queue data structure using multithreaded programming. (Use
Atomic Primitives)
7. Design and implement concurrent Stack queue data structure using multithreaded
programming. (Use Atomic Primitives)
8. Design and implement concurrent FIFO queue data structure using multithreaded
programming. (Use Atomic Primitives)

CS622PE: NETWORK PROGRAMMING LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
0 0 2
Course Objectives:
 To understand inter process and inter-system communication
 To understand socket programming in its entirety
 To understand usage of TCP/UDP / Raw sockets
 To understand how to build network applications

Course Outcomes:
 To write socket API based programs
 To design and implement client-server applications using TCP and UDP sockets
 To analyze network programs

List of Experiments
1. Implement programs for Inter Process Communication using PIPE, Message Queue and Shared
Memory.
2. Write a programme to create an integer variable using shared memory concept and increment the
variable simultaneously by two processes. Use semaphores to avoid race conditions.
3. Design TCP iterative Client and server application to reverse the given input sentence
4. Design TCP iterative Client and server application to reverse the given input sentence
5. Design TCP client and server application to transfer file
6. Design a TCP concurrent server to convert a given text into upper case using multiplexing system call
“select”
7. Design a TCP concurrent server to echo given set of sentences using poll functions
8. Design UDP Client and server application to reverse the given input sentence
9. Design UDP Client server to transfer a file
10. Design using poll client server application to multiplex TCP and UDP requests for converting a given te
into upper case.
11. Design a RPC application to add and subtract a given pair of integers
TEXT BOOKS:
1. UNIX Network Programming, by W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Pearson Education
2. UNIX Network Programming, 1st Edition, - W. Richard Stevens. PHI.

CS623PE: SCRIPTING LANGUAGES LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
0 0 2
Prerequisites: Any High-level programming language (C, C++)
Course Objectives:
 To Understand the concepts of scripting languages for developing web based projects
 To understand the applications the of Ruby, TCL, Perl scripting languages

Course Outcomes:
 Ability to understand the differences between Scripting languages and programming languages
 Able to gain some fluency programming in Ruby, Perl, TCL

List of Experiments
1. Write a Ruby script to create a new string which is n copies of a given string where n is a non- negativ
integer
2. Write a Ruby script which accept the radius of a circle from the user and compute the parameter and
area.
3. Write a Ruby script which accept the user's first and last name and print them in reverse order with a
space between them
4. Write a Ruby script to accept a filename from the user print the extension of that
5. Write a Ruby script to find the greatest of three numbers
6. Write a Ruby script to print odd numbers from 10 to 1
7. Write a Ruby scirpt to check two integers and return true if one of them is 20 otherwise return their su
8. Write a Ruby script to check two temperatures and return true if one is less than 0 and the other is
greater than 100
9. Write a Ruby script to print the elements of a given array
10. Write a Ruby program to retrieve the total marks where subject name and marks of a student stored i
hash
11. Write a TCL script to find the factorial of a number
12. Write a TCL script that multiplies the numbers from 1 to 10
13. Write a TCL script for Sorting a list using a comparison function
14. Write a TCL script to (i)create a list (ii )append elements to the list (iii)Traverse the list
(iv)Concatenate the list
15. Write a TCL script to comparing the file modified times.
16. Write a TCL script to Copy a file and translate to native format.
17. a) Write a Perl script to find the largest number among three numbers.
b) Write a Perl script to print the multiplication tables from 1-10 using subroutines.
18. Write a Perl program to implement the following list of manipulating functions
a)Shift b)Unshift c)Push
19. a) Write a Perl script to substitute a word, with another word in a string.
b) Write a Perl script to validate IP address and email address.
20. Write a Perl script to print the file in reverse order using command line arguments
 III Year B.Tech. CSE II-Sem L T P C
0 0 3 1.5
ve: The objective of this lab is to get an overview of the various machine learning
d can able to demonstrate them using python.
mes: After the completion of the course the student can able to:
complexity of Machine Learning algorithms and their limitations;
modern notions in data analysis-oriented computing;
e of confidently applying common Machine Learning algorithms in practice and
their own;
of performing experiments in Machine Learning using real-world data.

ents
bility that it is Friday and that a student is absent is 3 %. Since there are 5 school days in a
bability that it is Friday is 20 %. What is theprobability that a student is absent given that today
y Baye’s rule in python to get the result. (Ans: 15%)

the data from database using python

ent k-nearest neighbours classification using python
he following data, which specify classifications for nine combinations of VAR1 and VAR2 predict
ion for a case where VAR1=0.906 and VAR2=0.606, using the result of k- means clustering
ns (i.e., 3 centroids)
CLASS
0
1
1
0
1
0
1
1
1
owing training examples map descriptions of individuals onto high, medium and low credit-

kiing design single twenties no -> highRisk high golf trading married forties yes

edway transport married thirties yes -> medRisk medium football banking single thirties
Risk high flying media married fifties yes -> highRisk
ball security single twenties no -> medRisk medium golf media single thirties yes -
medium golf transport married forties yes -> lowRisk high skiing banking single
-> highRisk
unemployed married forties yes -> highRisk

s are (from left to right) income, recreation, job, status, age-group, home-owner. Find the
probability of `golf' and the conditional probability of `single' given `medRisk' in the

linear regression using python.

Naïve Bayes theorem to classify the English text
an algorithm to demonstrate the significance of genetic algorithm
the finite words classification system using Back-propagation algorithm
 CS605PC: COMPILER DESIGN LAB
III Year B.Tech. CSE II-Sem L T P C
0 0 3 1.5

n “Objected Oriented Programming through Java”

n “Web Technologies”
ves:
hands-on experience on web technologies
client-server application using web technologies
e server-side programming with Java servlets and JSP
and the various phases in the design of a compiler.
and the design of top-down and bottom-up parsers.
and syntax directed translation schemes.
e lex and yacc tools.

mes:
develop interactive and dynamic web applications using HTML, CSS, JavaScript and XML
t-server principles to develop scalable and enterprise web applications.
esign, develop, and implement a compiler for any language.
lex and yacc tools for developing a scanner and a parser.
ign and implement LL and LR parsers.

periments
ram to scan reserved word & Identifiers of C Language
ctive Parsing algorithm
m to generate three address code.
1) Parsing algorithm
tom up parser for the given language
ock>
abledefinition> <slist> }

::= int <vardeflist> ;

ardec> | <vardec> , <vardeflist>
tifier> | <identifier> [ <constant> ]
ent> | <statement> ; <slist>
assignment> | <ifstatement> | <whilestatement>
atement> | <empty>
<identifier> = <expression>
pression> ] = <expression>
<bexpression> then <slist> else <slist> endif
hen <slist> endif
:= while <bexpression> do <slist> enddo
= print ( <expression> )
expression> <addingop> <term> | <term> | <addingop> <term>
<expression> <relop> <expression>
 | <= | == | >= | > | !=
=+|-
term> <multop> <factor> | <factor>
*|/
<constant> | <identifier> | <identifier> [ <expression>]
n> )
= <digit> | <digit> <constant>
= <identifier> <letterordigit> | <letter>
> ::= <letter> | <digit>
|b|c|d|e|f|g|h|i|j|k|l|m|n|o|p|q|r|s|t|u|v|w|x|y|z
1|2|3|4|5|6|7|8|9
the obvious meaning
ro or more characters enclosed between the standard C/Java-style comment brackets
nserted. The language has rudimentary support for 1-dimensional arrays. The declaration int
an array of three elements, referenced as a[0], a[1] and a[2]. Note also that you should worry
ping of names.
am written in this language is:
; t1=2;
2; a[t1]=3;
6)/(a[2]-t1);
int(t2); else {
t2=-25;
3); /* this is a comment

CS621PE: CONCURRENT PROGRAMMING LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P C
0 0 2 1
 ents:
d implement Two-thread mutual exclusion algorithm (Peterson’s Algorithm) using
programming.
d implement Filter Lock algorithm and check for deadlock-free and starvation-free conditions
eaded programming.
d implement Lamport’s Bakery Algorithm and check for deadlock-free and starvation- free
ng multithreaded programming.
d implement Lock-based concurrent FIFO queue data structure using multithreaded

consensus object using read–write registers by implementing a deadlock-free or

mutual exclusion lock. (Use CompareAndSet( ) Primitive).
d implement concurrent List queue data structure using multithreaded programming. (Use
ves)
nd implement concurrent Stack queue data structure using multithreaded
(Use Atomic Primitives)
nd implement concurrent FIFO queue data structure using multithreaded
(Use Atomic Primitives)

CS622PE: NETWORK PROGRAMMING LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P C
0 0 2 1
ves:
and inter process and inter-system communication
and socket programming in its entirety
and usage of TCP/UDP / Raw sockets
and how to build network applications

mes:
cket API based programs
and implement client-server applications using TCP and UDP sockets
network programs

ents
programs for Inter Process Communication using PIPE, Message Queue and Shared

ogramme to create an integer variable using shared memory concept and increment the
taneously by two processes. Use semaphores to avoid race conditions.
P iterative Client and server application to reverse the given input sentence
P iterative Client and server application to reverse the given input sentence
P client and server application to transfer file
CP concurrent server to convert a given text into upper case using multiplexing system call

CP concurrent server to echo given set of sentences using poll functions

P Client and server application to reverse the given input sentence
P Client server to transfer a file
ng poll client server application to multiplex TCP and UDP requests for converting a given text
e.
PC application to add and subtract a given pair of integers
 ork Programming, by W. Richard Stevens, Bill Fenner, Andrew M. Rudoff, Pearson Education.
ork Programming, 1st Edition, - W. Richard Stevens. PHI.

CS623PE: SCRIPTING LANGUAGES LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P C
0 0 2 1
Any High-level programming language (C, C++)
ves:
and the concepts of scripting languages for developing web based projects
and the applications the of Ruby, TCL, Perl scripting languages

mes:
nderstand the differences between Scripting languages and programming languages
n some fluency programming in Ruby, Perl, TCL

ents
by script to create a new string which is n copies of a given string where n is a non- negative

by script which accept the radius of a circle from the user and compute the parameter and

by script which accept the user's first and last name and print them in reverse order with a
n them
by script to accept a filename from the user print the extension of that
by script to find the greatest of three numbers
by script to print odd numbers from 10 to 1
by scirpt to check two integers and return true if one of them is 20 otherwise return their sum
by script to check two temperatures and return true if one is less than 0 and the other is
00
by script to print the elements of a given array
by program to retrieve the total marks where subject name and marks of a student stored in a

L script to find the factorial of a number

L script that multiplies the numbers from 1 to 10
L script for Sorting a list using a comparison function
CL script to (i)create a list (ii )append elements to the list (iii)Traverse the list
e the list
L script to comparing the file modified times.
L script to Copy a file and translate to native format.
a Perl script to find the largest number among three numbers.
script to print the multiplication tables from 1-10 using subroutines.
rl program to implement the following list of manipulating functions
ift c)Push
Perl script to substitute a word, with another word in a string.
script to validate IP address and email address.
rl script to print the file in reverse order using command line arguments
 CS624PE: MOBILE APPLICATION DEVELOPMENT LAB (Professional Elective - III)
III Year B.Tech. CSE II-Sem L
0
Prerequisites: --- NIL---
Course Objectives:
 To learn how to develop Applications in android environment.
 To learn how to develop user interface applications.
 To learn how to develop URL related applications.

Course Outcomes:
 Student understands the working of Android OS Practically.
 Student will be able to develop user interfaces.
 Student will be able to develop, deploy and maintain the Android Applications.

List of Experiments
1. Create an Android application that shows Hello + name of the user and run it on an emulator.
(b) Create an application that takes the name from a text box and shows hello message along with the na
entered in text box, when the user clicks the OK button.
2. Create a screen that has input boxes for User Name, Password, Address, Gender (radio button
for male and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit button. On
clicking the submit button, print all the data below the Submit Button. Use
(a) Linear Layout (b) Relative Layout and (c) Grid Layout or Table Layout.
3. Develop an application that shows names as a list and on selecting a name it should show the details
the candidate on the next screen with a “Back” button. If the screen is rotated to landscape mode (width
greater than height), then the screen should show list on left fragment and details on right fragment
instead of second screen with back button. Use Fragment transactions and Rotation event listener.
4. Develop an application that uses a menu with 3 options for dialing a number, opening a website and to
send an SMS. On selecting an option, the appropriate action should be invoked using intents.
5. Develop an application that inserts some notifications into Notification area and whenever a notificatio
inserted, it should show a toast with details of the notification.
6. Create an application that uses a text file to store user names and passwords (tab separated fields and
one record per line). When the user submits a login name and password through a screen, the details sho
be verified with the text file data and if they match, show a dialog saying that login is successful. Otherwis
show the dialog with Login Failed message.
7. Create a user registration application that stores the user details in a database table.
8. Create a database and a user table where the details of login names and passwords are stored. Insert
some names and passwords initially. Now the login details entered by the user should be verified with the
database and an appropriate dialog should be shown to the user.
9. Create an admin application for the user table, which shows all records as a list and the admin can sel
any record for edit or modify. The results should be reflected in the table.
10. Develop an application that shows all contacts of the phone along with details like name, phone numb
mobile number etc.
11. Create an application that saves user information like name, age, gender etc. in shared
preference and retrieves them when the program restarts.
12. Create an alarm that rings every Sunday at 8:00 AM. Modify it to use a time picker to set alarm time.
13. Create an application that shows the given URL (from a text field) in a browser.
12. Create an alarm that rings every Sunday at 8:00 AM. Modify it to use a time picker to set alarm time.
13. Create an application that shows the given URL (from a text field) in a browser.

CS625PE: SOFTWARE TESTING METHODOLOGIES LAB (Professional Elective - III)

III Year B.Tech. CSE II-Sem L T P
0 0 2
Prerequisites: A basic knowledge of programming.
Course Objectives
 To provide knowledge of Software Testing Methods.
 To develop skills in software test automation and management using latest tools.

Course Outcome
 Design and develop the best test strategies in accordance to the development model.
List of Experiments:
1. Recording in context sensitive mode and analog mode
2. GUI checkpoint for single property
3. GUI checkpoint for single object/window
4. GUI checkpoint for multiple objects
5. a) Bitmap checkpoint for object/window
a) Bitmap checkpoint for screen area
6. Database checkpoint for Default check
7. Database checkpoint for custom check
8. Database checkpoint for runtime record check
9. a) Data driven test for dynamic test data submission
b) Data driven test through flat files
c) Data driven test through front grids
d) Data driven test through excel test
10. a) Batch testing without parameter passing
b) Batch testing with parameter passing
11. Data driven batch
12. Silent mode test execution without any interruption
13. Test case for calculator in windows application

*MC609: ENVIRONMENTAL SCIENCE

III Year B.Tech. CSE II-Sem L T P
3 0 0
Course Objectives:
 Understanding the importance of ecological balance for sustainable development.
 Understanding the impacts of developmental activities and mitigation measures
 Understanding the environmental policies and regulations

Course Outcomes: Based on this course, the Engineering graduate will understand /evaluate / develop
technologies on the basis of ecological principles and environmental regulations which in turn helps in
sustainable development
UNIT - I
Ecosystems: Definition, Scope and Importance of ecosystem. Classification, structure, and function of an
ecosystem, Food chains, food webs, and ecological pyramids. Flow of energy, Biogeochemical cycles
Bioaccumulation, Biomagnification, ecosystem value, services and carrying capacity, Field visits.

UNIT - II
Natural Resources: Classification of Resources: Living and Non-Living resources, water resources:
and over utilization of surface and ground water, floods and droughts, Dams: benefits and problems. Miner
resources: use and exploitation, environmental effects of extracting and using mineral resources, Land
resources: Forest resources, Energy resources: growing energy needs,
renewable and non renewable energy sources, use of alternate energy source, case studies.

UNIT - III
Biodiversity And Biotic Resources: Introduction, Definition, genetic, species and ecosystem diversity.
Value of biodiversity; consumptive use, productive use, social, ethical, aesthetic and optional values. India
a mega diversity nation, Hot spots of biodiversity. Field visit. Threats to biodiversity: habitat loss, poaching
wildlife, man-wildlife conflicts; conservation of biodiversity: In-Situ and Ex-situ
conservation. National Biodiversity act.

UNIT - IV
Environmental Pollution and Control Technologies: Environmental Pollution: Classification of pollution, Ai
Pollution: Primary and secondary pollutants, Automobile and Industrial pollution, Ambient air quality
standards. Water pollution: Sources and types of pollution, drinking water quality standards. Soil Pollution:
Sources and types, Impacts of modern agriculture, degradation of soil. Noise Pollution: Sources and Hea
hazards, standards, Solid waste: Municipal Solid Waste management, composition and
characteristics of e-Waste and its management. Pollution control technologies: Wastewater Treatment
methods: Primary, secondary and Tertiary.
Overview of air pollution control technologies, Concepts of bioremediation. Global Environmental
Problems and Global Efforts: Climate change and impacts on human environment. Ozone depletion and Oz
depleting substances (ODS). Deforestation and desertification. International conventions /
Protocols: Earth summit, Kyoto protocol, and Montréal Protocol.

UNIT - V
Environmental Policy, Legislation & EIA: Environmental Protection act, Legal aspects Air Act- 1981, Water A
Forest Act, Wild life Act, Municipal solid waste management and handling rules, biomedical waste
management and handling rules, hazardous waste management and handling rules. EIA: EIA structure,
methods of baseline data acquisition. Overview on Impacts of air, water, biological and Socio- economical
aspects. Strategies for risk assessment, Concepts of Environmental Management Plan

(EMP). Towards Sustainable Future: Concept of Sustainable Development, Population and its explosio
Crazy Consumerism, Environmental Education, Urban Sprawl, Human health, Environmental
Ethics, Concept of Green Building, Ecological Foot Print, Life Cycle assessment (LCA), Low carbon life style

TEXT BOOKS:
1. Textbook of Environmental Studies for Undergraduate Courses by Erach Bharucha for University
Grants Commission.
2. Environmental Studies by R. Rajagopalan, Oxford University Press.
REFERENCE BOOKS:
1. Environmental Science: towards a sustainable future by Richard T. Wright. 2008 PHL Learning Private
New Delhi.
2. Environmental Engineering and science by Gilbert M. Masters and Wendell P. Ela. 2008 PHI Learning P
Ltd.
3. Environmental Science by Daniel B. Botkin & Edward A. Keller, Wiley INDIA edition.
4. Environmental Studies by Anubha Kaushik, 4th Edition, New age international publishers.
5. Text book of Environmental Science and Technology - Dr. M. Anji Reddy 2007, BS Publications.

CS701PC: CRYPTOGRAPHY AND NETWORK SECURITY (PC)

IV Year B.Tech. CSE I -Sem L T P
3 0
Course Objectives:
 Explain the objectives of information security
 Explain the importance and application of each of confidentiality, integrity, authentication and availabi
 Understand various cryptographic algorithms.
 Understand the basic categories of threats to computers and networks
 Describe public-key cryptosystem.
 Describe the enhancements made to IPv4 by IPSec
 Understand Intrusions and intrusion detection
 Discuss the fundamental ideas of public-key cryptography.
 Generate and distribute a PGP key pair and use the PGP package to send an encrypted e- mail messag
 Discuss Web security and Firewalls

Course Outcomes:
 Student will be able to understand basic cryptographic algorithms, message and web
authentication and security issues.
 Ability to identify information system requirements for both of them such as client and server.
 Ability to understand the current legal issues towards information security.

UNIT - I
Security Concepts: Introduction, The need for security, Security approaches, Principles of security, Types o
Security attacks, Security services, Security Mechanisms, A model for Network Security Cryptography
Concepts and Techniques: Introduction, plain text and cipher text, substitution techniques, transposi
techniques, encryption and decryption, symmetric and asymmetric key cryptography, steganography
key range and key size, possible types of attacks.

UNIT - II
Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block cipher operati
Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal
Cryptography, Diffie-Hellman Key Exchange, Knapsack Algorithm.

UNIT - III
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA-512), Message
authentication codes: Authentication requirements, HMAC, CMAC, Digital signatures, Elgamal Digital
Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric & Asymmetric
Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication Service, Public – Key
Infrastructure
UNIT - IV
Transport-level Security: Web security considerations, Secure Socket Layer and Transport Layer Securi
HTTPS, Secure Shell (SSH)
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11 Wireless LAN,
IEEE 802.11i Wireless LAN Security

UNIT - V
E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview, IP Security architectu
Authentication Header, Encapsulating security payload, Combining security associations, Internet Key
Exchange
Case Studies on Cryptography and security: Secure Multiparty Calculation, Virtual Elections, Single
sign On, Secure Inter-branch Payment Transactions, Cross site Scripting Vulnerability.

TEXT BOOKS:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson Educatio
6th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3rd Edition

REFERENCE BOOKS:
1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley India, 1 st
Edition.
2. Cryptography and Network Security: Forouzan Mukhopadhyay, Mc Graw Hill, 3rd Edition
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
6. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning

CS702PC: DATA MINING

IV Year B.Tech. CSE I - Sem L T P
2 0

Pre-Requisites:
 A course on “Database Management Systems”
 Knowledge of probability and statistics
Course Objectives:
 It presents methods for mining frequent patterns, associations, and correlations.
 It then describes methods for data classification and prediction, and data–clustering
approaches.
 It covers mining various types of data stores such as spatial, textual, multimedia, streams.

Course Outcomes:
 Ability to understand the types of the data to be mined and present a general classification of tasks an
primitives to integrate a data mining system.
 Apply preprocessing methods for any given raw data.
 Extract interesting patterns from large amounts of data.
 Discover the role played by data mining in various fields.
 Choose and employ suitable data mining algorithms to build analytical applications
 Evaluate the accuracy of supervised and unsupervised models and algorithms.

UNIT - I
Data Mining: Data–Types of Data–, Data Mining Functionalities– Interestingness Patterns–
Classification of Data Mining systems– Data mining Task primitives –Integration of Data mining system wit
Data warehouse–Major issues in Data Mining–Data Preprocessing.
UNIT - II
Association Rule Mining: Mining Frequent Patterns–Associations and correlations – Mining Methods–
Mining Various kinds of Association Rules– Correlation Analysis– Constraint based Association mining
Graph Pattern Mining, SPM.

UNIT - III
Classification: Classification and Prediction – Basic concepts–Decision tree induction–Bayesian
classification, Rule–based classification, Lazy learner.
UNIT - IV
Clustering and Applications: Cluster analysis–Types of Data in Cluster Analysis–Categorization of
Major Clustering Methods– Partitioning Methods, Hierarchical Methods– Density–Based Methods, Grid
Based Methods, Outlier Analysis.

UNIT - V
Advanced Concepts: Basic concepts in Mining data streams–Mining Time–series data––Mining sequen
patterns in Transactional databases– Mining Object– Spatial– Multimedia–Text and Web data – Spatial Da
mining– Multimedia Data mining–Text Mining– Mining the World Wide Web.

TEXT BOOKS:
1. Data Mining – Concepts and Techniques – Jiawei Han & Micheline Kamber, 3 rd Edition Elsevier.
2. Data Mining Introductory and Advanced topics – Margaret H Dunham, PEA.
REFERENCE BOOK:
1. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques (Second
Edition), Morgan Kaufmann, 2005.
CS711PE: GRAPH THEORY (Professional Elective - IV)
IV Year B.Tech. CSE I -Sem L T P
3 0
Pre-requisites:
1. An understanding of Mathematics in general is sufficient.
Course Outcomes:
 Know some important classes of graph theoretic problems;
 Be able to formulate and prove central theorems about trees, matching, connectivity, colouring and
planar graphs;
 Be able to describe and apply some basic algorithms for graphs;
 Be able to use graph theory as a modelling tool.

UNIT - I
Introduction-Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs, Matrix representations of
graphs, Degree of a vertex, Directed walks, paths and cycles, Connectivity in digraphs, Eulerian and Hami
digraphs, Eulerian digraphs, Hamilton digraphs, Special graphs, Complements, Larger graphs from smalle
graphs, Union, Sum, Cartesian Product, Composition, Graphic sequences, Graph
theoretic model of the LAN problem, Havel-Hakimi criterion, Realization of a graphic sequence.

UNIT - II
Connected graphs and shortest paths - Walks, trails, paths, cycles, Connected graphs, Distance, Cut-vertice
and cut-edges, Blocks, Connectivity, Weighted graphs and shortest paths, Weighted graphs, Dijkstra
shortest path algorithm, Floyd-Warshall shortest path algorithm.

UNIT - III
Trees- Definitions and characterizations, Number of trees, Cayley‟s formula, Kircho↵-matrix-tree
theorem, Minimum spanning trees, Kruskal‟s algorithm, Prim‟s algorithm, Special classes of graphs, Bipar
Graphs, Line Graphs, Chordal Graphs, Eulerian Graphs, Fleury‟s algorithm, Chinese Postman
problem, Hamilton Graphs, Introduction, Necessary conditions and sufficient conditions.
UNIT - IV
Independent sets coverings and matchings– Introduction, Independent sets and coverings: basic equations,
Matchings in bipartite graphs, Hall‟s Theorem, K¨onig‟s Theorem, Perfect matchings in graphs, Gre
and approximation algorithms.

UNIT - V
Vertex Colorings- Basic definitions, Cliques and chromatic number, Mycielski‟s theorem, Greedy
coloring algorithm, Coloring of chordal graphs, Brooks theorem, Edge Colorings, Introduction and
Basics, Gupta-Vizing theorem, Class-1 and Class-2 graphs, Edge-coloring of bipartite graphs, Class-2 graph
Hajos union and Class-2 graphs, A scheduling problem and equitable edge-coloring.

TEXT BOOKS:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate Texts in Mathematics. Springer,
edition, 2008.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.

REFERENCE BOOKS:1. Lecture Videos: http://nptel.ac.in/courses/111106050/132. Introduction to Graph Theory, Douglas B. W

3. Schaum's Outlines Graph Theory, Balakrishnan, TMH

4. Introduction to Graph Theory, Wilson Robin j, PHI
5. Graph Theory with Applications to Engineering And Computer Science, Narsing Deo, PHI
6. Graphs - An Introductory Approach, Wilson and Watkins

CS712PE: INTRODUCTION TO EMBEDDED SYSTEMS (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P
3 0
Pre-requisites:
1. A course on “Digital Logic Design and Microprocessors”
2. A course on “Computer Organization and Architecture”
Course Objectives:
 To provide an overview of principles of Embedded System
 To provide a clear understanding of role of firmware, operating systems in correlation with
hardware systems.

Course Outcomes:
 Expected to understand the selection procedure of processors in the embedded domain.
 Design procedure of embedded firm ware.
 Expected to visualize the role of realtime operating systems in embedded systems.
 Expected to evaluate the correlation between task synchronization and latency issues

UNIT - I
Introduction to Embedded Systems: Definition of Embedded System, Embedded Systems Vs General
Computing Systems, History of Embedded Systems, Classification of Embedded Systems, Major applicat
areas, Purpose of E bedded Systems, Characteristics and Quality attributes of Embedded Systems.

UNIT - II
The Typical Embedded System: Core of the Embedded System, Memory, Sensors and Actuators,
Communication Interface, Embedded Firmware, Other System components.
UNIT - III
Embedded Firmware Design and Development: Embedded Firmware Design, Embedded Firmware Developm
Languages, Programming in Embedded C.
UNIT - IV
RTOS Based Embedded System Design: Operating System basics, Types of Operating Systems, Tasks,
Process, Threads, Multiprocessing and Multi-tasking, Task Scheduling, Threads-Processes- Scheduling
putting them together, Task Communication, Task Synchronization, Device Drivers, How to
choose an RTOS

UNIT - V
Integration and Testing of Embedded Hardware and Firmware: Integration of Hardware and Firmware,
Boards Bring up
The Embedded System Development Environment: The Integrated Development Environment
(IDE), Types of files generated on Cross-Compilation, Disassembler/Decompiler, Simulators, Emulators and
Debugging, Target Hardware Debugging, Boundary Scan.

TEXT BOOK:
1. Shibu K V, “Introduction to Embedded Systems”, Second Edition, Mc Graw Hill
REFERENCE BOOKS:
1. Rajkamal, Embedded Systems Architecture, Programming and Design, Tata McGraw-Hill
2. Frank Vahid and Tony Givargis, “Embedded Systems Design” - A Unified Hardware/Software
Introduction, John Wiley
3. Lyla, “Embedded Systems” –Pearson
4. David E. Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint 2000.

CS713PE: ARTIFICIAL INTELLIGENCE (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P
3 0
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Advanced Data Structures”
3. A course on “Design and Analysis of Algorithms”
4. A course on “Mathematical Foundations of Computer Science”
5. Some background in linear algebra, data structures and algorithms, and probability will all be helpful

Course Objectives:
 To learn the distinction between optimal reasoning Vs. human like reasoning
 To understand the concepts of state space representation, exhaustive search, heuristic search togethe
with the time and space complexities.
 To learn different knowledge representation techniques.
 To understand the applications of AI, namely game playing, theorem proving, and machine learning.

Course Outcomes:
 Ability to formulate an efficient problem space for a problem expressed in natural language.
 Select a search algorithm for a problem and estimate its time and space complexities.
 Possess the skill for representing knowledge using the appropriate technique for a given proble
 Possess the ability to apply AI techniques to solve problems of game playing, and machine learning.
UNIT - I
Problem Solving by Search-I: Introduction to AI, Intelligent Agents
Problem Solving by Search –II: Problem-Solving Agents, Searching for Solutions, Uninformed Search Strateg
Breadth-first search, Uniform cost search, Depth-first search, Iterative deepening Depth-first search,
Bidirectional search, Informed (Heuristic) Search Strategies: Greedy best-first search, A* search,
Heuristic Functions, Beyond Classical Search: Hill-climbing search, Simulated annealing search, Loca
Search in Continuous Spaces, Searching with Non-Deterministic Actions, Searching wih
Partial Observations, Online Search Agents and Unknown Environment .

UNIT - II
Problem Solving by Search-II and Propositional Logic
Adversarial Search: Games, Optimal Decisions in Games, Alpha–Beta Pruning, Imperfect Real-Time Decisio
Constraint Satisfaction Problems: Defining Constraint Satisfaction Problems, Constraint
Propagation, Backtracking Search for CSPs, Local Search for CSPs, The Structure of Problems.
Propositional Logic: Knowledge-Based Agents, The Wumpus World, Logic, Propositional Logic,
Propositional Theorem Proving: Inference and proofs, Proof by resolution, Horn clauses and definite clause
Forward and backward chaining, Effective Propositional Model Checking, Agents Based on
Propositional Logic.

UNIT - III
Logic and Knowledge Representation
First-Order Logic: Representation, Syntax and Semantics of First-Order Logic, Using First-Order Logic
Knowledge Engineering in First-Order Logic.

Inference in First-Order Logic: Propositional vs. First-Order Inference, Unification and Lifting, Forward
Chaining, Backward Chaining, Resolution.
Knowledge Representation: Ontological Engineering, Categories and Objects, Events. Mental Events
and Mental Objects, Reasoning Systems for Categories, Reasoning with Default Information.

UNIT - IV
Planning
Classical Planning: Definition of Classical Planning, Algorithms for Planning with State-Space Search, Plann
Graphs, other Classical Planning Approaches, Analysis of Planning approaches.
Planning and Acting in the Real World: Time, Schedules, and Resources, Hierarchical Planning,
Planning and Acting in Nondeterministic Domains, Multi agent Planning.

UNIT - V
Uncertain knowledge and Learning
Uncertainty: Acting under Uncertainty, Basic Probability Notation, Inference Using Full Joint
Distributions, Independence, Bayes’ Rule and Its Use,
Probabilistic Reasoning: Representing Knowledge in an Uncertain Domain, The Semantics of Bayesia
Networks, Efficient Representation of Conditional Distributions, Approximate Inference in Bayesian
Networks, Relational and First-Order Probability, Other Approaches to Uncertain Reasoning; Dempster-Sha
theory.
Learning: Forms of Learning, Supervised Learning, Learning Decision Trees. Knowledge in Learning: Logica
Formulation of Learning, Knowledge in Learning, Explanation-Based Learning, Learning Using
Relevance Information, Inductive Logic Programming.

TEXT BOOK:
1. Artificial Intelligence A Modern Approach, Third Edition, Stuart Russell and Peter Norvig, Pearso
Education.
REFERENCE BOOKS:
1. Artificial Intelligence, 3rd Edn, E. Rich and K.Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Education.
4. Artificial Intelligence and Expert systems – Patterson, Pearson Education.

CS714PE: CLOUD COMPUTING (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P
3 0
Pre-requisites:
1. A course on “Computer Networks”
2. A course on “Operating Systems”
3. A course on “Distributed Systems”

Course Objectives:
 This course provides an insight into cloud computing
 Topics covered include- distributed system models, different cloud service models, service- oriented
architectures, cloud programming and software environments, resource management.

Course Outcomes:
 Ability to understand various service delivery models of a cloud computing architecture.
 Ability to understand the ways in which the cloud can be programmed and deployed.
 Understanding cloud service providers.

UNIT - I
Computing Paradigms: High-Performance Computing, Parallel Computing, Distributed Computing, Cluster
Computing, Grid Computing, Cloud Computing, Bio computing, Mobile Computing, Quantum Computing,
Optical Computing, Nano computing.

UNIT - II
Cloud Computing Fundamentals: Motivation for Cloud Computing, The Need for Cloud Computing, Definin
Cloud Computing, Definition of Cloud computing, Cloud Computing Is a Service, Cloud Computing Is
Platform, Principles of Cloud computing, Five Essential Characteristics, Four Cloud Deployment Models

UNIT - III
Cloud Computing Architecture and Management: Cloud architecture, Layer, Anatomy of the Cloud, Network
Connectivity in Cloud Computing, Applications, on the Cloud, Managing the Cloud, Managing the Cloud
Infrastructure Managing the Cloud application, Migrating Application to Cloud, Phases of Cloud Migration
Approaches for Cloud Migration.

UNIT - IV
Cloud Service Models: Infrastructure as a Service, Characteristics of IaaS. Suitability of IaaS, Pros and Cons
IaaS, Summary of IaaS Providers, Platform as a Service, Characteristics of PaaS, Suitability of Paa
Pros and Cons of PaaS, Summary of PaaS Providers, Software as a Service, Characteristics of SaaS,
Suitability of SaaS, Pros and Cons of SaaS, Summary of SaaS Providers, Other Cloud Service Models.

UNIT V
Cloud Service Providers: EMC, EMC IT, Captiva Cloud Toolkit, Google, Cloud Platform, Cloud Storage
Google Cloud Connect, Google Cloud Print, Google App Engine, Amazon Web Services, Amazon Elastic
Compute Cloud, Amazon Simple Storage Service, Amazon Simple Queue ,service, Microsoft, Windows Azu
Microsoft Assessment and Planning Toolkit, SharePoint, IBM, Cloud Models, IBM Smart Cloud, SAP Lab
SAP HANA Cloud Platform, Virtualization Services Provided by SAP, Sales force, Sales Cloud, Service Cloud
Knowledge as a Service, Rack space, VMware, Manjra
soft, Aneka Platform
TEXT BOOK:
1. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2014
REFERENCE BOOKS:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and Andrzej
M. Goscinski, Wiley, 2011.
2. Distributed and Cloud Computing, Kai Hwang, Geoffery C. Fox, Jack J. Dongarra, Elsevier, 2012.
3. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim Mather,
Subra Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp 2011.

CS715PE: AD-HOC & SENSOR NETWORKS (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P
3 0
Prerequisites
1. A course on “Computer Networks”
2. A course on “Mobile Computing”
Course Objectives:
 To understand the concepts of sensor networks
 To understand the MAC and transport protocols for ad hoc networks
 To understand the security of sensor networks
 To understand the applications of adhoc and sensor networks

Course Outcomes:
 Ability to understand the state-of-the-art research in the emerging subject of Ad Hoc and Wireless Sens
Networks
 Ability to solve the issues in real-time application development based on ASN.
 Ability to conduct further research in the domain of ASN

UNIT - I
Introduction to Ad Hoc Networks - Characteristics of MANETs, Applications of MANETs and Challenge
MANETs.
Routing in MANETs - Criteria for classification, Taxonomy of MANET routing algorithms, Topology- based
routing algorithms-Proactive: DSDV; Reactive: DSR, AODV; Hybrid: ZRP; Position-based routing
algorithms-Location Services-DREAM, Quorum-based; Forwarding Strategies: Greedy
Packet, Restricted Directional Flooding-DREAM, LAR.

UNIT - II
Data Transmission - Broadcast Storm Problem, Rebroadcasting Schemes-Simple-flooding, Probabilit
based Methods, Area-based Methods, Neighbor Knowledge-based: SBA, Multipoint Relaying, AHB
Multicasting: Tree-based: AMRIS, MAODV; Mesh-based: ODMRP, CAMP;
Hybrid: AMRoute, MCEDAR.

UNIT - III
Geocasting: Data-transmission Oriented-LBM; Route Creation Oriented-GeoTORA, MGR. TCP over Ad Hoc T
protocol overview, TCP and MANETs, Solutions for TCP over Ad hoc
UNIT - IV
Basics of Wireless, Sensors and Lower Layer Issues: Applications, Classification of sensor networks,
Architecture of sensor network, Physical layer, MAC layer, Link layer, Routing Layer.
UNIT - V
Upper Layer Issues of WSN: Transport layer, High-level application layer support, Adapting to the inherent
dynamic nature of WSNs, Sensor Networks and mobile robots.
TEXT BOOKS:
1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio Dharma P. Aggarwal, World
Scientific Publications, March 2006, ISBN – 981–256–681–3.
2. Wireless Sensor Networks: An Information Processing Approach, Feng Zhao, Leonidas
Guibas, Elsevier Science, ISBN – 978-1-55860-914-3 (Morgan Kauffman).

CS721PE: ADVANCED ALGORITHMS (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P
3 0
Pre-requisites:
1. A course on “Computer Programming & Data Structures”
2. A course on “Advanced Data Structures & Algorithms”
Course Objectives:
 Introduces the recurrence relations for analyzing the algorithms
 Introduces the graphs and their traversals.
 Describes major algorithmic techniques (divide-and-conquer, greedy, dynamic programming, Brute Fo
Transform and Conquer approaches) and mention problems for which each technique is appropriate
 Describes how to evaluate and compare different algorithms using worst-case, average-case and best-
case analysis.
 Introduces string matching algorithms
 Introduces linear programming.

Course Outcomes:
 Ability to analyze the performance of algorithms
 Ability to choose appropriate data structures and algorithm design methods for a specified
application
 Ability to understand how the choice of data structures and the algorithm design methods imp
the performance of programs

UNIT - I
Introduction: Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis and
Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear Time.
Advanced Design and Analysis Techniques: Dynamic Programming- Matrix chain Multiplication,
Longest common Subsequence and optimal binary Search trees.

UNIT - II
Greedy Algorithms - Huffman Codes, Activity Selection Problem. Amortized Analysis.
Graph Algorithms: Topological Sorting, Minimum Spanning trees, Single Source Shortest Paths,
Maximum Flow algorithms.

UNIT - III
Sorting Networks: Comparison Networks, Zero-one principle, bitonic Sorting Networks, Merging Netwo
Sorting Network.
Matrix Operations- Strassen's Matrix Multiplication, Inverting matrices, Solving system of linear
Equations

UNIT - IV
String Matching: Naive String Matching, Rabin-Karp algorithm, matching with finite Automata, Knuth- Morri
Pratt algorithm.
UNIT- V
NP-Completeness and Approximation Algorithms: Polynomial time, polynomial time verification, NP-
Completeness and reducibility, NP-Complete problems. Approximation Algorithms- Vertex cover Problem,
Travelling Sales person problem

TEXT BOOK:
1. Introduction to Algorithms,'' T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Third Edition
PHI.
REFERENCE BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam, Galgotia
publications pvt. Ltd.
2. Design and Analysis Algorithms - Parag Himanshu Dave, Himanshu Bhalchandra Dave Publisher:
Pearson
3. Algorithm Design: Foundations, Analysis and Internet examples, M.T. Goodrich and R. Tomassia,
John Wiley and sons.
4. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson
education.

CS722PE: REAL TIME SYSTEMS (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P
3 0
Prerequisite: Computer Organization and Operating System
Course Objectives:
 To provide broad understanding of the requirements of Real Time Operating Systems.
 To make the student understand, applications of these Real Time features using case studies.

Course Outcomes:
 Be able to explain real-time concepts such as preemptive multitasking, task priorities, priority inversion
mutual exclusion, context switching, and synchronization, interrupt latency and response time, and
semaphores.
 Able describe how a real-time operating system kernel is implemented.
 Able explain how tasks are managed.
 Explain how the real-time operating system implements time management.
 Discuss how tasks can communicate using semaphores, mailboxes, and queues.
 Be able to implement a real-time system on an embedded processor.
 Be able to work with real time operating systems like RT Linux, Vx Works, MicroC /OSII, Tiny Os

UNIT – I
Introduction: Introduction to UNIX/LINUX, Overview of Commands, File I/O,( open, create, close, lsee
read, write), Process Control ( fork, vfork, exit, wait, waitpid, exec).
UNIT - II
Real Time Operating Systems: Brief History of OS, Defining RTOS, The Scheduler, Objects, Services,
Characteristics of RTOS, Defining a Task, asks States and Scheduling, Task Operations, Structure,
Synchronization, Communication and Concurrency. Defining Semaphores, Operations and Use, Defin
Message Queue, States, Content, Storage, Operations and Use

UNIT - III
Objects, Services and I/O: Pipes, Event Registers, Signals, Other Building Blocks, Component
Configuration, Basic I/O Concepts, I/O Subsystem
UNIT - IV
Exceptions, Interrupts and Timers: Exceptions, Interrupts, Applications, Processing of Exceptions and Spurio
Interrupts, Real Time Clocks, Programmable Timers, Timer Interrupt Service Routines (ISR), Soft Timers,
Operations.

UNIT - V
Case Studies of RTOS: RT Linux, MicroC/OS-II, Vx Works, Embedded Linux, and Tiny OS.
TEXT BOOK:
1. Real Time Concepts for Embedded Systems – Qing Li, Elsevier, 2011
REFERENCE BOOKS:
1. Embedded Systems- Architecture, Programming and Design by Rajkamal, 2007, TMH.
2. Advanced UNIX Programming, Richard Stevens
3. Embedded Linux: Hardware, Software and Interfacing – Dr. Craig Hollabaugh

CS723PE: SOFT COMPUTING (Professional Elective

IV Year B.Tech. CSE I -Sem L T P
3 0

Course Objectives:
 Familiarize with soft computing concepts
 Introduce and use the idea of fuzzy logic and use of heuristics based on human experience
 Familiarize the Neuro-Fuzzy modeling using Classification and Clustering techniques
 Learn the concepts of Genetic algorithm and its applications
 Acquire the knowledge of Rough Sets.

Course Outcomes: On completion of this course, the students will be able to:
 Identify the difference between Conventional Artificial Intelligence to Computational Intelligence.
 Understand fuzzy logic and reasoning to handle and solve engineering problems
 Apply the Classification and clustering techniques on various applications.
 Understand the advanced neural networks and its applications
 Perform various operations of genetic algorithms, Rough Sets.
 Comprehend various techniques to build model for various applications

UNIT - I
Introduction to Soft Computing: Evolutionary Computing, "Soft" computing versus "Hard" computing, Soft
Computing Methods, Recent Trends in Soft Computing, Characteristics of Soft computing, Applicatio
of Soft Computing Techniques.

UNIT-II
Fuzzy Systems: Fuzzy Sets, Fuzzy Relations, Fuzzy Logic, Fuzzy Rule-Based Systems
UNIT-III
Fuzzy Decision Making, Particle Swarm Optimization
UNIT-IV
Genetic Algorithms: Basic Concepts, Basic Operators for Genetic Algorithms, Crossover and Mutation
Properties, Genetic Algorithm Cycle, Fitness Function, Applications of Genetic Algorithm.
UNIT-V
Rough Sets, Rough Sets, Rule Induction, and Discernibility Matrix, Integration of Soft Computing
Techniques.
TEXT BOOK:
1. Soft Computing – Advances and Applications - Jan 2015 by B.K. Tripathy and J. Anuradha – Cengage
Learning
REFERENCE BOOKS:
1. S. N. Sivanandam & S. N. Deepa, “Principles of Soft Computing”, 2nd edition, Wiley India, 2008.
2. David E. Goldberg, “Genetic Algorithms-In Search, optimization and Machine learning”, Pearson
Education.
3. J. S. R. Jang, C.T. Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, Pearson Education,
2004.
4. G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI, 1995.
5. Melanie Mitchell, “An Introduction to Genetic Algorithm”, PHI, 1998.
6. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”, McGraw- Hill International editions
1995

CS724PE: INTERNET OF THINGS (Professional Elective

IV Year B.Tech. CSE I -Sem L T P
3 0

Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of web based services on IoT devices

Course Outcomes:
 Interpret the impact and challenges posed by IoT networks leading to new architectural models.
 Compare and contrast the deployment of smart objects and the technologies to connect them to netwo
 Appraise the role of IoT protocols for efficient network communication.
 Elaborate the need for Data Analytics and Security in IoT.
 Illustrate different sensor technologies for sensing real world entities and identify the applicati
of IoT in Industry.

UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of IoT – IoT Protoco
IoT communication models, Iot Communication APIs IoT enabaled Technologies – Wireless Sensor Networ
Cloud Computing, Big data analytics, Communication protocols, Embedded Systems, IoT Levels and
Templates Domain Specific IoTs – Home, City, Environment, Energy, Retail, Logistics, Agriculture, Industry
health and Lifestyle

UNIT - II
IoT and M2M – Software defined networks, network function virtualization, difference between SDN and NF
for IoT Basics of IoT System Management with NETCOZF, YANG- NETCONF, YANG, SNMP NETOPEER

UNIT - III
Introduction to Python - Language features of Python, Data types, data structures, Control of flow,
functions, modules, packaging, file handling, data/time operations, classes, Exception handling Python
packages - JSON, XML, HTTPLib, URLLib, SMTPLib

UNIT - IV
IoT Physical Devices and Endpoints - Introduction to Raspberry PI-Interfaces (serial, SPI, I2C)
Programming – Python program with Raspberry PI with focus of interfacing external gadgets, controlling
output, reading input from pins.

UNIT - V
IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage models and communication APIs
Webserver – Web server for IoT, Cloud for IoT, Python web application framework Designing a RESTful web
API
TEXT BOOKS:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities Press, 201
ISBN: 9788173719547
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014,
ISBN: 9789350239759

CS725PE: SOFTWARE PROCESS & PROJECT MANAGEMENT (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P
3 0
Course Objectives:
 To acquire knowledge on software process management
 To acquire managerial skills for software project development
 To understand software economics

Course Outcomes:
 Gain knowledge of software economics, phases in the life cycle of software development, proje
organization, project control and process instrumentation
 Analyze the major and minor milestones, artifacts and metrics from management and technical
perspective
 Design and develop software product using conventional and modern principles of software project
management

UNIT - I
Software Process Maturity
Software maturity Framework, Principles of Software Process Change, Software Process Assessment, The
Initial Process, The Repeatable Process, The Defined Process, The Managed Process, The Optimizin
Process.
Process Reference Models
Capability Maturity Model (CMM), CMMI, PCMM, PSP, TSP).

UNIT - II
Software Project Management Renaissance
Conventional Software Management, Evolution of Software Economics, Improving Software
Economics, The old way and the new way.
Life-Cycle Phases and Process artifacts
Engineering and Production stages, inception phase, elaboration phase, construction phase, transition pha
artifact sets, management artifacts, engineering artifacts and pragmatic artifacts, model-based software
architectures.

UNIT - III
Workflows and Checkpoints of process
Software process workflows, Iteration workflows, Major milestones, minor milestones, periodic status
assessments.
Process Planning
Work breakdown structures, Planning guidelines, cost and schedule estimating process, iteration
planning process, Pragmatic planning.

UNIT - IV
Project Organizations
Line-of- business organizations, project organizations, evolution of organizations, process automation. Pro
Control and process instrumentation
The seven-core metrics, management indicators, quality indicators, life-cycle expectations, Pragmatic
software metrics, metrics automation.
 UNIT - V
CCPDS-R Case Study and Future Software Project Management Practices
Modern Project Profiles, Next-Generation software Economics, Modern Process Transitions.
TEXT BOOKS:
1. Managing the Software Process, Watts S. Humphrey, Pearson Education
2. Software Project Management, Walker Royce, Pearson Education
REFERENCE BOOKS:
1. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education, 2000
2. Process Improvement essentials, James R. Persse, O’Reilly, 2006
3. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition, TMH, 2006
4. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O’Reilly, 2006.
5. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly, 2007
6. Software Engineering Project Management, Richard H. Thayer & Edward Yourdon, 2 nd editio
Wiley India, 2004.
7. Agile Project Management, Jim Highsmith, Pearson education, 2004.

CS703PC: CRYPTOGRAPHY AND NETWORK SECURITY LAB (PC)

IV Year B.Tech. CSE I -Sem L T P
0 0
List of Experiments:
1. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program should
XOR each character in this string with 0 and displays the result.
2. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program
should AND or and XOR each character in this string with 127 and display the result.
3. Write a Java program to perform encryption and decryption using the following algorithms
a. Ceaser cipher b. Substitution cipher c. Hill Cipher
4. Write a C/JAVA program to implement the DES algorithm logic.
5. Write a C/JAVA program to implement the Blowfish algorithm logic.
6. Write a C/JAVA program to implement the Rijndael algorithm logic.
7. Write the RC4 logic in Java Using Java cryptography; encrypt the text “Hello world” using
Blowfish. Create your own key using Java key tool.
8. Write a Java program to implement RSA algorithm.
9. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.
10. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.
11. Calculate the message digest of a text using the MD5 algorithm in JAVA.
SM801MS: ORGANIZATIONAL BEHAVIOUR (PC)
IV Year B.Tech. CSE II -Sem L T P C
3 0 0 3
Course Objectives: The objective of the course is to provide the students with the conceptual framework
and the theories underlying Organizational Behaviour.

UNIT- I:
Introduction to OB - Definition, Nature and Scope – Environmental and organizational context – Impact of
globalization, Diversity, Ethics, culture, reward systems and organizational design on
Organizational Behaviour. Cognitive Processes-I: Perception and Attribution: Nature and importance of
Perception – Perceptual selectivity and organization – Social perception – Attribution Theories – Locus of
control –Attribution Errors –Impression Management.
UNIT-II:
Cognitive Processes-II: Personality and Attitudes – Personality as a continuum – Meaning of personality
- Johari Window and Transactional Analysis - Nature and Dimension of Attitudes – Job satisfaction and
organizational commitment-Motivational needs and processes- Work-Motivation Approaches Theories of
Motivation- Motivation across cultures - Positive organizational behaviour: Optimism – Emotional intellige
– Self-Efficacy.

UNIT- III:
Dynamics of OB-I: Communication – types – interactive communication in organizations – barriers to
communication and strategies to improve the follow of communication - Decision Making: Participative
decision-making techniques – creativity and group decision making. Dynamics of OB –II Stress and Conflic
Meaning and types of stress –Meaning and types of conflict - Effect of stress and intra-
individual conflict - strategies to cope with stress and conflict.

UNIT- IV:
Dynamics of OB –III Power and Politics: Meaning and types of power – empowerment - Groups Vs. Teams –
Nature of groups – dynamics of informal groups – dysfunctions of groups and teams – teams in modern wo
place.

UNIT- V:
Leading High performance: Job design and Goal setting for High performance- Quality of Work Life- Socio
technical Design and High-performance work practices - Behavioural performance management:
reinforcement and punishment as principles of Learning –Process of Behavioural modification -
Leadership theories - Styles, Activities and skills of Great leaders.

REFERENCE BOOKS:
1. Luthans, Fred: Organizational Behaviour 10/e, McGraw-Hill, 2009
2. McShane: Organizational Behaviour, 3e, TMH, 2008
3. Nelson: Organizational Behaviour, 3/e, Thomson, 2008.
4. Newstrom W. John & Davis Keith, Organisational Behaviour-- Human Behaviour at Work, 12/e, TMH, Ne
Delhi, 2009.
5. Pierce and Gardner: Management and Organisational Behaviour: An Integrated perspective, Thomson,
2009.
6. Robbins, P. Stephen, Timothy A. Judge: Organisational Behaviour, 12/e, PHI/Pearson, New Delhi, 2009.
7. Pareek Udai: Behavioural Process at Work: Oxford & IBH, New Delhi, 2009.
8. Schermerhorn: Organizational Behaviour 9/e, Wiley, 2008.
9. Hitt: Organizational Behaviour, Wiley, 2008

10. Aswathappa: Organisational Behaviour, 7/e, Himalaya, 2009

11. Mullins: Management and Organisational Behaviour, Pearson, 2008.
12. McShane, Glinow: Organisational Behaviour--Essentials, TMH, 2009.
13. Ivancevich: Organisational Behaviour and Management, 7/e, TMH, 2008.

CS811PE: COMPUTATIONAL COMPLEXITY (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P
3 0
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Discrete Structures and Graph Theory”
Course Objectives:
 Introduces to theory of computational complexity classes
 Discuss about algorithmic techniques and application of these techniques to problems.
 Introduce to randomized algorithms and discuss how effective they are in reducing time and space
complexity.
 Discuss about Graph based algorithms and approximation algorithms
 Discuss about search trees

Course Outcomes:
 Ability to classify decision problems into appropriate complexity classes
 Ability to specify what it means to reduce one problem to another, and construct reductions for simple
examples.
 Ability to classify optimization problems into appropriate approximation complexity classes
 Ability to choose appropriate data structure for the given problem
 Ability to choose and apply appropriate design method for the given problem

UNIT - I
Computational Complexity: Polynomial time and its justification, Nontrivial examples of polynomial-time
algorithms, the concept of reduction (reducibility), Class P Class NP and NP- Completeness, The P versus N
problem and why it’s hard

UNIT - II
Algorithmic paradigms: Dynamic Programming – Longest common subsequence, matrix chain
multiplication, knapsack problem, Greedy – 0-1 knapsack, fractional knapsack, scheduling problem, Huffm
coding, MST, Branch-and-bound – travelling sales person problem, 0/1 knapsack problem, Divide and Conq
– Merge sort, binary search, quick sort.

UNIT - III
Randomized Algorithms: Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods,
Probabilistic Primality Testing, De-Randomization Advanced Algorithms.
UNIT - IV
Graph Algorithms: Shortest paths, Flow networks, Spanning Trees; Approximation algorithms,
Randomized algorithms. Approximation algorithms: Polynomial Time Approximation Schemes.
UNIT - V
Advanced Data Structures and applications: Decision Trees and Circuits, B-Trees, AVL Trees, Red and
Black trees, Dictionaries and tries, Maps, Binomial Heaps, Fibonacci Heaps, Disjoint sets, Union by Rank an
Path Compression

TEXT BOOKS:
1. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, Third Edition, McGraw
Hill, 2009.
2. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.
3. J. J. McConnell, Analysis of Algorithms: An Active Learning Approach, Jones & Bartlett
Publishers, 2001.
4. D. E. Knuth, Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition, Addis
Wesley Professional, 1998.
5. S. Dasgupta, C. H. Papadimitriou and U. V. Vazirani, Algorithms, McGraw-Hill, 2008.
CS812PE: DISTRIBUTED SYSTEMS (Professional Elective - VI)
IV Year B.Tech. CSE II -Sem L T P
3 0
Prerequisites
1. A course on “Operating Systems”
2. A course on “Computer Organization & Architecture”
Course Objectives
 This course provides an insight into Distributed systems.
 Topics include- Peer to Peer Systems, Transactions and Concurrency control, Security and Distributed
shared memory

Course Outcomes
 Ability to understand Transactions and Concurrency control.
 Ability to understand Security issues.
 Understanding Distributed shared memory.
 Ability to design distributed systems for basic level applications.

UNIT - I
Characterization of Distributed Systems-Introduction, Examples of Distributed systems, Resource
sharing and web, challenges, System models -Introduction, Architectural and Fundamental models,
Networking and Internetworking, Interprocess Communication, Distributed objects and Remote
Invocation-Introduction, Communication between distributed objects, RPC, Events and notifications, Case
study-Java RMI.

UNIT - II
Operating System Support- Introduction, OS layer, Protection, Processes and Threads, Communication and
Invocation, Operating system architecture, Distributed File Systems-Introduction, File Service
architecture.

UNIT - III
Peer to Peer Systems–Introduction, Napster and its legacy, Peer to Peer middleware, Routing overlays,
Overlay case studies-Pastry, Tapestry, Application case studies-Squirrel, OceanStore.
Time and Global States-Introduction, Clocks, events and Process states, Synchronizing physical cloc
logical time and logical clocks, global states, distributed debugging.
Coordination and Agreement-Introduction, Distributed mutual exclusion, Elections, Multicast
communication, consensus and related problems.

UNIT - IV
Transactions and Concurrency Control-Introduction, Transactions, Nested Transactions, Locks,
Optimistic concurrency control, Timestamp ordering. Distributed Transactions-Introduction, Flat and
Nested Distributed Transactions, Atomic commit protocols, Concurrency control in distributed
transactions, Distributed deadlocks, Transaction recovery.

UNIT - V
Replication-Introduction, System model and group communication, Fault tolerant services,
Transactions with replicated data.
Distributed shared memory, Design and Implementation issues, Consistency models.

TEXT BOOKS:
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth Edition,
Pearson Education.
2. Distributed Systems, S.Ghosh, Chapman & Hall/CRC, Taylor & Francis Group, 2010.

REFERENCE BOOKS:
1. Distributed Systems – Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, Pearson Education.
2. Distributed Computing, Principles, Algorithms and Systems, Ajay D. Kshemakalyani and
Mukesh Singhal, Cambridge, rp 2010.

CS813PE: NEURAL NETWORKS & DEEP LEARNING (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P
3 0
Course Objectives:
 To introduce the foundations of Artificial Neural Networks
 To acquire the knowledge on Deep Learning Concepts
 To learn various types of Artificial Neural Networks
 To gain knowledge to apply optimization strategies

Course Outcomes:
 Ability to understand the concepts of Neural Networks
 Ability to select the Learning Networks in modeling real world systems
 Ability to use an efficient algorithm for Deep Models
 Ability to apply optimization strategies for large scale applications

UNIT-I
Artificial Neural Networks Introduction, Basic models of ANN, important terminologies, Supervised Learning
Networks, Perceptron Networks, Adaptive Linear Neuron, Back-propagation Network. Associative
Memory Networks. Training Algorithms for pattern association, BAM and Hopfield Networks.

UNIT-II
Unsupervised Learning Network- Introduction, Fixed Weight Competitive Nets, Maxnet, Hamming
Network, Kohonen Self-Organizing Feature Maps, Learning Vector Quantization, Counter Propagation
Networks, Adaptive Resonance Theory Networks. Special Networks-Introduction to various networks.

UNIT - III
Introduction to Deep Learning, Historical Trends in Deep learning, Deep Feed - forward networks,
Gradient-Based learning, Hidden Units, Architecture Design, Back-Propagation and Other
Differentiation Algorithms

UNIT - IV
Regularization for Deep Learning: Parameter norm Penalties, Norm Penalties as Constrained
Optimization, Regularization and Under-Constrained Problems, Dataset Augmentation, Noise
Robustness, Semi-Supervised learning, Multi-task learning, Early Stopping, Parameter Typing and
Parameter Sharing, Sparse Representations, Bagging and other Ensemble Methods, Dropout,
Adversarial Training, Tangent Distance, tangent Prop and Manifold, Tangent Classifier

UNIT - V
Optimization for Train Deep Models: Challenges in Neural Network Optimization, Basic Algorithms, Paramete
Initialization Strategies, Algorithms with Adaptive Learning Rates, Approximate Second- Order Metho
Optimization Strategies and Meta-Algorithms
Applications: Large-Scale Deep Learning, Computer Vision, Speech Recognition, Natural Language
Processing

TEXT BOOKS:
1. Deep Learning: An MIT Press Book By Ian Goodfellow and Yoshua Bengio and Aaron Courville
2. Neural Networks and Learning Machines, Simon Haykin, 3rd Edition, Pearson Prentice Hall.
CS814PE: HUMAN COMPUTER INTERACTION (Professional Elective - VI)
IV Year B.Tech. CSE II -Sem L T P
3 0
Course Objectives: To gain an overview of Human-Computer Interaction (HCI), with an understanding of us
interface design in general, and alternatives to traditional "keyboard and mouse" computing; become fam
with the vocabulary associated with sensory and cognitive systems as relevant to task performance by
humans; be able to apply models from cognitive psychology to predicting user performance in
various human-computer interaction tasks and recognize the limits of human performance as they
apply to computer operation; appreciate the importance of a design and evaluation methodology that beg
with and maintains a focus on the user; be familiar with a variety of both conventional and non-tradition
user interface paradigms, the latter including virtual and augmented reality, mobile and wearable
computing, and ubiquitous computing; and understand the social implications of technology and their
ethical responsibilities as engineers in the design of technological systems. Finally, working in small group
on a product design from start to finish will provide you with invaluable team-work experience.

Course Outcomes:
 Ability to apply HCI and principles to interaction design.
 Ability to design certain tools for blind or PH people.

UNIT - I
Introduction: Importance of user Interface – definition, importance of good design. Benefits of good desig
A brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct manipulation, graphical
system, Characteristics, Web user – Interface popularity, characteristics- Principles of user interface.

UNIT - II
Design process – Human interaction with computers, importance of human characteristics human
consideration, Human interaction speeds, understanding business junctions.
Screen Designing: Design goals – Screen planning and purpose, organizing screen elements, ordering of
screen data and content – screen navigation and flow – Visually pleasing composition – amount of informa
– focus and emphasis – presentation information simply and meaningfully – information
retrieval on web – statistical graphics – Technological consideration in interface design.

UNIT- III
Windows – New and Navigation schemes selection of window, selection of devices based and screen- base
controls. Components – text and messages, Icons and increases – Multimedia, colors, uses problems,
choosing colors.

UNIT- IV
HCI in the software process, The software life cycle Usability engineering Iterative design and
prototyping Design Focus: Prototyping in practice Design rationale Design rules Principles to support usab
Standards Golden rules and heuristics HCI patterns Evaluation techniques, Goals of evaluation,
Evaluation through expert analysis, Evaluation through user participation, Choosing an evaluation
method. Universal design, Universal design principles Multi-modal interaction

UNIT- V
Cognitive models Goal and task hierarchies Design Focus: GOMS saves money Linguistic models The
challenge of display-based systems Physical and device models Cognitive architectures Ubiquitous
computing and augmented realities Ubiquitous computing applications research Design Focus: Ambient

Wood – augmenting the physical Virtual and augmented reality Design Focus: Shared experience
Design Focus: Applications of augmented reality Information and data visualization Design Focus:
Getting the size right.
TEXT BOOKS:
1. The essential guide to user interface design, Wilbert O Galitz, Wiley Dream Tech. Units 1, 2, 3
2. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg, Pearson
Education Units 4,5
REFERENCE BOOKS:
1. Designing the user interface. 3rd Edition Ben Shneidermann, Pearson Education Asia.
2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
3. User Interface Design, Soren Lauesen , Pearson Education.
4. Human –Computer Interaction, D. R. Olsen, Cengage Learning.
5. Human –Computer Interaction, Smith - Atakan, Cengage Learning.

CS815PE: CYBER FORENSICS (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P
3 0
Prerequisites: Network Security
Course Objectives:
 A brief explanation of the objective is to provide digital evidences which are obtained from digital med
 In order to understand the objectives of computer forensics, first of all, people have to recognize the
different roles computer plays in a certain crime.
 According to a snippet from the United States Security Service, the functions computer has in different
kinds of crimes.

Course Outcomes:
 Students will understand the usage of computers in forensic, and how to use various forensic tools for
wide variety of investigations.
 It gives an opportunity to students to continue their zeal in research in computer forensics

UNIT- I
Introduction of Cybercrime: Types, The Internet spawns crime, Worms versus viruses, Computers' roles in
crimes, Introduction to digital forensics, Introduction to Incident - Incident Response Methodology – Steps
Activities in Initial Response, Phase after detection of an incident

UNIT-II
Initial Response and forensic duplication, Initial Response & Volatile Data Collection from Windows system
Initial Response & Volatile Data Collection from Unix system – Forensic Duplication: Forensic duplication:
Forensic Duplicates as Admissible Evidence, Forensic Duplication Tool Requirements,
Creating a Forensic. Duplicate/Qualified Forensic Duplicate of a Hard Drive

UNIT - III
Forensics analysis and validation: Determining what data to collect and analyze, validating forensic data,
addressing data-hiding techniques, performing remote acquisitions
Network Forensics: Network forensics overview, performing live acquisitions, developing standard
procedures for network forensics, using network tools, examining the honeynet project.

UNIT -IV
Current Forensic tools: evaluating computer forensic tool needs, computer forensics software tools, compu
forensics hardware tools, validating and testing forensics software E-Mail Investigations: Exploring t
role of e-mail in investigation, exploring the roles of the client and server in e-mail, investigating
mail crimes and violations, understanding e-mail servers, using specialized e-mail forensic tools.
Cell phone and mobile device forensics: Understanding mobile device forensics, understanding
acquisition procedures for cell phones and mobile devices.

UNIT- V
Working with Windows and DOS Systems: understanding file systems, exploring Microsoft File
Structures, Examining NTFS disks, Understanding whole disk encryption, windows registry, Microsoft startu
tasks, MS-DOS startup tasks, virtual machines.
TEXT BOOKS:
1. Kevin Mandia, Chris Prosise, “Incident Response and computer forensics”, Tata McGraw Hill, 2006.

2. Computer Forensics, Computer Crime Investigation by John R. Vacca, Firewall Media, New Delhi.
3. Computer Forensics and Investigations by Nelson, Phillips Enfinger, Steuart, CENGAGE
Learning

REFERENCE BOOKS:
1. Real Digital Forensics by Keith J. Jones, Richard Bejtiich, Curtis W. Rose, Addison- Wesley Pearson
Education
2. Forensic Compiling, A Tractitioneris Guide by Tony Sammes and Brian Jenkinson, Springer
International edition.
 Elective - III)
T P C
0 2 1

ns.

n it on an emulator.
message along with the name

ress, Gender (radio buttons

r) and a Submit button. On

e it should show the details of

to landscape mode (width
tails on right fragment
d Rotation event listener.
er, opening a website and to
using intents.
a and whenever a notification is

rds (tab separated fields and

gh a screen, the details should
ogin is successful. Otherwise,

base table.
asswords are stored. Insert
should be verified with the

a list and the admin can select

ails like name, phone number,

nder etc. in shared

e picker to set alarm time.

wser.
e picker to set alarm time.
wser.

ve - III)
L T P C
0 0 2 1

tools.

ent model.

L T P C
3 0 0 0

pment.
sures

and /evaluate / develop

ns which in turn helps in
ucture, and function of an
gy, Biogeochemical cycles,
g capacity, Field visits.

esources, water resources: use

enefits and problems. Mineral
mineral resources, Land

case studies.

and ecosystem diversity.

ic and optional values. India as
ersity: habitat loss, poaching of

assification of pollution, Air

n, Ambient air quality
ty standards. Soil Pollution:
ollution: Sources and Health
composition and
s: Wastewater Treatment

n. Global Environmental
nt. Ozone depletion and Ozone
onventions /

ects Air Act- 1981, Water Act,

, biomedical waste
rules. EIA: EIA structure,
gical and Socio- economical
ment Plan

Population and its explosion,

an health, Environmental
(LCA), Low carbon life style.

ch Bharucha for University

2008 PHL Learning Private Ltd.

P. Ela. 2008 PHI Learning Pvt.

edition.
al publishers.
07, BS Publications.

C)
L T P C
3 0 0 3

authentication and availability

n encrypted e- mail message.

essage and web

s client and server.

nciples of security, Types of

Security Cryptography
ution techniques, transposition
yptography, steganography,

IDEA, Block cipher operation,

algorithm, Elgamal

thm (SHA-512), Message

gnatures, Elgamal Digital

etric & Asymmetric

rvice, Public – Key
and Transport Layer Security,

11 Wireless LAN,

iew, IP Security architecture,

sociations, Internet Key

al Elections, Single
rability.

Stallings, Pearson Education,

nabhan, Wiley India, 1 st

l, 3rd Edition

CS702PC: DATA MINING (PC)

L T P C
2 0 0 2

tions.
and data–clustering

media, streams.

ral classification of tasks and

ications
ms.

stingness Patterns–
n of Data mining system with a
elations – Mining Methods–
t based Association mining.

induction–Bayesian

s–Categorization of
nsity–Based Methods, Grid–

eries data––Mining sequence

t and Web data – Spatial Data

3 rd Edition Elsevier.

s and Techniques (Second

L T P C
3 0 0 3

nnectivity, colouring and

atrix representations of
igraphs, Eulerian and Hamilton
Larger graphs from smaller
Graph
aphic sequence.

aphs, Distance, Cut-vertices

, Weighted graphs, Dijkstra‟s

la, Kircho↵-matrix-tree
cial classes of graphs, Bipartite
nese Postman
onditions.
coverings: basic equations,
matchings in graphs, Greedy

ski‟s theorem, Greedy

orings, Introduction and
artite graphs, Class-2 graphs,
oring.

s in Mathematics. Springer, 1st

n to Graph Theory, Douglas B. West, Pearson.

Narsing Deo, PHI

Elective - IV)
L T P C
3 0 0 3

ms in correlation with

dded domain.

ystems.
ency issues

dded Systems Vs General

ed Systems, Major application
es of Embedded Systems.

s and Actuators,

bedded Firmware Development

rating Systems, Tasks,
ads-Processes- Scheduling
vers, How to

Hardware and Firmware,

ent Environment
r, Simulators, Emulators and

Hill

ta McGraw-Hill
Hardware/Software

First Indian Reprint 2000.

- IV)
L T P C
3 0 0 3

obability will all be helpful

g
ch, heuristic search together

ng, and machine learning.

natural language.
mplexities.
chnique for a given problem.
g, and machine learning.
 Uninformed Search Strategies:
ng Depth-first search,
first search, A* search,
ted annealing search, Local
hing wih

mperfect Real-Time Decisions.

blems, Constraint
re of Problems.
Propositional Logic,
n clauses and definite clauses,
s Based on

gic, Using First-Order Logic,

ation and Lifting, Forward

vents. Mental Events

t Information.

h State-Space Search, Planning

hical Planning,

ence Using Full Joint

The Semantics of Bayesian

e Inference in Bayesian
n Reasoning; Dempster-Shafer

owledge in Learning: Logical

Learning Using

and Peter Norvig, Pearson

V)
L T P C
3 0 0 3

models, service- oriented

gement.

architecture.
deployed.

buted Computing, Cluster

ng, Quantum Computing,

or Cloud Computing, Defining

Service, Cloud Computing Is a
oud Deployment Models

omy of the Cloud, Network

ud, Managing the Cloud
Phases of Cloud Migration

bility of IaaS, Pros and Cons of

of PaaS, Suitability of PaaS,
ce, Characteristics of SaaS,
Cloud Service Models.

ud Platform, Cloud Storage,

b Services, Amazon Elastic
ce, Microsoft, Windows Azure,
s, IBM Smart Cloud, SAP Labs,
Sales Cloud, Service Cloud:
 berg and Andrzej

garra, Elsevier, 2012.

ance, Tim Mather,

ve - IV)
L T P C
3 0 0 3

of Ad Hoc and Wireless Sensor

SN.

of MANETs and Challenges of

orithms, Topology- based

osition-based routing
Greedy

s-Simple-flooding, Probability-
, Multipoint Relaying, AHBP.

RA, MGR. TCP over Ad Hoc TCP

ation of sensor networks,

ayer.

t, Adapting to the inherent

harma P. Aggarwal, World

Zhao, Leonidas

- V)
L T P C
3 0 0 3

mic programming, Brute Force,

ach technique is appropriate;
ase, average-case and best-

hods for a specified

rithm design methods impact

obabilistic Analysis and

d Sorting in Linear Time.
ain Multiplication,

lysis.
urce Shortest Paths,

g Networks, Merging Network,

ing system of linear

nite Automata, Knuth- Morris -

 time verification, NP-
ms- Vertex cover Problem,

and C. Stein, Third Edition,

d Rajasekharam, Galgotia

halchandra Dave Publisher:

Goodrich and R. Tomassia,

edition, Pearson

V)
L T P C
3 0 0 3

g Systems.
using case studies.

k priorities, priority inversions,

d response time, and

.
eues.

MicroC /OSII, Tiny Os

( open, create, close, lseek,

r, Objects, Services,
erations, Structure,
Operations and Use, Defining

Blocks, Component
ng of Exceptions and Spurious
outines (ISR), Soft Timers,

Tiny OS.

2007, TMH.

gh

UTING (Professional Elective - V)

L T P C
3 0 0 3

man experience
chniques

utational Intelligence.
lems

us "Hard" computing, Soft

Soft computing, Applications

tems

ossover and Mutation

Algorithm.

ation of Soft Computing

d J. Anuradha – Cengage
n, Wiley India, 2008.
achine learning”, Pearson

ting”, Pearson Education,

- Hill International editions,

HINGS (Professional Elective - V)

L T P C
3 0 0 3

tocols
ces
ns

architectural models.
es to connect them to network.

and identify the applications

al Design of IoT – IoT Protocols,

s – Wireless Sensor Networks,
ed Systems, IoT Levels and
gistics, Agriculture, Industry,

erence between SDN and NFV

NG, SNMP NETOPEER

uctures, Control of flow,

ception handling Python

ces (serial, SPI, I2C)

ernal gadgets, controlling

s and communication APIs

ork Designing a RESTful web
 etti, Universities Press, 2015,

illy (SPD), 2014,

ctive - V)
L T P C
3 0 0 3

ftware development, project

ement and technical

iples of software project

e Process Assessment, The

ed Process, The Optimizing

Improving Software

uction phase, transition phase,

cts, model-based software

stones, periodic status

ating process, iteration

ns, process automation. Project

xpectations, Pragmatic
 Transitions.

n Education, 2000

, TMH, 2006
, O’Reilly, 2006.

Edward Yourdon, 2 nd edition,

(PC)
L T P C
0 0 2 1

world’. The program should

lo world’. The program

he result.
llowing algorithms

text “Hello world” using

d JavaScript.
A.
.

P C

the conceptual framework

ational context – Impact of IT,

tional design on
ature and importance of
bution Theories – Locus of
– Meaning of personality
s – Job satisfaction and
n Approaches Theories of
imism – Emotional intelligence

nizations – barriers to
on Making: Participative
of OB –II Stress and Conflict:
stress and intra-

rment - Groups Vs. Teams –

eams – teams in modern work

Quality of Work Life- Socio

nce management:
avioural modification -

iour at Work, 12/e, TMH, New

ated perspective, Thomson,

/Pearson, New Delhi, 2009.

ve - VI)
L T P C
3 0 0 3
o problems.
educing time and space

struct reductions for simple

mplexity classes

mples of polynomial-time
mpleteness, The P versus NP

uence, matrix chain

scheduling problem, Huffman
k problem, Divide and Conquer

s, Algebraic Methods,

roximation algorithms,
ation Schemes.

es, AVL Trees, Red and

joint sets, Union by Rank and

hms, Third Edition, McGraw-

y Press, 1995.
h, Jones & Bartlett

ching, Second Edition, Addison-

w-Hill, 2008.
VI)
L T P C
3 0 0 3
 l, Security and Distributed

ted systems, Resource

Fundamental models,
objects and Remote
nts and notifications, Case

hreads, Communication and

uction, File Service

ware, Routing overlays,

nStore.
Synchronizing physical clocks,

Elections, Multicast

d Transactions, Locks,
ns-Introduction, Flat and
y control in distributed

t tolerant services,

models.

indberg, Fourth Edition,

p, 2010.

Steen, Pearson Education.

shemakalyani and

Elective - VI)
L T P C
3 0 0 3
ogies, Supervised Learning
on Network. Associative
Hopfield Networks.

ets, Maxnet, Hamming

, Counter Propagation
n to various networks.

Feed - forward networks,

ropagation and Other

s as Constrained
Augmentation, Noise
Parameter Typing and
Methods, Dropout,
assifier

Basic Algorithms, Parameter

mate Second- Order Methods,

, Natural Language

and Aaron Courville

on Prentice Hall.
tive - VI)
L T P C
3 0 0 3
with an understanding of user
se" computing; become familiar
t to task performance by
g user performance in
uman performance as they
ation methodology that begins
nventional and non-traditional
mobile and wearable
ons of technology and their
ally, working in small groups
work experience.

sign. Benefits of good design.

ct manipulation, graphical
ples of user interface.

an characteristics human

een elements, ordering of

osition – amount of information
formation
e design.

ces based and screen- based

colors, uses problems,

g Iterative design and

s Principles to support usability
s, Goals of evaluation,
Choosing an evaluation

Linguistic models The

chitectures Ubiquitous
h Design Focus: Ambient

ocus: Shared experience

ualization Design Focus:

Tech. Units 1, 2, 3
Russell Bealg, Pearson
ation Asia.

)
L T P C
3 0 0 3

e obtained from digital media.

ple have to recognize the

ns computer has in different

e various forensic tools for a

puter forensics

viruses, Computers' roles in

ponse Methodology – Steps -

ection from Windows system -

tion: Forensic duplication:
uirements,

, validating forensic data,

developing standard
t project.

nsics software tools, computer

Investigations: Exploring the
er in e-mail, investigating e-
d e-mail forensic tools.
nsics, understanding

oring Microsoft File

ows registry, Microsoft startup
Tata McGraw Hill, 2006.

rewall Media, New Delhi.

Steuart, CENGAGE

dison- Wesley Pearson

inson, Springer