Cse Syllabus
Cse Syllabus
COURSE STRUCTURE
AND
DETAILED SYLLABUS
CSE
COURSE STRUCTURE
(Applicable from the batch admitted from 2018 onwards)
I-SEMESTER
Course
S.No. Category Title of the Course L T P Credits
Code
1 BSC B18MA01 Linear Algebra and Calculus 3 1 0 4
2 BSC B18PH01 Applied Physics 4 0 0 4
3 HSMC B18EN01 English 2 0 0 2
4 ESC B18ME01 Engineering Graphics 1 0 4 3
5 ESC B18CS01 Programming for Problem Solving 4 0 0 4
6 BSC B18PH02 Applied Physics Lab 0 0 3 1.5
7 ESC B18CS02 Programming for Problem Solving Lab 0 0 2 1
8 MC B18MC01 Induction Program - - - 0
Total 14 1 09 19.5
II SEMESTER
Course
S.No Category Title of the Course L T P Credits
Code
Differential Equations and Vector
1 BSC B18MA02 3 1 0 4
Calculus
Basic Electrical & Electronics
2 ESC B18EE02 3 0 0 3
Engineering
3 BSC B18CH01 Engineering Chemistry 3 1 0 4
English LanguageCommunication Skills
4 HSMC B18EN02 0 0 2 1
Lab
Basic Electrical & Electronics
5 ESC B18EE03 0 0 3 1.5
Engineering Lab
6 ESC B18ME02 Engineering Workshop & IT Workshop 0 0 3 1.5
7 MC B18MC04 NSS - - - 0
Total 09 2 8 15
III-SEMESTER
Course
S.No Category Title of the Course L T P Credits
Code
1 PCC B18CS03 Mathematical Foundation of Computer Science 4 0 0 4
2 ESC B18EC49 Digital Logic Design & Micro Processors 3 0 0 3
3 PCC B18CS04 Database Management Systems 4 0 0 4
4 PCC B18CS05 Data Structures through C++ 4 0 0 4
5 PCC B18CS06 Computer Organization & Architecture 4 0 0 4
6 ESC B18EC50 Digital Logic Design & Micro Processors Lab 0 0 3 1.5
7 PCC B18CS07 Database Management Systems Lab 0 0 3 1.5
8 PCC B18CS08 Data Structures through C++ Lab 0 0 3 1.5
9 MC B18MC02 Environmental Sciences 2 0 0 0
Total 21 0 9 23.5
IV-SEMESTER
Course
S.No Category Title of the Course L T P Credits
Code
1 BSH B18MA04 Statistical Methods for Engineers 3 0 0 3
2 PCC B18CS09 Design and Analysis of Algorithms 3 1 0 4
3 PCC B18CS10 Formal Languages and Automata Theory 3 0 0 3
4 PCC B18CS11 Operating Systems 4 0 0 4
5 PCC B18MB01 Managerial Economics & Financial Analysis 3 0 0 3
6 PCC B18CS12 Operating Systems Lab 0 0 3 1.5
7 PCC B18CS13 Web Technologies Lab 0 0 3 1.5
8 PCC B18MC07 Gender Sensitization 2 0 0 0
Total 18 1 06 20
****
AUTONOMOUS
COURSE STRUCTURE
Course
S.No Title of the Course L T P C
Code
B18CS14 Data communications and computer networks 3 0 0 3
B18CS15 Compiler Design 3 1 0 4
B18CS16 Software Engineering 3 0 0 3
B18CS17 Machine Learning 3 0 0 3
B18CS18 Principles of Programming Languages
B18CS19 Computer Graphics 3 0 0 3
B18CS20 Mobile Application Development
B18MB06 Intellectual Property Rights
B18CE54 Disaster Management 3 0 0 3
B18MB02 Management Science
B18CS21 Computer Networks and Compiler Design Lab 0 0 3 1.5
B18CS22 Machine Learning Lab 0 0 3 1.5
B18MC Indian Constitution 2 0 0 0
Total Credits 20 1 6 22
Course
S.No Course Title L T P C
Code
B18CS23 Network Programming 3 0 0 3
B18CS24 Software Testing 3 0 0 3
B18CS25 Data Warehousing and Data Mining 3 0 0 3
B18CS26 Web Services 3 0 0 3
B18CS27 Advanced DBMS
B18CS28 Design Patterns 3 0 0 3
B18CS29 Open Source Software
B18CE53 Air Pollution Control
B18EC23 Biomedical Instrumentation 3 0 0 3
B18EC24 Digital Image Processing
B18EN03 Technical Communication Lab 0 0 3 1.5
B18CS30 Network Programming Lab 0 0 3 1.5
B18CS31 Data Mining and SE Lab 0 0 3 1.5
B18MA09 Logical Reasoning and Quantitative Aptitude 2 0 0 0
Total Credits 20 0 9 22.5
AUTONOMOUS
COURSE STRUCTURE
(R18 Regulations applicable for the batches admitted from Academic Year 2019-20 onwards)
Course
S.No Title of the Course L T P C
Code
B18CS32 Network Security & Cryptography 3 0 0 3
B18MB04 Management And Organizational Behavior 4 0 0 3
B18CS33 Cloud Computing
B18CS34 Information System and Auditing 3 0 0 3
B18CS35 Artificial Intelligence
B18CS36 Soft Computing
B18CS37 Business Intelligence and Big Data 3 0 0 3
B18CS38 Software Project Management
B18ME25 Nano Technology
B18MB03 Entrepreneurship Development 3 0 0 3
B18EC31 Embedded Systems Design
B18CS46 Mini project & Internship 0 0 0 2
B18CS39 Network Security & Cryptography Lab 0 0 3 1.5
B18CS47 Major Project Phase – 1 0 0 8 4
B18CS05 Human Values & Professional Ethics 2 0 0 0
Total Credits 17 0 11 22.5
IV YEAR II-SEMESTER
Course
S.No Course Title L T P C
Code
1 B18CS40 Internet of Things
2 B18CS41 Advanced Operating Systems 3 0 0 3
3 B18CS42 Python Programming
4 B18CS43 Cyber Security & Hacking
5 B18CS44 Service Oriented Architecture 3 0 0 3
6 B18CS45 Information Retrieval Systems
7 B18CS48 Technical Seminar 0 0 2 1
8 B18CS49 Major Project Phase –II 0 0 16 8
Total Credits 6 0 14 15
B.Tech : I-Semester L T P C
3 1 0 4
Pre-requisites: Mathematical Knowledge of 12th / Intermediate level
Objectives: To learn
UNIT-I: Matrices
Matrices: Types of Matrices, Symmetric; Hermitian; Skew-symmetric; Skew-Hermitian;
orthogonal matrices; Unitary Matrices; Rank of a matrix by Echelon form and Normal form,
Inverse of Non-singular matrices by Gauss-Jordan method; System of linear equations; solving
system of Homogeneous and Non-Homogeneous equations, Gauss elimination method; Gauss
Seidel Iteration Method.
UNIT-IV: Calculus
Mean value theorems: Rolle’s theorem, Lagrange’s Mean value theorem with their Geometrical
Interpretation and applications, Cauchy’s Mean value Theorem. Taylor’s Series.
Applications of definite integrals to evaluate surface areas and volumes of revolutions of curves
(Only in Cartesian coordinates), Definition of Improper Integral: Beta and Gamma functions and
their applications.
Course Outcomes:
TEXT BOOKS:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Edition, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John wiley & Sons, 2006.
REFERENCES:
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint,
2002.
2. N.P. Bali and Manish Goyal, A text book of Engineering Mathematics, Laxmi Publications,
Reprint, 2008.
3. Ramana B.V., Higher Engineering Mathematics, Tata McGraw Hill New Delhi, 11th Reprint,
2010.
****
B.Tech : I-Semester L T P C
4 00 4
Course Objectives:
Course outcomes:
TEXT BOOKS:
1. A Text Book of Engineering Physics, Dr. M.N. Avadhanulu, Dr. P.G. Kshrisagar-S.Chand.
2. Modern Engineering Physics (Vol-I & II), Dr. K. Vijaya Kumar, Dr. S. Chandralingam –
S.Chand.
3. Engineering Physics, P.K.Palani Swamy, Scitech Publicatiobs.
4. Electric Devices & Circuits – Millman & Halkies.
REFERENCES:
1. Haliday and Resnick, Physics-Wiley
2. J. Singh Semiconductor Optoelectronics: Physics and Technology, Mc. Graw-Hill inc(1995).
***
(B18EN01) ENGLISH
Learning Objectives: The course will help to a. Improve the language proficiency of students in
English with an emphasis on Vocabulary, Grammar, Reading and Writing skills. b. Equip students
to study academic subjects more effectively and critically using the theoretical and practical
components of English syllabus. c. Develop study skills and communication skills in formal and
informal situations.
SYLLABUS
UNIT –I Social Media
UNIT –V Inventors
UNIT –X Genetics
PRESCRIBED TEXTBOOK:
English for Technical Communication by Sudarshana, N.P. and C. Savitha, Cambridge
University Press.
REFERENCES:
1. Swan, M. (2016). Practical English Usage. Oxford University Press.
2. Kumar, S and Lata, P.(2018). Communication Skills. Oxford University Press.
***
COURSE OBJECTIVES:
Unit-III
Projection of planes: Plane parallel, perpendicular and inclined to one reference plane. Planes
inclined to both the reference planes – Auxiliary Planes;
Projection of Regular Solids-Projection of regular solids, Cube, prisms, pyramids, tetrahedron,
cylinder, Cylinder and cone, axis inclined to one plane and both planes – Auxiliary Views
Projections of Regular Solids.
Unit-IV
Sections and sectional views of right angular solid-Prism, Cylinder, Pyramid, Cone – Auxiliary
Views; Development of surfaces of Right Regular Solids – Prism, Pyramid, Cylinder and Cone.
Course Outcomes:
The students will be able to
1. Introduce Engineering Design and its place in society.
2. Know the fundamental knowledge of various trades and their usage in real time
applications.
3. Exposure to the visual aspects of Engineering Design, Engineering Graphics standards and
solid modeling.
TEXT BOOKS:
1. Agrawal B & Agrawal C.M. (2012), Engineering Graphics, TMH Publications.
2. Bhatt N.D., Panchal V.M. & Ingke P.R., (2014), Engineering Drawing, Charotar
Publishing House.
REFERENCES:
1. Narayana, K.L. & P Kannaiah (2008), Text book on Engineering Drawing, Scitech
Publishers.
2. (Corresponding set of) CAD Software Theory and User Manuals.
3. Engineering Graphics. P I Varghese Tata McGraw Hill Education Pvt. Ltd.
4. Engineering Drawing – P.J.Shan S.Chand Publishers.
5. Engineering Drawing – Johle/Tata McGraw Hill Book Publishers.
****
Course Objectives:
To provide the necessary knowledge on general engineering problem solving methodologies and
to provide necessary foundations for step by step computer program development and to present
the basic concepts in C programming language and to prepare the students to write modular and
readable C Programs. Also the Course introduces the essential concepts like abstract data types,
user defined data types, to analyze the performance of algorithms and how to use such knowledge
for later processing with the help of files and aims to train the students to write working programs
to solve problems.
UNIT -1
UNIT – 2
Control Statements: Branching Statements – if, if-else, else- if, nested-if. Switch statement. Un-
conditional Branching Statement- goto. Looping Statements- while, do-while, for, nested loops.
Break & Continue.
(Chapter 6 : 6.1 – 6.47)
Functions : Introduction, Defining a Function, Types of Functions, Accessing a Function,
Function Prototypes, Passing Arguments to a Function – call by value, Recursion. (Chapter 7: 71.
- 7.26)
Storage Classes: Automatic Variables, External (Global) Variables, Static Variables, Register.
(Chapter 8: 8.1 – 8.13)
UNIT – 3
Arrays: Definition - Single Dimensional Arrays, Multi Dimensional Arrays, Declaration,
Initialization, Reading & Writing elements in to an Array, Passing Arrays to Functions. Linear
Search , Binary search, Bubble sort
(Chapter 9: 9.1 – 9.29 & Reference book 2: )
Strings: Declaration and Initialization of Strings, Reading and Writing a String, String
Manipulation Functions , String as Array of Characters, Array of strings, Sorting of Strings.
(Chapter 10: 10.1 – 10.15 )
Structures and Unions: User-Defined Data Types , Defining a Structure, Processing a Structure,
Array of Structures, Nested Structures, Passing Structures To Functions. Unions. Typedef.
Enumerated types - enum. (Chapter 12:12.1, 12.2, 12.3, 12.5,12.7)
UNIT – 4
Pointers: Introduction, Pointer Declarations, Pointer to Pointer, Operations on Pointers -Pointer
Arithmetic, Dynamic Memory Allocation – Malloc(), Calloc(), Realloc(), Free(). Pointers and
Functions - call by Reference, Pointers and Arrays (one dimensional, two dimensional), Array of
Pointers. Structures and Pointers, Self-Referential Structures.
(Chapter 11: 11.1 – 11.31 & Chapter 12: 12.4 ,12.6)
UNIT- 5
File Handling: Introduction, Text Files and Binary Files, File Handling Functions-Opening and
Closing a File, File Opening Modes, Reading and Writing a File. Random Access File Functions
– fseek() , rewind(), ftell(). (Chapter 13: 13.1 – 13.31)
Command Line Arguments, C Preprocessor Directives (Chapter 15: 15.7,15.20)
Course Outcomes:
Understanding how problems are posed and how they can be analyzed for obtaining
solutions.
Understanding the fundamentals of C programming.
Learning of sequencing, branching, looping and decision making statements to solve
scientific and engineering problems.
Implementing different operations on arrays and creating and using of functions to
solve problems.
Ability to design and implement different types of file structures using standard
methodology.
TEXT BOOK:
1. Byron Gottfried,“Programming with C” , Third Edition(Schaum’s Outlines) McGraw
Hill.
REFERENCE BOOKS:
1. B.A. Forouzan and R.F. Gilberg ,“C Programming and Data Structures” , Cengage Learning
(3rd Edition)
2. Pradip Dey & Manas Ghosh, “Programming in C”, 2nd Edition , Oxford University
Press,2013.
3. E. Balaguruswamy , “Programming in ANSI C “ ,McGraw-Hill Education, 2008.
***
Objectives: The purpose of doing the experiments in laboratory is not simply to verify a principle
but also to explore the other related phenomena and to find their applicability. The students are
suggested to work in this direction and get benefit out of it.
1. To get practical knowledge which is related to the engineering course in the development of
new technologies.
2. To impart fundamental knowledge in handling the equipments in Physics laboratory.
Sl. No. Name of the Experiment
1. Determination of wavelength and radius of curvature of plano convex lens using Newton
Rings Experiment.
2. Study of LED & LASER diode Characteristics.
3. Study PHOTO diode Characteristics.
4. Determination of energy gap of material of p-n junction.
5. Bending losses of optical fibres and evaluation of numerical aperture of a given optical fibre.
6. Study P-N diode Characteristics.
7. Study of Characteristics of solar cell.
8. Determination of wavelength of Laser source – Diffraction grating.
9. Determination of frequency of AC supply – sonometer.
10. Determination of dispersive power of a material of a prism-spectrometer.
Course Outcomes:
The laboratory course helps the student how to operate different equipments related to
engineering. It also allows the student to develop experimental skills to design new experiments in
engineering.
The course enlightens the student about modern equipment like solar cell, optical fibre etc.,
With the exposure to these experiments, the student can compare the theory and correlate with
experiment.
***
B.Tech : I-Semester L T P C
0 0 2 1
Objectives:
To provide the necessary knowledge and practical training on general engineering problem solving
methodologies and to provide necessary foundations for step by step computer program
development and to present the basic concepts in C programming language and to prepare the
students to write modular and readable C Programs. Also the Lab Course implements the essential
concepts like abstract data types, user defined data types, to analyze the performance of algorithms
and how to use such knowledge for later processing with the help of files and aims to train the
students to write working programs to solve problems
WEEK-1
1.a) Write a C program to find the areas of shapes like circle, square, rectangle and
triangle
1.b) Write a C program to demonstrate Type Casting and Type Conversion.
WEEK-2
WEEK-3
3.a) Fibonacci sequence is defined as follows: the first and second terms in
sequence are 0 and 1. Subsequent terms are found by adding the preceding two
terms in the sequence. Write a C program to generate the first n terms of the
sequence.
3.b) Write a C program to generate all the prime numbers between 1 and n, where
n is a value supplied by the user.
3.c) Write a C program to find the second largest number in a set of n numbers.
WEEK-4
WEEK-5
WEEK-6
6.a) Write a C program to find both the largest and smallest number in a list of
integers.
6.b) Write a C program to reverse the elements of an array (i.e., the first value
should become last value etc.)
6.c) Write a C program to insert an element at a given position in an Array using functions.
WEEK-7
7. Write a C program to perform all of the following:
a) Matrix Addition and subtraction
b) Matrix Multiplication
c) Find Transpose and test if a matrix is symmetric or not
d) test if a matrix is identity matrix or not
WEEK-8
WEEK-9
9.a)Write a C program to insert a sub-string in to a given main string at a given
position.
9.b) Write a C program to count number of characters, words and sentences in a given text.
9.c) Write a C program to determine if the given string is a palindrome or not.
9. d) Write a C program to sort the given names in alphabetical order.
WEEK-10
10.a) Write a C program to implement array of structures.(use student structure).
10.b) Write a menu driven C program that uses functions to perform the following
operations on complex numbers stored in a structure:
i.Reading a complex number
ii.Writing a complex number
iii.Addition of two complex numbers
iv.Multiplication of two complex numbers
10.c) Write a C program to demonstrate Unions and enum.
WEEK-11
WEEK-12
12.a)Write a C program using pointer to create a two dimensional matrix, to input values in to the
matrix and to display the matrix and its transpose. Free the memory properly.
WEEK-13
WEEk-14
14.a) Write a C program to produce reverse of the content of a text fie into another
text file and verify the result.
14.b) Write a C program to merge two text files into a third text file ( i.e., the
contents of the first file followed by those of the second are put in the third
file) and verify the correctness.
WEEk-15
15.a) Write a command-line C program to reverse the first n characters in a file.
(Note: The file name and n are specified on the command line.)
15.b)Write a C Program that removes all comment lines from a C source file.
Course Outcomes:
Understanding how problems are posed and how they can be analyzed for obtaining
solutions.
Understanding the fundamentals of C programming.
Learning of sequencing, branching, looping and decision making statements to solve
scientific and engineering problems.
Implementing different operations on arrays and creating and using of functions to solve
problems.
Ability to design and implement different types of file structures using standard
methodology.
***
1. Physical Activity: This would involve a daily routine of physical activity with games and
sports. Each student should pick one game and learn it for three weeks. This would also
involve gardening or other suitably designed activity.
2. Creative Arts: Every student would select one skill related to arts whether visual arts or
performing arts. The student would practice it every day for the duration of the induction
program.
3. Universal Human Values: This will help the students to experience the joy of learning, stand
up to peer pressure, take decisions with courage, be aware of relationships with inmates, etc.
4. Proficiency Modules: During the induction program crash courses have to be conducted to
improve English skills.
5. Lectures by Eminent people: This period can be utilized for lectures by eminent
personalities. It would give the students exposure to people who are in public life and are
socially active.
6. Literary: Literary activity would encompass reading, writing and debating, enacting a play,
etc.
7. Familiarization to Dept./Branch & Innovations: The students are explained about different
methods of study. They are further explained about the different aspects of their branches,
departments and the role they play in the society. The different laboratories, workshops &
other facilities available in the departments are introduced to the students.
Course Outcomes:
Notwithstanding the above activities of the induction program, any other relevant
activity may be planned to enthuse, encourage and benefit the students.
***
B.Tech : II-Semester LT P C
31 0 4
Pre-requisites: Mathematical Knowledge of 12th / Intermediate level
Objectives: To learn
Methods of solving the differential equations of first and higher order.
Evaluation of multiple integrals and their applications
The physical quantities involved in engineering field related to vector valued functions
The basic properties of vector valued functions and their applications to line, surface and
volume integrals
Course outcomes:
After learning the contents of this paper the student must be able to
Identify whether the given differential equation of first order is exact or not
Solve higher differential equation and apply the concept of differential equation to real world
problems
Evaluate the multiple integrals and apply the concept to find areas, volumes, centre of mass
and gravity for cubes, sphere and rectangular parallel piped
Evaluate the line, surface and volume integrals and converting them from one to another
TEXT BOOKS:
1. B.S. Grewal, Higher Engineering Mathematics, Khanna Publishers, 36th Editions, 2010
2. Erwin kreyszig, Advanced Engineering Mathematics, 9th Edition, John Wiley & Sons, 2006
REFERENCES:
1. G.B. Thomas and R.L. Finney, Calculus and Analytic geometry, 9th Edition, Pearson, Reprint,
2002
2. Paras Ram, Engineering Mathematics, 2nd Edition, CBS Publishers
3. S.L. Ross, Differential Equations, 3rd Ed., Wiley India, 1984.
***
UNIT- II: Single Phase AC Circuits - R.M.S. and Average values, Form Factor, steady state
analysis of series, Parallel and Series parallel Combinations of R, L and C with Sinusoidal
excitation, concept of reactance, Impedance, Susceptance and Admittance – phase and phase
difference, Concept of Power Factor, j-notation, complex and Polar forms of representation. Three
Phase AC Circuits: Production of 3 - Voltages, Voltage & Current relationships of Line and
Phase values for Star and Delta connections.
UNIT- III: D.C.Machines: Constructional features, Methods of Excitation, E.M.F. Equation and
Applications, Torque development in D.C motor, Characteristics of DC motors, losses, Efficiency,
Swinburne’s test, Speed control of DC Shunt motors Single Phase Transformers: Construction and
principle of operation, 3-Phase Induction Motor: Constructional features, Principle of Operation
(Basic fundamentals only)
UNIT- IV: P-N Junction Diode - Diode equation, Energy Band diagram, V-I characteristic,
Temperature dependence, Ideal versus practical, Static and dynamic resistances, Equivalent
circuit. Rectifiers and Filters - The P-N junction as a rectifier - A Half Wave Rectifier, Ripple
Factor, Full Wave Rectifier, Bridge Rectifier, Filters – Inductor Filters, Capacitor Filters, Lsection
Filters, π- section Filters.
UNIT- V: Bipolar Junction Transistor (BJT) - Construction, Principle of Operation, CB, CE and
CC configurations. Junction Field Effect Transistor - Construction, Principle of Operation, V-I
Characteristic, Comparison of BJT and FET, Zener Diode and SCR Devices- Zener diode
characteristics, Use of Zener diode as simple regulator, Breakdown Mechanisms in Zener diode,
Principle of Operation of SCR.( Basic fundamentals only)
Course Outcomes: After the course completion, the students are able to:
TEXT BOOKS:
1. Electronic Devices and Circuits – R.L. Boylston and Louis Nashelsky, PEI/PHI, 9th Ed,
2006.
2. Engineering circuit analysis- by William Hayt and Jack E. Kemmerly, Mc Graw Hill
Company, 6th edition.
3. Electrical Machines – by P.S.Bimbra
REFERENCES:
1. Introduction to Electronic Devices and Circuits-Rober T. Paynter, Pearson Education.
2. Electronic Devices and Circuits - K. Lal Kishore, B.S. Publications, 2nd Edition, 2005.
3. Electrical Machines – by J.B.Gupta.
4. Network Theory by N.C.Jagan&C.Lakshminarayana, B.S. Publications.
5. Network Theory by Sudhakar, Shyam Mohan Palli, TMH.
***
(B18CH01)ENGINEERING CHEMISTRY
Course Outcomes: The basic concepts included in this course will help the student to gain:
The knowledge of molecular and electronic changes, band theory related to conductivity.
The knowledge of water treatment and corrosion.
The knowledge of organic reaction mechanisms and polymers.
The required principles and concepts of electro chemistry and batteries.
SUGGESTED READING:
(i)Text book of Engineering Chemistry by Jain & Jain.
(ii)Text book of Engineering Chemistry, CENGAGE learning by Prasanta Rath, B. Ramadevi, Ch.
Venkata Ramana Reddy & Subhendu Chakroborty.
(iii) University chemistry, by B. H. Mahan
(iv) Engineering Chemistry by Shashi Chawla
***
Course Objectives:
The Language Lab focuses on the production and practice of sounds of language to familiarize
the students with the use of English in everyday situations both in formal and informal contexts.
To facilitate computer-assisted multi-media instruction enabling individualized and
independent language learning
To sensitize students to the nuances of English speech sounds, stress and intonation.
To bring about a consistent accent and intelligibility in students’ pronunciation of English
by providing an opportunity for practice in speaking
To improve the fluency of students in spoken English and neutralize the influence of the
sounds of their mother tongue
To train students to use language appropriately for public speaking and interviews
Syllabus
English Language and Communication Skills Lab (ELCS) shall have two parts:
Students should be given practice in listening to the sounds of the language, to be able to
recognize them and find the distinction between different sounds, to be able to mark stress and
recognize and use the right intonation in sentences.
• Listening for general content • Listening to fill in information • Intensive listening • Listening for
specific information
Speaking Skills
Objectives
1. To involve the students in speaking activities in various contexts
2. To enable the students express themselves fluently and appropriately in social and professional
contexts
• Oral practice: Just A Minute (JAM) Sessions • Describing objects/situations/people • Role play –
Individual/Group activities
The following course content is prescribed for the English Language and Communication
Skills Lab based on Unit-6 of AICTE Model Curriculum 2018 for B. Tech First English.
ICS Lab: Understand: Communication at Work Place- Spoken vs. Written language. Practice:
Ice-Breaking Activity and JAM Session- Situational Dialogues – Greetings – Taking Leave –
Introducing Oneself and Others.
Exercise-II
CALL Lab: Understand: Structure of Syllables – Word Stress and Rhythm– Weak Forms and
Strong Forms in Context. Practice: Basic Rules of Word Accent - Stress Shift - Weak Forms and
Strong Forms in Context.
Exercise-III
CALL Lab: Understand: Intonation-Errors in Pronunciation-the Influence of Mother Tongue
(MTI).
Practice: Common Indian Variants in Pronunciation – Differences in British and American
Pronunciation.
ICS Lab: Understand: How to make Formal Presentations. Practice: Formal Presentations.
Exercise-IV
CALL Lab: Understand: Listening for General Details. Practice: Listening Comprehension
Tests.
ICS Lab: Understand: Public Speaking – Exposure to Structured Talks. Practice: Making a Short
Speech – Extempore.
Exercise-V
CALL Lab: Understand: Listening for Specific Details. Practice: Listening Comprehension
Tests.
Course Outcomes:
Students will be able to attain –
Better understanding of nuances of English language through audio- visual experience and
group activities
Speaking with clarity and confidence which in turn enhances their employability skills
***
***
UNIT- I
TRADES FOR EXERCISES: (Any six trades from the following for Mechanical Engineering
Branch & Any four trades for all other Branches with minimum of two exercises in each trade)
1. Carpentry
2. Fitting
3. Tin – Smithy
4. Black Smithy
5. House – wiring
6. Foundry
7. Plumbing
8. Soldering
UNIT- II
TRADES FOR DEMONSTRATION & EXPOSURE
1. Demonstration of Power tools & wiring
2. Welding.
3. Machine Shop
UNIT- III
IT WORKSHOP I: Computer hardware, identification of parts, Disassembly, Assembly of
computer to working condition, simple diagnostic exercises.
IT WORKSHOP II: Installation of operating system windows and Linux simple diagnostic
exercises.
COURSE OUTCOMES:
The students will be able to
1. Know the fundamental knowledge of various trades and their usage in real time Applications.
2. Gain knowledge of Foundry, Welding, Black smithy, Fitting, Machine shop and house wiring.
3. Understand the basis for analyzing power tools in construction and wood working, electrical
engineering and mechanical engineering.
4. Use basic concepts of computer hardware for assembly and disassembly
TEXTBOOKS:
1. Workshop Manual – P.Kannaiah / K.L.Narayana/Scitech Publishers.
2. Workshop Manual – Venkat Reddy/BS Publication / 6th Edition.
***
B.Tech : III-Semester LT PC
4 0 0 4
UNIT-I
Mathematical Logic: Statements and notations, Connectives, Well formed formulas, Truth
Tables, tautology, equivalence implication, Normal forms. Predicates : Predicative logic, Free &
Bound variables, Rules of inference, Consistency, proof of contradiction, Automatic Theorem
Proving.(Refer: Text Book1.P.g.Nos.1,2,7-18,23,24,26,30,32,50-58,68-74,79-88).
UNIT-II
Relations: Properties of binary Relations, equivalence, transitive closure, compatibility and partial
ordering relations. Functions: Inverse Function, Composition of functions, recursive Functions,
Lattice and its Properties,. Refer: Text Book1.P.g.Nos.149, 153,154,164-183,198-201,232).
UNIT-III
Elementary Combinatorics: Basis of counting, Combinations & Permutations, with repetitions,
Constrained repetitions, Binomial Coefficients, Binomial Multinomial theorems, the principles of
Inclusion -Exclusion. Pigeon hole principles and its application... (Refer: Text Book2.P.g.Nos.125,
126,143,162,172,189,201,211).
UNIT-IV
Recurrence Relation : Generating Functions, Function of Sequences Calculating Co-efficient of
generating function, Recurrence relations, Solving recurrence relation by substitution and
Generating functions. Characteristics roots solution of In- homogeneous Recurrence Relation...
(Refer: Text Book2.P.g.Nos.237, 247,264,280,300,306).
UNIT-V
Graph Theory: Basic Concepts,Isomorphisms and Subgraphs,Trees and Their Properties
Spanning Trees,B.F.S,D.F.S. Directed Trees, Binary Trees, Planar Graphs, Euler’s
Formula,Multigraphs and Euler Circuits, Hamiltonian Graphs, Chromatic Numbers, The Four-
Color Problem...(Refer: Text Book2.P.g.Nos.437,449,468,480,498,507,523,530,535,452,558,569).
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to Computer Science-J.P.Tremblay
R.Manoharn, Tata McGraw Hill.
2. Discrete mathematics for computer scientists & mathematicians JL Mott, A Kandel, T.P.Baker
PHI.
REFERENCE BOOKS:
1. Discrete Mathematics and its Applications, Kenneth H.Rosen, Fifth Edition.TMH.
2. Discrete Mathematical Structures Theory and application-Malik & Sen, Cengage.
3. Discrete Mathematics with Applications, Thomas Koshy, Elsevier.
4. Logic and Discrete Mathematics, Grass Man & Trembley, Pearson Education.
5. Mathematical Foundations of Computer science ,3rd Edition, Dr. D.S.C.
****
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, and to develop an in-depth
understanding of the operation of microprocessors. Machine language programming.
UNIT – I
Number systems, conversion, signed binary numbers, floating point number representation, binary
codes, digital logic gates, Boolean algebra, basic theorems & properties, Boolean functions,
canonical and standard forms
UNIT – II
Gate level minimizations, K-Map - three variable, four variable and five variable, SOP, POS
simplifications, NAND and NOR implementation and other two level implementation.
Unit – III
Combinational circuits for code converters, Binary adders, subtractor, basic multiplier,
comparator, decoders, encoders, multiplexers and demultiplexers, latches, flip-flops counters and
shift registers
Unit – IV: 8086 Architecture and Register Organization, Memory Organization & Segmentation,
8086 flag register, Minimum Mode & Maximum Mode with Timing Diagrams, Signal description
of 8086 common function signals.
Unit – V
Addressing Modes of 8086, instruction set & formats, Assembly language programs involving
Branch & Call instructions, sorting, evaluation of arithmetic expressions.
Course Outcomes:
Upon completion of the course, students should possess the following skills:
Understand the basic concepts of different Number systems and basic theorems using in
Boolean algebra.
Design the logic circuits using basic logic gates by reducing the Boolean expressions with
the help of Karnaugh Map.
Analyze various types of combinational and sequential circuits.
Understand the internal organization of popular 8086microprocessors.
Learn the design of microprocessors – based systems
TEXT BOOKS:
REFERENCE BOOKS:
***
Objectives:
This Course provides an emphasis on how to organize, maintain and retrieve information
efficiently and effectively from a Database and it presents an introduction to data base
management systems (DBMS) and relational data model. Also the course introduces the concepts
of transactions and transaction processing and the issues and techniques relating to concurrency
and recovery in multi-user database environments. .
UNIT- I: Introduction
Database system Applications - Database System versus File Systems - View of Data– Instances
and schema - Data Models - Database Languages -DDL-DML - Database Users and Administrator
–Transaction Management - Database System Structure-Application Architectures – History of
Database Systems.(Text book1 Chapter 1:-Refer Pg.No 1-24 & 27-30)
Course Outcomes:
TEXT BOOKS:
REFERENCES BOOKS:
****
B.Tech : III-Semester L T PC
4 0 0 4
Pre-requisites: Programming for Problem Solving
Objectives:
To provide a comprehensive working knowledge on the object oriented language C++ and to
implement abstract data types, linear and nonlinear data structures for problem solving. To provide
a foundation on generic programming based on over loading concepts, inheritance and virtuality.
To inculcate ability to grasp the behavior of data structures such as stacks, queues, trees, hash
tables, search trees, graphs and their representation and to apply them in problem solving. To
provide a working knowledge on programs to solve problems on arrays, linked lists, stacks,
queues, trees, graphs, hash tables and search trees
UNIT-1
C++ Class Overview- Class Definition, Objects, Class Members, Access Control, Class Scope,
Constructors and destructors, parameter passing methods, Inline functions, static class members,
this pointer, friend functions, dynamic memory allocation and de-allocation (new and delete).
UNIT-2
Function over Loading, Operator Overloading, Generic Programming- Function and class
templates, Inheritance basics, base and derived classes, inheritance types, base class access
control,
runtime polymorphism using virtual functions, abstract classes.
UNIT-3
Algorithms, performance analysis- time complexity and space complexity. Review of basic data
structures- The list ADT ( Single Linked List, Double Linked List, Circular Linked List), Stack
ADT, Queue ADT, implementation, operations- insertion, deletion and searching. Hash Table
Representation, Hash functions, collision resolution-separate chaining, open addressing-linear
probing, quadratic probing, double hashing, rehashing, extendible hashing.
UNIT-4
Priority Queues _ Definition, ADT, Realizing a Priority Queue using Heaps, Definition, insertion,
Deletion. Trees definitions. Binary Search Trees ADT - Implementation, Operations Searching,
Insertion and Deletion.AVL Trees, Definition, Height of an AVL Tree, Operations _ Insertion,
Deletion and Searching. B-Trees, B-Tree of order m, height of a B-Tree, insertion, deletion and
searching, Comparison of Search Trees
UNIT-5
Course Outcomes:
To find the difference between structured programming and object oriented programming
language and understanding the features of C++ supporting object oriented programming.
To explain and apply the major object oriented concepts to implement object oriented
programs in C++.
To build the basic knowledge to handle operations like insertions, deletions, searching, and
traversing mechanisms in linear data structures.
Examine with advanced data structure such as hash tables and priority queue data
structures.
Ability to have knowledge on trees, balaned trees,graphs and developing C++ code for
non-
linear datastructures and Pattern Matching Alogorithms.
TEXT BOOKS:
1. The C++ Programming Language 3rd Edition Bjarne Stroustrup, Pearson Education.
2. Data Structures: A Pseudocode Approach with C++, Richard F Gilberg, Behrouz A
Forouzan, Cengage Learning
3. Data structures, Algorithms and Applications in C++, S.Sahni, University Press (India)
Pvt.Ltd, 2nd edition, Universities Press Orient Longman Pvt. Ltd.
REFERENCES:
1. Object Oriented Programming With C++ 5th Edition ,E Balaguruswamy, Tata Mcgraw Hill
Education Private Limited
2. Problem solving with C++, The OOP, Fourth edition, W.Savitch, Pearson education.
3. Data structures and Algorithm Analysis in C++, Mark Allen Weiss, Pearson Education. Ltd.
Second Edition.
4. Data structures and algorithms in C++, 3rd Edition, Adam Drozdek,Cengage Learning.
5. Data Structures Using C++, D.s. Malik,Cengage Learning, India Edition.
***
Objectives:
To make the students learn the fundamentals of computer organization and its relevance to
classical and modern problems of computer design, make them understand the structure and
behavior of various functional modules of a computer, understand the techniques that computers
use to communicate with I/O devices, understand the concepts of pipelining and the way it can
speed up processing and to understand the basic characteristics of multiprocessors.
PIPELINE:
Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline. (Text
book 2: pg 301-320)
Course Outcomes:
Perceive basics Computer types,buses, registers.
Understand basic design of Computer, addressing modes, Micro Program Example.
Perceive control unit operations and arithmetic Operations.
Understand various Peripheral devices operations.
Design memory organization that use banks for different word size operations.
TEXT BOOKS:
1. Computer Organization “Carl Hamacher, Zvonks Vranesic, SafeaZaky” , , 5th edition,
McGraw Hill, New Delhi, India 2002 (Unit-I).
2. “Computer Systems Architecture”, 3/e, M. Moris Mano, PEA, 2007 (Unit-II, III, IV, V).
REFERENCE BOOKS:
1. “Computer Organization and Architecture”, 8/e, William Stallings, PEA, 2010.
2. “Andrew S. Tanenbaum , Structured Computer Organization”, 5th edition, Pearson
Education Inc, New Jersy 2006.
3. Sivarama P. Dandamudi , “Fundamentals of Computer Organization and Design”,
Springer Int. Edition, USA 2003.
***
Pre-Requisites: None
Course Objectives:
Understand need of microprocessors, microcontrollers and to know complete
architectural, programming, details of 8086 microprocessor
This course provides in depth knowledge of switching theory and the design techniques
of digital circuits
The following programs are to be written for assembler and execute the same with 8086 kits.
1. 16 bit addition, subtraction, multiplication & division.
2. LCM(Least common multiple)
3. Greatest common divisor(GCD)
4. Fibonacci series.
5. Sorting of numbers (ascending and descending order)
6. String manipulation.
7. Searching of numbers(largest and smallest)
Course Outcomes:
Demonstrate various types of logic gates (AND, OR, NOT, NAND, NOR, XOR, XNOR)
and flip flops.
Analyze and design various types of combinational and sequential circuits.
Develop microprocessor based programs for Arithmetic and Logical Operations
Develop microprocessor based programs for various problems.
***
Note: The student is required to submit a document relationships in a tabular fashion to the lab
teacher.
WEEK 4: Normalization
Database normalization is a technique for designing relational database tables to minimize
duplication of information and, in so doing, to safeguard the database against certain types of
logical or structural problems, namely data anomalies. For example, when multiple instances of a
given piece of information occur in a table, the possibility exists that these instances will not be
kept consistent when the data within the table is updated, leading to a loss of data integrity. A table
Passport_ID Ticket_id
You can do the second and third normal forms if re wired. Any ht)* given Normalized tables are at
the end.
WEEK 7: Querying
In this week you are going to practice queries ( along with subquries) Using queries ANY, ALL,
IN, Exists, NOT EXISTS, UNION, INTERSECT, Constraints etc.
Course Outcomes:
Design database schema for given Application.
Transform ER Model to Relational Model.
Apply the normalization techniques for development of application software to realistic
problems.
Construct SQL queries to retrieve information from databases.
***
TEXT BOOKS:
1. Data structures a pseudo code approach with c++, Indian edition, R.F.Gilberg and
B.A.Forouzan Cengage Learning.
2. Programming Prinicples and Practice using C++, B.Stroustrup, Addition-Wiesly (Pearson
Education)
3. Data Structures and STL,W.J.Collins,mc Graw Hill,Internationational Edition.
4. Data Structures and Algorithms with OODesign patterns in C++,B.R.Priess,John Wiley
&sons.
5. The Art,Philosophy and Science of OOP with C++,Rick Miller,SPD.
6. C++ for Programmers ,P.J.Deitel and H.M.Deitel,PHI/Pearson.
****
UNIT-I Ecosystems:
Definition, Scope, and Importance of ecosystem. Classification, structure, and function of an
ecosystem, Food chains, food webs, and ecological pyramids. Flow of energy, Biogeochemical
cycles, Bioaccumulation, Biomagnification, ecosystem value, services and carrying capacity, Field
visits.
Course Outcomes:
Recall previously learned ecosystem and find how the biodiversity changes went in the
environment.
Demonstrate outlines of types of pollutions and related to day-to-day life.
Organize important seminars on natural resources.
Apply models of food chains and energy flow models to solve the identified parameters.
Classify the types of pollutants and distinguish the functions of sustainable development
that take part in the environment.
Design the experiments with BOD, COD, OD and to estimate the micro organisms which
cause contamination and can propose solutions.
TEXT BOOKS:
REFERENCE BOOKS:
***
Course Outcomes:
Students who successfully complete this course should be able to:
Use probability theory and deals with modeling uncertainty and apply discrete and
continuous probability, in order to evaluate the probability of real world events.
Perform correlation analysis, in order to estimate the nature and the strength of the linear
relationship that may exist between two variables of interest, Perform regression analysis
to estimate the magnitude of change in one variable due to a given change in the other
variable.
Construct confidence interval estimates for population parameters and conduct hypothesis
tests concerning population parameters, for single and multiple populations based on
sample data. Learn non-parametric test such as Chi-Square test for Independence as well as
goodness of fit. And also perform Student T-test and F-test.
TEXT BOOKS:
REFERENCES:
1. Mathematics for engineers series –probability statistics and stochastic process by k.b.datta
and m.a s.srinivas,cengage publications
2. Probability, statistics and stochastic process by prof.a r k prasad., wiely india
3. Probability and statistics by t.k.v.iyengar &b.krishna gandhi
4. A text book of probability and statistics, shahnaz bathul , cengage learning
***
B.Tech : IV-Semester LT P
C
3 1 0
4
Objectives:
This course trains the students to study a few known methods of solution processes, build
new solution algorithms, analyze the asymptotic performance of algorithms and to write
rigorous correctness proofs for algorithms.
Focus would be to make the students to choose the appropriate data structures and
algorithm design methods for specified classes of applications.
To understand how the choice of data structures and algorithm design methods would
impact the performance of programs and how to compare them.
Design methods such as the greedy method, divide and conquer, dynamic programming,
backtracking and branch and bound; and methods to deal with logarithmic type,
polynomial type and non-polynomial type of classes of problems.
Synthesis of efficient algorithms in common engineering design situations would be
discussed.
UNIT I:
Introduction: Algorithm, algorithm specifications, Performance Analysis-Space complexity,
Time complexity, Asymptotic Notation- Big oh notation, Omega notation, Theta notation and
Little oh notation, mathematical analysis of recursive and non recursive algorithms, Randomized
analysis, Amortized analysis.
Disjoint Sets: Disjoint set operations, union and find algorithms.
UNIT II:
Divide and Conquer: General method, Applications-Binary search, Quick sort, Merge sort,
Stassen’s matrix multiplication, Selection Problem.
Greedy method: General method, Applications-Job sequencing with deadlines, knapsack
problem, Minimum cost spanning trees, Single source shortest path problem.
UNIT III:
Dynamic Programming: General method, Applications-Matrix chain multiplication, Optimal
binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Travelling sales person
problem, Reliability design, Rod cutting problem.
Differences between Greedy method and Dynamic programming approaches.
UNIT IV:
Backtracking: General method, Applications-n-queen problem, sum of subsets problem, graph
coloring, Hamiltonian cycles, connected components and biconnected components.
Branch and Bound: General method, Applications - Travelling 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, proofs-CLIQUE is NP Complete, NP completeness of Vertex covering
problem, independent set is NP-Complete.
Course Outcomes:
Analyze running times of algorithms using asymptotic analysis.
Describe the divide-and-conquer paradigm and explain when an algorithmic design
situation calls for it. Recite algorithms that employ this paradigm. Synthesize divide-and-
conquer algorithms. Derive and solve recurrences describing the performance of divide-
and-conquer algorithms.
Describe the dynamic-programming paradigm and explain when an algorithmic design
situation calls for it. Recite algorithms that employ this paradigm. Synthesize dynamic-
programming algorithms, and analyze them.
Describe the greedy paradigm and explain when an algorithmic design situation calls for it.
Recite algorithms that employ this paradigm. Synthesize greedy algorithms, and analyze
them.
Describe the backtracking paradigm and explain when an algorithmic design situation calls
for it. Recite algorithms that employ this paradigm. Synthesize greedy algorithms, and
analyze them.
Describe the branch and bound paradigm and explain when an algorithmic design situation
calls for it. Recite algorithms that employ this paradigm. Synthesize greedy algorithms,
and analyze them.
To describe two classes of problems: the NP-Hard and NP-Complete problems.
TEXT BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam,
Galgotia publications pvt. Ltd.
2. Design and Analysis of Algorithms, S.Sridhar Oxford Higher Education.
REFERENCES:
1. Introduction to Algorithms, secondedition, T. H. Cormen, C. E. Leiserson, R. L. Rivest,
and C. Stein, PHI Pvt. Ltd. / Pearson Education
2. Design and Analysis Algorithms - Parag Himanshu Dave, Himanshu Bhalchandra Dave
Publisher: Pearson
3. Algorithm Design: Foundations, Analysis and Internet examples, M. T. Goodrich and R.
Tomassia, John wiley and sons.
4. Introduction to Design and Analysis of Algorithms A strategic approach, R. C. T. Lee, S.
S. Tseng, R. C. Chang and T. Tsai, Mc Graw Hill.
5. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson
education.
6. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson education.
7. Algorithms – Richard Johnson baugh and Marcus Schaefer, Pearson Education
8. Data Structures and Algorithms C V Sastry, CH Rajaramesh & Rakesh Nayak I K
International Publishing HouseISBN-13: 978-9385909849
***
B.Tech : IV-Semester LT
PC
3003
Pre-Requisites: (A9510) Mathematical Foundation & Computer Science..
Objectives:
The purpose of the course is to make students
Understand all basic concepts in theoretical computer science and its application
language-theory ideas, such as regular expressions and context free grammers, in
the design of software, such as compliers and textprocessors.
Understand various Computing models like Finite State Machine, Pushdown
Automata, and TuringMachine.
Understand Decidability and Undecidability of variousproblems.
Classify machines by their power to recognizelanguages
Comprehend the hierarchy of problems arising in the computersciences.
Qualified to have an insight of the software for a better and efficient utilization of
time andresources
Eligible of understanding the given CFL and defining a newLemma.
Unit-I
Fundamentals: Strings, Alphabet, Language, Set Notations, Relations, transition
diagrams and Language recognizers(1, 6, 16)
Finite Automata: Finite State System, Basic definitions, Deterministic Finite
Unit-II
Regular expression & Regular Languages: regular expressions, Regular sets,
identity rules, equivalence and Conversion of Regular expressions to Finite Automata
& vice-versa, pumping lemma of regular sets.
Context Free Grammars – I: Regular Grammar– Right linear grammar, Left Linear
Grammar, Equivalence between Regular Grammar and Finite Automata & Inter
Conversion. Derivations – Light Most Derivation (RMD), Left Most Derivation (LMD)
Derivation Trees.(217, 219)
(Ref .Introduction to Theory of Computation –Sipser 2nd edition Thomson Pg.No:66-76)
Unit-III
Context Free Grammars – II: Simplification of Context Free Grammars, Chomsky
Normal Form, Greibach normal form, Pumping Lemma for Context Free Languages,
Enumeration of properties of CFL(without Proof) (87, 92 ,94, 125, 177), CYK
Algorithm.
Pushdown Automata: Informal descriptions,Definitions, Model, Acceptance of CFL –
Acceptance by final State, Acceptance by empty stack. Pushdown Automata Versus
CFL‘s – equivalence & conversions. (107,108, 112, 114)
Unit-IV
Turing Machine: Introduction, The Turing Machine Model, Computable Languages
and Functions, Techniques for Turing Machine Construction, Modifications of Turing
Machine, Variants of Turing Machine(146, 147, 150)
(Ref. Introduction to Theory of Computation –Sipser 2nd edition Thomson Pg.No:150-155)
Unit-V
Computability Theory: Universal Turing Machine and an Undecidable Problem,
Undecidability of Post‘s Correspondence problem, Chomsky Hierarchy of Languages,
Linear Bounded Automata and Context Sensitive language, LR(0) grammar, LR(0)
Grammars and PDA‘s (181, 193, 271, 255), 223, 248, 107)
Course Outcomes:
TEXT BOOKS:
1. Introduction to Automata Theory Languages and Computation‖. Hopcroft H.E.
and Ullman J. D. PearsonEducation
2. Introduction to TheoryofComputation‖–Sipser2nd edition Thomson
REFERENCE BOOKS:
***
B.Tech : IV-Semester LT P C
40 0 4
Pre-Requisites: Computer Organization & Architecture.
Objectives:
UNIT - I
Overview-Introduction-Operating system objectives, User view, System view, Operating system
definition ,Computer System Organization, Computer System Architecture, OS Structure, OS
Operations, Process Management, Memory Management, Storage Management, Protection and
Security, Special Purpose Systems, Computing Environments.
System Structures- Operating System services, User and OS Interface, System Calls, Types of
System Calls, System Programs, Operating System Design and Implementation, OS Structure.
UNIT - II
UNIT – III
Memory-Management Strategies-Background, Swapping, Contiguous Memory Allocation,
Segmentation, Paging, Structure of the Page Table, Example: Intel 32 and 64-bit Architectures.
Virtual-Memory Management- Demand Paging, Copy-on-Write, Page Replacement, Thrashing.
UNIT – IV
Deadlocks-System Model, Deadlock Characterization, Methods for Handling Deadlocks,
Deadlock Prevention, Deadlock Avoidance, Deadlock Detection, and Recovery from Deadlock.
File System -File Concept, Access Methods, Directory and Disk Structure, Protection.
Implementing File-Systems - File-System Structure, File-System Implementation, Directory
Implementation, Allocation Methods, Free-Space Management.
UNIT – V
Mass Storage Structure – Overview of Mass Storage Structure, Disk Structure, Disk Attachment,
Disk Scheduling, Disk Management, RAID structure, Swap space Management.
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.
Course Outcomes:
Upon completion of course, the student will be able to learn the following
Remember minimization of turnaround time, waiting time and response time and also
maximization of throughput by keeping CPU as busy as possible.
Understand the design and solve synchronization problems.
3Apply optimization techniques for the improvement of system performance
Analyze to design and solve synchronization problems.
Ability to change access controls to protect files.
TEXT BOOKS:
1. Operating System Concepts , Abraham Silberschatz, Peter B. Galvin, Greg Gagne, 9th
Edition, Wiley, 2016 India Edition
2. Operating Systems – Internals and Design Principles, W. Stallings, 7th Edition, Pearson.
REFERENCE BOOKS:
1. Modern Operating Systems, Andrew S Tanenbaum, 3rd Edition, PHI
2. Operating Systems: A concept-based Approach, 2nd Edition, D.M. Dhamdhere, TMH.
3. Principles of Operating Systems, B. L. Stuart, Cengage learning, India Edition.
4. An Introduction to Operating Systems, P.C.P. Bhatt, PHI.
5. Principles of Operating systems, Naresh Chauhan, Oxford University Press.
****
B.Tech : IV-Semester L T P
C
30 0 3
Course Objective:
To enable the student to understand and appreciate, with a practical insight, the imporlance of
certain basic issues governing the business operations namely: demand and supply, production
function, cost analysis, markets, forms of business organisations, capital budgeting and financial
accounting and financial analysis.
Unit-I
lntroduction & 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.
Unit-II
Production & Cost Analysis: Production Function-
lsoquants and lsocosts, MRTS, Least Cost Combination of lnputs, Cobb-Douglas Production
function, Laws of Returns, lnternal and External Economies of Scale. Cost Analysis: Cost
Unit-III
Markets & New Economic Environment:
Types of competition and Markets, Features of Perfect competition, Monopoly and Monopolistic
Competition. Price-Output Determination in case of Perfect Competition and Monopoly. Pricing
Objectives and Policies of Pricing. Methods of Pricing. Eusrness; Features and evaluation of
different forms of Business Organisation: Sole Proprietorship, Partnership, Joint Stock Company,
Public Enterprises and their types, New Economic Environment Changing Business Environment
in Post-liberalization scenario.
Unit-IV
Capital Budgeting:
Capital and its significance, Types of Capitat, Estimation of Fixed and Working capital
requirements, Methods and sources of raising capital - Trading Forecast, Capital Budget, Cash
Budget. 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 - lntroduction 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 lnterpretation of Liquidity Ratios, Activity Ratios, and Capital
structure Ratios and Profitability ratios. Du Pont Chart'
Course Outcomes:
TEXT BOOKS:
REFERENCES:
***
Objective:
Syllabus Content
Week 13: Write a C program to solve the Dining- Philosopher problem using semaphores.
Course Outcomes:
Upon completion of lab course, the student willbe able to learn the following
The course objectives ensure the development of students applied skills in operating systems
related areas.
Students will gain knowledge in writing software routines modules or implementing various
concepts of operating system.
TEXT BOOKS:
1. Operating System Concepts- Abraham Silberchatz, Peter B. Galvin, Greg Gagne 9th
Edition, John Wiley.
2. Operating Systems‘ – Internal and Design Principles Stallings, Sixth Edition–
2005,Pearsoneducation.
REFERENCES:
****
Objectives:
This course introduces basic concepts of Object oriented Programming concepts, apply them
in Problem solving and to learn the basics of java Console and GUI based Programming.
Understand the basic and some advanced issues related to writing classes and methods such
as data, visibility, scope, method parameters, object references, and nested classes. Develop
solid Java programming skills and the ability to put in practice they acquired knowledge and
understanding of the Java language and object-oriented design in relatively simple case
studies.
The goal of this course is to equip students with advanced design and programming
techniques in object oriented programming paradigms. To this end, specific objectives are to
increase students knowledge of object-oriented design concepts. To get knowledge and skills
needed to develop reusable, quality programs. To instruct students on the use of object-
oriented design tools for modelling problem solutions and complex systems and to increase
student‘s proficiency in programming in object-oriented environments and also enable the
student to learn program web applications using the technologies like javascript, PHP,
Tomcat server, jsp, struts....
Syllabus Content
Week-1:
Write a program to demonstrate class.
Write a java program to implement constructor overloading.
Write a program on multiple inheritance using interfaces.
Week-2:
Write a program on this keyword.
Write a program on super keyword.
Write a program on abstract class.
Write a program that illustrates how run time polymorphism is achieved.
Week-3:
Write a java program to implement following exception types
try - catch .
throw .
user defined exceptions.
Multiple exceptions
Week-4:
Department of Computer Science & Engg.,-VCE 66
B.Tech-CSE R18 Regulations
Week-5:
Write a Java program that implements a multi-thread application that has three threads. First
thread generates random integer every 1 second and if the value is even, second thread
computes the square of the number and prints. If the value is odd, the third thread will print
the value of cube of the number.
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. It takes a
name or phone number as input and prints the corresponding other value from the hash table
(hint: use hash tables).
Week-6:
Write a Java program for handling mouse and keyboard events menu events.
Write a Java program that simulates a traffic light. The program lets the user select one of
three lights: red, yellow, or green with radio buttons. On selecting a button, an appropriate
message with "Stop" or "Ready" or "Go" should appear above the buttons in selected color.
Initially there is no message shown.
Week-7:
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 result. Handle
any possible exceptions like divided by zero.
Week-8:
Write an applet that displays a simple message.
Write a java program for passing parameters to applets.
Develop an applet in Java that receives an integer in one text field, and computes its factorial
Value and returns it in another text field, when the button named "Computer" is clicked.
Week-9:
Write a Java program that connects to a database using JDBC and does add, delete, modify
and retrieve operations.
Write a servlet program to insert the values into database, values should read as a client
request.
Write a servlet program to .Retrieve the results from database depends on client request.
Week-10:
Write a servlet program for communicating first servlet to second servlet.
Write a servlet program for invoking the get and post methods.
Write a servlet program for session tracking using http session.
Week-11:
Write a servlet program for session tracking using cookies
Write a servlet program in the format using http servlet.
Week-12:
Write a program to display a message using JSP.
Write a program to insert Values in to Data Base using JSP pages.
Week-13:
Write a program to retrieve Values from Data Base using JSP pages.
Write a program to handle errors in JSP pages.
Week-14:
Installation of php.
Write a php program to demonstrate arrays.
Write a php program to display welcome message on the browser.
Week-15:
Write a php program to insert form data into a database.
Write a php program to retrieve data from database to browser.
Week-16:
Write a php program to upload a file.
Write a php program to send email.
Course Outcomes:
Able to understand concept of OOP and Java Programming constructs.
To Learn and analyze and design the concept of event handling and Abstract Window
Toolkit.
Apply the concepts of server side technologies for dynamic web applications using PHP ,
Servlets and JSP’s.
Implement the web based applications using effective data base access with rich client
interaction.
TEXT BOOKS:
1. Java Fundamentals- A comprehensive Introduction, Hebert Schildt and Dale Skrien,
2. TMH.
3. The Complete Reference Java J2SE 5th Edition, Herbert Schildt, TMH Publishing
4. Company Ltd, New Delhi.
5. JAVA How to programming by DIETEL&DIETEL.
6. Struts-2 Black Book-2 Edition by Kogent Solutions Inc.
7. The Complete Reference PHP –Steven Holzner, Tata McGraw-Hill.
8. Web Technologies, Uttam K Roy, Oxford University Press.
REFERENCE BOOKS:
1. Java for Programmers, P.J. Dietel and H.M Dietel,Pearson Education (OR) JAVA:
2. How to Program P.J. Dietel and H.M. Dietel, PHI.
3. Object Oriented Programming through Java, P. Radha Krishna, University Press.
4. Thinking in Java, Bruce Ecel, Pearson Education
5. Programming in Java, S. Malhotra and S. Choudary, Oxford Univ. Press.
6. Java Server Pages-Hilbert Schiltz.
7. HTML Black book- 1 st Edition by Steven Holzner.
***
Pre-Requisites: None
Course Objectives:
Unit – 1
Gender: Why Should We Study It?
Unit – 2
Socialization: Making Women, Making Men
2.1 Introduction
2.2 Preparing for womanhood
2.3 Growing up male
2.4 First lessons in caste
2.5 Different masculinities
Unit – 3
Housework: The Invisible Labour
3.1 “My mother does not work”
3.2 “Share the load”
Unit – 4
Missing Women: Sex Selection and Its consequences
4.1 Declining sex ratio
4.2 Demographic consequences
Unit – 5
Knowledge: Through the Lens of Gender
5.1 Point of view
5.2 Gender and the structure of knowledge
Department of Computer Science & Engg.,-VCE 69
B.Tech-CSE R18 Regulations
Unit – 6
Sexual Harassment: Say No!
6.1 Sexual harassment, not eve-teasing
6.2 Coping with everyday harassment
6.3 Further reading: “Chupulu”
Unit – 7
Women‘ Work: Its Politics and Economics
7.1 Fact and fiction
7.2 Unrecognized and unaccounted work
7.3 Further reading: Wages and conditions of work
Unit – 8
Domestic Violence: Speaking Out
8.1 Is home a safe place?
8.2 When women unite [Film]
8.3 Rebuilding lives
8.4 Further reading: New forums for justice
Unit – 9
Whose History? Questions for Historians and Others
9.1 Reclaiming a past
9.2 Writing other histories
9.3 Further reading: Missing pages from modern Telangana history
Unit – 10
Gender Spectrum: Beyond the Binary
10.1 Two or many?
10.2 Struggles with discrimination
Unit – 11
Thinking about Sexual Violence
11.1 Blaming the victim
11.2 “I fought for my life…"
11.3 Further reading: The caste face of violence
Unit – 12
Just Relationships: Being Together as Equals
12.1 Mary Kom and Onler
12.2 Love and acid just do not mix
12.3 Love letters
12.4 Mothers and fathers
12.5 Further Reading: Rosa Parks – The braveheart
Unit – 13
Additional Reading: Our Bodies, Our Health
Course Outcomes:
Students will have developed a better understanding of important issues related to gender in
contemporary India.
Students will attain a finer grasp of how gender discrimination works in our society and how
to counter it.
Students will acquire insight into the gendered division of labor and its relation to politics
and economics.
Men and women students and professionals will be better equipped to work and live together
as equals.
Students will develop a sense of appreciation of women in all walks of life.
Through providing accounts of studies and movements as well as the new laws that provide
protection and relief to women, the text book will empower students to understand and
respond to gender violence.
****
Course Outcomes:
CO-1: A strong foundation in core Computer Science and Engineering, both theoretical and
applied concepts.
CO-2: An ability to apply knowledge of mathematics, science, and engineering to real-world
problems.
CO-7: The broad education necessary to understand the impact of Computer Science and
Engineering solutions in the scientific, societal, and human contexts.
CO-8: A recognition of the need for, and an ability to engage in life-long learning.
TEXT BOOKS:
3. Data Communications and Networking, Fourth Edition by Behrouza A.Forouzan,TMH.
4. Computer Networks,A.S.Tanenbaum,5th edition,Pearson education
REFERENCE BOOKS:
***
Course Objectives:
The main objective of this course is to provide the foundation for understanding the theory and
practice of compilers. Learning programming language translation and compiler design concepts,
language recognition, symbol table management, semantic analysis and code generation. Topics
include specification of languages and its relation to automata, lexical analysis, finite state machines,
context free languages, LL and LR parsing methods, syntax directed translation, error recovery, code
generation, and portability.
UNIT – I
Overview of Compilation: Phases of compilation, lexical analysis, regular grammar and regular
expression for common programming language features. Pass and phases of Translation,
interpretation, cross compiler, bootstrapping, data structures in compilation, LEX lexical analyzer
generator.
(Page No: 22-27, 95-117, 95-117, 106-109, 32-33, 15-16, 432, 23, 117-125)
UNIT – II
Top Down Parsing: Context free grammars, top down parsing, backtracking, LL (1), recursive
descent parsing, predictive parsing, pre-processing steps required for predictive parsing. Elimination
of left recursion and left factoring from CFG (Page No: 97-106)
Bottom up parsing: Shift reduce parsing, LR and LALR parsing, error recovery in parsing,
handling ambiguous grammar, YACC – automatic parser generator.(Page No: 207-215, 227-278).
Department of Computer Science & Engg.,-VCE 73
B.Tech-CSE R18 Regulations
UNIT – III
Semantic Analysis: Intermediate forms of source programs – abstract syntax tree, polish notation
and three address codes. Attributed grammars, syntax directed translation, conversion of popular
programming languages language constructs into intermediate code forms, type checker.
(Page No: 475-484, 92&592, 335)
UNIT – IV
Symbol Tables: Symbol table format, organization for block structures languages, hashing and Tree
structures representation of scope information. Block structures and non block structure storage
allocation: static, runtime stack and heap storage allocation, storage allocation for arrays, strings and
records. (Page No: 441-452, 413-435)
Code optimization: Consideration for optimization, scope of optimization, local optimization, loop
optimization, frequency reduction, folding, DAG representation. (Page No: 595-614, 302-305,105)
UNIT – V
Data Flow Analysis: Flow graph, data flow equation, global optimization, redundant sub Expression
elimination, induction variable elements, live variable analysis, copy propagation.
(Page No: 540-545, 620-635, 643-664)
Object Code Generation: Object code forms, machine dependent code optimization, register
allocation and assignment, generic code generation algorithms, DAG for register allocation.
(Page No: 610-614,553, 579, 558)
Course Outcomes:
After the completion of this course the students should be able to:
Apply the knowledge of modern phases of compiler and its features.
Identify the similarities and differences among varies parsing techniques.
Explain semantic analysis in the context of the compilation process.
Design a symbol table format for the language defined by a grammar
Analyze the code generation algorithm.
TEXT BOOK:
1. Principles of Compiler Design -A.V. Aho . J.D.Ullman; Pearson Education.
REFERENCE BOOKS:
1. lex &yacc , John R. Levine, Tony Mason, Doug Brown, O’reilly
2. Modern Compiler Design- Dick Grune, Henry E. Bal, Cariel T. H. Jacobs, Wiley
Dreamtech.
3. Engineering a Compiler, Cooper & Linda, Elsevier.
4. Compiler Construction, Louden, Thomson.
5. Modern Compiler Implementation in C,Andrew N. Appel, Cambridge University Press.
***
Objectives:
To understanding of software process models such as waterfall and evolutionary models.
To understanding of software requirements and SRS document. To
understanding of different software architectural styles.
To understanding of software testing approaches such as unit testing and integration
testing.
To understanding on quality control and how to ensure good quality software.
UNIT- I
Introduction to Software Engineering: The evolving role of software, Changing Nature of
Software, legacy 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, Specialized 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 designs, mapping data flow
into software architecture.
Modelling 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.
Product metrics: Software Quality, Frame work for Product metrics, 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.
Course Outcomes:
Ability to identify the minimum requirements for the development of application.
Ability to develop, maintain, efficient, reliable and cost effective software solutions
Ability to critically thinking and evaluate assumptions and arguments.
TEXT BOOKS:
Software engineering A practitioner’s Approach, Roger S Pressman, sixth edition
McGraw Hill International Edition.
Software Engineering, Ian Sommerville, seventh edition, Pearson education.
REFERENCE BOOKS:
Department of Computer Science & Engg.,-VCE 76
B.Tech-CSE R18 Regulations
***
UNIT-I:
The ingredients of machine learning, Tasks: the problems that can be solved with machine learning,
Models: the output of machine learning, Features, the workhorses of machine learning. Binary
classification and related tasks: Classification, Scoring and ranking, Class probability estimation
UNIT- II:
Beyond binary classification: Handling more than two classes, Regression, Unsupervised and
descriptive learning. Concept learning: The hypothesis space, Paths through the hypothesis space,
Beyond conjunctive concepts
UNIT-III:
models: Decision trees, Ranking and probability estimation trees, Tree learning as variance
reduction. Rule models: Learning ordered rule lists, Learning unordered rule sets, Descriptive rule
learning, First-order rule learning
UNIT-IV:
Linear models: The least-squares method, The perceptron: a heuristic learning algorithm for linear
classifiers, Support vector machines, obtaining probabilities from linear classifiers, Going beyond
Department of Computer Science & Engg.,-VCE 77
B.Tech-CSE R18 Regulations
linearity with kernel methods. Distance Based Models: Introduction, Neighbours and exemplars,
Nearest Neighbours classification, Distance Based Clustering, Hierarchical Clustering.
UNIT- V:
Probabilistic models: The normal distribution and its geometric interpretations, Probabilistic models
for categorical data, Discriminative learning by optimising conditional likelihood Probabilistic
models with hidden variables. Features: Kinds of feature, Feature transformations, Feature
construction and selection. Model ensembles: Bagging and random forests, Boosting
Course Outcomes:
TEXT BOOKS:
1. Machine Learning: The art and science of algorithms that make sense of data, Peter Flach,
Cambridge.
2. Machine Learning, Tom M. Mitchell, MGH.
REFERENCE BOOKS:
1. Understanding Machine Learning: From Theory to Algorithms, Shai Shalev-Shwartz, Shai Ben-
David, Cambridge.
2. Machine Learning in Action, Peter Harington, 2012, Cengage.
***
PROGRAM ELECTIVE-I
We will study several issues in programming languages: what is a programming language, how do
they work, and why is one language better than another? In answering these questions, it is hoped
that the student will: Gain insight into the underlying principles and concepts of Programming
languages. Gain an understanding of how some well known programming languages implement
these principles and concepts. Gain an overview of programming language translation process. Gain
exposure to some important programming paradigms (imperative, object oriented, functional, and
logic).Improve analytical skills.
UNIT - I Preliminaries
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.(Refer to pg 19 to 51).
Syntax and Semantics: General Problem of describing Syntax and Semantics, Formal Methods of
Describing Syntax-BNF,EBNF for common Programming Language features, Parse trees,
Ambiguous Grammars, Attribute Grammars, Denotational semantics and Axiomatic semantics for
common Programming Language features. (Refer to pg 133 to 174).
Introduction, Primitive, Character, User-Defined, Array, Associative, Record, Union, Pointer and
Reference Types, design and Implementation uses related to these types.(Refer to pg 265 to 313).
.Names, Variables, Concept of Binding, Type Checking, Strong Typing, Type Compatibility, Named
Constants, Variable Initialization. (Refer to pages 219 to 254)
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. (Refer
to pages 329 to 390).
Course Outcomes:
3. Analyze Syntax related concepts including context free grammars, Attribute Grammar parse
trees.
4. Perceive the semantic issues associated with function implementations.
5. Perceive the concepts of Abstraction and Encapsulation constructs of classes ,interfaces,
packages of various Language Examples.
6. Perceive the implementation of object oriented languages.
7. Compare the Functional Programming Languages and Logic Programming Languages.
TEXT BOOKS:
1. Concepts of Programming Languages Robert .W. Sebesta 8/e , Pearson Education,2008.
REFERENCE BOOKS:
1. Concepts of Programming Languages Robert .W. Sebesta 10/e, Pearson Education,2012
2. Programming Languages, 2nd Edition, A.B. Tucker, R.E. Noonan, TMH.
3. Programming Languages, K. C.Louden, 2nd Edition, Thomson, 2003.
4. LISP, Patric Henry Winston and Paul Horn, Pearson Education.
5. Programming in Prolog, W.F. Clocksin & C.S.Mellish, 5th Edition, Springer.
***
Department of Computer Science & Engg.,-VCE 80
B.Tech-CSE R18 Regulations
Prerequisites:
Desired concepts of Problem Solving and Computer Programming, Mathematics, Coordinate
geometry and linear algebra, Engineering Drawing.
Objectives:
This study is designed to provide a comprehensive introduction to computer graphics leading to the
ability to understand contemporary terminology, progress, issues, and trends.
A thorough introduction to computer graphics techniques and focus on 3D modeling, image
synthesis, and rendering.
UNIT I: INTRODUCTION:
Introduction: Application areas of Computer Graphics, Overview of Graphics systems, Video-
Display Devices, Raster –scan system, Random Scan system, Graphics Monitors and Work Stations
and input. (Text book-1, Ch-1 & 2, Pg No. 1-101)
Course Outcomes:
Upon completion of the course, the student should be able to learn the following:
4. Ability to get overview on graphic systems and the applications areas of Computer
Graphics.
5. Ability to learn about basic tools for constructing pictures with straight lines, curves, filled
area, cell-array patterns, and text.
6. Ability to learn about various methods for performing geometric transformations.
7. Ability to learn about various surface functions such as quadrics, polygon surfaces, super
quadrics, splines or blobby objects and 3-Dimensions transformations in computer graphics.
8. Ability to learn major considerations in the generation of realistic graphic displays, detecting
visible surfaces in a 3-Dimension scene and designing the animation sequence.
TEXT BOOKS:
REFERENCE BOOKS:
***
Prerequisites:
6. A Course on Web Technologies (JAVA etc)
7. A Course on DBMS
Course Objectives:
4. To demonstrate their understanding of the fundamentals of Android operating systems
5. To demonstrate their skills of using Android software development tools
6. To demonstrate their ability to develop software with reasonable complexity on mobile
platform
7. To demonstrate their ability to deploy software to mobile devices
8. To demonstrate their ability to debug programs running on mobile devices
UNIT I
Introduction to Android Operating System: Android OS design and Features – Android
development framework, SDK features, Installing and running applications on Eclipse platform,
Creating AVDs, Types of Android applications, Best practices in Android programming, Android
tools. Android application components – Android Manifest file, Externalizing resources like values,
themes, layouts, Menus etc, Resources for different devices and languages, Runtime Configuration
Changes Android Application Lifecycle – Activities, Activity lifecycle, activity states, monitoring
state changes
UNIT II
Android User Interface: Measurements – Device and pixel density independent measuring units
Layouts – Linear, Relative, Grid and Table Layouts User Interface (UI) Components – Editable and
non editable TextViews, Buttons, Radio and Toggle Buttons, Checkboxes, Spinners, Dialog and
pickers Event Handling – Handling clicks or changes of various UI components Fragments –
Department of Computer Science & Engg.,-VCE 83
B.Tech-CSE R18 Regulations
Creating fragments, Lifecycle of fragments, Fragment states, Adding fragments to Activity, adding,
removing, and replacing fragments with fragment transactions, interfacing between fragments and
Activities, Multi-screen Activities
UNIT III
Intents and Broadcasts: Intent – Using intents to launch Activities, Explicitly starting new Activity,
Implicit Intents, Passing data to Intents, Getting results from Activities, Native Actions, using Intent
to dial a number or to send SMS Broadcast Receivers – Using Intent filters to service implicit
Intents, Resolving Intent filters, finding and using Intents received within an Activity Notifications –
Creating and Displaying notifications, Displaying Toasts.
UNIT IV
Persistent Storage: Files – Using application specific folders and files, creating files, reading data
from files, listing contents of a directory Shared Preferences – Creating shared preferences, saving
and retrieving data using Shared Preference Database – Introduction to SQLite database, creating
and opening a database, creating tables, inserting retrieving and deleting data, Registering Content
Providers, Using content Providers (insert, delete, retrieve and update)
UNIT V
Advanced Topics: Alarms – Creating and using alarms Using Internet Resources – Connecting to
internet resource, using download manager Location Based Services – Finding Current Location and
showing location on the Map, updating location
Course Outcomes:
Ability to evaluate and select appropriate solutions to the mobile computing platform.
Ability to develop the user interface.
Ability design a simple mobile phone game
TEXT BOOKS:
6. Professional Android 4 Application Development, Reto Meier, Wiley India, (Wrox) , 2012
7. Android Application Development for Java Programmers, James C Sheusi, Cengage
Learning, 2013
REFERENCES:
3. Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India (Wrox), 2013
***
Course Objectives:
In the interest of the national economic growth the innovations and improvements are to be
owned and used for the production and distribution process. The students of technology will be
benefited by knowing the process of obtaining recognition of their innovations. This course will
enable them to know the legal process of registering the innovations.
UNIT – I
UNIT – II
TRADE MARKS: Purpose and function of trade marks, acquisition of trade mark rights, protectable
matter, selecting and evaluating trade mark, trade marks registration processes.
UNIT – III
LAW OF COPY RIGHTS: Fundamental of copy right law, originally of material, rights of
reproduction, rights of perform the work publicity, copy right ownership issues, copy right
registration, notice of copy right, international copy right law.
LAW OF PATENTS: Foundation of patent law, patent searching process ownership rights and
transfer.
UNIT- IV
TRADE SECRETS: Trade secrete law, determination of trade secrete status, liability for
misappropriations of trade secrets, protection for submission trade secrete litigation.
UNIT-V
Course Outcomes:
***
COURSE CONTENT
UNIT I
Disasters: Definition- Hazard Risk, Mitigation, Natural and human induced disasters types of
hazards, disasters and catastrophes – Disaster Management.
UNIT II
Hydrological Hazards: Flooding – PMP – PMF – Inundation mapping -flood prone area analysis and
management. Dam breach analysis - Drought- types of drought - Factors influencing drought -
delimiting drought prone areas - drought index, SPI and Palmer.
UNIT III
Geological Hazards: Earthquakes; location, faults, causes, types, associated hazards and impacts,
Richter scale and Modified Mercalli scale. Mass movements: Definition of landslide - types – causes
- slope stability analysis.
UNIT IV
Coastal Hazards – storm surge - Tsunami and floods – cyclone – coastal vulnerability – shore line
erosion – shore defence structures.
UNIT V
Mitigation and Management: Hazard, Risk and Vulnerability mapping and modeling using GIS.
Case studies for earthquake zonation. Risk Assessment - Preparedness- GIS case studies for
COURSE OUTCOMES:
The students will be able to
CO1. Understand different types of disaster and its triggering features
CO2. Understand and analyze hydrological disaster
CO3. Understand and develop models for geological disaster
CO4.Understand the coastal hazard and shore defense structures
CO5. Capable of preparing vulnerability mapping and risk assessment and developing Emergency
Management System.
TEXTBOOKS:
1. Singhal J.P. “Disaster Management”, Laxmi Publications, 2010. ISBN-10: 9380386427
ISBN-13: 978-9380386423
2. Tushar Bhattacharya, “Disaster Science and Management”, McGraw Hill India Education Pvt.
Ltd., 2012. ISBN-10: 1259007367, ISBN-13: 978-1259007361]
3. Gupta Anil K, Sreeja S. Nair. Environmental Knowledge for Disaster Risk Management,
NIDM, New Delhi, 2011
4. Kapur Anu Vulnerable India: A Geographical Study of Disasters, IIAS and Sage Publishers, New
Delhi, 2010.
REFERENCES:
1. Govt. of India: Disaster Management Act , Government of India, New Delhi, 2005
2. Government of India, National Disaster Management Policy,2009.
***
Course Objectives:
This course is intended to familiarise the students with the framework for the managers and leaders
availbale for understanding and making decisions realting to issues related organiational structure,
production operations, marketing, Human resource Management, product management and strategy.
UNIT - I:
UNIT - II:
UNIT - III:
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, Plcement, Wage and Salary Administration,
Promotion, Transfer, Seperation, Performance Appraisal, Grievance Handling and Welfare
Administration, Job Evaluation and Merit Rating - Capability Maturity Model (CMM) Levels –
Performance Management System
UNIT - IV:
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: 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 Balanced Score Card as Contemporary Business
Strategies.
TEXT BOOKS:
e. Stoner, Freeman, Gilbert, Management, 6th Ed, Pearson Education, New Delhi, 2004.
f. P. Vijay Kumar, N. Appa Rao and Ashnab, Chnalill, Cengage Learning India, 2012.
REFERENCE BOOKS:
1 Kotler Philip and Keller Kevin Lane: Marketing Management, Pearson, 2012.
4. Koontz and Weihrich: Essentials of Management, McGraw Hill, 2012.
5. Thomas N. Duening and John M. Ivancevich Management - Principles and Guidelines,
Biztantra, 2012.
6. Kanishka Bedi, Production and Operations Management, Oxford Uiversity Press, 2012.
7. Samuel C. Certo: Modern Management, 2012.
8. Schermerhorn, Capling, Poole and Wiesner: Management, Wiley, 2012.
9. Parnell: Strategic Management, Cengage, 2012.
10. Lawrence R Jauch, R. Gupta and William F. Glueck: Business Policy and Strategic
Management Science, McGraw Hill, 2012.
***
Objectives:
To understand the functionalities of various layers of OSI model and facilitate an understanding of
the fundamental concepts of computer networking. To improve the ability of the students to program
computer network using languages like C, C++. The second part of the Course aims to make the
students to understand the enumeration of top down and bottom up parsing techniques used in
compilation process. Students will have hands-on experience of LEX tool
Syllabus Content:
Week 1:
Week 2:
Week 3:
write a program for recognizing keyword and identifier in a given input file.
Week 4:
LEX source specification that identifies positive integer and negative integer
Week 5:
Week 6:
COMPUTER NETWORKS
Week 7:
Study of different types of Network cables and practically implement the cross-wired cable and
straight through cable using clamping tool.
Week 8:
Study of Network Devices in Detail.
Week 9:
Department of Computer Science & Engg.,-VCE 91
B.Tech-CSE R18 Regulations
Week 10:
Connect the computers in Local Area Network.
Week 11:
Study of basic network command and Network configuration commands.
Week 12:
Configure a Network topology using packet tracer software.
Week 13:
Configure a Network topology using packet tracer software.
Week 14:
Configure a Network using Distance Vector Routing protocol.
Week 15:
Configure Network using Link State Vector Routing protocol.
Course Outcome:
After the completion of this course the students should be able to:
Knowledge of general principles and concepts of computer networks. Knowledge of network
technologies such as Ethernet, Token Rings, and Wireless. Ability to design basic network
services with sockets.
Improved system programming skills.
Structure a compiler as a sequence of distinct translation steps use regular languages to
describe the lexical elements of a programming language. Describe lexical analysis using a
finite automaton use context free languages to describe the syntactic structure of a
programming language.
Design compiler for a simple programming language.
To develop a program to solve complex problems by using compiler tools.
To provide practical hands-on experience in compiler design.
TEXT BOOKS:
3. Computer Networks — Andrew S Tanenbaum, 4th Edition. PearsonEducation/PHI.
4. 1. Principles of compiler design -A.V. Aho . J.D.Ullman; Pearson Education.
REFERENCES:
***
List of Programs :
Week-1: Write a program to represent each document as a vector uses term frequency to identify
commonly used terms that help classify the documents from various documents
Week-3: Write a program to derive knowledge from a given dataset using Decision Support System.
Week-4 :Write a program to predict the future data based on past data (take past data as a data set)
Week-5 :Write a program to recognize authorized person from a given set using face recognition
technique.
Week-8:Write a program to create and combine data frames to get whole data.
Week-10: Write a program for finding the most specific hypothesis based on a given set of training
data samples .Read the data from .csv file
Week-11: Write a program to predict data on Insurance Fraud Detection based on given past
historical data
After the completion of this course the students should be able to :
3. Discuss different application on Machine Learning problems.
4. Describe various algorithms on Machine Learning mentioning its strengths and
weaknesses.
5. Improve the performance of Machine Learning algorithms with different parameters.
6. Understand the latest issues raised by current researchers.
***
Course objectives:
Introduction to Constitution: meaning of the term, Indian Constitution: Sources and constitutional
history, Features: Citizenship, Preamble, Fundamental Rights and Duties, Directive Principles of
State Policy.
UNIT-II
Union Government and its Administration Structure of the Indian Union: Federalism, Centre-
State relationship, President: Role, power and position, PM and Council of ministers, Cabinet and
Central Secretariat, Lok Sabha, Rajya Sabha
UNIT-III
State Government and its Administration Governor: Role and Position, CM and Council of
ministers, State Secretariat: Organisation, Structure and Functions
UNIT -IV
UNIT- V
Election Commission: Role and Functioning, Chief Election Commissioner and Election
Commissioners, State Election Commission: Role and Functioning, Institute and bodies for the
welfare of SC/ST/OBC and women.
COURSE OUTCOME:
Students are able to understand the rights and duties of a citizen. This subject elevates the
knowledge of student regarding the government and administration and also know the roles and
powers of members of both the houses in the central and states. It also provides the knowledge about
local administration with respect to municipalities and ZPs. It also gives the knowledge about
election commission.
***
Course Objectives:
The course introduce students basics of computer networks and internet programming.The
students will be focused on various forms of IPC through UNIX, Sockets and using TCP/IP. It
motivates them to understand modern network architecture from design and performance
perspective.
OSI model, TCP and UDP & TCP connection establishment and Format, Buffer sizes and
limitation, standard internet services, Protocol usage by common internet application. (Text Book1,
Pg.No: 18-27, Text Book2, Pg.No:547-604)
UNIT-II Sockets:
Address structures, value – result arguments, Byte ordering and manipulation function and
related functions Elementary TCP sockets – Socket, connect, bind, listen, accept, fork and exec
function, concurrent servers. Close function and related function. (Text Book1, Pg.No: 57, 63-107)
Introduction, TCP Echo server functions, Normal startup, terminate and signal handling
server process termination, Crashing and Rebooting of server host shutdown of server host.I/O
Multiplexing and socket options: I/O Models, select function, Batch input, shutdown function, poll
function, TCP Echo server, getsockopt and setsockopt functions. Socket states, Generic socket
option IPV4 socket option ICMPV6 socket option IPV6 socket option and TCP socket options. (Text
Book1, Pg.No: 111-135,143-204)
Elementary UDP sockets: Introduction UDP Echo server function, lost datagram, summaryof
UDP example, Lack of flow control with UDP, determining outgoing interface with
UDP.Elementary name and Address conversions: DNS, gethost by Name function, Resolver option,
Function and IPV6 support, uname function, other networking information. (TextBook1, Pg.No:
211-231,237-256)
UNIT-V IPC:
Introduction, File and record locking, Pipes, FIFOs streams and messages, Name
spaces, system IPC, Message queues, Semaphores. Remote Login: Terminal line disciplines,
Pseudo-Terminals, Terminal modes, Control Terminals, rlogin Overview, RPC Transparency
Issues. (Text Book2, Pg.No: 87-137,589-616,692-694)
Course Outcomes:
After completion of this course the student should be able to:
Department of Computer Science & Engg.,-VCE 96
B.Tech-CSE R18 Regulations
3. CO1: Demonstrate advanced knowledge of OSI Layers, TCP & UDP concepts,Networking.
4. CO2: Summarize the TCP socket functions and Byte Ordering.
5. CO3: Make use of TCP client server application and analyse I/O Multiplexing and socket
options.
6. CO4: Define about elementary UDP sockets and Address conversions.
7. CO5: Explain Inter Process communication consisting of Pipes, FIFO’S, Semaphores,
Message Queues and Remote Procedure calls .
TEXT BOOKS:
REFERENCES:
***
Course Objectives:
UNIT - I
Introduction: Testing as an Engineering Activity, Testing as a Process, Testing axioms, Basic Definitions Software
Testing Principles, The Tester’s Role in a Software Development Organization, Verification & Validation, Quality
Assurance, Quality Control Origins of Defects, Cost of Defects, Defect Classes, The Defect Repository and Test
Design, Developer/Tester Support for Developing a Defect Repository, Defect Prevention Strategies. (Book 1: Pg no:
1- 57) (Book 2: Pg no: 27-29)
UNIT - II
Test case Design, Test Case Design Strategies, Using Black Box Approach to Test Case Design, Random Testing,
Requirements based Testing, Boundary Value Analysis, Decision tables, Equivalence Class Partitioning, State-based
Testing, Cause-effect graphing, Error guessing, Compatibility testing, User documentation testing, Domain testing.
White Box Approach to Test Design, Test Adequacy Criteria, Static testing vs. Structural testing, code functional
testing, Coverage and Control Flow Graphs, Covering Code Logic, Paths Their Role in White–box Based Test
Design, Code complexity testing, Evaluating Test Adequacy Criteria. (Book 1: Pg no: 63-108) (Book 2: Pg no: 48-
63, 87)
UNIT - III
Levels of Testing, The Need for Levels of Testing, Unit Test, Unit Test Planning, Designing the Unit Tests, The Test
Harness, Running the Unit tests and Recording results, Integration tests, Designing Integration Tests, Integration Test
Planning, Scenario testing, Defect bash elimination
System Testing, Acceptance testing, Performance testing, Regression Testing, Internationalization testing, Ad-hoc
testing, Alpha , Beta Tests, testing OO systems, Usability and Accessibility testing Configuration testing, Compatibility
testing, Testing the documentation, Website testing. (Book 1: Pg no: 133- 176) (Book 2: Pg no: 118,122,211)
UNIT - IV
Test Management, People and organizational issues in testing, organization structures for testing teams, testing
services, Test Planning, Test Plan Components, Test Plan Attachments, Locating Test Items, Test management, Test
process, Reporting Test Results, The Role of three groups in Test Planning and Policy Development, Introducing the
test specialist, Skills needed by a test specialist Building a Testing Group. (Book 1: Pg no: 189- 230) (Book 2: Pg no:
299, 320,338)
UNIT - IV
Test Automation, Software test automation, Skills needed for automation, Scope of automation, Design and
architecture for automation, Requirements for a Test Tool, Challenges in automation, Test metrics and measurements,
Project progress and Productivity metrics. (Book 2: Pg no: 387-452)
Department of Computer Science & Engg.,-VCE 98
B.Tech-CSE R18 Regulations
Course Outcomes:
TEXT BOOKS:
5. Srinivasan Desikan and Gopalaswamy Ramesh, “Software Testing – Principles and Practices”, Pearson
education, 2006.
REFERENCES:
6. Ron Patton, “ Software Testing”, Second Edition, Sams Publishing, Pearson education, 2007
7. Renu Rajani, Pradeep Oak, “Software Testing – Effective Methods, Tools and Techniques”, Tata McGraw
Hill, 2004.
8. Edward Kit, “Software Testing in the Real World – Improving the Process”,
9. Pearson Education, 1995.
10. Boris Beizer, “Software Testing Techniques” – 2nd Edition, Van Nostrand Reinhold, New York, 1990.
11. Aditya P. Mathur, “Foundations of Software Testing – Fundamental algorithms and techniques”, Dorling
Kindersley (India) Pvt. Ltd., Pearson Education, 2008
***
Objectives:
To enable students to make more effective use of data stored in databases.
To create a clean and consistent repository of data within a data warehouse.
To utilize various levels and types of summarization of data to support management decision
making.
To discover patterns and knowledge that is embedded in the huge quantities of data records
using different data mining techniques.
UNIT -I
Data Warehouse and OLAP Technology: Introduction to Data Warehouse,Differences between
operational database systems and data warehouses (OLAP & OLTP), Multidimensional Data
Model: Data Warehouse Architecture, Data Cube and OLAP Technology,Data Warehouse
Implementation.
UNIT -II
Data Mining: Types of Data, Data Mining Functionalities, Interestingness Patterns-Classification of
Data Mining systems, Data Mining Task Primitives, Integration of a Data Mining System with a
Database or a Data Warehouse System, Major issues in Data Mining. Applications of Data mining.
Data Preprocessing: Data cleaning, Data integration and data transformation, data reduction: data
cube aggregation, dimensionality reduction.
UNIT -III
Association Rule Mining and Classification: Mining Frequent Patterns, Associations and
Correlations, Mining Methods, Mining various kinds of Association Rules, Correlation Analysis,
Constraint based Association Mining
UNIT -IV
Classification and Prediction: Basic Concepts, Decision Tree Induction, Bayesian Classification,
Rule-Based Classification, Classification by Back propagation, Support Vector Machines,
Associative Classification, Lazy Learners, Other Classification Methods, Prediction.
UNIT -V
Clustering And Applications: Types of Data in Cluster Analysis, Categorization of Major
Clustering Methods, Partitioning Methods: K-Means, K-Mediods , Hierarchical Methods, Density-
Based Methods: DBSCAN, Grid-Based Methods: CLIQUE, Model-Based Clustering Methods,
Clustering High-Dimensional Data, Constraint-Based Cluster Analysis, Outlier Analysis.
Course Outcomes:
TEXT BOOK:
1. Data Mining – Concepts and Techniques - Jiawei Han & Micheline Kamber, Morgan Kaufmann
Publishers, Elsevier ,2nd Edition, 2006.
REFERENCE BOOKS:
***
3 0 0 3
Prerequisites: WT (JAVA, AJT)
Course Objectives:
To understand the details of web services technologies like WSDL, UDDI, and SOAP.
To learn how to implement and deploy web service client and server.
To explore interoperability between different frameworks.
UNIT-I
Evolution and Emergence of Web Services – Evolution of distributed computing, Core distributed computing
technologies — client/server, CORBA, JAVA RMI, Microsoft DCOM, MOM, Challenges in Distributed
Computing, The role of J2EE and XML in distributed computing, emergence of Web Services and Service
Oriented Architecture (SOA). (Page No:1-20) .Introduction to Web Services -The definition of web services,
basic operational model of web services, tools and technologies enabling web services, benefits and
challenges of using web services. (Page No:21-34)
UNIT-II
Web Services Architecture — Web services Architecture and its characteristics, core building blocks of web
services, standards and technologies available for implementing web services, web services communication
models, basic steps of implementing web services. (Page No:41-55)
Fundamentals of SOAP — SOAP Message Structure, SOAP encoding, Encoding of different data types,
SOAP message exchange models, SOAP communication and messaging, (Page No:104-130)
Java and Axis, limitations of SOAP. (Page No:199)
UNIT- III
Describing Web Services — WSDL — WSDL in the world of Web Services, Web Services life cycle,
anatomy of WSDL definition document, WSDL bindings, WSDL Tools, limitations of WSDL. (Page No:
103-222)
UNIT- IV
Discovering Web Services — Service discovery, role of service discovery in a SOA, service discovery
mechanisms, UDDI — UDDI registries, uses of UDDI Registry, Programming with UDDI, UDDI data
structures, Publishing API, Publishing, searching and deleting information in a UDDI Registry, limitations of
UDD1. (Page No: 222-269)
UNIT- V
Web Services Interoperability — Means of ensuring Interoperability, Overview of .NET, Creating a .NET
client for an Axis Web Service, creating Java client for a Web service, Challenges in creating Web Services
Interoperability (Page No:272-291)
Interoperability : Web Services Security — XML security frames work, Goals of Cryptography, XML
signature, Digital Certificate, XML Encryption. (Page No: 619 -657)
Course Outcomes:
2. Implement WS client and server with interoperable systems like core Distributed Computing,
J2EE, SOA.
3. Basic details of WSDL, UDDI, SOAP, EBXML.
4. To learn Web Services life cycle, anatomy of WSDL definition document.
5. Programming with UDDI, UDDI data structures, Publishing API, Publishing, searching and
deleting information in a UDDI Registry.
6. To explore interoperability between different frameworks.
TEXT BOOK:
5. Developing Java Web Services, R. Nagappan, R. Skoczylas, R.P. Sriganesh, Wiley India.
REFERENCE:
Java Web Service Architecture, James McGovern, Sumer Tyagi etal., Elsevier
Building Web Services with Java, 2 Edition, S. Graham and others, Pearson Edn.
Java Web Services, D.A. Chappell & T. Jewell, O’Reilly,SPD.
Web Services, G. Alonso, F. Casati and others, Springer. Outcomes
Basic details of WSDL, UDDI, SOAP
Implement WS client and server with interoperable systems
***
Objectives:
The objective aims at features and benefits of Database Management System in Information
Technology. It introduces recovery in database system. Various sections explain the basic design and
execution of relational databases. It also provides knowledge and understanding of the underlying
principles of Relational Database Management Solution. The information about implementing and
maintaining an effective, efficient database system with the help of the rising trends are also focused.
Introduction to Database Security Issues- Discretionary Access Control Based on Granting and
Revoking Privileges- Mandatory Access Control and Role-Based Access Control for Multilevel
Security- SQL Injection- Introduction to Statistical Database Security- Introduction to Flow Control-
Encryption and Public Key Infrastructures- Privacy Issues and Preservation- Challenges of Database
Security- Oracle Label-Based Security. (Pg.No: 478-494)
Course Outcomes:
TEXT BOOKS:
REFERENCE BOOKS:
Raghu Ramakrishnan, Johannes Gehrke- Database Management Systems- Third edition-
McGraw-Hill.
***
Prerequisites:
Department of Computer Science & Engg.,-VCE 105
B.Tech-CSE R18 Regulations
Objectives:
It focuses on incremental/iterative development and common design patterns.
To identify appropriate design patterns for various problems, able to refractor poorly designed
program by using appropriate design patterns.
UNIT II: A Case Study : 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,
(Pg.No: 33-76)
UNIT –III: Creational Patterns: Abstract Factory Builder Factory Method Prototype Singleton
Discussion of Creational Patterns. (Pg.No: 79-135)
UNIT IV: Structural Pattern, Adapter, Bridge, Composite, Decorator, Façade, Flyweight Proxy.
Discussion of Structural Patterns (Pg.No: 137-219)
Course Outcomes:
Upon completion of the course, the student should be able to learn the following:
4. A strong foundation in core Computer Science and Engineering, both theoretical and applied
concepts.
5. Ability to model, understand, and develop complex software for System Software as well as
application Software.
6. An ability to function effectively within teams.
7. An understanding of professional and ethical responsibility.
8. An ability to communicate effectively, both in writing and oral.
9. Recognition of the need for, and an ability to engage in life-long learning.
TEXT BOOKS:
REFERENCE BOOKS:
7. Peeling Design Patterns, Prof Meda Srinivasa Rao, Narsimha Karumanchi, Career Monk
Publication.
8. Design Patterns Explained By Alan Shallowy, Pearson Education.
9. Pattern Oriented Software Architecture, af.Buschman & others, John Wiley & Sons.
***
Objectives:
The student should be made to be exposed to the context and operation of free and open
source software (FOSS) communities and associated with software projects.
Be familiar with participating in a FOSS project and to learn scripting language like Python
or Perl or Ruby
To learn some important FOSS tools and techniques
UNIT II: OPEN SOURCE PROGRAMMING LANGUAGES PHP: PHP Basics- Features,
Embedding PHP Code in your Web pages Outputting the data to the browser, Data types, variables
Constants, expressions, string interpolation control structures Function, Creating a Function
Libraries, Arrays, strings, Regular Expressions. Php and Web Forms, Files PHP Authentication and
Methodologies -Hard Coded File Based, Database Based, IP Based Login Administration,
Uploading Files with PHP Sending Email using PHP, PHP Encryption Functions, the Mcrypt,
package, Building Web sites for the World Translating Websites- Updating Web sites Scripts
Creating the Localization Repository Translating Files text, Generate Binary Files, Set the desired
language within your scripts, Localizing Dates, Numbers and Times
UNIT III: PYTHON: Introduction to Python language, python-syntax statements, functions, Built-
in-functions and Methods Modules in python, Exception Handling
Integrated Web Applications in Python – Building Small Efficient Python Web Systems
Web Application Framework
UNIT IV: PERL : Perl backgrounder – Perl overview – Perl parsing rules – Variables and Data –
Statements and Control structures – Subroutines, Packages, and Modules- Working with Files –Data
Manipulation. PERL- Names and Values, Variables, Scalar Expressions Control Structures arrays,
list, hashes, strings pattern and regular expressions, subroutines 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
UNIT V: PROGRAMMING LANGUAGE RUBY: Getting started, Ruby new, Classes, Objects
and variables, sharing functionality: Inheritance, modules and mixings, exceptions, catch and throw,
fibers, threads and processes, namespaces, source files and distribution, built-in classes and modules.
Course Outcomes:
Upon completion of the course, the student should be able to learn the following:
4. Install and run open-source operating systems.
5. Gather Information about free and open source software projects from software releases
6. and from sites on the internet.
7. Build and modify one or more free and open source software packages.
8. Contribute software to and interact with free and open source software development
9. projects.
TEXT BOOKS:
Department of Computer Science & Engg.,-VCE 108
B.Tech-CSE R18 Regulations
Remy Card, Eric Dumas and Frank Mevel, “The Linux Kernel Book”, Wiley Publications,
2003.
Rasmus Lerdorf and Levin Tatroe, “Programming PHP”, O’Reilly, 2002.
Dave Thomas, Chad Fowler and Andy Hunt “The Pragmatic Programmers' Guide
Programming Ruby “4th edition, O’Reilly publications, 2009.
Wesley J. Chun, “Core Phython Programming”, Prentice Hall, 20012.
Martin C. Brown, “Perl: The Complete Reference”, 2nd Edition, Tata McGraw-Hill
Publishing Company Limited, Indian Reprint 2009.
REFERENCE BOOKS:
3. Steven Holzner, “PHP: The Complete Reference”, 2nd Edition, Tata McGraw-Hill
Publishing company limited, Indian reprint 2009.
4. Python Web Programming, Steve Holden and David Beazely, New Riders Publications
David Flanagan and Yukihiro Matsumoto, “The Ruby Programming Language”
O’Reilly publisher, 2008
***
UNIT I INTRODUCTION
Structure and composition of Atmosphere – Definition, Scope and Scales of Air Pollution – Sources
and classification of air pollutants and their effect on human health, vegetation, animals, property,
aesthetic value and visibility- Ambient Air Quality and Emission standards –Ambient and stack
sampling and Analysis of Particulate and Gaseous Pollutants.
UNIT II METEOROLOGY
Effects of meteorology on Air Pollution - Fundamentals, Atmospheric stability, Inversion,
Windprofiles and stack plume patterns- Atmospheric Diffusion Theories – Dispersion models,
Plume rise.
COURSE OUTCOMES:
The students completing the course will have
CO1: an understanding of the nature and characteristics of air pollutants, noise pollution and basic
concepts of air quality management
CO2: Ability to identify, formulate and solve air and noise pollution problems
CO3:Ability to design stacks and particulate air pollution control devices to meet applicable
standards.
CO4: Ability to select control equipments.
CO5: Ability to ensure quality, control and preventive measures.
TEXTBOOKS:
1. Lawrence K. Wang, Norman C. Pareira, Yung Tse Hung, “Air Pollution Control Engineering”,
Tokyo, springer science + science media LLC,2004.
2. Noel de Nevers, “Air Pollution Control Engineering”, Waveland press,Inc 2017.
3. Anjaneyulu. Y, “Air Pollution and Control Technologies‟, Allied Publishers (P) Ltd., India2002.
REFERENCES:
1. David H.F. Liu, Bela G. Liptak, “Air Pollution”, Lweis Publishers, 2000.
2. Arthur C. Stern, “Air Pollution (Vol.I – Vol.VIII)”, Academic Press, 2006.
3. Wayne T.Davis, “Air Pollution Engineering Manual”, John Wiley & Sons, Inc, 2000.
4. M.N Rao and HVN Rao, “Air Pollution”,Tata McGraw Hill Publishing Company limited,2007.
5. C.S.Rao, “Environmental Pollution Control Engineering”,New Age International (P) Limited
Publishers,2006.
***
UNIT-I
Components of Medical Instrumentation System: Bloamplifier, Static and Dynamic
Characteristics of Medical Instruments, Biosignals and Characteristics, Problems encountered with
Measurements from Human beings. Organization of Cell, Derivation of Nernst equation for
Membrane Resting Potential Generation and Propagation of Action Potential, Conduction through
Nerve to Neuromuscular Junction.
UNIT -II
Bio Electrodes: Biopotential Electrodes-External Electrodes, Internal Electrodes, Biochemical
Electrodes. Mechanical Function, Electrical Conduction System of the Heart, Cardiac Cycle,
Relation between Electrical and Mechanical Activities of the Heart.
UNIT -III
Cardiac Instrumentation: Blood Pressure and Blood Flow Measurement, Specification of ECG
Machine, Einthoven Triangle, Standard 12-Lead Configurations, Interpretation of ECG waveform
with respect to Electro Mechanical Activity of the Heart.
UNIT -IV
Therapeutic Equipment: Pacemaker, Defibrillator, Shortwave Diathermy, Hemodialysis Machine.
Respiratory Instrumentation: Mechanism of Respiration, Spirometry, Pnemuotachograph
Ventilators.
UNIT -V
Neuro-Muscular Instrumentation: Specification of EEG and EMG Machines, Electrode Placement
for EEG and EMG Recording, Interpretation of EEG and EMG.
Course Outcomes
At the end of the course, the student will be able to
Understand the functions of bio amplifiers, characteristics of medical instruments and bio
signals.
Discuss the various internal, external Bio electrodes and relations between electrical and
mechanical activities of heart.
Compare various concepts of Cardiac Instrumentation and gain the knowledge about
Analyze the Therapeutic Equipment and their operation.
Acquires knowledge about neuro-muscular Instrumentation like ECG EMG and EEG.
Text Books
9. Biomedical Instrumentation and Measurements — by Leslie Cromwell, F.J. Weibell, E.A.
Pfeiffer, PHI.
10. Medical Instrumentation, Application and Design — by John G.Webster, John Wiley.
Reference Books
8. Principles of Applied Biomedical Instrumentation — by L.A. Geoddes and L.E. Baker,
John Wiley and Sons.
9. Hand-book of Biomedical Instrumentation — by R.S. Khandpur, McGraw-Hill, 2003.
10. Biomedical Telemetry — by Mackay, Stuart R., John Wiley.
***
Course Objectives
Provide the student with the fundamentals of digital image processing.
5. Give the students a taste of the applications of the theories taught in the subject. This will
be achieved through the project and some selected lab sessions. Introduce the students to
some advanced topics in digital image processing.
6. Give the students a useful skill base that would allow them to carry out further study should
they be interested and to work in the field.
UNIT- I
Digital Image Fundamentals & Image Transforms: Digital Image Fundamentals, Sampling and
Quantization, Relationship between Pixels,
Image Transforms: 2-D FFT, Properties, Walsh Transform, Hadamard Transform, Discrete Cosine
Transform, Haar Transform, Slant Transform, Hotelling Transform.
UNIT –II
Image Enhancement (Spatial Domain): Introduction, Image Enhancement in Spatial Domain,
Enhancement Through Point Operation, Types of Point Operation, Histogram Manipulation, Linear
and Non — Linear Gray Level Transformation, Local or Neighborhood Operation, Median Filter,
Spatial Domain High-Pass Filtering.
Image Enhancement (Frequency Domain): Filtering in Frequency Domain, Obtaining Frequency
Domain Filters from Spatial Filters, Generating Filters Directly in the Frequency Domain, Low Pass
(Smoothing) and High Pass (Sharpening) Filters in Frequency Domain.
UNIT –III
Image Restoration: Degradation Model, Algebraic Approach to Restoration, Inverse Filtering,
Least Mean Square Filters, Constrained Least Squares Restoration, Interactive Restoration.
UNIT-IV
Image Segmentation: Detection of Discontinuities, Edge Linking And Boundary Detection,
Thresholding, Region Oriented Segmentation.
Morphological Image Processing: Dilation and Erosion: Dilation, Structuring Element
Decomposition, Erosion, Combining Dilation and Erosion, Opening and Closing, The Hit or Miss
Transformation.
UNIT-V
Image Compression: Redundancies and their Removal Methods, Fidelity Criteria, Image
Compression Models, Huffman and Arithmetic Coding, Error Free Compression, Lossy
Compression, Lossy and Lossless Predictive Coding, Transform Based Compression, JPEG 2000
Standards.
Course Outcomes:
TEXT BOOKS:
Digital Image Processing – Rafael C. Gonzalez, Richard E. Woods, 3rd Edition, Pearson, 2008
Digital Image Processing- S Jayaraman, S Esakkirajan, T Veerakumar- TMH, 2010.
REFERENCE BOOKS:
Digital Image Processing and Analysis-Human and Computer Vision Application with using
CVIP Tools – Scotte Umbaugh, 2nd Ed, CRC Press, 2011
Digital Image Processing using MATLAB — Rafael C. Gonzalez, Richard E Woods and
Steven L. Eddings, 2nd Edition, TMH, 2010.
Fundamentals of Digital Image Processing — A.K.Jain, PHI, 1989
Digital Image Processing and Computer Vision — Somka, Hlavac, Boyle- Cengage
Learning (Indian edition) 2008.
Introductory Computer Vision Imaging Techniques and Solutions- Adrian low, 2008, 2nd
Edition
Introduction to Image Processing & Analysis — John C. Russ, J. Christian Russ, CRC Press,
2010.
Digital Image Processing with MATLAB & Labview — Vipula Singh, Elsevier.
***
The proposed course should be a laboratory course to enable students to use ‘good’ English and
perform the following:
Course Objectives:
This Lab focuses on using multi-media 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.
To prepare all the students for their placements.
Syllabus:
The following course content to conduct the activities is prescribed for the Technical
Communication Skills (TCS) Lab:
Writing Skills – Structure and presentation of different types of writing – letter writing/Resume
writing/ e-correspondence/ Technical report writing/ Portfolio writing – planning for writing –
improving one’s writing.
Course Outcomes
Developing sound vocabulary and its proper use contextually.
Department of Computer Science & Engg.,-VCE 116
B.Tech-CSE R18 Regulations
Minimum Requirement:
The Technical Communication Skills (TCS) Laboratory shall have the following infra-structural
facilities to accommodate at least 35 students in the lab:
Prescribed Lab Manual: A book titled A Course Book of Advanced Communication Skills
(ACS) Lab published by Universities Press, Hyderabad.
Suggested Software:
The software consisting of the prescribed topics elaborated above should be procured and
used.
Books Prescribed:
Technical Communication by Meenakshi Raman & Sangeeta Sharma, Oxford University Press
2009.
English Language Communication : A Reader cum Lab Manual Dr A Ramakrishna Rao, Dr
G Natanam & Prof SA Sankaranarayanan, Anuradha Publications, Chennai 2008.
Advanced Communication Skills Laboratory Manual by Sudha Rani, D, Pearson Education
2011.
Technical Communication by Paul V. Anderson. 2007. Cengage Learning pvt. Ltd. New Delhi.
Business and Professional Communication: Keys for Workplace Excellence. Kelly M.
Quintanilla & Shawn T. Wahl. Sage South Asia Edition. Sage Publications. 2011.
Suggested Books:
The Basics of Communication: A Relational Perspective. Steve Duck & David T. McMahan.
Sage South Asia Edition. Sage Publications. 2012.
Department of Computer Science & Engg.,-VCE 117
B.Tech-CSE R18 Regulations
Handbook for Technical Communication by David A. McMurrey & Joanne Buckley. 2012.
Cengage Learning.
Communication Skills by Leena Sen, PHI Learning Pvt Ltd., New Delhi, 2009.
Handbook for Technical Writing by David A McMurrey & Joanne Buckely CENGAGE
Learning 2008.
International English for Call Centres by Barry Tomalin and Suhashini Thomas, Macmillan
Publishers, 2009.
***
Course Objectives:
To impart a solid foundation on state of art trends in computer networking to provide a hands
on experience of the same. The lab work concentrate on insight of all areas in networking and
familiarize students with the Linux environment. The experiments may be taken up with the
intention to solidify the foundation of the basic networking course such asUnix/Linuxenvironments.
Week 1:
a) Write a shell script that accepts a file name, starting and ending line numbers as arguments and
displays all the lines between the given line numbers.
b) Write a shell script that deletes all lines containing a specified word in one or more files supplied
as arguments to it.
Week 2:
a) Write a shell script that displays a list of all the files in the current directory to which the user has
read, write and execute permissions.
b) 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.
Week 3:
Week 4:
a) Write an awk script to count the number of lines in a file that do not contain vowels.
b) Write an awk script to find the number of characters, words and lines in a file.
Week 5:
Design TCP iterative Client and server application to reverse the given input sentence.
Week 6:
Week 7:
Design a TCP concurrent server to convert a given text into upper case using multiplexing system
call ―select.
Week 8:
Design a TCP concurrent server to echo given set of sentences using poll functions.
Week 9:
Design UDP Client and server application to reverse the given input sentence.
Week 10:
Week 11:
Design using poll client server application to multiplex TCP and UDP requests for converting a
given text into upper case.
Week 12:
Department of Computer Science & Engg.,-VCE 119
B.Tech-CSE R18 Regulations
Week 13:
Week 14:
Write a programme to create an integer variable using shared memory concept and increment the
variable simultaneously by two processes. Use semaphores to avoid race conditions.
Week 15:
Course Outcomes:
CO1: To gain knowledge from basic UNIX commands ,shell scripts and AWK scripts.
CO2: To model TCP and UDP client server applications.
CO3: An implementation of IPC and RPC applications.
TEXT BOOKS:
REFERENCES:
***
Syllabus Content
Part A
Week 1: Design a data warehouse for auto sales analysis.
Week 2: Perform OLAP operations on auto sales data warehouse.
Part B
Week 9-16:
LIST OF EXPERIMENTS
Do the following 8 exercises for any two projects given in the list of sample projects or
any other projects:
Development of problem statement.
Preparation of Software Requirement Specification Document, Design Documents and
Testing Phase related documents.
Preparation of Software Configuration Management and Risk Management related
documents.
Study and usage of any Design phase CASE tool
Performing the Design by using any Design phase CASE tools.
Develop test cases for unit testing and integration testing
Develop test cases for various white box and black box testing
Sample Projects:
Passport automation System
Book Bank
Online Exam Registration
Stock Maintenance System
Online course reservation system
E-ticketing
Software Personnel Management System
Credit Card Processing
E-book management System.
Recruitment system
Course Objectives:
This practical paper is designed to help students to design a data warehouse and implement
OLAP operations.
This shall give them exposure to application of data warehousing.
The next part of the practical helps the students to perform data mining functionalities such
as association rule mining, classification and clustering.
To have hands on experience in developing a software project by using various
software engineering principles and methods in each of the phases of software
development.
TEXT BOOKS:
Data Mining – Concepts and Techniques - Jiawei Han & Micheline Kamber, Morgan
Kaufmann Publishers, Elsevier,2nd Edition, 2006.
Introduction to Data Mining – Pang-Ning Tan, Michael Steinbach and Vipin Kumar, Pearson
education.
Software Engineering, A practitioner’s Approach- Roger S. Pressman, 6th edition, Mc Graw
Hill International Edition.
Software Engineering- Sommerville, 7th edition, Pearson Education.
The unified modeling language user guide Grady Booch, James Rambaugh, Ivar Jacobson,
Pearson Education.
REFERENCE BOOKS:
***
Objectives:
To improve logical thinking with general applications using mathematical concepts like
sequences, series, number theory and probability.
It also features students to analyze data interpretation and able of improve their mathematical
skills in various general aspects like coding and decoding, Time and Work puzzles solving blood
relations etc.
Blood relations
Seating Arrangements
Figure Analysis
Puzzles etc.
Course Outcomes:
By studying logical reasoning and quantitative aptitude students are able to:
Improve their mathematical skills in various general aspects to solve real world
problems.
REFERENCE BOOKS:
***
IV Year I Semester L T P C
3 0 0 3
Prerequisites: (B18CS14) Data Communications and Computer Networks.
Objectives:
7. To explain the objectives of information security and importance and application of each of
confidentiality, integrity, authentication and availability. Understand various cryptography
concepts and techniques.
8. To illustrate various symmetric key and asymmetric key cryptographic algorithms.
9. To define the basic requirements of message authentication ,hashing algorithms and
kerberos.
10. To describe E-Mail Security with PGP, S/MIME and enhancements made to IPv4 by
IPSec.
11. To discuss the requirements of SSL,TLS,SET and understand intrusion
detection,Firewalls.
UNIT – I
Security Concepts: Introduction, Types of Security attacks, Security services, Security
Mechanisms, A model for Network Security, Cryptography Concepts and Techniques:
Introduction, plain text and cipher text, substitution techniques, transposition techniques, encryption
and decryption, symmetric and asymmetric key cryptography, Steganography.
UNIT – II
Symmetric key Ciphers: Block Cipher principles, Feistel Cipher Structure,DES algorithm, AES
algorithm, Multiple Encryption and Triple DES, Block cipher operation, Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Diffie-Hellman
Key Exchange.Text Book : Page no : 63 - 291
UNIT – III
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA-512).
Message authentication codes: Authentication requirements, HMAC, Digital signatures. Key
Management and Distribution: Symmetric Key Distribution Using Symmetric & Asymmetric
Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication Service.
Text Book : Page no : 313-490
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.Text Book -1 : Page no :590-650
UNIT – V
Web Security: Requirements, Secure Socket Layer (SSL) and Transport Layer Security(TLS),
Secure Electronic Transaction (SET), Intruders, Firewall Design principles, Trusted Systems,
Intrusion Detection Systems(Online Chapters and Appendices: Chapter 22,Chapter 23),Wireless
Network Security.Text Book : Page no :522-585,
Course Outcomes:
CO1 : Identifies various types of vulnerabilities,attacks, mechanisms and security services.
CO2 : Compare and contrast symmetric and asymmetric encryption algorithms.
CO3 : Implementation of message authentication ,hashing algorithms and able to understand
kerberos.
CO4 : Explore the attacks and controls associated with IP, transport-level, web and E-mail
security.
CO5 : Develop intrusion detection system and designing of various type of firewalls.
CO6 :Analyze the security requirements and solutions for wireless networks.
TEXT BOOKS:
Cryptography and Network Security - Principles and Practice: William Stallings,
Pearson Education, 6 th Edition
REFERENCE BOOKS:
8. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan,
Wiley India, 1 st Edition.
9. Cryptography and Network Security : ForouzanMukhopadhyay, Mc Graw Hill, 3 rd
Edition
10. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
Department of Computer Science & Engg.,-VCE 126
B.Tech-CSE R18 Regulations
11. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
12. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
13. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning
***
IV Year I-Semester L T P C
4 0 0 3
UNIT – I
UNIT – II
Planning and Decision Making: Planning and goal setting – Organizational planning - Vision,
Mission and goals, Types of plans, steps in planning process, Approaches to planning, Planning in
Dynamic Environment. Decision making process, types of decisions, decision making styles,
Vroom’s Participative decision making model.
UNIT – III
Controlling: The control process, controlling for organizational performance, types of control,
Department of Computer Science & Engg.,-VCE 127
B.Tech-CSE R18 Regulations
UNIT – IV
UNIT – V
Leadership and Motivation: Leadership traits, Leadership styles, Leadership theories, Power and
Politics.
Motivation: Approaches to Motivation, Maslow’s needs hierarchy theory, two factor theory of
motivation, McGregor’s theory, ERG theory, McClelland’s needs theory, Valance Theory.
Course outcomes: Students will be able to understand a) Evolution of Management and contribution
of Management thinkers b) the relevance of environmental scanning, planning and to take decisions,
c) Organizing and controlling d) Individual and group Behavior e) Leadership and Motivation.
TEXTBOOKS:
***
IV Year I-Semester LT P C
3 0 0 3
Pre-requisites: Mobile computing
Objectives:
Understand the virtualization paradigms.
To introduce the various levels of services that can be achieved by cloud.
To describe the security aspects in cloud
UNIT -I
Systems Modeling, Clustering and Virtualization: Distributed System Models and Enabling
Technologies. Computer Clusters for Scalable Parallel Computing. Virtual Machines and
Virtualization of Clusters and Data centres.
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
Infrastructures, Enhancing Cloud Computing Environments using a cluster as a Service. Secure
Distributed Data Storage in Cloud Computing.
UNIT -IV
Python for Cloud, Python for AWS, and Python for Google cloud Platform, Python web application
framework-Django cloud application development in python.
UNIT -V
Clustering And Applications: Cloud security, cloud computing for health Care, Cloud computing for
Energy Systems, Cloud computing for Transportation system, Cloud computing for Manufactures
Industry, Cloud computing for Education
Course Outcomes:
9. Understand the main concepts, key technologies of virtualization
10. Describe the architecture and infrastructure of cloud computing with all services of cloud
and deployment models.
11. Analyze the issues of cloud computing like cloud security
12. Identify problems, analyze various cloud computing solutions using python
.
TEXT BOOK:
Distributed and Cloud Computing. KaI Hwang. Geoffeiy C.Fox. Jack J.Dongarra.E)sevier.
2011.
Cloud computing principles and paradigms by rajkumar buyya
Cloud Computing: A Hands –on-Approach by Arshdeep Bahga and Vijay Madisetti
REFERENCE BOOKS:
12. Cloud Computing: A Practical Approach. Anthony T.Velte. Toby J.VeFte, Robert
Elsenpeter. Tata McGraw Hill. rp2Oll.
13. Enterprise Cloud Computing Gautam Shroif, Cambridge University Press. 2010.
14. Cloud Computing: Implementation, Management and Security, John W. Rittinouse, James F
Ransome. CRC Press, rp2012.
15. Cloud Application Architectures: Building Applications and Infrastructure in the Cloud.
George Reese, O’RedI SPD, rp2Oll.
***
Objectives:
To introduce information systems concepts
To understand auditing standards
To provide protective IT security guidelines for various types of Industries
UNIT- I
Overview of Information System Auditing, Effect of Computers on Internal Controls, Effects of
Computers on Auditing, Foundations of information Systems Auditing, Conducting an Information
Systems Audit. The management Control Framework-I: Introduction, Evaluating the planning
Function, Evaluating the Leading Function, Evaluating the Controlling Function, Systems
Development Management Controls, Approaches to Auditing Systems Development, Normative
Models of the Systems Development Process, Evaluating the Major phases in the Systems
Development Process, Programming Management Controls, Data Resource Management Controls.
UNIT- II
The Management Control Framework-II: Security Management Controls, Operations management
Controls Quality assurance Management Controls. The Application Control Framework-I: Boundary
Controls, Input Controls, Communication Controls.
UNIT-III
The Application Control Framework-II: Processing Controls, Database Controls, output Controls.
UNIT- IV
Evidence Collection: Audit Software, Code Review, Test Data, and Code Comparison, Concurrent
Auditing techniques, Interviews, Questionnaires, and Control Flowcharts. Performance Management
tools.
UNIT -V
Evidence Evaluation: Evaluating Asset Safeguarding and Data Integrity, Evaluating System
Effectiveness, Evaluating System Efficiency.
COURSE OUTCOMES:
TEXT BOOKS:
1. Ron Weber, Information Systems Control and Audit, Pearson Education, 2002.
REFERENCES:
1. M.Revathy Sriram, Systems Audit, TMH, New Delhi, 2001.
2. David L Cannon, Timothy S Beigmann, Brandy Pamplin, Certified Information System,
Auditor study guide, Wiley Publications, 2011.
3. JamesA.Hall, Information Technology Auditing and Assurance, Fourth Edition, South
Western College Pub, 2015.
***
IV Year I-Semester L T P C
3 0 0 3
Prerequisites: Basics of Programming, Basics of probability theory
Objectives:
UNIT - I:
Introduction to Artificial Intelligence: The AI problem domains, The underlying assumption, An
AI technique, The level of the model, Criteria for success.
Problems, Problem Spaces and Search: Defining the problem as a state space search, Production
systems, Problem characteristics, Production system characteristics, Issues in the design of search
programs, Additional problems.
UNIT - II:
Knowledge Representation Issues: Knowledge representations and mappings, Approaches to
knowledge representation, Issues in knowledge representation, The Frame problem.
Using Predicate Logic: Propositional Calculus, First order predicate calculus(FOPC), Syntax and
symantics of FOPC , Representing simple facts in logic, Representing Instance and Is-a-
relationships, Computable functions , Resolution, Natural Deduction.
Representing Knowledge Using Rules: Procedural versus Declarative knowledge, Forward versus
Backward Reasoning.
UNIT - III:
Weak slot and filler structures: Semantic nets, Frames.
Game Playing: The Minimax Search procedure, Adding Alpha-Beta Cutoffs, Additional
Refinements, Iterative Deepening.
UNIT - IV:
Department of Computer Science & Engg.,-VCE 133
B.Tech-CSE R18 Regulations
UNIT - V:
Strong Method Problem Solving: Overview of Expert System Technology, Rule-Based Expert
Systems, Model-Based, Case Based and Hybrid Systems, Planning. Parallel and Distributed
Reasoning Systems
Course Outcomes:
Upon completion of course, the student will be able to learn the following
1. Remember various AI concepts like the AI technique, level of models, there underlying
assumptions etc
2. Understand the concepts of AI search techniques
3. Apply knowledge Representation techniques
4. Analyze different structures of representation
5. Evaluate AI search techniques
6. Create Expert systems
TEXT BOOKS:
11. Elaine rich, Kevin knight, Shivashanker B Nair “Artificial Intelligence”, 3rd Edition, Tata
McGraw-Hill, ISBN No: 9780070087705, 0070087709, 2012.
12. George F Luger, “Artificial Intelligence”, Fifth Edition, Pearson Education Asia., ISBN No:
9788131723272, 2012.
REFERENCE BOOKS:
Objectives:
UNIT II: Supervised Learning Networks: Introduction, Perceptron Networks, Adaptive Linear
Neuron, Multiple Adaptive Linear Neuron, Back propagation Network. Associative Memory
Networks: Introduction, Training Algorithms for pattern association and Hopfield Networks.(Text
Book, Pg No. 49-116)
UNIT III: Unsupervised Learning Networks: Introduction, Fixed Weight Competitive Nets,
Kohonen Self-Organizing Feature Maps, Counter Propagation Networks. , Special Networks:
Cascade Correlation Network, Cognitron, NeoCognitron, Spatio - Temporal Connectionist Neural
Networks Cellular, Optical Neural Networks (Text Book, Pg No. 291- 309), Network Fuzzy Sets:
Introduction, Classical Sets, Fuzzy Sets, Classical Relations, Fuzzy Relations (Text Book, Pg No.
147- 286)
Course outcomes:
CO-1: A strong foundation in core computer science and engineering, both theoretical and
applied concepts.
CO-2: An ability to apply knowledge of mathematics, science, and engineering to real-world
problems.
CO-3: Ability to model, understand, and develop complex software for system software as
well as application software.
CO-7: The broad education necessary to understand the impact of computer science and
engineering solutions in the scientific, societal and human contexts
TEXT BOOKS:
REFERENCE BOOKS:
8. Artificial Intelligence and Soft Computing- Behavioral and Cognitive Modeling of the
Human Brain- Amit Konar, CRC press, Taylor and Francis Group.
9. Soft Computing and Intelligent System Design -Fakhreddine O Karray, Clarence D Silva,.
Pearson Edition, 2004.
10. Artificial Intelligence – Patric Henry Winston – Third Edition, Pearson Education.
11. Fuzzy Sets and Fuzzy Logic Theory and Applications – George J.Klir, Bo Yuan
12. Genetic Algorithms in Search, Optimization and Machine Learning – David E.Goldberg
Addison-Wesley.
13. An Introduction to Genetic Algorithms – Melanie Mitchell, MIT Press
14. Neuro-Fuzzy and Soft Computing A Computational Approach to Learning and Machine
Intelligence – J.S.R.Jang, C.T.Sun, E.Mizutani, PHI
***
D
a
t
a
b
a
s
e
M
a
n
a
g
e
m
e
n
t
S
y
s
t
e
m
,
D
a
t
a
W
a
r
Department of Computer Science & Engg.,-VCE 137
B.Tech-CSE R18 Regulations
REFERENCES:
13. Big Data, Big Analytics: Emerging Business
Intelligence and Analytic Trends for Today's
Businesses (Wiley CIO) By Michael Minelli, Michele Pre-requisites:
Chambers, Ambiga Dhiraj John Wiley & Sons Software
Engineering
14. Hadoop: The Definitive Guide, 3rd Edition , By Tom White ,
O'reilly Media Objectives:
15. Big Data Now: 2012 Edition Publisher: O'Reilly Media. The Objective is to
provide graduates
16. Too Big to Ignore: The Business Case for Big Data
with knowledge of
(Wiley and SAS Business Series) By Phil Simon,
Wiley . engineering to
creatively,
innovatively solve
difficult computer
systems problems,
*** regularly engage in
exploring, learning
and applying state-
of-the-art of
hardware & software
technologies. The
solution of computer
systems problems is
effective software
development team
member that
contributes
innovative software
design solutions to
the resolution of
business, scientific
or government
computer systems
problems. It ables to
communicate
VAAGDEVI COLLEGE OF ENGINEERING effectively,
Department of Computer Science & Engg.,-VCE 139
B.Tech-CSE R18 Regulations
UNIT- V ***
Project Control and Process instrumentation: The seven core
Metrics, Management indicators, quality indicators, life cycle
expectations, pragmatic Software Metrics, Metrics automation.
Tailoring the Process: Process discriminate.
Future Software ProjecManagement: Modern Project Profiles, Next
generation Software economics, modern process transitions.
Case Study: The command Center Processing and Display system-
Replacement (CCPDS-R)
Course Outcomes:
5. Remembering the core concepts of software engineering such as
Waterfall model.
6. Able to understand how to improve software economics.
7. Planning different life cycle phases and producing various
aritifact sets.
8. Examining the workflows of the process and listing the
checkpoints of the process.
Quantum
Mechanical
phenomenon in
Nanostructures:
Quantum
confinement of
electrons in
semiconductor Nano
structures, one
dimensional
confinement
(Quantum Wires),
two dimensional
confinements
(Quantum Wells),
three dimensional
confinements
(Quantum dots).
VAAGDEVI COLLEGE OF ENGINEERING Unit-II:
(AUTONOMOUS)
Carbon Nano
(B18ME25) NANO TECHNOLOGY Structures: Carbon
Nanotubes (CNTs),
IV Year I-Semester
L T P C Fullerenes, C60, C80
and C240
3 0 0 3 Nanostructures,
properties
Course Objectives: (mechanical, optical
and electrical) and
Understand the fundamentals of Nano theory, necessary
applications.
background for applications
in various industries. Unit-III:
Learn the components of Nano materials in detail, and its
working in different Fabrication of
applications Nanomaterials:
Understand the general scientific concepts required for Physical Methods:
technology, Apply the
Inert gas
concepts in solving engineering problems,
condensation, Arc
Explain scientifically the new developments in engineering and
technology, and Get discharge, RF
familiarized with the concepts, theories, and technological plasma, plasma arc
applications technique, lon
sputtering, Laser
ablation, Laser
Unit-1: pyrolysis, Molecular
beam eqitaxy,
Introduction to Nanotechnology: Importance of nanoscale, Chemical vapour
Nanostructure types, electronic, magnetic, optical Properties of deposition method.
Nanomaterials, top-down and bottom – up approach to nanostructures.
Department of Computer Science & Engg.,-VCE 141
B.Tech-CSE R18 Regulations
TEXT BOOKS:
REFERENCES BOOKS:
(B18MB03)
Department of Computer Science & Engg.,-VCE 142
B.Tech-CSE R18 Regulations
UNIT -I
ARM 32 Bit MCU’s
Introduction to 16/32
Bit processors,
Department of Computer Science & Engg.,-VCE 144
B.Tech-CSE R18 Regulations
UNIT-III
Introduction to Embedded Systems: Definition of Embedded System,
Embedded Systems Vs General Computing Systems, History of
Embedded Systems, Classification, Major Application Areas, Purpose
of Embedded Systems, Characteristics and Quality Attributes of
Embedded Systems.
UNIT-IV
Typical Embedded System: Core of the Embedded System: General
Purpose and Domain Specific Processors, ASICs, PLDs, Commercial
Off- The-Shelf Components (COTS), Memory: ROM, RAM, Memory
according to the type of Interface, Memory Shadowing, Memory
selection for Embedded Systems, Sensors and Actuators,
Communication Interface: Onboard and External Communication
Interfaces.
UNIT -V
Embedded Firmware: Reset Circuit, Brown-out Protection Circuit,
Oscillator Unit, Real Time Clock, Watchdog Timer, Embedded
Firmware Design Approaches and Development Languages.
COURSE OUTCOMES
Upon completion of this course, the student will be able to:
14. Understand the architecture of Arm processors.
15. Develop a system using IO devices and networks.
16. Understand and design embedded systems.
17. Understand types of memory and inteacing to external world.
18. Understand embedded firmware design approaches
Text Book
Introduction to Embedded Systems – Shibu K.V, Mc Graw Hill.
Computer as component by wyne wolf, Morgan Kaufhann
VAAGDEVI
Reference Books COLLEGE OF
Embedded Systems Raj Kamal, TMH.
ENGINEERING
Embedded System Design – Frank Vahid, Tony Givargis, John (AUTONOMOUS)
Wiley.
Embedded Systems — Lyla, Pearson, 2013 (B18CS39)
An Embedded Software Primer – David E. Simon, Pearson
Education. NETWORK
SECURITY &
CRYPTOGRAPHY LAB
IV Year I Semester
L T P C
0 0 3 1.5
Course Objective:
Course Outcomes:
g. To clearly understand the security issues of computer CO1 :
networking and to simulate the network security algorithms Implement
implemented in C/C++/JAVA. the cipher
techniques.
Week – 1: Write a program to implement connection between two
computers to exchange simple message. CO2 : Apply
the
Week – 2: Write a program to implement Ceaser Cipher. mathematical
foundation
Week – 3: a. Write a program to calculate modular arithmetic inverse required for
Matrix. various
cryptographi
b. Write a program to implement Hill Cipher. c algorithms.
3. To highlight
plausible
implications of
such a Holistic
understanding in
terms of ethical
human conduct,
trustful and
mutually
satisfying human
behaviour and
mutually
enriching
interaction with
Nature.
Unit-1 Human
Values: Morals,
values, ethics –
integrity – work
ethics – service
VAAGDEVI COLLEGE OF ENGINEERING
learning – civic
(AUTONOMOUS)
virtue – respect for
(B18MC05) HUMAN VALUES AND PROFESSIONAL ETHICS others – living
peacefully – Caring
IV Year I Semester – sharing – honesty
L T P C – courage – valuing
time – cooperation –
2 0 0 0 commitment –
empathy – self-
Objectives:
confidence –
1. To help the students appreciate the essential complementarity spirituality –
between 'VALUES' and 'SKILLS' to ensure sustained happiness and character.
prosperity which are the core aspirations of all human beings. Unit II Professional
2. To facilitate the development of a Holistic perspective among Ethics: Profession
students towards life, profession and happiness, based on a correct and professionalism
– Two models of
understanding of the Human reality and the rest of existence. Such a
professionalism –
holistic perspective forms the basis of Value based living in a Professional
natural way. etiquette – Three
types of Ethics or
morality
Department of Computer Science & Engg.,-VCE 147
B.Tech-CSE R18 Regulations
Course Outcomes:
Networks
Objectives: 12. CO7: Determine the M
To introduce the terminology, technology and its applications 13. CO8: Develop Python
To introduce the concept of M2M (machine to machine) with
necessary protocols
To introduce the Python Scripting Language which is used in TEXT BOOKS:
many IoT devices 7. Internet of
To introduce the Raspberry PI platform, that is widely used in Things - A
IoT applications Hands-on
To introduce the implementation of web based services on IoT Approach,
devices Arshdeep
Bahga and
UNIT I Vijay
Introduction to Internet of Things –Definition and Characteristics of IoT 8. Madisetti,Uni
, Physical Design of IoT – IoT Protocols, IoT communication models, versities
IoT Communication APIs, IoT enabaled Technologies – Wireless Press, 2015,
Sensor Networks, Cloud Computing, Big data analytics, ISBN:
Communication protocols, Embedded Systems, IoT Levels and 97881737195
Templates, Domain Specific IoTs – Home, City, Environment, Energy, 47
Retail, Logistics, Agriculture, Industry, health and Lifestyle 9. Getting
Started with
UNIT II Raspberry Pi,
IoT and M2M – Software defined networks, network function Matt
virtualization, difference between SDN and NFV for IoT, Basics of IoT Richardson
System Management with NETCOZF, YANG- ETCONF, YANG, & Shawn
SNMP NETOPEER Wallace,
O'Reilly
UNIT III (SPD),
Introduction to Python - Language features of Python, Data types, data 2014, ISBN:
structures, Control of flow, functions, modules, packaging, file 97893502397
handling, data/time operations, classes, Exception handling Python 59
packages - JSON, XML , HTTPLib , URLLib , SMTPLib .
REFERENCES:
UNIT IV Jan Holler,
IoT Physical Devices and Endpoints - Introduction to Raspberry PI- VlasiosTsiats
Interfaces (serial, SPI, I2C) is, Catherine
Programming – Python program with Raspberry PI with focus of Mulligan,
interfacing external gadgets, controlling output, reading input from pins. Stefan
Avesand,
UNIT V StamatisKarn
IoT Physical Servers and Cloud Offerings – Introduction to Cloud ouskos,
Storage models and communication APIs Web server – Web server for David Boyle,
IoT, Cloud for IoT, Python web application framework Designing a “From
REST ful web API Machine-to-
Machine to
Course Outcomes: the Internet
of Things:
6. CO1: Interpret the vision of IOT from a global context. Introduction
7. CO2: Perceive building blocks of Internet of Things and its characteristics. to a New Age
8. CO3: Learn the basic concepts of Python. of
9. CO4: Implement the python programming using Raspberry.
Intelligence”,
1 st Edition,
10. CO5: Perceive the application areas of IOT.
Academic
11. CO6: Realize the revolution of Internet in Mobile Devices, Cloud & Sensor
Press, 2014.
Department of Computer Science & Engg.,-VCE 149
B.Tech-CSE R18 Regulations
Pre-Requisites:
*** None
Pre-Requisites:
Operating Systems,
Computer
Organization &
Architecture.
Objectives:
To learn the
fundamentals of
Operating Systems
To gain knowledge
on
Distributed operating
system concepts that
includes
architecture,Mutual
exclusion
algorithms,
Deadlock detection
algorithms and
agreement protocols
To gain insight on
to the distributed
resource
management
components viz.
the algorithms for
implementation of
distributed shared
memory, recovery
and
VAAGDEVI COLLEGE OF commit protocols
ENGINEERING To know the
(AUTONOMOUS) components and
management aspects
(B18CS41) ADVANCED OPERATING
of Real time, Mobile
SYSTEMS
operatingsystems
IV Year - II Semester
L T P C UNIT I
FUNDAMENTALS
OF OPERATING
3
SYSTEMS
0 –
Overview
Synchronization
0
Mechanisms –
Department of Computer Science & Engg.,-VCE 150
B.Tech-CSE R18 Regulations
U
N
VAAGDEVI COLLEGE OF I
ENGINEERING T
(AUTONOMOUS)
-
(B18CS42) PYTHON PROGRAMMING
I
IV Year - II Semester
L T P C Introduction:
History of
Python, Need of
Python
3
Programming,
Applications
0
Basics of Python
0
Programming
Using the
3
REPL(Shell),
Pre-Requisites: None Running Python
Department of Computer Science & Engg.,-VCE 152
B.Tech-CSE R18 Regulations
COURSE OUTCOMES:
Cybercrime:
Mobile and
Wireless Devices:
Introduction,
Proliferation of
Mobile andWireless
Devices, Trends in
Mobility, Credit card
Frauds in Mobile
and Wireless
Computing Era,
VAAGDEVI COLLEGE OF Security Challenges
ENGINEERING Posed by Mobile
(AUTONOMOUS) Devices, Registry
Settings for Mobile
(B18CS43) CYBER SECURITY& HACKING
Devices,
Authentication
IV Year II Semester
L T P C service Security,
Attacks on
3 0 0 3 Mobile/Cell Phones,
Prerequisites: (B18CS11) Operating System, (B18CS14) Mobile Devices:
Data Communications and Computer Networks, Security
(B18CS32) Network Security and Cryptography. Implications for
Objectives:
Organizations,
To introduce the methodologies and framework of ethical
Organizational
hacking forenhancing the security.
Measures for
To learn about cybercrimes and how they are planned.
Handling Mobile,
To learn the vulnerabilities of mobile and wireless devices.
Organizational
To learn about the cyber Law and legal perspectives.
Security Policies an
UNIT – I
Measures in Mobile
Introduction to Cybercrime: Introduction, Cybercrime and
Computing Era,
Information Security, Who areCybercriminals, Classifications of
Laptops.
Cybercrimes, Cyber-crime: The legal Perspectives and Indian
Text Book : Page no
Perspective, Cybercrime and the Indian ITA 2000, A Global
Perspective on Cybercrimes. : 81-119
Text Book : Page no : 1 - 39
UNIT – IV
UNIT – II Tools and Methods
Cyber Offenses: How Criminals Plan Them: Introduction, How Used in
Criminals plan theAttacks, Social Engineering, Cyber stalking, Cyber Cybercrime:
cafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Introduction, Proxy
Vector, Cloud Computing. Servers and
Text Book : Page no : 45 - 78 Anonymizers,Phishi
ng, Password
UNIT – III Cracking, Key
loggers and
UNIT – V
Cyber Security: Organizational Implications, Introduction, Cost of
Cybercrimes and IPRissues, Web threats for Organizations, Security
and Privacy Implications, Social media marketing: Security Risks and
Perils for Organizations, Social Computing and the associated
challenges for Organizations.
Text Book : Page no :495-522
VAAGDEVI
COURSE OUTCOMES: COLLEGE OF
CO1 :Outline key terms and concepts in cyber law, intellectual
property and cybercrimes.
ENGINEERING
CO2 :Explore the vulnerabilities, threats and cybercrimes posed (AUTONOMOUS)
by criminals. Identify varioussecurity challenges phased by (B18CS44)
mobile devices. SERVICE
CO3 :Identify various types of tools and methods used in ORIENTED
cybercrime, develops the secure counter methods to maintain ARCHITECTURE
security protection.
CO4 :Analyze the cybersecurity risk management policies in IV Year B. Tech II-
order to adequately protect an organization's critical information Semester
and assets.
L T P C
TEXT BOOKS:
REFERENCE BOOKS:
17. Cyber Security Essentials, James Graham, Richard Howard and 3 0 0 3
Ryan Otson, CRC Press.
Prerequisites: web
18. Introduction to Cyber Security, Chwan-Hwa (john) Wu, J. services
David Irwin. CRC Press T&F Group
Course Objectives:
SOA. UNIT-V
13. Understand web services and primitive, contemporary SOA.
14. Understand various service layers. Service
15. Understand service-oriented analysis and design based on Oriented Design
guidelines. (Part III- Service
Design): Service
UNIT-I Design Overview,
Entity-Centric
Introducing SOA: Fundamental SOA, Common Characteristics Business Service
of Contemporary SOA, Common Tangible Benefits of SOA, and Design, Application
Common Pitfalls of Adopting SOA. The Evolution of SOA: An SOA Service Design,
Timeline, the Continuing Evolution of SOA, the Roots of SOA. (32- Task-Centric
107) Business Service
Design, Service
UNIT-II Design Guidelines.
Service Oriented
Web Services and Primitive SOA: The Web Services Frame Design (Part IV-
Work, Services, Service Descriptions (with WSDL), Messaging (with Business Process
SOAP). Web Services and Contemporary SOA (Part I-Activity Design): WS-BPEL
management and Composition): Message Exchange Patterns, Service Language Basics,
Activity, Coordination, Atomic Transactions, Orchestration, WS- Coordination
Choreography. Web Services and Contemporary SOA (Part-II- Overview, Service
Advanced Messaging, Metadata and Security): Addressing, Reliable Oriented Business
Messaging, Correlation, Policies, Metadata exchange, Security. (109- Process Design.
265) (495-586)
Concepts, Technology, and Design, Thomas Erl, Pearson Education. They would
be adequately
REFERENCES: exposed to
human
Understanding SOA with Web Services, Eric Newcomer, Greg computer
Lomow, Pearson Education. interaction
The Definitive guide to SOA, Jeff Davies & others, Apress, for IR and for
Dreamtech. application of
Java SOA Cook book, E.Hewitt, SPD. IR in
SOA in Practice, N.M.Josuttis, SPD. searching the
Applied SOA, M.Rosen and others, Wiley India pvt. Ltd. web.
Java Web Services Architecture, J.Mc Govern, and others,
Morgan Kaufmann Publishers, Elsevier. UNIT I
SOA for Enterprise Applications, Shankar.K, Wiley India Retrieval Strategies:
Edition. Vector Space Model:
(page no:11 to 15)
SOA-Based Enterprise Integration, W.Roshen, TMH.SOA
Example of
Security, K.Rama Rao, C.Prasad, dreamtech press. (w.e.f 2015-
similarity
2016) .
coefficient(page
no:15 to 18)
Similarity
***
measures(page no:18
to 21 ) Probabilistic
Retrieval Strategies:
(page no:21 ) Simple
Term Weights, (page
no:21 to 32) Non-
Binary Independence
Model, (page no:33
to 45 ) Language
models (page no:45
to 56 )
UNIT II
Retrieval Utilities:
VAAGDEVI COLLEGE OF Relevance Feedback
ENGINEERING (page no:94 to 105)
(AUTONOMOUS) Clustering (page
no:105 to 113) N-
(B18CS45) INFORMATION RETRIEVAL SYSTEMS grams (page no:115
to 119) Regression
IV Year B. Tech. II- Semester Analysis (page
L T P C no:119 to
122).Thesauri (page
3 0 0 3 no:112 to 132)
Prerequisites: DBMS
UNIT III
Retrieval Utilities:
Course Objectives: Semantic networks
Students of this course will be exposed to text informational (page no: 132 to
retrieval and it’s past, present and future research directions. 139) Parsing (page
They would understand the processes, techniques and the no:139 to 144)
evaluation methods presently used in the IR modeling. Cross-language
The languages used in IR and use these to write queries in IR. Information
Department of Computer Science & Engg.,-VCE 157
B.Tech-CSE R18 Regulations
UNIT IV
Efficiency: I Inverted index (page no: 182 to 195)Query processing
(page no:195 to 199) Signature files (page no:199 to 203) Duplicate
document detection (page no:203 to 207)
UNIT V
Integrating Structured Data and Text: A Historical progression (page
no: 222 to 227) Information retrieval as a relational application (page
no: 228 to 245) Semi-structured search using a relational schema (page
no:245 to 249) Distributed Information Retrieval: A Theoretical model
of distributed retrieval (page no:275 to 280) Web search (page no:281
to 284)
Course Outcomes:
TEXT BOOKS:
REFERENCES:
***