CSE - Cyber Security - IV Years - CS & Syllabus - UG - R20

R-20 Syllabus for CSE-CS, JNTUK w. e. f.
2020 – 21
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

KAKINADA – 533 003, Andhra Pradesh, India
DEPARTMENT OF CSE – CYBER SECURITY
COURSE STRUCTURE AND SYLLABUS

For UG – R20
B. Tech - COMPUTER SCIENCE & ENGINEERING with Specialization
Common to
(i) CSE (CYBER SECURITY) – Branch Code:46
(ii) CYBER SECURITY – Branch Code:59
(Applicable for batches admitted from 2020-2021)

KAKINADA - 533 003, Andhra Pradesh, India
R-20 Syllabus for CSE-CS, JNTUK w. e. f. 2020 – 21

COURSE STRUCTURE
I Year – I SEMESTER
Course
S. No Subjects L T P Credits
Code
1 BS1101 Mathematics - I 3 0 0 3
2 BS1104 Applied Physics 3 0 0 3
3 HS1101 Communicative English 3 0 0 3
4 ES1101 Computer Engineering Workshop 1 0 4 3
5 ES1102 Programming for Problem Solving Using C 3 0 0 3
6 HS1102 English Communication skills Laboratory 0 0 3 1.5
7 BS1105 Applied Physics Lab 0 0 3 1.5
8 ES1103 Programming for Problem Solving Using C Lab 0 0 3 1.5
Total Credits 19.5
I Year – II SEMESTER
Course
S. No Subjects L T P Credits
Code
1 BS1202 Mathematics – II 3 0 0 3
2 BS1206 Applied Chemistry 3 0 0 3
3 ES1204 Problem Solving Using Python 3 0 0 3
4 ES1205 Basic Electrical& Electronics Engineering 3 0 0 3
5 ES1206 Digital Logic Design 3 0 0 3
6 ES1207 Problem Solving Using Python Lab 0 0 3 1.5
7 BS1207 Applied Chemistry Lab 0 0 3 1.5
8 ES1208 Digital Logic Design Lab 0 0 3 1.5
9 MC1203 Constitution of India 2 0 0 0
Total Credits 19.5


II Year – I SEMESTER
Course
S. No Course Title L T P C
Code
1. BSC2101 Mathematics – III 3 0 0 3
Mathematical Foundations of
2. PCC2101 3 0 0 3
Computer Science
3. PCC2102 Data Structures 3 0 0 3
4. PCC2103 Operating Systems 3 0 0 3
5. PCC2104 Java Programming 3 0 0 3
6. PCC2105 Data Structures Lab 0 0 3 1.5
7. PCC2106 OS&UNIX Programming Lab 0 0 3 1.5
8. PCC2107 Java Programming Lab 0 0 3 1.5
Free and Open Source Software
9. SC2101 0 0 4 2
Essence of Indian Traditional
10. MC2101 2 0 0 0
Knowledge
TOTAL 21.5
II Year – II SEMESTER
Course
S.No Course Title L T P C
Code
1. ESC2201 Computer Organization& Architecture 3 0 0 3
2. BSC2201 Probability and Statistics 3 0 0 3
3. PCC2201 Formal Languages & Automata Theory 3 0 0 3
4. PCC2202 Database Management Systems 3 0 0 3
Managerial Economics and Financial
5. HSMC2201 3 0 0 3
Accountancy
6. ESC2202 Computer Organization& Architecture Lab 0 0 3 1.5
7. PCC2203 R Programming Lab 0 0 3 1.5
8. PCC2204 Database Management Systems Lab 0 0 3 1.5
9. SC2201 Android Application Development 0 0 4 2
TOTAL 21.5
Minor courses
4 0 0 4
(The hours distribution can be 3-0-2 or 3-1-0 also)
Internship 2 Months (Mandatory) during summer vacation

III Year – I SEMESTER
Course
S. No. Course Title L T P C
Code
1 PCC3101 Computer Networks 3 0 0 3
2 PCC3102 Software Engineering 3 0 0 3
3. PCC3103 Design and Analysis of Algorithms 3 0 0 3
Open Elective-I
4. OEC3101 Open Electives offered by other Departments/ 3 0 0 3
Web Technologies (Job oriented course)
Professional Elective Courses – I
1. Computer Graphics
5. PEC3101 2. Artificial Intelligence 3 0 0 3
3. Compiler Design
4. Advanced Data Structures
5. Principles of Programming Languages
6. PCC3104 Network Programming Lab 0 0 3 1.5
7 PCC3105 Software Engineering Lab 0 0 3 1.5
Web Application Development Using Full Stack –
8 SC3101 0 0 4 2
Frontend Development –Module -I
9. MC3101 Environmental Science 2 0 0 0
Summer Internship 2 Months (Mandatory) after second year (to
0 0 0 1.5
be evaluated during V semester
Total 21.5
Minor courses 4 0 0 4

III Year – II SEMESTER

Course
S. No. Course Title L T P C
Code
1 PCC3201 Cryptography and Network Security 3 0 0 3
2. PCC3202 Machine Learning 3 0 0 3
3. PCC3203 Introduction to Cyber Security 3 0 0 3
Professional Elective Courses-II
4. PEC3201 (NPTEL/SWAYAM) 3 0 0 3
Duration: 12 Weeks Minimum
*Course/subject title can’t be repeated
Open Elective-II
Web Services (Job Oriented Course)
6. PCC3204 Cyber Security Lab 0 0 3 1.5
7. PCC3205 Machine Learning Lab 0 0 3 1.5
8. PCC3206 Cryptography and Network Security Lab 0 0 3 1.5
Web Application Development Using Full Stack -
9. SC3201 0 0 4 2
Frontend Development –Module -II
10. MC3201 Employability Skills 2 0 0 0
Total 21.5
Minor courses through SWAYAM 0 0 0 2
Industrial/Research Internship (Mandatory) 2 Months during summer vacation


IV Year – I SEMESTER
Cours
S. No. Course L T P C
e
Title
Code
Professional Elective courses – III
1. Internet Of Things
1 PEC4101 2. Data Science 3 0 0 3
3. Distributed Systems
4 Information Coding Techniques
5. Mobile and Wireless Security
Professional Elective courses – IV
1. Cyber Crime Investigation and Digital
Forensics
2. PEC4102 2. Cloud Computing 3 0 0 3
3. Mean Stack Technologies
4. Ad-hoc and Sensor Networks
5. Malware Analysis & Reverse Engineering
Professional Elective courses – V
1. Cyber Laws and Security Policies
3. PEC4103 2. Intrusion Detection and Prevention System 3 0 0 3
3.BigData Analytics
4. Data Privacy
5.Ethical Hacking
Open Elective-III
DevOps (Job Oriented Course)
Open Elective-IV
Multimedia And Rich Internet Applications
(Job Oriented Course)
Humanities and Social Science Elective
1. Universal Human Values
6. HSMC4101 2. Human Resources Development 3 0 0 3
3. Business Intelligence
4. Management And Organizational Behaviour
5. Strategic Management
7. SC4101 Multimedia Application Development 0 0 4 2
Industrial/Research Internship 2 Months (Mandatory) after
8 0 0 0 3
third year (to be evaluated during VII semester)
Total credits 23
Minor courses through SWAYAM 0 0 0 2

IV Year – II SEMESTER
Hours
S. No Category Code Course Title per Credit
week s
Project
1 Major PROJ Project work, seminar - - - 12
Project and internship in
industry
INTERNSHIP (6 MONTHS)
Total Credits 12
Open Electives to be offered by Cyber Security for Other Branches:
Open Elective I: Open Elective II:

1. Data Structures 1. Operating Systems
2. Computer Networks 2. Web Technologies
3. Data Base Management Systems 3. Introduction to Cyber Security
4. Problem Solving using Python 4. Artificial Intelligence
Open Elective III: Open Elective IV:
1. Big Data analytics 1. Cyber Crime Investigation and
2. Cloud Computing Digital Forensics
3. Cryptography and Network Security 2. Malware Analysis & Reverse
4. Data Science Engineering
3. Machine Learning
4.Distributed systems
Minor Degree in Cyber Security offered to other branches

S.No Year and Sem Subject Title L T P C
1 II Year II Sem Introduction to Cyber Security 3 1 0 4
2 III Year I Sem Ethical Hacking 3 0 2 4
3 III Year II Sem Data Encryption and Network Security 3 1 0 4
4 IV Year I Sem Digital Forensics 3 1 0 4
02 MOOCS courses @ 2credits each**
1. Information Security&Secure Systems
5 Engineering 4
2. Privacy And Security In Online Social Media
3. Computational Number Theory & Cryptography
4. Social Networks
Grand Total 20
Note: Out of the 20 Credits, 16 credits shall be earned by specified courses listed above.
In addition to the 16 credits, students must pursue at least 2 courses through MOOCs.
The courses must be of minimum 8 weeks in duration. Student can register at any time
after the completion ofII B.Tech. I Sem.
**Choose 02 MOOCS courses @ 2credits each from SWAYAM/NPTEL.

L T P C
I Year - I Semester
3 0 0 3
MATHEMATICS-I (BS1101)
Course Objectives
This course will illuminate the students in the concepts of calculus.
To enlighten the learners in the concept of differential equations and multivariable calculus.
To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various real
world problems and their applications.
utilize mean value theorems to real life problems (L3)
solve the differential equations related to various engineering fields (L3)
familiarize with functions of several variables which is useful in optimization (L3)
Apply double integration techniques in evaluating areas bounded by region (L3)
students will also learn important tools of calculus in higher dimensions. Students will
become familiar with 2- dimensional and 3-dimensional coordinate systems (L5 )
UNIT I: Sequences, Series and Mean value theorems: (10 hrs)
Sequences and Series: Convergences and divergence – Ratio test – Comparison tests – Integral test
– Cauchy’s root test – Alternate series – Leibnitz’s rule.
Mean Value Theorems (without proofs): Rolle’s Theorem – Lagrange’s mean value theorem –
Cauchy’s mean value theorem – Taylor’s and Maclaurin’s theorems with remainders.
UNIT II: Differential equations of first order and first degree: (10 hrs)
Linear differential equations – Bernoulli’s equations – Exact equations and equations reducible to
exact form.
Applications: Newton’s Law of cooling – Law of natural growth and decay – Orthogonal
trajectories – Electrical circuits.
UNIT III: Linear differential equations of higher order: (10 hrs)
Non-homogeneous equations of higher order with constant coefficients – with non-homogeneous

term of the type eax, sin ax, cos ax, polynomials in xn, eax V(x) and xnV(x) – Method of Variation of
parameters.
Applications: LCR circuit, Simple Harmonic motion.
UNIT IV: Partial differentiation: (10 hrs)
Introduction – Homogeneous function – Euler’s theorem – Total derivative – Chain rule – Jacobian
– Functional dependence – Taylor’s and Mc Laurent’s series expansion of functions of two
variables. Applications: Maxima and Minima of functions of two variables without constraints and
Lagrange’s method (with constraints).

UNIT V: Multiple integrals: (8 hrs)
Double and Triple integrals – Change of order of integration – Change of variables.
Applications: Finding Areas and Volumes.
Text Books:
1. B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill
Education.
Reference Books:
1. Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition, Wiley-India.
2. Joel Hass, Christopher Heil and Maurice D. Weir, Thomas calculus, 14th Edition,
Pearson.
3. Lawrence Turyn, Advanced Engineering Mathematics, CRC Press, 2013.
4. Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford University Press.

L T P C
I Year - I Semester
3 0 0 3
APPLIED PHYSICS (BS1104)
(For All Circuital Branches like ECE, EEE, CSE etc)

Unit-I: Wave Optics 12hrs
Interference: Principle of superposition –Interference of light - Interference in thin films
(Reflection Geometry) & applications - Colors in thin films- Newton’s Rings-
Determination of wavelength and refractive index.
Diffraction: Introduction - Fresnel and Fraunhofer diffraction - Fraunhofer diffraction due to

single slit, double slit - N-slits (Qualitative) – Diffraction Grating - Dispersive power and
resolving power of Grating(Qualitative).
Polarization: Introduction-Types of polarization - Polarization by reflection, refraction and

Double refraction - Nicol’s Prism -Half wave and Quarter wave plates.
Unit Outcomes:
The students will be able to

 Explain the need of coherent sources and the conditions for sustained interference (L2)
 Identify engineering applications of interference (L3)
 Analyze the differences between interference and diffraction with applications (L4)
 Illustrate the concept of polarization of light and its applications (L2)
 Classify ordinary polarized light and extraordinary polarized light (L2)
Unit-II: Lasers and Fiber optics 8hrs

Lasers: Introduction – Characteristics of laser – Spontaneous and Stimulated emissions of
radiation – Einstein’s coefficients – Population inversion – Lasing action - Pumping
mechanisms – Ruby laser – He-Ne laser - Applications of lasers.
Fiber optics: Introduction –Principle of optical fiber- Acceptance Angle - Numerical Aperture -
Classification of optical fibers based on refractive index profile and modes –
Propagation of electromagnetic wave through optical fibers - Applications.
Unit Outcomes:

 Understand the basic concepts of LASER light Sources (L2)
 Apply the concepts to learn the types of lasers (L3)
 Identifies the Engineering applications of lasers (L2)
 Explain the working principle of optical fibers (L2)
 Classify optical fibers based on refractive index profile and mode of propagation (L2)
 Identify the applications of optical fibers in various fields (L2)

Unit III: Quantum Mechanics, Free Electron Theory and Band theory 10hrs
Quantum Mechanics: Dual nature of matter – Heisenberg’s Uncertainty Principle –
Significance and properties of wave function – Schrodinger’s time independent and dependent
wave equations– Particle in a one-dimensional infinite potential well.
Free Electron Theory: Classical free electron theory (Qualitative with discussion of merits
and demerits) – Quantum free electron theory– Equation for electrical conductivity based on
quantum free electron theory- Fermi-Dirac distribution- Density of states (3D) - Fermi
energy.
Band theory of Solids: Bloch’s Theorem (Qualitative) - Kronig - Penney model
(Qualitative)- E vs K diagram - V vs K diagram - effective mass of electron –
Classification of crystalline solids–concept of hole.
Unit Outcomes:
 Explain the concept of dual nature of matter (L2)
 Understand the significance of wave function (L2)
 Interpret the concepts of classical and quantum free electron theories (L2)
 Explain the importance of K-P model
 Classify the materials based on band theory (L2)
 Apply the concept of effective mass of electron (L3)
Unit-IV: Dielectric and Magnetic Materials 8hrs

Dielectric Materials: Introduction - Dielectric polarization - Dielectric polarizability,
Susceptibility and Dielectric constant - Types of polarizations- Electronic (Quantitative),
Ionic (Quantitative) and Orientation polarizations (Qualitative) - Lorentz internal field-
Clausius- Mossotti equation- Piezoelectricity.
Magnetic Materials: Introduction - Magnetic dipole moment - Magnetization-Magnetic
susceptibility and permeability - Origin of permanent magnetic moment - Classification of
magnetic materials: Dia, para, Ferro, antiferro & Ferri magnetic materials - Domain concept
for Ferromagnetism & Domain walls (Qualitative) - Hysteresis - soft and hard magnetic
materials- Eddy currents- Engineering applications.
Unit Outcomes:

 Explain the concept of dielectric constant and polarization in dielectric materials (L2)
 Summarize various types of polarization of dielectrics (L2)
 Interpret Lorentz field and Claussius- Mosotti relation in dielectrics(L2)
 Classify the magnetic materials based on susceptibility and their temperature
dependence (L2)
 Explain the applications of dielectric and magnetic materials (L2)
 Apply the concept of magnetism to magnetic data storage devices (L3)

Unit – V: Semiconductors and Superconductors 10hrs
Semiconductors: Introduction- Intrinsic semiconductors – Density of charge carriers – Electrical

conductivity – Fermi level – extrinsic semiconductors – density of charge carriers – dependence of
Fermi energy on carrier concentration and temperature - Drift and diffusion currents – Einstein’s
equation- Hall effect – Hall coefficient –Applications of Hall effect.
Superconductors: Introduction – Properties of superconductors – Meissner effect – Type I and Type
II superconductors – BCS theory (Qualitative) – Josephson effects (AC and DC) – SQUIDs
– High Tc superconductors – Applications of superconductors.
Unit Outcomes:

 Classify the energy bands of semiconductors (L2)
 Interpret the direct and indirect band gap semiconductors (L2)
 Identify the type of semiconductor using Hall effect (L2)
 Identify applications of semiconductors in electronic devices (L2)
 Classify superconductors based on Meissner’s effect (L2)
 Explain Meissner’s effect, BCS theory & Josephson effect in superconductors (L2)
Text books:
1. M. N. Avadhanulu, P.G.Kshirsagar & TVS Arun Murthy” A Text book of Engineering
Physics”- S.Chand Publications, 11th Edition 2019.
2. Engineering Physics” by D.K.Bhattacharya and Poonam Tandon, 1st edition, Oxford press, 2015.
3. Applied Physics by P.K.Palanisamy 3rd edition, SciTech publications, 2013.
Reference Books:
1. Fundamentals of Physics – Halliday, Resnick and Walker,10th edition, John Wiley &Sons, 2013.
2. Engineering Physics by M.R.Srinivasan, New Age international publishers, 2009.
3. Shatendra Sharma, Jyotsna Sharma, “ Engineering Physics”, 1 st edition, Pearson Education, 2018.
4. Engineering Physics - Sanjay D. Jain, D. Sahasrabudhe and Girish, 1st edition, University Press,
2010.
5. Semiconductor physics and devices- Basic principle – Donald A, Neamen, 3rd edition, Mc Graw
Hill, 2003.
6. B.K. Pandey and S. Chaturvedi, Engineering Physics, 1 st edition, Cengage Learning, 2013.

L T P C
I Year - I Semester
3 0 0 3
COMMUNICATIVE ENGLISH (HS1101)
Introduction
The course is designed to train students in receptive (listening and reading) as well as productive and
interactive (speaking and writing) skills by incorporating a comprehensive, coherent and integrated
approach that improves the learners’ ability to effectively use English language in academic/ workplace
contexts. The shift is from learning about the language to using the language. On successful completion of
the compulsory English language course/s in B.Tech., learners would be confident of appearing for
international language qualification/proficiency tests such as IELTS, TOEFL, or BEC, besides being able to
express themselves clearly in speech and competently handle the writing tasks and verbal ability component
of campus placement tests. Activity based teaching-learning methods would be adopted to ensure that
learners would engage in actual use of language both in the classroom and laboratory sessions.
Course Objectives
➢ Facilitate effective listening skills for better comprehension of academic lectures and English spoken
by native speakers
➢ Focus on appropriate reading strategies for comprehension of various academic texts and authentic
materials
➢ Help improve speaking skills through participation in activities such as role plays, discussions and
structured talks/oral presentations
➢ Impart effective strategies for good writing and demonstrate the same in summarizing, writing well
organized essays, record and report useful information
➢ Provide knowledge of grammatical structures and vocabulary and encourage their appropriate use in
speech and writing
Learning Outcomes
At the end of the module, the learners will be able to
 understand social or transactional dialogues spoken by native speakers of English and identify the
context, topic, and pieces of specific information
 ask and answer general questions on familiar topics and introduce oneself/others
 employ suitable strategies for skimming and scanning to get the general idea of a text and locate
specific information
 recognize paragraph structure and be able to match beginnings/endings/headings with paragraphs
 form sentences using proper grammatical structures and correct word forms
Unit 1:
Lesson-1: A Drawer full of happiness from “Infotech English”, Maruthi Publications
Lesson-2: Deliverance by Premchand from “The Individual Society”,Pearson Publications. (Non-

detailed)

Listening: Listening to short audio texts and identifying the topic. Listening to prose, prose and
conversation.
Speaking: Asking and answering general questions on familiar topics such as home, family, work, studies
and interests. Self introductions and introducing others.
Reading: Skimming text to get the main idea. Scanning to look for specific pieces of information.
Reading for Writing: Paragraph writing (specific topics) using suitable cohesive devices; linkers, sign
posts and transition signals; mechanics of writing - punctuation, capital letters.
Vocabulary: Technical vocabulary from across technical branches (20) GRE Vocabulary (20) (Antonyms
and Synonyms, Word applications) Verbal reasoning and sequencing of words.
Grammar: Content words and function words; word forms: verbs, nouns, adjectives and adverbs; nouns:
countables and uncountables; singular and plural basic sentence structures; simple question form - wh-
questions; word order in sentences.
Pronunciation: Vowels, Consonants, Plural markers and their realizations
Unit 2:
Lesson-1: Nehru’s letter to his daughter Indira on her birthday from “Infotech English”, Maruthi
Publications
Lesson-2: Bosom Friend by Hira Bansode from “The Individual Society”, Pearson Publications.(Non-
detailed)
Listening: Answering a series of questions about main idea and supporting ideas after listening to audio
texts, both in speaking and writing.
Speaking: Discussion in pairs/ small groups on specific topics followed by short structured talks.
Functional English: Greetings and leave takings. Reading: Identifying sequence of ideas; recognizing verbal
techniques that help to link the ideas in a paragraph together.
Reading for Writing: Summarizing - identifying main idea/s and rephrasing what is read; avoiding
redundancies and repetitions.
Vocabulary: Technical vocabulary from across technical branches (20 words). GRE Vocabulary Analogies
(20 words) (Antonyms and Synonyms, Word applications)
Grammar: Use of articles and zero article; prepositions.
Pronunciation: Past tense markers, word stress-di-syllabic words
Unit 3:
Lesson-1: Stephen Hawking-Positivity ‘Benchmark’ from “Infotech English”, Maruthi Publications
Lesson-2: Shakespeare’s Sister by Virginia Woolf from “The Individual Society”, Pearson
Publications.(Non-detailed)
Listening:Listening for global comprehension and summarizing what is listened to, both in speaking and
writing.

Speaking: Discussing specific topics in pairs or small groups and reporting what is discussed.Functional
English:Complaining and Apologizing.
Reading: Reading a text in detail by making basic inferences - recognizing and interpreting specific context
clues; strategies to use text clues for comprehension.Critical reading.
Reading for Writing: Summarizing - identifying main idea/s and rephrasing what is read; avoiding
redundancies and repetitions. Letter writing-types, format and principles of letter writing.E-mail etiquette,
Writing CV’s.
Vocabulary: Technical vocabulary from across technical branches (20 words). GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Association, sequencing of words
Grammar: Verbs - tenses; subject-verb agreement; direct and indirect speech, reporting verbs for academic
purposes.
Pronunciation: word stress-poly-syllabic words.
Unit 4:
Lesson-1: Liking a Tree, Unbowed: Wangari Maathai-biography from “Infotech English”, Maruthi
Publications
Lesson-2: Telephone Conversation-Wole Soyinka from “The Individual Society”, Pearson

Publications.(Non-detailed)
Listening: Making predictions while listening to conversations/ transactional dialogues without video (only
audio); listening to audio-visual texts.
Speaking: Role plays for practice of conversational English in academic contexts (formal and informal) -
asking for and giving information/directions.Functional English: Permissions, Requesting, Inviting.
Reading: Studying the use of graphic elements in texts to convey information, reveal
trends/patterns/relationships, communicative process or display complicated data.
Reading for Writing: Information transfer; describe, compare, contrast, identify significance/trends based
on information provided in figures/charts/graphs/tables.Writing SOP, writing for media.
Vocabulary: Technical vocabulary from across technical branches (20 words) GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Cloze Encounters.
Grammar: Quantifying expressions - adjectives and adverbs; comparing and contrasting; degrees of
comparison; use of antonyms
Pronunciation: Contrastive Stress
Unit 5:
Lesson-1: Stay Hungry-Stay foolish from “Infotech English”, Maruthi Publications
Lesson-2: Still I Rise by Maya Angelou from “The Individual Society”, Pearson Publications.(Non-
detailed)

Listening: Identifying key terms, understanding concepts and interpreting the concepts both in speaking
and writing.
Speaking: Formal oral presentations on topics from academic contexts - without the use of PPT slides.
Functional English: Suggesting/Opinion giving.
Reading: Reading for comprehension. RAP StrategyIntensive reading and Extensive reading techniques.
Reading for Writing: Writing academic proposals- writing research articles: format and style.
Vocabulary: Technical vocabulary from across technical branches (20 words) GRE Vocabulary (20 words)
(Antonyms and Synonyms, Word applications) Coherence, matching emotions.
Grammar: Editing short texts – identifying and correcting common errors in grammar and usage (articles,
prepositions, tenses, subject verb agreement)
Pronunciation: Stress in compound words

Prescribed text books for theory for Semester-I:
1. “Infotech English”, Maruthi Publications. (Detailed)
2.“The Individual Society”, Pearson Publications.(Non-detailed)
Prescribed text book for Laboratory for Semesters-I & II:
1. “Infotech English”, Maruthi Publications. (with Compact Disc)
Reference Books:
 Bailey, Stephen. Academic writing: A handbook for international students. Routledge, 2014.
 Chase, Becky Tarver. Pathways: Listening, Speaking and Critical Thinking. Heinley ELT;
2nd Edition, 2018.
 Skillful Level 2 Reading & Writing Student's Book Pack (B1) Macmillan Educational.
 Hewings, Martin. Cambridge Academic English (B2). CUP, 2012.

L T P C
I Year - I Semester
1 0 4 3
COMPUTER ENGINEERING WORKSHOP (ES1101)
Course Objectives:
 To make the students aware of the basic hardware components of a computer and installation of
operating system.
 To introduce Raptor Tool for flowchart creation.
 To introduce programming through Visual Programming tool using scratch.
 To get knowledge in awareness of cyber hygiene that is protecting the personal computer from
getting infected with the viruses, worms and other cyber-attacks.
 To introduce the usage of Productivity tools in crafting professional word documents, excel
spreadsheets and power point presentations using open office tools.
UNIT I
Simple Computer System: Central processing unit, the further need of secondary storage, Types of memory,
Hardware, Software and people. Peripheral Devices: Input, Output and storage, Data Preparation, Factors
affecting input, Input devices, Output devices, Secondary devices, Communication between the CPU and
Input/ Output devices.
TASK 1: PC Hardware: PC Hardware introduces the students to a personal computer and its basic
peripherals, the process of assembling a personal computer, installation of system software like MS
Windows, Linux and the required device drivers. In addition hardware and software level
troubleshooting process, tips and tricks would be covered.
Every student should identify the peripherals of a computer, components in a CPU and its functions.
Draw the block diagram of the CPU along with the configuration of each peripheral and submit to your
instructor. Every student should disassemble and assemble the PC back to working condition.
TASK 2: Hardware Troubleshooting: Students have to be given a PC which does not boot due to
improper assembly or defective peripherals. They should identify the problem and fix it to get the
computer back to working condition.
Software Troubleshooting: Students have to be given a malfunctioning CPU due to system software
problems. They should identify the problem and fix it to get the computer back to working condition.
UNIT II
Problem Solving and Programming: Algorithm development, Flowcharts, Looping, some programming
features, Pseudo code, the one-zero game, some structured programming concepts, documents.
Programming Languages: Machine Language and assembly language, high -level and low level languages,
Assemblers, Compilers, and Interpreters
TASK 3: Drawing flowcharts (Raptor Tool)

1. Create flowcharts for take-off landing of an Aeroplane.
2. Create a flowchart to validate an email id entered by user.
3. Create flowchart to print first 50 prime numbers.
TASK 4: Productivity tool:LaTeX and Microsoft (MS) office: Importance of MS office, Details of the
three tasks and features that should be covered in each, MS word, Power Point, Excel.

UNIT III
Operating systems: Introduction, Evolution of operating systems, , Command Interpreter, Popular operating
systems- Microsoft DOS, Microsoft Windows, UNIX and Linux.
Introduction to Unix Shell Commands, directory management commands, file operations, users commands,
Time and Date commands.
TASK 5: Operating System Installation: Every student should individually install operating system
like Linux or MS windows on the personal computer. The system should be configured as dual boot with
both windows and Linux.
TASK 6: Basic Commands:Unix Shell Commands, directory management commands, file operations,
users commands, Time and Date commands.
UNIT IV
Computer Networks: Introduction to computer Networks, Network topologies-Bus topology, star topology,
Ring topology, Mesh topology, Hybrid topology, Types of Networks: Local area Network, Wide Area
Networks, Metropolitan Networks, Campus/ Corporate Area Network, Personal Area Network, Network
Devices- Hub, Repeater, Switch, Bridge, Router, Gateway, Network interface Card, Basic Networking
Commands.
TASK 7: Orientation & Connectivity Boot Camp: Students should get connected to their Local Area
Network and access the Internet. In the process they configure the TCP/IP setting. Finally students
should demonstrate how to access the websites and email.
TASK 8: Networking Commands:
ping, ssh, ifconfig, scp, netstat, ipstat, nslookup, traceroute, telnet, host, ftp, arp, wget,route
UNIT V
Introduction to HTML : Basics in Web Design, Brief History of Internet ,World Wide Web Why create a
web site ,Web Standards, HTML Documents ,Basic structure of an HTML document Creating an HTML
document ,Mark up Tags ,Heading-Paragraphs ,Line Breaks ,HTML Tags.
Elements of HTML: Introduction to elements of HTML, Working with Text, Working with Lists, Tables
and Frames, Working with Hyperlinks, Images and Multimedia ,Working with Forms and controls.
TASK 9: Basic HTML tags

1.Head Section and Elements of Head Section, Paragraphs, Formatting Styles.
2. Colour tags, Creating Hyperlinks, Images, Tables, lists
3. HTML Forms, Form Attributes, Form Elements.
TASK 10: Web Browsers, Surfing the Web: Students customize their web browsers with the LAN proxy
settings, bookmarks, search toolbars and pop up blockers. Also, plug-ins like Macromedia Flash and JRE for
applets should be configured. Search Engines & Netiquette: Students should know what search engines are
and how to use the search engines. Usage of search engines like Google, Yahoo, ask.com and others should
be demonstrated by student.
TASK 11: Cyber Hygiene: Students should learn about viruses on the internet and install antivirus
software. Student should learn to customize the browsers to block pop ups, block active x downloads to
avoid viruses and/or worms.

Text Books:
1. Fundamentals of Computers –ReemaThareja-Oxford higher education
2. Computer Fundamentals, Anita Goel, Pearson Education, 2017
3. PC Hardware Trouble Shooting Made Easy, TMH
4. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson, 2013.
Reference Books:
1) An Introduction to Web Design, Programming, 1st Edition, Paul S Wang, Sanda S Katila, Cengage
Learning, 2003.
2) An Introduction to Computer studies –Noel Kalicharan-Cambridge

L T P C
I Year - I Semester
3 0 0 3
PROGRAMMING FOR PROBLEM SOLVING USING C (ES1102)
Course Objectives
The objectives of Programming for Problem Solving Using C are
1) To learn about the computer systems, computing environments, developing of a computer program
and Structure of a C Program
2) To gain knowledge of the operators, selection, control statements and repetition in C
3) To learn about the design concepts of arrays, strings, enumerated structure and union types. To
learn about their usage.
4) To assimilate about pointers, dynamic memory allocation and know the significance of
Preprocessor.
5) To assimilate about File I/O and significance of functions
UNIT I
Introduction to Computers: Creating and running Programs, Computer Numbering System, Storing
Integers, Storing Real Numbers
Introduction to the C Language: Background, C Programs, Identifiers, Types, Variable, Constants,
Input/output, Programming Examples, Scope, Storage Classes and Type Qualifiers.
Structure of a C Program: Expressions Precedence and Associativity, Side Effects, Evaluating
Expressions, Type Conversion Statements, Simple Programs, Command Line Arguments.
UNIT II
Bitwise Operators: Exact Size Integer Types, Logical Bitwise Operators, Shift Operators.
Selection & Making Decisions: Logical Data and Operators, Two Way Selection, Multiway Selection,
More Standard Functions
Repetition: Concept of Loop, Pretest and Post-test Loops, Initialization and Updating, Event and Counter
Controlled Loops, Loops in C, Other Statements Related to Looping, Looping Applications, Programming
Examples
UNIT III
Arrays: Concepts, Using Array in C, Array Application, Two Dimensional Arrays, Multidimensional
Arrays, Programming Example – Calculate Averages
Strings: String Concepts, C String, String Input / Output Functions, Arrays of Strings, String
Manipulation Functions String/ Data Conversion, A Programming Example – Morse Code Enumerated,
Structure, and Union: The Type Definition (Type def), Enumerated Types, Structure, Unions, and
Programming Application
UNIT IV
Pointers: Introduction, Pointers to pointers, Compatibility, L value and R value
Pointer Applications: Arrays, and Pointers, Pointer Arithmetic and Arrays, Memory Allocation Function,
Array of Pointers, Programming Application
Processor Commands: Processor Commands

UNIT V
Functions: Designing, Structured Programs, Function in C, User Defined Functions, Inter-Function
Communication, Standard Functions, Passing Array to Functions, Passing Pointers to Functions, Recursion
Text Input / Output: Files, Streams, Standard Library Input / Output Functions, Formatting Input / Output
Functions, Character Input / Output Functions
Binary Input / Output: Text versus Binary Streams, Standard Library, Functions for Files, Converting File
Type.
COURSE OUTCOMES:
Upon the completion of the course the student will learn
1) To write algorithms and to draw flowcharts for solving problems

2) To convert flowcharts/algorithms to C Programs, compile and debug programs
3) To use different operators, data types and write programs that use two-way/ multi-way selection
4) To select the best loop construct for a given problem
5) To design and implement programs to analyze the different pointer applications
6) To decompose a problem into functions and to develop modular reusable code
To apply File I/O operations
TEXT BOOKS:
1. Programming for Problem Solving, Behrouz A. Forouzan, Richard F.Gilberg, CENGAGE
2. The C Programming Language, Brian W.Kernighan, Dennis M. Ritchie, 2e, Pearson
REFERENCES:
1. Computer Fundamentals and Programming, Sumithabha Das, Mc Graw Hill
2. Programming in C, Ashok N. Kamthane, Amit Kamthane, Pearson
3. Computer Fundamentals and Programming in C, PradipDey, Manas Ghosh, OXFORD

L T P C
I Year - I Semester
0 0 3 1.5
ENGLISH COMMUNICATION SKILLS LABORATORY (HS1102)
TOPICS
UNIT I:
Vowels, Consonants, Pronunciation, Phonetic Transcription, Common Errors in Pronunciation,
UNIT II:
Word stress-di-syllabic words, poly-syllabic words, weak and strong forms, contrastive stress
(Homographs)
UNIT III:
Stress in compound words,rhythm, intonation,accent neutralisation.
UNIT IV:
Listening to short audio texts and identifying the context and specific pieces of information toanswer a
series of questions in speaking.
UNIT V:
Newspapers reading;Understanding and identifying key terms and structures useful for writing reports.
Prescribed text book: “Infotech English”, Maruthi Publications.
References:
1. Exercises in Spoken English Part 1,2,3,4, OUP and CIEFL.
2. English Pronunciation in use- Mark Hancock, Cambridge University Press.
3. English Phonetics and Phonology-Peter Roach, Cambridge University Press.
4. English Pronunciation in use- Mark Hewings, Cambridge University Press.
5. English Pronunciation Dictionary- Daniel Jones, Cambridge University Press.
6. English Phonetics for Indian Students- P. Bala Subramanian, Mac Millan Publications.

L T P C
I Year - I Semester
0 0 3 1.5
APPLIED PHYSIC LAB (BS1105)
(For All Circuital Branches like CSE, ECE, EEE etc.)

(Any 10 of the following listed experiments)
List of Applied Physics Experiments
1. Determination of thickness of thin object by wedge method.

2. Determination of radius of curvature of a given plano convex lens by Newton’s rings.
3. Determination of wavelengths of different spectral lines in mercury spectrum using
diffraction grating in normal incidence configuration.
4. Determination of dispersive power of the prism.
5. Determination of dielectric constant using charging and discharging method.
6. Study the variation of B versus H by magnetizing the magnetic material (B-H curve).
7. Determination of numerical aperture and acceptance angle of an optical fiber.
8. Determination of wavelength of Laser light using diffraction grating.
9. Estimation of Planck’s constant using photoelectric effect.
10. Determination of the resistivity of semiconductor by four probe method.
11. To determine the energy gap of a semiconductor using p-n junction diode.
12. Magnetic field along the axis of a current carrying circular coil by Stewart & Gee’s
Method
13. Determination of Hall voltage and Hall coefficient of a given semiconductor using Hall
Effect .
14. Measurement of resistance of a semiconductor with varying temperature.
15. Resistivity of a Superconductor using four probe method & Meissner effect.
References:
1. S. Balasubramanian, M.N. Srinivasan “A Text Book of Practical Physics”- S Chand
Publishers, 2017.

L T P C
I Year - I Semester
0 0 3 1.5
PROGRAMMING FOR PROBLEM SOLVING USING C LAB (ES1103)
Course Objectives:
Apply the principles of C language in problem solving.
To design flowcharts, algorithms and knowing how to debug programs.
To design & develop of C programs using arrays, strings pointers & functions.
To review the file operations, preprocessor commands.
Course Outcomes:
By the end of the Lab, the student
Gains Knowledge on various concepts of a C language.
Able to draw flowcharts and write algorithms.
Able design and development of C problem solving skills.
Able to design and develop modular programming skills.
Able to trace and debug a program
Exercise 1:
1. Write a C program to print a block F using hash (#), where the F has a height of six characters and
width of five and four characters.
2. Write a C program to compute the perimeter and area of a rectangle with a height of 7 inches and
width of 5 inches.
3. Write a C program to display multiple variables.
Exercise 2:
1. Write a C program to calculate the distance between the two points.
2. Write a C program that accepts 4 integers p, q, r, s from the user where r and s are positive and p is
even. If q is greater than r and s is greater than p and if the sum of r and s is greater than the sum of p
and q print "Correct values", otherwise print "Wrong values".
Exercise 3:
1. Write a C program to convert a string to a long integer.
2. Write a program in C which is a Menu-Driven Program to compute the area of the various
geometrical shape.
3. Write a C program to calculate the factorial of a given number.
Exercise 4:
1. Write a program in C to display the n terms of even natural number and their sum.
2. Write a program in C to display the n terms of harmonic series and their sum.
1 + 1/2 + 1/3 + 1/4 + 1/5 ... 1/n terms.
3. Write a C program to check whether a given number is an Armstrong number or not.
Exercise 5:
1. Write a program in C to print all unique elements in an array.
2. Write a program in C to separate odd and even integers in separate arrays.
3. Write a program in C to sort elements of array in ascending order.

Exercise 6:
1. Write a program in C for multiplication of two square Matrices.
2. Write a program in C to find transpose of a given matrix.
Exercise 7:
1. Write a program in C to search an element in a row wise and column wise sorted matrix.
2. Write a program in C to print individual characters of string in reverse order.
Exercise 8:
1. Write a program in C to compare two strings without using string library functions.
2. Write a program in C to copy one string to another string.
Exercise 9:
1. Write a C Program to Store Information Using Structures with Dynamically Memory Allocation
2. Write a program in C to demonstrate how to handle the pointers in the program.
Exercise 10:
1. Write a program in C to demonstrate the use of & (address of) and *(value at address) operator.
2. Write a program in C to add two numbers using pointers.
Exercise 11:
1. Write a program in C to add numbers using call by reference.
2. Write a program in C to find the largest element using Dynamic Memory Allocation.
Exercise 12:
1. Write a program in C to swap elements using call by reference.
2. Write a program in C to count the number of vowels and consonants in a string using a pointer.
Exercise 13:
1. Write a program in C to show how a function returning pointer.
2. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using malloc( ) function.
Exercise 14:
1. Write a C program to find sum of n elements entered by user. To perform this program, allocate
memory dynamically using calloc( ) function. Understand the difference between the above two
programs
2. Write a program in C to convert decimal number to binary number using the function.
Exercise 15:
1. Write a program in C to check whether a number is a prime number or not using the function.
2. Write a program in C to get the largest element of an array using the function.
Exercise 16:
1. Write a program in C to append multiple lines at the end of a text file.
2. Write a program in C to copy a file in another name.
3. Write a program in C to remove a file from the disk.

L T P C
I Year - II Semester
3 0 0 3
MATHEMATICS - II (BS1202)
Course Objectives
To instruct the concept of Matrices in solving linear algebraic equations

To elucidate the different numerical methods to solve nonlinear algebraic equations
To disseminate the use of different numerical techniques for carrying out numerical integration.
To equip the students with standard concepts and tools at an intermediate to advanced level
mathematics to develop the confidence and ability among the students to handle various real
world problems and their applications.
Course Outcomes: At the end of the course, the student will be able to
 Develop the use of matrix algebra techniques that is needed by engineers for practical
applications (L6)
 Solve system of linear algebraic equations using Gauss elimination, Gauss Jordan, Gauss
Seidel (L3)
 Evaluate approximating the roots of polynomial and transcendental equations by different
algorithms (L5)
 Apply Newton’s forward & backward interpolation and Lagrange’s formulae for equal and
unequal intervals (L3)
 Apply different algorithms for approximating the solutions of ordinary differential
equations to its analytical computations (L3)
Unit I: Solving systems of linear equations, Eigen values and Eigen vectors:(10 hrs)
Rank of a matrix by echelon form and normal form – Solving system of homogeneous and non-
homogeneous equations linear equations – Gauss Elimination for solving system of equations – Eigen
values and Eigen vectors and their properties.
Unit-II: Cayley-Hamilton theorem and Quadratic forms: (10 hrs)

Cayley- Hamilton theorem (without proof) – Finding inverse and power of a matrix by Cayley-Hamilton
theorem – Reduction to Diagonal form – Quadratic forms and nature of the quadratic forms –Reduction of
quadratic form to canonical forms by orthogonal transformation.
Singular values of a matrix, singular value decomposition (Ref. Book – 1).
UNIT III: Iterative methods: (8 hrs)

Introduction – Bisection method – Secant method – Method of false position – Iteration method – Newton-
Raphson method (One variable and simultaneous Equations) – Jacobi and Gauss-Seidel methods for solving
system of equations.
UNIT IV: Interpolation: (10 hrs)

Introduction – Errors in polynomial interpolation – Finite differences – Forward differences – Backward
differences – Central differences – Relations between operators – Newton’s forward and backward formulae
for interpolation – Interpolation with unequal intervals – Lagrange’s interpolation formula – Newton’s
divide difference formula.

UNIT V: Numerical integration and solution of ordinary differential equations: (10 hrs)
Trapezoidal rule – Simpson’s 1/3rd and 3/8th rule – Solution of ordinary differential equations by Taylor’s
series – Picard’s method of successive approximations – Euler’s method – Runge-Kutta method (second and
fourth order).
Text Books:
1. B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, Khanna Publishers.
2. B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. Graw Hill Education.
Reference Books:
1. David Poole, Linear Algebra- A modern introduction, 4th Edition, Cengage.
2. Steven C. Chapra, Applied Numerical Methods with MATLAB for Engineering and Science, Tata
Mc. Graw Hill Education.
3. M. K. Jain, S. R. K. Iyengar and R. K. Jain, Numerical Methods for Scientific and Engineering
Computation, New Age International Publications.
4. Lawrence Turyn, Advanced Engineering Mathematics, CRC Press.

L T P C
3 0 0 3
APPLIED CHEMISTRY (BS1206)
Knowledge of basic concepts of Chemistry for Engineering students will help them as professional
engineers later in design and material selection, as well as utilizing the available resources.
COURSE OBJECTIVES
 Importance of usage of plastics in household appliances and composites (FRP) in aerospace and
automotive industries.
 Outline the basics for the construction of electrochemical cells, batteries and fuel cells. Understand
the mechanism of corrosion and how it can be prevented.
 Explain the preparation of semiconductors and nanomaterials, engineering applications of
nanomaterials, superconductors and liquid crystals.
 Recall the increase in demand for power and hence alternative sources of power are studied due to
depleting sources of fossil fuels. Advanced instrumental techniques are introduced.
 Outline the basics of computational chemistry and molecular switches
UNIT I: POLYMER TECHNOLOGY 8 hrs

Polymerisation:- Introduction, methods of polymerization (emulsion and suspension), mechanical
properties.
Plastics: Compounding, fabrication (compression, injection, blown film and extrusion), preparation,
properties and applications (PVC, polycarbonates and Bakelite), mention some examples of plastic materials
used in electronic gadgets, recycling of e-plastic waste (waste to wealth).
Elastomers:- Introduction, preparation, properties and applications (Buna S, thiokol and polyurethanes).
Composite materials: Fiber reinforced plastics, conducting polymers, biodegradable polymers, biopolymers,
biomedical polymers.
Course Outcomes: At the end of this unit, the students will be able to
 Analyze the different types of composite plastic materials and interpret the mechanism of
conduction in conducting polymers.
UNIT II: ELECTROCHEMICAL CELLS AND CORROSION 10 hrs

Single electrode potential, electrochemical series and uses of series, standard hydrogen electrode, calomel
electrode, construction of glass electrode, batteries (Dry cell, Li ion battery and zinc air cells), fuel cells (H 2-
O2, CH3OH-O2, phosphoric acid and molten carbonate).
Corrosion:-Definition, theories of corrosion (chemical and electrochemical), galvanic corrosion, differential
aeration corrosion, stress corrosion, galvanic series, factors influencing rate of corrosion, corrosion control
(proper designing and cathodic protection), Protective coatings (surface preparation, cathodic coatings,
anodic coatings, electroplating and electroless plating [nickel]), Paints (constituents, functions and special
paints).
 Utilize the theory of construction of electrodes, batteries and fuel cells in redesigning new
engineering products and categorize the reasons for corrosion and study methods to control
corrosion.
UNIT III: MATERIAL CHEMISTRY 10 hrs

Part I: Non-elemental semiconducting materials:- Stoichiometric, controlled valency & chalcogen
photo/semiconductors-preparation of semiconductors (distillation, zone refining, Czochralski crystal pulling,
epitaxy, diffusion, ion implantation) - Semiconductor devices (p-n junction diode as rectifier, junction

transistor).
Insulators & magnetic materials: electrical insulators-ferro and ferri magnetism-Hall effect and its
applications.
Part II:
Nano materials:- Introduction, sol-gel method, characterization by (Brunauer Emmet Teller [BET]),
(scanning electron microscopy [SEM]) and (transmission electron microscopy [TEM]), applications of
graphene and fullerenes, carbon nanotubes (types, preparation and applications)
Liquid crystals:- Introduction-types-applications.
Super conductors:-Type –I, Type II-characteristics and applications
 Synthesize nanomaterials for modern advances of engineering technology.
 Summarize the preparation of semiconductors; analyze the applications of liquid crystals and
superconductors.
UNIT IV: SPECTROSCOPIC TECHNIQUES & NON-CONVENTIONAL ENERGY SOURCES

10 hrs
Part A: SPECTROSCOPIC TECHNIQUES
Electromagnetic spectrum-UV (laws of absorption, instrumentation, theory of electronic spectroscopy,
Frank-condon principle, chromophores and auxochromes, intensity shifts, applications), FT-IR
[instrumentation and differentiation of sp, sp2, sp3 and IR stretching of functional groups (alcohols,
carbonyls, amines) applications], magnetic resonance imaging and CT scan (procedure & applications).
Part B: NON-CONVENTIONAL ENERGY SOURCES
Design, working, schematic diagram, advantages and disadvantages of photovoltaic cell, hydropower,
geothermal power, tidal and wave power, ocean thermal energy conversion.
 Analyze the principles of different analytical instruments and their applications.
 Design models for energy by different natural sources.
UNIT V: ADVANCED CONCEPTS/TOPICS IN CHEMISTRY 8 hrs

Computational chemistry: Introduction to computational chemistry, molecular modelling and docking
studies
Molecular switches: characteristics of molecular motors and machines, Rotaxanes and Catenanes as
artificial molecular machines, prototypes – linear motions in rotaxanes, an acid-base controlled molecular
shuttle, a molecular elevator, an autonomous light-powered molecular motor
 Obtain the knowledge of computational chemistry and molecular machines
Standard Books:
1. P.C. Jain and M. Jain “Engineering Chemistry”, 15/e, Dhanpat Rai & Sons, Delhi, (Latest edition).
2. Shikha Agarwal, “Engineering Chemistry”, Cambridge University Press, New Delhi, (2019).
3. S.S. Dara, “A Textbook of Engineering Chemistry”, S.Chand & Co, (2010).
4. Shashi Chawla, “Engineering Chemistry”, Dhanpat Rai Publicating Co. (Latest edition).
Reference:
1. K. Sesha Maheshwaramma and Mridula Chugh, “Engineering Chemistry”, Pearson India Edn.
2. O.G. Palana, “Engineering Chemistry”, Tata McGraw Hill Education Private Limited, (2009).
3. CNR Rao and JM Honig (Eds) “Preparation and characterization of materials” Academic press,
New York (latest edition)
4. B. S. Murthy, P. Shankar and others, “Textbook of Nanoscience and Nanotechnology”, University
press (latest edition)

L T P C
I Year – II Semester
3 0 0 3
PROBLEM SOLVING USING PYTHON (ES1204)
Course Objectives:
The Objectives of Python Programming are
To learn about Python programming language syntax, semantics, and the runtime environment
To be familiarized with universal computer programming concepts like data types, containers
To be familiarized with general computer programming concepts like conditional execution, loops &
functions
To be familiarized with general coding techniques and object-oriented programming
Course Outcomes:
Develop essential programming skills in computer programming concepts like data types, containers
Apply the basics of programming in the Python language
Solve coding tasks related conditional execution, loops
Solve coding tasks related to the fundamental notions and techniques used in object-oriented
programming
UNIT I
Introduction: Introduction to Python, Program Development Cycle, Input, Processing, and Output,
Displaying Output with the Print Function, Comments, Variables, Reading Input from the Keyboard,
Performing Calculations, Operators. Type conversions, Expressions, More about Data Output.
Data Types, and Expression: Strings Assignment, and Comment, Numeric Data Types and Character Sets,
Using functions and Modules.
Decision Structures and Boolean Logic: if, if-else, if-elif-else Statements, Nested Decision Structures,
Comparing Strings, Logical Operators, Boolean Variables. Repetition Structures: Introduction, while loop,
for loop, Calculating a Running Total, Input Validation Loops, Nested Loops.
UNIT II
Control Statement: Definite iteration for Loop Formatting Text for output, Selection if and if else Statement
Conditional Iteration The While Loop
Strings and Text Files: Accessing Character and Substring in Strings, Data Encryption, Strings and Number
Systems, String Methods Text Files.
UNIT III
List and Dictionaries: Lists, Defining Simple Functions, Dictionaries
Design with Function: Functions as Abstraction Mechanisms, Problem Solving with Top Down Design,
Design with Recursive Functions, Case Study Gathering Information from a File System, Managing a
Program’s Namespace, Higher Order Function.
Modules: Modules, Standard Modules, Packages.
UNIT IV
File Operations: Reading config files in python, Writing log files in python, Understanding read functions,
read(), readline() and readlines(), Understanding write functions, write() and writelines(), Manipulating file
pointer using seek, Programming using file operations
Object Oriented Programming: Concept of class, object and instances, Constructor, class attributes and
destructors, Real time use of class in live projects, Inheritance , overlapping and overloading operators,

Adding and retrieving dynamic attributes of classes, Programming using Oops support
Design with Classes: Objects and Classes, Data modeling Examples, Case Study An ATM, Structuring
Classes with Inheritance and Polymorphism
UNIT V
Errors and Exceptions: Syntax Errors, Exceptions, Handling Exceptions, Raising Exceptions, User-defined
Exceptions, Defining Clean-up Actions, Redefined Clean-up Actions.
Graphical User Interfaces: The Behavior of Terminal Based Programs and GUI -Based, Programs, Coding
Simple GUI-Based Programs, Other Useful GUI Resources.
Programming: Introduction to Programming Concepts with Scratch.
Text Books
1) Fundamentals of Python First Programs, Kenneth. A. Lambert, Cengage.
2) Python Programming: A Modern Approach, VamsiKurama, Pearson.
Reference Books:
1) Introduction to Python Programming, Gowrishankar.S, Veena A, CRC Press.
2) Introduction to Programming Using Python, Y. Daniel Liang, Pearson.
e-Resources:
1) https://www.tutorialspoint.com/python3/python_tutorial.pdf

L T P C
3 0 0 3
BASIC ELECTRICAL & ELETRONICS ENGINEERING (ES1205)
This course introduces the student, the fundamentals of electrical engineering concepts needed for
future courses to be learned. The first three units cover the electric circuit laws, theorems and electrical
machines. The next two units cover the principles of Electro static and electromechanical conversions,
measurement of electrical quantities, electrical safety and batteries.
Course Objectives:
 Study the basic DC and AC networks used in electrical circuits.
 Study the basic concepts of electrical engineering.
 Demonstrate the concepts of electrical wiring and safety.
• To understand the principle of operation and construction details of DC machines & Transformers.
• To understand the principle of operation and construction details of alternator and 3-Phase Inductionmotor.
UNIT I
Introduction: Concept of Potential difference, voltage, current, Fundamental linear passive and active
elements to their functional current-voltage relation, voltage source and current sources, ideal and practical
sources, concept of dependent and independent sources, Kirchhoff-s laws and applications to network
solutions using mesh and nodal analysis, Concept of work, power and energy.
Series – Parallel Circuits – Inductive & Capacitive networks.
UNIT II
DC Circuits: Current-voltage relations of the electric network by mathematical equations to analyze the
network (Thevenin’s theorem, Norton's Theorem, Maximum Power Transfer theorem), Superposition
theorem. Simplifications of networks using series-parallel, Star/Delta transformation.
AC Circuits: AC waveform definitions, form factor, peak factor, study of R-L, R-C, RLC series circuit,
phasor representation in polar and rectangular form, concept of impedance, admittance, active, reactive,
apparent and complex power, power factor.
UNIT III
Dc Machines:
Principle of operation of DC generator – EMF equation - Types of DC machine – Torque equation –
Applications.
Transformers:
Principle of operation and construction of single phase transformers – EMF equation – Losses.
UNIT IV
AC Rotating Machines:
Principle of operation and construction of alternators– Types of alternators – Principle of operation
ofsynchronous motor - Principle of operation of 3-Phase induction motor – Slip-torque characteristics -
Efficiency –Applications

Unit V
Rectifiers & Linear ICs:
PN junction diodes - Diode applications(Half wave and bridge rectifiers).Characteristics of operation
amplifiers(OP-AMP) - application of OP-AMPs (inverting, non-inverting, integrator and differentiator).
Transistors:PNP and NPN junction transistor, transistor as an amplifier- Transistor amplifier - Frequency
response of CEamplifier - Concepts of feedback amplifier.
Text Book(s)
1. B. L. Theraja, A Textbook of Electrical Technology, (vol. I), 1/e, Chand and Company Ltd., New Delhi,
2005.
2. V. K. Mehta, Basic Electrical Engineering, 6/e, S. Chand and Company Ltd., New Delhi, 2012.
3. J. Nagrath and Kothari, Theory and problems of Basic Electrical Engineering, 2/e, Prentice Hall of India
Pvt. Ltd., 2017.
4. Electrical Technology by Surinder Pal Bali, Pearson Publications.
5. Electronic Devices and Circuits, R.L. Boylestad and Louis Nashelsky, 9th edition, PEI/PHI
2006.
References
1. T. K. Nagsarkar and M. S. Sukhija, Basic of Electrical Engineering, 2/e, Oxford University Press, 2011.
2. Smarjith Ghosh, Fundamentals of Electrical and Electronics Engineering, 1/e, Prentice Hall (India) Pvt.
Ltd., 2004.
3. Electrical Circuit Theory and Technology by John Bird, Routledge Taylor &Francis Group
4. Basic Electrical Engineering by M.S.Naidu and S.Kamakshiah,TMH Publications
5. Basic Electrical Engineering by Nagsarkar,Sukhija, Oxford Publications,2nd edition
6. Industrial Electronics by G.K. Mittal, PHI

L T P C
3 0 0 3
DIGITAL LOGIC DESIGN (ES1206)
Course Objective
 To study the basic philosophy underlying the various number systems, negative number
representation, binary arithmetic, theory of Boolean algebra and map method for minimization
of switching functions.
 To introduce the basic tools for design of combinational and sequential digital logic.
 To learn simple digital circuits in preparation for computer engineering.
UNIT- I: Digital Systems and Binary Numbers

Digital Systems, Binary Numbers, Octal and Hexadecimal Numbers, Complements of Numbers, Signed
Binary Numbers, Arithmetic addition and subtraction, 4-bit codes: BCD, EXCESS 3, alphanumeric
codes, 9’s complement, 2421, etc..
UNIT -II: Concept of Boolean algebra

Basic Theorems and Properties of Boolean algebra, Boolean Functions, Canonical and Standard Forms,
Minterms and Maxterms.
Gate level Minimization
Map Method, Three-Variable K-Map, Four Variable K-Maps. Products of Sum Simplification, Sum of
Products Simplification, Don’t – Care Conditions, NAND and NOR Implementation, Exclusive‐OR
Function.
UNIT- III:Combinational Logic

Introduction, Analysis Procedure, Binary Adder–Subtractor, Binary Multiplier, Decoders, Encoders,
Multiplexers, Demultiplexers, Priority Encoder, Code Converters, Magnitude Comparator, HDL Models
of Combinational Circuits.
Realization of Switching Functions Using PROM, PAL and PLA.
UNIT- IV: Synchronous Sequential Logic

Introduction to Sequential Circuits, Storage Elements: Latches, Flip‐Flops, RS- Latch Using NAND and
NOR Gates, Truth Tables. RS, JK, T and D Flip Flops, Truth and Excitation Tables, Conversion of Flip
Flops.
UNIT -V: Registers and Counters

Registers, Shift Registers, Ripple Counters, Synchronous Counters, Ring Counter, Johnson Counter.
OUTCOMES:
A student who successfully fulfills the course requirements will have demonstrated:
An ability to define different number systems, binary addition and subtraction, 2’s
complement representation and operations with this representation.
An ability to understand the different switching algebra theorems and apply them forlogic
functions.
An ability to define the Karnaugh map for a few variables and perform an
algorithmic reduction of logic functions.
Students will be able to design various logic gates starting from simple ordinary gates
to complex programmable logic devices & arrays.

Students will be able to design various sequential circuits starting from flip-flop to
registers and counters.
TEXT BOOKS:
1. Digital Design, 5/e, M.Morris Mano, Michael D Ciletti, PEA.
2. Fundamentals of Logic Design, 5/e, Roth, Cengage.
REFERENCE BOOKS:
1. Digital Logic and Computer Design, M.Morris Mano, PEA.
2. Digital Logic Design, Leach, Malvino, Saha, TMH.
3. Modern Digital Electronics, R.P. Jain, TMH.

L T P C
0 0 3 1.5
PROBLEM SOLVING USING PYTHON LAB (ES1207)
Course Objectives:
The aim of Python Programming Lab is
To acquire programming skills in core Python.
To acquire Object Oriented Skills in Python
To develop the skill of designing Graphical user Interfaces in Python
To develop the ability to write database applications in Python
Course Outcomes:
By the end of this lab, the student is able to
Write, Test and Debug Python Programs
Use Conditionals and Loops for Python Programs
Use functions and represent Compound data using Lists, Tuples and Dictionaries
Use various applications using python
1) Write a program that asks the user for a weight in kilograms and converts it to pounds. There are 2.2
pounds in a kilogram.
2) Write a program that asks the user to enter three numbers (use three separate input statements).
Create variables called total and average that hold the sum and average of the three numbers and
print out the values of total and average.
3) Write a program that uses a for loop to print the numbers 8, 11, 14, 17, 20, . . . , 83, 86, 89.
4) Write a program that asks the user for their name and how many times to print it. The program
should print out the user’s name the specified number of times.
5) Use a for loop to print a triangle like the one below. Allow the user to specify how high the triangle
should be.
*
**
***
****
6) Generate a random number between 1 and 10. Ask the user to guess the number and print a message
based on whether they get it right or not.
7) Write a program that asks the user for two numbers and prints Close if the numbers are within .001
of each other and Not close otherwise.
8) Write a program that asks the user to enter a word and prints out whether that word contains any
vowels.
9) Write a program that asks the user to enter two strings of the same length. The program should then
check to see if the strings are of the same length. If they are not, the program should print an
appropriate message and exit. If they are of the same length, the program should alternate the
characters of the two strings. For example, if the user enters abcde and ABCDE the program should
print out AaBbCcDdEe.
10) Write a program that asks the user for a large integer and inserts commas into it according to the
standard American convention for commas in large numbers. For instance, if the user enters
1000000, the output should be 1,000,000.

11) In algebraic expressions, the symbol for multiplication is often left out, as in 3x+4y or 3(x+5).
Computers prefer those expressions to include the multiplication symbol, like 3*x+4*y or 3*(x+5).
Write a program that asks the user for an algebraic expression and then inserts multiplication
symbols where appropriate.
12) Write a program that generates a list of 20 random numbers between 1 and 100.
Print the list.
Print the average of the elements in the list.
Print the largest and smallest values in the list.
Print the second largest and second smallest entries in the list
Print how many even numbers are in the list.
13) Write a program that asks the user for an integer and creates a list that consists of the factors of that
integer.
14) Write a program that generates 100 random integers that are either 0 or 1. Then find the longest run
of zeros, the largest number of zeros in a row. For instance, the longest run of zeros in
[1,0,1,1,0,0,0,0,1,0,0] is 4.
15) Write a program that removes any repeated items from a list so that each item appears at most once.
For instance, the list [1,1,2,3,4,3,0,0] would become [1,2,3,4,0].
16) Write a program that asks the user to enter a length in feet. The program should then give the user
the option to convert from feet into inches, yards, miles, millimeters, centimeters, meters, or
kilometers. Say if the user enters a 1, then the program converts to inches, if they enter a 2, then the
program converts to yards, etc. While this can be done with if statements,it is much shorter with lists
and it is also easier to add new conversions if you use lists.
17) Write a function called sum_digits that is given an integer num and returns the sum of the digits of
num.
18) Write a function called first_diff that is given two strings and returns the first location in which the
strings differ. If the strings are identical, it should return -1.
19) Write a function called number_of_factors that takes an integer and returns how many factors the
number has.
20) Write a function called is_sorted that is given a list and returns True if the list is sorted and False
otherwise.
21) Write a function called root that is given a number x and an integer n and returns x1/n. In the function
definition, set the default value of n to 2.
22) Write a function called primes that is given a number n and returns a list of the first n primes. Let the
default value of n be 100.
23) Write a function called merge that takes two already sorted lists of possibly different lengths, and
merges them into a single sorted list.
Do this using the sort method. (b) Do this without using the sort method.
24) Write a program that asks the user for a word and finds all the smaller words that can be made from
the letters of that word. The number of occurrences of a letter in a smaller word can’t exceed the
number of occurrences of the letter in the user’s word.
25) Write a program that reads a file consisting of email addresses, each on its own line. Your program
should print out a string consisting of those email addresses separated by semicolons.
26) Write a program that reads a list of temperatures from a file called temps.txt, converts those
temperatures to Fahrenheit, and writes the results to a file called ftemps.txt.

27) Write a class called Product. The class should have fields called name, amount, and price, holding
the product’s name, the number of items of that product in stock, and the regular price of the
product. There should be a method get_price that receives the number of items to be bought and
returns a the cost of buying that many items, where the regular price is charged for orders of less
than 10 items, a 10% discount is applied for orders of between 10 and 99 items, and a 20% discount
is applied for orders of 100 or more items. There should also be a method called make_purchase that
receives the number of items to be bought and decreases amount by that much.
28) Write a class called Time whose only field is a time in seconds. It should have a method called
convert_to_minutes that returns a string of minutes and seconds formatted as in the following
example: if seconds is 230, the method should return '5:50'. It should also have a method called
convert_to_hours that returns a string of hours, minutes, and seconds formatted analogously to the
previous method.
29) Write a class called Converter. The user will pass a length and a unit when declaring an object from
the class—for example, c = Converter(9,'inches'). The possible units are inches, feet, yards, miles,
kilometers, meters, centimeters, and millimeters. For each of these units there should be a method
that returns the length converted into those units. For example, using the Converter object created
above, the user could call c.feet() and should get 0.75 as the result.
30) Write a Python class to implement pow(x, n).
31) Write a Python class to reverse a string word by word.
32) Write a program that opens a file dialog that allows you to select a text file. The program then
displays the contents of the file in a textbox.
33) Write a program to demonstrate Try/except/else.
34) Write a program to demonstrate try/finally and with/as.

L T P C
0 0 3 1.5
APPLIED CHEMISTRY LAB (BS1207)
Introduction to Chemistry laboratory – Molarity, normality, primary, secondary standard solutions,

volumetric titrations, quantitative analysis
Determination of HCl using standard Na2CO3 solution.
1. Determination of alkalinity of a sample containing Na2CO3 and NaOH.

2. Determination of Mn+2 using standard oxalic acid solution.
3. Determination of ferrous iron using standard K2Cr2O7 solution.
4. Determination of Cu+2 using standard hypo solution.
5. Determination of temporary and permanent hardness of water using standard EDTA solution.
6. Determination of Fe+3 by a colorimetric method.
7. Determination of the concentration of acetic acid using sodium hydroxide (pH-metry method).
8. Determination of iso-electric point of amino acids using pH-metry method/conductometric method.
9. Determination of the concentration of strong acid vs strong base (by conductometric method).
10. Determination of strong acid vs strong base (by potentiometric method).
11. Determination of Mg+2 present in an antacid.
12. Determination of CaCO3 present in an egg shell.
13. Estimation of Vitamin C.
14. Determination of phosphoric content in soft drinks.
15. Adsorption of acetic acid by charcoal.
16. Preparation of nylon-6, 6 and Bakelite (demonstration only).
Of the above experiments at-least 10 assessment experiments should be completed in a semester.
Outcomes: The students entering into the professional course have practically very little exposure to lab
classes. The experiments introduce volumetric analysis; redox titrations with different indicators; EDTA
titrations; then they are exposed to a few instrumental methods of chemical analysis. Thus at the end of the
lab course, the student is exposed to different methods of chemical analysis and use of some commonly
employed instruments. They thus acquire some experimental skills.
Reference Books
1. A Textbook of Quantitative Analysis, Arthur J. Vogel.

L T P C
1 0 4 1.5
DIGITAL LOGIC DESIGN LAB (ES1208)
COURSE OBJECTIVES:
The objectives of this course are to:

 Introduce the concept of digital and binary systems.
 To know the concepts of Combinational circuits.
 Be able to design and analyze Sequential logic circuits.
 To understand the concepts of flip-flops, registers and counters.
 Students will learn and understand the basics of logic gates and circuits.
COURSE OUTCOMES:
 A student who successfully fulfils the course requirements will have demonstrated:
 CO1: To learn about the basics of gates.
 CO2: To understand, analyse and design the basic digital circuits and any digital design in real
 time applications.
 CO3: Construct basic combinational circuits and verify their functionalities.
 CO4: Apply the design procedures to design basic sequential circuits.
 CO5: An ability to measure and record the experimental data, analyse the results, and prepare
a formal laboratory report.
List of Experiments:
1. Verification of Basic Logic Gates.
2. Implementing all individual gates with Universal Gates NAND & NOR.
3. Design a circuit for the given Canonical form, draw the circuit diagram and verify the De-
Morgan laws.
4. Design a Combinational Logic circuit for 8x1 MUX and verify the truth table.
5. Verify the data read and data write operations for the IC 74189.
6. Construct Half Adder and Full Adder using Half Adder and verify the truth table.
7. Design a 4-bit Adder/Subtractor.
8. Design and realization of 4-bit comparator.
9. Design and implement a 3 to 8 decoder using gates.
10. Design and realization of a 4-bit Gray to Binary and Binary to Gray converter.
11. Implementation of Master Slave Flip-Flop with J-K Flip- Flop and verify the truth table for
race around condition.
12. Design a Decade Counter and verify the truth table.
13. Design and implement a 4-bit shift register using Flip flops.
14. Design and Verify the 4-bit synchronous.
15. Design and verify 4-bit ripple counter (Asynchronous).

TEXT BOOKS:
1. Digital Design ,4/e, M.Morris Mano, Michael D Ciletti, PEA.
2. Fundamentals of Logic Design, 5/e, Roth, Cengage.
3. Digital Logic Design, Leach, Malvino, Saha,TMH.
REFERENCES:
1. Switching and Finite Automata Theory,3/e,Kohavi, Jha, Cambridge.
2. Verilog HDL primer, Jaya Bhaskar, PEA.
3. Modern Digital Electronics, R.P. Jain, TMH.
4. Digital Fundamentals, Thomas L. Floyd, Pearson Education, ISBN:9788131734483.

L T P C
2 0 0 0
CONSTITUTION OF INDIA (MC1203)
Course Objectives:
 To Enable the student to understand the importance of constitution
 To understand the structure of executive, legislature and judiciary
 To understand philosophy of fundamental rights and duties
 To understand the autonomous nature of constitutional bodies like Supreme Court and high
court
 Controller and auditor general of India and election commission of India.
 To understand the central and state relation financial and administrative.
UNIT-I
Introduction to Indian Constitution: Constitution meaning of the term, Indian Constitution - Sources
and constitutional history, Features - Citizenship, Preamble, Fundamental Rights and Duties,
Directive Principles of State Policy.
Learning outcomes:
After completion of this unit student will
● Understand the concept of Indian constitution
● Apply the knowledge on directive principle of state policy
● Analyze the History, features of Indian constitution
● Evaluate Preamble Fundamental Rights and Duties
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, LokSabha, RajyaSabha, The Supreme Court and High Court: Powers and Functions;
Learning outcomes:-After completion of this unit student will
● Understand the structure of Indian government
● Differentiate between the state and central government
● Explain the role of President and Prime Minister
● Know the Structure of supreme court and High court
UNIT-III
State Government and its Administration Governor - Role and Position - CM and Council of
ministers, State Secretariat: Organisation, Structure and Functions
● Understand the structure of state government
● Analyze the role Governor and Chief Minister
● Explain the role of state Secretariat
● Differentiate between structure and functions of state secretariat
UNIT-IV
A.Local Administration - District’s Administration Head - Role and Importance, Municipalities - Mayor
and role of Elected Representative - CEO of Municipal Corporation PachayatiRaj: Functions PRI:
ZilaPanchayat, Elected officials and their roles, CEO

ZilaPanchayat: Block level Organizational Hierarchy - (Different departments), Village level - Role
of Elected and Appointed officials - Importance of grass root democracy
● Understand the local Administration
● Compare and contrast district administration role and importance
● Analyze the role of Myer and elected representatives of Municipalities
● Evaluate Zillapanchayat block level organisation
UNIT-V
Election Commission: Election Commission- Role of Chief Election Commissioner and Election
Commissionerate State Election Commission:,Functions of Commissions for the welfare of SC/ST/OBC
and women
● Know the role of Election Commission apply knowledge
● Contrast and compare the role of Chief Election commissioner and Commissiononerate
● Analyze role of state election commission
● Evaluate various commissions of viz SC/ST/OBC and women
References:
1. Durga Das Basu, Introduction to the Constitution of India, Prentice – Hall of India Pvt.Ltd.. New
Delhi
2. SubashKashyap, Indian Constitution, National Book Trust
3. J.A. Siwach, Dynamics of Indian Government & Politics
4. D.C. Gupta, Indian Government and Politics
5. H.M.Sreevai, Constitutional Law of India, 4th edition in 3 volumes (Universal Law Publication)
6. J.C. Johari, Indian Government andPolitics Hans
7. J. Raj IndianGovernment and Politics
8. M.V. Pylee, Indian Constitution Durga Das Basu, Human Rights in Constitutional Law, Prentice –
Hall of India Pvt. Ltd.. New Delhi
9. Noorani, A.G., (South Asia Human Rights Documentation Centre), Challenges to Civil Right),
Challenges to Civil Rights Guarantees in India, Oxford University Press 2012
Constitution Course Outcomes:

At the end of the semester/course, the student will be able to have a clear knowledge on the following:
 Understand historical background of the constitution making and its importance for building a
democratic India.
 Understand the functioning of three wings of the government ie., executive, legislative and judiciary.
 Understand the value of the fundamental rights and duties for becoming good citizen of
 India.
 Analyze the decentralization of power between central, state and local self-government.
 Apply the knowledge in strengthening of the constitutional institutions like CAG, Election
Commission and UPSC for sustaining democracy.
1. Know the sources, features and principles of Indian Constitution.
2. Learn about Union Government, State government and its administration.
3. Get acquainted with Local administration and Pachayati Raj.
4. Be aware of basic concepts and developments of Human Rights.
5. Gain knowledge on roles and functioning of Election Commission
***

L T P C
II Year - I Semester
3 0 0 3
MATHEMATICS - III (BSC2101)
Course Objectives:
To familiarize the techniques in partial differentialequations
To furnish the learners with basic concepts and techniques at plus two level to lead them
into advanced level by handling various real worldapplications.
Course Outcomes:
At the end of the course, the student will be able to
Interpret the physical meaning of different operators such as gradient, curl and divergence(L5)
Estimate the work done against a field, circulation and flux using vector calculus (L5)
Apply the Laplace transform for solving differential equations(L3)
Find or compute the Fourier series of periodic signals(L3)
Know and be able to apply integral expressions for the forwards and inverse Fourier
transform to a range of non-periodic waveforms(L3)
Identify solution methods for partial differential equations that model physical processes(L3)
UNIT I: Vectorcalculus:
Vector Differentiation: Gradient – Directional derivative – Divergence – Curl – Scalar Potential.
Vector Integration: Line integral – Work done – Area – Surface and volume integrals – Vector
integral theorems: Greens, Stokes and Gauss Divergence theorems (without proof).
UNIT II: LaplaceTransforms:

Laplace transforms of standard functions – Shifting theorems – Transforms of derivatives and
integrals – Unit step function – Dirac’s delta function – Inverse Laplace transforms – Convolution
theorem (without proof).
Applications: Solving ordinary differential equations (initial value problems)

using Laplace transforms.
UNIT III: Fourier series andFourierTransforms:

Fourier Series: Introduction – Periodic functions – Fourier series of periodic function – Dirichlet’s
conditions – Even and odd functions – Change of interval – Half-range sine and cosine series.
Fourier Transforms: Fourier integral theorem (without proof) – Fourier sine and cosine integrals –
Sine and cosine transforms – Properties – inverse transforms – Finite Fourier transforms.
UNIT IV: PDE of first order:

Formation of partial differential equations by elimination of arbitrary constants and arbitrary
functions – Solutions of first order linear (Lagrange) equation and nonlinear (standard types)
equations.
UNIT V: Second order PDE and Applications:

Second order PDE: Solutions of linear partial differential equations with constant coefficients –
RHS term of the type eax by,sin( ax by), cos(ax by), x myn.
Applications of PDE: Method of separation of Variables – Solution of One dimensional Wave, Heat
and two-dimensional Laplace equation.

Text Books:
1) B. S. Grewal, Higher Engineering Mathematics, 43rd Edition, KhannaPublishers.
2) B. V. Ramana, Higher Engineering Mathematics, 2007 Edition, Tata Mc. GrawHill
Education.
Reference Books:
1) Erwin Kreyszig, Advanced Engineering Mathematics, 10th Edition,Wiley-India.
2) Dean. G. Duffy, Advanced Engineering Mathematics with MATLAB, 3rd Edition, CRC
Press.
3) Peter O’ Neil, Advanced Engineering Mathematics,Cengage.
4) Srimantha Pal, S C Bhunia, Engineering Mathematics, Oxford UniversityPress.

L T P C
II Year – I Semester
3 0 0 3
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE(PCC2101)
Course Objectives:
This course is designed to:
 To introduce the students to the topics and techniques of discrete methods and
combinatorialreasoning
 To introduce a wide variety of applications. The algorithmic approach to the solution of
problems is fundamental in discrete mathematics, and this approach reinforces the close
ties between this discipline and the area of computerscience
Course Outcomes:
At the end of the course student will be able to
 Demonstrate skills in solving mathematicalproblems
 Comprehend mathematical principles andlogic
 Demonstrate knowledge of mathematical modeling and proficiency in using mathematical
software
 Manipulate and analyze data numerically and/or graphically using appropriateSoftware
 Communicate effectively mathematical ideas/results verbally or inwriting
UNIT I
Mathematical Logic: Propositional Calculus: Statements and Notations, Connectives, Well
Formed Formulas, Truth Tables, Tautologies, Equivalence of Formulas, Duality Law,
Tautological Implications, Normal Forms, Theory of Inference for Statement Calculus,
Consistency of Premises, Indirect Method of Proof, Predicate Calculus: Predicates, Predicative
Logic, Statement Functions, Variables and Quantifiers, Free and Bound Variables, Inference
Theory for Predicate Calculus.
UNIT II
Set Theory: Sets: Operations on Sets, Principle of Inclusion-Exclusion, Relations: Properties,
Operations, Partition and Covering, Transitive Closure, Equivalence, Compatibility and Partial
Ordering, Hasse Diagrams, Functions: Bijective, Composition, Inverse, Permutation, and
Recursive Functions, Lattice and its Properties, Algebraic Structures: Algebraic Systems,
Properties, Semi Groups and Monoids, Group, Subgroup and Abelian Group, Homomorphism,
Isomorphism.
UNIT III
Combinatorics: Basis of Counting, Permutations, Permutations with Repetitions, Circular and
Restricted Permutations, Combinations, Restricted Combinations, Binomial and Multinomial
Coefficients and Theorems, Number Theory: Properties of Integers, Division Theorem, Greatest
Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for Prime Numbers,
The Fundamental Theorem of Arithmetic, Modular Arithmetic, Fermat’s and Euler’sTheorems
UNIT IV
Recurrence Relations: Generating Functions, Function of Sequences, Partial Fractions,
Calculating Coefficient of Generating Functions, Recurrence Relations, Formulation as
Recurrence Relations, Solving Recurrence Relations by Substitution and Generating Functions,
Method of Characteristic Roots, Solving Inhomogeneous RecurrenceRelations.

UNIT V
Graph Theory: Basic Concepts, Graph Theory and its Applications, Sub graphs, Graph
Representations: Adjacency and Incidence Matrices, Isomorphic Graphs, Paths and Circuits,
Eulerian and Hamiltonian Graphs, Multigraphs, Bipartite and Planar Graphs, Euler’s Theorem,
Graph Colouring and Covering, Chromatic Number, Spanning Trees, Prim’s and Kruskal’s
Algorithms, BFS and DFS Spanning Trees.
Text Books:
1) Discrete Mathematical Structures with Applications to Computer Science, J. P. Tremblay
and P. Manohar, Tata McGrawHill.
2) Elements of Discrete Mathematics-A Computer Oriented Approach, C. L. Liu and D. P.
Mohapatra, 3rd Edition, Tata McGrawHill.
Reference Books:
1) Discrete Mathematics for Computer Scientists and Mathematicians, J. L. Mott, A. Kandel
and T. P. Baker, 2nd Edition, Prentice Hall ofIndia.
2) Discrete Mathematical Structures, BernandKolman, Robert C. Busby and Sharon Cutler
Ross,PHI.
3) Discrete Mathematics and its Applications with Combinatorics and Graph Theory, K. H.
Rosen, 7th Edition, Tata McGrawHill.
E-Resources:
1) https://nptel.ac.in/courses/106/106/106106094/

L T P C
3 0 0 3
DATA STRUCTURES (PCC2102)
Course Objectives:
The objective of the course is to
Introduce the fundamental concept of data structures and abstract datatypes
Emphasize the importance of data structures in developing and implementing efficient
algorithms
Describe how arrays, records, linked structures, stacks, queues, trees, and graphs are
represented in memory and used byalgorithms
Course Outcomes:
After completing this course a student will be able to:
Summarize the properties, interfaces, and behaviors of basic abstract datatypes
Discuss the computational efficiency of the principal algorithms for sorting &searching
Use arrays, records, linked structures, stacks, queues, trees, and Graphs in writing
programs
Demonstrate different methods for traversingtrees
UNIT I
Data Structures - Definition, Classification of Data Structures, Operations on Data Structures,
Abstract Data Type (ADT), Preliminaries of algorithms. Time and Space complexity.
Searching - Linear search, Binary search, Fibonacci search.
Sorting- Insertion sort, Selection sort, Exchange (Bubble sort, quick sort), distribution (radix sort),
merging (Merge sort) algorithms.
UNIT II
Linked List: Introduction, Single linked list, Representation of Linked list in memory, Operations
on Single Linked list-Insertion, Deletion, Search and Traversal ,Reversing Single Linked list,
Applications on Single Linked list- Polynomial Expression Representation ,Addition and
Multiplication, Sparse Matrix Representation using Linked List, Advantages and Disadvantages
of Single Linked list, Double Linked list-Insertion, Deletion, Circular Linked list-Insertion,
Deletion.
UNIT III
Queues: Introduction to Queues, Representation of Queues-using Arrays and using Linked list,
Implementation of Queues-using Arrays and using Linked list, Application of Queues-Circular
Queues, Deques, Priority Queues, Multiple Queues.
Stacks: Introduction to Stacks, Array Representation of Stacks, Operations on Stacks, Linked list
Representation of Stacks, Operations on Linked Stack, Applications-Reversing list, Factorial
Calculation, Infix to Postfix Conversion, Evaluating Postfix Expressions.
UNIT IV
Trees: Basic Terminology in Trees, Binary Trees-Properties, Representation of Binary Trees
using Arrays and Linked lists. Binary Search Trees- Basic Concepts, BST Operations: Insertion,
Deletion, Tree Traversals, Applications-Expression Trees, Heap Sort, Balanced Binary Trees-
AVL Trees, Insertion, Deletion andRotations.

UNIT V
Graphs: Basic Concepts, Representations of Graphs-Adjacency Matrix and using Linked list,
Graph Traversals (BFT & DFT), Applications- Minimum Spanning Tree Using Prims &Kruskals
Algorithm, Dijkstra’s shortest path, Transitive closure, Warshall’s Algorithm.
Text Books:
1) Data Structures Using C. 2ndEdition.ReemaThareja,Oxford.
2) Data Structures and algorithm analysis in C, 2nded, Mark AllenWeiss.
Reference Books:
1) Fundamentals of Data Structures in C, 2nd Edition, Horowitz, Sahni, UniversitiesPress.
2) Data Structures: A PseudoCode Approach, 2/e, Richard F.Gilberg, BehrouzA. Forouzon,
Cengage.
3) Data Structures with C, Seymour LipschutzTMH
e-Resources:
1) http://algs4.cs.princeton.edu/home/
2) https://faculty.washington.edu/jstraub/dsa/Master_2_7a.pdf

L T P C
3 0 0 3
OPERATING SYSTEMS (PCC2103)
Course Objectives:
The objectives of this course is to
 Introduce to the internal operation of modern operating systems
 Define, explain, processes and threads, mutual exclusion, CPU scheduling, deadlock, memory
management, and file systems
 Understand File Systems in Operating System like UNIX/Linux and Windows
 Understand Input Output Management and use of Device Driver and Secondary Storage
(Disk)Mechanism
 Analyze Security and Protection Mechanism in Operating System
Course Outcomes:
After learning, the course the students should be able to:
 Describe various generations of Operating System and functions of Operating System
 Describe the concept of program, process and thread and analyze various CPU Scheduling
Algorithms and compare theirperformance
 Solve Inter Process Communication problems using Mathematical Equations by various
methods
 Compare various Memory Management Schemes especially paging and Segmentation in
Operating System and apply various Page Replacement Techniques
 Outline File Systems in Operating System like UNIX/Linux and Windows
UNIT I
Operating Systems Overview: Operating system functions, Operating system structure, Operating
systems operations, Computing environments, Open-Source Operating Systems.
System Structures: Operating System Services, User and Operating-System Interface, systems
calls, Types of System Calls, system programs, operating system structure, operating system
debugging, System Boot.
UNIT II
Process Concept: Process scheduling, Operations on processes, Inter-process communication,
Communication in client server systems.
Multithreaded Programming: Multithreading models, Thread libraries, Threading issues.
Process Scheduling: Basic concepts, Scheduling criteria, Scheduling algorithms, Multiple
processor scheduling, Thread scheduling.
Inter-process Communication: Race conditions, Critical Regions, Mutual exclusion with busy
waiting, Sleep and wakeup, Semaphores, Mutexes, Monitors, Message passing, Barriers,
Classical IPC Problems - Dining philosophers problem, Readers and writers problem.

UNIT III
Memory-Management Strategies: Introduction, Swapping, Contiguous memory allocation, Paging,
Segmentation.
Virtual Memory Management: Introduction, Demand paging, Copy on-write, Page replacement,
Frame allocation, Thrashing, Memory-mapped files, Kernel memory allocation.
UNIT IV
Deadlocks: Resources, Conditions for resource deadlocks, Ostrich algorithm, Deadlock detection
and recovery, Deadlock avoidance, Deadlock prevention.
File Systems: Files, Directories, File system implementation, management and optimization.
Secondary-Storage Structure: Overview of disk structure, and attachment, Disk scheduling, RAID
structure, Stable storage implementation.
UNIT V
System Protection: Goals of protection, Principles and domain of protection, Access matrix,
Access control, Revocation of access rights.
System Security: Introduction, Program threats, System and network threats, Cryptography for
security, User authentication, Implementing security defenses, Firewalling to protect systems and
networks, Computer security classification.
Case Studies: Linux, Microsoft Windows.
Text Books:
1) SilberschatzA, Galvin P B, and Gagne G, Operating System Concepts, 9th edition, Wiley,
2013.
2) Tanenbaum A S, Modern Operating Systems, 3rd edition, Pearson Education, 2008.
(for Interprocess Communication and Filesystems.)
Reference Books:
1) Dhamdhere D M, Operating Systems A Concept Based Approach, 3rd edition, Tata
McGraw-Hill,2012.
2) Stallings W, Operating Systems -Internals and Design Principles, 6th edition, Pearson
Education,2009
3) Nutt G, Operating Systems, 3rd edition, Pearson Education,2004.
e-Resources:

L T P C
3 0 0 3
JAVA PROGRAMMING (PCC2104)
Course Objectives:
The learning objectives of this course are:
 To identify Java language components and how they work together in applications
 To learn the fundamentals of object-oriented programming in Java, including defining classes, invoking
methods, using class libraries.
 To learn how to extend Java classes with inheritance and dynamic binding and how to use exception
handling in Java applications
 To understand how to design applications with threads in Java
 To understand how to use Java APIs for program development
Course Outcomes:
By the end of the course, the student will be
 Able to realize the concept of Object Oriented Programming & Java Programming Constructs
 Able to describe the basic concepts of Java such as operators, classes, objects, inheritance, packages,
Enumeration and variouskeywords
 Apply the concept of exception handling and Input/ Output operations
 Able to design the applications of Java & Java applet
 Able to Analyze& Design the concept of Event Handling and Abstract Window Toolkit
UNIT I
Program Structure in Java: Introduction, Writing Simple Java Programs, Elements or Tokens in Java
Programs, Java Statements, Command Line Arguments, User Input to Programs, Escape Sequences
Comments, Programming Style.
Data Types, Variables, and Operators :Introduction, Data Types in Java, Declaration of Variables, Data
Types, Type Casting, Scope of Variable Identifier, Literal Constants, Symbolic Constants, Formatted Output
with printf() Method, Static Variables and Methods, Attribute Final, Introduction to Operators, Precedence
and Associativity of Operators, Assignment Operator ( = ), Basic Arithmetic Operators, Increment (++) and
Decrement (- -) Operators, Ternary Operator, Relational Operators, Boolean Logical Operators, Bitwise
Logical Operators.
Control Statements: Introduction, if Expression, Nested if Expressions, if–else Expressions, Ternary

Operator?:, Switch Statement, Iteration Statements, while Expression, do–while Loop, for Loop, Nested for
Loop, For–Each for Loop, Break Statement, Continue Statement.

UNIT II
Classes and Objects: Introduction, Class Declaration and Modifiers, Class Members, Declaration of
Class Objects, Assigning One Object to Another, Access Control for Class Members, Accessing Private
Members of Class, Constructor Methods for Class, Overloaded Constructor Methods, Nested Classes,
Final Class and Methods, Passing Arguments by Value and by Reference, Keyword this.
Methods: Introduction, Defining Methods, Overloaded Methods, Overloaded Constructor Methods,
Class Objects as Parameters in Methods, Access Control, Recursive Methods, Nesting of Methods,
Overriding Methods, Attributes Final and Static.
UNIT III
Arrays: Introduction, Declaration and Initialization of Arrays, Storage of Array in Computer Memory,
Accessing Elements of Arrays, Operations on Array Elements, Assigning Array to Another Array,
Dynamic Change of Array Size, Sorting of Arrays, Search for Values in Arrays, Class Arrays, Two-
dimensional Arrays, Arrays of Varying Lengths, Three-dimensional Arrays, Arrays as Vectors.
Inheritance: Introduction, Process of Inheritance, Types of Inheritances, Universal Super Class- Object
Class, Inhibiting Inheritance of Class Using Final, Access Control and Inheritance, Multilevel
Inheritance, Application of Keyword Super, Constructor Method and Inheritance, Method Overriding,
Dynamic Method Dispatch, Abstract Classes, Interfaces and Inheritance.
Interfaces: Introduction, Declaration of Interface, Implementation of Interface, Multiple Interfaces,
Nested Interfaces, Inheritance of Interfaces, Default Methods in Interfaces, Static Methods in Interface,
Functional Interfaces, Annotations.
UNIT IV
Packages and Java Library: Introduction, Defining Package, Importing Packages and Classes into
Programs, Path and Class Path, Access Control, Packages in Java SE, Java.lang Package and its
Classes, Class Object, Enumeration, class Math, Wrapper Classes, Auto-boxing and Auto- unboxing,
Java util Classes and Interfaces, Formatter Class, Random Class, Time Package, Class Instant
(java.time.Instant), Formatting for Date/Time in Java, Temporal Adjusters Class, Temporal Adjusters
Class.
Exception Handling: Introduction, Hierarchy of Standard Exception Classes, Keywords throws and
throw, try, catch, and finally Blocks, Multiple Catch Clauses, Class Throwable, Unchecked Exceptions,
Checked Exceptions, try-with-resources, Catching Subclass Exception, Custom Exceptions, Nested try
and catch Blocks, Rethrowing Exception, Throws Clause.
UNIT V
String Handling in Java: Introduction, Interface Char Sequence, Class String, Methods for Extracting
Characters from Strings, Methods for Comparison of Strings, Methods for Modifying Strings, Methods
for Searching Strings, Data Conversion and Miscellaneous Methods, Class String Buffer, Class
StringBuilder.
Multithreaded Programming: Introduction, Need for Multiple Threads Multithreaded Programming for
Multi-core Processor, Thread Class, Main Thread- Creation of New Threads, Thread States, Thread
Priority-Synchronization, Deadlock and Race Situations, Inter-thread Communication - Suspending,
Resuming, and Stopping of Threads.

Java Database Connectivity: Introduction, JDBC Architecture, Installing MySQL and MySQL
Connector/J, JDBC Environment Setup, Establishing JDBC Database Connections, ResultSet Interface,
Creating JDBC Application, JDBC Batch Processing, JDBC Transaction Management
Text Books:
1) JAVA one step ahead, Anitha Seth, B.L.Juneja,Oxford.
2) The complete Reference Java, 8th edition, Herbert Schildt,TMH.
References Books:
1) Introduction to java programming, 7th edition by Y Daniel Liang,Pearson
2) Constructive JAVA Programming, Sagayaraj, Denis, Karthik, Gajalakshmi, Universities Press.
3) JAVA Programming for Core and Advanced Learners, Sagayaraj, Denis, Karthik, Gajalakshmi,
Universities Press.
e-Resources:
2) https://www.w3schools.com/java/java_data_types.asp

L T P C
0 0 3 1.5
DATA STRUCTURES LAB (PCC2105)
Course Objectives:
The objective of this lab is to
Demonstrate procedural and object oriented paradigm with concepts of streams, classes, functions,
data andobjects.
Understand dynamic memory management techniques using pointers, constructors, destructors,etc
Demonstrate the concept of function overloading, operator overloading, virtual functions and
polymorphism,inheritance.
Demonstrate the different data structuresimplementation.
Course Outcomes:
By the end of this lab the student is able to
Use basic data structures such as arrays and linkedlist.
Programs to demonstrate fundamental algorithmic problems including Tree Traversals, Graph
traversals, and shortestpaths.
Use various searching and sortingalgorithms.
Exercise1:
Write recursive program which computes the nthFibonacci number, for appropriate values of n.
Analyzebehavior of the program Obtain the frequency count of the statement for various values of n.
Exercise 2:
Write recursive program for the following
a) Write recursive and non recursive C program for calculation of Factorial of aninteger
b) Write recursive and non recursive C program for calculation of GCD (n,m)
c) Write recursive and non recursive C program for Towers of Hanoi : N disks are to be transferred from
peg S to peg D with Peg I as the intermediatepeg.
Exercise 3:
a) Write C program that use both recursive and non recursive functions to perform Linear search for a Key
value in a givenlist.
b) Write C program that use both recursive and non recursive functions to perform Binary search for a Key
value in a givenlist.
c) Write C program that use both recursive and non recursive functions to perform Fibonacci search for a
Key value in a givenlist.
Exercise 4:
a) Write C program that implement Bubble sort, to sort a given list of integers in ascendingorder
b) Write C program that implement Quick sort, to sort a given list of integers in ascendingorder
c) Write C program that implement Insertion sort,to sort a given list of integers in ascendingorder
Exercise 5:
a) Write C program that implement heap sort, to sort a given list of integers in ascendingorder
b) Write C program that implement radix sort, to sort a given list of integers in ascendingorder
c) Write C program that implement merge sort, to sort a given list of integers in ascendingorder
Exercise 6:
a) Write C program that implement stack (its operations) usingarrays
b) Write C program that implement stack (its operations) using Linkedlist
Exercise 7:
a) Write a C program that uses Stack operations to Convert infix expression into postfix expression
a) Write C program that implement Queue (its operations) usingarrays.
b) Write C program that implement Queue (its operations) using linkedlists

Exercise 8:
a) Write a C program that uses functions to create a singly linkedlist
b) Write a C program that uses functions to perform insertion operation on a singly linkedlist
c) Write a C program that uses functions to perform deletion operation on a singly linkedlist
Exercise 9:
a) Adding two large integers which are represented in linked listfashion.
b) Write a C program to reverse elements of a single linkedlist.
c) Write a C program to store a polynomial expression in memory using linkedlist
d) Write a C program to representation the given Sparse matrix usingarrays.
e) Write a C program to representation the given Sparse matrix using linkedlist
Exercise10:
a) Write a C program to Create a Binary Tree ofintegers
b) Write a recursive C program for Traversing a binary tree in preorder, inorder andpostorder.
c) Write a non recursive C program for Traversing a binary tree in preorder, inorder andpostorder.
d) Program to check balance property of atree.
Exercise 11:
a) Write a C program to Create aBST
b) Write a C program to insert a node into aBST.
c) Write a C program to delete a node from aBST.

L T P C
0 0 3 1.5
OS & UNIX PROGRAMMING LAB (PCC2106)
Course Objectives:
 To understand the design aspects of operatingsystem
 To study the process management concepts & Techniques
 To study the storage managementconcepts
 To familiarize students with the Linuxenvironment
 To learn the fundamentals of shellscripting/programming
Course Outcomes:
 To use Unix utilities and perform basic shell control of theutilities
 To use the Unix file system and file accesscontrol
 To use of an operating system to developsoftware
 Students will be able to use Linux environmentefficiently
 Solve problems using bash for shellscripting
1) a) Study of Unix/Linux general purpose utility command list: man,who,cat, cd, cp, ps, ls,
mv, rm, mkdir, rmdir, echo, more, date, time, kill, history, chmod, chown, finger, pwd, cal,
logout,shutdown.
b) Study of vieditor
c) Study of Bash shell, Bourne shell and C shell in Unix/Linux operatingsystem
d) Study of Unix/Linux file system (treestructure)
e) Study of .bashrc, /etc/bashrc and Environmentvariables.
2) Write a C program that makes a copy of a file using standard I/O, and systemcalls
3) Write a C program to emulate the UNIX ls–lcommand.
4) Write a C program that illustrates how to execute two commands concurrently with a
command pipe. Ex: - ls–l |sort
5) Simulate the following CPU scheduling algorithms:
(a) Round Robin (b) SJF (c) FCFS (d)Priority
6) Multiprogramming-Memory management-Implementation of fork (), wait (), exec() and
exit (), Systemcalls
7) Simulate thefollowing:
a) Multiprogramming with a fixed number of tasks (MFT)
b) Multiprogramming with a variable number of tasks(MVT)
8) Simulate Bankers Algorithm for Dead LockAvoidance
9) Simulate Bankers Algorithm for Dead LockPrevention.

10) Simulate the following page replacementalgorithms:

a) FIFO b) LRU c) LFU
11) Simulate the following File allocationstrategies
(a) Sequenced (b) Indexed (c)Linked
12) Write a C program that illustrates two processes communicatingusingshared memory
13) Write a C program to simulate producer and consumer problemusingsemaphores
14) Write C program to create a thread using pthreads library and let it run itsfunction.
15) Write a C program to illustrate concurrent execution of threads using pthreadslibrary.

L T P C
0 0 3 1.5
JAVA PROGRAMMING LAB (PCC2107)
Course Objectives:
The aim of this lab is to
 Practice programming in theJava
 Gain knowledge of object-oriented paradigm in the Java programminglanguage
 Learn use of Java in a variety of technologies and on differentplatforms
Course Outcomes:
By the end of the course student will be able to write java program for
 Evaluate default value of all primitive data type, Operations, Expressions, Control-flow,
Strings
 Determine Class, Objects, Methods, Inheritance, Exception, Runtime Polymorphism, User
defined Exception handlingmechanism
 Illustrating simple inheritance, multi-level inheritance, Exception handlingmechanism
 Construct Threads, Event Handling, implement packages, developingapplets
Exercise - 1 (Basics)
a) Write a JAVA program to display default value of all primitive data type ofJAVA
b) Write a java program that display the roots of a quadratic equation ax2+bx=0. Calculate the
discriminate D and basing on value of D, describe the nature ofroot.
c) Five Bikers Compete in a race such that they drive at a constant speed which may or may not
bethe same as the other. To qualify the race, the speed of a racer must be more than the average
speed of all 5 racers. Take as input the speed of each racer and print back the speed of qualifying
racers.
Exercise - 2 (Operations, Expressions, Control-flow, Strings)
a) Write a JAVA program to search for an element in a given list of elements using binary search
mechanism.
b) Write a JAVA program to sort for an element in a given list of elements using bubblesort
c) Write a JAVA program to sort for an element in a given list of elements using mergesort.
d) Write a JAVA program using StringBuffer to delete, removecharacter.
Exercise - 3 (Class, Objects)
a) Write a JAVA program to implement class mechanism. Create a class, methods and invoke
them inside mainmethod.
b) Write a JAVA program to implementconstructor.
Exercise - 4 (Methods)
a) Write a JAVA program to implement constructor overloading.
b) Write a JAVA program implement methodoverloading.
Exercise - 5 (Inheritance)
a) Write a JAVA program to implement SingleInheritance
b) Write a JAVA program to implement multi levelInheritance
c) Write a java program for abstract class to find areas of differentshapes

Exercise - 6 (Inheritance - Continued)

a) Write a JAVA program give example for “super”keyword.
b) Write a JAVA program to implement Interface. What kind of Inheritance can beachieved?
Exercise - 7 (Exception)
a) Write a JAVA program that describes exception handlingmechanism
b) Write a JAVA program Illustrating Multiple catchclauses
Exercise – 8 (Runtime Polymorphism)
a) Write a JAVA program that implements Runtimepolymorphism
b) Write a Case study on run time polymorphism, inheritance that implements in aboveproblem
Exercise – 9 (User defined Exception)
a) Write a JAVA program for creation of Illustratingthrow
b) Write a JAVA program for creation of Illustratingfinally
c) Write a JAVA program for creation of Java Built-inExceptions
d) d)Write a JAVA program for creation of User DefinedException
Exercise – 10 (Threads)
a) Write a JAVA program that creates threads by extending Thread class .First thread display
“Good Morning “every 1 sec, the second thread displays “Hello “every 2 seconds and the third
display “Welcome” every 3 seconds ,(Repeat the same by implementingRunnable)
b) Write a program illustrating isAliveand join()
c) Write a Program illustrating DaemonThreads.
Exercise - 11 (Threads continuity)
a) Write a JAVA program Producer ConsumerProblem
b) Write a case study on thread Synchronization after solving the above producer consumer
problem
Exercise – 12 (Packages)
a) Write a JAVA program illustrate classpath
b) Write a case study on including in class path in your os environment of yourpackage.
c) Write a JAVA program that import and use the defined your package in the previous Problem
Exercise - 13 (Applet)
a) Write a JAVA program to paint like paint brush inapplet.
b) Write a JAVA program to display analog clock using Applet.
c) Write a JAVA program to create different shapes and fill colors using Applet.
Exercise - 14 (Event Handling)
a) Write a JAVA program that display the x and y position of the cursor movement using Mouse.
b) Write a JAVA program that identifies key-up key-down event user entering text in a Applet.

L T P C
II Year - I Semester 0 0 4 2
FREE AND OPEN SOURCE SOFTWARE (SC2101)
Course Objectives:
The student should be made to:
 Be exposed to the context and operation of free and open source software (FOSS)
communities and associated software projects.
 Be familiar with participating in a FOSS project
 Learn scripting language like Python or Perl
 Learn programming language like Ruby
 Learn some important FOSS tools and techniques
1. Getting started with Linux basic commands and directory structure, execute file, directory
operations.
2. Linux commands for redirection, pipes, filters, job control, file ownership, filepermissions,
linksand file system hierarchy.
3. Shell Programming : Write shell script to show various system configuration like
1 Currently logged user and his logname
2 Your current shell
3 Your home directory
4 Your operating system type
5 Your current path setting
6 Your current working directory
7 Show Currently logged number of users
4. Write shell script to show various system configuration like

1About your OS and version, release number, kernel version
2 Show all available shells
3 Show mouse settings
4 Show computer CPU information like processor type, speed etc
5 Show memory information
6 Show hard disk information like size of hard-disk, cache memory, modeletc
7 File system (Mounted)
5. Shell script program for scientific calculator.
6. Version Control System setup and usage using GIT.

1 Creating a repository
2 Checking out a repository
3 Adding content to the repository
4 Committing the data to a repository

7. Shell script to implement a script which kills every process which uses more than aspecified
value of memory or CPU and is run upon system start.
8. Running PHP : simple applications like login forms after
9. Advanced linux commands curl, wget, ftp, ssh and grep
10. Application deployment on a cloud-based LAMP stack/server with PHP eg: Openshift,
Linode etc.
11. Virtualisation environment (e.g., xen, kqemu, virtualbox or lguest) to test anapplications, new
kernels and isolate applications. It could also be used to exposestudents to other alternate OSs
like *BSD
12. Introduction to packet management system : Given a set of RPM or DEB, how to buildand
maintain, serve packages over http or ftp. and also how do you configure clientsystems to
access the package repository.
13. Installing various software packages. Either the package is yet to be installed or anolder
version is existing. The student can practice installing the latest version. Of course,this might
need Internet access.
1 Install samba and share files to windows
2 Install Common Unix Printing System(CUPS)
TEXT BOOK:
Ellen Siever, Stephen Figgins, Robert Love, Arnold Robbins, “Linux in a Nutshell”, Sixth Edition,
OReilly Media, 2009.
REFERENCES:
Philosophy of GNU URL: http://www.gnu.org/philosophy/.
Linux Administration URL: http://www.tldp.org/LDP/lame/LAME/linux-admin-made-easy/.
The Python Tutorial available at http://docs.python.org/2/tutorial/.

L T P C
II Year - I Semester 2 0 0 0
ESSENCE OF INDIAN TRADITIONAL KNOWLEDGE(MC2101)
Course Objectives:
To facilitate the students with the concepts of Indian traditional knowledge and to make them
understand the Importance of roots of knowledge system
The course aim of the importing basic principle of third process reasoning and inference
sustainability is at the course of Indian traditional knowledgesystem
To understand the legal framework and traditional knowledge and biological diversity act
2002 and geographical indication act2003
The courses focus on traditional knowledge and intellectual property mechanism of
traditional knowledge andprotection
To know the student traditional knowledge in differentsector
Course Outcomes:
After completion of the course, students will be able to:
Understand the concept of Traditional knowledge and itsimportance
Know the need and importance of protecting traditionalknowledge
Know the various enactments related to the protection of traditionalknowledge
Understand the concepts of Intellectual property to protect the traditionalknowledge
UNITI
Introduction to traditional knowledge: Define traditional knowledge, nature and characteristics,
scope and importance, kinds of traditional knowledge, the physical and social contexts in which
traditional knowledge develop, the historical impact of social change on traditional knowledge
systems. Indigenous Knowledge (IK), characteristics, traditional knowledge vis-à-vis indigenous
knowledge, traditional knowledge Vs western knowledge traditional knowledge vis-à-vis formal
knowledge
UNIT II
Protection of traditional knowledge: the need for protecting traditional knowledge Significance of
TK Protection, value of TK in global economy, Role of Government to harness TK.
UNIT III
Legal framework and TK: A: The Scheduled Tribes and Other Traditional Forest Dwellers (Recognition of
Forest Rights) Act, 2006, Plant Varieties Protection and Farmers Rights Act,
2001 (PPVFR Act);B:The Biological Diversity Act 2002 and Rules 2004, the protection of
traditional knowledge bill, 2016. Geographical indications act 2003.
UNIT IV
Traditional knowledge and intellectual property: Systems of traditional knowledge protection,
Legal concepts for the protection of traditional knowledge, Certain non IPR mechanisms of
traditional knowledge protection, Patents and traditional knowledge, Strategies to increase
protection of traditional knowledge, global legal FORA for increasing protection of Indian
Traditional Knowledge.

UNIT V
Traditional knowledge in different sectors: Traditional knowledge and engineering, Traditional medicine
system, TK and biotechnology, TK in agriculture, Traditional societies depend on it for their food and
healthcare needs, Importance of conservation and sustainable development of environment, Management of
biodiversity, Food security of the country and protection of TK.
Reference Books:
1) Traditional Knowledge System in India, by Amit Jha,2009.
2) Traditional Knowledge System and Technology in India by Basanta Kumar Mohanta and
Vipin Kumar Singh, PratibhaPrakashan2012.
3) Traditional Knowledge System in India by Amit Jha Atlantic publishers,2002
4) "Knowledge Traditions and Practices of India" Kapil Kapoor, MichelDanino
e-Resources:
1) https://www.youtube.com/watch?v=LZP1StpYEPM
2) http://nptel.ac.in/courses/121106003/

L T P C
II Year – II Semester
3 0 0 3
COMPUTER ORGANIZATION & ARCHITECTURE (ESC2201)
Course Objectives:
The course objectives of Computer Organization are to discuss and make student familiar with the
 Principles and the Implementation of ComputerArithmetic
 Operation of CPUs including RTL, ALU, Instruction Cycle andBusses
 FundamentalsofdifferentInstructionSetArchitecturesandtheirrelationshiptothe CPU
Design
 Memory System and I/OOrganization
 Principles of Operation of Multiprocessor Systems andPipelining
Course Outcomes:
By the end of the course, the student will
 Develop a detailed understanding of computersystems
 Cite different number systems, binary addition and subtraction, standard, floating-point,
and microoperations
 Develop a detailed understanding of architecture and functionality ofcentral processing
unit
 Exemplify in a better way the I/O and memoryorganization
 Illustrate concepts of parallel processing, pipelining and inter processor communication
UNIT I
Basic Structure of Computers: Basic Organization of Computers, Historical Perspective, Bus
Structures, Data Representation: Data types, Complements, Fixed Point Representation. Floating,
Point Representation. Other Binary Codes, Error Detection Codes.
Computer Arithmetic: Addition and Subtraction, Multiplication Algorithms, Division Algorithms.
UNIT II
Register Transfer Language and Micro operations: Register Transfer language. Register Transfer
Bus and Memory Transfers, Arithmetic Micro operations, Logic Micro Operations, Shift Micro
Operations, Arithmetic Logic Shift Unit.
Basic Computer Organization and Design: Instruction Codes, Computer Register, Computer
Instructions, Instruction Cycle, Memory – Reference Instructions. Input –Output and Interrupt,
Complete Computer Description.
UNIT III
Central Processing Unit: General Register Organization, STACK Organization. Instruction
Formats, Addressing Modes, Data Transfer and Manipulation, Program Control, Reduced
Instruction Set Computer.
Micro programmed Control: Control Memory, Address Sequencing, Micro Program example,
Design of Control Unit.

UNIT IV
Memory Organization: Memory Hierarchy, Main Memory, Auxiliary Memory, Associative
Memory, Cache Memory, Virtual Memory.
Input-Output Organization: Peripheral Devices, Input-Output Interface, Asynchronous data transfer,
Modes of Transfer, Priority Interrupts, Direct Memory Access.
UNIT V
Multi Processors: Introduction, Characteristics of Multiprocessors, Interconnection Structures,
Inter Processor Arbitration.
Pipeline: Parallel Processing, Pipelining, Instruction Pipeline, RISC Pipeline, Array Processor.
Text Books:
1) Computer System Architecture, M. Morris Mano, Third Edition, Pearson,2008.
2) Computer Organization, Carl Hamacher, ZvonkoVranesic, SafwatZaky, 5/e, McGraw
Hill,2002.
Reference Books:
1) Computer Organization and Architecture, William Stallings, 6/e, Pearson,2006.
2) Structured Computer Organization, Andrew S. Tanenbaum, 4/e, Pearson,2005.
3) Fundamentals of Computer Organization and Design, Sivarama P. Dandamudi, Springer,
2006.
e-Resources:
2)http://www.cuc.ucc.ie/CS1101/David%20Tarnoff.pdf

L T P C
3 0 0 3
PROBABILITY AND STATISTICS (BSC2201)
Course Objectives:
 To familiarize the students with the foundations of probability and statisticalmethods
 To impart probability concepts and statistical methods in various applicationsEngineering
Course Outcomes:
Upon successful completion of this course, the student should be able to
● Classify the concepts of data science and its importance (L4) or(L2)
● Interpret the association of characteristics and through correlation and regression tools
(L4)
● Make use of the concepts of probability and their applications(L3)
● Apply discrete and continuous probability distributions(L3)
● Design the components of a classical hypothesis test(L6)
● Infer the statistical inferential methods based on small and large sampling tests(L4)
UNIT I
Descriptive statistics and methods for data science: Data science – Statistics Introduction –
Population vs Sample – Collection of data – primary and secondary data – Type of variable:
dependent and independent Categorical and Continuous variables – Data visualization –
Measures of Central tendency – Measures of Variability (spread or variance) – Skewness
Kurtosis.
UNIT II
Correlation and Curve fitting: Correlation – correlation coefficient – rank correlation – regression
coefficients and properties – regression lines – Method of least squares – Straight line – parabola
– Exponential – Powercurves.
UNIT III
Probability and Distributions: Probability – Conditional probability and Baye’s theorem –
Random variables – Discrete and Continuous random variables – Distribution function –
Mathematical Expectation and Variance – Binomial, Poisson, Uniform and Normaldistributions.
UNIT IV
Sampling Theory:Introduction – Population and samples – Sampling distribution of Means and Variance
(definition only) – Central limit theorem (without proof) – Introduction to t, 2 and F- distributions –
Point and Interval estimations – Maximum error of estimate.

UNIT V
Tests of Hypothesis: Introduction – Hypothesis – Null and Alternative Hypothesis – Type I and
Type II errors – Level of significance – One tail and two-tail tests – Tests concerning one mean
and two means (Large and Small samples) – Tests on proportions.
Text Books:
1) Miller and Freund’s, Probability and Statistics for Engineers,7/e, Pearson,2008.
2) S. C. Gupta and V.K. Kapoor, Fundamentals of Mathematical Statistics, 11/e,Sultan
Chand & Sons Publications,2012.
Reference Books:
1) Shron L. Myers, Keying Ye, Ronald E Walpole, Probability and Statistics Engineersand
the Scientists,8th Edition, Pearson2007.
2) Jay l. Devore, Probability and Statistics for Engineering and the Sciences, 8thEdition,
Cengage.
3) Sheldon M. Ross, Introduction to probability and statistics Engineers and the Scientists,4th
Edition, Academic Foundation, 2011.
4) Johannes Ledolter and Robert V. Hogg, Applied statistics for Engineers and Physical
Scientists, 3rd Edition, Pearson,2010.

L T P C
3 0 0 3
FORMAL LANGUAGES AND AUTOMATA THEORY(PCC2201)
Course Objectives:
 To learn fundamentals of Regular and Context Free Grammars andLanguages
 To understand the relation between Regular Language and Finite Automata andmachines
 To learn how to design Automata’s and machines as Acceptors, Verifiers and Translators
 To understand the relation between Contexts free Languages, PDA andTM
 To learn how to design PDA as acceptor and TM asCalculators
Course Outcomes:
By the end of the course students can
 Classify machines by their power to recognize languages.
 Summarize language classes & grammars relationship among them with the helpof
Chomskyhierarchy
 Employ finite state machines to solve problems incomputing
 Illustrate deterministic and non-deterministicmachines
 Quote the hierarchy of problems arising in the computerscience
UNIT I
Finite Automata: Need of Automata theory, Central Concepts of Automata Theory, Automation,
Finite Automation, Transition Systems, Acceptance of a String, DFA, Design of DFAs, NFA,
Design of NFA, Equivalence of DFA and NFA, Conversion of NFA into DFA, Finite Automata
with Є-Transitions, Minimization of Finite Automata, Finite Automata with output-Mealy and
Moore Machines, Applications and Limitation of Finite Automata.
UNIT II
Regular Expressions, Regular Sets, Identity Rules, Equivalence of two RE, Manipulations of REs,
Finite Automata and Regular Expressions, Inter Conversion, Equivalence between FA and RE,
Pumping Lemma of Regular Sets, Closure Properties of Regular Sets, Grammars, Classification
of Grammars, Chomsky Hierarchy Theorem, Right and Left Linear Regular Grammars,
Equivalence between RG and FA, InterConversion.
UNIT III
Formal Languages, Context Free Grammar, Leftmost and Rightmost Derivations, Parse Trees,
Ambiguous Grammars, Simplification of Context Free Grammars-Elimination of Useless
Symbols, Є-Productions and Unit Productions, Normal Forms-Chomsky Normal Form and
Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of Context Free
Grammars.
UNIT IV
Pushdown Automata, Definition, Model, Graphical Notation, Instantaneous Description,
Language Acceptance of Pushdown Automata, Design of Pushdown Automata, Deterministic and
Non – Deterministic Pushdown Automata, Equivalence of Pushdown Automata and Context Free
Grammars, Conversion, Two Stack Pushdown Automata, Application of PushdownAutomata.

UNIT V
Turning Machine: Definition, Model, Representation of TMs-Instantaneous Descriptions,
Transition Tables and Transition Diagrams, Language of a TM, Design of TMs, Types of TMs,
Church’s Thesis, Universal and Restricted TM, Decidable and Un-decidable Problems, Halting
Problem of TMs, Post’s Correspondence Problem, Modified PCP, Classes of P and NP, NP-Hard
and NP-Complete Problems.
Text Books:
1) Introduction to Automata Theory, Languages and Computation, J. E. Hopcroft, R.
Motwani and J. D. Ullman, 3rd Edition, Pearson,2008
2) Theory of Computer Science-Automata, Languages and Computation, K. L. P. Mishraand
N. Chandrasekharan, 3rd Edition, PHI, 2007
Reference Books:
1) Elements of Theory of Computation, Lewis H.P. &Papadimition C.H., Pearson/PHI
2) Theory of Computation, V. Kulkarni, Oxford University Press,2013
3) Theory of Automata, Languages and Computation, Rajendra Kumar, McGraw Hill,2014
e-Resources:

L T P C
3 0 0 3
DATABASE MANAGEMENT SYSTEMS (PCC2202)
Course Objectives:
 To introduce about database managementsystems
 To give a good formal foundation on the relational model of data and usage of RelationalAlgebra
 To introduce the concepts of basic SQL as a universal Databaselanguage
 To demonstrate the principles behind systematic database design approaches
bycovering conceptual design, logical design throughnormalization
 To provide an overview of physical design of a database system, by discussing
Databaseindexing techniques and storagetechniques
Course Outcomes:
By the end of the course, the student will be able to
 Describe a relational database and object-orienteddatabase
 Create, maintain and manipulate a relational database usingSQL
 Describe ER model and normalization for databasedesign
 Examine issues in data storage and query processing and can formulate appropriatesolutions
 Outline the role and issues in management of data such as efficiency, privacy, security, ethical
responsibility, and strategic advantage
UNIT I
Introduction: Database system, Characteristics (Database Vs File System), Database Users(Actors
on Scene, Workers behind the scene), Advantages of Database systems, Database applications.
Brief introduction of different Data Models; Concepts of Schema, Instance and data
independence; Three tier schema architecture for data independence; Database system structure,
environment, Centralized and Client Server architecture for the database.
UNIT II
Relational Model: Introduction to relational model, concepts of domain, attribute, tuple, relation,
importance of null values, constraints (Domain, Key constraints, integrity constraints) and their
importance BASIC SQL: Simple Database schema, data types, table definitions (create, alter),
different DML operations (insert, delete, update), basic SQL querying (select and project) using
where clause, arithmetic & logical operations, SQL functions(Date and Time, Numeric, String
conversion).
UNIT III
Entity Relationship Model: Introduction, Representation of entities, attributes, entity set,
relationship, relationship set, constraints, sub classes, super class, inheritance, specialization,
generalization using ER Diagrams. SQL: Creating tables with relationship, implementation of key
and integrity constraints, nested queries, sub queries, grouping, aggregation, ordering,
implementation of different types of joins, view(updatable and non-updatable), relational set
operations.

UNIT IV
Schema Refinement (Normalization): Purpose of Normalization or schema refinement, concept of
functional
dependency, normal forms based on functional dependency(1NF, 2NF and 3 NF), concept of surrogate
key,
Boyce-codd normal form(BCNF), Lossless join and dependency preserving decomposition, Fourth
normal
form(4NF), Fifth Normal Form(5NF).
UNIT V
Transaction Concept: Transaction State, Implementation of Atomicity and Durability, Concurrent
Executions, Serializability, Recoverability, Implementation of Isolation, Testing for Serializability,
Failure Classification, Storage, Recovery and Atomicity, Recovery algorithm.
Indexing Techniques: B+ Trees: Search, Insert, Delete algorithms, File Organization and Indexing,
Cluster Indexes, Primary and Secondary Indexes , Index data Structures, Hash Based Indexing: Tree
base Indexing, Comparison of File Organizations, Indexes and PerformanceTuning
Text Books:
1) Database Management Systems, 3/e, Raghurama Krishnan, Johannes Gehrke,TMH
2) Database System Concepts,5/e, Silberschatz, Korth,TMH
Reference Books:
1) Introduction to Database Systems, 8/e C J Date,PEA.
2) Database Management System, 6/e RamezElmasri, Shamkant B. Navathe,PEA
3) Database Principles Fundamentals of Design Implementation and Management, Corlos
Coronel, Steven Morris, Peter Robb, CengageLearning.
e-Resources:
2)https://www.geeksforgeeks.org/introduction-to-nosql/

L T P C
3 0 0 3
MANAGERIAL ECONOMICS AND FINANCIAL ACCOUNTANCY (HSMC2201)
Course Objectives:
 The Learning objectives of this paper are to understand the concept and nature of Managerial
Economics and its relationship with other disciplines and also to understand the Concept of
Demand and Demandforecasting.
 To familiarize about the Production function, Input Output relationship, Cost-Output
relationship and Cost-Volume-ProfitAnalysis.
 To understand the nature of markets, Methods of Pricing in the different market structures and
to know the different forms of Business organization and the concept of BusinessCycles.
 To learn different Accounting Systems, preparation of Financial Statement and uses of
different tools for performanceevaluation.
 Finally, it is also to understand the concept of Capital, Capital Budgeting and the techniques
used to evaluate Capital Budgetingproposals.
Unit-I
Introduction to Managerial Economics and demand Analysis:
Definition of Managerial Economics –Scope of Managerial Economics and its relationship with
other subjects –Concept of Demand, Types of Demand, Determinants of Demand- Demand
schedule, Demand curve, Law of Demand and its limitations- Elasticity of Demand, Types of
Elasticity of Demand and Measurement- Demand forecasting and Methods of forecasting,
Concept of Supply and Law of Supply.
Unit – II:
Theories of Production and Cost Analyses:
Theories of Production function- Law of Variable proportions-Isoquants and Isocosts and choice
of least cost factor combination-Concepts of Returns to scale and Economies of scale-Different
cost concepts: opportunity costs, explicit and implicit costs-Fixed costs, Variable Costs and Total
costs –Cost –Volume- Profit analysis-Determination of Breakeven point(problems)-Managerial
significance and limitations of Breakeven point.
Unit – III:
Introduction to Markets, Theories of the Firm & Pricing Policies:
Market Structures: Perfect Competition, Monopoly, Monopolistic competition and Oligopoly –
Features – Price and Output Determination – Managerial Theories of firm: Marris and
Williamson’s models – other Methods of Pricing: Average cost pricing, Limit Pricing, Market
Skimming Pricing, Internet Pricing: (Flat Rate Pricing, Usage sensitive pricing) and Priority
Pricing, Business Cycles : Meaning and Features – Phases of a Business Cycle. Features and
Evaluation of Sole Trader, Partnership, Joint Stock Company – State/Public Enterprises and their
forms.
Unit – IV:
Introduction to Accounting & Financing Analysis:
Introduction to Double Entry System, Journal, Ledger, Trail Balance and Preparation of Final
Accounts with adjustments – Preparation of Financial Statements-Analysis and Interpretation
of Financial Statements-Ratio Analysis – Preparation of Funds flow and cash flow analysis
(Problems)

Unit – V:
Capital and Capital Budgeting: Capital Budgeting: Meaning of Capital-Capitalization-Meaning
of Capital Budgeting-Time value of money- Methods of appraising Project profitability:
Traditional Methods(pay back period, accounting rate of return) and modern methods(Discounted
cash flow method, Net Present Value method, Internal Rate of Return Method and
ProfitabilityIndex)
Course Outcomes:
 The Learner is equipped with the knowledge of estimating the Demand and demand
elasticities for aproduct.
 The knowledge of understanding of the Input-Output-Cost relationships and estimation of the
least cost combination ofinputs.
 The pupil is also ready to understand the nature of different markets and Price Output
determination under various market conditions and also to have the knowledge of different
BusinessUnits.
 The Learner is able to prepare Financial Statements and the usage of various Accounting
tools forAnalysis.
 The Learner can able to evaluate various investment project proposals with the help of
capital budgeting techniques for decisionmaking.
TEXT BOOKS:
A R Aryasri, Managerial Economics and Financial Analysis, The McGraw – Hill companies.
REFERENCES:
1. Varshney R.L, K.L Maheswari, Managerial Economics, S. Chand & CompanyLtd,
2. JL Pappas and EF Brigham, Managerial Economics, Holt, R & W; New editionedition
3. N.P Srinivasn and M. SakthivelMurugan, Accounting for Management, S. Chand & CompanyLtd,
4. MaheswariS.N,AnIntroduction to Accountancy, Vikas Publishing House PvtLtd
5. I.M Pandey, Financial Management , Vikas Publishing House PvtLtd
6. V. Maheswari, Managerial Economics, S. Chand & CompanyLtd,

L T P C
0 0 3 1.5
COMPUTER ORGANIZATION & ARCHITECTURE LAB (ESC2202)
Course Objectives:
Upon completion of the Course, the students will be able to:
 Know the characteristics of various components.
 Understand the utilization of components
Course Outcomes:
At the end of this course, students will demonstrate the ability to
 Understand working of logic families and logic gates.
 Design and implement Combinational and Sequential logic circuits.
 Solve elementary problems by assembly language programming
 Implement assembly language program for given task for 8086 microprocessor.
List of Experiments:
1. Realization of Boolean Expressions using Gates
2. Design and realization logic gates using universal gates
3. Design a JK Flip‐Flop, Edge triggered J‐K NAND Flip Flop and show its functionality
Handle race condition and clock gating in your circuit.
4. Design a 4 – bit Adder / Subtractor
5. Combinational logic circuits: Implementation of Boolean functions using logic gates
6. Arithmetic operations using logic gates; Implementation of Multiplexers,
Demultiplexers, Encoders, Decoders; Implementation of Boolean functions using
Multiplexers/Decoders
7. Study of sequential logic circuits: Implementation of flip flops, Verify the excitation
tables of various FLIP-FLOPS.
8. Design and realization a Synchronous and Asynchronous counter using flip-flops
9. Design and realization of an 8-bit parallel load and serial out shift register using flipflops
10. Implementation of counters, Design and realization a Synchronous and Asynchronous
counter using flip-flops
11. Design and realization of 4x1 mux, 8x1mux using 2x1 mux
Write assembly language programs in 8086 for the following: (MASAM can also beused)
1. To add two 8 bit number (A+B=RESULT with a carry and without a carry).
2. To subtract one 8 bit number from another (A-B=RESULT with a borrow and without a
borrow).
3. To find out AND, OR, NOT, XOR, NAND, NOR, XNOR of two 8 bit number.
4. To find out addition of two 16 bit numbers.
5. To find out subtraction of two 16 bit numbers.
6. To evaluate the expression a = b + c –d * e
Considering 8-bit, 16 bit and 32-bit binary numbers as b, c, d, e.
Take the input in consecutive memory locations and results also Display the results by using “int

xx” of 8086. Validate program for the boundary conditions.
7. To take N numbers as input. Perform the following operations on them.

a. Arrange in ascending and descending order.
b. Find max and minimum
c. Find average
Considering 8-bit, 16-bit binary numbers and 2-digit, 4 digit and 8-digit BCD
numbers. Display the results by using “int xx” of 8086. Validate program for the
boundary conditions.
8. To implement the above operations as procedures and call from the main procedure.
9. To find the factorial of a given number as a Procedure and call from the main program
which display the result.
Note: Experiments can be done using Logic board, EasyCPU, RTSlim, Little Man Computer
(LMC), Assemblers for 8085 programming, 8086 based trainer kits, MIPS simulator PCSpim,
Xilinx schematic editor and simulation tools or any other choice



L T P C
0 0 3 1.5
R PROGRAMMING LAB (PCC2203)
Course Objective: In this course student will learn about the fundamentals of R
programming, standard R libraries,solid understanding of R functions,write programs
using the R and gain skills in R programming Language, get acquaintances with Arrays,
Files, Strings, Packages, and distributions using R.
Course Outcomes: At the end of the course, the student will be able to:
1. Implement basic concepts of R programming, and its different module that
includes conditional, looping, lists, Strings, Functions, Frames, Arrays, and File
programming.
2. Implement the concepts of R Script to extract the data from data frames and file
operations.
3. Implement the various statistical techniques using R.
4. Extend the functionality of R by using add-on packages
5. Use R Graphics and Tables to visualize results of various statistical operations on data
LIST OF LAB PROGRAMS:

Week 1:
Installing R and RStudio
Basic functionality of R, variable, data types in R
Week 2:
a) Implement R script to show the usage of various operators available in Rlanguage.
b) Implement R script to read person‘s age from keyboard and display whether
he is eligiblefor voting ornot.
c) Implement R script to find biggest number between two numbers.
d) Implement R script to check the given year is leap year ornot.
Week 3:
a) Implement R Script to generate first N naturalnumbers.
b) Implement R Script to check given number is palindrome ornot.
c) Implement R script to print factorial of anumber.
d) Implement R Script to check given number is Armstrong ornot.
Week 4:
a) Implement R Script to perform various operations on string using stringlibraries.
b) Implement R Script to check given string is palindrome ornot.
c) Implement R script to accept line of text and find the number of characters,
number of vowels and number of blank spaces init.
d) d) Implement R script for Call-by-value and Call-by-reference

Week 5:
a) Implement R Script to create a list.
b) Implement R Script to access elements in the list.
c) Implement R Script to merge two or more lists. Implement R Script to perform matrix
operation
Week 6:
Implement R script to perform following operations:
d) various operations on vectors
e) Finding the sum and average of given numbers using arrays.
f) To display elements of list in reverse order.
g) Finding the minimum and maximum elements in the array.
Week 7:
a) Implement R Script to perform various operations on matrices
b) Implement R Script to extract the data from dataframes.
c) Write R script to display file contents.
d) Write R script to copy file contents from one file to another
Week 8:
a) Implement R Script to create a Pie chart, Bar Chart, scatter plot andHistogram.
b) Implement R Script to perform mean, median, mode, range, summary, variance,
standard deviation operations.
Introduction to ggplot2 graphics
Week 9:
a) Implement R Script to perform Normal, Binomialdistributions.
b) Implement R Script to perform correlation, Linear and multipleregression.
Week 10:
Introduction to Non-Tabular Data Types: Time series, spatial data, Network data.
Data Transformations: Converting Numeric Variables into Factors, Date
Operations, String Parsing, Geocoding
Week 11:
Introduction Dirty data problems: Missing values, data manipulation, duplicates, forms of data
dates, outliers, spelling
Week 12:
Data sources: SQLite examples for relational databases, Loading SPSS and SAS files, Reading
from Excel and Google Spreadsheets, API and web scraping examples
REFERENCES:
1. R Cookbook Paperback – 2011 by Teetor Paul O Reilly Publications
2. Beginning R: The Statistical Programming Language by Dr. Mark Gardener, Wiley
Publications
3. R Programming For Dummies by JorisMeysAndrie de Vries, Wiley Publications
4. Hands-On Programming with R by Grolemund, O Reilly Publications

5. Statistical Programming in R by KG Srinivas G.M. Siddesh, Chetan Shetty &Sowmya

B.J. - 2017 edition
6. R Fundamentals and Programming Techniques, ThomasLumely.
7. R for Everyone Advanced Analytics and Graphics, Jared P. Lander- Addison
WesleySeries
8. The Art of R Programming, Norman Matloff, CengageLearning
9. Maria DoloresUgarte,AnaF.Militino,AlanT.Arnholt―ProbabilityandStatisticswithR‖2nd
Edition on, CRC Press,2016.
10. R-programming for Data science, RogerD.Peng.
11. An Introduction to statistical learning-with applications in R, Trevor Hastie and Rob
Tibshirani.

Web Links
1. URL: https://cran.r-project.org/doc/manuals/r-release/R-intro.pdf ( Online Resources)
2. http://nptel.ac.in/courses/106104135/48
3. http://nptel.ac.in/courses/110106064/
SOFTWARE requirements:
1. The R statistical software program. Available from: https://www.r-project.org/
RStudio an Integrated Development Environment (IDE) for R. Available from:
https://www.rstudio.com/

L T P C
0 0 3 1.5
DATABASE MANAGEMENT SYSTEMS LAB (PCC2204)
Course Objectives:
This Course will enable students to
 Populate and query a database using SQL DDL/DMLCommands
 Declare and enforce integrity constraints on adatabase
 Writing Queries using advanced concepts ofSQL
 Programming PL/SQL including procedures, functions, cursors andtriggers
Course Outcomes:
At the end of the course the student will be able to:
 Utilize SQL to execute queries for creating database and performing data
manipulation operations
 Examine integrity constraints to build efficientdatabases
 Apply Queries using Advanced Concepts ofSQL
Build PL/SQL programs including stored procedures, functions, cursors andtriggers
List of Exercises:
1. Creation, altering and droping of tables and inserting rows into a table (use
constraints while creating tables) examples using SELECTcommand.
2. Queries (along with sub Queries) using ANY, ALL, IN, EXISTS,
NOTEXISTS, UNION, INTERSET, Constraints. Example:- Select the roll
number and name of the student who secured fourth rank in theclass.
3. Queries using Aggregate functions (COUNT, SUM, AVG, MAX and MIN),
GROUP BY, HAVING and Creation and dropping of Views.
4. Queries using Conversion functions (to_char, to_number and to_date),
string functions (Concatenation, lpad, rpad, ltrim, rtrim, lower, upper, initcap,
length, substr and instr), date functions (Sysdate, next_day, add_months,
last_day, months_between, least, greatest, trunc, round, to_char,to_date)
5.
i. Create a simple PL/SQL program which includes declaration section,
executable section and exception –Handling section (Ex. Student marks
can be selected from the table and printed for those who secured first
class and an exception can be raised if no records were found)
ii. Insert data into student table and use COMMIT, ROLLBACK and
SAVEPOINT in PL/SQL block.
6. Develop a program that includes the features NESTED IF, CASE and CASE
expression. The program can be extended using the NULLIF and COALESCE
functions.
7. Program development using WHILE LOOPS, numeric FOR LOOPS, nested
loops using ERROR Handling, BUILT –IN Exceptions, USE defined
Exceptions, RAISE- APPLICATIONERROR.

8. Programs development using creation of procedures, passing parameters IN and

OUT ofPROCEDURES.
9. Program development using creation of stored functions, invoke functions in SQL
Statements and write complexfunctions.
10. Develop programs using features parameters in a CURSOR, FOR
UPDATE CURSOR, WHERE CURRENT of clause and CURSORvariables.
11. Develop Programs using BEFORE and AFTER Triggers, Row and Statement
Triggers and INSTEAD OFTriggers
12. Create a table and perform the search operation on table using indexing and
non-indexing techniques.
Text Books/Suggested Reading:

1) Oracle: The Complete Reference by OraclePress
2) Nilesh Shah, "Database Systems Using Oracle”, PHI,2007
3) Rick F Vander Lans, “Introduction to SQL”, Fourth Edition, Pearson Education,2007

L T P C
0 0 4 2
ANDROID APPLICATION DEVELOPMENT (SC2201)
Course Objectives:
 To learn how to develop Applications in android environment.
 To learn how to develop user interface applications.
 To learn how to develop URL related applications.
1. Create an Android application that shows Hello + name of the user and run it on an emulator.
(b) Create an application that takes the name from a text box and shows hello message along with
the name entered in text box, when the user clicks the OK button.
2. Create a screen that has input boxes for User Name, Password, Address, Gender (radio buttons
for male and female), Age (numeric), Date of Birth (Date Picket), State (Spinner) and a Submit
button. On clicking the submit button, print all the data below the Submit Button. Use
(a) Linear Layout , (b) Relative Layout and
(c) Grid Layout or Table Layout.
3. Develop an application that shows names as a list and on selecting a name it shouldshow the
details of the candidate on the next screen with a “Back” button. If thescreen is rotated to
landscape mode (width greater than height), then the screen shouldshow list on left fragment and
details on right fragment instead of second screen withback button. Use Fragment transactions
and Rotation event listener.
4. Develop an application that uses a menu with 3 options for dialing a number, openinga website
and to send an SMS. On selecting an option, the appropriate action shouldbe invoked using
intents.
5. Develop an application that inserts some notifications into Notification area andwhenever a
notification is inserted, it should show a toast with details of thenotification.
6. Create an application that uses a text file to store user names and passwords (tabseparated
fields and one record per line). When the user submits a login name andpassword through a
screen, the details should be verified with the text file data and ifthey match, show a dialog
saying that login is successful. Otherwise, show the dialogwith Login Failed message.
7. Create a user registration application that stores the user details in a database table.
8. Create a database and a user table where the details of login names and passwords arestored.
Insert some names and passwords initially. Now the login details entered by the user should be
verified with the database and an appropriate dialog should beshown to the user.
Note:
Android Application Development with MIT App Inventor:For the first one week, the student
is advised to go through the App Inventor from MIT which gives insight into the various

properties of each component.

The student should pay attention to the properties of each components, which are used later in
Android programming. Following are useful links:
1. http://ai2.appinventor.mit.edu
2. https://drive.google.com/file/d/0B8rTtW_91YclTWF4czdBMEpZcWs/view
L T P C
III Year – I Semester
3 0 0 3
COMPUTER NETWORKS
Course Objectives:
 Study the basic taxonomy and terminology of the computer networking and enumerate the
layers of OSI model and TCP/IP model
 Study data link layer concepts, design issues, and protocols
 Gain core knowledge of Network layer routing protocols and IP addressing
 Study Session layer design issues, Transport layer services, and protocols
 Acquire knowledge of Application layer and Presentation layer paradigms and protocols
Course Outcomes:
 Illustrate the OSI and TCP/IP reference model
 Analyze MAC layer protocols and LAN technologies
 Design applications using internet protocols
 Implement routing and congestion control algorithms
 Develop application layer protocols
UNIT I:
Introduction: History and development of computer networks, Basic Network Architectures: OSI
reference model, TCP/IP reference model, and Networks topologies, types of networks (LAN,
MAN, WAN, circuit switched, packet switched, message switched, extranet, intranet, Internet,
wired, wireless).
UNIT II :
Physical layer: Line encoding, block encoding, scrambling, modulation demodulation (both
analog and digital), errors in transmission, multiplexing (FDM, TDM, WDM, OFDM, DSSS),
Different types of transmission media. Data Link Layer services: framing, error control, flow
control, medium access control. Error & Flow control mechanisms: stop and wait, Go back N
and selective repeat. MAC protocols: Aloha, slotted aloha, CSMA, CSMA/CD, CSMA/CA,
polling, token passing, scheduling.
UNIT III :
Local Area Network Technology: Token Ring. Error detection (Parity, CRC), Ethernet, Fast
Ethernet, Gigabit Ethernet, Personal Area Network: Bluetooth and Wireless Communications
Standard: Wi-Fi (802.11) and Wi-MAX.
UNIT IV:

Network layer: Internet Protocol, IPv6, ARP, DHCP, ICMP, Routing

algorithms: Distance vector, Link state, Metrics, Inter-domain routing. Sub
netting, Super netting, Classless addressing, Network Address Translation.
UNIT V:
Transport layer: UDP, TCP. Connection establishment and termination, sliding window, flow
and congestion control, timers, retransmission, TCP extensions, Queuing theory, Single and
multiple server queuing models, Little’s formula. Application Layer. Network Application
services and protocols including e-mail, www, DNS, SMTP, IMAP, FTP, TFTP, Telnet,
BOOTP, HTTP, IPSec, Firewalls.
Text Books:
1) Computer Networks , Andrew S. Tanenbaum, David J. Wetherall, Pearson Education India; 5
edition, 2013
2) Data Communication and Networking , Behrouz A. Forouzan, McGraw Hill, 5th Edition,
2012
Reference Books:
1) Computer Networks: A Systems Approach, LL Peterson, BS Davie, Morgan-Kauffman, 5th
Edition, 2011.
2) Computer Networking: A Top-Down Approach JF Kurose, KW Ross, Addison-Wesley, 5th
Edition, 2009
3) Data and Computer Communications, William Stallings,Pearson, 8th Edition, 2007

L T P C
3 0 0 3
SOFTWARE ENGINEERING
Course Objectives:
 Give exposure to phases of Software Development, common process models including
Waterfall, and the Unified Process, and hands-on experience with elements of the agile
process
 Give exposure to a variety of Software Engineering practices such as requirements
analysis and specification, code analysis, code debugging, testing, traceability, and
version control
 Give exposure to Software Design techniques
Course Outcomes: Students taking this subject will gain software engineering skills in
the following areas:
 Ability to transform an Object-Oriented Design into high quality, executable code
 Skills to design, implement, and execute test cases at the Unit and Integration level
 Compare conventional and agile software methods
UNIT I:
The Nature of Software, The Unique Nature of WebApps, Software Engineering, The Software
Process, Software Engineering Practice, Software Myths. A Generic Process Model, Process
Assessment and Improvement, Prescriptive Process Models, Specialized Process Models, The
Unified Process, Personal and Team Process Models, Process Technology.
UNIT II:
Agility, Agility and the Cost of Change, Agile Process, Extreme Programming (XP), Other
Agile Process Models, A Tool Set for the Agile Process, Software Engineering Knowledge,
Core Principles, Principles That Guide Each Framework Activity, Requirements Engineering,

Establishing the Groundwork, Eliciting Requirements, Developing Use Cases, Building the
Requirements Model, Negotiating Requirements, Validating Requirements.
UNIT III:
Requirements Analysis, Scenario-Based Modelling, UML Models That Supplement the Use
Case, Data Modelling Concepts, Class-Based Modelling, Requirements Modelling Strategies,
FlowOriented Modelling, Creating a Behavioural Model, Patterns for Requirements Modelling,
Requirements Modelling for WebApps.
UNIT IV:
Design within the Context of Software Engineering, The Design Process, Design Concepts, The
Design Model, Software Architecture, Architectural Genres, Architectural Styles, Assessing
Alternative Architectural Designs, Architectural Mapping Using Data Flow, Components,
Designing Class-Based Components, Conducting Component-Level Design, Component-Level
Design for WebApps, Designing Traditional Components, Component-Based Development.
UNIT V:
The Golden Rules, User Interface Analysis and Design, Interface Analysis, Interface Design
Steps, WebApp Interface Design, Design Evaluation, Elements of Software Quality Assurance,
SQA Tasks, Goals & Metrics, Statistical SQA, Software Reliability, A Strategic Approach to
Software Testing, Strategic Issues, Test Strategies for Conventional Software, Test Strategies for
Object-Oriented Software, Test Strategies for WebApps, Validation Testing, System Testing,
The Art of Debugging, Software Testing Fundamentals, Internal and External Views of Testing,
White-Box Testing, Basis Path Testing.
Text Books:
1) Software Engineering a practitioner’s approach, Roger S. Pressman, Seventh Edition,
McGraw Hill Higher Education.
2) Software Engineering, Ian Sommerville, Ninth Edition, Pearson.
Reference Books:
1) Software Engineering, A Precise Approach, PankajJalote, Wiley India, 2010.
2) Software Engineering, Ugrasen Suman, Cengage.

L T P C
3 0 0 3
DESIGN AND ANALYSIS OF ALGORITHMS
Course Objectives:
 To provide an introduction to formalisms to understand, analyze and denote time
complexities of algorithms
 To introduce the different algorithmic approaches for problem solving through numerous
example problems
 To provide some theoretical grounding in terms of finding the lower bounds of
algorithms and the NP-completeness
Course Outcomes: At the end of the course, the students will be able to:
 Describe asymptotic notation used for denoting performance of algorithms
 Analyse the performance of a given algorithm and denote its time complexity using the
asymptotic notation for recursive and non-recursive algorithms
 List and describe various algorithmic approaches
 Solve problems using divide and conquer, greedy, dynamic programming, backtracking

and branch and bound algorithmic approaches

 Apply graph search algorithms to real world problems
 Demonstrate an understanding of NP- Completeness theory and lower bound theory
UNIT I:
Introduction: Algorithm Definition, Algorithm Specification, performance Analysis,
Performance measurement, Asymptotic notation, Randomized Algorithms. Sets & Disjoint set
union: introduction, union and find operations. Basic Traversal & Search Techniques:
Techniques for Graphs, connected components and Spanning Trees, Bi-connected components
and DFS.
UNIT II :
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the
maximum and minimum, Merge sort, Quick sort. The Greedy Method: The general Method,
container loading, knapsack problem, Job sequencing with deadlines, minimum-cost spanning
Trees.
UNIT III:
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths,
singlesource shortest paths: general weights, optimal Binary search trees, 0/1 knapsack,
reliability Design, The travelling salesperson problem, matrix chain multiplication.
UNIT IV:
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring,
Hamiltonian cycles, and knapsack problem. Branch and Bound: FIFO Branch-and-Bound, LC
Branch-and-Bound, 0/1 Knapsack problem, Traveling salesperson problem.
UNIT V:
NP-Hard and NP-Complete problems: Basic concepts, Cook’s Theorem. String Matching:
Introduction, String Matching-Meaning and Application, Naive String Matching Algorithm,
Rabin-Karp Algorithm, Knuth-Morris-Pratt Automata, Tries, Suffix Tree.
Text Books:
1) Ellis Horowitz, SartajSahni, SanguthevarRajasekaran, “Fundamentals of Computer
Algorithms”, 2nd Edition, Universities Press.
2) Harsh Bhasin, “Algorithms Design & Analysis”, Oxford University Press.
Reference Books:
1) Horowitz E. Sahani S: “Fundamentals of Computer Algorithms”, 2nd Edition, Galgotia

Publications, 2008.
2) S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press

L T P C
III Year – I Semester Professional Elective Courses – I
3 0 0 3
COMPUTER GRAPHICS
Course Objectives:
 Understand the fundamental concepts and theory of computer graphics
 Understand modelling, and interactive control of 3D computer graphics applications
 The underlying parametric surface concepts be understood
 Learn multimedia authoring tools.

Course Outcomes: Upon successful completion of the course, students will be able to:
 Use the principles and commonly used paradigms and techniques of computer graphics
 Write basic graphics application programs including animation
 Design programs to display graphic images to given specifications
UNIT I:
INTRODUCTION: Application areas of computer graphics, overview of graphic system, video-
display devices, and raster-scan systems, random scan systems, graphics monitors and work
stations and input devices.
UNIT II:
OUTPUT PRIMITIVES: Points and lines, line drawing algorithms, mid-point circle
algorithm, Filled area primitives: scan-line polygon fill algorithm, boundary-fill and flood-fill
algorithm. 2-D GEOMETRICAL TRANSFORMATIONS: Translation, scaling, rotation,
reflection and shear transformation matrix representations and homogeneous co-ordinates,
composite transformations, transformations between coordinates
UNIT III:
2-D VIEWING : The viewing pipe-line, viewing coordinat4 reference frame, window to view-
port co-ordinate transformations, viewing function, Cohen-Sutherland and Cyrus-beck line
clipping algorithms, SutherlandHodge man polygon clipping algorithm.
UNIT IV:
3-D OBJECT REPRESENTATION: spline representation, Hermite curve, Bezier curve and
B-spline curve, Polygon surfaces, quadric surfaces, , Solid modeling Schalars – wire frame,
CSG, B-rep. Bezier and B-spline surfaces, Basic illumination models, shading algorithms
UNIT V:
3-D GEOMETRIC TRANSFORMATIONS: Translation, rotation, scaling, reflection and
shear transformation and composite transformations. Visible surface detection methods:
Classification, back-face detection, depthbuffer, scan-line, depth sorting
COMPUTER ANIMATION: Design of animation sequence, general computer animation
functions, raster animation, computer animation language, key frame system, motion
specification
Text Books:
1. Computer Graphics C version/ Donald Hearn and M. Pauline Baker/Pearson/PHI
2. Computer Graphics Principles & practice-second edition in C/ Foley, VanDam, Feiner and
Hughes/Pearson Education
Reference Books:
1. Computer Graphics Second edition/ Zhigandxiang, Roy Plastock, Schaum’s outlines/Tata Mc-

Graw hill edition.

2. Procedural elements for Computer Graphics/David F Rogers/Tata Mc Graw hill, 2nd edition.
3. Principles of Interactive Computer Graphics/ Neuman and Sproul/TMH.
4. Computer Graphics/ Steven Harrington/TMH
L T P C
3 0 0 3
ARTIFICIAL INTELLIGENCE

Course Objectives:
 To have a basic proficiency in a traditional AI language including an ability to write
simple to intermediate programs and an ability to understand code written in that
language
 To have an understanding of the basic issues of knowledge representation and blind and
heuristic search, as well as an understanding of other topics such as minimax, resolution,
etc. that play an important role in AI programs
 To have a basic understanding of some of the more advanced topics of AI such as
learning, natural language processing, agents and robotics, expert systems, and planning
Course Outcomes:
 Outline problems that are amenable to solution by AI methods, and which AI methods
may be suited to solving a given problem
 Apply the language/framework of different AI methods for a given problem
 Implement basic AI algorithms- standard search algorithms or dynamic programming
 Design and carry out an empirical evaluation of different algorithms on problem
formalization, and state the conclusions that the evaluation supports
UNIT I:
Introduction, history, intelligent systems, foundations of AI, applications, tic-tac-toe game
playing, development of AI languages, current trends.
UNIT II:
Problem solving: state-space search and control strategies: Introduction, general problem
solving, characteristics of problem, exhaustive searches, heuristic search techniques, iterative
deepening A*, constraint satisfaction. Problem reduction and game playing: Introduction,
problem reduction, game playing, alpha beta pruning, two-player perfect information games.
UNIT III:
Logic concepts: Introduction, propositional calculus, proportional logic, natural deduction
system, axiomatic system, semantic tableau system in proportional logic, resolution refutation in
proportional logic, predicate logic.
UNIT IV:
Knowledge representation: Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR, knowledge
representation using frames. Advanced knowledge representation techniques: Introduction,
conceptual dependency theory, script structure, CYC theory, case grammars, semantic web
UNIT V:
Expert system and applications: Introduction phases in building expert systems, expert system
versus traditional systems Uncertainty measure: probability theory: Introduction, probability
theory, Bayesian belief networks, certainty factor theory, dempster-shafer theory Fuzzy sets and
fuzzy logic: Introduction, fuzzy sets, fuzzy set operations, types of membership functions, multi
valued logic, fuzzy logic, linguistic variables and hedges, fuzzy propositions, inference rules for

fuzzy propositions, fuzzy systems.
Text Books:
1) Artificial Intelligence- Saroj Kaushik, CENGAGE Learning
2) Artificial intelligence, A modern Approach , 2nded, Stuart Russel, Peter Norvig, PEA
Reference Books:
1) Artificial Intelligence- Deepak Khemani, TMH, 2013
2) Introduction to Artificial Intelligence, Patterson, PHI
3) Atificial intelligence, structures and Strategies for Complex problem solving, -George F Lugar, 5thed,
PEA

L T P C
3 0 0 3
COMPILER DESIGN
Course Objectives:
 To study the various phases in the design of a compiler
 To understand the design of top-down and bottom-up parsers
 To understand syntax directed translation schemes
 To introduce LEX and YACC tools
 To learn to develop algorithms to generate code for a target machine
 Design, develop, and implement a compiler for any language
 Use LEX and YACC tools for developing a scanner and a parser
 Design and implement LL and LR parsers
 Design algorithms to perform code optimization in order to improve the
performance of a program in terms of space and time complexity
 Apply algorithms to generate machine code
UNIT I:
Language Processors, the structure of a compiler, the science of building a compiler,
programming language basics. Lexical Analysis: The Role of the Lexical Analyzer, Input
Buffering, Recognition of Tokens, The Lexical-Analyzer Generator Lex, Finite Automata, From
Regular Expressions to Automata, Design of a Lexical-Analyzer Generator, Optimization of
DFA-Based Pattern Matchers.
UNIT II :
Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down
Parsing, Recursive and Non recursive top down parsers, Bottom-Up Parsing, Introduction to LR
Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous Grammars, Parser
Generators.
UNIT III :
Syntax-Directed Definitions, Evaluation Orders for SDD’s, Applications of Syntax-Directed
Translation, Syntax-Directed Translation Schemes, and Implementing L-Attributed SDD’s.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and
Declarations, Type Checking, Control Flow, Back patching, Switch-Statements, Intermediate
Code for Procedures.

UNIT IV:
Run-Time Environments: Storage organization, Stack Allocation of Space, Access to Nonlocal
Data on the Stack, Heap Management, Introduction to Garbage Collection, Introduction to
TraceBased Collection. Machine-Independent Optimizations: The Principal Sources of
Optimization, Introduction to Data-Flow Analysis, Foundations of Data-Flow Analysis,
Constant Propagation, PartialRedundancy Elimination, Loops in Flow Graphs.
UNIT V:
Code Generation: Issues in the Design of a Code Generator, The Target Language, Addresses in
the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks, A Simple Code
Generator. Machine-dependent Optimizations: Peephole Optimization, Register Allocation and
Assignment, Dynamic Programming Code-Generation.
Text Books:
1) Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica S. Lam,
Ravi Sethi, Jeffry D. Ullman, Pearson.
2) Compiler Construction-Principles and Practice, Kenneth C Louden, Cengage Learning.
Reference Books:
1) Modern compiler implementation in C, Andrew W Appel, Revised edition, Cambridge

University Press.
2) The Theory and Practice of Compiler writing, J. P. Tremblay and P. G. Sorenson, TMH
3) Writing compilers and interpreters, R. Mak, 3rd edition, Wiley student edition.

L T P C
III Year–I Semester Professional Elective Courses – I
3 0 0 3
ADVANCEDDATASTRUCTURES
Course Objectives:
 Describe and implement a variety of advanced data structures (hash tables,
priority queues, balanced search trees, graphs)
 Analyzethespaceandtimecomplexityofthealgorithmsstudiedinthecourse
 Identifydifferentsolutionsforagivenproblem;analyzeadvantagesanddisadvantage
stodifferentsolutions
 Demonstrate an understanding of Amortization
 Demonstrate an understanding of various search trees
Course Outcomes: Upon completion of the course, graduates will be able to
 Illustrate several sub-quadratic sorting algorithms.
 Demonstrate recursive methods
 Apply advanced data structures such as balanced search trees, hash tables,
priority queues and the disjoint set union/find data structure
UNIT I
Sorting: Medians and order statistics, External Sorting, Introduction, K-way Merging,
Buffer Handling for parallel Operation, Run Generation, Optimal Merging of Runs.
Hashing: Introduction, Static Hashing, Hash Table, Hash Functions, Secure Hash
Function, Overflow Handling, Theoretical Evaluation of Overflow Techniques,
Dynamic Hashing-Motivation for Dynamic Hashing, Dynamic Hashing Using
Directories, Directory less Dynamic Hashing, Alternate hash functions (mid-square,
folding, digit analysis), Double Hashing

UNIT II
Priority Queues and Advance Heaps: Double Ended Priority queues, Leftist Trees:
Height Biased, Weight Biased. Binomial Heaps: Cost Amortization, Definition of
Binomial Heaps, Insertion, Melding two Binomial Heaps, deletion of min element.
Fibonacci Heaps: Definition, Deletion from an F-heap, Decrease key, Cascading Cut.
UNIT III
Advanced and Efficient Binary Search Trees: Optimal Binary Search Trees, AVL
Trees-rotations, insertion, deletion operations, Red-Black Trees, Definition,
Representation of a Red-Black Tree, Searching a Red-Black Tree, Inserting into a Red
Black Tree, Deletion from a Red-Black Tree, Joining Red-Black Trees, Splitting a
Red-Black tree.
UNIT IV
Multi-way Search Trees: M-Way Search Trees, Definition and Properties, Searching
an M-Way Search Tree, B-Trees, Definition and Properties, Number of Elements in a
B-tree, Insertion into B-Tree, Deletion from a B-Tree, B+-Tree Definition, Searching a
B+-Tree, Insertion into B+-tree, Deletion from a B+-Tree.
UNIT V
Digital Search Structures: Digital Search Trees: Definition, Search, Insert and Delete.
Binary Tries, Compressed Binary Tries. Multi-way Tries: Definition, searching a Trie,
sampling strategies, Insertion, Deletion, Height of a Trie. Prefix Search and
applications. Suffix Trees.
Text Books:
1) Fundamentals of DATA STRUCTURES in C: 2nded,, Horowitz, Sahani,
Anderson-freed, Universities Press
2) Data Structures, a Pseudo code Approach, Richard F Gilberg, Behrouz A
Forouzan, Cengage.
Reference Books:
1) Data structures and Algorithm Analysis in C, 2nd edition, Mark Allen Weiss, Pearson
2) “Introduction to Algorithms”, T.Cormen, R.Rivest, C.Stein, C.Leiserson, PHI
publication, Second Edition, 2004, ISBN 81-203-2141-3.
e-Resources:
1) Web:http://lcm.csa.iisc.ernet.in/dsa/dsa.html
2) http://utubersity.com/?page_id=878
3) http://freevideolectures.com/Course/2519/C-Programming-and-Data-Structures
4) http://freevideolectures.com/Course/2279/Data-Structures-And-Algorithms

L T P C
3 0 0 3
PRINCIPLES OF PROGRAMMING LANGUAGES
OBJECTIVES:
 To understand and describe syntax and semantics of programming languages
 To understand data, data types, and basic statements
 To understand call-return architecture and ways of implementing them
 To understand object-orientation, concurrency, and event handling in
programming languages
 To develop programs in non-procedural programming paradigms
UNIT I:
Syntax and semantics: Evolution of programming languages, describing syntax,
context, free grammars, attribute grammars, describing semantics, lexical analysis,
parsing, recursive - decent bottom - up parsing

UNIT- II:
Data, data types, and basic statements: Names, variables, binding, type checking,
scope, scope rules, lifetime and garbage collection, primitive data types, strings,
array types, associative arrays, record types, union types, pointers and references,
Arithmetic expressions, overloaded operators, type conversions, relational and
boolean expressions , assignment statements , mixed mode assignments, control
structures – selection, iterations, branching, guarded Statements
UNIT- III:
Subprograms and implementations: Subprograms, design issues, local referencing,
parameter passing, overloaded methods, generic methods, design issues for
functions, semantics of call and return, implementing simple subprograms, stack
and dynamic local variables, nested subprograms, blocks, dynamic scoping
UNIT- IV:
Object- orientation, concurrency, and event handling: Object – orientation, design
issues for OOP languages, implementation of object, oriented constructs,
concurrency, semaphores, Monitors, message passing, threads, statement level
concurrency, exception handling, event handling
UNIT -V:
Functional programming languages: Introduction to lambda calculus,
fundamentals of functional programming languages, Programming with Scheme, –
Programming with ML, Logic programming languages: Introduction to logic and logic
programming, – Programming with Prolog, multi - paradigm languages
OUTCOMES:
 Describe syntax and semantics of programminglanguages
 Explain data, data types, and basic statements of programminglanguages
 Design and implement subprogram constructs, Apply object -
oriented, concurrency, and event handling programmingconstructs
 Develop programs in Scheme, ML, andProlog
Understand and adopt new programminglanguages
TEXT BOOKS:
1. Robert W. Sebesta, “Concepts of Programming Languages”, Tenth
Edition, Addison Wesley, 2012.
2. Programming Langugaes, Principles & Paradigms, 2ed, Allen B
Tucker, Robert E Noonan, TMH

REFERENCE BOOKS:
1. R. Kent Dybvig, “The Scheme programming language”, Fourth Edition, MIT
Press,2009.
2. Jeffrey D. Ullman, “Elements of ML programming”, Second Edition, Prentice
Hall,1998.
3. Richard A. O'Keefe, “The craft of Prolog”, MIT Press, 2009.
4. W. F. Clocksin and C. S. Mellish, “Programming in Prolog: Using the
ISOStandard”, Fifth Edition, Springer,2003
L T P C
0 0 3 1.5
NETWORK PROGRAMMING LAB
Course Objectives:
 Understand and apply different network commands
 Analyze different networking functions and features for implementing
optimal solutions Apply different networking concepts for implementing
network solution
 Implement different network protocols
Course Outcomes:
 Apply the basics of Physical layer in real time applications

 Apply data link layer concepts, design issues, and protocols

 Apply Network layer routing protocols and IP addressing
 Implement the functions of Application layer and Presentation layer
paradigms and Protocols
Experiments:
1) Implement the data link layer framing methods such as character
stuffing and bit stuffing.
2) Write a C program to develop a DNS client server to resolve the given hostname.
3) Implement on a data set of characters the three CRC polynomials – CRC-
12, CRC-16andCRC-CCIP.
4) Implement Dijkstra’s algorithm to compute the shortest path in a graph.
5) Take an example subnet graph with weights indicating delay between
nodes. Now obtain Routing table art each node using distance vector
routing algorithm
6) Take an example sub net of hosts. Obtain broadcast tree for it.
7) Write a client-server application for chat using UDP
8) Implement programs using raw sockets (like packet capturing and filtering)
9) Write a C program to perform sliding window protocol.
10) Get the MAC or Physical address of the system using Address Resolution
Protocol.
11) Simulate the Implementing Routing Protocols using border gateway protocol
(BGP)
12) Simulate the OPEN SHORTEST PATH FIRS Trouting protocol based on the cost
assigned to the path.

L T P C
0 0 3 1.5
SOFTWARE ENGINEERING LAB
Course Objective:
The Software Engineering lab will facilitate the students to develop a preliminary yet practical
understanding of software development process and tools
Course Outcomes: At the end of the course Student will be able to

1. Understand software process models such as the waterfall and evolutionary models.
2. Understand of the role of project management including planning, scheduling, risk
management, etc.
3. Understand of software requirements and the SRS document.
4. Use different tools required in software design
5. Write test cases for small programs
Experiments:
Take any real time problem and do the following experiments
1. Do the Requirement Analysis and Prepare SRS
2. Using COCOMO model estimate effort.
3. Calculate effort using FP oriented estimation model.
4. Analyze the Risk related to the project and prepare RMMM plan.
5. Develop Time-line chart and project table using PERT or CPM project scheduling methods.
6. Draw E-R diagrams, DFD, CFD and structured charts for the project.
7. Design of Test cases based on requirements and design.
8. Prepare FTR
9. Prepare Version control and change control for software configuration items

L T P C
III Year – I Semester 0 0 4 2
Web Application Development Using Full Stack -Frontend Development – Module -I
Course Objectives:
The objective of this lab is to provide understanding about the core concepts of frontend
programming for web application
Course Outcomes:
 Analyze a web page and identify its elements and attributes.
 Demonstrate the important HTML tags for designing static pages and separate
designfrom content using Cascading Style sheet
 Implement MVC and responsive design to scale well across PC, tablet and
MobilePhone
 Create web pages using HTML and Cascading Style Sheets.
Perform experiments related to the following concepts:
A) HTML
1) Introduction to HTML
2) Browsers and HTML
3) Editor’s Offline and Online
4) Tags, Attribute and Elements
5) Doctype Element
6) Comments
7) Headings, Paragraphs, and Formatting Text
8) Lists and Links
9) Images and Tables
B) CSS
1) Introduction CSS
2) Applying CSS to HTML
3) Selectors, Properties and Values
4) CSS Colours and Backgrounds
5) CSS Box Model
6) CSS Margins, Padding, and Borders
7) CSS Text and Font Properties
8) CSS General Topics

L T P C
2 0 0 0
ENVIRONMENTAL SCIENCE
Course Objectives: The aim of this course is

 Overall understanding of the natural resources.
 Basic understanding of the ecosystem and its diversity.
 Acquaintance on various environmental challenges induced due to
unplannedanthropogenic activities.
 An understanding of the environmental impact of developmental activities.
 Awareness on the social issues, environmental legislation and global treaties.
UNIT I
Multidisciplinary nature of Environmental Studies: Definition, Scope and Importance
– Sustainability: Stockholm and Rio Summit–Global Environmental Challenges:
Global warming and climate change, acid rains, ozone layer depletion, population
growth and explosion, effects. Role of information technology in environment and
human health.
Ecosystems: Concept of an ecosystem. - Structure and function of an ecosystem;
Producers, consumers and decomposers. - Energy flow in the ecosystem - Ecological
succession. - Food chains, food webs and ecological pyramids; Introduction, types,
characteristic features, structure and function of Forest ecosystem, Grassland
ecosystem, Desert ecosystem, Aquatic ecosystems.
UNIT II
Natural Resources: Natural resources and associated problems.
Forest resources: Use and over – exploitation, deforestation – Timber extraction –
Mining, dams and other effects on forest and tribal people.
Water resources: Use and over utilization of surface and ground water – Floods,
drought, conflictsover water, dams – benefits and problems.
Mineral resources: Use and exploitation, environmental effects of extracting and using
mineral resources.
Food resources: World food problems, changes caused by non-agriculture activities-
effects of modern agriculture, fertilizer-pesticide problems, water logging, salinity.
Energy resources: Growing energy needs, renewable and non-renewable energy
sources use of alternate energy sources.
Land resources: Land as a resource, land degradation, Wasteland reclamation, man
induced landslides, soil erosion and desertification; Role of an individual in
conservation of natural resources; Equitable use of resources for sustainable lifestyles.
UNIT III
Biodiversity and its conservation: Definition: genetic, species and ecosystem diversity-
classification - Value of biodiversity: consumptive use, productive use, social-
Biodiversity at national and local levels. India as a mega-diversity nation - Hot-sports
of biodiversity - Threats to biodiversity: habitat loss, man-wildlife conflicts. -

Endangered and endemic species of India – Conservation of biodiversity: conservation

of biodiversity.
UNIT IV
Environmental Pollution: Definition, Cause, effects and control measures of Air
pollution, Water pollution, Soil pollution, Noise pollution, Nuclear hazards. Role of
an individual in prevention of
pollution. - Pollution case studies, Sustainable Life Studies. Impact of Fire Crackers on
Men and his well being.
Solid Waste Management: Sources, Classification, effects and control measures of
urban and industrial solid wastes. Consumerism and waste products, Biomedical,
Hazardous and e – waste management.
UNIT V
Social Issues and the Environment: Urban problems related to energy -Water
conservation, rain water harvesting-Resettlement and rehabilitation of people; its
problems and concerns. Environmental ethics: Issues and possible solutions.
Environmental Protection Act -Air (Prevention and Control of Pollution) Act. –Water
(Prevention and control of Pollution) Act - Wildlife Protection Act -Forest
Conservation Act-Issues involved in enforcement of environmental legislation. -
Public awareness.
Environmental Management: Impact Assessment and its significance various stages of
EIA, preparation of EMP and EIS, Environmental audit. Ecotourism, Green Campus –
Green business and Green politics.
The student should Visit an Industry / Ecosystem and submit a report individually on
any issues related to Environmental Studies course and make a power point
presentation.
Text Books:
1) Environmental Studies, K. V. S. G. Murali Krishna, VGS Publishers, Vijayawada
2) Environmental Studies, R. Rajagopalan, 2nd Edition, 2011, Oxford University Press.
3) Environmental Studies, P. N. Palanisamy, P. Manikandan, A. Geetha, and K.
Manjula Rani; Pearson Education, Chennai
Reference Books:
1) Text Book of Environmental Studies, Deeshita Dave & P. Udaya Bhaskar,
CengageLearning.
2) A Textbook of Environmental Studies, Shaashi Chawla, TMH, New Delhi
3) Environmental Studies, Benny Joseph, Tata McGraw Hill Co, New Delhi
4) Perspectives in Environment Studies, Anubha Kaushik, C P Kaushik, New Age
InternationalPublishers, 2014

L T P C
III Year – II Semester
3 0 0 3
CRYPTOGRAPHY AND NETWORK SECURITY
Course Objectives:
 The concepts of classical encryption techniques and concepts of finite fields and number
theory
 Working principles and utilities of various cryptographic algorithms including secret key
cryptography, hashes and message digests, and public key algorithms
 Design issues and working principles of various authentication protocols, PKI standards
 Various secure communication standards including Kerberos, IPsec, and SSL/TLS and
email
 Concepts of cryptographic utilities and authentication mechanisms to design secure
applications
Course Outcomes:
 Identify information security goals, classical encryption techniques and acquire
fundamental knowledge on the concepts of finite fields and number theory
 Compare and apply different encryption and decryption techniques to solve problems
related to confidentiality and authentication
 Apply the knowledge of cryptographic checksums and evaluate the performance of
different message digest algorithms for verifying the integrity of varying message
sizes.
 Apply different digital signature algorithms to achieve authentication and create
secure applications
 Apply network security basics, analyze different attacks on networks and evaluate the
performance of firewalls and security protocols like SSL, IPSec, and PGP
UNIT I
Classical Encryption Techniques: Security Attacks, Services & Mechanisms, Symmetric Cipher
Model. Cyber Threats, Phishing Attack, Web Based Attacks, SQL Injection Attacks, Buffer
Overflow& Format String Vulnerabilities, TCP session hijacking, UDP Session Hijacking.
Block Ciphers: Traditional Block Cipher Structure, Block Cipher Design Principles.
UNIT II
Symmetric Key Cryptography: Data Encryption Standard (DES), Advanced Encryption Standard
(AES), Blowfish, IDEA, Block Cipher Modes of Operations. Number Theory: Prime and
Relatively Prime Numbers, Modular Arithmetic, Fermat’s and Euler’s Theorems, The Chinese
Remainder Theorem, Discrete Logarithms.
UNIT III
Public Key Cryptography: Principles, Public Key Cryptography Algorithms, RSA Algorithm,
Diffie Hellman Key Exchange, Elliptic Curve Cryptography. Cryptographic Hash Functions:
Application of Cryptographic Hash Functions, Requirements & Security, Secure Hash
Algorithm, Message Authentication Functions, Requirements & Security, HMAC & CMAC.

Digital Signatures: NIST Digital Signature Algorithm, Key Management and Distribution
UNIT IV
User Authentication: Remote User Authentication Principles, Kerberos. Electronic Mail
Security: Pretty Good Privacy (PGP) And S/MIME. IP Security: IP Security Overview, IP
Security Architecture, Authentication Header, Encapsulating Security Payload, Combining
Security Associations and Key Management.
UNIT V
Transport Level Security: Web Security Requirements, Secure Socket Layer (SSL) and
Transport Layer Security (TLS), Secure Shell (SSH) Firewalls: Characteristics, Types of
Firewalls, Placement of Firewalls, Firewall Configuration, Trusted Systems.
Text Books:
1) Cryptography and Network Security- William Stallings, Pearson Education, 7th Edition.
2) Cryptography, Network Security and Cyber Laws – Bernard Menezes, Cengage
Learning, 2010 edition.
Reference Books:
1) Cryptography and Network Security- Behrouz A Forouzan, Debdeep Mukhopadhyaya, Mc-
Graw Hill, 3rd Edition, 2015.
2) Network Security Illustrated, Jason Albanese and Wes Sonnenreich, MGH Publishers, 2003

L T P C
3 0 0 3
MACHINE LEARNING
Course Objectives:
 Gain knowledge about basic concepts of Machine Learning
 Study about different learning algorithms
 Learn about of evaluation of learning algorithms
 Learn about Dimensionality reduction
 Identify machine learning techniques suitable for a given problem
 Solve the problems using various machine learning techniques
 Apply Dimensionality reduction techniques
 Design application using machine learning techniques
UNIT I: Introduction
Definition of learning systems, Goals and applications of machine learning, Aspects of
developing a learning system: training data, concept representation, function approximation.
Inductive Classification: The concept learning task, Concept learning as search through a
hypothesis space, General-to-specific ordering of hypotheses, Finding maximally specific
hypotheses, Version spaces and the candidate elimination algorithm, Learning conjunctive
concepts, The importance of inductive bias.
UNIT II: Decision Tree Learning

Representing concepts as decision trees, Recursive induction of decision trees, Picking the best
splitting attribute: entropy and information gain, Searching for simple trees and computational
complexity, Occam's razor, Over fitting, noisy data, and pruning. Experimental Evaluation of
Learning Algorithms: Measuring the accuracy of learned hypotheses. Comparing learning
algorithms: cross-validation, learning curves, and statistical hypothesis testing.
UNIT III: Computational Learning Theory

Models of learnability: learning in the limit; probably approximately correct (PAC) learning.
Sample complexity for infinite hypothesis spaces, Vapnik-Chervonenkis dimension. Rule
Learning: Propositional and First-Order, Translating decision trees into rules, Heuristic rule
induction using separate and conquer and information gain, First-order Horn-clause induction
(Inductive Logic Programming) and Foil, Learning recursive rules, Inverse resolution, Golem,
and Progol.
UNIT IV: Artificial Neural Networks

Neurons and biological motivation, Linear threshold units. Perceptrons: representational
limitation and gradient descent training, Multilayer networks and back propagation, Hidden
layers and constructing intermediate, distributed representations. Over fitting, learning network
structure, recurrent networks. Support Vector Machines: Maximum margin linear separators.
Quadratic programming solution to finding maximum margin separators. Kernels for learning

non-linear functions.
UNIT V: Bayesian Learning

Probability theory and Bayes rule. Naive Bayes learning algorithm. Parameter smoothing.
Generative vs. discriminative training. Logistic regression. Bayes nets and Markov nets for
representing dependencies. Instance-Based Learning: Constructing explicit generalizations
versus comparing to past specific examples. k-Nearest-neighbour algorithm. Case-based
learning.
Text Books:
1) T.M. Mitchell, “Machine Learning”, McGraw-Hill, 1997.
2) Machine Learning, Saikat Dutt, Subramanian Chandramouli, Amit Kumar Das, Pearson,
2019.
Reference Books:
1) Ethern Alpaydin, “Introduction to Machine Learning”, MIT Press, 2004.
2) Stephen Marsland, “Machine Learning -An Algorithmic Perspective”, Second Edition,
Chapman and Hall/CRC Machine Learning and Pattern Recognition Series, 2014.
3) Andreas C. Müller and Sarah Guido “Introduction to Machine Learning with Python: A
Guide for Data Scientists”, Oreilly.

L T P C
3 0 0 3
INTRODUCTION TO CYBER SECURITY
Course Objectives:
 The Cyber security Course will provide the students with foundational Cyber Security
principles, Security architecture, risk management, attacks, incidents, and emerging IT
and IS technologies.
 Students will gain insight into the importance of Cyber Security and the integral role of
Cyber Security professionals.
Course Outcomes:
 Cyber Security architecture principles
 Identifying System and application security threats and vulnerabilities
 Identifying different classes of attacks
 Cyber Security incidents to apply appropriate response
 Describing risk management processes and practices
UNIT I: Introduction to Cybercrime

Introduction, Cybercrime: Definition and Origins of the Word, Cybercrime and Information
Security ,Who are Cybercriminals? , Classifications of Cybercrimes, Cybercrime: The Legal
Perspectives, Cybercrimes: An Indian Perspective, Cybercrime and the Indian ITA 2000, A
Global Perspective on Cybercrimes, Cybercrime Era: Survival Mantra for the Netizens
UNIT II: Cyber offenses

How Criminals Plan Them –Introduction, How Criminals Plan the Attacks, Social Engineering,
Cyber stalking, Cyber cafe and Cybercrimes, Botnets: The Fuel for Cybercrime, Attack Vector
Cloud Computing.
UNIT III: Cybercrime Mobile and Wireless Devices

Introduction, Proliferation of Mobile and Wireless Devices, Trends in Mobility, Credit Card
Frauds in Mobile and Wireless Computing Era, Security Challenges Posed by Mobile Devices,
Registry Settings for Mobile Devices, Authentication Service Security, Attacks on Mobile/Cell
Phones, Mobile Devices: Security Implications for Organizations, Organizational Measures for
Handling Mobile, Organizational Security Policies and Measures in Mobile Computing Era,
Laptops.
UNIT IV: Tools and Methods Used in Cybercrime

Introduction, Proxy Servers and Anonymizers, Phishing, Password Cracking, Key loggers and
Spywares, Virus and Worms, Trojan Horses and Backdoors, Steganography, DoS and DDoS
Attacks, SQL Injection, Buffer Overflow, Attacks on Wireless Networks, Phishing and Identity
Theft: Introduction, Phishing, Identity Theft (ID Theft)
UNIT V: Cybercrimes and Cyber security


Why Do We Need Cyber laws: The Indian Context, The Indian IT Act, Challenges to Indian
Law and Cybercrime Scenario in India, Consequences of Not Addressing the Weakness in
Information Technology Act, Digital Signatures and the Indian IT Act, Information Security
Planning and Governance, Information Security Policy Standards, Practices, The information
Security Blueprint, Security education, Training and awareness program, Continuing Strategies.
Text Books:
1. Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal Perspectives,
Nina Godbole, SunitBelapure, Wiley.
2. Principles of Information Security, MichealE.Whitman and Herbert J.Mattord, Cengage
Learning.
Reference Books:
1. Information Security, Mark Rhodes, Ousley, MGH

L T P C
0 0 3 1.5
CYBER SECURITY LAB
Course Objectives:
 Student to get the knowledge about audit and information security management,
which makes the student to get the real world experience.
 To learn and implement Data leakage in a website database
Course Outcomes:
 Analyze and implement Audit security policy in windows environment, create a
Demilitarized zone creation in Network environment
 Illustrate the Resource harvesting attack and mitigation, Window Patch management
policy, Trojans and mitigation strategies
 Apply the knowledge of metasploit, Access control list creation and content filtering
limiting the traffic
 Explain the Data leakage in a website database, Password policy and verification,
Patch management using MBSA tool on windows machine
 Build an Audit Policy management, Media handling policy and event log analysis and
Installation of Trojan, Network DOS attack and proof of bandwidth utilization
Exercise – 1:
Audit security policy implementation in windows environment.
Exercise – 2:
Create a Demilitarized zone creation in Network environment for information security.
Exercise – 3:
Implement Resource harvesting attack and mitigation.
Exercise – 4:
Implement Window Patch management policy.
Exercise – 5:
Knowing the Behavior of Trojans and mitigation strategies.
Exercise- 6
Create a metasploit and make it to implement.
Exercise-7
Access control list creation and content filtering limiting the traffic.
Exercise-8
Data leakage in a website database and preventive measures.
Exercise-9
Password policy implementations and verification.
Exercise-10
Patch management implementation using MBSA tool on windows machine
Exercise-11
Audit Policy management for users and computers log analysis.
Exercise-12

Media handling policy implementation and event log analysis.

Exercise-13
Installation of Trojan and study of different options.
Exercise-14
Network DOS attack and proof of bandwidth utilization and preventive steps.

L T P C
0 0 3 1.5
CRYPTOGRAPHY AND NETWORK SECURITY LAB
Course Objectives:
 To provide deeper understanding into cryptography, its application to network security,
threats/vulnerabilities to networks and countermeasures.
 To explain various approaches to Encryption techniques, strengths of Traffic
Confidentiality, Message Authentication Codes.
 To familiarize symmetric and asymmetric cryptography
 Identify basic security attacks and services
 Use symmetric and asymmetric key algorithms for cryptography
 Make use of Authentication functions
Experiments:
 Lab 1: Implementation of Caesar Cipher technique
 Lab 2: Implement the Play fair Cipher
 Lab 3: Implement the Pure Transposition Cipher
 Lab 4: Implement DES Encryption and Decryption
 Lab 5: Implement the AES Encryption and decryption
 Lab 6: Implement RSA Encryption Algorithm
 Lab 7: Implementation of Hash Functions

L T P C
III Year– II Semester
0 0 3 1.5
MACHINE LEARNING LAB
Course Objectives:
 The objective of this lab is to get an overview of the various machine learning
techniques and Implement those using Python.
Course Outcomes:
At the end of the course, the students will be able to:
 Understand complexity of Machine Learning algorithms and their limitations
 Understand modern notions in data analysis-oriented computing
 Perform experiments of Machine Learning Algorithms using real-world data
Experiments:
1. The probability that it is Friday and that a student is absent is 3 %. Since there are 5
school days in a week, the probability that it is Friday is 20 %. What is theprobability that
a student is absent given that today is Friday? Apply Baye’s rule in python to get the
result. (Ans: 15%)
2. Extract the data from database using python
3. Implement k-nearest neighbours classification using python
4. Given the following data, which specify classifications for nine combinations of VAR1
and VAR2 predict a classification for a case where VAR1=0.906 and VAR2=0.606,
using the result of k-means clustering with 3 means (i.e., 3 centroids)
VAR1 VAR2 CLASS
1.713 1.586 0
0.180 1.786 1
0.353 1.240 1
0.940 1.566 0
1.486 0.759 1
1.266 1.106 0
1.540 0.419 1
0.459 1.799 1
0.773 0.186 1
5. The following training examples map descriptions of individuals onto high, medium and low
credit-worthiness.
medium skiing design single twenties no -> highRisk
high golf trading married forties yes -> lowRisk
low speedway transport married thirties yes -> medRisk
medium football banking single thirties yes -> lowRisk
high flying media married fifties yes -> highRisk
low football security single twenties no -> medRisk
medium golf media single thirties yes -> medRisk

medium golf transport married forties yes -> lowRisk

high skiing banking single thirties yes -> highRisk
low golf unemployed married forties yes -> highRisk
Input attributes are (from left to right) income, recreation, job, status, age-group, home-owner.
Find the unconditional probability of `golf' and the conditional probability of `single' given
`medRisk' in the dataset
6. Implement linear regression using python.
7. Implement Naïve Bayes theorem to classify the English text
8. Implement an algorithm to demonstrate the significance of genetic algorithm
9. Implement the finite words classification system using Back-propagation algorithm
Text Books:
1. Machine Learning – Tom M. Mitchell, MGH
2. Fundamentals of Speech Recognition By Lawrence Rabiner and Biing – Hwang Juang.
Reference Book:
1. Machine Learning: An Algorithmic Perspective, Stephen Marsland, Taylor & Francis

L T P C
0 0 4 2
Web Application Development Using Full Stack -Frontend Development – Module -II
Course Objectives:
The objective of this lab is to build strong foundation of JavaScript which will help developer
to apply JavaScript concepts for responsive web frontend development
Course Outcomes:
 Develop major Web application tier- Client side development
 Participate in the active development of cross-browser applications through JavaScript
 Develop JavaScript applications that transition between states
Perform experiments related to the following concepts:

1) Introduction to JavaScript
2) Applying JavaScript (internal and external)
3) Understanding JS Syntax
4) Introduction to Document and Window Object
5) Variables and Operators
6) Data Types and Num Type Conversion
7) Math and String Manipulation
8) Objects and Arrays
9) Date and Time
10) Conditional Statements
11) Switch Case
12) Looping in JS
13) Functions

L T P C
2 0 0 0
EMPLOYABILITY SKILLS -I
Course Objectives: The aim of this course is

 To explore and practice basic communication skills
 To learn skills for effective discussions & team work
 To assess and improve personal grooming
Course Outcomes: By the end of this course, the student

 Establish effective communication with employers, supervisors, and co-workers
 Identify to explore their values and career choices through individual skill assessments
 Adapts positive attitude and appropriate body language
 Interpret the core competencies to succeed in professional and personal life
A list of vital employability skills from the standpoint of engineering students

with discussion how to potentially develop such skills through campus life.
1) Soft Skills: An Introduction – Definition and Significance of Soft Skills; Process,
Importance and Measurement of Soft Skill Development.
2) Self-Discovery: Discovering the Self; Setting Goals; Beliefs, Values, Attitude, Virtue.
3) Positivity and Motivation: Developing Positive Thinking and Attitude; Driving out
Negativity; Meaning and Theories of Motivation; Enhancing Motivation Levels.
4) Interpersonal Communication: Interpersonal relations; communication models,
process and barriers; team communication; developing interpersonal relationships
through effective communication; listening skills; essential formal writing skills;
corporate communication styles – assertion, persuasion, negotiation.
5) Public Speaking: Skills, Methods, Strategies and Essential tips for effective public
speaking.
6) Group Discussion: Importance, Planning, Elements, Skills assessed; Effectively
disagreeing, Initiating, Summarizing and Attaining the Objective.
7) Non-Verbal Communication: Importance and Elements; Body Language.
8) Teamwork and Leadership Skills: Concept of Teams; Building effective teams;
Concept ofLeadership and honing Leadership skills.
References Books:
1) Barun K. Mitra, Personality Development and Soft Skills, Oxford University Press,
2011.
2) S.P. Dhanavel, English and Soft Skills, Orient Blackswan, 2010.
3) R.S.Aggarwal, A Modern Approach to Verbal & Non-Verbal Reasoning,
S.Chand &Company Ltd., 2018.
4) Raman, Meenakshi & Sharma, Sangeeta, Technical Communication
Principles andPractice, Oxford University Press, 2011.
5) R.S.Aggarwal, A Modern Approach to Verbal & Non-Verbal Reasoning,
S.Chand &Company Ltd., 2018.
6) Raman, Meenakshi & Sharma, Sangeeta, Technical Communication
Principles andPractice, Oxford University Press, 2011.

L T P C
2 0 0 0
EMPLOYABILITY SKILLS -II

Course Objectives:
The main of this course is
• To learn how to make effective presentations and impressive interviews
• To learn skills for discussing and resolving problems on the work site
• To assess and improve personal grooming
• To promote safety awareness including rules and procedures on the work site
• To develop and practice self-management skills for the work site
Course Outcomes:
By the end of this course, the student
• Recite the corporate etiquette.
• Make presentations effectively with appropriate body language
• Be composed with positive attitude
• Apply their core competencies to succeed in professional and personal life
A list of vital employability skills from the standpoint of engineering students with discussion
how to potentially develop such skills through campus life.
1) Interview Skills: Interviewer and Interviewee – in-depth perspectives. Before, During and
After the Interview. Tips for Success.
2) Presentation Skills: Types, Content, Audience Analysis, Essential Tips – Before, During
and After, Overcoming Nervousness.
3) Etiquette and Manners – Social and Business.
4) Time Management – Concept, Essentials, Tips.
5) Personality Development – Meaning, Nature, Features, Stages, Models; Learning Skills;
Adaptability Skills.
6) Decision-Making and Problem-Solving Skills: Meaning, Types and Models, Group and
Ethical Decision-Making, Problems and Dilemmas in application of these skills.
7) Conflict Management: Conflict - Definition, Nature, Types and Causes; Methods of
Conflict Resolution.
8) Stress Management: Stress - Definition, Nature, Types, Symptoms and Causes; Stress
Analysis Models and Impact of Stress; Measurement and Management of Stress
9) Leadership and Assertiveness Skills: A Good Leader; Leaders and Managers; Leadership
Theories; Types of Leaders; Leadership Behavior; Assertiveness Skills.
10) Emotional Intelligence: Meaning, History, Features, Components, Intrapersonal and
Management Excellence; Strategies to enhance Emotional Intelligence.

References Books:
1. Barun K. Mitra, Personality Development and Soft Skills, Oxford University Press, 2011.
2. S.P. Dhanavel, English and Soft Skills, Orient Blackswan, 2010.
3. R.S.Aggarwal, A Modern Approach to Verbal & Non-Verbal Reasoning, S.Chand &
Company Ltd., 2018.
4. Raman, Meenakshi & Sharma, Sangeeta, Technical Communication Principles and
Practice, Oxford University Press, 2011.
5. Managing Soft Skills for Personality Development – edited by B.N.Ghosh, McGraw Hill
India, 2012.

L T P C
IV Year – I Semester
3 0 0 3
INTERNET OF THINGS
Course Outcomes:
CO1: Understand about IoT overview including requirements.
CO2: Learn IoT related protocols and specifications.
CO3: Develop a project of IoT mock-up application of their own.
UNIT I:
Introduction to the Internet of Things (IoT) Overview of WSN, IoT, IoT Conceptual Framework,
IoT Architectural View, Technology Behind IoT, Sources of IoT, M2M Communication.
IoT/M2M Systems Layers and Design Standardization, Communication Technologies, Data
Enrichment, Data Consolidation and Device Management at Gateway. Examples of IoT, Ease of
Designing and Affordability Use Case Studies: Smart Home, Smart City, Precision Agriculture
UNIT II:
IoT Sensors and Devices Sensing the Real-world using Analog and Digital Sensors, MEMS,
LIDAR, Depth, ultrasonic, etc. Industrial IoT, Automotive IoT, Actuator, RFID Technology.
Cloud computing Paradigm for Data Collection, Storage and Computing, Everything as a
Service and Cloud Service Models for IoT.
UNIT III:
IoT Networks and Protocols Introduction, Web Communication Protocols: Constrained
Applications Protocol (CoAP), Lightweight Machine-to-Machine Communication; Message
Queue Telemetry Transport (MQTT). Introduction to Internet Connectivity Principles, Internet
Connectivity, InternetBased Communication, IP Addressing in the IoT, Media Access Control,
LowPAN and LoRaWAN. Application Layer Protocols: HTTP, HTTPS, FTP and Telnet.
UNIT IV:
Advance topics in IoTSecurity and Privacy Requirements, Threat Analysis, IoT Layered
Attacker Model, Access Control and Secure Message Communication, Security Models. IoT
Hardware (development Boards): Raspberry pi, Arduino, NodeMCU, etc
UNIT V:
IoT Capstone Project Lab Experiments Network programming hands on guide. Hands-on
exercises on IoT hardware and software.
Text Books:
1) Raj Kamal, “Internet of Things: Architecture and Design Principles”. TMH Publications, 2017.
2) OvidiuVermesan& Peter Friess, “Internet of Things: Converging Technologies for Smart
Environments and Integrated Ecosystems”, River Publishers Series in Communications, 2017.
Reference Books:
1) Vijay Madisetti and ArshdeepBahga, “Internet of Things (A Hands-on-Approach
2) Internet of Things : A Hands on Approach, Arshdeep Bahga, Vijay Madisetti, University Press
2022.

L T P C
3 0 0 3
DATA SCIENCE
Course Objectives:
 Provide you with the knowledge and expertise to become a proficient data scientist
 Demonstrate an understanding of statistics and machine learning concepts that are vital
for data science
 Learn to statistically analyze a dataset
 Explain the significance of exploratory data analysis (EDA) in data science
 Critically evaluate data visualizations based on their design and use for
communicating stories from Data
Course Outcomes:
 Describe what Data Science is and the skill sets needed to be a data scientist
 Illustrate in basic terms what Statistical Inference means. Identify probability
distributions commonly used as foundations for statistical modelling, Fit a model to
data
 Use R to carry out basic statistical modelling and analysis
 Apply basic tools (plots, graphs, summary statistics) to carry out EDA
 Describe the Data Science Process and how its components interact
 Use APIs and other tools to scrap the Web and collect data
 Apply EDA and the Data Science process in a case study
UNIT I
Introduction, The Ascendance of Data, Motivating Hypothetical: Data Science, Finding Key
Connectors, The Zen of Python, Getting Python, Virtual Environments, Whitespace Formatting,
Modules, Functions, Strings, Exceptions, Lists, Tuples, Dictionaries default dict, Counters, Sets,
Control Flow, Truthiness, Sorting, List Comprehensions, Automated Testing and assert, Object
Oriented Programming, Iterables and Generators, Randomness, Regular Expressions, Functional
Programming, zip and Argument Unpacking, args and kwargs, Type Annotations, How to Write
Type Annotations.
UNIT II
Visualizing Data: mat plot lib, Bar Charts, Line Charts, Scatter plots. Linear Algebra: Vectors,
Matrices, Statistics: Describing a Single Set of Data, Correlation, Simpson’s Paradox, Some
Other Correlation Caveats, Correlation and Causation. Gradient Descent: The Idea Behind
Gradient Descent, Estimating the Gradient, Using the Gradient, Choosing the Right Step Size,
Using Gradient Descent to Fit Models, Minibatch and Stochastic Gradient Descent.
UNIT III
Getting Data: stdin and stdout, Reading Files, Scraping the Web, Using APIs, Working with
Data: Exploring Your Data Using Named Tuples, Data classes, Cleaning and Munging,

Manipulating Data, Rescaling, Dimensionality Reduction. Probability: Dependence and

Independence, Conditional Probability, Bayes’s Theorem, Random Variables, Continuous
Distributions, The Normal Distribution, The Central Limit Theorem
UNIT IV
Machine Learning: Modeling, Over fitting and Under fitting, Correctness, The Bias-Variance
Tradeoff, Feature Extraction and Selection, k-Nearest Neighbors, Naive Bayes, Simple Linear
Regression, Multiple Regression, Digression, Logistic Regression
UNIT V
Clustering: The Idea, The Model, Choosing k, Bottom-Up Hierarchical Clustering.
Recommender Systems: Manual Curation, Recommending What’s Popular, User-Based
Collaborative Filtering, Item-Based Collaborative Filtering, Matrix Factorization Data Ethics,
Building Bad Data Products, Trading Off Accuracy and Fairness, Collaboration, Interpretability,
Recommendations, Biased Data, Data Protection IPython, Mathematics, NumPy, pandas, scikit-
learn, Visualization R
Text Books:
1. Joel Grus, “Data Science From Scratch”, OReilly.
2. Allen B.Downey, “Think Stats”, OReilly.
Reference Books:
1) Doing Data Science: Straight Talk From The Frontline, 1 st Edition, Cathy O’Neil and Rachel
Schutt, O’Reilly, 2013
2) Mining of Massive Datasets, 2 nd Edition, Jure Leskovek, Anand Rajaraman and Jeffrey
Ullman, v2.1, Cambridge University Press, 2014
3) “The Art of Data Science”, 1 st Edition, Roger D. Peng and Elizabeth matsui, Lean
Publications, 2015
4) “Algorithms for Data Science”, 1 st Edition, Steele, Brian, Chandler, John, Reddy, Swarna,
springers Publications, 2016

L T P C
3 0 0 3
DISTRIBUTED SYSTEMS
Course Objectives:
 To understand the foundations of distributed systems.
 To learn issues related to clock Synchronization and the need for global state in
distributed systems
 To learn distributed mutual exclusion and deadlock detection algorithms
 To understand the significance of agreement, fault tolerance and recovery protocols in
Distributed Systems
 To learn the characteristics of peer-to-peer and distributed shared memory systems
Course Outcomes:
 Elucidate the foundations and issues of distributed systems
 Illustrate the various synchronization issues and global state for distributed systems
 Illustrate the Mutual Exclusion and Deadlock detection algorithms in distributed systems
 Describe the agreement protocols and fault tolerance mechanisms in distributed systems
 Describe the features of peer-to-peer and distributed shared memory system
UNIT I
Distributed Systems: Definition, Relation to computer system components, Motivation, Relation
to parallel systems, Message-passing systems versus shared memory systems, Primitives for
distributed communication, Synchronous versus asynchronous executions, Design issues and
challenges. A model of distributed computations: A distributed program, A model of distributed
executions, Models of communication networks, Global state, Cuts, Past and future cones of an
event, Models of process communications. Logical Time: A framework for a system of logical
clocks, Scalar time, Vector time, Physical clock synchronization: NTP.
UNIT II
Message Ordering & Snapshots: Message ordering and group communication: Message ordering
paradigms, Asynchronous execution with synchronous communication, Synchronous program
order on an asynchronous system, Group communication, Causal order (CO), Total order.
Global state and snapshot recording algorithms: Introduction, System model and definitions,
Snapshot algorithms for FIFO channels.
UNIT III
Distributed Mutex & Deadlock: Distributed mutual exclusion algorithms: Introduction –
Preliminaries – Lamport‘s algorithm – Ricart-Agrawala algorithm – Maekawa‘s algorithm –
Suzuki–Kasami‘s broadcast algorithm. Deadlock detection in distributed systems: Introduction –
System model – Preliminaries – Models of deadlocks – Knapp‘s classification – Algorithms for

the single resource model, the AND model and the OR model.
UNIT IV
Recovery & Consensus: Check pointing and rollback recovery: Introduction – Background and
definitions – Issues in failure recovery – Checkpoint-based recovery – Log-based rollback
recovery – Coordinated check pointing algorithm – Algorithm for asynchronous check pointing
and recovery. Consensus and agreement algorithms: Problem definition – Overview of results –
Agreement in a failure – free system – Agreement in synchronous systems with failures.
UNIT V
Peer-to-peer computing and overlay graphs: Introduction – Data indexing and overlays – Chord
– Content addressable networks – Tapestry. Distributed shared memory: Abstraction and
advantages – Memory consistency models –Shared memory Mutual Exclusion.
Text Books:
1. Distributed Systems Concepts and Design, George Coulouris, Jean Dollimore and Tim
Kindberg, Fifth Edition, Pearson Education, 2012.
2. Distributed computing: Principles, algorithms, and systems, Ajay D Kshemkalyani and
Mukesh Singhal, Cambridge University Press, 2011.
Reference Books:
1. Distributed Operating Systems: Concepts and Design, Pradeep K Sinha, Prentice Hall of
India, 2007.
2. Advanced concepts in operating systems. Mukesh Singhal and Niranjan G. Shivaratri,
McGraw-Hill, 1994.
3. Distributed Systems: Principles and Paradigms, Tanenbaum A.S., Van Steen M.,Pearson
Education, 2007.

L T P C
3 0 0 3
INFORMATION CODING TECHNIQUES
Course Objectives:
 The objective of this course is to provide an insight to information coding techniques,
error correction mechanism.
 Various compression techniques for text, video and image are covered for thorough
knowledge of efficient information conveying systems.
Course Outcomes:
 The aim of this course is to introduce the principles and applications of information
theory.
 The course will study how information is measured in terms of probability and
entropy.
 The students learn coding schemes, including error correcting codes, The Fourier
perspective; and extensions to wavelets, complexity, compression, and efficient coding
of audio-visual information.
UNIT I
Information and entropy information measures, Shannon’s concept of Information. Channel
coding, channel mutual information capacity (BW). Theorem for discrete memory less channel,
information capacity theorem, Error detecting and error correcting codes.
UNIT II
Types of codes: block codes, Hamming and Lee metrics, description of linear block codes, parity
check Codes, cyclic code, Masking techniques.
UNIT III
Compression: loss less and lossy, Huffman codes, LZW algorithm, Binary Image c compression
schemes, run length encoding, CCITT group 3 1- D Compression, CCITT group 3 2D
compression, CCITT group 4 2DCompression.
UNIT IV
Convolutional codes, sequential decoding. Video image Compression: CITT H 261 Video
coding algorithm, audio (speech) Compression. Cryptography and cipher.
UNIT V
Case study of CCITT group 3 1-DCompression, CCITT group 3 2D compression. Case Study of

Advanced compression technique and Audio compression.
Text Books:
1. Monica Borda, Fundamentals in information theory and coding, Springer, 2011.
2. Singh and Sapre, Communication Systems: Analog and digital, Tata McGraw Hill, 2007.
Reference Books:
1. Fred Halsall, Multimedia Communications, Addition-Wesley, 2001.
2. Ranjan Bose, Information Theory, Coding and Cryptography, Tata McGraw Hill, 2001.
3. Prabhat K Andleigh and Kiran Thakrar, Multimedia system Design, Prentice Hall PTR, 1996

L T P C
3 0 0 3
MOBILE AND WIRELESS SECURITY
Course Objectives:
This skill oriented course equips the system Administrators with the skills required to protect &
recover the computer systems & networks from various security threats.
Course Outcomes:
 Understand the security issues in wireless and mobile networks.
 Implementation of real-time wireless attacks and programming the defence mechanisms.
 Strong network programming for wireless and mobile devices.
UNIT I
Introduction to Wireless Networks and Mobile Networks: Wireless Networks and its
Architectures, Mobile Networks, Introduction to 2G, 3G and 4G networks, Wireless Algorithms,
6LOWPAN Network, Mobile System Architectures.
UNIT II
Wireless Network Security: Introduction to Wireless Networks Security, Overview of Cellular
Systems, GSM and MTS Security & Attacks, Analysis of Threats and Application
Requirements, WLAN security, Attacks on 802.11 networks.
UNIT III
Security in Telecommunication Systems and Wireless Sensor Networks: Security in Cellular
VoIP Services, SPIT Detection, Vulnerabilities in Cellular Services, Mobile Application
Security, Ad-hoc networks, Wireless Networks Security Components, 3G and 4G security,
Securing Sensor Motes and Network.
UNIT IV
Security in Mobile Application and Mobile Networks: Secure MANET Routing, Security
Infrastructure for Wireless Mobile Networks: Keys and Certificate Management, Security of
Mobile Codes, Malicious Mobile Applications, And Mobile BOTS.
UNIT V
Limitations of Wireless Networks and its Security: Location Based Security & Privacy, Security
in Hybrid System, WIFI Vs LTE, Introduction to LiFi Security.
Text Books:
1) K. Makki, S. Makki, P. Reiher et al., Mobile and Wireless Network Security and Privacy,
Springer (1st Edition), Springer US, 2007. ISBN 978-0387710587.
2) Jones Barlett,Sean Phillip, Wireless and Mobile Device Security (1st Edition), Jones &
Bartlett Learning,2015. ISBN 978-1284059274.
Reference Books:
1) H. Chaouchi, M. Laurent, Wireless and Mobile Network Security, (1st Edition), Wiley,
2009. ISBN 978-1848211179.

L T P C
3 0 0 3
CYBER CRIME INVESTIGATION AND DIGITAL FORENSICS
Course Objectives:
 Able to identify security risks and take preventive steps
 To understand the forensics fundamentals.
 To understand the evidence capturing process.
 To understand the preservation of digital evidence.
Course Outcomes:
 Acquire the definition of computer forensics fundamentals.
 Describe the types of computer forensics technology
 Analyze various computer forensics systems.
 Illustrate the methods for data recovery, evidence collection and data seizure.
 Summarize duplication and preservation of digital evidence.
UNIT I
Introduction: Introduction and Overview of Cyber Crime, Nature and Scope of Cyber Crime,
Types of Cyber Crime: Social Engineering, Categories of Cyber Crime, Property Cyber Crime.
UNIT II
Cyber Crime Issues: Unauthorized Access to Computers, Computer Intrusions, White collar
Crimes, Viruses and Malicious Code, Internet Hacking and Cracking, Virus Attacks,
Pornography, Software Piracy, Intellectual Property, Mail Bombs, Exploitation, Stalking and
Obscenity in Internet, Digital laws and legislation, Law Enforcement Roles and Responses.
UNIT III
Investigation: Introduction to Cyber Crime Investigation, Investigation Tools, e- Discovery,
Digital Evidence Collection, Evidence Preservation, E-Mail Investigation, E-Mail Tracking, IP
Tracking, E-Mail Recovery, Hands on Case Studies. Encryption and Decryption Methods,
Search and Seizure of Computers, Recovering Deleted Evidences, Password Cracking.
UNIT IV
Digital Forensics: Introduction to Digital Forensics, Forensic Software and Hardware, Analysis
and Advanced Tools, Forensic Technology and Practices, Forensic Ballistics and Photography,
Face, Iris and Fingerprint Recognition, Audio Video Analysis, Windows System Forensics,
Linux System Forensics, Network Forensics.
UNIT V
Role of CRET-In Cyber Security: Computer Security Incident Response (Reactive) –
Computer Security Incident Prevention (Proactive) – Security Quality Management Services,
CERT-In Security Guidelines- Web server, database server, Intrusion Detection system,

Routers, Standard alone system, networked System, IT Security polices for government and
critical sector organizations.
Text Books:
1. Nihad A. Hassan, ―Digital Forensics Basics: A Practical Guide Using Windows OS
Paperback‖, February 26, 2019.
Reference Books:
1. Nelson Phillips and EnfingerSteuart, ―Computer Forensics and
Investigations‖, Cengage Learning, New Delhi, 2009.
2. Kevin Mandia, Chris Prosise, Matt Pepe, ―Incident Response and Computer
Forensics―, Tata McGraw-Hill, New Delhi, 2006.
3. Robert M Slade,‖ Software Forensics‖, Tata McGraw - Hill, New Delhi, 2005

L T P C
3 0 0 3
CLOUD COMPUTING
Course Objectives:
 To implement Virtualization
 To implement Task Scheduling algorithms
 Apply Map-Reduce concept to applications
 To build Private Cloud
 Broadly educate to know the impact of engineering on legal and societal issues involved
Course Outcomes:
 Interpret the key dimensions of the challenge of Cloud Computing
 Examine the economics, financial, and technological implications for selecting cloud
computing for own organization
 Assessing the financial, technological, and organizational capacity of employer’s for
actively initiating and installing cloud-based applications
 Evaluate own organizations’ needs for capacity building and training in cloud
computing related IT areas
 Illustrate Virtualization for Data-Center Automation
UNIT I
Introduction: Network centric computing, Network centric content, peer-to –peer systems, cloud
computing delivery models and services, Ethical issues, Vulnerabilities, Major challenges for
cloud computing. Parallel and Distributed Systems: introduction, architecture, distributed
systems, communication protocols, logical clocks, message delivery rules, concurrency, and
model concurrency with Petri Nets.
UNIT II
Cloud Infrastructure: At Amazon, The Google Perspective, Microsoft Windows Azure, Open
Source Software Platforms, Cloud storage diversity, Inter cloud, energy use and ecological
impact, responsibility sharing, user experience, Software licensing, Cloud Computing :
Applications and Paradigms: Challenges for cloud, existing cloud applications and new
opportunities, architectural styles, workflows, The Zookeeper, HPC on cloud.
UNIT III
Cloud Resource virtualization: Virtualization, layering and virtualization, virtual machine
monitors, virtual machines, virtualization- full and para, performance and security isolation,
hardware support for virtualization, Case Study: Xen, vBlades, Cloud Resource Management
and Scheduling: Policies and Mechanisms, Applications of control theory to task scheduling,
Stability of a two-level resource allocation architecture, feedback control based on dynamic
thresholds, coordination, resource bundling, scheduling algorithms, fair queuing, start time fair
queuing, cloud scheduling subject to deadlines, Scheduling Map Reduce applications, Resource
management and dynamic application scaling.
UNIT IV
Storage Systems: Evolution of storage technology, storage models, file systems and database,
distributed file systems, general parallel file systems. Google file system. Apache Hadoop, Big

Table, Megastore (text book 1), Amazon Simple Storage Service(S3) (Text book 2), Cloud
Security: Cloud security risks, security – a top concern for cloud users, privacy and privacy
impact assessment, trust, OS security, Virtual machine security, Security risks.
UNIT V
Cloud Application Development: Amazon Web Services : EC2 – instances, connecting clients,
security rules, launching, usage of S3 in Java, Cloud based simulation of a Distributed trust
algorithm, Cloud service for adaptive data streaming ( Text Book 1), Google: Google App
Engine, Google Web Toolkit (Text Book 2), Microsoft: Azure Services Platform, Windows live,
Exchange Online, Share Point Services, Microsoft Dynamics CRM (Text Book 2)
Text Books:
1) Cloud Computing, Theory and Practice,1st Edition, Dan C Marinescu, MK Elsevier
publisher ,2013
2) 2) Cloud Computing, A Practical Approach, 1st Edition, Anthony T Velte, Toby J Velte,
Robert Elsenpeter, TMH, 2017
Reference Books:
1) Mastering Cloud Computing, Foundations and Application Programming,1st Edition, Raj
Kumar Buyya, Christen vecctiola, S Tammarai selvi, TMH,2013
2) Essential of Cloud Computing, 1st Edition, K Chandrasekharan, CRC Press, 2014.
3) Cloud Computing, A Hands on Approach, Arshdeep Bahga, Vijay Madisetti, Universities
Press, 2014.

L T P C
3 0 0 3
MEAN STACK TECHNOLOGIES
Course Objectives:
 Translate user requirements into the overall architecture and implementation of new
systems and Manage Project and coordinate with the Client
 Writing optimized front end code HTML and JavaScript
 Monitor the performance of web applications & infrastructure and Troubleshooting web
application with a fast and accurate a resolution
 Design and implementation of Robust and Scalable Front End Applications
 Enumerate the Basic Concepts of Web & Markup Languages
 Develop web Applications using Scripting Languages & Frameworks
 Make use of Express JS and Node JS frameworks
 Illustrate the uses of web services concepts like restful, react js
 Apply Deployment Techniques & Working with cloud platform
UNIT I:
Introduction to Web: Internet and World Wide Web, Domain name service, Protocols: HTTP,
FTP, SMTP. Html5 concepts, CSS3, Anatomy of a web page. XML: Document type Definition,
XML schemas, Document object model, XSLT, DOM and SAX Approaches.
UNIT II:
JavaScript: The Basic of JavaScript: Objects, Primitives Operations and Expressions, Control
Statements, Arrays, Functions, Constructors, Pattern Matching using Regular Expressions.
Angular Java Script Angular JS Expressions: ARRAY, Objects, $eval, Strings, Angular JS
Form Validation & Form Submission, Single Page Application development using Angular JS.
UNIT III:
Node.js: Introduction, Advantages, Node.js Process Model, Node JS Modules. Express.js:
Introduction to Express Framework, Introduction to Nodejs , What is Nodejs, Getting Started
with Express, Your first Express App, Express Routing, Implementing MVC in Express,
Middleware, Using Template Engines, Error Handling , API Handling , Debugging, Developing
Template Engines, Using Process Managers, Security & Deployment.
UNIT IV:
RESTful Web Services: Using the Uniform Interface, Designing URIs, Web Linking,
Conditional Requests. React Js: Welcome to React, Obstacles and Roadblocks, React’s Future,
Keeping Up with the Changes, Working with the Files, Pure React, Page Setup, The Virtual
DOM, React Elements, ReactDOM, Children, Constructing Elements with Data, React
Components, DOM Rendering, Factories.

UNIT V:
Mongo DB: Introduction, Architecture, Features, Examples, Database Creation & Collection in
Mongo DB. Deploying Applications: Web hosting & Domains, Deployment Using Cloud
Platforms.
Text Books:
1) Programming the World Wide Web, Robet W Sebesta, 7ed, Pearson.
2) Web Technologies, Uttam K Roy, Oxford
3) Pro Mean Stack Development, ELadElrom, Apress
4) Restful Web Services Cookbook, Subbu Allamraju, O’Reilly
5) JavaScript & jQuery the missing manual, David sawyer mcfarland, O’Reilly
6) Web Hosting for Dummies, Peter Pollock, John Wiley Brand
Reference Books:
1) Ruby on Rails up and Running, Lightning fast Web development, Bruce Tate, Curt Hibbs,
Oreilly (2006).
2) Programming Perl, 4ed, Tom Christiansen, Jonathan Orwant, Oreilly (2012).
3) Web Technologies, HTML, JavaScript, PHP, Java, JSP, XML and AJAX, Black book, Dream
Tech.
4) An Introduction to Web Design, Programming, Paul S Wang, Sanda S Katila, Cengage
Learning.
5) Express.JS Guide,The Comprehensive Book on Express.js, Azat Mardan, Lean Publishing.

L T P C
3 0 0 3
AD-HOC AND SENSOR NETWORKS
Course Objectives:
 Architect sensor networks for various application setups
 Devise appropriate data dissemination protocols and model links cost
 Understanding of the fundamental concepts of wireless sensor networks and has a basic
knowledge of the various protocols at various layers
 Evaluate the performance of sensor networks and identify bottlenecks
 Evaluate the principles and characteristics of mobile ad hoc networks (MANETs) and
what distinguishes them from infrastructure-based networks
 Determine the principles and characteristics of wireless sensor networks
 Discuss the challenges in designing MAC, routing and transport protocols for wireless ad-
hoc sensor networks
 Illustrate the various sensor network Platforms, tools and applications
 Demonstrate the issues and challenges in security provisioning and also familiar with the
mechanisms for implementing security and trust mechanisms in MANETs and WSNs
UNIT I:
Introduction to Ad Hoc Wireless Networks- Cellular and Ad Hoc Wireless Networks,
Characteristics of MANETs, Applications of MANETs, Issues and Challenges of MANETs, Ad
Hoc Wireless Internet, MAC protocols for Ad hoc Wireless Networks-Issues, Design Goals and
Classifications of the MAC Protocols.
UNIT II:
Routing Protocols for Ad Hoc Wireless Networks- Issues in Designing a Routing Protocol,
Classifications of Routing Protocols, Topology-based versus Position-based Approaches, Issues
and design goals of a Transport layer protocol, Classification of Transport layer solutions, TCP
over Ad hoc Wireless Networks, Solutions for TCP over Ad Hoc Wireless Networks, Other
Transport layer protocols.
UNIT III:
Security protocols for Ad hoc Wireless Networks- Security in Ad hoc Wireless Networks,
Network Security Requirements, Issues and Challenges in Security Provisioning, Network
Security Attacks, Key Management, Secure Routing in Ad hoc Wireless Networks, Cooperation
in MANETs, Intrusion Detection Systems.
UNIT IV:
Basics of Wireless Sensors and Applications- The Mica Mote, Sensing and Communication
Range, Design Issues, Energy Consumption, Clustering of Sensors, Applications, Data Retrieval
in Sensor Networks-Classification of WSNs, MAC layer, Routing layer, Transport layer,
Highlevel application layer support, Adapting to the inherent dynamic nature of WSNs.

UNIT V:
Security in WSNs- Security in WSNs, Key Management in WSNs, Secure Data Aggregation in
WSNs, Sensor Network Hardware-Components of Sensor Mote, Sensor Network Operating
Systems–TinyOS, LA-TinyOS, SOS, RETOS, Imperative Language-nesC, Dataflow Style
Language- TinyGALS, Node-Level Simulators, NS-2 and its sensor network extension,
TOSSIM.
Text Books:
1) Ad Hoc Wireless Networks – Architectures and Protocols, C. Siva Ram Murthy, B. S.
Murthy, Pearson Education, 2004.
2) Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio Dharma
P.Aggarwal, World Scientific Publications / Cambridge University Press, March 2006.
3) Wireless Sensor Networks – Principles and Practice, Fei Hu, Xiaojun Cao, An Auerbach
book, CRC Press, Taylor & Francis Group, 2010.
Reference Books:
1) Wireless Sensor Networks: An Information Processing Approach, Feng Zhao, Leonidas
Guibas, Elsevier Science imprint, Morgan Kauffman Publishers, 2005, rp2009.
2) Wireless Ad hoc Mobile Wireless Networks – Principles, Protocols and Applications, Subir
Kumar Sarkar, et al., Auerbach Publications, Taylor & Francis Group, 2008.
3) Ad hoc Networking, Charles E.Perkins, Pearson Education, 2001.
4) Wireless Ad hoc Networking, Shih-Lin Wu, Yu-Chee Tseng, Auerbach Publications, Taylor
& Francis Group, 2007.

L T P C
3 0 0 3
MALWARE ANALYSIS & REVERSE ENGINEERING
Course Objectives:
 Translate user requirements into the overall architecture and implementation of new
systems and Manage Project and coordinate with the Client
 Writing optimized front end code HTML and JavaScript
 Monitor the performance of web applications & infrastructure and Troubleshooting web
application with a fast and accurate a resolution
 Design and implementation of Robust and Scalable Front End Applications
 Enumerate the Basic Concepts of Web & Markup Languages
 Develop web Applications using Scripting Languages & Frameworks
 Make use of Express JS and Node JS frameworks
 Illustrate the uses of web services concepts like restful, react js
 Apply Deployment Techniques & Working with cloud platform
UNIT I:
Introduction to Web: Internet and World Wide Web, Domain name service, Protocols: HTTP,
FTP, SMTP. Html5 concepts, CSS3, Anatomy of a web page. XML: Document type Definition,
XML schemas, Document object model, XSLT, DOM and SAX Approaches.
UNIT II:
JavaScript: The Basic of JavaScript: Objects, Primitives Operations and Expressions, Control
Statements, Arrays, Functions, Constructors, Pattern Matching using Regular Expressions.
Angular Java Script Angular JS Expressions: ARRAY, Objects, $eval, Strings, Angular JS
Form Validation & Form Submission, Single Page Application development using Angular JS.
UNIT III:
Node.js: Introduction, Advantages, Node.js Process Model, Node JS Modules. Express.js:
Introduction to Express Framework, Introduction to Nodejs , What is Nodejs, Getting Started
with Express, Your first Express App, Express Routing, Implementing MVC in Express,
Middleware, Using Template Engines, Error Handling , API Handling , Debugging, Developing
Template Engines, Using Process Managers, Security & Deployment.
UNIT IV:
RESTful Web Services: Using the Uniform Interface, Designing URIs, Web Linking,
Conditional Requests. React Js: Welcome to React, Obstacles and Roadblocks, React’s Future,
Keeping Up with the Changes, Working with the Files, Pure React, Page Setup, The Virtual
DOM, React Elements, ReactDOM, Children, Constructing Elements with Data, React
Components, DOM Rendering, Factories.

UNIT V:
Mongo DB: Introduction, Architecture, Features, Examples, Database Creation & Collection in
Mongo DB. Deploying Applications: Web hosting & Domains, Deployment Using Cloud
Platforms.
Text Books:
1) Programming the World Wide Web, Robet W Sebesta, 7ed, Pearson.
2) Web Technologies, Uttam K Roy, Oxford
3) Pro Mean Stack Development, ELadElrom, Apress
4) Restful Web Services Cookbook, Subbu Allamraju, O’Reilly
5) JavaScript & jQuery the missing manual, David sawyer mcfarland, O’Reilly
6) Web Hosting for Dummies, Peter Pollock, John Wiley Brand
Reference Books:
1) Ruby on Rails up and Running, Lightning fast Web development, Bruce Tate, Curt Hibbs,
Oreilly (2006).
2) Programming Perl, 4ed, Tom Christiansen, Jonathan Orwant, Oreilly (2012).
3) Web Technologies, HTML, JavaScript, PHP, Java, JSP, XML and AJAX, Black book, Dream
Tech.
4) An Introduction to Web Design, Programming, Paul S Wang, Sanda S Katila, Cengage
Learning.
5) Express.JS Guide,The Comprehensive Book on Express.js, Azat Mardan, Lean Publishing.

L T P C
3 0 0 3
CYBER LAWS AND SECURITY POLICIES
Course Objectives:
To understand the computer security issues
To make secure system planning, policies
UNIT- I : Introduction to Computer Security:

Definition, Threats to security, Government requirements, Information Protection and Access
Controls, Computer security efforts, Standards, Computer Security mandates and legislation,
Privacy considerations, International security activity.
UNIT-II: Secure System Planning

and administration, Introduction to the orange book, Security policy requirements,
accountability, assurance and documentation requirements, Network Security, The Red book and
Government network evaluations.
UNIT-III: Information security policies and procedures:

Corporate policies- Tier 1, Tier 2 and Tier3 policies – process management-planning and
preparation-developing policies-asset classification policy developing standards.
UNIT- IV: Information security:

fundamentals-Employee responsibilities- information classification Information handling- Tools
of information security- Information processing-secure program administration.
UNIT-V: Organizational and Human Security:

Adoption of Information Security Management Standards, Human Factors in Security- Role of
information security professionals.
TEXT BOOK:
1. Debby Russell and Sr. G. T Gangemi, “Computer Security Basics (Paperback)”, 2nd
Edition, O’ Reilly Media, 2006.
REFERENCES:
1. Thomas R. Peltier, “Information Security policies and procedures: A Practitioner’s
Reference”, 2nd Edition Prentice Hall, 2004.
2. Kenneth J. Knapp, “Cyber Security and Global Information Assurance: Threat Analysis
and Response Solutions”, IGI Global, 2009.
3. Thomas R Peltier, Justin Peltier and John blackley, ”Information Security
Fundamentals”, 2nd Edition, Prentice Hall, 1996
4. Jonathan Rosenoer, “Cyber law: the Law of the Internet”, Springer-verlag, 1997
5. James Graham, “Cyber Security Essentials” Averbach Publication T & F Group

L T P C
3 0 0 3
INTRUSION DETECTION AND PREVENTION SYSTEM
Course Objectives:
 Understand when, where, how, and why to apply Intrusion Detection tools and techniques
in order to improve the security posture of an enterprise.
 Apply knowledge of the fundamentals and history of Intrusion Detection in order to avoid
common pitfalls in the creation and evaluation of new Intrusion Detection Systems
 Analyze intrusion detection alerts and logs to distinguish attack types from false alarms
 Explain the fundamental concepts of Network Protocol Analysis and demonstrate the skill
to capture and analyze network packets.
 Use various protocol analyzers and Network Intrusion Detection Systems as security tools
to detect network attacks and troubleshoot network problems.
UNIT I:
History of Intrusion detection, Audit, Concept and definition , Internal and external threats to
data, attacks, Need and types of IDS, Information sources Host based information sources,
Network based information sources.
UNIT II:
Intrusion Prevention Systems, Network IDs protocol based IDs ,Hybrid IDs, Analysis schemes,
thinking about intrusion. A model for intrusion analysis , techniques Responses requirement of
responses, types of responses mapping responses to policy Vulnerability analysis, credential
analysis non credential analysis.
UNIT III:
Introduction to Snort, Snort Installation Scenarios, Installing Snort, Running Snort on Multiple
Network Interfaces, Snort Command Line Options. Step-By-Step Procedure to Compile and
Install Snort Location of Snort Files, Snort Modes Snort Alert Modes.
UNIT IV:
Working with Snort Rules, Rule Headers, Rule Options, The Snort Configuration File etc. Plug-
in, Preprocessors and Output Modules, Using Snort with MySQL
UNIT V:
Using ACID and Snort Snarf with Snort, Agent development for intrusion detection,
Architecture models of IDs and IPs.
Text Books:
1. Rafeeq Rehman : “ Intrusion Detection with SNORT, Apache, MySQL, PHP and ACID,” 1st
Edition, Prentice Hall , 2003.

Reference Books:
1. Christopher Kruegel,Fredrik Valeur, Giovanni Vigna: “Intrusion Detection and Correlation
Challenges and Solutions”, 1st Edition,Springer, 2005.
2. Carl Endorf, Eugene Schultz and Jim Mellander “ Intrusion Detection & Prevention”, 1st
Edition, Tata McGraw-Hill, 2004.
3. Stephen Northcutt, Judy Novak : “Network Intrusion Detection”, 3 rd Edition, New Riders
Publishing, 2002.
4. T. Fahringer, R. Prodan, “A Text book on Grid Application Development and Computing
Environment”. 6th Edition, KhannaPublihsers, 2012.

L T P C
3 0 0 3
BIG DATA ANALYTICS
Course Objectives:
 To optimize business decisions and create competitive advantage with Big Data
analytics
 To learn to analyze the big data using intelligent techniques
 To introduce programming tools PIG & HIVE in Hadoop echo system
 Illustrate big data challenges in different domains including social media,
transportation, finance and medicine
 Use various techniques for mining data stream
 Design and develop Hadoop
 Identify the characteristics of datasets and compare the trivial data and big data for
various applications
 Explore the various search methods and visualization techniques
UNIT I:
Introduction: Introduction to big data: Introduction to Big Data Platform, Challenges of
Conventional Systems, Intelligent data analysis, Nature of Data, Analytic Processes and Tools,
Analysis vs Reporting.
UNIT II:
Stream Processing: Mining data streams: Introduction to Streams Concepts, Stream Data Model
and Architecture, Stream Computing, Sampling Data in a Stream, Filtering Streams, Counting
Distinct Elements in a Stream, Estimating Moments, Counting Oneness in a Window, Decaying
Window, Real time Analytics Platform (RTAP) Applications, Case Studies - Real Time
Sentiment Analysis - Stock Market Predictions.
UNIT III:
Introduction to Hadoop: Hadoop: History of Hadoop, the Hadoop Distributed File System,
Components of Hadoop Analysing the Data with Hadoop, Scaling Out, Hadoop Streaming,
Design of HDFS, Java interfaces to HDFS Basics, Developing a Map Reduce Application, How
Map Reduce Works, Anatomy of a Map Reduce Job run, Failures, Job Scheduling, Shuffle and
Sort, Task execution, Map Reduce Types and Formats, Map Reduce Features Hadoop
environment.
UNIT IV:
Frameworks and Applications: Frameworks: Applications on Big Data Using Pig and Hive,
Data processing operators in Pig, Hive services, HiveQL, Querying Data in Hive, fundamentals
of HBase and ZooKeeper.

UNIT V:
Predictive Analytics and Visualizations: Predictive Analytics, Simple linear regression, Multiple
linear regression, Interpretation of regression coefficients, Visualizations, Visual data analysis
techniques, interaction techniques, Systems and application
Text Books:
1. Tom White, “Hadoop: The Definitive Guide”, Third Edition, O’reilly Media, Fourth
Edition, 2015.
2. Chris Eaton, Dirk DeRoos, Tom Deutsch, George Lapis, Paul Zikopoulos, “Understanding
Big Data: Analytics for Enterprise Class Hadoop and Streaming Data”, McGrawHill
Publishing, 2012.
3. Anand Rajaraman and Jeffrey David Ullman, “Mining of Massive Datasets”, CUP, 2012
Reference Books:
1. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data
Streams with Advanced Analytics”, John Wiley& sons, 2012.
2. Paul Zikopoulos, DirkdeRoos, Krishnan Parasuraman, Thomas Deutsch, James Giles, David
Corrigan, “Harness the Power of Big Data:The IBM Big Data Platform”, Tata McGraw Hill
Publications, 2012.
3. Arshdeep Bahga and Vijay Madisetti, “Big Data Science & Analytics: A Hands On
Approach “, VPT, 2016.
4. Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science and its
Applications (WILEY Big Data Series)”, John Wiley & Sons, 2014.

L T P C
3 0 0 3
DATA PRIVACY
Course Outcomes (CO):

At the end of the course, students will be able to –
1. comprehend the concepts of web security and privacy, hardware and software
vulnerabilities and protection mechanisms
2. realize the need for data privacy and the related technologies
3. derive and demonstrate the protection mechanisms against several data related
attacks
Unit I:
Introduction to Security: Cryptography, Web security, Hardware and software vulnerabilities
Unit II:
Data Privacy: Data localization issues, Managing personally identifiable or sensitive
information, Hippocratic databases, Differential privacy, Privacy preserving data analysis
Unit III
Basic concepts and definitions, objectives, disclosure control and inference of entities, models of
protection like null map, k-map, wrong-map
Unit IV
Data Explosion: Availability vs. Storage vs. Collection trade-off, barriers to distribution,
mathematical models for sharing practices and policies for computing privacy and risk
measurements
Unit V
Demographics and Uniqueness, data linking, data profiling, data privacy attacks
Text Books:
1. Stallings, W. Cryptography and Network Security. Pearson Education India.
2. Giannotti, F., &Pedreschi, D. (Eds.). Mobility, data mining and privacy: Geographic
knowledge discovery. Springer Science & Business Media.
3. Bygrave, L. A. Data privacy law: an international perspective (Vol. 63). Oxford: Oxford
University Press.
4. Scoble, R., Israel, S., &Benioff, M. R.. Age of context: Mobile, sensors, data and the future
of privacy. USA: Patrick Brewster Press.
5. Bendat, J. S., &Piersol, A. G. Random data analysis and measurement procedures.

L T P C
3 0 0 3
ETHICAL HACKING
Course Objectives:
The security of digital infrastructure is an utmost need for an organization. The variety of
security attacks makes it compulsion to analyse the way newer attacks are formed and their
understanding is important to prevent or detect such attacks. The ethical hacking covers the
theory and practices of finding the vulnerabilities through forming the different attacks and then
defining the appropriate security policy including the action to detect or prevent the attacks and
thus reduce the damages.
Course Outcomes: On completion of this course, the students will be able to

 Describe and understand the basics of the ethical hacking
 Perform the foot printing and scanning
 Demonstrate the techniques for system hacking
 Characterize the malware and their attacks and detect and prevent them
 Determine the signature of different attacks and prevent them
 Detect and prevent the security attacks in different environments
UNIT I: Introduction To Hacking

Introduction to Hacking – Important Terminologies – Penetration Test – Vulnerability
Assessments versus Penetration Test – Pre-Engagement – Rules of Engagement -Penetration
Testing Methodologies – OSSTMM – NIST – OWASP – Categories of Penetration Test – Types
of Penetration Tests – Vulnerability Assessment Summary -Reports.
UNIT II:
The Technical Foundations of Hacking: The Attacker’s Process, The Ethical Hacker’s Process,
Security and the Stack.
Footprinting and scanning : Information Gathering, Determining the Network Range,
Identifying Active Machines, Finding Open Ports and Access Points, OS Fingerprinting
Services, Mapping the Network Attack Surface
UNIT III:
Vulnerability Data Resources – Exploit Databases – Network Sniffing – Types of Sniffing -
Promiscuous versus Nonpromiscuous Mode – MITM Attacks – ARP Attacks – Denial of Service
Attacks -Hijacking Session with MITM Attack – SSL Strip: Stripping HTTPS Traffic -DNS
Spoofing – ARP Spoofing Attack Manipulating the DNS Records – DHCP Spoofing -Remote
Exploitation – Attacking Network Remote Services – Overview of Brute Force Attacks –
Traditional Brute Force – Attacking SMTP – Attacking SQL Servers – Testing for Weak
Authentication.
UNIT IV:
Malware Threats: Viruses and Worms, Trojans, Covert Communication, Keystroke Logging and
Spyware, Malware Counter measures.

Sniffers, Session Hijacking and Denial of Service:

Sniffers, Session Hijacking, Denial of Service and Distributed Denial of Service.
UNIT V:
Wireless Hacking – Introducing Aircrack- Cracking the WEP – Cracking a WPA/WPA2
Wireless Network Using Aircrack-ng – Evil Twin Attack – Causing Denial of Service on the
Original AP – Web Hacking – Attacking the Authentication – Brute Force and Dictionary
Attacks – Types of Authentication – Log-In Protection Mechanisms – Captcha Validation Flaw
– Captcha RESET Flaw – Manipulating User-Agents to Bypass Captcha and Other Protection –
Authentication Bypass Attacks – Testing for the Vulnerability – Automating It with Burp Suite –
Session Attacks – SQL Injection Attacks – XSS (Cross-Site Scripting) -Types of Cross-Site
Scripting – Cross-Site Request Forgery (CSRF) – SSRF Attacks.
Text Books:
 Rafay Baloch, “Ethical Hacking and Penetration Testing Guide”, CRC Press, 2014.
 Certified Ethical Hacker, Version 9, Second Edition, Michael Gregg, Pearson IT
Certification
 Hacking the Hacker, Roger Grimes, Wiley
Reference Books:
 The Unofficial Guide to Ethical Hacking, Ankit Fadia, Premier Press
 Kevin Beaver, “Ethical Hacking for Dummies”, Sixth Edition, Wiley, 2018.
 Jon Erickson , “Hacking: The Art of Exploitation”, Second Edition, Rogunix, 2007.

L T P C
3 0 0 3
UNIVERSAL HUMAN VALUES
Course Objectives:
 To create an awareness on Engineering Ethics and Human Values.
 To understand social responsibility of an engineer.
 To appreciate ethical dilemma while discharging duties in professional life.

 Understand the significance of value inputs in a classroom and start applying them in their
life and profession
 Distinguish between values and skills, happiness and accumulation of physical facilities,
the Self and the Body, Intention and Competence of an individual, etc.
 Understand the role of a human being in ensuring harmony in society and nature.
 Distinguish between ethical and unethical practices, and start working out the strategy to
actualize a harmonious environment wherever they work.
UNIT I: Introduction to Value Education

1. Value Education, Definition, Concept and Need for Value Education.
2. The Content and Process of Value Education.
3. Basic Guidelines for Value Education.
4. Self-exploration as a means of Value Education.
5. Happiness and Prosperity as parts of Value Education.
UNIT II: Harmony in the Human Being

1. Human Being is more than just the Body.
2. Harmony of the Self (‘I’) with the Body.
3. Understanding Myself as Co-existence of the Self and the Body.
4. Understanding Needs of the Self and the needs of the Body.
5. Understanding the activities in the Self and the activities in the Body.
UNIT III: Harmony in the Family and Society and Harmony in the Nature
1. Family as a basic unit of Human Interaction and Values in Relationships.
2. The Basics for Respect and today’s Crisis: Affection, e, Guidance, Reverence, Glory,
Gratitude and Love.
3. Comprehensive Human Goal: The Five Dimensions of Human Endeavour.
4. Harmony in Nature: The Four Orders in Nature.
5. The Holistic Perception of Harmony in Existence.
UNIT IV: Social Ethics

1. The Basics for Ethical Human Conduct.
2. Defects in Ethical Human Conduct.
3. Holistic Alternative and Universal Order.
4. Universal Human Order and Ethical Conduct.

5. Human Rights violation and Social Disparities.
UNIT V: Professional Ethics

1. Value based Life and Profession.
2. Professional Ethics and Right Understanding.
3. Competence in Professional Ethics.
4. Issues in Professional Ethics – The Current Scenario.
5. Vision for Holistic Technologies, Production System and Management Models.
Text Books:
1. A.N Tripathy, New Age International Publishers, 2003.
2. Bajpai. B. L , , New Royal Book Co, Lucknow, Reprinted, 2004
3. Bertrand Russell Human Society in Ethics & Politics
Reference Books:
1. Corliss Lamont, Philosophy of Humanism
2. Gaur. R.R. , Sangal. R, Bagaria. G.P, A Foundation Course in Value Education, Excel Books,
2009.
3. Gaur. R.R. , Sangal. R , Bagaria. G.P, Teachers Manual Excel Books, 2009.
4. I.C. Sharma . Ethical Philosophy of India Nagin & co Julundhar
5. Mortimer. J. Adler, – Whatman has made of man
6. William Lilly Introduction to Ethic Allied Publisher

L T P C
3 0 0 3
HUMAN RESOURCE DEVELOPMENT
Course Objectives:

life and profession
UNIT I:
Macro Perspective: HRD Concept, Origin and Need, HRD as a Total System; Approaches to
HRD; Human Development and HRD; HRD at Macro and Micro Climate.
UNIT II:
Micro Perspective: Areas of HRD; HRD Interventions Performance Appraisal, Potential
Appraisal, Feedback and Performance Coaching, Training, Career Planning, OD or Systems
Development, Rewards, Employee Welfare and Quality of Work Life and Human Resource
Information; Staffing for HRD: Roles of HR Developer; Physical and Financial Resources for
HRD; HR Accounting; HRD Audit, Strategic HRD.
UNIT III:
Instructional Technology for HRD : Learning and HRD; Models and Curriculum; Principles of
Learning; Group and Individual Learning; Transactional Analysis; Assessment Centre;
Behaviour Modeling and Self Directed Learning; Evaluating the HRD
UNIT IV:
Human Resource Training and Development : Concept and Importance; Assessing Training
Needs; Designing and Evaluating T&D Programmes; Role, Responsibilities and challenges to
Training Managers.
UNIT V:
Training Methods: Training with in Industry (TWI): On the Job & Off the Job Training;
Management Development: Lecture Method; Role Play; In-basket Exercise; Simulation;
Vestibule Training; Management Games; Case Study; Programmed Instruction; Team
Development; Sensitivity Training; Globalization challenges and Strategies of Training
Program, Review on T&D Programmes in India.

Text Books:
1. Nadler, Leonard : Corporat Human Resource Development, Van Nostrand Reinhold, ASTD,
New York .
2. Rao, T.V and Pareek, Udai: Designing and Managing Human Resource Systems, Oxford
IBH Pub. Pvt.Ltd., New Delhi , 2005.
Reference Books:
1) Rao, T.V: Readings in HRD, Oxford IBH Pub. Pvt. Ltd., New Delhi , 2004.
2) Viramani, B.R and Seth, Parmila: Evaluating Management Development, Vision Books,
NewDelhi . 5. Rao, T.V.(et.al): HRD in the New Economic Environment, Tata McGraw-Hill
Pub.Pvt, Ltd., New Delhi , 2003.
3) Rao, T.V: HRD Audit, Sage Publications, New Delhi .

L T P C
3 0 0 3
BUSINESS INTELLIGENCE
Course Objectives:

life and profession
UNIT I:
Introduction to Business Intelligence: The Business pressure-Responses and support model
Definition of BI- Architecture of BI- Styles of BI-vent-Driven alerts-A cyclic process of
Intelligence Creation. The value of Business intelligence-Value driven and Information use
Performance metrics and key performance indicators-horizontal use cases for BI.
UNIT II:
Data Ware Housing: Definitions and concepts-DW process an Innovation-Data Warehousing
Implementation-Data warehousing Administration-Security Issues and future trends. Business
Performance Management-Overview Strategic plan, monitor, performance measurement, BPM
methodologies-BPM Techniques-Performance dashboard and scorecards
UNIT III:
Data Mining for Business Intelligence: Data mining concepts and definitions-Data mining
applications - Artificial neural Networks for data mining - Text and web mining-Natural
language processing-Text mining applications-Text mining process-tools-Web mining overview
Web content overview-Web structure mining-Web usage mining.
UNIT IV:
Business Rules: The Value Preposition of Business Rules - Business rules approach-Business
rule system - Sources of business rules and management approach.
UNIT V:
Business Intelligence Implementation: Business Intelligence and integration - Implementation -
connecting in BI systems- Issues of legality- Privacy and ethics- Social networking and BI.
Relevant cases have to be discussed in each unit and in examination case is compulsory from any
unit.
Text Books:
1. Amit Johri “Business Intelligence” Himalaya, 2012
2. Rajiv Sabherwal “Business Intelligence” Wiley Publications, 2012

Reference Books:
1. Carlo Vercellis “Business Intelligence” Wiley Publications, 2012
2. Nina Godbole & Sunit Belapure “ Cyber Security” Wiley india 2012.
3. Jawadekar, MIS Text and Cases, TMH, 2012 6. Efraim Turban et al. “Business Intelligence”
2e, Pearson Education, 2012

L T P C
3 0 0 3
MANAGEMENT AND ORGANIZATIONAL BEHAVIOR
Course Objectives:

life and profession
UNIT I:
Nature of Management - Social Responsibili Ties of Business - Manager and Environment
Levels in Management - Managerial Skills - Planning - Steps in Planning Process - Scope and
Limitations - Short Range and Long Range Planning - Flexibility in Planning ¬Characteristics of
a sound Plan - Management by Objectives (MBO) - Policies and Strategies - Scope and
Formulation - Decision Making - Techniques and Processes.
UNIT II:
Organising - Organisation Structure and Design - Authority and Responsibility Relationships -
Delegation of Authority and Decentralisation - Interdepartmental Coordination - Emerging
Trends in Corporate Structure, Strategy and Culture - Impact of Technology on Organisational
design - Mechanistic vs Adoptive Structures - Formal and Informal Organisation.
UNIT III:
Perception and Learning - Personality and Individual Differences - Motivation and Job
Performance - Values, Attitudes and Beliefs - Stress Management - Communication Types-
Process - Barriers - Making Communication Effective.
UNIT IV:
Group Dynamics - Leadership - Styles - Approaches - Power and Politics - Organisational
Structure - Organisational Climate and Culture - Organisational Change and Development.
UNIT V:
Comparative Management Styles and approaches - Japanese Management Practices
Organisational Creativity and Innovation - Management of Innovation - Entrepreneurial
Management - Benchmarking - Best Management Practices across the world - Select cases of
Domestic & International Corporations - Management of Diversity.

Text Books:
1. Stephen P. Robbins, Timothy A. Judge, Neharika Vohra, Organizational Behaviour, Pearson,
16e, 2017.
2. Richard L. Daft, New Era of Management, Cengage Learning, 11e, 2017.
3. Afsaneh Nahavandi, Robert B. Denhardt, Janet V. Denhardt, Maris P. Aristigueta,
Organizational Behaviour, Sage Publications, 2015.
4. Ricky W Griffin, Management Principles and Practices, Cengage Learning, 11e, 2017.
5. Laurie J. Mullins, Management and Organizational Behaviour, Pearson Publications, 9e, 2017
6. Ramesh B. Rudani, Management and Organizational Behaviour Tata McGraw hill, 2011.
Reference Books:
1. Schermerhorn, Hunt and Osborn, Organisational behavior, John Wiley, 9th Edition, 2008.
2. Udai Pareek, Understanding Organisational Behaviour, 2nd Edition, Oxford Higher
Education, 2004.
3. Mc Shane & Von Glinov, Organisational Behaviour, 4th Edition, Tata Mc Graw Hill, 2007.

L T P C
3 0 0 3
STRATEGIC MANAGEMENT
Course Objectives:

life and profession
UNIT I: Introduction
Meaning, Scope and Importance of Strategic Management, Nature of Strategic Management,
Characteristics, Strategic Management Process, Strategic Management Model,
Dimension and Levels of Strategy, Role of strategists in business Policy.
UNIT II: Strategy Formulation

Corporate Planning, Concept of Planning, Planning Process, Types of Planning, Strategic
Planning, Strategic Decision Making, Vision, mission, and purpose, objectives and goals of a
business organization- Types of strategies – Guidelines for crafting successful business
strategies.
UNIT III:
Environmental Appraisal, External Analysis: Industry analysis, remote environment analysis,
competitive analysis, global environmental analysis, Internal Analysis: Resource-based view of
the firm, Capabilities, core competence, value chain analysis, VRHN analysis, distinctive
competency, sustainable competitive advantage and profitability, SWOT Analysis, Synergy.
UNIT IV:
Strategic Analysis and Choice, Environmental Threat and Opportunity Profile (ETOP); BCG,
TOWS, GE, Directional Policy Matrix- Organizational Capability Profile – Strategic Advantage
Profile Corporate Level strategies- growth, stability, renewal, corporate portfolio analysis, grand
strategies, McKinsey’s7s Framework. Business Level Strategies- Michael Porter’s Generic
strategies, Functional level strategies.
UNIT V:
Strategy Implementation and Evaluation, Strategy Implementation: Structure, Systems and
People, issues in implementation, Model of Strategic Implementation, Project implementation,
Procedural implementation, Resource Allocation, Budgets, Organization Structure, Strategy and
Organisation Structure, Different Types of Organisational Structure, Social responsibilities and
Ethics-Building a capable organization- Functional issues. Symptoms of malfunctioning of

strategy- Operations Control and Strategic Control, An overview of Strategic Evaluation and
Control-Measurement of performance- Analyzing variances- Role of organizational systems in
evaluation. Strategic Management for non-profit organizations.
Text Books:
1. Strategic Management, Fred R. David, Pearson Education
2. Strategic Management and Business Policy, Thomas L Wheelen, J. David Hunger and Krish
Rangarajan, Pearson Education
Reference Books:
1. Strategic Management: An Integrated approach, Hill W.L. Charles & Jones R. Gareth
2. Business Policy and Strategic Management, Azhar Kazmi, Tata McGraw Hill
3. Strategic Management -The Indian Context, R.Srinivasan, Prentice Hall of India, 2012

L T P C
0 0 4 2
MULTIMEDIA APPLICATION DEVELOPMENT
Basic Multimedia programs using PHOTOSHOP

01. Write a program to visualize a given image in different forms using features like
brightness, contrast, blur etc.
02. Write a program to design a visiting card containing at least one Graphic and Text
information.
03. Write a program to prepare a cover page for any book in your subject area.
04. Write a program to use appropriate tools from the tool box to cut the objects from three
files (F1.jpg, F2.jpg, F3.jpg) ; Organize them in a single file and apply feather effects.
Multimedia Programs developed using FLASH

05. Write a Program to perform motion tweening operation using flash
06. Write a Program to create a 24 spokes on a wheel using flash.
07. Write a Program to change and object shape using a shape tweening concept.
08. Write a program to create an animated e-card using adobe Flash.
09. Write a Program to create an animation to represent the Growing Moon.
10. Write a Program to create an animation to indicate a ball bouncing on Steps
11. Write a Program to simulate a ball hitting another ball.
12. Write a Program to change a circle into a square using Flash.
Rich Internet Applications (RIA) using Adobe Flex and Ajax

13. Write an MXML code to display HelloWorld using Flex.
14. Create a Flex Project using Flash Builder IDE to run HelloWorld Application.
15. Implement an AJAX program to fetch RSS feeds from a well-known RSS feed site.
Provide a scrolling display of latest news on your page. You can use xparser.js if you like.
16. Implement an RSS-based search feature. Have a text box and a button in your page for the
same. Show the results in a separate <div> which has the results as hyperlinks, which the
user can click.
17. Use the Reverse AJAX technique to build a web-based chat application. The application is
one-way browser-based. That is, we have a window in which one user types his messages.
From other other side, the second user directly updates a file on the server (instead of a
browser area).
18. A file on a server has information about cricket players. The fields represent name, country,
matches, runs and centuries. The fields are separated by colons (:). The front end screen has a
text field in which the user can enter a country. The server returns details of all players
belonging to that country in the form of one big JSON object. The client parses the JSON
object and builds an HTML table to print the results. Implement the server side script and the
client code.
19. Write an Ajax enabled address book web application that interacts with a web service to

obtain data and to modify data in a server-side database.

20. Write a Calender web application built using Dojo toolkit

MINOR DEGREE COURSE SUBJECTS
L T P C
3 0 2 4
ETHICAL HACKING
Course Objectives:
The security of digital infrastructure is an utmost need for an organization. The variety of
security attacks makes it compulsion to analyse the way newer attacks are formed and their
understanding is important to prevent or detect such attacks. The ethical hacking covers the
theory and practices of finding the vulnerabilities through forming the different attacks and then
defining the appropriate security policy including the action to detect or prevent the attacks and
thus reduce the damages.

 Describe and understand the basics of the ethical hacking
 Perform the foot printing and scanning
 Demonstrate the techniques for system hacking
 Characterize the malware and their attacks and detect and prevent them
 Determine the signature of different attacks and prevent them
 Detect and prevent the security attacks in different environments

Introduction to Hacking – Important Terminologies – Penetration Test – Vulnerability
Assessments versus Penetration Test – Pre-Engagement – Rules of Engagement -Penetration
Testing Methodologies – OSSTMM – NIST – OWASP – Categories of Penetration Test – Types
of Penetration Tests – Vulnerability Assessment Summary -Reports.
UNIT II :
The Technical Foundations of Hacking: The Attacker’s Process, The Ethical Hacker’s Process,
Security and the Stack.
Footprinting and scanning : Information Gathering, Determining the Network Range,
Identifying Active Machines, Finding Open Ports and Access Points, OS Fingerprinting
Services, Mapping the Network Attack Surface
UNIT III :
Vulnerability Data Resources – Exploit Databases – Network Sniffing – Types of Sniffing -
Promiscuous versus Nonpromiscuous Mode – MITM Attacks – ARP Attacks – Denial of Service
Attacks -Hijacking Session with MITM Attack – SSL Strip: Stripping HTTPS Traffic -DNS
Spoofing – ARP Spoofing Attack Manipulating the DNS Records – DHCP Spoofing -Remote
Exploitation – Attacking Network Remote Services – Overview of Brute Force Attacks –
Traditional Brute Force – Attacking SMTP – Attacking SQL Servers – Testing for Weak
Authentication.

UNIT IV:
Malware Threats: Viruses and Worms, Trojans, Covert Communication, Keystroke Logging and
Spyware, Malware Counter measures.
Sniffers, Session Hijacking and Denial of Service:
Sniffers, Session Hijacking, Denial of Service and Distributed Denial of Service.
UNIT V:
Wireless Hacking – Introducing Aircrack- Cracking the WEP – Cracking a WPA/WPA2
Wireless Network Using Aircrack-ng – Evil Twin Attack – Causing Denial of Service on the
Original AP – Web Hacking – Attacking the Authentication – Brute Force and Dictionary
Attacks – Types of Authentication – Log-In Protection Mechanisms – Captcha Validation Flaw
– Captcha RESET Flaw – Manipulating User-Agents to Bypass Captcha and Other Protection –
Authentication Bypass Attacks – Testing for the Vulnerability – Automating It with Burp Suite –
Session Attacks – SQL Injection Attacks – XSS (Cross-Site Scripting) -Types of Cross-Site
Scripting – Cross-Site Request Forgery (CSRF) – SSRF Attacks.
Text Books:
 Rafay Baloch, “Ethical Hacking and Penetration Testing Guide”, CRC Press, 2014.
 Certified Ethical Hacker, Version 9, Second Edition, Michael Gregg, Pearson IT
Certification
 Hacking the Hacker, Roger Grimes, Wiley
Reference Books:
 The Unofficial Guide to Ethical Hacking, Ankit Fadia, Premier Press
 Kevin Beaver, “Ethical Hacking for Dummies”, Sixth Edition, Wiley, 2018.
 Jon Erickson , “Hacking: The Art of Exploitation”, Second Edition, Rogunix, 2007.

L T P C
3 1 0 4
DATA ENCRYPTION AND NETWORK SECURITY
Course Objectives:
 Explain the objectives of information security
 Explain the importance and application of each of confidentiality, integrity, authentication
and availability
 Understand various cryptographic algorithms.
 Understand the basic categories of threats to computers and networks
 Describe public-key cryptosystem.
 Describe the enhancements made to IPv4 by IPSec
 Understand Intrusions and intrusion detection
 Discuss the fundamental ideas of public-key cryptography.
 Generate and distribute a PGP key pair and use the PGP package to send an encrypted e-
mail message.
 Discuss Web security and Firewalls

 Student will be able to understand basic cryptographic algorithms, message and web
authentication and security issues.
 Ability to identify information system requirements for both of them such as client and
server.
 Ability to understand the current legal issues towards information security
UNIT I:
Security Concepts: Introduction, The need for security, Security approaches, Principles of
security, Types 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, key range and key size, possible types of attacks.
UNIT II:
Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block
cipher operation, Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal
Cryptography, Diffie-Hellman Key Exchange, Knapsack Algorithm.
UNIT III:
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA512),
Message authentication codes: Authentication requirements, HMAC, CMAC, Digital signatures,
Elgamal Digital Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric &
Asymmetric Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication Service,

Public – Key Infrastructure
UNIT IV:
Transport-level Security: Web security considerations, Secure Socket Layer and Transport
Layer Security, HTTPS, Secure Shell (SSH)
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11 Wireless
LAN, IEEE 802.11i Wireless LAN Security
UNIT V:
E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview, IP Security
architecture, Authentication Header, Encapsulating security payload, Combining security
associations, Internet Key Exchange
Case Studies on Cryptography and security: Secure Multiparty Calculation, Virtual Elections,
Single sign On, Secure Inter-branch Payment Transactions, Cross site Scripting Vulnerability.
Text Books:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson
Education, 6th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 3 rd Edition
Reference Books:
1.Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan, Wiley
India, 1st Edition.
2. Cryptography and Network Security : Forouzan Mukhopadhyay, Mc Graw Hill, 3rd Edition
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
6. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning

L T P C
3 1 0 4
DIGITAL FORENSICS
Course Objectives:
 To understand the basic digital forensics and techniques for conducting the forensic
examination on different digital devices.
 To understand how to examine digital evidences such as the data acquisition, identification
analysis.

 Know how to apply forensic analysis tools to recover important evidence for
identifying computer crime.
 To be well-trained as next-generation computer crime investigators.

Computer forensics fundamentals, Benefits of forensics, computer crimes, computer forensics
evidence and courts, legal concerns and private issues.
UNIT II:
Understanding Computing Investigations – Procedure for corporate High-Tech investigations,
understanding data recovery work station and software, conducting and investigations.
UNIT III:
Data acquisition- understanding storage formats and digital evidence, determining the best
acquisition method, acquisition tools, validating data acquisitions, performing RAID data
acquisitions, remote network acquisition tools, other forensics acquisitions tools.
UNIT IV:
Processing crimes and incident scenes, securing a computer incident or crime, seizing digital
evidence at scene, storing digital evidence, obtaining digital hash, reviewing case.
UNIT V:
Current computer forensics tools- software, hardware tools, validating and testing forensic
software, addressing data-hiding techniques, performing remote acquisitions, E-Mail
investigations- investigating email crime and violations, understanding E-Mail servers,
specialized E-Mail forensics tool.
Text Books:
 Warren G. Kruse II and Jay G. Heiser, “Computer Forensics: Incident Response
Essentials”, Addison Wesley, 2002.
 Nelson, B, Phillips, A, Enfinger, F, Stuart, C., “Guide to Computer Forensics and
Investigations, 2nd ed., Thomson Course Technology, 2006, ISBN: 0-619-21706-5.
Reference Books:
 Vacca, J, Computer Forensics, Computer Crime Scene Investigation, 2nd Ed, Charles
River Media, 2005, ISBN: 1-58450-389.

JOB ORIENTED ELECTIVE SUBJECTS
L T P C
3 0 0 3
WEB TECHNOLOGIES
Course Objectives:
This course is designed to introduce students with no programming experience to the
programming languages and techniques associated with the World Wide Web. The course
will introduce web-based media-rich programming tools for creating interactive web pages.

 Analyze a web page and identify its elements and attributes.
 Create web pages using XHTML and Cascading Styles sheets.
 Build dynamic web pages.
 Build web applications using PHP.
 Programming through PERL and Ruby
 Write simple client-side scripts using AJAX
UNIT I: HTML, CSS

Basic Syntax, Standard HTML Document Structure, Basic Text Markup, Images, Hypertext
Links, Lists, Tables, Forms, HTML5
CSS: Levels of Style Sheets, Style Specification Formats, Selector Forms, The Box Model,
Conflict Resolution
UNIT II : Java script

The Basic of Java script: Objects, Primitives Operations and Expressions, Screen Output and
Keyboard Input, Control Statements, Object Creation and Modification, Arrays, Functions,
Constructors, Pattern Matching using Regular Expressions
DHTML: Positioning Moving and Changing Elements
UNIT III :
XML: Document type Definition, XML schemas, Document object model, XSLT,
DOM and SAX Approaches,
AJAX A New Approach: Introduction to AJAX, Integrating PHP and AJAX.
UNIT IV:
PHP Programming: Introducing PHP: Creating PHP script, Running PHP script. Working with
variables and constants: Using variables, Using constants, Data types, Operators. Controlling
program flow: Conditional statements, Control statements, Arrays, functions. Working with
forms and Databases such as MySQL.
UNIT V:
Introduction to PERL, Operators and if statements, Program design and control structures,
Arrays, Hashs and File handling, Regular expressions, Subroutines, Retrieving documents from
the web with Perl.

Text Books:
1. Programming the World Wide Web, Robet W Sebesta, 7ed, Pearson.
2. Web Technologies, Uttam K Roy, Oxford
3. The Web Warrior Guide to Web Programming, Bai, Ekedahl, Farrelll, Gosselin, Zak,
Karparhi, Maclntyre, Morrissey, Cengage
Reference Books:
1. Ruby on Rails Up and Running, Lightning fast Web development, Bruce Tate, Curt Hibbs,
Oreilly (2006)
2. Programming Perl, 4ed, Tom Christiansen, Jonathan Orwant, Oreilly (2012)

L T P C
3 0 0 3
WEB SERVICES
Course Objectives:
To understand the concept of XML and to implement Web services using XML based Standards

 Recite the advantages of using XML technology family
 Analyze the problems associated with tightly coupled distributed software
architecture
 Learn the Web services building block
 Implement e-business solutions using XML based web services
UNIT I:
XML technology family : XML, benefits, Advantages of XML over HTML, EDI, Databases,
XML based standards, Structuring with schemas, DTD, XML Schemas, XML processing,
DOM, SAX, presentation technologies, XSL, XFORMS, XHTML, Transformation, XSLT,
XLINK, XPATH, XQuery.
UNIT II:
Architecting Web Services: Business motivations for web services, B2B, B2C, Technical
motivations, limitations of CORBA and DCOM, Service-oriented Architecture (SOA),
Architecting web services, Implementation view, web services technology stack, logical view,
composition of web services, deployment view, from application server to peer to peer, process
view, life in the runtime.
UNIT III:
Web Services Building Blocks: Transport protocols for web services, messaging with web
services, protocols, SOAP, describing web services, WSDL, Anatomy of WSDL, manipulating
WSDL, web service policy, Discovering web services, UDDI, Anatomy of UDDI, Web service
inspection, Ad-Hoc Discovery, Securing web services.
UNIT IV:
Implementing XML in E-Business: B2B – B2C Applications, Different types of B2B interaction,
Components of e-business XML systems, ebXML, RosettaNet, Applied XML in vertical
industry, web services for mobile devices.
UNIT V:
XML Content Management and Security: Semantic Web, Role of Meta data in web content,
Resource Description Framework, RDF schema, Architecture of semantic web, content
management workflow, XLANG, WSFL, Securing web services.
Text Books:
1) Ron Schmelzer et al. “ XML and Web Services”, Pearson Education, 2002.

Reference Books:
1) Keith Ballinger, “. NET Web Services Architecture and Implementation”, Pearson Education,
2003.
2) David Chappell, “Understanding .NET A Tutorial and Analysis”, Addison Wesley, 2002.

L T P C
3 0 0 3
DEVOPS
Course Objectives:
DevOps improves collaboration and productivity by automating infrastructure and• workflows
and continuously measuring applications performance

 Enumerate the principles of continuous development and deployment
 Automation of configuration management, inter-team collaboration, and IT service gility
 Describe DevOps• & DevSecOps methodologies and their key concepts
 Illustrate the types of version control systems, continuous integration tools
 Continuous monitoring tools, and cloud models
 Set up complete private infrastructure using version control systems and CI/CD tools
UNIT I:
Phases of Software Development life cycle. Values and principles of agile software
development.
UNIT II:
Fundamentals of DevOps: Architecture, Deployments, Orchestration, Need, Instance of
applications, DevOps delivery pipeline, DevOps eco system.
UNIT III:
DevOps adoption in projects: Technology aspects, Agiling capabilities, Tool stack
implementation, People aspect, processes
UNIT IV:
Introduction to Continuous Integration, Continuous Delivery and Deployment , Benefits of
CI/CD, Metrics to track CICD practices
UNIT V:
Devops Maturity Model: Key factors of DevOps maturity model, stages of Devops maturity
model, DevOps maturity Assessment
Text Books:
1) The DevOps Handbook: How to Create World-Class Agility, Reliability, and Security in
Technology Organizations, Gene Kim , John Willis , Patrick Debois , Jez Humb,1st Edition,
O’Reilly publications, 2016.
2) What is Devops? Infrastructure as code, 1st Edition, Mike Loukides ,O’Reilly publications,
2012.

Reference Books:
1) Building a DevOps Culture, 1st Edition, Mandi Walls, O’Reilly publications, 2013.
2) The DevOps 2.0 Toolkit: Automating the Continuous Deployment Pipeline With
Containerized Microservices, 1st Edition, Viktor Farcic, CreateSpace Independent Publishing
Platform publications, 2016

L T P C
3 0 0 3
MULTIMEDIA AND RICH INTERNET APPLICATIONS
Course Objectives:
This course aims to further develop students’ competency in producing dynamic and creative
graphic solutions for multimedia productions. It provides students with the basic concepts and
techniques of interactive authoring. Artistic visual style and layout design are stressed, as well as
the editing and integration of graphic images, animation, video and audio files. The course
allows students to master industry-wide software and technologies to create highly interactive,
rich internet applications.

 Ability to design a short films and teaching material for better understanding.
 Ability to apply different multimedia development tools to produce web based and
 Stand-alone user interfaces.
UNIT I:
Fundamental concepts in Text and Image: Multimedia and hypermedia, World Wide Web,
overview of multimedia software tools. Graphics and image data representation graphics/image
data types, file formats, Color in image and video: color science, color models in images, color
models in video.
UNIT II:
Fundamental concepts in video and digital audio: Types of video signals, analog video, digital
video, digitization of sound, MIDI, quantization and transmission of audio.
Multimedia Data Compression: Lossless compression algorithms, Lossy compression
algorithms, Image compression standards.
UNIT III:
Basic Video compression techniques, Case study: MPEG Video Coding I, Basic Audio
compression techniques, Case study: MPEG Audio compression.
Web 2.0
What is web 2.0, Search, Content Networks, User Generated Content, Blogging, Social
Networking, Social Media, Tagging, Social Marking, Rich Internet Applications, Web Services,
Mashups, Location Based Services, XML, RSS, Atom, JSON, and VoIP, Web 2.0 Monetization
and Business Models, Future of the Web.
UNIT IV:
Rich Internet Applications(RIAs) with Adobe Flash : Adobe Flash- Introduction, Flash Movie
Development, Learning Flash with Hands-on Examples, Publish your flash movie, Creating
special effects with Flash, Creating a website splash screen, action script, web sources.
Rich Internet Applications(RIAs) with Flex 3 - Introduction, Developing with Flex 3, Working
with Components, Advanced Component Development, Visual Effects and Multimedia.

UNIT V:
Ajax- Enabled Rich Internet Application : Introduction, Traditional Web Applications vs Ajax
Applications, Rich Internet Application with Ajax, History of Ajax, Raw Ajax example using
xml http request object, Using XML, Creating a full scale Ajax Enabled application, Dojo Tool
Kit.
Text Books:
1. 1. Fundamentals of Multimedia by Ze-Nian Li and Mark S. Drew PHI Learning, 2004
UNITS 1,2,3
2. 2. AJAX, Rich Internet Applications, and Web Development for Programmers, Paul J Deitel
and Harvey M Deitel, Deitel Developer Series, Pearson Education.
Reference Books:
1. Professional Adobe Flex 3, Joseph Balderson, Peter Ent, et al, Wrox Publications, Wiley
India, 2009.
2. Multimedia Communications: Applications, Networks, Protocols and Standards, Fred Halsall,
Pearson Education, 2001, rp 2005.
3. Multimedia Making it work, Tay Vaughan, 7th edition, TMH, 2008.
4. Introduction to multimedia communications and Applications, Middleware, Networks, K. R.
Rao, Zoran, Dragored, Wiley India, 2006, rp. 2009.
5. Multimedia Computing, Communications & Applications, Ralf Steinmetz and Klara
Nahrstedt, Pearson Education, 2004
6. Principles of Multimedia, Ranjan Parekh, TMH, 2006.
7. Multimedia in Action, James E. Shuman, Cengage Learning, 198, rp 2008.

CSE - Cyber Security - IV Years - CS & Syllabus - UG - R20

Uploaded by

Copyright:

Available Formats

CSE - Cyber Security - IV Years - CS & Syllabus - UG - R20

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

CSE - Cyber Security - IV Years - CS & Syllabus - UG - R20

Uploaded by

Copyright:

Available Formats

R-20 Syllabus for CSE-CS, JNTUK w. e. f.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

COURSE STRUCTURE AND SYLLABUS

B. Tech - COMPUTER SCIENCE & ENGINEERING with Specialization

(Applicable for batches admitted from 2020-2021)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

Total Credits 19.5

Total Credits 19.5

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

III Year – I SEMESTER

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

III Year – II SEMESTER

Minor courses through SWAYAM 0 0 0 2

Industrial/Research Internship (Mandatory) 2 Months during summer vacation

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

Open Electives to be offered by Cyber Security for Other Branches:

Open Elective I: Open Elective II:

Minor Degree in Cyber Security offered to other branches

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

UNIT I: Sequences, Series and Mean value theorems: (10 hrs)

UNIT III: Linear differential equations of higher order: (10 hrs)

Non-homogeneous equations of higher order with constant coefficients – with non-homogeneous

Applications: LCR circuit, Simple Harmonic motion.

UNIT IV: Partial differentiation: (10 hrs)

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

UNIT V: Multiple integrals: (8 hrs)

Double and Triple integrals – Change of order of integration – Change of variables.

Applications: Finding Areas and Volumes.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

APPLIED PHYSICS (BS1104)

(For All Circuital Branches like ECE, EEE, CSE etc)

Diffraction: Introduction - Fresnel and Fraunhofer diffraction - Fraunhofer diffraction due to

Polarization: Introduction-Types of polarization - Polarization by reflection, refraction and

The students will be able to

Unit-II: Lasers and Fiber optics 8hrs

The students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

Unit-IV: Dielectric and Magnetic Materials 8hrs

The students will be able to

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

DEPARTMENT OF CSE – CYBER SECURITY

Unit – V: Semiconductors and Superconductors 10hrs

Semiconductors: Introduction- Intrinsic semiconductors – Density of charge carriers – Electrical

The students will be able to