Curiculum
Curiculum
Tech(CSE) R-15
ACADEMIC REGULATIONS R 15
FOR CBCS & OUTCOME BASED B.TECH. REGULAR
PROGRAMMES
(Effective for the students admitted into I year from the
Academic Year 2015-16 and onwards)
S.No. Branch
I. Civil Engineering
II. Electrical & Electronics Engineering
III. Mechanical Engineering
IV. Electronics & Communication Engineering
V. Computer Science & Engineering
2.4. Lateral Entry seats for 20% of the candidates from the approved
strength of the course shall be admitted into the II Year I
Semester (III Semester) directly based on the rank secured by
the candidate in Engineering Common Entrance Test (ECET) in
accordance with the instructions received from the Convener,
ECET / Competent Authority.
Discipline/ Department/
Branch of Engg.
Project Work B.Tech. Project or UG
Project or UG Major
Project
Project Industrial Training/ Industrial Training/
Work Mini- Project Internship/ UG Mini-
Project/ Mini-Project 10% to
Seminar Seminar/ Colloquium 15%
based on core contents
related to Parent
Discipline/ Department/
Branch of Engg.
Comprehensive Viva- Comprehensive Viva-
Voce Voce
Minor Courses 1 or 2 Credit Courses -
(subset of HS)
Mandatory Courses Mandatory Courses included
(MC) (non-credit)
Total Credits for B. 192
Tech. Programme (100%)
6.1.1 A typical Section (or Class) Strength for each Semester shall be 60.
6.2 An elective Course may be offered to the Students, ONLY IF a
Minimum of 20 Students (1/3 of the Section Strength) opt for
the same. The Maximum Strength of a Section is limited to 80
(60 + 1/3 of the Section Strength).
6.3 More than one teacher may offer the same Course (Lab./
Practicals may be included with the corresponding Theory Course
in the same Semester) in any Semester.
6.4 If more entries for Registration of a Course come into picture,
then the concerned Head of Department shall take necessary
Table-1
(d) The final marks (for total of 25) secured by the student in
‗Internal Examination and the Assignment‘ for the semester are
arrived at by giving a weightage of 70% to the best secured
‗internal examination and Assignment‘ and 30% weightage to
the least secured ‗internal examination and Assignment‘. A
student who is absent from any assignment/ internal
examination for any reason what so ever shall be deemed to
have secured ‗zero‘ marks in the test/ examination and no
makeup test/ examination shall be conducted.
(e) Five marks in each course are allocated for the attendance of
the student during the semester in that course. The allocation of
the marks for attendance is as follows.
9.5 Open Electives: Students are to choose One Open Elective (OE-I)
during VII Semester, one (OE-II) and one (OE-III) in VIII Semester
from the list of Courses offered under Open Electives.
Part-A: 20 Marks
Part-B: 50 Marks
10.4 For NCC/ NSS/ NSO types of Courses, and/or any other
Mandatory Non-Credit Course offered in a Semester, a
‗Satisfactory Participation Certificate‘ shall be issued to the
Student from the concerned authorities, only after securing
65% attendance in such a Course. No marks or Letter Grade
shall be allotted for these activities and it will not be part of
calculation of CGPA.
11.6. The Student passes the Course/ Course only when he gets GP
5 (P Grade or above).
𝐍 𝐍
SGPA = { 𝐢=𝟏 𝐂𝐢 𝐆𝐢 } / { 𝐢=𝟏 𝐂𝐢 } …. For each Semester,
where „i‟ is the Course indicator index (takes into account all
Courses in a Semester), ‗N‘ is the no. of Courses
‗REGISTERED‘ for the Semester (as specifically required
and listed under the Course Structure of the parent
Department), Ci is the no. of Credits allotted to the ith
Course, and Gi represents the Grade Points (GP)
corresponding to the Letter Grade awarded for that ith Course.
11.8. The Cumulative Grade Point Average (CGPA) is a measure of
the overall cumulative performance of a student over all
CMR College of Engineering & Technology Page 18
B.Tech(CSE) R-15
CGPA = { 𝐌 𝐌
𝐣=𝟏 𝐂𝐣 𝐆𝐣 } / { 𝐣=𝟏 𝐂𝐣 } … for all S Semesters
registered
(ie., upto and inclusive of S Semesters, S 2 ),
where ‗M‘ is the TOTAL no. of Courses (as specifically
required and listed under the Course Structure of the parent
Department) the Student has ‗REGISTERED‘ from the 1 st
Semester onwards up to and inclusive of the Semester S (
obviously M > N ), ‗j‘ is the Course indicator index (takes
into account all Courses from 1 to S Semesters), Cj is the no.
of Credits allotted to the jth Course, and Gj represents the
Grade Points (GP) corresponding to the Letter Grade awarded
for that jth Course. After registration and completion of I
Year I Semester however, the SGPA of that Semester itself
may be taken as the CGPA, as there are no cumulative
effects.
11.9. For Merit Ranking or Comparison Purposes or any other
listing, ONLY the ‗ROUNDED OFF‘ values of the CGPAs
will be used.
11.10. For Calculations listed in Item 11.5– 11.8, performance in failed
Courses (securing F Grade) will also be taken into account,
and the Credits of such Courses will also be included in the
multiplications and summations. However, Non-Credit Courses
will not be taken into consideration.
18.0 Scope
i) Where the words ―he‖, ―him‖, ―his‖, occur in the write-up of
regulations, they include ―she‖, ―her‖, ―hers‖.
ii) Where the words ―Course‖ or ―Courses‖, occur in these
regulations, they also imply ―Course‖ or ―Courses‖.
iii) The Academic Regulations should be read as a whole, for the
purpose of any interpretation.
iv) In case of any doubt or ambiguity in the interpretation of the
above rules, the decision of the Vice-Chancellor/ Principal is
final.
v) The College may change or amend the Academic Regulations,
Course Structure or Syllabi at any time, and the changes or
amendments made shall be applicable to all Students with effect
from the dates notified by the College Authorities.
(Applicable for the students admitted into II year B. Tech. (Lateral Entry
Scheme) from the Academic Year 2016-17 and onwards)
1.1. The LES candidates shall pursue a course of study for not less
than three academic years and f o r not more than six academic
years.
1.2. The candidate shall register for 144 credits and secure 144
credits from II to IV year B.Tech. Programme (LES) for the
award of B.Tech. degree. They are exempted from the courses of I
year offered to regular entry students.
1.3. The students, who fail to fulfill the requirement for the award
of the degree in 6 consecutive academic years from the year
of admission, shall forfeit their seats.
2. Promotion Rule
2.3. Students who fail to earn 144 credits as indicated in the course
structure within six academic years from the year of their
admission shall forfeit their seat in B.Tech. Course and their
admission stands cancelled.
3. Award of Class
After a student has satisfied the requirement prescribed for the completion
of the program and is eligible for the award of B. Tech. Degree, he
shall be placed in one of the following four classes:
MALPRACTICE RULES
5) Malpractice committee:
DEPARTMENT OF CSE
Institute Vision
To be a premier academic institution striving continuously for excellence in
technical education, research and technological service to the nation
Institute Mission
DEPARTMENT OF CSE
CBCS & OUTCOME BASED COURSE STRUCTURE: B.TECH (CSE)
I Semester
Course Course
Group L T P C
Code
A2013 Engineering Physics-II BS 3 0 0 3
A2009 Mathematics- III BS 3 1 0 3
A2502 Data Structures through C ES 3 1 0 3
A2403 Switching Theory and Logic PC 3 1 0 3
Design
A2310 Basics of Engineering Graphics ES 2 0 4 4
A2305 Engineering Workshop ES 0 0 3 2
A2018 Engineering Chemistry Lab BS 0 0 3 2
A2014 Engineering Physics Lab BS 0 0 3 2
A2550 Data Structures Lab ES 0 0 3 2
14 3 16 24
III Semester
IV Semester
V Semester
Course Course Group L T P C
Code
A2511 Computer Networks PC 4 0 0 4
Professional Elective I
A2524 Principles of Programming
Languages
A2525 Computer Graphics PE 4 0 0 4
A2535 Object Oriented Analysis and Design
A2527 Advanced Databases
A2528 Human Computer Interaction
A2512 Operating Systems PC 4 0 0 4
A2513 Software Engineering PC 4 0 0 4
A2021 Managerial Economics and Financial HS 3 0 0 3
Analysis
A2003 Advanced English Communication HS 0 0 3 2
Skills Lab
A2575 Computer Networks & Operating PC 0 0 3 2
Systems Lab
A2576 Android Programming Lab PC 0 0 2 1
A2005 Analytical Skills-I MC 2 0 0 0
21 0 8 24
VI Semester
Course Course
Group L T P C
Code
A2515 Web Technologies PC 4 0 0 4
A2516 Compiler Design PC 3 1 0 3
A2518 Data Warehousing and Data Mining PC 4 0 0 4
Professional Elective II
A2529 E-Commerce
A2530 Ethical Hacking PE 4 0 0 4
A2531 Distributed Databases
A2532 Distributed Computing
Professional Elective III
A2534 Software Project Management PE 4 0 0 4
A2541 Cloud Computing
VII Semester
Course Course
Group L T P C
Code
A2514 Linux Programming PC 3 0 0 3
Professional Elective IV
Image Processing and Pattern
A2533
Recognition
PE 4 0 0 4
A2539 Mobile Computing
A2567 Artificial Intelligence
A2568 Natural Language Processing
Professional Elective V
A2569 Design Patterns
PE 4 0 0 4
A2545 Information Retrieval Systems
A2546 Soft Computing
A2544 Big Data Analytics
Open Elective I OE 3 0 0 3
A2519 Scripting Languages PC 3 0 0 3
A2565 Software Testing Methodologies PC 3 1 0 3
A2559 Scripting Languages Lab PC 0 0 2 1
A2555 Linux Programming Lab PC 0 0 2 1
A2520 Industry Oriented Mini Project PW 0 0 4 2
20 1 8 24
VIII Semester
OPEN ELECTIVES
Code Open Elective I Dept offering
A2452 Principles of Electronic Communications ECE
A2241 Renewable Energy Sources EEE
A2362 Material Science ME
A2157 Disaster Management & Mitigation CE
Open Elective II Dept
A2156 Remote Sensing & GIS CE
A2451 Microcontrollers & Applications ECE
A2245 Electrical Machines & Drives EEE
A2363 Elements of Mechanical Engineering ME
Open Elective III Dept
A2453 Industrial Electronics ECE
A2364 Elements of Automobile Engineering ME
A2155 Environmental Impact Assessment CE
A2246 Power Systems Engineering EEE
C2165 Basics of Insurance & Taxation MBA
T – Tutorial L – Theory P – Practical C – Credits
Group: HS: Humanities & Social Sciences, BS: Basic Sciences, ES:
Engineering Sciences, PC: Professional Core, PE: Professional Elective, OE:
Open Elective, MC: Mandatory Non-credit Course, PW: Project Work
I SEMSTER
(A2001) ENGLISH
LTPC
30 0 3
Course objectives:
To improve the language proficiency of the students in English with
an emphasis on LSRW skills.
To equip the students with skills to study academic subjects more
effectively.
To develop communication skills in formal and informal situations.
Skills-wise objectives:
Listening Skills:
To equip them to identify the main ideas and the supporting details.
To be able to identify different organizational patterns and use these
ideas while speaking and writing.
Speaking Skills:
To make students aware of the role of speaking in English and its
contribution to their success.
To enable students to express themselves fluently and appropriately
in social and professional contexts.
Reading Skills:
To develop a global understanding of the text by paying adequate
attention to the details. To identify the main idea of the text.
To identify their note – making skills through reading for specific
speaking and writing purposes.
Writing Skills:
To enable them to write coherent paragraphs of different forms that
include…..
Problem – Solution
Extended definition
Compare and Contrast
General description/discussion
Unit –I
Chapter entitled ‗Advances in Science and Technology‟ from „Skills
Annexe‟ Published by Orient Black Swan, Hyderabad.
L-Conversations – Listening for the theme.
S- Apologizing and interrupting.
R- Read a Report on Seminar on pure science at the Pravasi
Bharathiya Divas Event in Kochi - Why pure Science in India
lags behind.
W- Descriptions of Objects and Events
G- Types of Verbs; Transitive, Intransitive and Linking.
V- Adjective and Adverb Suffixes.
Unit –II
Chapter entitled „Mokshagundam Visvesvaraya‟ from ―Epitome of
Wisdom‖, Published by Maruthi Publications, Hyderabad.
L-Conversations – Introducing each other, Talking about a course.
S- Opinion based questions
R- Reading for Subject/ Theme - The Palm island
W- Writing Paragraphs
G- Joining ideas by conjunctions, Adverbs
V- Prefixes and suffixes
Unit –III
A. Chapter entitled ‗Risk Management‟ from ―Skills Annexe -Functional
English for Success‖ Published by Orient Black Swan, Hyderabad
Information Transfer
B. Chapter entitled ‗Leela‟s Friend‟ by R.K. Narayan from ―Epitome of
Wisdom‖, Published by Maruthi Publications, Hyderabad
Unit –IV
Chapter entitled ‗Sports and Health‟ from ―Skills Annexe -Functional
English for Success‖ Published by Orient Black Swan, Hyderabad
Unit –V
Chapter entitled ‗The Convocation Speech‘ by N. R. Narayana Murthy‘
from ―Epitome of Wisdom”, Published by Maruthi Publications, Hyderabad
L- Speech on ‗How do you make a teacher great?‘
S- Role play – Interviewing famous personalities
R- Critical reading, reading for reference – ‗What is meant by
Entrepreneurship?‘
W-Essay writing
G- Focusing with passive voice
V- One word substitutes
Textbooks
1. A Text book entitled “Skills Annexe”, -Functional English to Success
Published by Orient Black Swan, Hyderabad
2. A text book entitled, “Epitome of Wisdom”, Published by Maruthi
Publications, Hyderabad.
Reference Books
1. Contemporary English Grammar Structures and Composition by David
Green, MacMillan Publishers, New Delhi. 2010.
2. English Grammar Practice, Raj N Bakshi, Orient Longman.
3. Technical Communication by Daniel Riordan. 2011. Cengage
Publications. New Delhi.
4. Handbook of English Grammar& Usage, Mark Lester and Larry Beason,
Tata McGraw –Hill.
5. Technical Communication, Meenakshi Raman, Oxford University Press
6. Objective English. Edgar Thorpe & Showick Thorpe, Pearson Education
7. Grammar Games, Renuvolcuri Mario, Cambridge University Press.
8. Murphy‘s English Grammar with CD, Murphy, Cambridge University
Press.
9. Everyday Dialogues in English, Robert J. Dixson, Prentice Hall India
Pvt Ltd.,
10. Basic Vocabulary Edgar Thorpe & Showick Thorpe, Pearson Education
11. Effective Technical Communication, M Ashraf Rizvi, Tata McGraw –
Hill.
12. Basic Vocabulary in Use, Michael McCarthy
Course Outcomes
On completion of the course, students will be able to:
1. Use the marvels of science and technology
2. Discuss the role of Visvesvaraya as a true patriot and as an excellent
engineer in solving complex, social problems.
3. Recognize the risk factors that are characteristic of factories in the
South Asian region and explain safety measures to be taken to prevent
them.
4. Explain extraordinary narrative techniques of R.K. Narayan with simple
expressions
5. Deliver the speech effectually to inspire the gathering.
6. Explain how undaunted spirit turns the ordinary into the extraordinary
and how sports contribute to sound health.
Course Objectives:
Obtain and understand formation and solution of matrices.
Solutions of linear systems through matrices.
Learn to find Eigen values, Eigen vectors and usage of Cayley-
Hamilton Theorem. Understanding real & complex matrices and
reduction to Canonical form.
Develop the skills pertinent to the practice of mathematics and to
formulate problems on continuous and differentiable functions.
The areas of bounded regions can be found using methods of
integrations.
In the diverse fields like electrical circuits, electronic
communication, mechanical vibration and structural engineering,
periodic functions naturally occur and hence their properties are
very much required.
Text Books
1. Kreyszig‘s Engineering Mathematics – I by Dr. A. Ramakrishna Prasad,
2014 yr Edition John Wiley Publications.
2. Advanced Engineering Mathematics by R.K. Jain & S.R.K. Iyengar, 3 rd
edition, Narosa Publishing House, Delhi.
References
1. Advanced Engineering Mathematics by Kreyszig, 8th Edition, John
Wiley & Sons Publishers
2. Higher Engineering Mathematics by B.S. Grewal, 36 th Edition, Khanna
Publishers.
3. Advanced Engineering Mathematics with MATLAB, Dean G. Duffy, 3 rd
Edi, CRC Press Taylor & Francis Group.
4. Mathematics for Engineering and Scientists. Alan Jeffrey, 6th Edi, 2013,
Chapman & Hall / CRC
5. Engineering Mathematics – I by T.K.V. Iyengar, B. Krishna Gandhi &
Others, 2013 Yr. Edition S.Chand.
6. Engineering Mathematics – I by D.S. Chandrasekhar, Prison Books Pvt.
Ltd.
7. Engineering Mathematics – I by G. Shanker Rao & Others I.K.
International Publications.
Course Outcomes
On completion of the course students will be able to
3. Verify mean value theorems and they can find maximum and minimum
for multiple variable functions.
4. Calculate the length of arcs, surface area and the volumes of solid
objects. Perform polar-to-cartesian and cartesian-to-polar conversions.
5. Expand the function by Fourier series and Fourier transforms.
Course Objectives
Solve Differential Equations of first order using various methods and
their applications.
Solve Differential Equations of multiple orders using various methods
and their applications.
Possible to transform from one form another form by using Laplace
Transforms (Used in Signals and systems).
Evaluate Gradient – Divergence – Curl, Directional derivatives.
Evaluate multiple integrals (line, surface, volume integrals) and
convert line integrals to area integrals and surface integrals to volume
integrals.
Text Books
1. Kreyszig‘s Engineering Mathematics – I by Dr. A. Ramakrishna Prasad,
2014yr Edition John Wiley Publications.
2. Advanced Engineering Mathematics by R.K. Jain & S.R.K. Iyengar, 3 rd
edition, Narosa Publishing House, Delhi.
Reference Books
1. Differential Equations with Applications & Historical Notes by George
F Simmons, 2ndEdi ,Tata Mc.graw Hill Publishing Co Ltd.
2. Kreyszig‘s Mathematical Methods by Dr. A. Ramakrishna Prasad, 1 st
Edition John Wiley Publications.
3. Advanced Engineering Mathematics by Kreyszig, 8th Edition, John
Wiley & Sons Publishers
4. Higher Engineering Mathematics by B.S. Grewal, 36 th Edition, Khanna
Publishers.
5. Advanced Engineering Mathematics with MATLAB, Dean G. Duffy, 3 rd
Edi, CRC Press Taylor & Francis Group.
6. Mathematics for Engineering and Scientists. Alan Jeffrey, 6th Edi, 2013,
Chapman & Hall / CRC
7. Engineering Mathematics – I by T.K.V. Iyengar, B. Krishna Gandhi &
Others, 2012 Yr. Edition S. Chand.
8. Engineering Mathematics – I by D.S. Chandrasekhar, Prison Books Pvt.
Ltd.
9. Engineering Mathematics – I by G. Shanker Rao & Others I.K.
International Publications.
Course Outcomes
(A2012)ENGINEERING PHYSICS-I
B. Tech(CSE) I Semester L T P C
3 0 0 3
Course Objectives:
To understand the phenomenon of interference, diffraction and
polarization of light.
To understand the bonding and structural properties of the crystals
and their study using X-ray diffraction techniques.
To understand the origin of different crystal defects and the basics
of statistical mechanics.
To understand the classical, quantum approach to explain the
electrical properties of solids and also band theory of solids.
To understand the properties of semi-conductors materials.
Unit-I
Optics: Interference: Principle of super position waves (qualitative),
Interference, Conditions required for interference- Coherence- Interference
due to Division of Wave front & Division of Amplitude – Stokes Principle-
Interference in thin films (reflected light)& Conditions for interference
maxima and minima, Newton rings – Formation of rings- Diameter of nth
bright & dark rings- Derivation of equation for wavelength of a
monochromatic light- Calculation of refractive index of a liquid.
Diffraction: Diffraction (definition), Distinctions between Fraunhofer &
Fresnel diffraction- Fraunhofer diffraction due to single slit, Conditions for
Principle maxima, Secondary maxima and minima – Fraunhofer diffraction
due to single slit, Double slitand N Parallel slits -Conditions for Principle
maxima, Secondary maxima and minima -Construction of diffraction grating
- Rayleigh criterion of resolving power-Resolving power of a grating.
Polarisation: Introduction, Representation of various polarized lights- Optic
axis- Principle section- Malus law- Brewster‘s law-Double refraction,
Construction and working of Nicol‘s prism, Polaroids, Quarter wave plate
&Half wave plate. Circular & Elliptical polarization (qualitative)
Unit-II
Crystallography: Ionic bond, covalent bond, metallic bond, hydrogen bond,
Vander-Waal's bond, cohesive energy of diatomic molecule, cohesive
energy of ionic crystal, space lattice, basis, unit cell, lattice parameters, seven
crystal system, Bravais lattice, atomic radius, co-ordination number and
packing factors of SC, BCC, FCC structures, Structures of NaCland CsCl.
Unit-III
Defects in Solids: Point defects; Vacancies, Schottky and Frenkel defects,
Substitutional Impurities, Interstitial impurities -Line Defects; Edge and
Screw dislocations, Burger's vector -Surface defects.
Statistical Mechanics: Micro state & Macro state – Phase Space -Maxwell-
Boltzman, Bose-Einstein and Fermi-Dirac statistics (qualitative treatment),
Concept of electron gas, Derivation of density of Energy States, Fermi
distribution function, Concept of Fermi level - Effect of temperature on the
Fermi distribution.
Unit-IV
Principles of Quantum Mechanics: Waves and particles- de-Broglie
hypothesis-Matter waves- Wavelength of Matter Waves, Davisson and
Germer's Experiment, G.P. Thomson Experiment, Heisenberg's Uncertainty
Principle, Schrödinger's Time Independent Wave Equation - Physical
Significance of the Wave Function – Particle in a one dimensional potential
box- Equation for energy and wave function of the particle . Extension for
three dimensions (qualitative)
Band Theory of Solids: Assumptions of classical and quantum free electron
theory of metals and their limitations, Origin of energy band formation in
solids-Electron in a periodic potential: Bloch theorem, Kronig- Penny model
(qualitative treatment), E-K curve, concept of effective mass of an electron,
classification of materials into conductors, Semiconductors &Insulators.
Unit-V
Semiconductor Physics: Introduction, Intrinsic semiconductor –
Concentration of electrons in the conduction band- concentration of holes in
the valance band -Fermi level in intrinsic semiconductor- Law of mass
action- Extrinsic semiconductors, N-Type semiconductor -Carrier
concentration in N-Type semiconductor- P-Type semiconductor -Carrier
concentration in P-Type semiconductors, Drift and diffusion current ,Hall
effect
Physics of Semiconductor Devices: Formation of PN junction, Open circuit
PN junction-I-V Characteristics of PN junction diode- Energy diagram of PN
diode-Diode equation- Direct &Indirect band gap semiconductors, LED ,
CMR College of Engineering & Technology Page 50
B.Tech(CSE) R-15
Text Books
1. Engineering Physics by PK Palani Samy, SciTech Publications.
2. Applied Physics for Engineers by Dr P. Madhusudana Rao, Academic
Publishing Company.
3. Solid State Physics by S. O. Pillai (Main edition) – New Age Publishers.
References
1. Fundamentals of Physics, David Halliday, Robert Resnick, Jearl Walker
by John Wiley & Sons
2. Introduction to Solid State Physics – C. Kittel (Wiley Eastern).
3. Engineering Physics by R.K.Gaur and S.L. Gupta; Dhanpat Rai and Sons.
4. Modern Physics by K. Vijaya Kumar, S. Chandralingam, S. Chand & Co.
Course Outcomes:
On completion of the course, students will be able to
B. Tech(CSE) I Semester
L T P C
3 1 0 3
Course Objectives
1. Understand computer basic‘s, algorithms, flowcharts and write simple
‗C‘ programs, data types and operators and Console I/O functions.
2. Understand Decision making statements and loops.
3. Understand the concepts of functions and pointers.
4. Understand the concepts of strings and various string handling
functions and Arrays.
5. Understand the concepts related to structures and able to differentiate
between structure and union, Storing of large data using files.
Unit – I
Algorithm, flowchart, Structure of a C program, Simple C Program,
Compiler, Linker, Pre-processor, Compilation process (program
development).Identifiers, Data Types, Variables, Constants, Console I/O
(printf, scanf), Operators(arithmetic, Relational, Logical, Conditional,
Increment/decrement, Bitwise, Assignment, Conditional, Special),
Expressions, Precedence and Associativity, Expression Evaluation, Type
conversions, Simple C Programming examples.
Unit-II
Decision Statements and loops- IF statement- (Simple IF Statement, the IF
ELSE Statement, Nesting of IF ELSE Statement, The ELSE IF Ladder),
Switch Statement, Repetition (Iteration) statements – (for, While, do-while),
Jump statements-(break, continue, goto), Simple C Programming examples.
Arrays – Concepts, declaration, definition, accessing elements, storing
elements, two– dimensional arrays, multidimensional arrays, array
applications, Example C programs.
Unit-III
Functions: Defining functions, user defined functions, categories of
Function, Standard functions, Passing arguments to functions, arrays and
functions, Returning values from functions, function calls, storage classes-
auto, static, extern, register, scope rules, recursion- recursive functions,
Limitations of recursion, Comparison of Iteration and Recursion, header
files, C pre-processor directives, Example C programs.
CMR College of Engineering & Technology Page 52
B.Tech(CSE) R-15
Unit-IV
Pointers – Introduction, declaration, definition, Accessing variable through
pointer, Storing variable, Arrays and Pointers, Pointer Arithmetic and arrays,
Passing an array to a function, array of pointers, pointers to pointers,
compatibility, pointers to void, pointers to functions, Dynamic Memory
Allocation, programming applications, Command line arguments.
Strings – Concepts, C Strings, String Input / Output functions, arrays of
strings, string manipulation functions-(stringlenth, stringcopy, stringreverse,
stringcompare, stringconcatenate, searching for a sub-sting), string / data
conversion-(sting to data, data to string), Example C programs.
Unit-V
Structures and Union: Declaring and initializing a structure, Accessing the
members of a structure, Nested structures, self referential structures, Array of
structures, Using structures in functions, Pointers to structures, Declaring and
initializing a union, Enumerated types, typedef, bit fields, Example C
programs.
Files- Concept of a file, stream, text files and binary files, Differences
between text and binary files, Modes of a file, Opening and Closing files, file
input / output functions (standard library input / output functions for files),
file status functions (error handling), Positioning
functions(ftell,fseek,rewind), Example C programs.
Text Books:
1. C programming A Problem-Solving Approach by Behrouz A.Forouzan,
E.V.Prasad, Richard F. Gilberg C How to Program Paul Deitel and
Harvey Deitel, PH.
2. Kanetkar Yashavant, Let Us C, BPB.
Reference Books
1. Computer Programming and Data Structures by E Balagurusamy, Tata
McGraw Hill.
2. The C Programming Language by Brain W. Kernighan, Dennis M.
Ritchie.
3. Programming in C, 2/e By Ashok Kamthane.
4. Absolute beginner's guide to C, Greg M. Perry, Edition 2, Publisher:
Sams Pub., 1994.
5. Schaum's Outline of Programming with C by Byron S. Gottfried, 1996
Course Outcomes:
On completion of the course students will be able to
Unit I
Water Technology
Sources of water – Impurities in water – Hardness of water – Temporary and
Permanent Hardness – Units. Estimation of temporary and permanent
hardness of water – EDTA method; Numerical problems; Potable Water
treatment – Specifications; Steps involved in treatment - Sedimentation –
Coagulation – Filtration – Sterilisation – Desalination of Brackish Water –
Reverse Osmosis and Electro dialysis.
Industrial water treatment – Boiler Troubles – Scales and Sludges ;
Caustic Embrittlement; Boiler Corrosion; Priming and Foaming. Hot lime
and Cold lime soda process ; Numerical Problems; Zeolite Process and Ion
Exchange Process. Internal conditioning methods like –,Calgon, Colloidal
and Sodium aluminate conditioning
Unit II
Electrochemistry & Batteries
Electrochemistry- Conductance- Specific, Equivalent and Molar
conductance and their units. Applications of Conductance (conductometric
titration). Galvanic cells, Types of Electrodes (Calomel, Quinhydrone and
Glass Electrode); Nernst Equation and its applications; Concept of
concentration cells; Electro chemical series, Potentiometric titrations,
Determination of PH using glass electrode – Numerical problems
Batteries
Electrode Potential – Determination of Single Electrode Potential; Primary
Cell – Dry or Leclanche Cell, Secondary Cell – Lead acid storage Cell ; Ni –
Cd batteries, , Fuel Cell – Hydrogen Oxygen Fuel Cell. Methanol – Oxygen
fuel cell.
Unit III
Corrosion and its Control
Causes and effects of corrosion. Theories of Corrosion – Chemical &
Electrochemical corrosion; Types of corrosion (Galvanic, Waterline, Pitting
and Inter granular ); Pilling bed-worth Rule. Factors affecting rate of
corrosion – Nature of metal and Nature of Environment – Corrosion control
methods – Cathodic protection (sacrificial anodic and Impressed current).
Surface coatings: Metallic coatings & methods of application of metallic
coating – Hot dipping (Galvanization & Tinning); Cementation, Metal
Cladding; Electroplating (copper plating); Electroless plating (Ni Plating);
Organic coatings – Paints – Constituents and their functions. V
Unit IV
Material Chemistry - High Polymers
polymers: Types of polymerization (addition, condensation and
copolymerization) .
Plastics: Thermoplastic and Thermosetting resins, Compounding and
fabrication of plastics (compression and injection moulding). Preparation,
properties, Engineering applications of PVC, Teflon and Bakelite.
Fibers: Characteristics of fibers – preparation, properties and uses of Nylon –
6,6 and Dacron – Fibre Reinforced Plastics (FRP) – applications.
Rubbers: Natural rubber and its vulcanization. Elastomers : Buna – s, Butyl
rubber and Thiokol rubber
Bio-degradable Preparation and applications of Polyvinyl acetate and
Polylactic acid.
Nano materials: Introduction, preparation by sol-gel and chemical vapour
deposition methods. Applications of nano-materials.
Unit V
Energy Sources
Fuels – Classification. Solid fuels; Coal – analysis of coal – proximate and
ultimate analysis and their significance.
Liquid fuels – Petroleum and its refining, Cracking, Types- fixed bed
catalytic cracking; Knocking – octane and cetane rating; Synthetic petrol,
Bergius and Fischer Tropsch process;
Gaseous fuels- constituents, characteristics and applications of natural gas,
LPG and CNG. Analysis of flue gas by Orsat‘s apparatus – Numerical
problems.
Combustion – Definition, calorific value of fuel – HCV, LCV, Determination
of calorific value by Junker‘s gas calorimeter – theoretical calculation of
calorific value by Dulong‘s formula – Numerical problems on combustion.
Text Books
1. Engineering chemistry by B. Rama Devi & Ch. Venkata Ramana
Reddy; Cengage Learning, 2012
2. Engineering Chemistry P. C. Jain and M .Jain, Dhanapat Rai& Sons
3. Engineering chemistry by Dr. Bharathikumari, Dr. Jyotsna
4. Engineering chemistry by Thirumala chary, E. Laxminyarana,
SCITECH Publications(India) Pvt. Ltd
References
1. A Textbook of Engineering Chemistry, S.S. Dara, S. Chand & Co.
2. A Textbook of Engineering Chemistry, Sashi Chawla, Dhanapath Rai &
Sons
Course Outcomes
At the end of the course student will be able to
1. Explain the benefits of treated water as source in steam generation and
other fields like production of steel, paper, textiles, atomic energy etc.
2. Analyze and apply the concepts in electrochemistry and corrosion
science.
3. Predict the different engineering applications by preparing various
polymers.
4. Summarize the manufacturing process of various fuels and their
applications in day today life.
5. Illustrate the importance and applications of surface chemistry in
various industries.
Course Outcomes
Course Objectives:
To facilitate computer-aided multi-media instruction enabling
individualized and independent language learning
To sensitize the students to the nuances of English speech sounds, word
accent, intonation and rhythm
To bring about a consistent accent and intelligibility in their
pronunciation of English by providing an opportunity for practice in
speaking
To improve the fluency in spoken English and neutralize mother tongue
influence
To train students to use language appropriately for public speaking
Syllabus:
English Language Communication Skills Lab shall have two parts:
a. Computer Assisted Language Learning (CALL) Lab
b. Interactive Communication Skills (ICS) Lab
Exercise – III
CALL Lab: Minimal Pairs- Word accent and Stress Shifts-
ICS Lab: Descriptions – Place , Person, Object
Exercise – IV
CALL Lab: Intonation and Common errors in Pronunciation.
ICS Lab: Extempore- Public Speaking
Exercise – V
CALL Lab: Neutralization of Mother Tongue Influence and
Conversation Practice
ICS Lab:. Giving Directions
Course Outcomes
By the end of the course students will be able to
1. Explain nuances of language through audio- visual experience and
group activities
2. Neutralization of accent for intelligibility
3. Exhibit speaking ability with clarity and confidence to enhance their
employability skills.
(A2551) IT WORKSHOP
B.Tech(CSE) I Semester
L T P C
0 0 3 2
Objectives
The IT Workshop for engineers is a training lab course spread over
42 hours. The modules include training on PC Hardware, Internet &
World Wide Web and Productivity tools including Word, Excel and
Power Point.
PC Hardware
Week 1 – 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.
Week 2 – Task 2 : Every student should dissemble 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.
Week 3 – Task 3 : Every student should individually install MS windows-
XP on the personal computer. Lab instructor should verify the installation
and follow it up with a Viva.
Week 4 – 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 should verify the
installation and follow it up with a Viva
Week 5 – 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 computer back to
working condition. The work done should be verified by the instructor and
followed up with a Viva
Internet & World Wide Web:
Week 6 - Task 1 : Orientation & Connectivity Boot Camp : Students
should get connected to their Local Area Network and 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
Productivity tools
Word
Week 8 – Word Orientation: The mentor needs to give an overview of
Microsoft (MS) office 2007/ equivalent (FOSS) tool word: MS office 2007/
equivalent (FOSS) tool Word as word Processors, Details of the three tasks
and features that would be covered in each, using and word – Accessing,
overview of toolbars, saving files, Using help and resources, rulers, format
painter.
Task 1: Using 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 Colours, Inserting Header and Footer, Using
Date and Time option in Word.
Week 9 - Task 2: 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.
Week 10 - Task 3 : 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 in word.
Excel
Outcomes
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-XP, Linux and the required device
drivers. In addition hardware level troubleshooting process, tips and tricks
would be covered. The students should work on working PC to dissemble
and assemble to working condition 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 cyber
hygiene, i.e., protecting the personal computer from getting infected with the
viruses, worms and other cyber attacks would be introduced.
Reference Books
1. Introduction to Information Technology, ITL Education Solutions
limited, Pearson Education.
2. Introduction to Computers, Peter Norton, 6/e McGraw Hill Publishers.
3. Upgrading and Repairing, PC‘s 18th e, Scott Muller QUE, Pearson
Education
4. Comdex Information Technology course tool kit Vikas Gupta, WILEY
Dreamtech.
5. IT Essentials PC Hardware and Software Companion Guide Third
Edition by David Anfinson and Ken Quamme. – CISCO Press, Pearson
Education.
6. PC Hardware and A+Handbook – Kate J. Chase PHI (Microsoft)
II SEMESTER
(A2013)ENGINEERING PHYSICS-II
L T P C
B. Tech. (CSE) II-Semester 3 0 0 3
Course Objectives
1. To understand the introductory level concept of optical coherence,
lasers and optical fiber characteristics.
2. To understand the basic principles of dielectric properties of solids.
3. To understand the physical principles underlying the magnetic and
super conducting properties of solids.
4. To understand the fundamental concepts of electromagnetic fields
and laws governing them.
5. To understand the basic principles of nanotechnology, ultrasonic
and acoustics of buildings.
Unit -I
Lasers: Characteristics of Lasers, Spontaneous and Stimulated Emission of
Radiation, Einstein's Coefficients and relation between them, Population
inversion, Lasing action in Ruby Laser, Helium-Neon Laser, Semiconductor
Diode Laser, Applications of Lasers.
Fiber Optics: Principle of Optical Fiber, Construction of optical Fiber,
Acceptance Angle and Acceptance Cone, Numerical Aperture, Types of
Optical Fibers: Step Index Optical Fibers& Pulse Dispersion - Graded index
Optical fibers& Pulse Dispersion, Attenuation in Optical Fibers, Optical Fiber
Communication, Optical Fiber Sensors.
Unit -II
Dielectric Properties: Electric dipole, Dipole Moment, Relative
Permittivity, Polarization and Polarizability, Electric Susceptibility,
Displacement Vector, Electronic, Ionic, and Orientation, Polarization and
derivation of their polarizabilities, Internal fields in Solids, Clausius -
Mossotti Equation, Ferro electric, Piezo electric and pyro-electric materials.
Unit -III
Magnetic Properties & Superconducting Properties: Permeability, Field
intensity, Magnetic field induction, Magnetization, Magnetic Permeability &
CMR College of Engineering & Technology Page 67
B.Tech(CSE) R-15
Unit-IV
Electromagnetic Theory: Review of Gauss Law, Amperes law and
Faraday‘s law, Steady and Varying Fields, Conduction and Displacement
Current, Maxwell‘s Equations in Integral and Differential forms,
Electromagnetic Wave Equations in free space, dielectric and conducting
media, Poynting Theorem.
Unit -V
Nanotechnology: Origin of nanotechnology, Nano Scale, Surface to Volume
Ratio, Quantum Confinement, Properties that changes on Nano Scale, Physical
Properties, Electrical Properties, Chemical Properties, Optical Properties.;
Bottom-up Fabrication: Sol-Gel and combustion methods; Top-Down
Fabrication: Physical Vapour Deposition, Pulsed Laser Vapour Deposition
Methods, Characterization by XRD & TEM, Applications.
Acoustics: Basic Requirements of Acoustically Good Hall, Reverberation
and Time of Reverberation, Sabine‘s Formula for Reverberation Time,
Measurement of Absorption Coefficient of a Material, Factors Affecting the
Architectural Acoustics and their Remedies.
Ultrasonic: Introduction, Production of Ultrasonic using Piezoelectric
Method –Magnetostriction Method- applications.
Text Books
1. Engineering Physics by P K PalaniSamy, ScitechPublications.
2. Applied Physics for Engineers by Dr. P. Madhusudana Rao, Academic
Publishing Company.
3. Solid State Physics by S.O. Pillai (Main edition) – New Age Publishers.
References
1. Fundamentals of Physics, David Halliday, Robert Resnick, Jearl Walker
by John Wiley & Sons
2. Introduction to Solid State Physics – C. Kittel (Wiley Eastern).
3. Engineering Physics by R. K. Gaur and S. L. Gupta; DhanpatRai and
Sons.
CMR College of Engineering & Technology Page 68
B.Tech(CSE) R-15
Course Outcomes
On completion of the course, students will be able to
(A2009) MATHEMATICS-III
Text Books
1. Kreyszig‘s Mathematical Methods by Dr. A. Ramakrishna Prasad, 2014
yr Edition John Wiley Publications.
2. Advanced Engineering Mathematics by R.K. Jain & S.R.K. Iyengar, 3 rd
edition, Narosa Publishing House, Delhi.
References
1. Advanced Engineering Mathematics by Kreyszig, 8 th Edition, John
Wiley & Sons Publishers
2. Higher Engineering Mathematics by B.S. Grewal, 36th Edition, Khanna
Publishers.
3. Advanced Engineering Mathematics with MATLAB, Dean G. Duffy, 3 rd
Edi, CRC Press Taylor & Francis Group.
4. Mathematics for Engineering and Scientists. Alan Jeffrey, 6 th Edi, 2013,
Chapman & Hall / CRC
5. Introductory Methods of Numerical Analysis , S.S.Sastry, 4h Edition,
Prentice Hall of India Pvt. Ltd.
6. Mathematical Methods by T.K.V. Iyengar, B. Krishna Gandhi & Others,
2013 Yr. Edition S. Chand.
7. Mathematical Methods by D.S. Chandrasekhar, Prison Books Pvt. Ltd.
8. Mathematical Methods by G. Shanker Rao & Others I.K. International
Publications.
Course Outcomes
On completion of the course, students will be able to
Unit-I
Linear Data Structures: Introduction to Data Structures, Abstract data
types, Strategies for choosing the appropriate data structure, Introduction to
Linear and Non-Linear Data Structures. Singly linked list- Operations,
insertion, deletion, Concatenating singly linked lists, circular linked list-
operations for Circular Linked lists. Doubly linked list- Operations-
insertion, deletion.
Unit-II
Stack: Definition, operations, array and linked representations of stacks,
Applications: Infix to postfix conversion, postfix expression evaluation,
Recursion implementation, Towers of Hanoi problem.
Unit-III
Queue: Definition & Operations, Array and linked implementation in C ,
Circular Queues-Insertion and deletion operations. Deque (Double ended
queue) Array and linked implementation in C , Applications of Queues-
Priority queues.
Unit-IV
Non-Linear Data Structures
Trees- Terminology, Representation of Trees, Binary Tree, Properties of
Binary Trees, Binary Tree Representations-Array and Linked
Representation. Binary Search Tree, Binary Tree Traversals.
Unit-V
Searching and Sorting: Linear Search, Binary Search, Bubble Sort,
Selection Sort, Insertion Sort, Quick Sort, Merge Sort, Performance analysis
of Searching and Sorting techniques using Asymptotic notations.
Comparison of sorting methods.
Text Books:
1. Yedidyah Langsam, Moshe J. Augenstein and Aaron M. Tenenbaum,
Data Structures using C and C++. 2 ed, Pearson Education.
2. C Programming& Data Structures, B.A.Forouzan and R.F. Gilberg,
Third Edition, Cengage Learning.
3. Fundamentals of Data Structures in C,2nd Edition, E.Horowitz, S. Sahani
and Susan.
Reference Books:
1. C Programming & Data Structures, E. Balagurusamy, TMH.
2. C& Data structures – P. Padmanabham, Third Edition, B.S. Publications.
3. Mark Allen Weiss, Data structures and Algorithm Analysis in C.
Addison Wesley Publication.
1. https://www.youtube.com/user/mycodeschool
2. http://freevideolectures.com/Course/2279/Data-Structures- And-
Algorithms
Course Outcomes:
On completion of the course, students will be able to
Use data structure concepts for realistic problems.
Identify appropriate data structure for solving computing
problems in respective language.
Solve problems independently and analyze critically.
L T P C
3 1 0 3
Course Objectives
This course provides in-depth knowledge of switching theory and the design
techniques of Digital Circuits, which is the basis for design of any digital
circuit. The main objectives are:
To learn basic techniques for the design of digital circuits and
fundamental concepts used in the design of digital systems.
To understand common forms of number representation in digital
electronic circuits and to be able to convert between different
representations.
To implement simple logical operation using combinational logic
circuits.
To design combinational logic circuits, sequential logic circuits.
To impart to student the concepts of sequential circuits, enabling
them to analyze sequential systems in terms of state machines.
To implement synchronous state machines using Flip-Flops.
Text Books
1. Switching & Finite Automata theory - ZviKohavi, & Niraj K. Jha ,,3rd
Edition, Cambridge.
2. Digital Design -Morris Mano, PHI, 3rd Edition, 2006.
Reference Books
1 Introduction to switching design and logic design - Fredriac J. Hill,
Gerald R. Peterson, 3rd ED, John Wiley & Sons Inc
2. Digital fundamentals – A Systems approach-Thomas L. Floyd, Pearson,
2013.
3. Digital logic design- Ye Brian and Holds Worth, Elsevier.
4. Fundamentals of Logic Design - Charles H. Roth, Thomson Publications,
5th Edition, 2004.
5. Digital Logic Applications and Design - John M. Yarbrough, Thomson
Publications, 2006.
6. Digital Logic and state machine design – Comer, 3rd, oxford, 2013.
CMR College of Engineering & Technology Page 76
B.Tech(CSE) R-15
Course Outcomes
Upon completion of the course, students will be able to
1. Identify the numeric information in different forms eg. Different bases,
signed & unsigned integers, variable codes with ASCII, gray & BCD.
2. Summarize the Boolean functions using theorems and postulates
3. Ability to solve & design of combinational circuits
4. Subdivide the combinational and sequential circuits
Unit – I
Introduction to Engineering Drawing
Principles of Engineering Graphics and their Significance; Conic Sections
(Using eccentricity method only) Cycloid, Epicycloid and Hypocycloid
Involutes
Unit- II
Scales – Plain, Diagonal and Vernier Scales.
Unit – III
Orthographic Projections
Principles of Orthographic Projections – Conventions – Projections of Points
and Lines (Excluding traces of lines)
Projections of Plane regular geometric figures- (Excluding Auxiliary Planes
and traces of planes)
Unit – IV
Projections of Solids: Projection of regular solids- cube, Cylinder, prisms,
pyramids, cone (Using solid rotation method only- Auxiliary plane method
excluded).
Unit-V
Isometric Projections
Principles of Isometric Projection – Isometric Scale – Isometric Views –
Conventions – Isometric Views of Lines, Plane Figures, Solids and
Compound Solids – Isometric Projection of objects having non- isometric
lines. Isometric Projection of Spherical Parts
Transformation of Projections: Conversion of Isometric Views to
CMR College of Engineering & Technology Page 78
B.Tech(CSE) R-15
Text Books
1. Engineering Drawing N.D. Bhatt / Charotar
2. Engineering Drawing and Graphics Rane and Shah/ Pearson Edu.
Reference Books
1. A Text Book of Engineering Drawing / Dhawan R K / S. Chand
2. Engineering Graphics With Auto CAD / James D Bethune / Pearson
Edu.
3. Engineering Graphics / K R Mohan / Dhanpat Rai.
4. Text book on Engineering Drawing / KL Narayana/ P Kannaih / Scitech
Course Outcomes
On completion of the course, students will be able to
L T P C
3 0 0 3
Course Objectives
To provide the students with hands on experience on different trades of
Engineering like fitting, carpentry, foundry, smithy, house wiring and
soldering.
Text book:
1. Workshop Manual, Second edition/ P Kannaiah and K L Narayana /
Scitech publishers
Course Outcomes:
On completion of the course, students will be able to
1. Use tools and equipments in fitting, carpentry, house wiring,
soldering, foundry and smithy.
2. Produce simple models in the above trades
L T P C
0 0 3 2
Course objectives
Estimation of hardness of water is essential for drinking water and
in industries to avoid boiler troubles.
Knowledge of instrumentation in conducto-meter, potentiometer,
calorimeter and pH meter.
Knowledge of preparation of aspirin and Thiokol rubber
Knowledge of physical properties of chemical compounds
To gain the knowledge on existing devices, materials.
Experiments
I Inorganic chemistry experiments by Analytical methods.
Water Analysis:
1. Estimation of Hardness of water by EDTA method
2. Estimation of Alkalinity of water.
II. Instrumentation.
3.Estimation of Copper by colorimetric Method.
4.Conductometric Titration of a strong acid vs a strong base
5.Potentiometric Titration of a strong acid vs a strong base
References
1. Engineering chemistry by B. Rama Devi & Ch. Venkata Ramana Reddy;
Cengage Learning, 2012
2. A Textbook of Engineering Chemistry, Sashi Chawla, Dhanapath Rai&
Sons
3. A Text book .Engineering Chemistry, B. K. Sharma Et al
Course outcomes:
At the end of the course the student will be able to
1. Predict the extent of hardness range present in water sample and its
consequences if used for various industrial operations
2. Prepare drugs like Aspirin and polymers like Thiokol rubber
3. Estimate the strength of solutions ,pH of various solutions
4. Evaluate the viscosity and surface tension of liquids
5. Employ the conductometric and potentiometric titrations
6. Describe the principles of adsorption phenomenon.
L T P C
0 0 3 2
B. Tech. (CSE) II-Semester
Course Objectives:
This course on Physics lab is designed with 15 experiments in a
semester. It is common to all branches of engineering.
The objective of the course is that the student will have exposure to
various experimental skills which is very essential for an engineering
student.
The experiments are selected from various area of Physics like
Physical Optics, Lasers, Fiber Optics, Sound, Mechanics, Electricity
& Magnetism and Basic Electronics.
Also the student is exposed to various tools like Screw gauge, Vernier
Callipers, Physical Balance, Spectrometer and Microscope.
Laboratory Manual:
1. Laboratory Manual of Engineering Physics by Dr. Y. Aparna & Dr. K.
Venkateswara Rao (V.G.S Publishers).
L T P C
0 0 3 2
Objectives:
Week
Week Wise Programs
Course Outcomes
III SEMESTER
L T P C
4 0 0 4
Objectives:
To get a clear understanding of object-oriented concepts.
To understand object oriented programming through C++.
Unit-I
Introduction to Object Oriented Programming: Need for Object Oriented
Programming - Characteristics of Object Oriented Languages – Comparison
of C and C++ - Structures: Structures - Enumerations – Functions: Simple
Functions – Passing Arguments to Functions – Returning Values from
Functions – Reference Arguments - Overloaded Functions – Recursion –
Inline Functions –Default Arguments – Scope and Storage Class – Returning
by Reference – const Function Arguments.
Unit-II
Objects and Classes: A Simple Class – C++ Objects as Physical Objects –
C++ Objects as Data types - Constructors – Objects as Function Arguments -
Copy Constructor – Structures and Classes – Classes, Objects and Memory -
Static class data – Constant Member functions and constant objects - Arrays
and Strings: Array Fundamentals – Arrays as Class Member Data – Array of
Objects – C-Strings – The Standard C++ String Class.
Unit-III
Operator Overloading: Overloading Unary Operators – Overloading Binary
Operators - Data Conversion – explicit and mutable keywords – Inheritance:
Derived Class and Base Class – Derived Class Constructors – Overriding
Member Functions – Which Function is Used – Class Hierarchies – Public
and Private Inheritance – Levels of Inheritance- Multiple Inheritance –
Ambiguity – Containership: Classes within classes.
Unit-IV
Pointers: Address and Pointers – The Address of Operator - Pointers and
CMR College of Engineering & Technology Page 86
B.Tech(CSE) R-15
Unit-V
Streams: Stream Classes – Stream Errors –– Overloading Extraction and
Insertion Operators - Templates and Exceptions: Function Templates – Class
Templates – Exception Handling-Types of Exceptions, Throwing
Exceptions, Exception Classes. Multiple Throws and Catches, Uncaught
Exceptions-Nested Try-Catch Blocks.
Textbooks:
1. C++: The Complete Reference (4th Ed) – Schildt H. (TMH).
2. The C++ Programming Language – Stroustrup B. (Addison-Wesley)
3. C++:How to program-Deitel &Deitel
References:
1. Object Oriented Programming With C++, E Balagurusamy, TMH
2. C++ Programming, Black Book, Steven Holzner, dreamtech
3. Object Oriented Programming in Turbo C++, Robert Lafore, Galgotia
4. Object Oriented Programming with ANSI and Turbo C++, Ashok
Kamthane, Pearson
5. The Compete Reference C++, Herbert Schlitz, TMH
6. Teach Yourself C++, Al Stevens
7. A Structured Approach using C++, Farouzan & Gilberg
8. Object Oriented Programming with C++, R S Salaria
Online References:
http://www.cplusplus.com/
http://www.stroustrup.com/
Course Outcomes:
On completion of the course, students will be able to
Course Objectives:
To explain with example the basic terminology of functions, relations &
sets.
To perform the operations associated with sets, functions, & relations.
To relate partical examples to the appropriate sets, function or relation
model and interpret the associated operations and terminology in
context.
To describe the importance and limitations of predicate logic
To relate the ideas of mathematical induction to recursion and
recursively defined structures.
To use graph theory for solving problems
Unit-I
Mathematical Logic Statements and notations, Connectives, Well formed
formulas, Truth Tables, tautology, equivalence implication, Normal forms,
Quantifiers, Universal quantifiers. Predicates : Predicative logic, Free &
Bound variables, Rules of inference, Consistency, proof of contradiction,
Automatic Theorem Proving.
Unit-II
Relations: Properties of binary Relations, equivalence, transitive closure
compatibility and partial ordering relations, Lattices, Hasse Diagram
Unit-III
Elementary Combinatorics: Basis of counting, Combinations &
Unit-IV
Recurrence Relation: Generating Functions, Function of Sequences
Calculating Coefficient of generating function, Recurrence relations, Solving
recurrence relation by substitution and Generating funds. Characteristics
roots solution of In homogeneous Recurrence Relation.
Unit-V
Graph Theory: Representation of Graph, DFS, BFS, Spanning Trees, planar
Graphs, Graph Theory and Applications, Basic Concepts Isomorphism and
Sub graphs, Multi graphs and Euler circuits, Hamiltonian graphs, Chromatic
Numbers
Text Books
1. Elements of Discrete Mathematics- A computer oriented Approach- C L
Liu, DP Mohapatra, Third Edition, Tata McGraw Hill
2. Discrete Mathematics For Computer Scientists & Mathematicians JL
Mott, A Kandel, TP Baker PHI
References
1. Discrete Mathematics with Applications, Thomas Koshy, Elsevier
2. Discrete Mathematical structures Theory and application-Malik & Sen
3. Discrete Mathematics and its applications, Kenneth H Rosen, Fifth
Edition TMH
4. Logic & Discrete Mathematics, Grass Man & Trembley, Pearson
Educations
Course Outcomes
On completion of the course, students will be able to
1. Illustrate by examples the basic terminology of functions, relations, sets
and demonstrate knowledge of their associated operations.
2. Demonstrate in practical applications the use of basic counting
principles of permutations, combinations, inclusion/exclusion principle
and the pigeon hole methodology
3. Represent and apply graph theory in solving computer science problems
Course Objectives
Develop an understanding of the necessity of protection of
environment
Develop an understanding of Natural resources
Develop an understanding of Biodiversity
Develop an understanding of Global Environmental problems
Develop an understanding of Environmental pollution
Unit-I
Environmental Studies:
Introduction, Definition, scope and importance, Ecosystems: Introduction,
types, characteristic features, structure and functions of ecosystems. Bio geo
chemical cycle, Classification of Eco system.
Unit-II
Natural Resources: classification of Resources, Land resources, Land as
resource, Common property resources, Land degradation, Soil erosion and
desertification, Effects of modern agriculture, fertilizer –pesticide problems,
Forest resources, Use and over-exploitation.
Mining and dams – their effects on forest and tribal people, Water resources,
Use and over- utilization of surface and groundwater, Floods, droughts,
Water logging and salinity, Dams –benefits and costs, Conflicts over Water,
Energy resources.
Unit-III
Bio-diversity and its conservation, Value of bio-diversity -consumptive and
productive use, social, ethical, aesthetic and option values, Bio-geographical
classification of India – India as a mega diversity habitat, Threats to bio-
diversity –Hot-spots, habitat loss, poaching of wild life, loss of species,
seeds, etc. Conservation of bio-diversity – Insitu and Ex-situ conservation.
Unit-IV
Environmental Pollution –Local and Global Issues, Nature of thermal
pollution and nuclear hazards, Global warming, Acid rain, Ozone depletion.,
Environmental case studies.
Unit-V
Environmental Problems in India, Drinking water, sanitation and public
health, Effects of the activities on the quality of environment, Water scarcity
and groundwater depletion, Controversies on major dams – resettlement and
rehabilitation of people: problems and concerns, Rain water harvesting,
cloud seeding and watershed management. Economy and Environment, The
economy and environment interaction, Economics of development,
preservation and conservation, Sustainability: theory and practices, Limits to
growth, Equitable use of resources for sustainable life styles, Environmental
Impact Assessment.
Text Books
1. Environmental Science - Y.Anjaneyulu, B S Publications.
2. Environmental studies-Deeksha dave, Cengage learning India Pvt. Ltd.,
3. Environmental sciences and Engineering - P. Venugopal Rao, PHI
learning Pvt. Ltd.,
4. Environmental Science and Technology by M. Anji Reddy, B S
Publications.
Reference Books
1. Clark, R.S., Marine Pollution, Clanderson Press, Oxford, 2002.
2. Cunningham, W.P., et al. , Environmental Encyclopedia, Jaico Publishing
House, Mumbai, 2003.
Course Outcomes:
On completion of the course, students will be able to
1. Explain various factors affecting the environment
2. Describe various types of natural resources
3. Exhibit skills in solving various environmental problems
4. Explain means to protect the environment
L T P C
3 1 0 3
Course Objective:
This course introduces the concepts of electrical DC and AC circuits, basic
laws of electricity, instruments to measure the electrical quantities, different
methods to solve the electrical networks, construction operational features of
energy conversion devices i.e. DC and AC machines, transformers. It also
emphasize on basics of electronics, semiconductor devices and their
characteristics and operational features.
Unit-I:
Electrical Circuits: Basic definitions, Types of elements, Ohm‘s Law,
Resistive networks, Kirchhoff‘s Laws,
Inductive networks, capacitive networks, Series, Parallel circuits and Star-
delta and delta-star transformations.
Instruments: Basic Principle of indicating instruments – permanent magnet
moving coil and moving iron instruments.
Unit-II:
DC Machines: Principle of operation of DC Generator & motor – EMF
equation - types – DC motor types –torque
equation – applications – three point starter.
Unit-III:
Transformers: Principle of operation of single phase transformers –EMF
equation – losses – efficiency and regulation.
AC Machines: Principle of operation of induction motor – slip – torque
characteristics – applications. Principle of operation of alternators –
regulation by synchronous impedance method
Unit–IV:
Diodes: P-n junction diode, symbol, V-I Characteristics, Diode Applications,
and Rectifiers – Half wave, Full wave and Bridge rectifiers (simple
Problems).
Unit-V:
Cathode Ray Oscilloscope: Principles of CRT (Cathode Ray Tube),
Deflection, Sensitivity, Electrostatic and Magnetic deflection, Applications
of CRO - Voltage, Current and frequency measurements.
Text books:
1. Basic concepts of Electrical Engineering, PS Subramanyam, BS
Publications.
2. Basic Electrical Engineering, S.N. Singh, PHI.
3. Electronic Devices and Circuits, S. Salivahanan, N.Suresh Kumar, A.
Vallavaraj, Tata McGraw-Hill
Companies
4. Electronic Devices and Circuits, K. Lal Kishore, BS Publications
Reference books:
1. Basic Electrical Engineering, Abhijit Chakrabarthi, Sudipta nath,
Chandrakumar Chanda, Tata- McGraw-Hill.
2. Principles of Electrical Engineering, V.K Mehta, Rohit Mehta, S.
Chand Publications.
3. Basic Electrical Engineering, T.K. Nagasarkar and M.S. Sukhija,
Oxford University Press.
4. Fundamentals of Electrical Engineering, RajendraPrasad, PHI. Basic
Electrical Engineering by D.P.Kothari , I.J. Nagrath, McGraw-Hill.
5. Millman‘s Electronic Devices and Circuits, J. Millman, C.C.Halkias,
and Satyabrata Jit, Tata McGraw-Hill companies.
6. Electronic Devices and Circuits, R.L. Boylestad and Louis Nashelsky,
PEI/PHI.
7. Introduction to Electronic Devices and Circuits, Rober T. Paynter,PE.
8. Integrated Electronics, J. Millman and Christos C. Halkias, Tata
McGraw-Hill companies.
9. Electronic Devices and Circuits, Anil K. Maini, Varsha Agarwal,Wiley
India Pvt. Ltd.
Course Outcomes
L T P C
4 0 0 4
Course Objectives:
To understand the basic concepts such as Abstract Data Types,
Linear and Non Linear Data structures.
To understand the notations used to analyze the Performance of
algorithms.
To understand the behavior of data structures such as stacks,
queues, trees, hash tables, search trees, Graphs and their
representations.
To choose the appropriate data structure for a specified application.
To understand and analyze various searching and sorting algorithms.
To write programs in C/C++ to solve problems using data
structures such as arrays, linked lists, stacks, queues, trees,
graphs, hash tables, search trees.
Unit I:
Abstract Data Type, Concept of Data Structures, Overview of Data
Structures-Linear, Non-Linear Data Structures, Arrays-Memory Allocation
for one dimensional Arrays, Multi Dimensional Arrays, Memory
representation of Matrix, Sparse Matrices-Triangular Matrices, Band
Matrices, Memory Representation of sparse Matrices .Representation of
Binary Tree-Array representation, Linked Representation-Properties of
Binary Trees.
Unit II:
Threaded binary trees, Max Priority Queue ADT-Implementation,-Max Heap
Definition, Insertion into a Max Heap , Deletion from a Max Heap.
Over view of Linear Search Methods-Linear Search, Binary Search-Analysis
of Linear Search, Binary Search. Non-Linear Search Methods-.Binary Search
Tree-Operations-Searching, Insertion, Deletion.
Unit III:
AVL Trees-Definition, Examples, Insertion into AVL Trees. M-way Search
Tree Definition, Examples, B-Tree ,Definition, B-tree of order-m, perations-
Insertion and Searching, Introduction to Red –Black Trees and Splay Trees ,
Unit IV:
Dictionaries: Dictionary as a linear list, skip list-operations-Insertion,
Deletion, Searching ,Hash tables, Hash Functions, Collision Resolution
Techniques-Linear Probing, Quadratic Probing, and Double Hashing.
Unit V:
Pattern Matching Algorithms: Brute-Force Algorithm, Boyer-Moore
Algorithm, Knuth-Morris-Pratt Algorithm, Analysis of Pattern Matching
Algorithms, Tries.
Textbooks:
1. Data structures and Algorithm Analysis in C++, Mark Allen Weiss,
Pearson Education. Ltd., Second Edition.
2. Data structures, Algorithms and Applications in C++, S.Sahni,
University Press (India) Pvt.Ltd, 2nd edition, Universities Press
Orient Longman Pvt. Ltd.
3. Data structures and Algorithms in C++, Michael T. Goodrich,
R.Tamassia and Mount, Wiley student edn, John Wiley and Sons.
References:
1. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek,
Thomson
2. Data structures using C and C++, Langsam, Augenstein and Tanenbaum,
PHI.
3. Problem solving with C++, The OOP, Fourth edition, W.Savitch,
Pearson education.
4. Data Structures using C++, D.S.Malik Cengage Learning, India Edition.
5. Data Structures with C++ Using STL, 2nd edition, W.H.
Ford and W.R. Topp, Pearson/PHI.
6. Mastering Algorithms with C.K. Loudon, O‗Reilly, SPD Pvt. Ltd.
7. An Introduction to Data structures and Algorithms, J.A. Storer, Springer.
8. Advanced Data Structures & Algorithms in C++, V.V. Muniswamy
Jaaico Publishing House
Course Outcomes:
On completion of the course, students will be able to
1. Demonstrate how to use data structure concepts for realistic problems.
2. Identify appropriate data structure for solving computing
problems in respective language.
3. Solve problems independently and think critically.
L T P C
0 0 3 2
Objectives:
To write and execute programs in C++ to solve problems using data
structures such as arrays, linked lists, stacks, queues, trees, graphs,
hash tables and search trees.
To make the student learn an object oriented way of solving
problems.
To make the student write ADTS for all data structures.
Week 1:
a) A string contains letters and digits. Write a C++ program to remove digits
from a string and retains the string that contains letters only
b) Devise a C++ procedure to swap the contents of two stacks
Week 2 :
Write a C++ program to create a Binary Tree and perform the following
operations on it
a)insert b) search c)destroy tree
Week 3 :
a) Write a C++ program that reverses all elements in a Queue.
b) Write a C++ program to implement Binary Heap
Week 4 :
a) Write a C++ program to perform tree traversals
b) Write a C++ function to create a Binary Tree for the given in-order and
post-order traversals
Week5:
a) C++ Program to Check if a Given Binary Tree is an AVL Tree or Not
b) Write a C++ program to find height of a Binary tree.
Week 10 :
Write a C++ program to perform the following operations
a) Insertion into a B-tree b) Deletion from a B-tree
Week 11 :
Write a C++ program to implement all the functions of a dictionary (ADT)
using hashing.
Week 12 :
a) Write a C++ program for implementing Brute force pattern matching
algorithm.
b) Write a C++ program for implementing Knuth-Morris- Pratt pattern
matching algorithm.
Textbooks:
1. Data Structures A Pseudocode Approach with C++ , Indian edition, R.F.
Gilberg and B.A.Forouzan, Cengage Learning.
2. Programming Prinicples and Practice using C++, B. Stroustrup,
CMR College of Engineering & Technology Page 99
B.Tech(CSE) R-15
Course Outcomes:
On completion of the course, students will be able to
Course Objective
This lab introduces different tests on DC & AC machines to know the
performance and the different speed control techniques will be done
practically. It also helps in understanding the characteristics of diode,
transistors and different rectifiers by verifying them practically.
PART A:
1. Verification of KCL and KVL.
2. Magnetization characteristics of D.C. Shunt generator.
3. Speed control of DC motor.
4. Swinburne‘s Test on DC shunt machine.
5. Brake test on DC shunt motor.
6. OC and SC tests on Single-phase transformer.
7. Brake test on 3-phase Induction motor.
8. Regulation by an alternator by synchronous impedance method.
PART B:
1. PN Junction Diode Characteristics (Forward bias, Reverse bias)
2. Transistor CE Characteristics (Input and Output)
3. Study of CRO.
4. Class A Power Amplifier
5. Zener Diode Characteristics
6. Transistor CE Characteristics
7. Rectifier without Filters (Full wave & Half wave)
8. Rectifier with Filters (Full wave & Half wave).
Course Outcomes
On completion of the course, students will be able to
L T P C
0 0 3 2
Objectives
To write and execute programs in C++ to solve problems using data
structures such as arrays, linked lists, stacks, queues, trees, graphs,
hash tables and search trees.
To make the student learn an object oriented way of solving
problems.
To make the student write ADTS for all data structures.
Week 1
a) Write a program to find the sum of given non-negative integer numbers
using a recursive function.
b) Write a program to find the factorial of the given number using the
recursive function.
c) Write a function in C++ to generate a Fibonacci series of n numbers,
where n is defined by a programmer.
Week 2
a) Write a C++ Program to demonstrate parameter passing methods.
b) Write a program in C++ to solve a general quadratic
equation.ax2+bx+c=0;
Week 3
Write a C++ program to perform the following
a) Matrix Addition
b) Matrix Subtraction
c) Matrix Multiplication
d) Transpose of a Matrix.
Week 4
a) Write a C++ Program to demonstrate function overloading.
b) Write a C++ Program to demonstrate overloading the following operators.
i. Arrow operator
ii. Function call operator
iii. Insertion Operator(<<)
iv. Extraction Operator(>>)
Week 5
Write a program to perform the following arithmetic operations on
complex numbers using a class.
a. addition of two complex numbers
b. substation of two complex numbers
c. Multiplication of tow complex numbers
d. Division of tow complex numbers.
Week 6
a) Write a C++ Program to demonstrate template functions.
b) Write a C++ Program to demonstrate template class
Week 7
a) Write a C++ program to implement the following
i. Single inheritance
ii. Multiple inheritances
iii. Multi-Level inheritance
iv. Hybrid-inheritance.
b) Write a C++ program to demonstrate constructor and destructor calling
sequence.
Week 8
Write a C++ program to demonstrate the usage of C++ Exception Handling
mechanism.
Week 9
Write a C++ program to demonstrate runtime polymorphism
Week 10
Write a C++ program to demonstrate following
a. This pointer
b. Static data member
c. Static member function.
CMR College of Engineering & Technology Page 104
B.Tech(CSE) R-15
Week 11
Write a C++ program to demonstrate the following
a. Friend function
b. Friend member function
c. Friend class
Week 12
Implement stack and queue data structures using templates.
.
Textbooks
1. Data Structures A Pseudo code Approach with C++ , Indian edition,
R.F.Gilberg and B.A.Forouzan, Cengage Learning.
2. Programming Principles and Practice using C++, B.Stroustrup,
Addition-Wiesly (Pearson Education).
3. Data Structures and STL, W.J.Collins, Mc Graw Hill International
edition.
4. Data Structures and algorithms with OODesign patterns in C++,
B.R.Priess, John Wiley
Course Outcomes:
On completion of the course, students will be able to
IV SEMESTER
Objectives
The Students will learn the following
To understand object oriented programming concepts and
applications in problem solving
Learn the Java programming language: its syntax, idioms,
patterns, and styles.
To learn the basics of Java console and GUI based programs
Introduce event driven Graphical User Interface (GUI)
programming
Unit I:
Java Programming: History of Java, Comments, Data Types, Variables,
Constants, Scope and Life Time of Variables, Operators, Hierarchy
Expressions, Type Conversions and Casting, Enumerated Types, Control for
Block Scope, Conditional Statements, Loops, Break and Continue
Statements, Simple Java Standalone Programs, Arrays, Console Input and
Output, Formatting Output, Constructors, Methods, Parameter Passing, Static
Fields and Methods, Access Controls, This Reference, Overloading Methods
and Constructors, Recursions, Garbage Collections, Building Strings,
Exploring Strings Class.
Unit II:
Inheritance: Inheritance Hierarchies Super And Sub Classes, Member
Access Rules, Super Keyword, And Preventing Inheritance: Final Classes
And Methods, The Object Class and Its Methods.
Polymorphism: Dynamic Binding, Method Overloading, Abstract Classes
and Methods.
Interface: Interface vs. Abstract Classes, Defining an Interface,
Implementing Interfaces, Accessing Implementations Through Interfaces
References, Extending Interface.
Inner Classes: Use 0f Inner Classes, Local Inner Classes, Anonymous Inner
Classes, Static Inner Classes, Example.
Packages: Defining, Creating and Accessing a Package, Understanding
Class path, Importing Packages
Unit III:
Exception Handling: Dealing With Errors, Benefits of Exception Handling,
The Classification of Exceptions, Exception Hierarchy, Checked Exceptions
And Unchecked Exception, Usage of Try , Catch, Throw, Throws, and
Finally, Re-Throwing Exceptions, Exception Specification, Built in
Exceptions, Creating Own Exception Sub Classes.
Multithreading: Difference Between Multiple Processes and Multiple
Threads, Thread States, Creating Threads, Interrupting Threads, Thread
Priorities, Synchronizing Threads, Inter-Thread Communication, Producer
Consumer Pattern.
Unit IV:
Collection Framework in Java: Introduction to Java Collections, Overview
of Java Collection Frame Work, Generics, Commonly used Collection
Classes-Array List, Vector, Hash Table, Stack, Enumeration, Iterator, String
Tokenizer, Random, Scanner, Calendar and Properties.
Files: Streams-Byte Streams, Character Streams, Text Input /Output , Binary
Input/Output, Random Access File Operations, File Management using File
Class.
Connecting to Database: JDBC Type I To IV Drivers, Connecting to a
Database, Querying a Database and Processing The Results, Updating Data
With JDBC.
Unit V:
GUI Programming with Java: The AWT Class Hierarchy, Introduction to
Swing, Swing vs. AWT, Hierarchy for Swing Components, Containers-
JFrame, JApplet, JDialog, JPanel, Overview of Some Swing Components,
JButton, JLabel, JTextfield, JTextarea, Simple Swing Applications, Layout
Management- Layout Manager Types- Border Grid and Flow.
Textbooks
1. Java Fundamentals: A Comprehensive Introduction, Herbert Schildt and
Dale Skrien, TMH.
References
1. Java for Programming, P.J.Dietel Pearson Education
2. Object Oriented Programming through Java, P.Radha Krishna, and
Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education
4. Programming in Java, S.Malhotra and S.Choudhary, Oxford University
Press
Course Outcomes
Upon the successful completion of the course, the student will be able:
1. Explain OOP concepts and basics of java programming (Console and
GUI Based)
2. Apply OOP and java Programming in problem solving.
3. Explain development of JAVA applets vs. JAVA applications.
4. Demonstrate the use of various system libraries.
Course Objectives
To learn functions of many random variables.
Correlation expresses a relation between two set of variables.
To test some hypothesis about parent population from which the
sample is drawn.
Learn about small samples and correlation regression.
Learn about Queuing theory.
Text Books
1. Advanced Engineering Mathematics by R.K. Jain & S.R.K. Iyengar,
3rd edition, Narosa Publishing House, Delhi.
2. Fundamentals of Mathematical Statistics by S.C.Gupta& VK Kapoor,
11th Edition, Sultan Chand & Sons.
References
1. Probability & Statistics, T. K. V. Iyengar, B. Krishna Gandhi and
Others, 2014 Yr Edition S. Chand.
2. Probability & Statistics, D. K. Murugeson& P. Guru Swamy, Anuradha
Publishers
3. Probability & Statistics for engineers by G.S.S. BhismaRao, Scitech
publications.
4. Probability & Statistics, by William Mendenhall & others Cengage
publications.
5. Higher engineering mathematics by B S Grewal, Khanna pub.
6. A first course in probability & statistics by BL.S.Prakasarao. 1 st
Edition, World scientific. Publishing Co. P. Ltd.
7. Probability & Statistics for Engineers, Miller and John E. Freund,
Prentice Hall of India.
Course Outcomes:
Objectives:
To understand the basic concepts and the applications of database
systems.
To master the basics of SQL and construct queries using SQL.
To understand the relational database design principles.
To become familiar with the basic issues of transaction processing and
concurrently control.
To become familiar with database storage structures and access
technologies.
Unit I:
Introduction: Data base System Applications, Purpose of Database Systems,
View of Data – Data Abstraction –Instances and Schemas – data Models –
the ER Model – Relational Model – Other Models – Database Languages –
DDL – DML – database Access for applications Programs – data base Users
and Administrator, History of data base systems
Unit II:
Relational Algebra & Calculus– Selection and projection set operations –
renaming – Joins – Division – Examples of Algebra overviews – Relational
calculus – Tuple relational Calculus – Domain relational calculus –
Expressive Power of Algebra and calculus.
Unit III:
Introduction to Schema Refinement – Problems Caused by redundancy,
Decompositions – Problem related to decomposition, Functional
Dependencies - Reasoning about FDS, Normal Forms – FIRST,SECOND,
THIRD Normal forms – BCNF –Properties of Decompositions- Loss less-
join Decomposition, Dependency preserving Decomposition, Schema
Refinement in Data base Design – Multi valued Dependencies – FOURTH
Normal Form, Join Dependencies, FIFTH Normal form, Inclusion
Dependencies.
Unit IV:
Transaction management Transaction Concept- Transaction State-
Implementation of Atomicity and Durability – Concurrent – Executions –
Serializability- Recoverability – Implementation of Isolation – Testing for
serializability.
Unit V:
Overview of Storage and Indexing: Data on External Storage, File
Organization and Indexing – Clustered Indexes, Primary and Secondary
Indexes, Index data Structures – Hash Based Indexing, Tree based Indexing,
Comparison of File Organizations. Storing data: Disks and Files: -The
Memory Hierarchy – Redundant Arrays of Independent Disks.
Textbooks:
1. Data base Management Systems, Raghu Ramakrishnan, Johannes
Gehrke, TMH, 3rd Edition, 2003.
2. Data base System Concepts, A. Silberschatz, H.F. Korth, S.Sudarshan,
McGraw hill, VI edition, 2006.
3. Fundamentals of Database Systems 5th edition, Ramez Elmasri,
Shamkant B. Navathe, Pearson Education, 2008.
References:
1. Database Management System Oracle SQL and PL/SQL, P.K.Das
Gupta, PHI.
2. Database System Concepts, Peter Rob & Carlos Coronel, Cengage
Learning, 2008.
3. Database Systems, A Practical approach to Design Implementation and
Management Fourth edition, Thomas Connolly, Carolyn Begg, Pearson
education.
4. Database- Principles, Programming, and Performance, P.O‘Neil,
E.O‘Neil, 2nd Edition Elesevier
5. Fundamentals of Relational Database Management Systems, S. Sumathi,
S. Esakkirajan, Springer.
6. Introduction to Database Management, M.L. Gillenson and others,
Wiley Student Edition.
7. Database Development and Management, Lee Chao, Auerbach
publications, Taylor & Francis Group.
8. Introduction to Database Systems, C.J.Date, Pearson Education.
Course Outcomes:
On completion of the course, students will be able to
(A2508)COMPUTER ORGANIZATION
B. Tech(CSE) IV Semester
L T P C
3 1 0 3
Course Objectives
To understand basic components of computers
To explore the I/O organizations in depth
To explore the memory organization
To understand the basic chip design and organization of 8086 with
assembly language programming
Unit I
Basic Computer Organization – Functions of CPU, I/O Units, Memory
Instructions : Instruction formats- one address, two addresses, zero
addresses and three addresses and comparison: addressing modes with
numeric examples: Program Control – status bit conditions, conditional
branches instructions, Program Interrupts: Types of Interrupts.
Unit II
Input-Output Organizations - I/O Interface, I/O Bus & Interface
Modules: I/O Vs Memory Bus, Isolated Vs Memory Mapped I/O,
Asynchronous data Transfer- Stobe Control, Hand Shaking: Asynchronous
Serial Transfer- Asynchronous Communication Interface, Modes of Transfer
Programmed I/O, Interrupt Initiated I/O , DMA Controller, DMA Transfer,
IOP-CPU-ICP Communication, Intel 8089 IOP
Unit III
Memory Organizations: Memory hierarchy, Main Memory, RAM,ROM
Chips, Memory Address Map. Memory Connection to CPU, Associate
Memory, Cache Memory, data Cache Instruction Cache, Miss & Hit Ratio,
Access time, Associative, Set Associative, Mapping, Waiting into Cache
Introduction to Virtual Memory
Unit IV
8086 CPU Pin Diagram Special functions of general purpose registers,
Segment Registers, concept of pipelining, 8086 flag registers, Addressing
Modes of 8086
Unit V
8086 Instruction formats: Assembly language programs involving branch
and call instructions sorting, evaluation of arithmetic expressions.
Text Books
1. Computer Systems Architecture – M.Moris Mano, (UNIT-1,2,3)
2. Advanced micro Processors & peripherals Hall/AK Ray (unit-4,5)
References
1. Computer Organization and Architecture – William Stallings Sixth
Edition, Pearson/PHI
2. Structured Computer Organization – Andrew S. Tanenbaum, 4th
Edition PHI/Pearson
3. Fundamentals or Computer Organization and Design, - Sivaraama
Dandamudi Springer Int. Edition.
4. Computer Architecture a quantitative approach, John L. Hennessy and
David A. Patterson, Fourth Edition Elsevier
5. Computer Architecture: Fundamentals and principles of Computer
Design, Joseph D. Dumas II, BS Publication.
Course Outcomes
On completion of the course students will be able to
1. Describe CPU functions and classify Instruction formats and different
modes of addressing
2. Describe data transfer methods and Illustrates different I/O
Communication techniques
3. Compare main memory and auxiliary memory and illustrates cache and
virtual memory
4. Describes various parallel processing methods and compare different
pipelining techniques
5. Explain vector processing, describes supercomputers and array
Course Objectives:
The purpose of this course is to acquaint the student with an overview of the
theoretical foundations of computer science from the perspective of formal
languages.
Classify machines by their power to recognize languages.
Employ finite state machines to solve problems in computing.
Explain deterministic and non-deterministic machines.
Comprehend the hierarchy of problems arising in the computer
sciences.
Unit I:
Fundamentals: Strings, Alphabet, Language, Operations, Finite state
machine, definitions, finite automaton model, acceptance of strings, and
languages, deterministic finite automaton and non deterministic finite
automaton, transition diagrams and Language recognizers.
Unit II:
Regular Languages: Regular sets, regular expressions, identity rules,
Constructing finite Automata for a given regular expressions, Conversion of
Finite Automata to Regular expressions. Pumping lemma of regular sets,
closure properties of regular sets(proofs not required)
Unit III:
Context Free Grammars: Ambiguity in context free grammars.
Minimization of Context Free Grammars. Chomsky normal form, Greiback
normal form, Pumping Lemma for Context Free Languages. Enumeration of
properties of CFL (proofs omitted).
Push down Automata: Push down automata, definition, model, acceptance
of CFL, Acceptance by final state and acceptance by empty state and its
equivalence. Equivalence of CFL and PDA, interconversion. (Proofs not
required). Introduction to DCFL and DPDA.
Unit IV:
Turing Machine: Turing Machine, definition, model, design of TM,
Computable functions, recursively enumerable languages. Church‘s
hypothesis, counter machine, types of Turing machines (proofs not required).
Linear bounded automata & Context Sensitive Language.
Unit V:
Computability Theory: Chomsky hierarchy of languages, linear bounded
automata and context sensitive language, LR(0) grammar, decidability of,
problems, Universal Turing Machine, undecidability of posts.
Correspondence problem, Turing reducibility, Definition of P and NP
problems, NP complete and NP hard problems.
Text Books
1. ―Introduction to Automata Theory Languages and Computation‖.
Hopcroft H.E. and Ullman J. D. Pearson Education.
2. Introduction to Theory of Computation - Sipser 2nd edition Thomson
Reference Books
1. Introduction to Formal Languages Automata Theory & Computation
kamala krithivasan Rama
2. Introduction to languages and the Theory of Computation ,John C
Martin, TMH
3. Theory of Computer Science and Automata languages and computation -
Mishra and Chandrashekaran, 2nd edition, PHI
4. Theory of Computation: A problem Solving Approach Kavi Mahesh
Wiley India Pvt Ltd
Course Outcomes:
On completion of the course, students will be able to
1. Explain the basic concepts of formal languages of finite automata
techniques.
2. Solve regular expressions and various problems to minimize FA.
3. Apply various languages to construct context free grammar.
4. Solve various problems of applying normal form techniques, Push down
automata and Turing Machines.
B. Tech(CSE) IV Semester
L T P C
4 0 0 4
Objectives:
To analyze performance of algorithms.
To choose the appropriate data structure and algorithm design method
for a specified application.
To understand how the choice of data structures and algorithm design
methods impacts the performance of programs.
To solve problems using algorithm design methods such as the greedy
method, divide and conquer , dynamic programming, backtracking and
branch and bound.
Prerequisites(subjects) Data structures , Mathematical foundations of
computer science.
Unit I
Introduction: Algorithm,pseudo code for expressing algorithms,
Performance Analysis: Space and Time Complexity, Asymptotic Notation:
BigOh Notation, Omega Notation, Theta Notation, Littleoh and Littleomega
Notation, Randomized Algorithms, Amortized Analysis.
Unit II
Searching & Traversal Techniques: Efficient Non recursive binary tree
traversal algorithms, Heap Sort, Disjoint set operations ,union & find
algorithms, spanning trees, Graph Traversals-Breadth first search and Depth
first search, AND/OR graphs, game trees, Connected Components, Bi-
Connected Components.
Unit III
Greedy Method: GeneralMethod, applications-Job sequencing with
deadlines, Knapsack problem, Minimum Cost Spanning Trees, Single Source
Shortest Path Problem, and Optimal Storage on tapes, Optimal merge
patterns.
Unit-IV
Backtracking: General method, applications-n-queen problem, sum of
subsets problem, graph coloring, Hamiltonian Cycles. Branch and Bound:
General method, applications-Traveling sales person problem,0/1 knapsack
problem-LC Branch and Bound solution, FIFO Branch and Bound solution.
Unit-V
NP-Hard and NP_Complete Problems: Basic Concepts, Non-Deterministic
algorithms, NP-Hard and NP-Complete Classes, NP-Hard problems, Cooke‘s
theorem.
Text Books
1: Fundamentals of Computer Algorithms,2nd Edition, Ellis Horowitz,
Satraj Sahani and S.Rajasekharan, Universities Press,2008.
2: Foundations of Algorithms,4th edition, R Neapolitan and
K.Naimipour,Jones and Barlett Learning.
3: Design and Analysis of Algorithms, P.H.Dave, H.B.Dave Pearson
Education,2008.
References Books
1: Computer Algorithms, Introduction to Design and analysis,3rd
Edition,Sara Baase, Allen, Van Gelder, Pearson Education.
2. Algorithm Design: Foundations , Analysis and Internet Examples, M.T.
Goodrich and R. Tomassia, John Wiley and Sons.
3. Fundamentals of Sequentuials and Paralle Algorithms, K.A.Berman
and J.L Paul, Cenage learning.
4. Introduction to the Design and Analysis of Algorithms, A.Levitin,
Pearson Education.
5. Introduction to Algorithms,3rd Edition, T.H Cormen,C.E.Leiserson, Rl.
Rivest,and C.Stein,PHI Pvt Ltd.
6. Design and Analysis of Algorithms, Aho, Ullman and Hopcroft
,Pearson Education,2004.
Course Outcomes
On completion of the course students will be able to
Textbooks
1. Oracle PL/SQL by Example, Benjamin Rosenzweig, Elena Silvestrova,
Pearson Education 3rd Edition
2. Oracle Database LogG PL/SQL Programming, Scott Urman, Tata Mc-
Graw Hill.
3. SQL and PL/SQL for Oracle 10g, Black Book, Dr .P.S. Deshpande.
Course Outcomes
After the completion of the course, the students would be able to:
B. Tech(CSE) IV Semester
L T P C
0 0 3 2
Objectives:
To make the student learn an object oriented way of solving problems.
To teach the student to write programs in Java to solve the problems
To introduce java compiler and eclipse platform
To import hand on experience with java programming
Note:
Use Linux and MySQL for the Lab experiments. through not
mandatory, encourage the use of Eclipse platform
The list suggests the minimum program set. Hence, the concerned
staff is requested to add more problems to the list as needed.
1. Use Eclipse or Netbean platform and acquaint with the various menus.
Create a test project, add a test 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 to 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 digits and for the +,-,*,/,% Operations. Add a
text field to display the results. Handle any possible exceptions like
divided by zero.
6. Write a java program that connects to a data base using JDBC and does
add, delete , modify and retrieve operations.
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‖ o ―ready‖ or
―Go‖ should appear above the buttons in selected color Initially, there is
no message shown.
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 a
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 or phone number as
input and prints the corresponding other value from the hash table (hint :
use hash tables).
12. Implement the above program with database instead of a text file.
13. Write a java program that takes tab separated data( one record per line)
from a text file and inserts them into a database.
14. Write a java program that prints the meta-data of a given table.
Textbooks
1. Java Fundamentals- A Comprehensive introduction, Herbert schildt and
Dale skrien, TMH.
References
1. Java for programming, P.J.Dietel Pearson education (OR) Java: How to
Program P.J.Dietel and H.M.Dietel, PHI
2. Object Oriented Programming through java, P.Radha Krishna,
Universities Press.
3. Thinking in Java, Bruce Eckel, Pearson Education
4. Programming in Java, S.Malhotra and S.Choudhary, Oxford University
Press.
Course Outcomes
On completion of the course, students will be able to
1. Implement simple java application using OOPs concept.
2. Implement simple java applications using overriding and overloading
concepts
3. Develop multithreaded application with exception handling
4. Develop simple java applications using java Collection API, File
Streams.
5. Develop Component based applications(AWT, Swings).
6. Implement a simple JDBC application using java jdbc API.
LT P C
0 0 3 2
Unit-I:
UNDERSTANDING GENDER:
Gender: Why Should We Study It? (Towards a World of Equals: Unit-1)
Socialization: Making Women, Making Men (?(Towards a World of
Equals: Unit-2)
Introduction. Preparing for Womanhood. Growing up Male. First lessons in
Caste. Different Masculinities.
Just Relationships: Being Together as equals(Towards a World of Equals:
Unit-12)
Mary Kom and Onler. Love and Acid just do not Mix Love Letters. Mothers
and fathers. Further Reading: Rosa Parks -The Brave Heart.
UNIT-II:
GENDER AND BIOLOGY:
Missing Women: Sex Selection and its Consequences (Towards a World
of Equals: Unit-4)
Declining Sex Ratio. Demographic Consequences.
Gender Spectrum: Beyond the Binary(Towards a World of Equals:
Unit-10)
Two or Many? Struggles with Discrimination.
Additional Reading: Our Bodies, Our Health(Towards a World of
Equals: Unit-13)
Unit-III:
GENDER AND LABOUR:
Housework: the Invisible Labour (Towards a World of Equals: Unit-3)
―My Mother doesn‘t Work‖ ―Share the Load‖
Women‟s Work: Its Politics and Economics(Towards a World of
Equals: Unit-7)
Fact and Fiction. Unrecognized Unaccounted work. Further Reading: Wages
and Conditions of Work.
Unit-IV:
ISSUES OF VIOLENCE:
Sexual Harassment: Say No! (Towards a World of Equals: Unit-6)
Sexual Harassment, not Eve- teasing-Coping with Everyday Harassment -
Further Reading.‖Chupulu‖
Domestic Violence: Speaking Out(Towards a World of Equals: Unit-8)
Is Home a Safe Place?-When Women Unite Film]. Rebuilding Lives. Further
Reading: New Forums for Justice.
Thinking About Sexual Violence (Towards a World of Equals: Unit-11)
CMR College of Engineering & Technology Page 130
B.Tech(CSE) R-15
Blaming the Victim- ―I Fought for my Life......‖ - Further Reading: The Face
of Violence.
Unit-V:
GENDER STUDIES:
Knowledge: Through the Lens of gender! (Towards a World of Equals:
Unit-5)
Point of view. Gender and the Structure of Knowledge. Further Reading:
Unacknowledge Women Artists of Telangana.
Whose History? Questions for Historians and Other! (Towards a World
of Equals: Unit-9)
Reclaiming a Past. Writing other Histories. Further Reading: Missing Pages
from Modern Telangana History.
Reference Books:
1. Sen., Amartya.‖More Than One Million Women Are Missing‖ New
York Review of Books 37.20(20December 1990). Print. ‘we Were
Making History.....‘Life Stories of Women in the Telangana People‘s
Struggle. New Delhi: Kali for Women,1989.
2. Tripti Lahiri.‖By the Numbers :Where Indian Women Work‖
Women‘s Studies Journals(14Novenber2012)Available Online at:
http//blogs.wsj.com/India real time/2012/11/14/by-the numbers-Where-
Indan-Women work/
3. K. Satyanarayana and Susie Tharu (Ed) Steel Nibs Are Sprouting: New
Dalit Writing From South India, Dossier2: Telugu And Kannada
http//harpercollins.co.in/BookDetail.asp?book code=3732
4. Vimala.‖ Vantillu(The Kitchen)‖. Women Writing in India: 600 BC to
the present Volume II: The 20thCentury.Ed Susie Thuru and K.
Lalita.Delhi‖ Oxford University press, 1995. 599-601.
V SEMESTER
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Objectives:
To introduce the fundamental various of computer networks.
To determine the TCP/IP and OSI models with merits and demerits.
To explore the various layers of OSI Model
To introduce UDP and TCP Models.
Unit I:
Introduction: Protocol, Networks, Layering Scenario, TCP/IP Protocol,
Protocol Suite: The OSI Model, Internet History Standards and
administration; Comparison of the OSI and TCP/IP Reference Model.
Physical Layer: Data Transmission- Guided Transmission media, Wireless
Transmission media.
Data Link Layer: Design Issues, CRC Codes, Elementary Data Link Layer
Protocols, Sliding Window Protocol.
Unit III: Network Layer: Design Issues, Store and Forward Packet
Switching, Connection less and Connection Oriented networks, Routing
Algorithms-Optimality principle, Shortest Path, Flooding, Distance Vector
routing, Count to Infinity Problem, Hierarchical routing, Congestion Control
Algorithms, Admission control.
Text books:
1. Computer Networks — Andrew S Tanenbaum, 4th Edition. Pearson
Education/PHI
2. William Stallings, Data and Computer Communication, 8 th Edition,
Pearson Education, Asia-2004
References:
1. Data Communications and Networking – Behrouz A. Forouzan.Third
Edition TMH.
Course Outcomes:
On completion of the course, students will be able to
1. Explain the basic terminology in networking and compare the OSI and
TCP/IP reference models.
2. Analyze the error-detection and correction methods in data link layer
3. Apply the routing algorithms to find shortest paths for network-layer
packet delivery.
4. Implement the Connection-Oriented and Connection-Less services in
Transport Layer
5. Implement the application layer protocols like http, ftp, telnet and ssh.
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Objectives:
To briefly describe various programming paradigms.
To provide conceptual understanding of High level language design
and implementation.
To introduce the power of scripting languages.
Unit I
Preliminary Concepts: Reasons for studying, concepts of programming
languages, Programming domains, Language Evaluation Criteria, influences
on Language design, Language categories, Programming Paradigms –
Imperative, Object Oriented, functional Programming , Logic Programming.
Programming Language Implementation – Compilation and Virtual
Machines, programming environments. Syntax and Semantics: general
Problem of describing Syntax and Semantics, formal methods of describing
syntax - BNF, EBNF for common programming languages features, parse
trees, ambiguous grammars, attribute grammars, denotational semantics and
axiomatic semantics for common programming language features.
Unit II
Data types: Introduction, primitive, character, user defined, array,
associative, record, union, pointer and reference types, design and
implementation uses related to these types. Names, Variable, concept of
binding, type checking, strong typing, type compatibility, named constants,
variable initialization. Expressions and Statements: Arithmetic relational and
Boolean expressions, Short circuit evaluation mixed mode assignment,
Assignment Statements, Control Structures – Statement Level, Compound
Statements, Selection, Iteration, Unconditional Statements, guarded
commands.
Unit III
Subprograms and Blocks: Fundamentals of sub-programs, Scope of life time
of varaibles, static and dynamic scope, design issues of subprograms and
Unit IV
Abstract Data types: Abstractions and encapsulation, introductions to data
abstraction, design issues, language examples, C++ parameterized ADT,
object oriented programming in small talk, C++, Java, C#, Ada 95
Concurrency: Subprogram level concurrency, semaphores, monitors,
massage passing, Java threads, C# threads.
Exception handling: Exceptions, exception Propagation, Exception handler
in Ada, C++ and Java.
Logic Programming Language: Introduction and overview of logic
programming, basic elements of prolog, application of logic programming.
Unit V
Functional Programming Languages: Introduction, fundamentals of FPL,
LISP, ML, Haskell, application of Functional Programming Languages and
comparison of functional and imperative Languages.
Scripting Language: Pragmatics, Key Concepts, Case Study: Python- Values
and Types, Variables, Storage and Control, Bindings and Scope, Procedural
Absraction, Separate Compilation, Module Library.
Text Books:
1. Concepts of Programming Languages Robert .W. Sebesta 8/e, Pearson
Education, 2008.
2. Programming Language Design Concepts, D. A. Watt, Wiley dreamtech,
rp-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.
3. LISP Patric Henry Winston and Paul Horn Pearson Education.
4. Programming in Prolog, W. F. Clocksin & C. S. Mellish, 5th Edition,
Springer.
5. Programming Python, M. Lutz, 3rd Edition, O'reilly, SPD, rp-2007.
6. Core Python Programming, Chun, II Edition, Pearson Education, 2007.
7. Guide to Programming with Python, Michel Dawson, Thomson, 2008
Course Outcomes:
On completion of the course, students will be able to
1. Ability to express syntax and semantics in formal notation.
2. Ability to apply suitable programming paradigm for the application.
3. Gain knowledge and comparison of the features programming
languages.
(Professional Elective-I)
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Unit I:
Introduction: Application areas of Computer Graphics, overview of
graphics systems, video-display devices and raster scan systems, random
scan systems, graphics monitors and work stations and input devices.
Output primitives: Points and lines, line drawing algorithms, mid-point
circle and ellipse algorithms. Filled area primitives: Scan line polygon fill
algorithm, boundary-fill and flood-fill algorithms.
Unit II:
2-D Geometrical transformations: Translation, scaling, rotation, reflection
and shear transformations, matrix representations and homogeneous
coordinates, composite transformations, transformations between coordinate
systems.
2-D Viewing: The viewing pipeline, viewing coordinate reference frame,
window to view-port coordinate transformation, viewing functions, Cohen-
Sutherland and Cyrus-beck line clipping 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.
3-D Geometrical transformations: Translation, scaling, rotation, reflection
and shear transformations, composite transformations, functions, modeling
and coordinate transformations.
3-D Viewing: Viewing pipeline, viewing coordinates, view volume and
general projection transformations and clipping.
Unit IV:
Visible surface detection methods: Classification, back-face detection,
depth-buffer, scan-line, depth sorting, BSP-tree methods, area sub-division
and octree methods.
Unit V:
Computer animation: Design of animation sequence, general computer
animation functions, computer animation languages, raster animation, key
frame systems, morphing, kinematics and dynamics, motion specifications.
Text books:
Reference books:
1. ―Computer Graphics Principles & practice‖, second edition in C, Foley,
Van Dam, Feiner and Hughes, Pearson Education.
2. Procedural elements for Computer Graphics, David F Rogers, Tata Mc
Graw hill, 2nd edition.
3. ―Principles of Interactive Computer Graphics‖, Neuman and Sproul,
TMH.
4. Principles of Computer Graphics, Shalini Govil, Pai, 2005, Springer.
5. Computer Graphics, Steven Harrington, TMH
6. Computer Graphics, F.S.Hill, S.M.Kelley, PHI.
7. Computer Graphics, P. Shirley, Steve Marscner & others, Cengage
Learning.
8. Computer Graphics & Animation , M.C. trivedi, Jaico Publishing
House.
9. An Integrated Introduction to Computer Graphics and Geometric
Modeling, R. Goldman, CRC Press, Taylor & Francis Group.
10. Computer Graphics, Rajesh K. Maurya, Wiley India.
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Course Objectives
Concisely define the following key terms: class, object, state, behavior,
object class, class diagram, object diagram, operation, encapsulation,
constructor operation, query operation, update operation, scope
operation, association, association role, multiplicity, association class,
abstract class, concrete class, class-scope attribute, abstract operation,
method, polymorphic, overriding, multiple classification, aggregation,
and composition.
Describe the activities in the different phases of the object-
oriented development life cycle. State the advantages of object-oriented
modeling vis-a-vis structured approaches.
Compare and contrast the object-oriented model with the E-R and EER
models.
Model a real-world application by using a UML class diagram.
Provide a snapshot of the detailed state of a system at a point in
time using a UML (Unified Modeling Language) object diagram.
Recognize when to use generalization, aggregation, and
composition relationships.
Specify different types of business rules in a class diagram.
Unit I:
Introduction to UML: Importance of modeling, principles of modeling,
object oriented modeling, conceptual model of the UML, Architecture and
Software Development Life Cycle
Unit II:
Basic Structural Modeling: Classes, Relationships, common Mechanisms
and diagrams.
Advanced Structural Modeling: Advanced classes, advanced relationships,
Interfaces, Types and Roles, Packages.
Class & Object Diagrams: Terms, concepts, modeling techniques for Class
& Object Diagrams.
Unit III:
Basic Behavioral Modeling-I: Interactions, Interaction diagrams.
Basic Behavioral Modeling-II: Use cases, Use case Diagrams,
Activity Diagrams.
Unit IV:
Advanced Behavioral Modeling: Events and Signals, Processes and
Threads, Time and Space, States, State Machines, State Chart Diagrams
Architectural Modeling: Component, Deployment, Component diagrams
and Deployment diagrams.
Unti V:
Patterns and Frameworks, UML notations, UML standard elements, rational
unified process
Case Study: The Unified library application, the ATM application ,Library
Application
Text Books
1. Grady Booch, James Rumbaugh, Ivar Jacobson : The Unified Modeling
Language User Guide, Pearson Education 2nd Edition
2. Hans-Erik Eriksson, Magnus Penker, Brian Lyons, David Fado: UML 2
Toolkit, WILEY-Dreamtech India Pvt. Ltd.
Reference Books
1. Meilir Page-Jones: Fundamentals of Object Oriented Design in
UML Pearson Education.
2. Pascal Rogues: Modeling Software Systems Using UML2, WILEY-
Dreamtech India Pvt. Ltd.
3. Atul Kahate: Object Oriented Analysis & Design, The McGraw Hill
Companies.
4. Mark Priestley: Practical Object-Oriented Design with UML, TMH.
5. Appling UML and Patterns: An introduction to Object — Oriented
6. Analysis and Design and Unified Process, Craig Larman, Pearson
Education.
7. Object-Oriented Analysis and Design with the Unified Process by John
W. Satzinger, Robert B Jackson and Stephen D Burd,
Cengage Learning.
Course Outcomes
On completion of the course, students will be able to
1. Take up the case studies and model in it.
2. Formulate views with respect user requirement such as use case,
logical, component and deployment and etc, and preparation of
document of the project for the unified Library application
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Objectives:
By the end of the course, you will know:
History and Structure of databases
How to design a database
How to convert the design into the appropriate tables
Handling Keys appropriately
Enforcing Integrity Constraints to keep the database consistent
Normalizing the tables to eliminate redundancies
Querying relational data
Optimizing and processing the queries
Storage Strategies for easy retrieval of data through index
Triggers, Procedures and Cursors, Transaction Management
Distributed databases management system concepts and
Implementation
Unit I
Database System Applications, Purpose of Database Systems, View of Data
–Data Abstraction, Instances and Schemas, Data Models –the ER Model,
Relational Model, Other Models –Database Languages –DDL,DML,
Database Access from Applications Programs, Transaction Management,
Data Storage and Querying, Database Architecture, Database Users and
Administrators, ER diagrams,. Relational Model: Introduction to the
Relational Model –Integrity Constraints Over Relations, Enforcing Integrity
constraints, Querying relational data, Logical data base Design, Introduction
to Views –Altering Tables and Views, Relational Algebra, Basic SQL
Queries, Nested Queries, Complex Integrity Constraints in SQL, Triggers
Unit II
Introduction to Schema Refinement –Problems Caused by redundancy,
Decompositions –Problem related to decomposition, Functional
Dependencies -Reasoning about FDS, Normal Forms – FIRST, SECOND,
THIRD Normal forms – BCNF – Properties of Decompositions - Loss less -
CMR College of Engineering & Technology Page 145
B.Tech(CSE) R-15
Unit III
Transaction Management: The ACID Properties, Transactions and
Schedules, Concurrent Execution
of Transactions – Lock Based Concurrency Control, Deadlocks –
Performance of Locking – Transaction Support in SQL. Concurrency
Control: Serializability, and recoverability – Introduction to Lock
Management – Lock Conversions, Dealing with Dead Locks, Specialized
Locking Techniques – Concurrency Control without Locking. Crash
recovery: Introduction to Crash recovery, Introduction to ARIES, the Log,
and Other Recovery related Structures, the Write - Ahead Log Protocol,
Check pointing, recovering from a System Crash, Media recovery
Unit IV
Overview of Storage and Indexing: Data on External Storage, File
Organization and Indexing – Clustered Indexes, Primary and Secondary
Indexes, Index data Structures – Hash Based Indexing, Tree based Indexing
Storing data: Disk s and Files: - The Memory Hierarchy – Redundant
Arrays of Independent Disks. Tree Structured Indexing: Intuitions for tree
Indexes, Indexed Sequential Access Methods (ISAM) B+ Trees: A Dynamic
Index Structure, Search, Insert, Delete. Hash Based Indexing: Static Hashing,
Extendable hashing, Linear Hashing, Extendable vs. Linear Hashing.
Unit V
Distributed databases: Introduction to distributed databases, Distributed
DBMS architectures, Storing data in a distributed DBMS, Distributed catalog
management, Distributed query processing Updating distributed data,
Distributed transactions, Distributed concurrency control, Distributed
recovery
Text books:
1. Data base Management Systems, Raghu Ramakrishnan, Johannes
Gehrke, TMH, 3 rd Edition, 2003.
2. Data base System Concepts, A.Silberschatz, H.F. Korth, S.Sudarshan,
McGraw hill, VI edition, 2006.
3. Fundamentals of Database Systems 5th edition. Ramez Elmasri,
Shamkant B.Navathe, Pearson Education, 2008.
Reference books:
1. Introduction to Database Systems, C.J. Date, Pearson Education.
2. Database Management System Oracle SQL and PL/SQL, P.K.Das
Gupta, PHI.
3. Database System Concepts, Peter Rob & Carlos Coronel, Cengage
Learning, 2008.
4. Database Systems, A Practical approach to Design Implementation and
Management Fourth edition, Thomas Connolly, Carolyn Begg,
Pearson education.
5. Database -Principles, Programming, andPerformance,
P.O‘Neil&E.O‘Neil, 2nd ed., ELSEVIER
6. Fundamentals of Relational Database Management Systems, S.Sumathi,
S.Esakkirajan, Springer.
7. Introduction to Database Management, M.L.Gillenson and others,
Wiley Student Edition.
8. Database Development and Management, Lee Chao, Auerbach
publications, Taylor & Francis Group.
9. Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe
Pelagatti, TMH.
10. Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick
Valduriez , Pearson Education, 2nd Edition.
11. Distributed Database Systems, Chhanda Ray, Pearson.
12. Distributed Database Management Systems, S.K.Rahimi and F.S.Haug,
Wiley.
Course Outcomes
On completion of the course, students will be able to
(Professional Elective-I)
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Objectives
You will gain an overview of Human-Computer Interaction (HCI),
with an understanding of user interface design in general, and
alternatives to traditional, keyboard and mouse‖ computing;
become familiar 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 begins with and maintains a focus on the user;
be familiar with a variety of both conventional and non-traditional
user interface paradigms, the latter including virtual and augmented
reality, mobile and wearable computing, and ubiquitous computing;
understand the social implications of technology and their ethical
responsibilities as engineers in the design of technological systems.
Finally, working in small groups on a product design from start to
finish will provide you with invaluable team-work experience.
Unit- I
Introduction: Importance of user Interface — definition, importance of good
design. Benefits of good design. 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 —
Unit- III
Windows — New and Navigation schemes selection of window, selection of
devices based and screen based controls. Components — text and messages,
Icons and increases — Multimedia, colors, uses problems, choosing colors.
Unit- IV
Software tools — Specification methods, interface — Building Tools.
Unit- V
Interaction Devices — Keyboard and function keys — pointing devices —
speech recognition digitization and generation — image and video displays
— drivers.
Text Books
1. The essential guide to user interface design, Wilbert 0 Galitz, Wiley
DreamTech.
2. Designing the user interface. 3rd Edition Ben Shneidermann, Pearson
Education Asia.
Reference Books
1. Human — Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd,
Abowd, Russell Bealg, Pearson Education
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.
Course Outcomes
On completion of the course, students will be able to
B.Tech(CSE): V Semester
L T P C
4 0 0 4
Unit – I:
Operating System Introduction: Operating System Objectives and
functions, Computer System Architecture, OS Structure, OS Operations,
Evaluation of operating Systems- Simple Batch, Multi programmed, Time-
shared, Personal Computer, Parallel, Distributed Systems, Real-Time
systems, Special Purpose systems, OS Services, User Os Interface, System
Calls, Types of System Calls, System Programs, Operating System Design
and Implementation, OS Structure, Virtual Machines.
Unit – II:
Process and CPU Scheduling – Process concepts-The Process, Process
State, Process Control Block, Threads, Process Scheduling-Scheduling
Queues, Schedulers, Context switch, Preemptive Scheduling, Dispatcher,
Scheduling Criteria, Scheduling algorithms, Multiple-Processor Scheduling,
Real –time Scheduling, Thread Scheduling, Case Studies: Linux, windows.
Process coordination–Process synchronization, The Critical Section
problem, Peterson‘s solution, Synchronization Hardware, Semaphores, and
Classic Problems of Synchronization, Monitors, Case Studies: Linux,
Android.
Unit – III:
Memory Management and Virtual memory – Logical & Physical Address
space, Swapping, Contiguous Allocation, Paging, Structure of Page Table,
Segmentation, Segmentation with Paging, Virtual memory, Demand paging,
Performance of Demand paging, Page Replacement, Page Replacement
Algorithms, Allocation of Frames, Thrashing.
Unit- IV:
File System Interface- The Concept of a File, Access methods, Directory
Structure, File System Mounting, File Sharing, Protection, File System
Implementation- File System Structure, Allocation methods, Free-space
Management, Directory Implementation, Efficiency and Performance.
Unit – V:
Deadlocks – System Model, Deadlock Characterization, Methods for
Handling Deadlocks, Deadlock Prevention, Deadlock Avoidance, Deadlock
Detection and Recovery from Deadlock.
Protection –System Protection, Goals of Protection, Principles of Protection,
Domain of Protection, Access Matrix, Implementation of Access Matrix,
Access Control, Revocation of Access Rights, Capability-Based Systems,
Language-Based Protection.
Text books:
1. Operating System Principles- Abraham Silberchatz, Peter B. Galvin,
Greg Gagne 8TH Edition, John Wiley.
2. Operating Systems – Internals and Design Principles, William Stallings,
Sixth Edition, Pearson education.
Reference books:
1. Modern Operating Systems, Andrew S Tanenbaum 3 rd edition
Pearson/PHI
2. Operating System A Design Approach-Crowley, TMH
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): V Semester
L T P C
4 0 0 4
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 Capability Maturity Model Integration (CMMI),
Process patterns, process assessment, personal and team process 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, pattern based software design.
Creating an architectural design : Software architecture, Data design,
Architectural styles and patterns, Architectural Design, Assessing alternative
architectural design, mapping data flow into a software architecture.
Modeling component level design: Designing class based components,
conducting component level design, Object constraint language, designing
conventional components.
Performing User interface design: Golden rules, User interface analysis
and design, interface analysis, interface design steps, Design evaluation.
Unit IV:
Testing Strategies: A strategic approach to software testing, test strategies
for conventional software, Black-Box and White-Box testing, Validation
testing, System testing, the art of Debugging.
CMR College of Engineering & Technology Page 153
B.Tech(CSE) R-15
Product metrics: Software Quality, Metrics for Analysis Model, Metrics for
Design Model, Metrics for source code, Metrics for testing, Metrics for
maintenance.
Metrics for Process and Products : Software Measurement, Metrics for
software quality.
Unit V:
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. McGraw Hill International Edition.
2. Software Engineering- Sommerville, 7th edition, Pearson education.
References:
1. Software Engineering, A Precise Approach, Pankaj Jalote,Wiley
India,2010.
2. Software Engineering: A Primer, Waman S Jawadekar, Tata McGraw
Hill, 2008.
3. Fundamentals of Software Engineering, Rajib Mall, PHI, 2005.
4. Software Engineering, Principles and Practices, Deepak Jain, Oxford
University Press.
5. Software Engineering 1: Abstracion and modelling, Diner Bjorner,
Springer International edition, 2006.
6. Software Engineering 2: Specification of systems and languages, Diner
Bjorner, Springer International edition, 2006.
7. Software Engineering Foundations, Yingxu Wang, Auerbach
Publications, 2008.
8. Software Engineering Principles and Practice, Hans Van Vliet, 3 rd
edition, John Wiley &Sons Ltd.
9. Software Engineering 3: Domains, Requirements, and Software Design,
D. Bjorner, Springer International Edition.
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): V Semester
L T P C
3 0 0 3
Objectives:
The students should be able to apply the principles of economics in
business decision making process, Demand analysis, Elasticity of
Demand and Demand forecasting.
Study cost concepts and Break Even Analysis.
Describe ―Business‖ and new economic environment and also the
capital and its significance and capital budgeting techniques.
Describe the accounting concepts and conventions and financial
statements to be prepared for any business.
Describe the accounting concepts and financial analysis through
ratios.
Unit I
Introduction & Demand Analysis: Definition, Nature and Scope of
Managerial Economics Demand Analysis: Demand Determinants, Law of
Demand and its exceptions. Elasticity of Demand: Definition, Types,
Measurement and Significance of Elasticity of Demand. Demand
Forecasting, Factors governing demand forecasting, methods of demand
forecasting (survey methods, statistical methods, expert opinion method, test
marketing, controlled experiments, judgmental approach to demand
forecasting)
Unit II
Theory of Production and Cost Analysis: Production Function Isoquants
and Is costs, MRTS, Least Cost Combination of Inputs, Cobb-Douglas
Production function, Laws of Returns, Internal and External Economies of
Scale. Cost Analysis: Cost concepts, Opportunity cost, fixed vs. Variable
costs, explicit costs Vs. Implicit costs, Out of pocket costs vs. Imputed costs.
Break-even Analysis (BEA)-Determination of Break-Even Point (simple
problems)- Managerial Significance and limitations of BEA.
Unit III
Introduction to Markets & New Economic Environment: Market
structures: Types of competition and Markets, Features of Perfect
competition, Monopoly and Monopolistic Competition. Price-Output
CMR College of Engineering & Technology Page 156
B.Tech(CSE) R-15
Unit IV
Capital and Capital Budgeting: Capital Budgeting: Capital and its
significance, Types of Capital, Estimation of Fixed and Working capital
requirements, Methods and sources of raising finance. Capital Budgeting:
Nature and scope of capital budgeting, features of capital budgeting
proposals, Methods of Capital Budgeting: Payback Method, Accounting Rate
of Return (ARR) and Net Present Value Method (simple problems)
Unit V
Introduction to Financial Accounting & Financial Analysis: Accounting
concepts and conventions-Introduction IFRS-Double-Entry Book Keeping,
Journal, Ledger, Trial Balance- Final Accounts (Trading Account, Profit and
Loss Account and Balance Sheet with simple adjustments). Financial
Analysis: Analysis and Interpretation of Liquidity Ratios, Activity Ratios,
and Capital structure Ratios and Profitability ratios.
Text books:
1) S.A Siddiqui & A. S. Siddiqui Managerial Economics & Financial
Analysis, New Age International Publishers, Hyderabad 2013 .
2) Varshney & Maheswari: Managerial Economics, Sultan Chand, 2009.
References:
1. Ambrish Gupta, Financial Accounting for Management, Pearson
Education, New Delhi.
2. H. Craig Peterson & W. CrisLewis, Managerial Economics, Person,
2012.
3. Lipsey & Chrystel, Economies, Oxford University Press,2012.
4. Dwivedi: Managerial Economics,Vikas2012.
5. Shailaja & Usha: MEFA, University Press,2012.
6. Aryasri: Managerial Economics & Financial Analysis, TMH,2012.
Course Outcomes
B.Tech(CSE): V Semester
L T P C
0 0 3 2
Introduction
The introduction of the English Language Lab is considered essential at 3rd
year level. At this stage the students need to prepare themselves for their
careers which may require them to listen to, read, speak and write in English
both for their professional and interpersonal communication in the globalised
context.
Course Objectives
This Lab focuses on using computer-aided multimedia instruction for
language development to meet the following targets:
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.
Syllabus
The following course content is prescribed for the Advanced Communication
Skills Lab:
1. Functional English
Starting a conversation, responding appropriately and relevantly, using
the right body language, Role play in Different Situations.
2. Vocabulary building
Synonyms and antonyms, word roots, one-word substitutes, prefixes and
suffixes, study of word origin, analogy, idioms and phrasal verbs.
3. Group Discussion
4. Interview Skills –
Concept and process, pre-interview planning, opening strategies,
answering strategies, Interview through tele and video- conferencing.
Minimum Requirement:
The English Language Lab shall have:
The Computer aided Language Lab for 60 students with 60 systems,
One master console, LAN facility and English language software for
self- study by learners.
The Communication Skills Lab with movable chairs and audio-
visual aids with a P.A System, a T. V., a digital stereo –audio &
video system and camcorder etc.
System Requirement (Hardware component):
Computer network with Lan with minimum 60 multimedia systems
with the following specifications:
P – IV Processor
d) Speed – 2.8 GHZ
e) RAM – 512 MB Minimum
f) Hard Disk – 80 GB
Headphones of High quality
Suggested Software:
The software consisting of the prescribed topics elaborated above should be
procured and used.
Course Outcomes
On completion of the course, students will be able to
1. Organise ideas relevantly and coherently.
2. Engage in debates.
3. Discuss in a group
4. Face interviews.
5. Write project/research reports/technical reports.
6. Make oral presentations.
7. Write formal letters.
8. Transfer information from non-verbal to verbal texts and vice versa.
9. To take part in social and professional communication.
B.Tech(CSE): V Semester
L T P C
0 0 3 2
Week_1:
Simulate the following CPU scheduling algorithms:
a) Round Robin
b) SJF
c) FCFS
d) Priority
Week_2:
Simulate the file allocation strategies:
a) Sequential b) Indexed c) Linked
Week_3:
Simulate MVT and MFT
Week_4
a) Simulate Bankers Algorithm for Deadlock Avoidance
b) Simulate Bankers algorithm for Deadlock Prevention
Week_5:
Simulate all page replacement Algorithms
a)FIFO b) LRU c) LFU
Week_6:
Simulate Paging Technique of memory management.
Week_7:
Implement the data link layer framing methods such as character, character
stuffing and bit stuffing.
Week_8:
Implement on a data set of characters the three CRC polynomials – CRC 12,
CRC 16 and CRC CCIP 15.
Week_9:
Week_10
Take an example subnet of hosts. Obtain broadcast tree for it.
Week_11
a) Take a 64 bit playing text and encrypt the same using DES
algorithm.
b) Write a program to break the above DES coding.
Week_12
Using RSA algorithm Encrypt a text data and Decrypt the same
CODE: A2576
L T P C
0 0 2 1
Week_1:
Create, Compile and Run 'Hello, Android' App
Week_2:
Review Activities, Intents, and Content Providers in Android
Week_3:
Create Application with onClick, onKeyDown, onFocusChanged Event
Handlers
Week_4
Create Application with Toast Notifications
Week_5:
Create Application with Android's Advanced User Interface Functions
Week_6:
Create Android Audio/Video Application
Week_7:
Create Application to Create, Modify and Query an SQLite Database
Week_8:
Create Application that Works with an Android Content Provider
Week_9:
Lab Exercise: Create application that performs Data Storage and Retrieval
from Android External Storage
Week_10
Create application with One-Time, Repeating Alarms, and Long -Running
Background Task as Service.
B.Tech(CSE): V Semester
L T P C
2 0 0 0
Quantitative Aptitude
Number System
LCM and HCF
Averages
Simple Equations
Ratios & Proportions
Partnerships
Percentages
Profit & Loss
Time & Work
Time & Distance
Simple and compound interest
Permutations & Combinations
Probability
Reference Books :
Course Outcomes:
On Completion of the course, students will be able to
VI SEMESTER
Unit I: Introduction
Web Essentials - Clients, Servers and Communication:
The Internet, Basic Internet Protocols: TCP/IP, UDP, DNS, The World Wide
Web: Hypertext Transport Protocol, HTTP Request Message, HTTP
Response Message, Web Clients, Web Servers. Markup Languages – HTML:
Basic Tags, Forms, Style sheets
Host Objects - Browsers and the DOM: Introduction to the Document Object
Model, Intrinsic Event Handling, Modifying Element Style, The Document
Tree, DOM Event Handling.
Text books:
1. WEB TECHNOLOGIES: A Computer Science Perspective, Jeffrey C.
Jackson, Pearson Education
References:
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
Course Outcomes:
On completion of the course, students will be able to
1. Outline the history of the web, and technologies that makes the web
pages and publishing them.
2. Create dynamic and interactive web pages using DHTML, Javascript.
3. Design the structure of web page, to store the data in web documents,
and transport information through web.
4. Design the software components to be reusable in a variety of different
environments and applications
5. Develop JSP application using Model-View-Control Architecture.
B.Tech(CSE): VI Semester
L T P C
3 1 0 3
Prerequisites
Objectives
1. Introduce the major concepts of language translation and compiler
design and impart the knowledge of practical skills necessary for
constructing a compiler.
2. Topics include phases of compiler, parsing, syntax directed
translation, type checking use of symbol tables, code optimization
techniques, intermediate code generation, code generation and data
flow analysis.
Unit 1
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 Lexical-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, Bottom-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 Syntax-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-
Unit IV
Run-Time Environments: Stack Allocation of Space, Access to Nonlocal
Data on the Stack, Heap Management, 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 Analysis, 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 Lam, Ravi Sethi, Jeffry D. Ullman.
References:
1. Lex & Yacc – John R. Levine, Tony Mason, Doug Brown, O‘reilly
2. Compiler Construction, Louden, Thomson.
Course Outcomes
On completion of the course, students will be able to
1. Outline the phases of compilation and generate tokens from the given
input. Solve the problems of Top Down parsing. Construct predictive
parsing table which is used to parse the given input using Top Down
approach.
2. Design LR and LALR parser. Recover Errors during parsing and
Handle the ambiguous grammar and generate an automatic parser.
3. Create a three address code. Convert the programming language
constructs into intermediate form and describe different storage
allocation methods for Symbol table.
4. Apply different optimization techniques. Analyze flow of data between
basic blocks of a flow graph.
5. Generate object code and explain different register allocation methods.
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
Study data warehouse principles and its working learn data mining
concepts understand association rules mining. Discuss classification
algorithms learn how data is grouped using clustering techniques
Unit I:
Data Warehousing: Introduction to Data warehouse, differences between
operational Database Systems and warehouses, Data Warehouse Architecture
and its components , Data Warehouse Characteristics, ETL, Multi
Dimensional data model, Schema Design-Star-Snowflake-Galaxy Schema,
Fact Table, Fully-Adictive, Semi-Adictive, Non-Adictive measures, Fact-
Less-Facts, Dimension Table characteristics, OLAP Cube and Operations,
OLAP Server Architecture-ROLAP,MOLAP,HOLAP.
Unit II:
Introduction to Data Mining: Introduction, What is data mining,
Definition, KDD, Challenges, Data Mining Tasks, Data Preprocessing-
Cleaning, Missing Data, Dimensionality Reduction, Feature Subset
Selection, Data transformation, Dicretization and Binaryzation, Measures of
Similarity and Dissimilarity-Basics.
Unit III:
Association Rule Mining: Problem Definition, Frequent Item Set
Generation, The APRIORI principle, Support and Confidence measure,
Association Rules Generation: Apriori Algorithm, The Partition Algorithms,
FP-Growth Algorithms, Compact Representation of Freqent Item Set-
Maximal and Closed Frequent Itemset.
Unit IV:
Classification : Problem definition, General approaches to solve
Classification problems, Evaluation of a Classifier , Classification
techniques, Decision Tree Decision tree construction, Methods for
Expressing attribute test condition, Measures for selecting the Best Split,
Algorithm for Decision tree Induction, Naive Bayes Classifiers , Bayesian
Belief Networks , K Nearest neighbor classification algorithm &
characteristics.
CMR College of Engineering & Technology Page 171
B.Tech(CSE) R-15
Unit V:
Cluster Analysis: Types of Data in Cluster Analysis, A Categorization of
Major Clustering Methods, Partitioning Methods, K-Means Clustering, K-
Means additional Issues, PAM Algorithm, Hierarchical Clustering-
Agglomerative methods and divisive methods, Basic Agglomerative
Hierarchical clustering algorithms, Specific techniques, Key issues in
Hierarchical Clustering, Strengths and Weekness, Outlier Detection.
Textbooks:
1. Data Mining – Concepts and Techniques - JIAWEI HAN &
MICHELINE KAMBER Harcourt India.
2. Introduction to Data Mining –Pang-Ning Tan,Michael Steinbach and
Vipin Kumar,Pearson Education
References:
1. Data Mining Techniques – Arun K Pujari, University Press.
2. Data Warehousing in the Real World – Sam Anahory & Dennis
Murray. Pearson Edn Asia.
3. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley Student
Edition.
Course Outcomes:
On completion of the course, students will be able to
(A2529) E-COMMERCE
(Professional Elective-II)
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
Identify the major categories and trends of e-commerce applications.
Identify the essential processes of an e-commerce system.
Identify several factors and web store requirements needed to succeed in
e-commerce.
Discuss the benefits and trade-offs of various e-commerce clicks and
bricks alternatives.
Understand the main technologies behind e-commerce systems and how
these technologies interact.
Discuss the various marketing strategies for an online business.
Define various electronic payment types and associated security risks
and the ways to protect against them.
Unit – I
Introduction, Electronic Commerce - Frame work, anatomy of E-Commerce
applications, e-Commerce Consumer applications, E-Commerce organization
applications. Introduction, Consumer Oriented Electronic commerce -
Mercantile Process models
Unit – II
Electronic payment systems - Digital Token-Based, Smart Cards, Credit
Cards, Risks in Electronic Payment systems. Inter Organizational Commerce
- EDI, EDI Implementation, Value added networks.
Unit-III
Intra Organizational Commerce - Work Flow, Automation Customization
and internal Commerce, Supply chain Management.
Unit –IV
Corporate Digital Library - Document Library, digital Document types,
corporate Data Warehouses. Advertising and Marketing - Information based
marketing, Advertising on Internet, on-line marketing process, market
research.
Unit – V
Consumer Search and Resource Discovery - Information search and
Retrieval, Commerce Catalogues, Information Filtering. Multimedia - key
multimedia concepts, Digital Video and electronic Commerce, Desktop
video processing‘s, Desktop video conferencing.
Text book:
1. Frontiers of electronic commerce – Kalakata, Whinston, Pearson.
References:
1. E-Commerce fundamentals and applications Hendry Chan, Raymond Lee,
Tharam Dillon, Ellizabeth Chang, John Wiley.
2. E-Commerce, S.Jaiswal – Galgotia.
3. E-Commerce, Efrain Turbon, Jae Lee, David King, H.Michael Chang.
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
Unit- I
Hacking windows -Network hacking-Web hacking- Password hacking. A
study on various attacks – Input validation attacks – SQL injection attacks –
Buffer overflow attacks – Privacy attacks
Unit- II
TCP / IP – Checksums – IP Spoofing port scanning, DNS Spoofing. Dos
attacks – SYN attacks, Smurf attacks, UDP flooding, DDOS – Models.
Firewalls – Packet filter firewalls, Packet Inspection firewalls – Application
Proxy Firewalls. Batch file Programming.
Unit -III
Fundamentals of Computer Fraud – Threat concepts – Framework for
predicting inside attacks – Managing the threat – Strategic Planning Process.
Unit -IV
Architecture strategies for computer fraud prevention – Protection of Web
sites – Intrusion detection system – NIDS, HIDS – Penetrating testing
process – Web Services– Reducing transaction risks
Unit -V
Linux Basics, Compile a Linux Kernel, GCC Compilation Commands,
Install Linux Kernel Modules, Linux Hardening Methods Penetration Testing
Methodologies Security Assessments, Penetration Testing Methodologies,
Text book:
1. Kenneth C.Brancik ―Insider Computer Fraud‖ Auerbach Publications
Taylor & Francis Group–2008.
2. Ankit Fadia ―Ethical Hacking‖ second edition Macmillan India Ltd,
2006
Reference books:
Course Outcomes
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
To introduce the student to the theory, algorithms, and methods that
underlie distributed database management systems.
The student should also acquire insight into distributed DBMS
architecture, query decomposition and data localization, transaction
management, and distributed concurrency control.
Unit- I
Features of Distributed versus Centralized Databases, Principles of
Distributed Databases, Levels Of Distribution Transparency, Reference
Architecture for Distributed Databases, Types of Data
Fragmentation, Integrity Constraints in Distributed Databases, Distributed
Database Design
Unit -II
Translation of Global Queries to Fragment Queries, Equivalence
transformations for Queries, Transforming Global Queries into Fragment
Queries, Distributed Grouping and Aggregate Function Evaluation,
Parametric Queries. Optimization of Access Strategies, A Framework for
Query Optimization, Join Queries, General Queries
Unit- III
The Management of Distributed Transactions, A Framework for Transaction
Management, Supporting Atomicity of Distributed Transactions,
Concurrency Control for Distributed Transactions, Architectural Aspects of
Distributed Transactions Concurrency Control,
Foundation of Distributed Concurrency Control, Distributed Deadlocks,
Concurrency Control based on Timestamps, Optimistic Methods for
Distributed Concurrency Control.
Unit -IV
Reliability, Basic Concepts, Nonblocking Commitment Protocols, Reliability
and concurrency Control, Determining a Consistent View of the Network,
Detection and Resolution of Inconsistency, Checkpoints and Cold Restart,
CMR College of Engineering & Technology Page 177
B.Tech(CSE) R-15
Unit -V
Architectural Issues, Alternative Client/Server Architectures, Cache
Consistency, Object Management, Object Identifier Management, Pointer
Swizzling, Object Migration, Distributed Object Storage, Object Query
Processing, Object Query Processor Architectures, Query Processing Issues,
Query Execution, Transaction Management, Transaction Management in
Object DBMSs, Transactions as Objects Database Integration, Scheme
Translation, Scheme Integration, Query Processing Query Processing Layers
in Distributed Multi- DBMSs, Query Optimization Issues Transaction
Management Transaction and Computation Model , Multi database
Concurrency Control, Multi database Recovery, Object Orientation and
Interoperability, Object Management Architecture CORBA and Database
interoperability, Distributed Component Object Model, COM/OLE and
Database Interoperability, PUSH- Based Technologies
Text books:
1. Distributed Databases Principles & Systems, Stefano Ceri, Giuseppe
Pelagatti, TMH.
2. Principles of Distributed Database Systems, M. Tamer Ozsu, Patrick
Valduriez , Pearson Education, 2nd Edition.
Reference books:
1. Distributed Database Systems, Chanda Ray, Pearson.
2. Distributed Database Management Systems, S.K. Rahimi and Frank. S.
Haug,Wiley.
Course Outcomes
On completion of the course, students will be able to
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Unit- I
Introduction: Definitions, The different forms of computing –
Monolithic, Distributed, Parallel and cooperative computing, the
meaning of Distributed computing, Examples of Distributed systems, the
strengths and weaknesses of Distributed computing, operating system
concepts relevant to distributed computing, Network basics, the
architecture of distributed applications, Inter process Communications, An
Archetypal IPC Program Interface, Event Synchronization, Timeouts and
Threading, Deadlocks and Timeouts, Data representation, Data
Encoding, Text-Based Protocols, Request-Response Protocols, Event
Diagram and Sequence Diagram, Connection-Oriented versus
Connectionless IPC, The Evolution of Paradigms for IPCs.
Unit -II
Distributed Computing Paradigms: Paradigms and Abstraction,
Paradigms for Distributed Applications: Message Passing Paradigm, The
Client - Server Paradigm, The peer – to - peer Paradigm, Message
system (or MOM) Paradigm, The point – to - point message model and the
publish/subscribe message model, RPC model, The Distributed Objects
Paradigms: RMI, ORB, the object space Paradigm, The Mobile Agent
Paradigm, the Network Services Paradigm, The collaborative
application ( Groupware Paradigm) ,choosing a Paradigm for an
application.
Unit -III
The Socket API: The Datagram Socket API, The Stream-Mode Socket API,
Client-Server Paradigm Issues, Connection-Oriented and
Connectionless Servers, Iterative and Concurrent Servers. Group
Communication: Unicasting versus Multicasting, Multicast API,
Connectionless versus Connection - Oriented Multicast, Reliable
Multicasting versus Unreliable Multicasting, The Java Basic Multicast
API.
Unit -IV
CMR College of Engineering & Technology Page 179
B.Tech(CSE) R-15
Unit -V
Distributed Object Paradigm(CORBA): The basic Architecture, The
CORBA object interface, Inter-ORB protocols, object servers and
object clients, CORBA object references, CORBA Naming Service and the
Interoperable Naming Service, CORBA
object services, object Adapters, Java IDL, An example CORBA
application.
Text books
1. Distributed Computing, Principles and Applications, M.L.Liu,
Pearson Education.
References
1. A Networking Approach to Grid Computing, D.Minoli, Wiley & sons.
2. Java Network Programming, Second Edition, E.R.Harold, O‗Reilly,
SPD.
3. Distributed Systems, Concepts and Design, Third Edition, G.Coulouris,
J.Dollimore and Tim Kindbirg, Pearson Education.
4. Java Programming with CORBA, Third E dition, Brose, Vogel, Duddy,
Wiley Dreamtech.
5. Client/Server Programming with Java and CORBA, Second Edition,
R.Orfali and Dan Harkey, John Wiley & sons.
Course Outcomes
On completion of the course, students will be able to
1. Describe and program the communication among processes at different
hosts to facilitate parallel and distributed computing.
2. Describe and distinguish synchronization and concurrency control for a
parallel or distributed computing system.
3. Evaluate the impact of network topology on parallel/distributed
algorithm formulations and traffic their performance.
4. Apply parallel and distributed algorithms in problem solving.
5. Discuss about the different communication operations and their benefits
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
The main goal of software development projects is to create a software
system with a predetermined functionality and quality in a given time frame
and with given costs. For achieving this goal, models are required for
determining target values and for continuously controlling these values. This
course focuses on principles, techniques, methods & tools for model-based
management of software projects, assurance of product quality and process
adherence (quality assurance), as well as experience-based creation &
improvement of models (process management ). The goals of the course can
be characterized as follows:
Understanding the specific roles within a software organization as
related to project and process management.
Understanding the basic infrastructure competences ( e.g., process
modeling and measurement ).
Understanding the basic steps of project planning, project management,
quality assurance and process management and their relationships.
Unit–I
Conventional Software Management: The waterfall model, conventional
software Management performance.
Evolution of Software Economics: Software Economics, pragmatic
software cost estimation.
Unit–II
Improving Software Economics: Reducing Software product size,
improving software processes, improving team effectiveness, improving
automation, achieving required quality, peer inspections.
The old way and the new: The principles of conventional software
Engineering, principles of modern software management, transitioning to an
iterative process.
Unit-III
Life cycle phases: Engineering and production stages, inception,
Elaboration, construction, transition phases.
Artifacts of the process: The artifact sets, Management artifacts,
Engineering artifacts, programmatic artifacts.
Model based software architectures: A Management perspective and
technical perspective.
Unit–IV
Work Flows of the process: Software process workflows, Inter trans
workflows.
Checkpoints of the process: Major mile stones, Minor Milestones, Periodic
status assessments.
Iterative Process Planning: Work breakdown structures, planning
guidelines, cost and schedule estimating, Interaction planning process,
Pragmatic planning.
Project Organizations and Responsibilities:
Line-of-Business Organizations, Project Organizations, evolution of
Organizations.
Process Automation: Automation Building blocks, The Project
Environment.
Unit–V
Project Control and Process instrumentation:
The server care Metrics, Management indicators, quality indicators, life cycle
expectations, pragmatic Software Metrics, Metrics automation.
Talloring the Process: Process discriminants, Example.
Future Software Project Management: Modern Project Profiles Next
generation. Software economics, modern process transitions.
Case Study: The command Center Processing and Display system-
Replacement (CCPDS-R).
Text books:
1. Software Project Management, Walker Royce: Pearson Education.
2. Software Project Management, Bob Hughes & Mike Cotterell, fourth
edition, Tata Mc-Graw Hill.
References:
1. Applied Software Project Management, Andrew Stellman & Jennifier
Greene, O‘Reilly,2006.
2. Head First PMP, Jennifier Greene & Andrew Stellman O‘Reilly, 2007.
CMR College of Engineering & Technology Page 182
B.Tech(CSE) R-15
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Unit-I
System Modeling, Clustering and Virtualization: Distributed system
models and Enabling Technologies, Computer Clusters for Scalable Parallel
Computing, Virtualization machines an Virtualization of clusters and Data
centers.
Case Study: Walk through in to Ubuntu 12.04 Operating System.
Unit-II
Foundations: Introduction to cloud computing, Migrating into a cloud,
Enriching the ‗Integration as a Service‘ Paradigm for the cloud Era, The
Enterprise Cloud Computing Paradigm.
Unit-III
Infrastructure as a Service(IAAS) & Platform and Software as a
Service(PAAS/SAAS): Virtual machines provisioning and migration
services, On the Management of Virtual machines for Cloud Infrastructure,
Enhancing Cloud Computing Environments using a cluster as a Service,
Secure Distributed Data Storage in Cloud Computing.
Aneka, Comet Cloud, T-System, Workflows Engine for Clouds,
Understanding Scientific, Applications for Cloud Environments.
Unit-IV
Monitoring, Management and Applications: An Architecture for
Federated Cloud Computing, SLA Management in Cloud Computing,
Performance Prediction for HPC on Clouds, Best Practices in Architecting
Cloud Applications in the AWS Cloud, Building Content Delivery networks
using Clouds, Resource Cloud Mashups.
Case Study: Apache hbase 0.92.1, Apache hadoop 2.2.0.
Unit-V
Governance and Case Studies: Organizational Readiness and Changes
management in the Cloud age, Data, Security in the Cloud, Legal Issues in
Cloud computing, Achieving Production Readiness for Cloud Services.
CMR College of Engineering & Technology Page 184
B.Tech(CSE) R-15
Text 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.
Reference books
1. Cloud Computing: A Practical Approach, Anthony T. Velte, Toby
J.Velte, Robrt Elsenpeter, Tata McGraw Hill, 2011.
2. Enterprise Cloud Computing, Gautam Shroff, Cambridge University
Press, 2010.
3. Cloud Computing: Implementation, Management and Security, John W.
Rittinghouse, James F.Ransome, CRC Press, rp2012.
4. Cloud Application Architectures: Building Applications and
Infrastructure in the cloud, George Reese, O‘Reilly, SPD, rp2011.
5. Cloud Security and Privacy: An Enterprise Perspective on Risks and
Compliance, Tim Mather, Subra Kumaraswamy, Shahed Latif, O‘Reilly,
SPD, rp2011.
Course Outcomes
On completion of the course, students will be able to
1. Explain about systems, protocols & mechanisms require to support for
cloud computing.
2. Develop applications for cloud computing.
3. Describe the hardware software required for cloud computing.
4. Design & implement cloud computing applications.
5. Explore some important cloud computing driven commercial systems
such as Google apps, Microsoft Azure & Amazon web & other business
cloud apps.
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
A brief explanation of the objective is to provide digital evidences
which are obtained from digital media.
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 crime.
Unit I:
Computer Forensics Fundamentals: What is Computer Forensics? Use of
computer Forensics in Law Enforcement, Computer Forensics Assistance to
Human Resources/Employment Proceedings, Computer Forensics services,
Benefits of Professional Forensics Methodology, Steps taken by Computer
Forensics Specialists.
Types of computer Forensics Technology: Types of Military Computer
Forensic Technology, Types of Law Enforcement-Computer Forensic
Technology-Types of Business Computer Forensic Technology
Computer Forensics Evidence and Capture: Data Recovery Defined-Data
Back-up and Recovery-The Role of Back-up in Data Recovery-The Data –
Recovery Solution
Unit II:
Evidence Collection: Why Collect Evidence? Collections Options,
Obstacles, Types of Evidence, The Rules of Evidence, Volatile Evidence-
General Procedure – Collection and Archiving –Methods of Collection-
Artifacts- Collecton Steps-Controlling contamination: The Chain of custody
Duplication and Preservation of Digital Evidence: Preserving the Digital
Crime Scene, Computer Evidence Processing Steps, Legal Aspects of
Collecting and Preserving Computer Forensic Evidence
Computer Image Verification and Authentication: Special Needs of
Evidential Authentication, Practical Consideration, Practical Implementation
Unit III:
Computer 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 honey net project.
Processing Crime and Incident Scenes: Identifying digital evidence,
collecting evidence in private-sector incident scenes, processing law
enforcement crime scenes, preparing for a search, Securing a computer
incident or crime scene, seizing digital evidence at the scene, storing digital
evidence, obtaining a digital hash, reviewing a case
Unit IV:
Current computer Forensic tools: Evaluating computer forensic tool needs,
computer forensics software tools, computer forensics hardware tools,
validating and testing forensics software
Email Investigations: Exploring the Role of E-Mail in Investigation,
Exploring the Role of Client and Server in E-Mail, Investigating E-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 startup tasks,MS-DOS
startup tasks, virtual machines.
Textbooks:
1. Guide to Computer Forensics and Investigations by Nelson, Phillips,
Steuart, 3rd Edition CENGAGE Learning
2. Computer Forensics, Computer crime investigation by Jhon R.Vacca,
Firewall Media, New Delhi.
References:
1. Computer Evidence: Collection and Preservation, by Christopher L. T.
Brown, 2nd Edition, CENGAGE Learning
Course Outcomes:
On completion of the course, students will be able to
B.Tech(CSE): VI Semester
L T P C
4 0 0 4
Objectives:
To survey of attractive applications of artificial neural networks.
To practical approach for using artificial neural networks in various
technical, organizational and economic applications.
Unit- I
Introduction-what is a neural network? Human Brain, Models of a Neuron,
Neural networks viewed as Directed Graphs, Network Architectures,
Knowledge Representation, Artificial Intelligence and Neural Networks (p.
no‘s 1 –49)
Learning Process 1–Error Correction learning, Memory based learning,
Hebbian learing, (50 -55)
Unit -II
Learning Process 2: Competitive, Boltzmann learning, Credit Assignment
Problem,
Memory, Adaption, Statistical nature of the learning process, (p. no‘s 50 –
116)
Single Layer Perceptrons–Adaptive filtering problem, Unconstrained
Organization Techniques, Linear least square filters, least mean square
algorithm, learning curves, Learning rate annealing techniques, perception –
convergence theorem, Relation between perception and Bayes classifier for a
Gaussian Environment (p. no‘s 117 –155)
Unit -III
Multilayer Perceptron: Back propagation algorithm XOR problem,
Heuristics, Output representation and decision rule, Computer experiment,
feature detection, (p. no‘s 156 –201)
Back Propagation-back propagation and differentiation, Hessian matrix,
Generalization,
Cross validation, Network pruning Techniques, Virtues and limitations of
back propagation
learning, Accelerated convergence, supervised learning. (p. no‘s 202 –234)
Unit- IV
Self Organization Maps –Two basic feature mapping models, Self
organization map, SOM algorithm, properties of feature map, computer
simulations, learning vector quantization, Adaptive patter classification,
Hierarchal Vector quantilizer, contexmel Maps (p. no‘s 443 –469, 9.1 –9.8 )
Unit- V
Neuro Dynamics–Dynamical systems, stavility of equilibrium states,
attractors, neurodynamical models, manipulation of attractors‘ as a recurrent
network paradigm (p. no‘s 664 –680, 14.1 –14.6)
Hopfield Models–Hopfield models, computer experiment I (p. no‘s 680
-701, 14.7 –14.8)
Text book:
1. Neural networks A comprehensive foundations, Simon Hhaykin, Pearson
Education 2nd Edition 2004
Reference books:
1. Artificial neural networks -B.Vegnanarayana Prentice Halll of India P
Ltd 2005
2. Neural networks in Computer intelligence, Li Min Fu TMH 2003
3. Neural networks James A Freeman David M S kapura Pearson Education
2004
Course Outcomes
On completion of the course, students will be able to
1. Define taxonomy of neural networks
2. Describe architecture of neural networks
3. Analyze the perceptron model of neural networks
4. Describe feature mapping models
5. Decribe hopfield network model.
B.Tech(CSE): VI Semester
L T P C
3 0 0 3
Unit I:
Attacks on Computers and Computer Security: Introduction to
Information Security, the need for security, Security approaches, Principles
of Security, Types of Security attacks, Security Services, Security
Mechanisms, A model for Network Security.
Cryptographic Techniques: Introduction, plain text and cipher text,
substitution Techniques, transposition techniques, encryption and decryption,
symmetric and asymmetric key cryptography, steganography, Key range and
key size, possible types of attaks.
Unit II:
Symmetric Key Ciphers: Block cipher principles, DES, AES, Blowfish,
Differential and linear cryptanalysis, Block cipher modes of operations,
stream ciphers, RC4, location and placement of encryption function, key
distribution
Asymmetric key Ciphers: Principles of public key cryptosystems, key
distribution, RSA, Diffie-Hellman key exchange, ECC algorithms.
Unit III:
Message Authentication Algorithms and Hash Functions: Authentication
Requirements, Functions, Message Authentication Codes, Hash Functions,
Secure Hash Functions, HMAC, CMAC, Digital Signatures, Knapsack
algorithm.
Authentication Applications: Kerberos, X.509 authentication Services,
Public key Infrastructure, Biometric Authentication.
Unit IV:
E-Mail-Security: Pretty Good Privacy, S/MIME
IP Security: IP Security Overview, IP Security Architecture, Authentication
Header, Encapsulating Security payload, Combining Security associations,
Key management.
Unit V:
Web Security: Web Security Considerations, Secure Socket Layer and
Transport layer Security, Secure Electronic transaction,
Intruders, Virus & Firewall: Intruders, intrusion detection, Virus and virus
related threats, Counter measures, Firewall design principles, Types of
firewalls password management.
Case studies on Cryptography and Security: Secure Inter-branch payment
transaction, Cross site scripting Vulnerability, Virtual Elections
Textbooks:
1. Cryptography and Network Security : William Stallings, Pearson
Education, 4th Edition
2. Cryptography and Network Security : Atul Kahate, Mc Graw Hill, 2nd
Edition
References:
1. Cryptography and Network Security: C.K.Shyamala, N. Harani,
Dr.T.R. Padmanabhan, Wiley India, 1st Edition.
2. Cryptography and Network Security: Forouzan Mukhopadhyay, Mc
Graw Hill, 2nd 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
Course Outcomes
On completion of the course, students will be able to
1. Classify computer and security threats and develop a security model to,
prevent, detect and recover from attacks.
2. Describe the concept of Encryption and analyze the various Symmetric
algorithms and Asymmetric algorithms.
3. Explain the techniques and algorithms used for message authentication
and the need for Kerberos authentication and the techniques.
4. Familiarize the network security design and differentiate the various
kinds of malicious software threats.
5. Differentiate various protocols and the principles behind design of
firewalls.
B.Tech(CSE): VI Semester
L T P C
0 0 2 1
Prerequisites
1. A Course on ―Computer Programming and Data Structures‖
2. 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 introduce client side scripting with Javascript and AJAX
List of Experiments:
1. Develop static pages (using Only HTML) of an online book store. The
pages should resemble: www.amazon.com. The website should consist the
following pages.
a) Home page
b) Registration and user Login
c) User Profile Page
d) Books catalog
e) Shopping Cart
f) Payment By credit card
g) Order Conformation
2. Validate the Registration, user login, user profile and payment by credit
card pages using JavaScript.
4. Bean Assignments
a. Create a JavaBean which gives the exchange value of INR (Indian
Rupees) into equivalent American/Canadian/Australian Dollar value.
b. Create a simple Bean with a label - which is the count of number of
clicks. Then create a BeanInfo class, such that only the ―count‖
property is visible in the Property Window.
c. Create two Beans- a)KeyPad. b)DisplayPad.
6. Redo the previous task using JSP by converting the static web pages of
assignments 2 into dynamic web pages. Create a database with user
information and books information. The books catalogue should be
dynamically loaded from the database. Follow the MVC architecture
while doing the website.
Text books:
1. Web Technologies: A Computer Science Perspective, Jeffrey C.
Jackson, Pearson Education
References:
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
CMR College of Engineering & Technology Page 194
B.Tech(CSE) R-15
Course Outcomes
On completion of the course, students will be able to
1. Design and develop interactive and dynamic web applications using
HTML, CSS, JavaScript and XML
2. Apply client-server principles to develop scalable and enterprise web
applications.
B.Tech(CSE): VI Semester
L T P C
0 0 2 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‖
Co-requisite
1. A course on ―Compiler Design‖
Objectives
1. To provide practical programming skills necessary for constructing
a compiler.
List of Experiments:-
1. Design a DFA to accept all strings containing a substring(01)
2. Write a LEX Program to scan reserved word & Identifiers of C
Language
3. Write a LEX Program to scan integers as Float Numbers in C Language
4. Implement Predictive Parsing algorithm
5. Implement RD Parser for the Grammar S->AB
A->a/E B->b/E
6. Write a C program to generate three address code.
7. Implement SLR(1) Parsing algorithm
8. Write a YACC program to parse the Strings.
Text Books:
1. Compilers: Principles, Techniques and Tools: Alfred V.Aho, Ravi Sethi,
Jeffrey D. Ullman; Pearson Education
2. Modern Compiler Implementation in C- Andrew N. Appel, Cambridge
University Press.
References:
1. Lex & yacc – John R. Levine, Tony Mason, Doug Brown, O‘reilly
Course Outcomes
On completion of the course, students will be able to
1. Implement lexical analyzer using LEX. Implement symbol table.
2. Find First set and Follow set of productions, construct operator
precedence parse table.
3. Implement simple calculate using YACC, Implement a Recursive
Descent parser.
4. Implement shift reduced parsing and construct LR parsing table.
5. Generate code for a given intermediate code and implement code
optimization techniques.
B.Tech(CSE): VI Semester
LT P C
2 0 0 0
Logical Reasoning
Analogy
Classification
Series & Sequence
Coding & Decoding
Directions
Blood Relations
Seating Arrangements
Clocks and Calendars
Cubes
Logical Deductions
Figure Analysis
General Puzzles
Data Sufficiency
Data Interpretation
Business English
VII SEMESTER
Unit -I:
Linux Utilities: File handling utilities, Security by file permissions, Process
utilities, Disk utilities, Networking commands, Filters, Text processing
utilities and Backup utilities.
Sed – scripts, operation, addresses, commands, applications, awk –
execution, fields and records, scripts, operation, patterns, actions, functions,
system commands in awk.
Application shell with the Bourne Again Shell(Bash): Introduction, shell
responsibilities, pipes and Redirection, here documents, running a shell
script, the shell as a programming language, shell meta characters, file name
substitution, shell variables, command substitution, shell commands, the
environment, quoting, test command, control structures, arithmetic in
shell, shell script examples, interrupt processing, functions, debugging shell
scripts.
Unit- II
Linux Files: File Concept, File System Structure, File metadata-Inodes, File
types, Kernel support for files, system calls for file I/O operations- open,
creat, read, write, close, lseek,dup2, file status information- stat family, file
and record locking-fcntl function, file permission-chmod, fchmod,file
ownership-chown, lchown,fchown, links- soft links & hard links - unlink,
link, symlink.
Directories: creating, removing and change Directories (mkdir, rmdir,
chdir), obtaining current working directory( getcwd), Directory contents,
Scanning Directories (opendir, readdir, closedir,rewinddir, seekdir, telldir
functions).
Unit -III
Linux Process: Process concept, Layout of C program image in main
memory, Process environment- environment list, environment variables,
getenv, setenv, Kernel support for process, process identification, process
control - process creation, replacing a process image, waiting for a process,
Unit -IV
Inter-process Communication: Introduction to IPC, IPC between processes
on a single computer system, IPC between processes on different systems,
pipes- creation, IPC between related processes using unnamed pipes, FIFOs-
creation, IPC between related processes using FIFOs, difference between
unnamed and named pipes, popen, pclose functions.
Message Queues: Kernel support for messages, Linux APIs for messages,
client/server example.
Semaphores: Kernel support for semaphores, Linux APIs for semaphores,
file locking with semaphores.
Unit -V
Shared Memory: Kernel support for shared memory, Linux APIs for shared
memory, shared memory example.
Sockets: Introduction to Berkeley sockets, IPC over a network, Client-server
model, socket address structure( Unix domain and inter domain), Socket
system calls for connection oriented protocol and connectionless protocol,
example-client/server programs-Single server-client connection, Multiple
simultaneous clients, Socket options-setsockopt and fcntl system calls,
comparision of IPC mechanisms.
Textbooks:
1. Unix System Programming using C++, T.Chan, PHI.
2. Unix Concepts and Applications, 4th Edition, Sumitabha Das,
TMH,2006.
3. Unix Network Programming ,W.R.Stevens,PHI.
References:
1. Linux System Programming, Robert Love, O‘Reilly, SPD, rp-2007.
2. Beginning Linux Programming, 4th Edition, N.Matthew,
R.Stones,Wrox, Wiley India Edition,rp-2008.
3. Unix for programmers and users, 3rd Edition, Graham Glass, King
Ables, Pearson Education, 2003.
CMR College of Engineering & Technology Page 200
B.Tech(CSE) R-15
Course Outcomes
L T P C
4 0 0 4
Course Objectives:
This subject aims to teach the students how a computer can emulate
functions typical of human vision and enable them to design and implement
image processing and pattern recognition applications
To be familiar with Image model, sensing and acquisition, digital image
representation, properties of human visual system, various applications.
Different image processing operations for improving image quality
through enhancement, restoration and filtering etc..
Affine transformation and registration compressing data to save storage
and channel capacity during transmission.
Image segmentation for partitioning into objects and background.
Extraction of image features, quantifying shapes, pattern recognition,
image analysis
Unit-I
The digitized image and its properties:
Applications of image processing, image function, image representation,
sampling, quantization, color images, metrics and topological properties of
digital images, histograms, image quality, noise image.
Unit-II
Image Pre-processing:
Pixel brightness transformation, position dependent brightness correction,
gray scale transformation; geometric transformation, local pre processing-
image smoothening, edge detectors, zero-crossing, scale in image processing,
canny edge detection, parametric edge models, edges in multi spectral
images, local pre-processing and adaptive neighbourhood pre-processing;
image restoration;
Unit-III
Image Segmentation: Threshold detection methods, optimal thresholding,
multispectral thresholding, thresholding in hierarchical data structures; edge
Unit-IV
Mathematical Morphology :
Basic morphological concepts, four morphological principles, binary
dilation, erosion, Hit or miss transformation, opening and closing; thinning
and skeleton algorithms; Morphological segmentation –particles
segmentation and watersheds, particle segmentation.
Image textures :
statistical texture description, methods based on spatial frequencies, co-
occurrence matrices, edge frequency, and texture recognition method
applications Image representation and description-representation, boundary
descriptors, regional descriptors
Unit-V
Pattern recognition fundamentals:
Basic concepts of pattern recognition, fundamental problems in pattern
recognition system, design concepts and methodologies, example of
automatic pattern recognition systems, a simple automatic pattern
recognition model
Text books:
1. Millan sonka, Vaclav Hiavac, Roger Boyle, ―Image Processing
Analysis and Machine Vision‖ , 3rd Edition, CL Engineering ,2013.
2. Afel C. Gonzalez, Richard E. Woods, ―Digital Image Processing‖ , 3 rd
Edition, Pearson Education, 2008.
References:
1. Julus T. Tou , Rafel C. Gonzalez, Addision, ―Pattern Recognition
Principles‖, 1st Edition, Wesley publishing company.
2. Earl Gose, Richard Johnsonbaugh, ―Pattern Recognition and Image
Analysis‖, 1st Edition, Prentice Hall of India Private limited, 2009.
Course outcomes
At the end of the course the student will be able to
1. Describe digital image and its properties
2. Explain the techniques for image enhancement
3. Summarise various image segmentation methods
4. Illustrate morphological principles
5. Identify fundamental problems in pattern recognition system
L T P C
4 0 0 4
Objectives:
To make the student understand the concept of mobile computing
paradigm, its novel applications and limitations.
To understand the typical mobile networking infrastructure through
a popular GSM protocol.
To understand the issues and solutions of various layers on
mobile networks, namely MAC layer, Network Layer &
Transport Layer.
To understand the database issues in mobile environments & data
delivery models.
To understand the platforms and protocols used in mobile
environment.
To understand the importance of information security in mobile
communication.
Unit I:
Introduction: Mobile Communications, Mobile computing- paradigm,
promises/Novel Applications and Impediments and Architecture; Mobile and
handheld Devices, limitations of mobile and handheld devices.
GSM – Services, system architecture, Radio Interface, Protocols,
Localization , Calling, Handover, Security, New Data services, GPRS,
CSHSD, DECT
Unit II:
(Wireless) Medium Access Control (MAC): Motivation for a specialized
MAC (Hidden and Exposed terminals, near and Far terminals), SDMA,
FDMA, TDMA, CDMA, wireless LAN/ (IEEE 802.11)
Mobile Network Layer: IP and Mobile IP network layers, Packet Delivery
and Handover Management, location management, registration, tunneling,
and encapsulation, route optimization, DHCP.
Unit III:
Mobile Transport Layer: Conventional TCP/IP, protocols, Indirect TCP,
Snooping TCP, Mobile TCP, other transport layer protocols for mobile
networks.
Database Issues: Database hoarding, and Caching techniques, Client- Server
computing and adaptation, transactional modals, Query processing, data
recovery process and QoS issues.
Unit IV:
Data Dissemination and Synchronization: Communications Asymmetry,
Classification of data delivery Mechanisms, Data Dissemination, Broadcast
Models, Selective Tunneling and Indexing Methods, Data Synchronization-
Introduction, software, and Protocols.
Unit V:
Mobile Ad-hoc Networks (MANETs): Introduction, Applications and
Challenges of a MANET, 4G networks: Requirements and design,
modulation and Multiplexing Techniques for 4G networks, Security in Ad-
hoc networks.
Protocols and Platforms for Mobile Computing: WAP, Bluetooth, XML,
J2ME, JavaCard, PalmOS, Windows CE, Symbian OS, Linux for Mobile
Devices, Android.
Textbooks:
1. Jochen Schiller, ―Mobile Communications‖, Addison – Wesley, Second
Edition, 2009.
2. Raj Kamal, ― Mobile Computing‖, Oxford University Press, 2007,
ISBN: 0195686772
References:
1. Jochen Schiller, ―Mobile Communications‖, Addison – Wesley, Second
Edition, 2004.
2. Stojmenovic and Cacute, ―Handbook of Wireless Networks and Mobile
Computing‖, Wiley, 2002, ISBN 0471419028.
3. Reza Behravanfar, ―Mobile Computing Principles: Design and
Developing Mobile Applications with UML and XML‖, ISBN:
0521817331, Cambridge University Press, Oct 2004.
Course Outcomes:
On completion of the course, students will be able to
1. Define terms related to mobile communication
2. Explain GSM architecture
3. Describe the functionalities of medium access control(mac) layer .
4. Compare conventional transport layer protocols and mobile transport
layer protocols.
5. Indentify protocols and platforms for mobile computing
L T P C
4 0 0 4
Objectives:
To learn the differences between optimal reasoning verses human
reasoning.
To understand the notations of state space representation, exhaustive
search, heuristic search along with the time and space complexities.
To learn different knowledge representation techniques.
To understand the various applications of AI.
Unit- I
Introduction, History, Intelligent Systems, Foundations of AI, Subareas of
AI, Applications. Problem Solving-State-Space Search and Control
Strategies: Introduction, General Problem Solving, Characteristics of
Problem, Exhaustive Searches, Heuristic Search Techniques, Iterative
Deepening A*, Constraint Satisfaction, Game Playing, Bounded Look-ahead
Strategy and use of Evaluation Functions, Alpha-Beta Pruning.
Unit-II
Logic Concepts and Logic Programming: Introduction, Propositional
Calculus, Propositional Logic, Natural Deduction System, Axiomatic
System, Semantic Tableau System in Propositional Logic, Predicate Logic,
Logic Programming.
Knowledge Representation: Introduction, Approaches to Knowledge
Representation using Semantic Network, Extended Semantic Networks for
KR, Knowledge Representation Using Frames.
Unit-III
Expert System and Applications: Introduction, Phases in Building Expert
Systems, Expert System Architecture, Expert Systems Vs Traditional
Systems, Truth Maintenance Systems, Application of Expert Systems, List of
Shells and Tools.
Uncertainty Measure- Probability Theory: Introduction, Probability Theory,
Bayesian Belief Networks, Certainty Factor Theory, Dempster-Shafer
Theory.
Unit-IV
Machine-Learning Paradigms: Introduction, Machine Learning Systems,
Supervised and Unsupervised Learning, Learning Decision Trees, Deductive
Learning, Clustering, Support Vector Machines.
Artificial Neural Networks: Introduction, Artificial Neural Networks, Single-
Layer Feed-Forward Networks, Multi-Layer Feed-Forward Networks, Radial
Basis Function Networks, Design Issues of Artificial Neural Networks,
Recurrent Networks.
Unit-V
Advanced Knowledge Representation Techniques: Case Grammars,
Semantic Web.
Natural Language Processing: Sentence Analysis Phases, Grammars and
Parsers, Types of Parsers, Semantic Analysis, Universal Networking
Knowledge.
Text books:
1. Russel, Norvig: Artificial Intelligence. A Modern Approach, Pearson
Education, Second Edition, 2004.
2. Saroj Kaushik: Artificial Intelligence, Cengage Learning, 2011.
Reference books:
1. Patric Henry Winston: Artificial Intelligence - Third Edition, Person
Education.
2. Rich, Knight, Nair: Artificial Intelligence, TMH, Third Edition
2009.
Course Outcomes:
On completion of the course, students will be able to
1. Formulate an efficient problem space for a problem expressed in
English.
2. Select a search algorithm for a problem and characterize its time and
space complexities.
3. Represent knowledge using appropriate AI technique.
4. Apply AI techniques for solving problems
L T P C
4 0 0 4
Prerequisites
A course on ―Machine Learning‖
A course on ―Formal Languages and Automata Theory‖
Objective
This course is intended to introduce the fundamental concepts and ideas
in Natural Language Processing (NLP).
Provides an understanding of the algorithms available for the
processing of linguistic information and the underlying computational
properties of natural languages.
The course covers methods for parsing and semantic interpretation with
applications to practical engineering tasks such as part-of-speech
tagging, word sense disambiguation, information retrieval and
extraction, natural language generation and machine translation.
Unit - I:
INTRODUCTION: Knowledge in speech and language processing -
Ambiguity - Models and Algorithms - Language, Thought and
Understanding.
Regular Expressions and Automata: Regular expressions - Finite-State
automata. Morphology and Finite-State Transducers: Survey of English
morphology - Finite- State Morphological parsing - Combining FST lexicon
and rules - Lexicon-Free FSTs: The porter stammer - Human morphological
processing.
Unit - II:
Word Classes and Part-of-Speech Tagging: English word classes – Tag sets
for English - Part-of-speech tagging - Rule-based part-of-speech tagging -
Stochastic part-of-speech tagging - Transformation-based tagging - Other
issues.
Context-Free Grammars for English: Constituency - Context-Free rules and
trees - Sentence-level constructions - The noun phrase - Coordination -
Unit - III:
Features and Unification: Feature structures - Unification of feature
structures - Features structures in the grammar - Implementing unification -
Parsing with unification constraints - Types and Inheritance. Lexicalized and
Probabilistic Parsing: Probabilistic context-free grammar - problems with
PCFGs - Probabilistic lexicalized CFGs - Dependency Grammars - Human
parsing.
Unit – IV:
Representing Meaning: Computational desiderata for representations -
Meaning structure of language - First order predicate calculus - Some
linguistically relevant concepts - Related representational approaches -
Alternative approaches to meaning.
Semantic Analysis: Syntax-Driven semantic analysis - Attachments for a
fragment of English - Integrating semantic analysis into the early parser -
Idioms and compositionality - Robust semantic analysis.
Unit - V:
Word Sense Disambiguation and Information Retrieval: Selectional
restriction-based disambiguation - Robust word sense disambiguation -
Information retrieval - other information retrieval tasks.
Natural Language Generation: Introduction to language generation -
Architecture for generation - Surface realization - Discourse planning - Other
issues.
Machine Translation: Language similarities and differences - The transfer
metaphor - The interlingua idea: Using meaning - Direct translation - Using
statistical techniques - Usability and system development.
Text books:
1. Daniel Jurafsky & James H. Martin, " Speech and Language Processing",
Pearson Education (Singapore) Pvt. Ltd., 2002.
References:
1. James Allen, "Natural Language Understanding", Pearson Education,
2003.
Course Outcomes
On completion of the course, students will be able to
1. Explain the mathematical and linguistic concepts of NLP.
2. Design and implement algorithms for NLP problems
L T P C
4 0 0 4
Prerequisites
1. A Course on Software Engineering‖
2. A Course on ―Object Oriented Programming Through Java‖
Objectives
The aim of the course is to appreciate the idea behind Design
Patterns in handling common problems faced during building an
application
This course covers all pattern types from creational to structural,
behavioral to concurrency and highlights the scenarios when one pattern
must be chosen over others.
Unit- I:
Introduction: What is a design pattern? design patterns in Smalltalk MVC,
Describing Design Patterns, The Catalog of Design Patterns, Organizing the
Catalog, How Design Patterns Solve Design Problems, How to Select a
Design Pattern, How to Use a Design Pattern.
Unit- II:
Designing a Document Editor: Design Problems, Document Structure,
Formatting, Embellishing the User Interface, Supporting Multiple Look-
and-Feel Standards, Supporting Multiple Window Systems, User
Operations Spelling Checking and Hyphenation, Summary
Unit- III:
Creational Patterns: Abstract Factory, Builder, Factory Method,
Prototype, Singleton, Discussion of Creational Patterns.
Unit -IV:
Structural Pattern: Adapter, Bridge, Composite, Decorator, Façade,
Flyweight, Proxy
Unit -V:
Behavioral Patterns: Chain of Responsibility, Command, Interpreter,
Iterator, Mediator, Memento, Observer, State, Strategy, Template Method,
Visitor.
Text Book:
1. Design Patterns, Erich Gamma, Pearson Education
Reference Books:
1. Pattern‘s in Java, Vol –I, Mark Grand, Wiley DreamTech.
2. Pattern‘s in Java, Vol-II, Mark Grand, Wiley DreamTech
Course Outcomes
On completion of the course, students will be able to
1. Create software designs that are scalable and easily maintainable
2. Explain Object Oriented concepts for creating truly OOP programs
3. Use creational design patterns in software design for class instantiation
4. Use structural design patterns for better class and object composition
5. Use behavioral patterns for better organization and communication
between the objects
6. Use refactoring to compose the methods for proper code packaging
7. Use refactoring to better organize the class responsibilities of current
code
L T P C
4 0 0 4
Objectives:
To learn the different models for information storage and retrieval.
To learn about the various retrieval utilities.
To understand indexing and querying in information retrieval
systems
To expose the students to the notions of structured and semi
structured data
To learn about web search.
Unit I:
Introduction: Introduction and basic concepts, Functional Overview,
Relationship to DBMS and Data Mining, Retrieval Capabilities, Indexing,
Information Extraction, Web Search Engine Case Study.
Unit II:
Retrieval Strategies: Simple term weights, Non- Binary Independence
Model, Language models: Stemming, N-Gram Models, PAT Data Structure.
Unit III:
Automatic Indexing: Classes of automatic indexing, Statistical indexing,
Natural language, Concept indexing, Hypertext linkages.
Unit IV:
Text Categorization and Filtering: Introduction to text classification.
Naive Bayes models.
Unit V:
Information Visualization: Introduction, Cognition and perception,
Information visualization technologies.
Textbooks:
1. David A.Grossman, Ophir Frieder, Information Retrieval-Algorithms
and Heuristics, Springer, 2nd Edition (Distributed by Universities Press),
2004.
2. Modern Information Retrival By Ricardo Baeza-Yates Pearson
Education 2007.
References:
1. Gerald J Kowalski, Mark T Maybury. Information Storage and
Retrieval Systems, Springer, 2000.
2. Information Storage & Retieval By Robert Korfhage – John Wiley &
Sons.
3. Introduction to Information Retrieval By Christopher D. Manning and
Prabhakar Raghavan, Cambridge University Press, 2008.
4. Sounen Chakrabarti, Miming the Web: Discovering Knowledge from
Hypertext data, Morgan-Kaufmann Publishers, 2002.
Course Outcomes:
On completion of the course, students will be able to
1. Store and retrieve textual documents using appropriate models.
2. Use the various retrieval utilities for improving search.
3. Explain indexing and compressing documents to improve space and
time efficiently.
4. Formulate SQL like queries for unstructured data.
5. Explain issues in web search.
L T P C
4 0 0 4
Objectives:
To give students knowledge of soft computing theories fundamentals, ie.
Fundamentals of artificial and neural networks, fuzzy sets and fuzzy logic
and genetic algorithms.
Unit I
AI Problems and Search: AI problems, Techniques, Problem Spaces and
Search, Heuristic Search Techniques- Generate and Test, Hill Climbing, Best
First Search Problem reduction, Constraint Satisfaction and Means End
Analysis. Approaches to Knowledge Representation- Using Predicate Logic
and Rules.
Unit II
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 III
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 IV
Introduction to Classical Sets ( crisp Sets)and Fuzzy Sets- operations and
Fuzzy sets. Classical Relations -and Fuzzy Relations- Cardinality,
Operations, Properties and composition. Tolerance and equivalence relations.
Membership functions- Features, Fuzzification, membership value
assignments, Defuzzification.
Unit V
Fuzzy Arithmetic and Fuzzy Measures, Fuzzy Rule Base and Approximate
Reasoning Fuzzy Decision making Fuzzy Logic Control Systems. Genetic
Algorithm- Introduction and basic operators and terminology, Applications:
Optimization of TSP, Internet Search Technique
Text books:
1 Principles of Soft Computing- S N Sivanandam, S N Deepa, Wiley
India, 2007.
2 Soft Computing and Intelligent System Design -Fakhreddine O Karray,
Clarence D Silva, PearsonEdition, 2004.
Reference books:
1. Artificial Intelligence and Soft Computing- Behavioural and Cognitive
Modeling of the Human Brain- Amit Konar, CRC press, Taylor and
Francis Group.
2. Artificial Intelligence – Elaine Rich and Kevin Knight, TMH, 1991,
rp2008.
3. Artificial Intelligence – Patric Henry Winston – Third Edition, Pearson
Education.
4. A first course in Fuzzy Logic-Hung T Nguyen and Elbert A Walker,
CRC. Press Taylor and Francis Group.
5. Artificial Intelligence and Intelligent Systems, N.P.Padhy, Oxford
Univ. Press.
Course Outcomes
On completion of the course, students will be able to
1. Illustrate artificial intelligence problems
2. Explain basic artificial neural network models
3. Discuss unsupervised learning networks
4. Explain fuzzy sets
5. Apply fuzzy logic in decision making
6. Describe genetic al algorithms
L T P C
4 0 0 4
Course objectives:
Become familiar with the fundamental concepts of Big Data
management and analytics;
Become competent in recognizing challenges faced by applications
dealing with very large volumes of data as well as in proposing
scalable solutions for them;
Become familiar with Map Reduce Environment
Become familiar with HIVE and PIG architectures
Unit-I
Introduction to Big Data:
Introduction- Big Data, Characteristics & Importance of Big Data – Four
V‘s, Relational Database Vs Big Data, Big Data Analytics, Big Data
Applications , Introduction to NoSQL Database Systems
Unit- II
Hadoop: Introduction to Hadoop, History and future of Hadoop HDFS-
HDFS Architecture and How to load data into HDFS, Rack Awareness, Data
node to name node communication, fault- tolerance feature of HDFS, Read
data from HDFS, Block Size concept of HDFS,
Unit – III
Map Reduce: Introduction to Map Reduce and its Architecture, Hadoop
Eco System, Setup Hadoop on a Single node, Simple Map Reduce Program,
Executing Map Phase – Shuffling and Sorting, Reducing Phase Execution
Unit- IV
PIG: Introduction to Apche PIG, Data Model and Schema, Load Store and
Relational Operators, Processing Data Using Apache PIG, Parameter
Substitution, user defined functions
Unit - V
HIVE: Introduction to HIVE & its Architecture, HIVE Data Types and
Table Creation, Loading data in HIVE Tables, Managed Tables and External
Tables, Querying HIVE Tables, Introduction to R
Text Books:
1. Boris lublinsky, Kevin t. Smith, Alexey Yakubovich, ―Professional
Hadoop Solutions‖, Wiley, ISBN: 9788126551071, 2015.
2. Chris Eaton, Drik deroos et al., ―Understanding Big Data‖, McGraw
Hill,2012
3. Tom White, ―HADOOP: The definitive Guide‖, O Reilly 2012
4. Vignesh Prajapati, ―Big Data Analytics with R and Hadoop‖ , Oracle
Press, 2014
5. Big Data for Dummies by Judith Hurwitz, Alan Nugent, Dr. Fern
Halper, Marcia Kaufman
6. Programming Pig by Alan Gates
7. Programming Hive by Edward Capriolo, Dean Wampler, Jason
Rutherglen
Reference Books:
Course Outcomes:
By the end of the course the student will be able to:
1. Deploy a structured lifecycle approach to big data analytics projects
2. analyze big data and create statistical models
3. Use tools such as MapReduce /Hadoop Hive and Pig.
L T P C
3 0 0 3
Course Objectives:
To study the concept of analog communication system.
To study about different digital modulation techniques such as
PCM, DM and various shift keying techniques.
To study the concepts of different digital modulation techniques
To study about different error detecting and error correcting codes
like block codes, cyclic codes and convolution codes
Digital Modulation: ASK, FSK, PSK, DPSK, QPSK, coherent and Non-
coherent reception.
Textbooks:
1. Communication Systems Analog and Digital–R. P. Singh, SD Sapre,
TMH, 20th reprint, 2004.
2. Principles of Communication Systems – H Taub& D. Schilling,
GautamSahe, TMH, 3rd Edition, 2007.
3. Communication Systems – B.P. Lathi, BS Publication, 2004.
References:
1. Analog and Digital Communication – K. Sam Shanmugam, Willey,
2005.
2. Electronics & Communication System – George Kennedy and Bernard
Davis, TMH 2004.
3. Digital Communications- John G. Proakis, MasoudSalehi- 5th Edition,
Mcgarw- Hill,2008.
Course Outcomes:
At the end of the course the student should be able to:
L T P C
3 0 0 3
Course Objectives
It introduces solar energy its radiation, collection, storage and
application.
It also introduces the Wind energy, Biomass energy, Geothermal energy
and Ocean energy as alternative energy sources.
Unit-II:
Wind energy: Sources and potentials, horizontal and vertical axis windmills,
performance characteristics, Betz criteria
Unit-III:
Bio-mass: Principles of Bio-Conversion, Anaerobic/aerobic digestion, types
of Bio-gas digesters, gas yield, combustion characteristics of bio-gas,
utilization for cooking, I.C.Engine operation and economic aspects.
Unit-IV:
Geothermal energy: Resources, types of wells, methods of harnessing the
energy, potential in India.
Unit-V:
Direct energy conversion: Need for DEC, Carnot cycle, limitations,
principles of DEC.
Text Books
1. Non-Conventional Energy Sources /G.D. Rai
2. Renewable Energy Technologies /Ramesh & Kumar /Narosa
Reference Books
1. Renewable energy resources/ Tiwari and Ghosal/ Narosa.
2. Non-Conventional Energy / Ashok V Desai /Wiley Eastern.
3. Non-Conventional Energy Systems / K Mittal /Wheeler
4. Solar Energy /Sukhame
Course Outcomes
On completion of the course, students will be able to
1. Interpret the principles of solar radiation, collection and application.
2. Explain the concepts of Wind energy generation
3. Demonstrate the concepts of Bio-mass energy and operation of IC
engines
4. Illustrate the perception of Geo-thermal energy and production in India
5. Elucidate the ideology of direct energy conversion
L T P C
3 0 0 3
Course Objectives:
Selection of materials to suit for particular application play a major role in
engineering and technology. Understanding the behavior of materials,
particularly structure-property relation, will help selecting suitable materials
for a particular application.
Unit – I
Structure of Metals: Bonds in Solids – Metallic bond - crystallization of
metals, grain and grain boundaries, effect of grain boundaries on the
properties of metal / alloys
Unit -II
Constitution of Alloys: Necessity of alloying, types of solid solutions,
Hume Rothery rules, intermediate alloy phases, and electron compounds.
Unit -III
Cast Irons: Structure and properties of White Cast iron, Malleable Cast
iron, grey cast iron, Spheroidal graphite cast iron, Alloy cast irons.
Steels: Classification of steels, structure and properties of plain carbon steels,
Low alloy steels, Hadfield manganese steels, tool and die steels.
Unit – IV
Non-ferrous Metals and Alloys: Structure and properties of copper and its
alloys, Aluminum and its alloys, Titanium and its alloys.
Unit – V
Ceramic materials: Crystalline ceramics, glasses, cermaets, abrasive
materials, nonomaterials – definition, properties and applications of the
above.
Composite materials: Classification of composites, various methods of
component manufacture of composites, particle – reinforced materials, fiber
reinforced materials, metal ceramic mixtures, metal – matrix composites and
C – C composites.
Text books:
1. Introduction to Physical Metallurgy / Sidney H. Avener.
2. Material science & Metallurgy / Kodgire
Reference books:
1. Science of Engineering Materials / Agarwal
2. Materials Science / Vijendra Singh
3. Elements of Material science / V. Rahghavan
4. An introduction to material science / W.G.Vinas & HL Mancini
5. Material science & material / C.D.Yesudian & harris Samuel
6. Engineering Materials and Their Applications – R. A Flinn and P K
Trojan / Jaico Books.
Course outcomes:
On completion of the course, students will be able to
1. Select the materials suitable for engineering applications
2. Assess the properties of materials upon knowing the structure of the
material
3. Synthesize the material to suit for required properties.
L T P C
3 0 0 3
Unit - I
Environmental Hazards & Disasters: Meaning of Environmental hazards,
Environmental Disasters and Environmental stress. Concept of
Environmental Hazards, Environmental Stress & Environmental Disasters.
Different approaches & relation eith human Ecology - Landscape Approach -
Ecosystem Approach - Perception approach - Human ecology & its
application in geographical researches.
Types of Environmental hazards & Disasters: Natural hazards and Disasters
- Man induced hazards & Disasters - Natural Hazards - Planetary Hazards /
Disasters - Extra Planetary Hazards/ Disasters - Planetary Hazards -
Endogenous Hazards - Exogenous Hazards -
Unit - II
Endogenous Hazards: Volcanic Eruption - Earthquakes - Landslides -
Volcanic Hazards/ Disasters - Causes and distribution of Volcanoes -
Hazardous effects of Volcanic eruptions - Environmental impacts of volcanic
eruptions - Earthquake Hazards/ disasters - Causes of Earthquakes-
Distribution of earthquakes - Hazardous effects of - earthquakes - Earthquake
Hazards in India -- Human adjustment, perception & Mitigation of
earthquake.
Unit - III
Exogenous hazards/ disasters: infrequent events - Cumulative atmospheric
hazards / disasters.
Infrequent events: Cyclones - Lighting - Hailstorms.
Cyclones: Tropical cyclones & local storms - Destruction by tropical
cyclones & local stromes (causes, distribution human adjustment, perception
& mitigation) Droughts:- Impacts of droughts - Drought hazards in India -
Drought control measures - Extra planetary Hazards/ Disasters - Man
induced Hazards / Disasters - Physical hazards / Disasters - Soil Erosion.
Soil Erosion:- Mechanics forms of soil Erosion - Factors & Causes of Soil
Erosion - Conversation measures of soil Erosion.
Unit - IV
Emerging approaches in Disaster Management: Three Stages
Pre - Disaster stage (Preparedness)
Emergency Stage
Post Disaster stage - Rehabilitation
Unit –V
Disaster Management: An integrated approach for disaster preparedness,
mitigation & awareness.
Mitigation-institutions-discuss the work of following:
Meteorological observatory, Seismological observatory, Volcanology
institution, Hydrology Laboratory
Industrial safety inspectorate, institution of urban & regional planners,
Chambers of Architects, Engineering Council, National standard committee,
Integrated planning- Contingency management preparedness- Education on
disaster, Community involvement, The adjustment of human population to
natural hazards & disasters Role of Media,
Monitoring Management: Discuss the programme of disaster research &
mitigation of disaster of following organizations.
International Council for Scientific Unions (ICSU)- Scientific committee on
problem of the Environment (SCOPE), International Geosphere- Biosphere
programme (IGBP), World federation of Engineering organizations (WFED),
National Academy of sciences- World meteorological organizations (WMO),
Geographical information system (GIS), International Association of
seismology & physics of Earth‘s interior (IASPEI), Various U.N agencies
like UNCRD, IDNDR, WHO, UNESCO, UNICEF, UNEP.
Text Books:
1. Disaster Mitigation: Experience and Reflections by Pardeep Sahni.
2. Natural Hazards & Disasters by Donald Hyndman & David Hyndman -
Cengage Learning.
Reference Books:
1. R.B/Singh (Ed) Environmental Geography, Heritage Publishers New
Delhi, 1990.
2. Savinder Sign Environmental Geography, Prayag Pustak Bhawan, 1997
3. Kates, B.I & White, G.F The Environment as Hazards, oxford, New
York, 1978.
4. R.B. Singh (Ed) Disaster Management, Rawat Publication, New Delhi,
2000
Course Outcomes
On completion of the course, students will be able to
1. Explain the key concepts, perspectives of Emergency Management in
terms of Endogenous and Exogenous hazards.
2. Apply the emerging approaches in disaster management.
3. Apply integrated approach for disaster preparedness, mitigation and
awareness,
4. Discuss work of various institutions related to Monitoring Management
i.e., various international organizations.
L T P C
3 0 0 3
Objectives:
The course demonstrates an in depth understanding of the tools and the
scripting languages necessary for design and development of various real
time applications. The instructor is advised to discuss examples in the
context of real time scenarios and give exposure to the Industry.
Unit I
Introduction and overview
Introduction - Scripts and Programs, Origin of Scripting, Scripting Today,
Characteristics of Scripting Languages, Uses for Scripting Languages, Web
Scripting, and the universe of Scripting Languages,
Python Basics– Introduction, Features, Versions, input/output, Comments,
Literal constants, Numbers, Strings, Variables, Identifier naming, Data types,
Operators and Expressions , Syntax and Style - Statements and Syntax,
Basic Style Guidelines, Memory Management. Conditional Statements and
Loops: Indentation rules, if, if-else, if-elif-else, while, for, break, continue,
pass, and related examples.
Unit II
Sequences: Strings, Lists, Tuples and sets, Lists -Operators, Built-in
Functions, List Type Built-in Methods, Special Features of Lists, Tuples-
Tuple Operators and Built-in Functions, Special Features of Tuples, sets -
Operators, Built-in Functions, set Type Built-in Methods, Dictionaries -
Operators, Built-in Functions, Dictionary Type Built-in Methods, Dictionary
Keys.
Functions – Introduction, creating functions, calling functions, passing
functions, formal arguments, positional arguments, and default arguments,
variable length arguments, non-keyword variable length arguments, keyword
variable arguments, calling functions with variable arguments. Anonymous
functions and lambda, Built-in functions Variable scope, recursion
Unit III
Modules– Introduction, namespaces, importing modules, importing module
attributes, module built-in Functions. Introduction to Pdb, PIL, urllib
modules, mysqldb ,Files - File Objects, File Built-in Function, File Built-in
CMR College of Engineering & Technology Page 229
B.Tech(CSE) R-15
Unit IV
Introduction to PERL -. PERL- Names and Values, Variables, Scalar
Expressions, Control Structures, arrays, list, hashes, strings, pattern and
regular expressions, subroutines
Unit V
Advanced PERL- Finer points of looping, pack and unpack, file system,
eval, data structures, packages, modules, objects, interfacing to the operating
system, Creating Internet ware applications, Dirty Hands Internet
Programming, security Issues.
Text books:
nd
1. Chun, J Wesley, Core Python Programming, 2 Edition, Pearson, 2007
Reprint 2010.
2. The World of Scripting Languages, David Barron, Wiley Publications.
3. Python Web Programming, Steve Holden and David Beazley, New
Riders Publications.
4. Thomas A Powell, Fritz Schneider, ―JavaScript: The Complete
Reference‖, Third Edition, Tata McGraw Hill, 2013.
5. Beginning JavaScript with Dom scripting and AJAX, RussFerguson,
Christian Heilmann, Apress.
6. JQuery Cookbook, SPD O‘Reilly
Reference books:
1. Open Source Web Development with LAMP using Linux, Apache,
MySQL, Perl and PHP, J.Lee andB.Ware(Addison Wesley) Pearson
Education.
2. Programming Python,M.Lutz,SPD.
3. PHP 6 Fast and Easy Web Development, Julie Meloni and Matt Telles,
Cengage Learning Publications.
4. PHP 5.1, I.Bayross and S.Shah, The X Team, SPD.
Course Outcomes:
On completion of the course students will be able to
1. Identify the difference between a program and a script
2. Write applications using python programming language primitives
3. Create uses defined functions in python scripts
4. Develop python applications using python in-built libraries
5. Design applications using perl programming language primitives
L T P C
3 1 0 3
Objectives:
To understand different software testing techniques and strategies.
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.
Unit III
Domain Testing:-domains and paths, Nice & ugly domains, domain testing,
domains and interfaces testing, domain and interface testing, domains and
testability.
Paths, Path products and Regular expressions: - path products & path
expression, reduction procedure, applications, regular expressions & flow
anomaly detection.
Unit IV
Logic Based Testing:- overview, decision tables, path expressions, kv charts,
specifications.
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 J Meter or Winrunner).
CMR College of Engineering & Technology Page 232
B.Tech(CSE) R-15
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,3rd edition, P.C.Jorgensen, Aurbach
Publications(Dist. by SPD).
3. Software Testing in the Real World – Edward Kit, Pearson.
4. Effective methods of Software Testing, Perry, John Wiley, 2nd Edition,
1999.
5. Art of Software Testing – Meyers, John Wiley.
6. Software Testing, N. Chauhan, Oxford University Press.
7. Software Testing, M.G. Limaye, TMH.
8. Software Testing, S. Desikan, G. Ramesh, Pearson.
9. Foundations of Software Testing, D.Graham & Others, Cengage
Learning.
10. Foundations of Software Testing, A.P. Mathur, Pearson.
11. Software Testing, S.Desikan, G.Ramesh, Pearson.
12. Foundations of Software Testing, D.Graham & Others, Cengage
Learning.
Course Outcomes
L T P C
0 0 2 1
Prerequisites
1. A course on ―Computer Programming and Data Structures‖
2. A course on ―Object Oriented Programming through Java‖
Objectives
1. This course provides an introduction to the script programming paradigm,
and introduces scripting languages such as Perl and Python.
1.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.
2.a) Write a Perl program to implement the following list of manipulating
functions
i) Shift ii) Unshift iii) Push
8. Python 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.
9. Write a Python script that reads data from one file and write into another
file.
10.a) Write a python Function to solve a quadratic equation.
b) Write a Python function to find the factors of given number
Text Books:
1. Programming Perl, 4th edition. Larry Wall, Tom Christiansen, and Jon
Orwant. O'Reilly, 2012.
2. Programming PHP, 3rd edition. Rasmus Lerdorf, Kevin Tatroe, and Peter
MacIntyre. O'Reilly, 2013.
3. Programming Python, 4th edition. Powerful Object-Oriented
Programming. Mark Lutz. O‘Reilly, 2010
Course Outcomes
1. Comprehend the differences between typical scripting languages and
typical system and application programming languages.
2. Explain strengths and weakness of Perl and Python;
3. Select an appropriate language for a solving a given problem.
L T P C
0 0 2 1
List of Programs
1. Write a shell script that accepts a file name, starting and ending line
numbers as arguments and display all the lines between the given line
numbers.
2. Write a shell script that deletes all lines containing the specified word in
one or more files supplied as arguments to it.
3. Write a shell script that displays a list of all files in the current directory
to which the user has read, write and execute permissions.
4. Write a shell script that receives any number of file names as arguments
checks if every argument supplied is a file or directory and reports
accordingly. Whenever the argument is a file, the number of lines on it
is also reported.
5. Write a shell script that accepts a list of file names as its arguments,
counts and reports the occurrence of each word that is present in the
first argument file on other argument files.
8. Write an awk script to find the number of lines in a file that do not
contain vowels.
9. Write an awk script to find the number of characters, words and lines in
a file.
10. Write a C program that makes a copy of a file using standard I/O and
system calls.
12. Write a C program to create a child process and allow the parent to
display ―parent‖ and the child to display ―child‖ on the screen.
15. Write a C program in which a parent writes a message to a pipe and the
child reads the message.
17. Write client and server programs (using C) for connection oriented
communication between server & client processes using unix Domain
sockets to perform the following Client process sends a message to the
server process. The server receives the message reverses it and sends it
back to the client. The client will then display the message to the
standard output device.
Textbooks:
1. Beginning Linux programming 4th Edition, N Mathew, TR Stone,
Wrox, Wiley India Edition.
2. Advanced Unix Programming, N. B. Venkateswarulu, BS Publications.
3. Unix and Shell Programming, B. A. Forouzan and R. F. Gilberg,
Cenegage Learning.
4. Unix and Shell Programming, M. G. Venkatesh Murthy, Pearson
Education, 2005.
5. Unix Shells by Example, 4th Edition, Elllie Quigley, Pearson
Education.
6. Sed and Awk, O. Dougherty & A. Robbins, 2nd Edition, SPD.
Course Outcomes:
VIII SEMESTER
Objectives:
Unit -I
Introduction to Management & Organization: Introduction to
Management: Concepts of Management and organization- nature, importance
and Functions of Management, Taylor‘s Scientific Management Theory,
Fayol‘s Principles of Management, Mayo‘s Hawthorne Experiments,
Maslow‘s Theory of Human Needs, Douglas McGregor‘s Theory X and
Theory Y, Herzberg‘s Two-Factor Theory of Motivation, Systems Approach
to Management, Leadership Styles, Social responsibilities of Management.
Unit -II
Operations & Marketing Management: Principles and types of plant
layout-Methods of Production, Work study Basic procedure involved in
method study and Work Measurement-Business process reengineering
Statistical Quality Control: control charts for variables and Attributes and
Acceptance sampling, Total Quality Management (TQM), Six sigma,
Unit -III
Human Resource Management: Human Resources Management (HRM) :
Concepts of HRM, HRD and Personnel Management and Industrial
Relations (PMIR), HRM vs. PMIR, Basic functions of HR Manager:
Manpower planning, Recruitment, Selection, Training and Development,
Placement, Wage and Salary Administration, Promotion, Transfer,
Separation, Performance Appraisal, Grievance Handling and Welfare
Administration, Job
EvaluationandMeritRating.CapabilityMaturityModel,Levels-Performance
Management System.
Unit -IV
Project Management: Project Management (PERT/CPM) : Network
Analysis, Programme Evaluation and Review Technique (PERT), Critical
Path Method (CPM), Identifying critical path, Probability of Completing the
project within given time, Project Cost Analysis, Project Crashing. (simple
problems)
Unit- V
Strategic Management and Contemporary Strategic Issues: Strategic
Management : Mission, Goals, Objectives, Policy, Strategy, Programmes,
Elements of Corporate Planning Process, Environmental Scanning, Value
Chain Analysis, SWOT Analysis, Steps in Strategy Formulation and
Implementation, Generic Strategy alternatives. Bench Marking and Balance
Score Card as contemporary Business Strategies.
Text Books:
1. Aryasri: Management Science, McGraw Hill,2012.
2. Vijay kumar and Apparao Management Science, Cenage,2012.
References:
1. Kotler Philip & Keller Kevin Lane: Marketing Mangement,
Pearson,2012
2. Koontz &Weihrich: Essentials of Management, McGraw Hill,2012.
3. Thomas N. Duening& John M. Ivancevich Management—Principles
and Guidelines, Biztantra,2012.
Course Outcomes:
L T P C
3 0 0 3
Unit -I
Introduction to Photogrammetry: Principles & types of aerial photograph,
geometry of vertical aerial photograph, Scale & Height measurement on
single vertical aerial photograph, Height measurement based on relief
displacement, Fundamentals of stereoscopy, fiducial points, parallax
measurement using fidcial line.
Unit - II
Remote Sensing: - Basic concept of Remote sensing, Data and Information,
Remote Sensing data collection, Remote sensing advantages & Limitations,
Remote sensing process.
Electro-magnetic Spectrum, Energy interactions with atmosphere and with
earth surface features (Soil, Water, Vegetation), Indian Satellites and Sensors
characteristics, Resolution, Map and Image and False color composite,
introduction to digital data, elements of visual interpretation techniques.
Unit -III
Geographical Information Systems: Introduction to GIS; Components of a
GIS; Geospatial Data: Spatial Data - Attribute data - joining Spatial and
Attribute data; GIS operations: Spatial Data input- Attribute data
Management - Data display - data exploration - Data Analysis.
COORDINATE SYSTEMS: Geographic Coordinate System: Approximation
of Earth, Datum; Map Projections; Types of Map Projection parameters -
Commonly used Map Projections - Projected coordinate Systems.
Unit- IV
Vector Data Model: Representation of simple features - Topology and its
importance; coverage and its data structure, Shape file; Data Models for
composite features Object Based Vector Data Model; Classes and Their
Relationship; The geobase data model; Geometric representation of spatial
Feature and Data Structure, Topology rules.
Unit -V
Raster Data Model: Elements of Raster data Model, Types of Raster Data,
Raster Data Structure, Data Conversion, Integration of Raster and Vector
data.
Data Input: Metadata, Conversion of Existing data, creating new data;
Remote Sensing data, Field data, Text data, Digitizing, Scanning, on Screen
digitizing, importance of source map, Data Editing.
Text books:
1. Remote Sensing and its applications by LRA Narayana University Press
1999.
2. Principals of Geo physical Information Systems – Peter A Burragh and
Rachael A. Mc Donnell, Oxford Publishers 2004.
References:
1. Concepts & Techniques of GIS by C.P. Lo Albert, K.W. Yonng, Prentice
Hall (India)
2. Remote Sensing and Geographical Information systems by M. Anji
Reddy JNTU Hyderabad 2001, B.S. Publications.
3. GIS by Kang – tsung chang, TMH Publications & Co.,
4. Basics of Remote sensing & GIS by S. Kumar, Laxmi Publications.
5. Fundamental of GIS by Mechanical designs John Wiley & Sons.
Course Outcomes
On completion of the course, students will be able to
1. Explain the concepts of Photogrammetry and Remote Sensing
Technology.
2. Acquire skills in handling instruments, tools, techniques and modeling
while using Remote Sensing Technology.
3. Explain the topology, data structure with GIS.
4. Explain the Vector and Rester models using data inputs from the maps.
L T P C
3 0 0 3
Objectives:
To develop an in-depth understanding of the operation of
Microcontrollers, Machine language programming
To acquire the skill set to interface the microcontrollers with outside
world for controlling applications.
Unit-I
Introduction to Microprocessors and Microcontrollers: Introduction to
Microprocessor and Micro Controller, Number system and Binary arithmetic.
Microprocessor Architecture (8085 and 8086) and Microcomputer System,
memory map and addressing, memory classification, review of logic device
for Interfacing, Memory Interfacing, Overview of 8086 Instruction Set,
stacks and Interrupts.
Unit-II
The 8051 Architecture: 8051 Microcontroller hardware, Program Counter
and Data Pointer, A and B CPU registers, Flags and Program Status Word
(PSW),Internal Memory : Internal RAM – Stack and Stack Pointer, Special
Function Registers, Internal ROM, Input / Output Pins, ports and Circuits,
External Memory, Timers and Counters, Serial data Input/ Output, interrupts.
Unit-III
8051 Instruction set: Assembly Language Programming Process,
Addressing Modes, Assembler Directives, Data Transfer, Arithmetic,
Logical and Branch Instructions, Decimal Arithmetic, Interrupt
Programming, Serial Data Communication.
8051 Programming: Basic Assembly Language Programming, Input/
Output Port Programming, 8051 Timer / Counter Programming, 8051 Serial
Communication Programming , 8051 Interrupt Programming.
Unit-IV
8051 Applications: Introduction, Interfacing Keyboards, Key pads,
Interfacing Displays ( Seven Segment Displays and LCD‘s), Interfacing A/D
Convertors, Interfacing D/A Convertors, Interfacing Hardware Circuits for
Multiple Interrupts, 8051 Interfacing with 8255, Interfacing Eternal Memory
with 8051.
Unit-V
Introduction to Advanced Architectures: ARM and SHARC, Processor
and memory organization and Instruction level parallelism; Networked
embedded System: Bus protocols, I2 bus and Can bus; Internet-Enabled
Systems, Design Example-elevator Controller.
Text Books:
1. K.J. Ayala ―The 8051 Micro controller, Architecture, Programming 8-
Applications ―Thomson Delmar Learning
2. RS Gaonkar, ―Microprocessors Architecture, Programming and
Applications ―Penram International.
3. ‗Computers as Components- Principles of Embedded Computing
System Design‘, Wayne Wolf, Elsevier (2 nd Edition)
Reference Books:
1. M. A. Mazidi & J.G Mazidi." The 8051 Micro controller 8- Embedded
System ―Pearson Education.
2. B. Ram ―Fundamentals of Microprocessors and Microcomputers
―Dhanpat Rai and Sons.
Course Outcomes:
Up on completion of the course students will be able to:
1. Explain the internal organization of popular 8051 Microcontrollers.
2. Describe the hardware and software interaction and integration.
3. Perform design and development of Microcontrollers-based systems in
real time scenarios.
Objectives
To understand the basic concepts of different types of electrical
machines and their performance.
To study the different methods of starting D.C motors and induction
motors.
To study the conventional and solid-state drives
Unit I: Introduction
Basic Elements – Types of Electric Drives –Block diagram- factors
influencing the choice of electrical drives – heating and cooling curves –
Loading conditions and classes of duty – Selection of power rating for drive
motors with regard to thermal overloading and Load variation factors
Unit IV: Conventional and Solid State Speed Control of D.C. Drives
Speed control of DC series and shunt motors – Armature and field control,
Ward Leonard control system - Using controlled rectifiers and DC choppers
–applications.
Text Books
1. Vedam Subrahmaniam, ―Electric Drives (concepts and applications)‖,
Tata McGraw Hill, 2001
2. Nagrath .I.J. & Kothari .D.P, ―Electrical Machines‖, Tata McGraw-Hill,
1998
References
1. Pillai. S.K ―A first course on Electric drives‖, Wiley Eastern Limited,
1998
2. M.D. Singh, K.B. Khanchandani, ―Power Electronics‖, Tata McGraw-
Hill, 1998
3. H. Partab, ―Art and Science and Utilisation of electrical energy‖, Dhanpat
Rai and Sons, 1994
Course Outcomes
On completion of the course, students will be able to
1. Point out the factors influencing the choice of electric drives
2. Discriminate different characteristics of electric motors.
3. Illustrate various types of power electronic converters
4. Analyze the solid state speed control of DC drives
5. Elucidate the solid state speed control of AC drives
Course objectives: The content of this course shall provide the student the
basic concepts of various mechanical systems and exposes the student to a
wide range of equipment and their utility in a practical situation. It shall
provide the fundamentals of Steam, I.C. Engines, compressors,
manufacturing methods and transmission systems that usually exist in
engineering.
Unit –I:
Steam boilers: Classification of boilers, essentialities of boilers, selection of
different types of boilers, study of boilers, boiler mountings and accessories.
Performance of boilers, working principle of steam turbines.
Unit-II:
Metal joining: Arc welding, resistance welding, gas welding, brazing and
soldering Metal forming: forging – operations, rolling and extrusion
principles
Machine tools: Lathe classification, specifications, and operations.
Casting: Steps involved in making a casting – Advantages and applications.
– Patterns and Pattern making
Unit-III:
Reciprocating and rotary air compressors: uses of compressed air, types,
working principle, work done, simple problems.
Refrigeration: concepts, principle of refrigeration and types of refrigeration.
Unit-IV:
Internal combustion engines: classification of IC engines, basic engine
components and nomenclature, working principle of engines, Four strokes
and two stroke petrol and diesel engines, comparison of CI and SI engines,
comparison of four stroke and two stroke engines, simple problems such as
indicated power, brake power, friction power, specific fuel consumption,
brake thermal efficiency, indicated thermal efficiency and mechanical
efficiency.
Unit-V:
Belts –Ropes : belt and rope drives, velocity ratio, slip, length of belt , open
belt and cross belt drives, ratio of friction tensions, centrifugal tension in a
belt, power transmitted by belts and ropes, initial tensions in the belt, simple
problems.
Gear trains: classification of gears, gear trains velocity ratio, simple,
compound and reverted gear trains and simple problems.
Text Books:
4. Mechanical Engineering Science/ K R Gopala Krishna/ Subhas
publications
5. Thermal Engineering/ Ballaney, P.L/ Khanna Publishers, 2003
6. Elements of Mechanical Engineering/ A.R.Asrani, S.M.Bhatt and
P.K.Shah/ B.S. Publs.
7. Elements of Mechanical Engineering/ M.L.Mathur, F.S.Metha &
R.P.Tiwari/ Jain Brothers, 2009
8. Production Technology / P.N.Rao/ McGraw-Hill publications
9. Theory of Machines/ S.S. Rattan/ Tata McGraw Hil , 2004 & 2009.
Course Outcomes:
On completion of the course, students will be able to
L T P C
3 0 0 3
Course Objectives
Unit I:
Power Devices
Power diode, Power transistor, Power MOSFET, SCR, TRIAC, GTO, IGBT,
MCT – Protection of power devices.
Unit II
Converters:
Introduction to half wave, full wave and bridge rectifiers: Single phase
and three phase, Half controlled and fully controlled converters,
dual converters, Introduction to cyclo converters and ac controllers.
Unit-III
Inverter and Chopper: Voltage, Current and Load commutation, Voltage
Source Inverter (VSI), Series and Parallel Inverter, Bridger inverter, Single
and Three Phase voltage control using PWM, Current Source Inverter (CSI)
Choppers, Step up and step down choppers, Chopper Classification, Class A,
B, C, D, E, AC Choppers.
Unit-IV
DC and AC Drives
Unit V
Other Applications
Electronic Timers, Digital Counters, Voltage regulators, Online and off line
UPS switched mode power supply, Principle and Application of Induction and
Dielectric heating.
Text book:
1. G. K. Mithal, ―Industrial Electronics‖, Khanna Publishers, Delhi, 2000.
References
1. M. H. Rashid, ―power Electronics Circuits, Devices and Application‖, P
HI, 3rd edition, 2004.
2. G. M. Chute and R. D. Chute, ―Electronics in Industry‖, Mc
Graw Hill Ltd, Tokyo, 1995.
3. F. D. Petruzulla, ―Industrial Electronics‖, McGraw Hill, Singapore,
1996
Course Outcomes:
On completion of the course, students will be able to
L T P C
3 0 0 3
Course objectives: The content of this course shall provide the student the
basic concepts of various mechanical/ electrical/ electronic systems used in
automobiles. It shall provide the fundamentals of power generation, drives
and controls used in automobiles.
Unit – I
Introduction : Components of four wheeler automobile – chassis and body
– power unit – power transmission rear wheel drive, front wheel drive, 4
wheel drive – types of automobile engines, engine construction – engine
lubrication, splash and pressure lubrication systems, oil filters, oil pumps –
crank case ventilation – engine service, re boring, decarburization
Unit – II
Fuel System: S.I. Engine : Fuel supply systems, Mechanical and electrical
fuel pumps – Carburetor – types – air filters – petrol injection.
C.I. Engines: Requirements of diesel injection systems, types of injection
systems, fuel pump, nozzle, Alternative fuels for Automobiles-injection,
Classification, Properties, Hybrid vehicles injection timing, testing of fuel,
pumps.
Cooling System : Cooling Requirements, Air Cooling, Liquid Cooling and
Forced Circulation System – Radiators – Types – Cooling Fan - water pump,
thermostat, evaporating cooling – pressure sealed cooling – antifreeze
solutions.
Unit – III
Electrical System : Charging circuit, generator, current – voltage regulator –
starting system, bendix drive mechanism solenoid switch, lighting systems,
Horn, wiper, fuel gauge – oil pressure gauge, engine temperature indicator
etc.
Ignition System: Function of an ignition system, battery ignition system,
constructional features of storage battery, auto transformer, contact breaker
points, condenser and spark plug – Magneto coil ignition system, electronic
Unit – IV
Transmission System: Clutches, principle, types- cone clutch, single plate
clutch, multi plate clutch, magnetic and centrifugal clutches, fluid fly wheel –
Gear boxes, types, sliding mesh, construct mesh, synchro mesh gear boxes,
epicyclic gear box , over drive torque converter. Propeller shaft – Hoatch –
Kiss drive, Torque tube drive universal joint, differential rear axles – types –
wheels and tyres.
Steering System: Types of steering mechanism – Ackerman steering
mechanism, Davis steering mechanism
Unit – V
Suspension System: Objects of suspension systems – rigid axle suspension
system, torsion bar, shock absorber, Independent suspension system.
Braking System: Mechanical brake system, Hydraulic brake system,
Master cylinder, wheel cylinder tandem master cylinder Requirement of
brake fluid, Pneumatic and vacuum brakes.
Text books
1. Automobile Engineering ,Vol. 1 & Vol. 2/ Kripal Singh
2. Automobile Engineering , Vol. 1 & Vol. 2 ,by K.M Gupta,Umesh
publication
Reference Books
1. A System approach to Automotive Technology by Jack Erjavec YesDee
publishing Pvt Ltd.
2. Automobile Engineering / William Crouse
3. Automotive Mechanics / Heitner
4. Alternative fuels of Automobiles by P.Rami Reddy, Frontline
publications.
Course outcomes:
By undergoing this course, a student shall be able to
1. Identify power generation, transmission and control mechanisms in an
automobile
2. Manipulate the chemical, thermal, mechanical and electrical energies in
an automobile
3. Infer the interaction between subsystems
L T P C
3 0 0 3
Unit – I
Basic concept of EIA : Initial environmental Examination, Elements of EIA,
- factors affecting E-I-A Impact evaluation and analysis, preparation of
Environmental Base map, Classification of environmental parameters.
Unit – II
E I A Methodologies: introduction, Criteria for the selection of EIA
Methodology, E I A methods, Ad-hoc methods, matrix methods, Network
method Environmental Media Quality Index method, overlay methods,
cost/benefit Analysis.
Unit – III
Impact of Developmental Activities and Land use: Introduction and
Methodology for the assessment of soil and ground water, Delineation of
study area, Identification of actives.
Unit – IV
Environmental Audit & Environmental legislation objectives of
Environmental Audit, Types of environmental Audit, Audit protocel, stages
of Environmental Audit, onsite activities, evaluation of Audit data and
preparation of Audit report.
Unit-V
Post Audit activities, The Environmental pollution Act, The water Act, The
Air (Prevention & Control of pollution Act.), Mota Act, Wild life Act.
Case studies and preparation of Environmental Impact assessment statement
for various Industries.
Text books:
1. Environmental Impact Assessment Methodologies, by Y. Anjaneyulu,
B.S. Publication, Sultan Bazar, Hyderabad.
2. Environmental Science and Engineering, by J. Glynn and Gary W. Hein
Ke – Prentice
References:
1. Environmental Science and Engineering, by Suresh K. Dhaneja – S.K.,
Katania & Sons Publication., New Delhi.
2. Environmental Pollution and Control, by Dr H.S. Bhatia – Galgotia
Publication (P) Ltd, Delhi
Course Outcomes
On completion of the course, students will be able to
1. Explain the current EIA methods and the techniques and tools used,
current assessment methods and legislation pertaining to air, water and
land.
2. Prepare an Environmental audit report.
3. Interpret The Environmental Act, The Water Act, The Air (Prevention
and control of pollution Act.), Motor Act and Wild Life Act, with
preparation of EIA statement for various industries.
L T P C
3 0 0 3
Unit-V: Power factor correction and Voltage Control: Causes of low p.f -
Methods of Improving p.f -Phase advancing and generation of reactive
kVAR using static Capacitors-Most economical p.f. for constant kW load
and constant kVA type loads, Numerical Problems. Dependency of Voltage
on Reactive Power flow.- Methods of Voltage Control: Shunt Capacitors,
Series Capacitors, Synchronous Capacitors, Tap changing and Booster
Transformers
Text Books
1. A Text Book on Power System Engineering by M.L. Soni, P.V.Gupta,
U.S. Bhatnagar, A. Chakrabarthy, Dhanpat Rai & Co Pvt. Ltd.
2. Electrical power systems - by C.L. Wadhwa, New Age International (P)
Limited, Publishers, 1998.
Reference Books
1. Elements of Power Station design and practice by M.V. Deshpande,
Wheeler Publishing.
2. Electrical Power Generation, Transmission and Distribution by
S.N.Singh., PHI, 2003.
3. Gas turbine performance, by PP Wals, P.Fletcher, Blackwell Publisher,
2004.
4. Principles of Power Systems by V.K Mehta and Rohit Mehta S.Chand
& Company Ltd., New Delhi 2004.
5. Power system Analysis-by John J Grainger William D Stevenson, TMC
Companies, 4th edition
6. Power System Analysis and Design by B.R. Gupta, Wheeler Publishing.
7. Power System Analysis by Hadi Saadat – TMH Edition.
8. Electrical Power Transmission system engineering Analysis and design
by Turan Gonen, CRC press (Taylor & Francis Group) Special Indian
Edition,2/e.
Course Outcomes
L T P C
3 0 0 3
Course Objective:
The Objective of the course is to provide the candidates with sound
knowledge of the important provisions of the Income Tax law and their
applications.
Unit IV:
Heads and Sources of Income and Exemptions & Deductions under the
Income Tax: Salary and Fringe Benefit Tax, Income from House Property,
Income from Business; Profession or Vocation, Capital Gains, Income from
other sources. (Theory only), Exemptions &Deductions under the Income
Tax Act, Income exempt u/s 10 of the I.T. Act, Permissible deductions under
Chapter VI of I.T. Act, Relief, Double Taxation Relief.
Unit V:
Assessment Procedures: PAN AND TAN, Filing of return and e-filling,
Advance payment of Tax, Tax deduction at source, Tax Collection at Source,
Refund of Tax, and Types of Assessment. Computation of Income in
Individuals
References:
1. Dr H C Meharotra and Dr S P Goyal – Income Tax Law &Accounts
:Sahitya Bhavan Publications.
2. Direct Taxes &Practice :Dr. V K Singhania, Taxman Publications.
3. Gour and Narang - Income Tax Law and Practice, Kalyani Publication
4. Taxation: H.Prem raja - Sri Hamsrala publications
5. Practicals in Taxation: H.Prem raja - Sri Hamsrala publications.
6. Income Tax: B.B. Lal, Pearson Education
7. Taxation: R.G. Saha, Himalaya Publishing House Pvt. Ltd
8. Income Tax: Johar, McGraw Hill Education
9. Taxation Law and Practice: Balachandran &Thothadri, PHI Learning
Course Outcomes:
On completion of the course, students will be able to
1. Explain the basic legal concepts and general principles of Insurance
sector.
2. Describe basic insurance terminology and how insurance works.
3. Implement claim management and settlement.
4. Explain the importance of income tax and its structure
5. Prepare tax assesments, computation of individual Incomes
6. Analyze tax exemptions and deductions of income tax.
7. Explain the producedure for filing e-filing Tax, ITDS, PAN & TAN.