III & IV B.tech Cse Autonomous Syllabus Book (A4)

COURSE STRUCTURE AND
DETAILED SYLLABUS
for
III & IV B.Tech.

in
Computer Science and Engineering
III B. Tech I Semester
S. Subject Hours
No. Code Type Title L T P C
01 18CMBIT5010 BS Biology for Engineers 3 3
02 18CMEGT5020 HS Personality Development & 2 2
Professional Communication
03 18CMMST503 HS Management Science 3 3
0
04 18CSCST5040 PC Computer Networks 3 3
05 18CSCST5050 PC Operating Systems 3 3
06 18CSCSL5060 PC Computer Networks Lab 3 1.5
07 18CSCSL5070 PC Operating Systems Lab 3 1.5
08 18CSCSL5080 PC R Programming Lab 3 1.5
14 9 18.5
23
III B. Tech II Semester

S. Subject Hours
01 18CSCST6010 PC Formal Languages & 3 3
Automata Theory
02 18CSCST6020 PC Database Systems 3 3
03 18CSCSP603G PE Program Elective-I 3 3
04 18CSHHO604 OE Open Elective-I 3 3
G
05 18CMMST605 HS Engineering Economics & 3 3
0 Financial Management
06 18CSCSL6060 PC Database Systems Lab 3 1.5
07 18CSCSL6070 PC Python Programming Lab 3 1.5
08 18CSCSR6080 PROJ Term Paper + Seminar 4 2
15 10 20
26
Program Elective-I
18CSCSP6031 Software Engineering
18CSCSP6032 Network Protocols
18CSCSP6033 Mobile Application Development
IV B. Tech I Semester
S. Subject Hours
01 18CSCST7010 PC Compiler Design 3 3
02 18CSCSP702G PE Program Elective-II 3 3
03 18CSCSP703G PE Program Elective-III 3 3
04 18CSHHO704G OE Open Elective-II 3 3
05 18CSHHO705G OE Open Elective-III 3 3
06 18CSCSL7060 PC Compiler Design Lab 3 1.5
07 18CSCSR7070 PROJ Internship 2
08 18CSCSR7080 PROJ Project-I 8 4
15 0 11 22.5
26
IV B. Tech II Semester
S. Subject Hours
01 18CSCSP801G PE Program Elective-IV 3 3
02 18CSCSP802G PE Program Elective-V 3 3
03 18CSCSP803G PE Program Elective-VI 3 3
04 18CSHHO804 OE Open Elective-IV 3 3
G
05 18CSCSR8050 PROJ Project-II 14 7
06 PROJ Co-curricular/Extra-curricular 2 1
Activities
14 14 20
28
Program Elective-II
18CSCSP7021 Unified Modeling Language
18CSCSP7022 Cryptography & Network Security
18CSCSP7023 Data Warehousing & Mining
Program Elective-III
18CSCSP7031 Design Patterns
18CSCSP7032 Cyber Security
18CSCSP7033 Artificial Intelligence
Program Elective-IV
18CSCSP8011 Software Testing
18CSCSP8012 Mobile Computing
18CSCSP8013 Machine Learning
Program Elective-V
18CSCSP8021 Software Quality Assurance
18CSCSP8022 Ad-hoc & Sensor Networks
18CSCSP8023 Hadoop & Big Data
Program Elective-VI
18CSCSP8031 Software Project Management
18CSCSP8032 Cyber Forensics
18CSCSP8033 Data Science
Open Electives (offered by CSE chosen by Students other than CSE Department)
Sl. No. Subject Title
A Internet of Things
B Block Chain
C Quantum Computing
D Virtual Reality
E Data Structures through C
F Designing Database Management Systems
H Operating Systems Concepts
I R Programming
J Python Programming
K Java Programming
L App Technologies
M Web Technologies
N Artificial Intelligence
Department of Computer Science & Engineering
Detailed Syllabus
V SEMESTER (III-I)
BIOLOGY FOR ENGINEERS
Subject Code 18CMBIT5010 IA Marks 30
Number of Lecture Hours/Week 3 Exam Marks 70
Total Number of Lecture Hours 50 Exam Hours 03
Credits – 03
Unit -1: Introduction Hours
Bring out the fundamental differences between science and engineering by
drawing a comparison between eye and camera, Bird flying and aircraft.
Mention the most exciting aspect of biology as an independent scientific
08
discipline. Why we need to study biology. How biological observations of 18th
Century that lead to major discoveries. Examples from Brownian motion and
the origin of thermodynamics by referring to the original observation of Robert
Brown and Julius Mayor.
Unit -2:Classification
Plant Hierarchy of life forms at phenomenological level- classification based on
(a) cellularity - Unicellular or multicellular (b) ultra-structure- prokaryotes or
eukaryotes. (c) energy and Carbon utilization -Autotrophs, heterotrophy, 08
lithotrophs (d) Ammonia excretion – ammoniotelic, uricotelic, ureotelic (e)
Habitats- aquatic or terrestrial (e) Molecular taxonomy- three major kingdoms
of life. Model organisms for the study of biology come from different groups.
E. coli, S.cerevisiae, D. Melanogaster, C. elegance, A. Thaliana, M. Musculus
Unit – 3:Genetics & Biomolecules
Mendel’s laws, Concept of segregation and independent assortment. Concept of
allele. Gene mapping, Gene interaction, Epistasis. Meiosis and Mitosis be
taught as a part of genetics. Emphasis to be give not to the mechanics of cell
division nor the phases but how genetic material passes from parent to
offspring. Concepts of recessiveness and dominance. Concept of mapping of 12
phenotype to genes. Discuss about the single gene disorders in humans. Discuss
the concept of complementation using human genetics.
Molecules of life: Monomeric units and polymeric structures. Discuss about
sugars, starch and cellulose. Amino acids and proteins. Nucleotides and
DNA/RNA. Two carbon units and lipids.
Unit – 4:Enzymes & Proteins
Enzymology: How to monitor enzyme catalyzed reactions. How does an 12
enzyme catalyze reactions - Enzyme classification. Mechanism of enzyme
action. -examples. Enzyme kinetics and kinetic parameters. Why should we
know these parameters to understand biology? RNA catalysis.
Proteins- structure and function. Hierarch in protein structure. Primary
secondary, tertiary and quaternary structure. Proteins as enzymes, transporters,
receptors and structural elements.
Information Transfer: The molecular basis of coding and decoding genetic

information is universal Molecular basis of information transfer. DNA as a
genetic material. Hierarchy of DNA structure- from single stranded to double
helix to nucleosides. Concept of genetic code. Universality and degeneracy of
genetic code. Define gene in terms of complementation and recombination
Unit – 5:Microbiology & Metabolism
Thermodynamics as applied to biological systems - Exothermic and
endothermic versus undergone and exergoinc reactions. Concept of K eq and its
relation to standard free energy - Spontaneity - ATP as an energy currency.
This should include the breakdown of glucose to CO 2 + H2O (Glycolysis and
Krebs cycle) and synthesis of glucose from CO 2 and H2O (Photosynthesis).
10
Energy yielding and energy consuming reactions. Concept of Energy charge
Concept of single celled organisms. Concept of species and strains.
Identification and classification of microorganisms. Microscopy. Ecological
aspects of single celled organisms. Sterilization and media compositions.
Growth kinetics
Text(T) / Reference(R) Books:

T1 Biology: A global approach: Campbell, N. A.; Reece, J. B.; Urry, Lisa; Cain, M, L.;
Wasserman, S. A.; Minorsky, P. V.; Jackson, R. B. Pearson Education Ltd
T2 Outlines of Biochemistry, Conn, E.E; Stumpf, P.K; Bruening, G; Doi, R.H., John
Wiley and Sons
T3 Microbiology, Prescott, L.M J.P. Harley and C.A. Klein 1995. 2nd edition Wm, C.
Brown Publishers
R1 Principles of Biochemistry (V Edition), By Nelson, D. L.; and Cox, M. M.W.H.
Freeman and Company
R2 Molecular Genetics (Second edition), Stent, G. S.; and Calender, R.W.H. Freeman
and company, Distributed by Satish Kumar Jain for CBS Publisher
W1 https://ocw.mit.edu/courses/biological-engineering/
W2 https://onlinecourses.nptel.ac.in/noc16_ge03/preview
Course Outcomes: On completion of this course, students can

CO1 Describe how biological observations of 18th Century that lead to major
discoveries.
CO2 Convey that classification is not what biology is all about but highlight the
underlying criteria, such as morphological, biochemical and ecological.
CO3 Highlight the concepts of recessiveness and dominance during the passage of
genetic material from parent to offspring
CO4 Convey that all forms of life have the same building blocks and yet the
manifestations are as diverse as one can imagine
CO5 Classify enzymes and distinguish between different mechanisms of enzyme action,
To convey that “Genetics is to biology what Newton’s laws are to Physical
Sciences”
Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 - - - - - 3 2 - - - - - 1 -
CO2 - - - - - 2 3 - - - - - 2 -
CO3 1 - - - - 3 - - - - - 1 -
CO4 3 - - - - 2 - - - - - 1 -
CO5 2 - - - - 3 - - - - - 1 -
Course 1 - - - - 3 2 - - - - - 1 -
PERSONALITY DEVELOPMENT & PROFESSIONAL COMMUNICATION
Subject Code 18CMEGT5020 IA Marks 30
Credits – 02
Unit -1: Personality Development Hours
a) Personal Effectiveness- being proactive- principles of personal vision,
b) Intrapersonal communication- emotional intelligence- beginning with the 05
end in mind-
c) Time management: understanding priorities- first things first- time – personal
effectiveness
Unit -2: Emotional Intelligence and Intrapersonal Communication
a) Principles of Emotional Intelligence –
b) Intrapersonal Communication- 05
c) Principles of creative cooperation-organization skills-Think win-win
d) Principles of balanced self-renewal- Lifelong learning
Unit – 3:Career and Employability Skills
a) Understanding Career values- values grid-career thinking- what is a career?
b) Skills vs strengths- spotting skills- reflecting on skills- setting goals for
developing skills-
06
c) Meeting the expectations of the employer-understanding job description- -
Skills Grid exercises- matching the skills with requirements
d) Preparing Resume and Preparing for interviews- Structuring interview
questions- CAR- Context, Action and Results
Unit – 4:Problem Solving Skills
a) Understanding the complexity at workplace-

b) defining the problem- identifying the reasons-
06
c) finding possible solutions- planning actions- analysing results-feedback
d) redefining the problem- the problem solving cycle
Unit – 5:Professional Communication
a) Active listening skills- note taking- 10

b) Professional presentation skills- understanding the context- expectations of
the people- putting across the message effectively- answering questions-
c) Technical writing skills- practical steps for writing- report writing and
writing a report free from plagiarism.

T1 English and Soft Skills, Dr. S.P. Dhanvel, Orient Blackswan, 2011
R1 Seven Habits of Highly Effective People, Stephen R Covey
R2 Professional Communication, Aruna Koneru, Mc Graw Hill
R3 Personality Development and Soft Skills, Barun K Mitra OUP
R4 Enhance Your Employability Skills, David Winter and Laura Brammar, University
of London.
W1 https://www.coursera.org/browse/personal-development
W2 https://alison.com/courses/personal-development

CO1 Understand Personality development process and learn to implement effective
techniques.
CO2 Understand how people behave and regulate self-behaviors and learn to work in a
team.
CO3 Know their career values, identify their skills, set goals for enhancing their career
skills and prepare for interviews
CO4 Understand and learn how to deal with problems and practice problem solving
skills.
CO5 Learn the principles of professional communication & application of the same

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 - - - - - - - 2 - 3 - 2 - -
CO2 - - - - - - - 2 - 3 - 2 - -
CO3 - - - - - - - 2 - 3 - 2 - -
CO4 - - - - - - - 2 - 3 - 2 - -
CO5 - - - - - - - 2 - 3 - 2 - -
Course - - - - - - - 2 - 3 - 2 - -
MANAGEMENT SCIENCE
Subject Code 18CMMST5030 IA Marks 30
Credits – 03
Unit -1: Introduction to Management Hours
Concept –nature and importance of Management – Functions of Management –
Evaluation of Management thought- Theories of Motivation – Decision making 14
process-Designing organization structure- Principles of organization - Types of
organization structure.
Unit -2: Operations Management
Principles and Types of Management – Work study- Statistical Quality Control-
Control charts (P-chart, R-chart, and C chart). Simple problems- Material 13
Management: Need for Inventory control- EOQ, ABC analysis (simple
problems) and Types of ABC analysis (HML, SDE, VED, and FSNanalysis).
Unit – 3: Functional Management&Strategic Management
Functional Management: Concept of HRM, HRD and PMIR- Functions of

HRM - Marketing Management- Functions of Marketing, Marketing
strategiesbasedonproductLifeCycle,Channelsofdistributions. 16
Strategic Management: Vision, Mission, Goals, Strategy – Elements of
Corporate Planning Process – Environmental Scanning – SWOT analysis-
Steps in Strategy Formulation and Implementation, Generic Strategy
alternatives
Unit – 4: Project Management: (PERT/CPM)
Development of Network – Difference between PERT and CPM Identifying 12

Critical Path- Probability- Project Crashing (SimpleProblems).
Unit – 5:Contemporary Management Practices
Basic concepts of MIS, MRP, Justin- Time (JIT) system, Total Quality
Management (TQM), Six sigma , Supply ChainManagement, Enterprise 14
Resource Planning (ERP), Business Process outsourcing (BPO), Business
process Re-engineering and Bench Marking, Balanced ScoreCard.

T1 ManagementScience, Dr. P. Vijaya Kumar & Dr. N. Appa Rao,
T2 Management Science, Dr. A. R. Aryasri, TMH2011.
R1 Essentials of Management, Koontz & Weihrich, TMH 2011
R2 Global Management Systems, Seth & Rastogi, Cengage Learning, 2011
R3 Organizational Behaviors, Robbins, Pearson Publications, 2011
R4 Production & Operational Management, Kanishka Bedi, Oxford Publications, 2011
R5 Management Science, Manjunath, Pearson Publications, 2013.
R6 Human Resource Management, Biswajit Patnaik, PHI, 2011
R7 Strategic Management, Hitt and Vijaya Kumar, Cengage Learning
W1 https://msande.stanford.edu/academics/graduate/masters-program/hcp-part-time-
ms/online-courses
W2 https://www.coursera.org/browse/business/leadership-and-management

CO1 Understand the history behind the Java technology, its features and strengths
CO2 Implement the basic principles of Object-Oriented Programming which includes
inheritance, polymorphism, encapsulation and abstraction.
CO3 Understand the exception programming techniques by describing and
encapsulating exceptions.
CO4 Understand the Thread concepts and Collections Framework in java. N
CO5 Create rich user-interface applications using modern API’s such as JAVAFX.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 - - - - - - - - 2 2 3 - - -
CO2 - - - - - - - - 2 2 3 - - -
CO3 - - - - - - - - 2 2 3 - - -
CO4 - - - - - - - - 2 2 3 - - -
CO5 - - - - - - - - 2 2 3 - - -
Course - - - - - - - - 2 2 3 - - -
COMPUTER NETWORKS
Subject Code 18CSCST5040 IA Marks 30
Credits – 03
Network Topologies, WAN, LAN, MAN. OSI Reference Model, TCP/IP
Reference Model, Multiplexing (Frequency Division, Wavelength Division, 08
Synchronous Time Division and Statistical Time Division Multiplexing
Techniques), Switching Techniques (Circuit-switching, Datagram, Virtual
Circuit Networks).
Unit -2:The Data Link Layer
Design Issues, Services Provided to the Network Layer, Framing, Error
Control, Flow Control, Error Detection and Correction, Error Correcting Codes,
Error Detecting Codes, A Simplex Stop and Wait Protocol for an Error free
channel, A Simplex Stop and Wait Protocol for a Noisy Channel, Sliding 10
Window Protocols (A One Bit Sliding Window Protocol-A Protocol Using Go-
Back-NA Protocol Using Selective Repeat), Data Link Layer in HDLC:
Configuration and transmission modes, frames, control fields, Point-to-Point
Protocol: Framing transmission phase, multiplexing, multi-link PPP.
Unit – 3:The Medium Access Control Sub layer & Network Layer
The Channel Allocation Problem, Static Channel Allocation, Assumptions for

Dynamic Channel Allocation, Multiple Access Protocols (Aloha, Carrier Sense
Multiple Access Protocols, Collision-Free Protocols, Limited Contention 10
Protocols, Wireless LAN Protocols). Routing Algorithms- Shortest-Path
Routing, Flooding, Hierarchical routing, Broadcast, Multicast and Distance
Vector Routing.
Unit – 4:Congestion Control
Congestion Control Algorithms, Approaches to Congestion Control-Traffic

Aware Routing-Admission Control-Traffic Throttling-Load Shedding, IP
Addressing, Classless and Class full Addressing, Sub-netting, Standard
10
Ethernet (MAC Sub Layer and Physical Layer), Fast Ethernet (MAC Sub Layer
and Physical Layer), IEEE-802.11 (Architecture, Mechanism and Frame
Structure), IEEE-805.11 Frame Structure and Services.
Unit – 5:Application Layer
The Domain Name System- The DNS Name Space, Resource Records, Name
Servers, Electronic Mail Architecture and Services, The User Agent, Message 12
Formats, Message Transfer, Final Delivery, The Wireless Application Protocol.
T1 Computer Networks, 5th Edition, Tanenbaum and David J Wetherall, Pearson Edu,
2010.
T2 Computer Networks: A Top Down Approach, Behrouz A. Forouzan,
FirouzMosharraf, McGraw Hill Education.
T3 Computer Networks, Mayank Dave, CENGAGE
T4 Data and Computer Communications, Fifth Edition, William Stallings, PHI, 2005.
R1 Computer Networks, A Systems Approach, Fifth Edition, Peterson & Davie,
Harcourt, 2011.
R2 Network Management Standards, Second Edition, Ulysses Black, McGraw Hill,
1994
R3 Computer Networking - A Top-down Approach, Sixth Edition, James F. Kurose,
Keith W. Ross, Pearson, 2013.
R4 Computer Networks - A Systems Approach, 5th ed, Larry L. Peterson and Bruce S.
Davie, Morgan Kaufmann/ Elsevier, 2011
W1 https://swayam.gov.in/courses/5172-computer-networks
W2 https://www.coursera.org/courses?query=computer%20network

CO1 Understand OSI and TCP/IP models
CO2 Analyze MAC layer protocols and LAN technologies
CO3 Design applications using internet protocols
CO4 Understand routing and congestion control algorithms
CO5 Understand how internet works.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
OPERATING SYSTEMS
Credits – 03
Unit -1: Operating Systems Overview Hours
Computer system organization, Operating system structure, Process, memory,
storage management, Protection and security, Distributed systems, Computing
Environments, Open-source operating systems, OS services, User operating- 08
system interface, System calls, Types, System programs, OS structure, OS
generation, System Boot Process concept, scheduling (Operations on processes,
Cooperating processes, Inter-process communication), Multi-threading models,
Thread Libraries, Threading issues.
Unit -2:Process Management
Basic concepts, Scheduling criteria, Scheduling algorithms, Thread scheduling,
Multiple processor scheduling Operating system, Algorithm Evaluation, The 10
critical section problem, Peterson’s solution, Synchronization hardware,
Semaphores, Classic problems of synchronization, Critical regions, Monitors.
Unit – 3:Deadlocks
System model, Deadlock characterization, Methods for handling deadlocks,

Deadlock Prevention, Deadlock Avoidance, Deadlock detection, Recovery
from deadlock. Storage Management: Swapping, Contiguous memory 10
allocation, Paging, Segmentation Virtual Memory Background, Demand
paging, copy on write, Page replacement and various Page replacement
algorithms, Allocation of frames, Thrashing.
Unit – 4:I/O Systems
File concept, Access methods, Directory structure, File-system mounting,

Protection, Directory implementation, Allocation methods, Free-space
10
management, Disk scheduling, Disk management, Swap-space management,
Protection.
Unit – 5:Case Study
Linux System: Components of LINUX, Inter-process Communication,

Synchronization, Interrupt, Exception and System Call.
Android Software Platform: Android Architecture, Operating System Services, 12
Android Runtime Application Development, Application Structure, Application
Process management.
T1 Operating System Concepts Essentials, Abraham Silberschatz, Peter B. Galvin,
Greg Gagne, John Wiley & Sons Inc., 2010.
T2 Operating System Concepts, 9th Edition, Abraham Silberschatz, Peter Baer Galvin
and Greg Gagne, John Wiley and Sons Inc., 2012
T3 Operating Systems, Second Edition, S Halder, Alex A Aravind, Pearson Education,
2016
T4 Operating Systems – Internals and Design Principles, 7th Edition, William
Stallings, Prentice Hall, 2011
R1 Modern Operating Systems, Second Edition, Andrew S. Tanenbaum, Addison
Wesley, 2001.
R2 Operating Systems: A Design-Oriented Approach, Charles Crowley, Tata McGraw
Hill Education, 1996.
R3 Operating Systems: A Concept-based Approach, Second Edition, D M Dhamdhere,
Tata McGraw-Hill Education, 2007
R4 Operating Systems: Internals and Design Principles, Seventh Edition, William
Stallings, Prentice Hall, 2011
W1 https://www.coursera.org/courses?query=operating%20system
W2 https://onlinecourses.nptel.ac.in/noc16_cs10/preview

CO1 Design various Scheduling algorithms, Apply the principles of concurrency.
CO2 Design deadlock, prevention and avoidance algorithms.
CO3 Compare and contrast various memory management schemes.
CO4 Design and Implement a prototype file system, Perform administrative tasks on
Linux Servers.
CO5 Introduction to Android Operating System Internals.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
COMPUTER NETWORKS LAB
Subject Code 18CSCSL5060 IA Marks 50
Number of Tutorial Hours/Week 03(P) Exam Marks 50
Total Number of Practice Hours 36 Exam Hours 03
Credits – 1.5
List of Programs
Exercise1
Understanding and using of commands like ifconfig, netstat, ping, arp, telnet, ftp,
finger, traceroute, whoisetc. Usage of elementary socket system calls (socket (), bind(),
listen(), accept(),connect(),send(),recv(),sendto(),recvfrom()).
Exercise2
Implementation of Connection oriented concurrent service (TCP).
Exercise3
Implementation of Connectionless Iterative time service (UDP).
Exercise4
Implementation of Select system call.
Exercise5
Implementation of gesockopt (), setsockopt () system calls.
Exercise6
Implementation of getpeername () system call.
Exercise7
Implementation of remote command execution using socket system calls.
Exercise8
Implementation of Distance Vector Routing Algorithm.
Exercise9
Implementation of SMTP.
Exercise10
Implementation of FTP.
Exercise11
Implementation of HTTP.
Exercise12
Implementation of RSA algorithm.
Note: Implement programs 2 to 7 in C and 8 to 12 in JAVA.

CO1 Understand and explain the basic concepts of Grid Computing.
CO2 Explain the advantages of using Grid Computing within a given environment
CO3 Prepare for any upcoming Grid deployments and be able to get started with a
potentially available Grid setup.
CO4 Discuss some of the enabling technologies e.g. high-speed links and storage area
networks.
CO5 Build computer grids.
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - - 2
CO2 2 2 3 - - - - - - - - - - 2
CO3 2 2 3 - - - - - - - - - - 2
CO4 2 2 3 - - - - - - - - - - 2
CO5 2 2 3 - - - - - - - - - - 2
Course 2 2 3 - - - - - - - - - - 2
OPERATING SYSTEMS LAB
Credits – 1.5
List of Experiments
Exercise1
Simulate the following CPU scheduling algorithms
a) Round Robin
b) SJF
c) FCFS
d) Priority
Exercise2
Loading executable programs into memory and execute system call implementation for
read(), write(), open(), and close().
Exercise3
Implement fork(), wait(), exec() and exit() system calls.
Exercise4
Simulate the following file allocation strategies
a) Sequenced
b) Indexed and
c) Linked
Exercise5
Simulate MVT and MFT
Exercise6
Simulate the following File Organization Techniques
a) Single Level Directory
b) Two Level
c) Hierarchical
d) DAG
Exercise7
Simulate Bankers Algorithm for Deadlock Avoidance
Exercise 8
Simulate Bankers Algorithm for Deadlock Prevention
Exercise9
Simulate the following page replacement algorithms
a) FIFO
b) LRU
c) LFU
Exercise10
Simulate Paging Technique of memory management.
CO1 Design various Scheduling algorithms, Apply the principles of concurrency.
CO2 Design deadlock, prevention and avoidance algorithms.
CO3 Compare and contrast various memory management schemes.
CO4 Design and Implement a prototype file system, Perform administrative tasks on
Linux Servers.
CO5 Introduction to Android Operating System Internals.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - - 2
CO2 2 2 3 - - - - - - - - - - 2
CO3 2 2 3 - - - - - - - - - - 2
CO4 2 2 3 - - - - - - - - - - 2
CO5 2 2 3 - - - - - - - - - - 2
Course 2 2 3 - - - - - - - - - - 2
R PROGRAMMING LAB
Number of Tutorial Hours/Week 03 (P) Exam Marks 50
Credits – 1.5
List of Experiments
Exercise1
Installation of R Software
Exercise2
Implementation of variables.
Exercise3
Implement univariate statistics.
Exercise4
Implement basics of Probability.
Exercise5
Generation of Histograms.
Exercise6
Implement the process of measuring Central Tendency and Dispersion.
Exercise7
Implement the process of calculating Standard Deviations, Standard Scores and Normal
Distribution.
Exercise8
Implement the process of sample selection
Exercise9
Implement hypothesis testing: Testing the significance of difference between two
means.
Exercise10
Create association or relation among the Nominal variables.
Exercise11
Create association or relation among the Ordinal variables.
Exercise12
Create association or relation among the Interval/Ratio variables.

CO1 List motivation for learning a programming language
CO2 Access online resources for R and import new function packages into the R
workspace
CO Import, review, manipulate and summarize data-sets in R
3
CO4 Explore data-sets to create testable hypotheses and identify appropriate statistical
tests
CO5 Perform appropriate statistical tests using R Create and edit visualizations
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - - 2
CO2 2 2 2 - 3 - - - - - - - - 2
CO3 2 2 2 - 3 - - - - - - - - 2
CO4 2 2 2 - 3 - - - - - - - - 2
CO5 2 2 2 - 3 - - - - - - - - 2
Course 2 2 2 - 3 - - - - - - - - 2
Detailed Syllabus
VI SEMESTER (III-I)
FORMAL LANGUAGES & AUTOMATA THEORY
Number of Lecture Hours/Week 3(L)+1(T) Exam Marks 70
Credits – 04
Unit -1: Finite Automata & Regular Expressions Hours
The Central Concepts of Automata Theory, Finite Automation, Transition
Systems, Acceptance of a String by a Finite Automation, DFA, Design of
DFAs, NFA, Design of NFA, Equivalence of DFA and NFA, Conversion of
NFA into DFA, Finite Automata with E-Transition, Minimization of Finite 08
Automata, Mealy and Moore Machines, Regular Expressions, Regular Sets,
Identity Rules, Equivalence of two Regular Expressions, Manipulations of
Regular Expressions, Inter Conversion, Equivalence between Finite Automata
and Regular Expressions, Pumping Lemma, Closers Properties, Applications of
Regular Expressions, Regular Expressions and Regular Grammars.
Unit -2: Context Free Grammars
Formal Languages, Grammars, Classification of Grammars, Chomsky
Hierarchy Theorem, Context Free Grammar, Leftmost and Rightmost
Derivations, Parse Trees, Ambiguous Grammars, Simplification of Context 10
Free Grammars-Elimination of Useless Symbols, E and Unit Productions,
Normal Forms for Context Free Grammars-Chomsky Normal Form and
Greibach Normal Form, Pumping Lemma, Closure Properties, Applications of
Context Free Grammars.
Unit – 3: Pushdown Automata
Definition, Model, Graphical Notation, Instantaneous Description Language

Acceptance of pushdown Automata, Design of Pushdown Automata, 10
Deterministic and Non – Deterministic Pushdown Automata, Equivalence of
Pushdown Automata and Context Free Grammars Conversion, Two Stack
Pushdown Automata, Application.
Unit – 4: Turning Machine
Definition, Model, Representation of Turing Machines-Instantaneous

Descriptions, Transition Tables and Transition Diagrams, Language of a Turing
Machine, Design of Turing Machines, Techniques for Turing Machine 10
Construction, Types of Turing Machines, Church’s Thesis, Universal Turing
Machine, Restricted Turing Machine.
Unit – 5: Computability
Decidable and Un-decidable Problems, Halting Problem of Turing Machines,

Post’s Correspondence Problem, Modified Post’s Correspondence Problem, 12
Classes of P and NP, NP Hard and NP-Complete Problems.
T1 Introduction to Automata Theory, Languages and Computation, J.E.Hopcroft,
R.Motwani and J.D.Ullman, 3rd Edition, Pearson, 2008.
T2 Theory of Computer Science-Automata, Languages and Computation,
K.L.P.Mishra and N.Chandrasekharan, 3rd Edition, PHI, 2007.
T3 A Text Book on Automata Theory, Nasir S.F.B, P.K. Srimani, Cambridge
Univeristy Press.
T4 Elements of Theory and Computation, Henry R Lewis, Papdimitriou, PHI
T5 Introduction to Theory of Computation. 2nd ed, Michel Sipser, CENGAGE
R1 Formal Language and Automata Theory, K.V.N.Sunitha and N.Kalyani, Pearson,
2015.
R2 Introduction to Automata Theory, Formal Languages and Computation,
Shyamalendu Kandar, Pearson, 2013.
R3 Theory of Computation, V.Kulkarni, Oxford University Press, 2013
W1 https://www.coursebuffet.com/sub/computer-science/516/theory-of-automata-
formal-languages-and-computation
W2 https://online.stanford.edu/courses/soe-ycsautomata-automata-theory

CO1 Classify machines by their power to recognize languages.
CO2 Employ finite state machines to solve problems in computing.
CO3 Explain deterministic machines.
CO4 Explain non-deterministic machines.
CO5 Comprehend the hierarchy of problems arising in the computer science

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
DATABASE SYSTEMS
Credits – 03
Unit -1: Database system architecture, Introduction Hours
The Three Levels of Architecture, (External Level, Conceptual Level, Internal
Level), Mapping, The Database Administrator, The Database Management
Systems, Client/Server Architecture. The E/R Models, The Relational Model,
Relational Calculus, Introduction to Database Design, Database Design and Er 08
Diagrams, Entities Attributes, and Entity Sets, Relationship and Relationship
Sets, Conceptual Design with the Er Models, The Relational Model Integrity
Constraints Over Relations, Key Constraints, Foreign Key Constraints, General
Constraints
Unit -2:Relational Algebra and Calculus
Relational Algebra, Selection and Projection, Set Operation, Renaming, Joins,
Division, More Examples of Queries, Relational Calculus, Tuple Relational
10
Calculus, Domain Relational Calculus.
Queries, Constraints, Triggers: The Form of Basic SQL Query, Union,
Intersect, and Except, Nested Queries, Aggregate Operators, Null Values,
Complex Integrity Constraints in SQL, Triggers and Active Database.
Unit – 3: Schema Refinement (Normalization)
Purpose of Normalization or schema refinement, concept of functional

dependency, normal forms based on functional dependency (1NF, 2NF and 3 10
NF), concept of surrogate key, Boyce-Codd normal form (BCNF), Lossless join
and dependency preserving decomposition, Fourth normal form(4NF).
Unit – 4: Transaction Management and Concurrency Control
Transaction, properties of transactions, transaction log, and transaction

management with SQL using commit rollback and save point. Concurrency
control for lost updates, Uncommitted data, inconsistent retrievals and the
Scheduler. Concurrency control with locking methods: lock granularity, lock 10
types, two phase locking for ensuring serializability, deadlocks, Concurrency
control with time stamp ordering: Wait/Die and Wound/Wait Schemes,
Database Recovery management: Transaction recovery.
Unit – 5:Overview of Storages
Data on External Storage, File Organization and Indexing, Clustered Indexing, Primary
and Secondary Indexes, Index Data Structures,Hashing:Static Hashing, Hash Table,
Hash Functions, Secure Hash Function, Overflow Handling, Theoretical Evaluation of 12
Overflow Techniques, Dynamic Hashing, Motivation for Dynamic Hashing, Dynamic
Hashing Using Directories, Directory less Dynamic, Hashing.
T1 Introduction to Database Systems, CJ Date, Pearson
T2 Database Management Systems, 3rd Edition, Raghurama Krishnan, Johannes
Gehrke, TATA McGraw Hill.
T3 Database Systems - The Complete Book, H G Molina, J D Ullman, J Widom
Pearson
T4 Database Management Systems,6/e Ramez Elmasri, Shamkant B. Navathe, PEA
R1 Data base Systems design, Implementation, and Management, 7th Edition, Peter Rob
& Carlos Coronel
R2 Database System Concepts, 5th edition, Silberschatz, Korth, TMH
R3 The Database Book Principles & Practice Using Oracle/MySQL, Narain Gehani,
University Press.
W2 https://www.coursera.org/courses?query=database

CO1 Describe a relational database and object-oriented database. Create, maintain and
manipulate a relational database using SQL
CO2 Describe ER model and normalization f or database design.
CO3 Examine issues in data storage and query processing and can formulate appropriate
solutions.
CO4 Understand the role and issues in management of data like efficiency, privacy,
security, ethical responsibility, and strategic advantage.
CO5 Design and build database system for a given real world problem.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
SOFTWARE ENGINEERING
(PROGRAM ELECTIVE-I)
Subject Code 18CSCSP6031 IA Marks 30
Credits – 03
Unit -1: Software and Software Engineering Hours
The Nature of Software, The Unique Nature of Web Apps, Software
Engineering, Software Process, Software Engineering Practice, software Myths.
Process Models:A Generic Process Model, Process Assessment and
Improvement, Prescriptive Process Models, Specialized Process Models, The 08
Unified Process, Personal and Team Process Models, Process Terminology,
Product and Process.Requirements Analysis and Specification:Requirements
Gathering and Analysis, Software Requirement Specification (SRS), Formal
System Specification.
Unit -2: Software Design
Overview of the Design Process, How to Characterize of a Design, Cohesion
and Coupling, Layered Arrangement of Modules, Approaches to Software
Design. Function-Oriented Software Design:Overview of SA/SD Methodology,
Structured analysis, Developing the DFD Model of a System, Structured 10
Design, Detailed Design, Design Review, over view of Object-Oriented design.
User Interface Design: Characteristics of Good User Interface, Basic Concepts,
Types of User Interfaces, Fundamentals of component-based GUI
Development, A User Interface Design Methodology.
Unit – 3: Coding and Testing
Coding, Code Review, Software Documentation, Testing, Unit Testing, Black-

Box Testing, White-Box Testing, Debugging, Program Analysis Tool, 10
Integration Testing, Testing Object-Oriented Programs, System Testing, Some
General Issues Associated with Testing.
Unit – 4: Software Reliability and Quality Management
Software Reliability, Statistical Testing, Software Quality, Software Quality

Management System, ISO 9000, SEI Capability Maturity Model. Computer
Aided Software Engineering:Case and its Scope, Case Environment, Case 10
Support in Software Life Cycle, Other Characteristics of Case tools, Towards
Second Generation CASE Tool, Architecture of a Case Environment.
Unit – 5: Software Maintenance
Software maintenance, Maintenance Process Models, Maintenance Cost, Software
Configuration Management. Software Reuse: what can be reused? Why almost No 12
Reuse So Far? Basic Issues in Reuse Approach, Reuse at organization Level.
T1 Software engineering A practitioner’s Approach, Roger S. Pressman, Seventh
Edition McGrawHill International Edition.
T2 Fundamentals of Software Engineering, Third Edition, Rajib Mall, PHI.
T3 Software Engineering, Ian Sommerville, Ninth edition, Pearson education
T4 Software Engineering, Concepts and Practices, Ugrasen Suman, Cengage Learning
R1 Software Engineering A Primer, Waman S Jawadekar, Tata McGraw-Hill, 2008
R2 Software Engineering, A Precise Approach, Pankaj Jalote, Wiley India, 2010.
R3 Software Engineering, Principles and Practices, Deepak Jain, Oxford University
Press
R4 Software Engineering1: Abstraction and modeling, Diner Bjorner, Springer
International edition, 2006.
R5 Software Engineering concepts, R. Fairley, TMH.
W1 https://www.edx.org/learn/software-engineering
W2 https://www.coursera.org/courses?query=software%20engineering

CO1 Define and develop a software project from requirement gathering to
implementation.
CO2 Obtain knowledge about principles and practices of software engineering
CO3 Focus on the fundamentals of software project
CO4 Focus on modelling a software project
CO5 Obtain knowledge about estimation and maintenance of software systems

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 2 - - - - - - - - - 2 -
CO2 2 3 2 - - - - - - - - - 2 -
CO3 2 3 2 - - - - - - - - - 2 -
CO4 2 3 2 - - - - - - - - - 2 -
CO5 2 3 2 - - - - - - - - - 2 -
Course 2 3 2 - - - - - - - - - 2 -
NETWORK PROTOCOLS
Credits – 03
Unit -1: IP ADDRESSING Hours
Decimal Notation-Classes, special addresses, A simple Internet-Unicast and
Broadcast addresses, Applying for IP addresses, Private networks.
SUBNETTING AND SUPERNETTING: Subnetting, Masking-Examples of 08
Subnetting, Variable length Subnetting, Super netting. INTERNET
PROTOCOL: Datagram Fragmentation, Options, Checksum, IP design. ARP,
RARP.
Unit -2:INTERNET CONTROL MESSAGE PROTOCOL
Types of Messages, Message formats, Error reporting, Query, Checksum,
ICMP design. INTERNET GROUP MANAGEMENT 10
PROTOCOLS: Multicasting, IGMP, Encapsulation, Multicast Backbone, IGMP
design. USER DATAGRAM PROTOCOL: Process to process communication,
User datagram, Checksum, UDP operation, uses of UDP, UDP design.
Unit – 3:TRANSMISSION CONTROL PROTOCOL
Process to Process communication, TCP Services, Segment, Options,

Checksum, Flow control, Error Control, TCP Timers, Connection, State
Transition Diagram, Congestion Control, TCP operation, TCP Design.
APPLICATION LAYER AND CLIENT-SERVER MODEL: Client-server Model, 10
Concurrency-Processes, BOOTP-DHCP, DOMAIN NAME SYSTEM: Name
Space, Domain name Space, Distribution of Name space, DNS in the Internet,
Resolution, DNS Messages, Types of Records, Compression, DDNS
Encapsulation.
Unit – 4:TELNET AND RLOGIN
Concept-Network Virtual Terminal, NVT character set , Embedding, Option

Negotiation, Sub option Negotiation, Controlling Server, Out of Band
signalling, Escape character, Mode of Operation, Examples, User Interface,
Rlogin, Security Issue. FILE TRANSFER PROTOCOL: Connections, 10
Communication-Command Processing-File, Transfer-User, Interface-
Anonymous, FTP.
TRIVIAL FILE TRANSFER PROTOCOL: Messages, Connection, Data
Transfer, UDP ports, TFTP Example, TFTP options, Security, Applications.
Unit – 5:HYPERTEXT TRANSFER PROTOCOL
HTTP overview, Proxy, Gateway, Tunnel, Cache, Messages, General Header 12

Fields, Cache Control, Connection, Request Methods, Request Header Fields,
Response Messages, Response Header Fields, Entity Header Fields,
Client/Server Authentication. SOCKET INTERFACE: Definitions, Sockets,
Byte ordering, Address Transformation, Byte manipulation, Function-
Information about Remote, Host- Socket System Calls, Connectionless Iterative
server, UDP Client/Server Programs, Connection oriented Concurrent Server,
TCP Client/Server Programs

T1 TCP/IP Protocol Suite. Behrouz A. Forouzan (TMH edition).
R1 Internetworking with TCP/IP. D. E. Comer (PHI publications).
W1 https://www.coursera.org/learn/network-protocols-architecture
W2 https://www.perpetual-solutions.com/training-course/436/hands-on-tcp-ip-and-
internet-protocols

CO1 Create, test and debug Android application by setting up Android development
environment
CO2 Implement adaptive, responsive user interfaces that work across a wide range of
devices. Infer long running tasks and background work in Android applications.
CO3 Demonstrate methods in storing, sharing and retrieving data in Android
applications.
CO4 Analyze performance of android applications and understand the role of
permissions and security.
CO5 Describe the steps involved in publishing Android application to share with the
world.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - 2 -
CO2 2 2 2 - 3 - - - - - - - 2 -
CO3 2 2 2 - 3 - - - - - - - 2 -
CO4 2 2 2 - 3 - - - - - - - 2 -
CO5 2 2 2 - 3 - - - - - - - 2 -
Course 2 2 2 - 3 - - - - - - - 2 -
MOBILE APPLICATION DEVELOPMENT
Credits – 03
Get started, build your first app, Activities, Testing, debugging and using
08
support libraries.
Unit -2: User Interaction
User Interaction, Delightful user experience, Testing your UI. 10
Unit – 3: Background Tasks
Background Tasks, Triggering, scheduling and optimizing background tasks. 10

Unit – 4: Data
All about data, Preferences and Settings, storing data using SQLite, sharing
10
data with content providers, loading data using Loaders.
Unit – 5: Permissions
Permissions, Performance and Security, Firebase and Ad Mob, Publish. 12

T1 The complete Reference Java, 9th edition, Herbert Scheldt, TMH.
T2 Programming in JAVA, Sachin Malhotra, Saurabh Choudary, Oxford.
R1 JAVA Programming, K.Rajkumar.Pearson
R2 Core JAVA, Black Book, Nageswara Rao, Wiley, Dream Tech
R3 Core JAVA for Beginners, Rashmi Kanta Das, Vikas.
R4 Object Oriented Programming Through Java, P. Radha Krishna, Universities Press.
W1 https://www.edx.org/learn/app-development
W2 https://www.coursera.org/courses?query=mobile%20app%20development

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 3 3 3 - 3 - - - - - - - 2 -
CO2 2 3 3 - 2 - - - - - - - 2 -
CO3 2 3 3 - 2 - - - - - - - 2 -
CO4 2 3 3 - 2 - - - - - - - 2 -
CO5 2 3 3 - 2 - - - - - - - 2 -
Course 3 3 3 - 2 - - - - - - - 2 -
ENGINEERING ECONOMICS & FINANCIAL MANAGEMENT
Subject Code 18CMMST6050 IA Marks 30
Credits – 03
Unit -1: Introduction to Managerial Economics and demand Analysis Hours
Definition of Managerial Economics and Scope-Managerial Economics and its
relation with other subjects-Concepts of Demand-Types-Determents-Law of 16
Demand its Exception-Elasticity of Demand-Types and Measurement- Demand
forecasting and its Methods.
Unit -2:Production and Cost Analysis
Production function-Isoquants and Isocost-Law of Variable proportions- Cobb-
Douglas Production Function-Economics of Sale-Cost Concepts- Opportunity 14
Cost-Fixed vs Variable Costs-Explicit Costs vs Implicit Costs- Cost Volume
Profit analysis- Determination of Break-Even Point (Simple Problems).
Unit – 3:Introduction To Markets, Pricing Policies & forms Organizations and
Business Cycles
Market Structures: Perfect Competition, Monopoly and Monopolistic and

Oligopoly – Features – Price, Output Determination – Methods of Pricing:
Market Skimming Pricing, And Internet Pricing: Flat Rate Pricing. Features and 13
Evaluation of Sole Trader – Partnership – Joint Stock Company – State/Public
Enterprises and their forms – Business Cycles – Meaning and Features – Phases
of Business Cycle
Unit – 4:Introduction to Accounting & Financing Analysis
Introduction to Double Entry Systems – Preparation of Financial Statements-

Analysis and Interpretation of Financial Statements-Ratio Analysis – 12
Preparation of Funds flow cash flow statements (Simple Problems)
Unit – 5:Capital and Capital Budgeting
Capital Budgeting: Meaning of Capital-Capitalization-Meaning of Capital

Budgeting-Need for Capital Budgeting-Techniques of Capital Budgeting- 14
Traditional and Modern Methods.

T1 Managerial Economics and Financial Analysis, Dr. A. R. Aryasri, TMH 2011.
T2 Managerial Economics and Financial Analysis, 1/e, B. Kuberadu, HPH, 2013
T3 Management Science, Dr. P. Vijaya Kumar & Dr. N. Apparao, Cengage, Delhi,
2012
T4 Management Science, Dr. A. R. Arya Sri, TNH, 2011.
R1 Financial Accounting for Management, Ambrish Gupta, Pearson Education, New
Delhi.
R2 Managerial Economics, 4th Ed, H. Craig Peterson & W. Cris Lewis, PHI.
R3 Essentials of management, Koontz and weihrich, TMH 2011
R4 Global management systems, Seth& Rastogi, Cengage learning,delhi,2011
R5 Managerial Economics, V. Maheswari, Sultan Chand
R6 Managerial Economics & Financial Analysis, Dr. B. Kuberudu and Dr. T. V.
Ramana, Himalaya Publishing House 2011.
W1 https://www.coursera.org/courses?query=financial%20engineering
W2 https://www.mooc-list.com/categories/economics-finance

CO1 Students are equipped with the knowledge of managerial economics and
estimating demand for a product.
CO2 Students understand Production and Cost concepts, estimating Cost Break even
Analysis.
CO3 Students are equipped with the knowledge on Markets and Pricing methods along
with Business Cycles.
CO4 Students are able to understand Accounting Concepts and Prepare Financial
Statements- Analysis
CO5 Students are able to analyze various investment project proposals with the help of
Capital Budgeting techniques.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - - - - - - - 3 - 2 -
CO2 2 2 2 - - - - - - - 3 - 2 -
CO3 2 2 2 - - - - - - - 3 - 2 -
CO4 2 2 2 - - - - - - - 3 - 2 -
CO5 2 2 2 - - - - - - - 3 - 2 -
Course 2 2 2 - - - - - - - 3 - 2 -
DATABASE SYSTEMS LAB
Credits – 1.5
List of Experiments
SQL
Exercise1
Queries to facilitate acquaintance of Built-In Functions, String Functions, Numeric
Functions, Date Functions and Conversion Functions.
Exercise2
Queries using operators in SQL
Exercise3
Queries to Retrieve and Change Data: Select, Insert, Delete, and Update
Exercise4
Queries using Group By, Order By, and Having Clauses
Exercise5
Queries on Controlling Data: Commit, Rollback, and Save point
Exercise6
Queries to Build Report in SQL *PLUS
Exercise7
Queries for Creating, Dropping, and Altering Tables, Views, and Constraints
Exercise 8
Queries on Joins and Correlated Sub-Queries
Exercise9
Queries on Working with Index, Sequence, Synonym, Controlling Access, and Locking
Rows for Update, Creating Password and Security features
PL/SQL
Exercise10
Write a PL/SQL Code using Basic Variable, Anchored Declarations, and Usage of
Assignment Operation
Exercise11
Write a PL/SQL Code Bind and Substitution Variables. Printing in PL/SQL
Exercise12
Write a PL/SQL block using SQL and Control Structures in PL/SQL
Exercise13
Write a PL/SQL Code using Cursors, Exceptions and Composite Data Types
Exercise14
Write a PL/SQL Code using Procedures, Functions, and Packages FORMS
Exercise15
Write a PL/SQL Code Creation of forms for any Information System such as Student
Information System, Employee Information System etc. 18
Exercise16
Demonstration of database connectivity
CO1 Understand, appreciate and effectively explain the underlying concepts of database
technologies.
CO2 Design and implement a database schema for a given problem-domain, Normalize
a database
CO3 Populate and query a database using SQL DML/DDL commands.
CO4 Declare and enforce integrity constraints on a database using a state-of-the-art
RDBMS
CO5 Programming PL/SQL including stored procedures, stored functions, cursors,
packages. Design and build a GUI application using a 4GL

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - - 2
CO2 2 2 3 - - - - - - - - - - 2
CO3 2 2 3 - - - - - - - - - - 2
CO4 2 2 3 - - - - - - - - - - 2
CO5 2 2 3 - - - - - - - - - - 2
Course 2 2 3 - - - - - - - - - - 2
PYTHON PROGRAMMING LAB
Credits – 1.5
List of Experiments
Exercise 1 - Basics
a) Running instructions in Interactive interpreter and a Python Script
b) Write a program to purposefully raise Indentation Error and Correct it
Exercise 2 - Operations
a) Write a program to compute distance between two points taking input from the user
(Pythagorean Theorem)
b) Write a program add.py that takes 2 numbers as command line arguments and prints
its sum.
Exercise - 3 Control Flow
a) Write a Program for checking whether the given number is a even number or not.
b) Using a for loop, write a program that prints out the decimal equivalents of 1/2, 1/3,
1/4, . . . ,1/10
c) Write a program using a for loop that loops over a sequence. What is sequence?
d) Write a program using a while loop that asks the user for a number, and prints a
countdown
from that number to zero.
Exercise 4 - Control Flow - Continued
a) Find the sum of all the primes below two million.
Each new term in the Fibonacci sequence is generated by adding the previous two
terms. By
starting with 1 and 2, the first 10 terms will be:
1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
b) By considering the terms in the Fibonacci sequence whose values do not exceed four
million,
find the sum of the even-valued terms.
Exercise - 5 - DS
a) Write a program to count the numbers of characters in the string and store them in a
dictionary data structure
b) Write a program to use split and join methods in the string and trace a birthday with a
dictionary data structure.
Exercise - 6 DS - Continued
a) Write a program combine_lists that combines these lists into a dictionary.
b) Write a program to count frequency of characters in a given file. Can you use
character
frequency to tell whether the given file is a Python program file, C program file or a text
file?
Exercise - 7 Files
a) Write a program to print each line of a file in reverse order.
b) Write a program to compute the number of characters, words and lines in a file.
Exercise - 8 Functions
a) Write a function ball_collide that takes two balls as parameters and computes if they
are colliding. Your function should return a Boolean representing whether or not the
balls are colliding.
Hint: Represent a ball on a plane as a tuple of (x, y, r), r being the radius
If (distance between two balls centers) <= (sum of their radii) then (they are colliding)
b) Find mean, median, mode for the given set of numbers in a list.
Exercise - 9 Functions - Continued
a) Write a function nearly_equal to test whether two strings are nearly equal. Two
strings a and b
are nearly equal when a can be generated by a single mutation on b.
b) Write a function dups to find all duplicates in the list.
c) Write a function unique to find all the unique elements of a list.
Exercise - 10 - Functions - Problem Solving
a) Write a function cumulative_product to compute cumulative product of a list of
numbers.
b) Write a function reverse to reverse a list. Without using the reverse function.
c) Write function to compute gcd, lcm of two numbers. Each function shouldn’t exceed
one line.
Exercise 11 - Multi-D Lists
a) Write a program that defines a matrix and prints
b) Write a program to perform addition of two square matrices
c) Write a program to perform multiplication of two square matrices
Exercise - 12 - Modules
a) Install packages requests, flask and explore them. using (pip)
b) Write a script that imports requests and fetch content from the page. Eg. (Wiki)
c) Write a simple script that serves a simple HTTP Response and a simple HTML Page
Exercise - 13 OOP
a) Class variables and instance variable
i) Robot
ii) ATM Machine
Exercise - 14 GUI, Graphics
1. Write a GUI for an Expression
2. Write a program to implement
Exercise - 15 - Testing
a) Write a test-case to check the function even_numbers which return True on passing a
list of all even numbers
b) Write a test-case to check the function reverse_string which returns the reversed
string.
Exercise - 16 - Advanced
a) Build any one classical data
b) Write a program to solve knapsack
CO1 Making Software easily right out of the box.
CO2 Experience with an interpreted Language.
CO3 To build software for real needs.
CO4 Prior Introduction to testing software

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 - - 3 - - - - - - - - 2
CO2 2 2 - - 3 - - - - - - - - 2
CO3 2 2 - - 3 - - - - - - - - 2
CO4 2 2 - - 3 - - - - - - - - 2
CO5 2 2 - - 3 - - - - - - - - 2
Course 2 2 - - 3 - - - - - - - - 2
Detailed Syllabus
VII SEMESTER (IV-I)

COMPILER DESIGN
Credits – 03
Introduction to Language Processing, Structure of a compiler the evaluation of
Programming language, The Science of building a Compiler application of
Compiler Technology, Programming Language Basics. Lexical Analysis: The
08
role of lexical analysis buffing, specification of tokens. Recognitions of tokens
the lexical analyzer generator, The Role of a parser, Context free Grammars
Writing A grammar.
Unit -2:Parser
Introduction to LR Parser, More Powerful LR parser (LR1, LALR) Using
Armigers Grammars Equal Recovery in LR parser Syntax Directed 10
Transactions Definition, Evolution order of SDTS Application of SDTS.
Syntax Directed Translation Schemes.
Unit – 3:Intermediated Code
Generation Variants of Syntax trees 3 Address code, Types and Deceleration, 10

Translation of Expressions, Type Checking, use and need of symbol tables
Unit – 4:Runtime Environments
Runtime Environments, Stack allocation of space, access to Non-Local date on

the stack Heap Management code generation – Issues in design of code
10
generation the target Language Address in the target code Basic blocks and
Flow graphs. A Simple Code generation
Unit – 5: Optimization
Machine Independent Optimization. The principle sources of Optimization peep

12
hole Optimization, Introduction to Date flow Analysis.

T1 Compilers, Principles Techniques and Tools, 2nd edition, Alfred V Aho, Monical S.
Lam, Ravi Sethi Jeffery D. Ullman, Pearson, 2007.
T2 Compiler Design, K. Muneeswaran, OXFORD
T3 Principles of Compiler Design, 2nd edition, Nandhini Prasad, Elsevier
R1 Compiler Construction, Principles and Practice, Kenneth C Louden, CENGAGE
R2 Implementations of Compiler, A New approach to Compilers including the
algebraic methods, Yunlinsu, SPRINGER
R3 Engineering a Compiler, 2nd edition, Keith D. Cooper & Linda Torezon, Morgan
Kaufman.
W2 https://www.coursera.org/courses?query=compilers

CO1 Acquire knowledge in different phases and passes of Compiler, and specifying
different types of tokens by lexical analyzer, and also able to use the Compiler
tools like LEX, YACC, etc.
CO2 Parser and its types i.e. Top-down and Bottom-up parsers.
CO3 Construction of LL, SLR, CLR and LALR parse table.
CO4 Syntax directed translation, synthesized and inherited attributes.
CO5 Techniques for code optimization.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
UNIFIED MODELLING LANGUAGE
(PROGRAM ELECTIVE – II)
Credits – 03
Introduction to OOAD, Activities/ Workflows / Disciplines in OOAD,
Introduction to iterative development and the unified process, Introduction to 08
UML, Mapping Disciplines to UML artefacts, why we model, Conceptual
model of UML, Architecture, Classes, Relationships, Common Mechanisms,
Class diagrams, Object diagrams.
Unit -2 : Classes and Objects
Nature of object, Relationships among objects, Nature of a Class, Relationship
among Classes, Interplay of Classes and Objects, Identifying Classes and 10
Objects, Importance of Proper Classification, Identifying Classes and Objects,
Key abstractions and Mechanisms.
Unit – 3:Basic Behavioral Modelling
Interactions, Interaction diagrams, Use cases, Use case Diagrams, Activity 10

Diagrams.
Unit – 4:Advanced Behavioral Modelling
Events and signals, state machines, processes and Threads, time and space,
10
state chart diagrams.
Unit – 5:Architectural Modelling
Component, Deployment, Component diagrams and Deployment diagrams.

12
Case Study: The Unified Library application.

T1 Object- Oriented Analysis and Design with Applications, Grady BOOCH, Robert
A. Maksimchuk, Michael W. ENGLE, Bobbi J. Young, Jim Conallen, Kellia
Houston, 3rd edition, 2013, PEARSON.
T2 The Unified Modeling Language User Guide, Grady Booch, James Rumbaugh, Ivar
Jacobson, 12th Impression, 2012, PEARSON.
T3 Applying UML and Patterns by Criag Larman, Person
R1 Object-oriented analysis and design using UML, Mahesh P. Matha, PHI.
R2 Head first object-oriented analysis and design, Brett D. McLaughlin, Gary Pollice,
Dave West, O‟Reilly.
R3 Object-oriented analysis and design with the Unified process John W. Satzinger,
Robert B. Jackson, Stephen D. Burd, Cengage Learning.
R4 The Unified modelling language Reference manual, James Rumbaugh, Ivar
Jacobson, Grady Booch, Addison-Wesley.
W1 https://www.coursera.org/courses?query=uml
W2 https://www.udemy.com/topic/uml/

CO1 Ability to find solutions to the complex problems using object-oriented approach.
CO2 Represent classes, responsibilities and states using UML notation.
CO3 Identify Classes of problem domain.
CO4 Identify the responsibilities of the problem domain.
CO5 Learn Architectural modelling concepts

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 2 - - - - - - - - - 2 -
CO2 2 3 2 - - - - - - - - - 2 -
CO3 2 3 2 - - - - - - - - - 2 -
CO4 2 3 2 - - - - - - - - - 2 -
CO5 2 3 2 - - - - - - - - - 2 -
Course 2 3 2 - - - - - - - - - 2 -
CRYPTOGRAPHY & NETWORK SECURITY

Credits – 03
Unit -1: Basic Principles Hours
Security Goals, Cryptographic Attacks, Services and Mechanisms, Mathematics
of Cryptography, Symmetric Encryption:Mathematics of Symmetric Key 08
Cryptography, Introduction to Modern Symmetric Key Ciphers, Data
Encryption Standard, Advanced Encryption Standard.
Unit -2 : Asymmetric Encryption
Mathematics of Asymmetric Key Cryptography, Asymmetric Key 10

Cryptography.
Unit – 3: Data Integrity, Digital Signature Schemes & Key Management
Message Integrity and Message Authentication, Cryptographic Hash Functions, 10

Digital Signature, Key Management.
Unit – 4: Network Security-I

Security at application layer: PGP and S/MIME, Security at the Transport
10
Layer: SSL and TLS.
Unit – 5: Network Security-II
Security at the Network Layer: IPSec, System Security. 12

T1 Cryptography and Network Security, Behrouz A Forouzan, Debdeep
Mukhopadhyay, (3e) Mc Graw Hill.
T2 Cryptography and Network Security, William Stallings, (6e) Pearson.
T3 Everyday Cryptography, Keith M.Martin, Oxford.
R1 Network Security and Cryptography, Bernard Meneges, Cengage Learning.
R2 Hack Proofing your Network, Russell, Kaminsky, Forest Puppy, Wiley Dreamtech.
W2 https://www.coursera.org/learn/crypto

CO1 To be familiarity with information security awareness and a clear understanding of
its importance.
CO2 To master fundamentals of secret and public cryptography
CO3 To master protocols for security services
CO4 To be familiar with network security threats and countermeasures
CO5 To be familiar with network security designs using available secure solutions (such
as PGP, SSL, IPSec, etc).

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
DATA WAREHOUSING & MINING
Credits – 03
Why Data Mining? What Is Data Mining? What Kinds of Data Can Be Mined?
What Kinds of Patterns Can Be Mined? Which Technologies Are Used?,
08
Which Kinds of Applications Are Targeted? Major Issues in Data Mining. Data
Objects and Attribute Types, Basic Statistical Descriptions of Data, Data
Visualization, Measuring Data Similarity and Dissimilarity.
Unit -2: Data Pre-processing
Data Pre-processing: An Overview, Data Cleaning, Data Integration, Data 10
Reduction, Data Transformation and Data Discretization
Unit – 3: Classification
Basic Concepts, General Approach to solving a classification problem,

Decision Tree Induction: Working of Decision Tree, building a decision tree,
10
methods for expressing an attribute test conditions, measures for selecting the
best split, Algorithm for decision tree induction. Bayes’ Theorem, Naïve
Bayesian Classification, Bayesian Belief Networks
Unit – 4: Association Analysis
Problem Defecation, Frequent Item Set generation, Rule generation, compact

10
representation of frequent item sets, FP-Growth Algorithm.
Unit – 5: Cluster Analysis
What Is Cluster Analysis? Different Types of Clustering, Different Types of

Clusters; K-means: The Basic K-means Algorithm, K-means Additional Issues,
Bisecting K-means, Strengths and Weaknesses; Agglomerative Hierarchical
12
Clustering: Basic Agglomerative Hierarchical Clustering Algorithm DBSCAN:
Traditional Density Centre-Based Approach, DBSCAN Algorithm, Strengths
and Weaknesses.

T1 Introduction to Data Mining: Pang-Ning Tan & Michael Steinbach, Vipin Kumar,
Pearson.
T2 Data Mining concepts and Techniques, 3/e, Jiawei Han, Michel Kamber, Elsevier
R1 Data Mining Techniques and Applications: An Introduction, Hongbo Du, Cengage
Learning.
R2 Data Mining: Vikram Pudi and P. Radha Krishna, Oxford.
R3 Data Mining and Analysis - Fundamental Concepts and Algorithms; Mohammed J.
Zaki, Wagner Meira, Jr, Oxford
R4 Data Warehousing Data Mining & OLAP, Alex Berson, Stephen Smith, TMH.
R5 Data Mining: Introductory and Advanced Topics: Dunham, Pearson.
W1 https://www.edx.org/learn/data-mining
W2 https://www.coursera.org/specializations/data-mining
W3 https://www.coursera.org/courses?query=data%20warehouse

CO1 Understand stages in building a Data Warehouse
CO2 Understand the need and importance of pre-processing techniques
CO3 Understand the need and importance of Similarity and dissimilarity techniques
CO4 Analyze and evaluate performance of algorithms for Association Rules.
CO5 Analyze Classification and Clustering algorithms

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
DESIGN PATTERNS
(PROGRAM ELECTIVE – III)
Credits – 03
What Is a Design Pattern?, Design Patterns in Smalltalk MVC, Describing
Design Patterns, The Catalogue of Design Patterns, Organizing the Catalogue, 08
How Design Patterns Solve Design Problems, How to Select a Design Pattern,
How to Use a Design Pattern.
Unit -2 : Creational Patterns
Abstract Factory, Builder, Factory Method, Prototype, Singleton. 10
Unit – 3: Structural Pattern
Adapter, Bridge, Composite, Decorator, Façade, Flyweight, Proxy. 10

Unit – 4: Behavioral Patterns
Chain of Responsibility, Command, Interpreter, Iterator, Mediator, Memento,

10
Observer, Strategy, Template Method, what to expect from Design Patterns.
Unit – 5:A Case Study
Designing a Document Editor: Design Problems, Document Structure,

Formatting, Embellishing the User Interface, and Supporting Multiple Look-
12
and-Feel Standards, Supporting Multiple Window Systems, User Operations
Spelling Checking and Hyphenation.

T1 Design Patterns by Erich Gamma, Pearson Education.
R1 Satzinger: Object Oriented Analysis and Design, CENGAGE.
W1 https://www.coursera.org/courses?query=design%20patterns
W2 https://www.udemy.com/topic/design-pattern/

CO1 Identify the appropriate design patterns
CO2 To solve object-oriented design problems
CO3 Develop design solutions using creational patterns.
CO4 Apply structural patterns to solve design problems.
CO5 Construct design solutions by using behavioral patterns
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
CYBER SECURITY
Credits – 03
Unit -1: Introduction to Cybercrime Hours
Introduction, Cybercrime: Definition and Origins of the Word, Cybercrime and
Information Security, Who are Cybercriminals? , Classifications of
08
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 -2 : 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. Cybercrime Mobile and
Wireless Devices:Introduction, Proliferation of Mobile and Wireless Devices,
Trends in Mobility, Credit Card Frauds in Mobile and Wireless Computing Era, 10
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 – 3: 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,
10
Steganography, DoS and DDoS Attacks, SQL Injection, Buffer Overflow,
Attacks on Wireless Networks, Phishing and Identity Theft: Introduction,
Phishing, Identity Theft (IDTheft)
Unit – 4: 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 10
Governance, Information Security Policy Standards, Practices, The information
Security Blueprint, Security education, Training and awareness program,
Continuing Strategies?
Unit – 5: Understanding Computer Forensics
Introduction, Historical Background of Cyber forensics, Digital Forensics 12
Science, The Need for Computer Forensics, Cyber forensics and Digital
Evidence, Forensics Analysis of E-Mail, Digital Forensics Life Cycle, Chain of
Custody Concept, Network Forensics, Approaching a Computer Forensics
Investigation, Computer Forensics and Steganography, Relevance of the OSI 7
Layer Model to Computer Forensics, Forensics and Social Networking Sites:
The Security/Privacy Threats, Computer Forensics from Compliance
Perspective, Challenges in Computer Forensics, Special Tools and Techniques,
Forensics Auditing, Ant forensics

T1 Cyber Security: Understanding Cyber Crimes, Computer Forensics and Legal
Perspectives, Nina Godbole, Sunit Belapure, Wiley.
T2 Principles of Information Security, MichealE.Whitman and Herbert J.Mattord,
Cengage Learning.
R1 Information Security, Mark Rhodes, Ousley, MGH.
W1 https://www.edx.org/learn/cybersecurity
W2 https://www.cyberdegrees.org/resources/free-online-courses/

CO1 Cyber Security architecture principles
CO2 Identifying System and application security threats and vulnerabilities
CO3 Identifying different classes of attacks
CO4 Cyber Security incidents to apply appropriate response
CO5 Describing risk management processes and practices, Evaluation of decision
making outcomes of Cyber Security scenarios

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - - - - 3 - - - - 2 -
CO2 2 2 2 - - - - 3 - - - - 2 -
CO3 2 2 2 - - - - 3 - - - - 2 -
CO4 2 2 2 - - - - 3 - - - - 2 -
CO5 2 2 2 - - - - 3 - - - - 2 -
Course 2 2 2 - - - - 3 - - - - 2 -
ARTIFICIAL INTELLIGENCE
Credits – 03
Unit -1: Introduction to artificial intelligence Hours
Introduction, history, intelligent systems, foundations of AI, applications, tic- 08
tac-tie game playing, development of ai languages, current trends in AI.
Unit -2 : Problem solving: state-space search and control strategies
Introduction, general problem solving, characteristics of problem, exhaustive
searches, heuristic search techniques, iterative deepening a*, constraint
10
satisfaction, Problem reduction and game playing:Introduction, problem
reduction, game playing, alphabeta pruning, two-player perfect information
games
Unit – 3: Logic Concepts
Introduction, propositional calculus, proportional logic, natural deduction
10
system, axiomatic system, semantic tableau system in proportional logic,
resolution refutation in proportional logic, predicate logic.
Unit – 4: Advanced Knowledge Representation Techniques
Introduction, conceptual dependency theory, script structure, cyc theory, case
grammars, semantic web, Expert system and applications:Introduction phases
in building expert systems, expert system versus traditional systems, rule-based 10
expert systems blackboard systems truth maintenance systems, application of
expert systems, list of shells and tools.
Unit – 5: 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, 12
fuzzy logic, linguistic variables and hedges, fuzzy propositions, inference rules
for fuzzy propositions, fuzzy systems.

T1 Artificial Intelligence- Saroj Kaushik, CENGAGE Learning
T2 Artificial intelligence, A modern Approach, 2nded, Stuart Russel, Peter Norvig,
PEA
T3 Artificial Intelligence- Rich, Kevin Knight, Shiv Shankar B Nair, 3rded, TMH
T4 Introduction to Artificial Intelligence, Patterson, PHI
R1 Artificial intelligence, structures and Strategies for Complex problem solving, -
George F Lugar, 5thed, PEA
R2 Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
R3 Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier
W1 https://www.edx.org/learn/artificial-intelligence
W2 https://www.coursera.org/courses?query=artificial%20intelligence
CO1 Identify problems that is amenable to solution by AI methods, and which AI
methods may be suited to solving a given problem.
CO2 Formalize a given problem in the language/framework of different AI methods
(e.g., as a search problem, as a constraint satisfaction problem, as a planning
problem, as a Markov decision process, etc).
CO3 Implement basic AI algorithms (e.g., standard search algorithms or dynamic
programming).
CO4 Design and carry out an empirical evaluation of different algorithms on problem
formalization.
CO5 State the conclusions that the evaluation supports.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
COMPILER DESIGN LAB
Credits – 1.5
List of Experiments
Exercise1
Design a lexical analyzer for given language and the lexical analyzer should ignore
redundant spaces, tabs and new lines.
Exercise2
Simulate First and Follow of a grammar.
Exercise3
Develop an operator precedence parser for given language.
Exercise4
Construct recursive decent parser for an expression.
Exercise5
Construct LL(1) parser for an expression.
Exercise6
Design predictive parser for the given language.
Exercise7
Implementation of shift reduce parsing algorithm.
Exercise8
Design a LALR Bottom-up parser for the given language.
Exercise9
Implement the lexical analyzer using JLex, FLex or Lex or other lexical analyzer
generating tools.
Exercise10
Write a program to perform loop unrolling.
Exercise11
Convert the BNF rules into YACC form and write code to generate abstract syntax tree.
Exercise12
Write a program for constant propagation.

CO1 Demonstrate a working understanding of the process
CO2 Understanding of the process of lexical analysis
CO3 Understanding of the process of Parsing
CO4 Understanding of the process of various design aspects
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 3 2 2 - - - - - - - - - 2
CO2 2 3 2 2 - - - - - - - - - 2
CO3 2 3 2 2 - - - - - - - - - 2
CO4 2 3 2 2 - - - - - - - - - 2
CO5 2 3 2 2 - - - - - - - - - 2
Course 2 3 2 2 - - - - - - - - - 2
VIII SEMESTER (IV-II)
SOFTWARE TESTING
(PROGRAM ELECTIVE – IV)
Credits – 03
Purpose of Testing, Dichotomies, Model for Testing, Consequences of Bugs,
Taxonomy of Bugs. Flow graphs and Path testing: Basics Concepts of Path 08
Testing, Predicates, Path Predicates and Achievable Paths, Path Sensitizing,
Path Instrumentation, Application of Path Testing.
Unit -2 : Paths, Path products and Regular expressions
Path Products & Path Expression, Reduction Procedure, Applications, Regular
Expressions & Flow Anomaly Detection. Transaction Flow Testing:
10
Transaction Flows, Transaction Flow Testing Techniques. Dataflow testing:
Basics of Dataflow Testing, Strategies in Dataflow Testing, Application of
Dataflow Testing.
Unit – 3: Domain Testing
Domains and Paths, Nice & Ugly Domains, Domain testing, Domains and
Interfaces Testing, Domain and Interface Testing, Domains and Testability.
Syntax Testing: Why, What and How, A Grammar for formats, Test Case 10
Generation, Implementation and Application and Testability Tips. Logic Based
Testing: Overview, Decision Tables, Path Expressions, KV Charts, and
Specifications.
Unit – 4: State, State Graphs and Transition Testing
State Graphs, Good & Bad State Graphs, State Testing, and Testability Tips.
Graph Matrices and Application: Motivational overview, matrix of graph, 10
relations, power of a matrix, node reduction algorithm.
Unit – 5: Software Testing Tools
Introduction to Testing, Automated Testing, Concepts of Test Automation,
Introduction to list of tools like Win runner, Load Runner, JMeter, About Win
Runner, Using Win runner, Mapping the GUI, Recording Test, Working with
12
Test, Enhancing Test, Checkpoints, Test Script Language, putting it all
together, Running and Debugging Tests, Analyzing Results, Batch Tests, Rapid
Test Script Wizard.

T1 Software testing techniques – Boris Beizer, Dreamtech, second edition
T2 Software Testing- Yogesh Singh, Camebridge
R1 The Craft of software testing - Brian Marick, Pearson Education
R2 Software Testing, 3rd edition, P.C. Jorgensen, Aurbach Publications (Dist.by SPD).
R3 Software Testing, N.Chauhan, Oxford University Press.
R4 Introduction to Software Testing, P.Ammann&J.Offutt, Cambridge Univ.Press
R5 Effective methods of Software Testing, Perry, John Wiley, 2nd Edition, 1999
R6 Software Testing Concepts and Tools, P.NageswaraRao, dreamtech Press
R7 Win Runner in simple steps by Hakeem Shittu, 2007Genixpress
R8 Foundations of Software Testing, D.Graham& Others, Cengage Learning.
W1 https://alison.com/courses/software-testing
W2 https://testinginstitute.com/online/online-software-testing-training.php

CO1 Understand the basic testing procedures.
CO2 To support in generating test cases and test suites.
CO3 To test the applications manually by applying different testing methods
CO4 To test the applications by automation tools.
CO5 Apply tools to resolve the problems in Real time environment.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - 2 -
CO2 2 2 2 - 3 - - - - - - - 2 -
CO3 2 2 2 - 3 - - - - - - - 2 -
CO4 2 2 2 - 3 - - - - - - - 2 -
CO5 2 2 2 - 3 - - - - - - - 2 -
Course 2 2 2 - 3 - - - - - - - 2 -
MOBILE COMPUTING
Credits – 03
Mobile Communications, Mobile Computing – Paradigm, Promises/Novel
Applications and Impediments and Architecture; Mobile and Handheld
Devices, Limitations of Mobile and Handheld Devices. GSM – Services,
System Architecture, Radio Interfaces, Protocols, Localization, Calling, 08
Handover, Security, New Data Services, GPRS. (Wireless) Medium Access
Control (MAC):Motivation for a specialized MAC (Hidden and exposed
terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA, Wireless
LAN/(IEEE 802.11)
Unit -2 : Mobile Network Layer
IP and Mobile IP Network Layers, Packet Delivery and Handover
10
Management, Location Management, Registration, Tunnelling and
Encapsulation, Route Optimization, DHCP.
Unit – 3: Mobile Transport Layer
Conventional TCP/IP Protocols, Indirect TCP, Snooping TCP, Mobile TCP,
Other Transport Layer Protocols for Mobile Networks. Database
10
Issues:Database Hoarding & Caching Techniques, Client-Server Computing &
Adaptation, Transactional Models, Query processing, Data Recovery Process
&QoS Issues.
Unit – 4: Data Dissemination and Synchronization
Communications Asymmetry, Classification of Data Delivery Mechanisms,
Data Dissemination, Broadcast Models, Selective Tuning and Indexing 10
Methods, Data Synchronization – Introduction, Software, and Protocols.
Unit – 5: Mobile Ad hoc Networks
Introduction, Applications & Challenges of a MANET, Routing, Classification
of Routing Algorithms, Algorithms such as DSR, AODV, DSDV, etc. , Mobile
Agents, Service Discovery. Protocols and Platforms for Mobile Computing: 12
WAP, Bluetooth, XML, J2ME, Java Card, PalmOS, Windows CE, SymbianOS,
Linux for Mobile Devices, Android.

T1 Mobile Communications, Jochen Schiller, Addison-Wesley, Second Edition, 2009
T2 Mobile Computing, Raj Kamal, Oxford University Press, 2007.
R1 Mobile Computing, Technology Applications and Service Creation, ASOKE K
TALUKDER, HASAN AHMED, ROOPA R YAVAGAL, Second Edition, Mc
Graw Hill
R2 Principles of Mobile Computing, UWE Hansmann, LotherMerk, Martin S.
Nocklous, Thomas Stober, Second Edition, Springer.
W1 https://swayam.gov.in/course/3696-mobile-computing

CO1 To think and develop new mobile application.
CO2 To take any new technical issue related to this new paradigm and come up with a
solution(s).
CO3 To develop new ad hoc network applications and/or algorithms/protocols.
CO4 To understand & develop any existing mobile time environment.
CO5 To understand & develop new protocol related to mobile time environment.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
MACHINE LEARNING
Credits – 03
Unit -1: The ingredients of machine learning, Tasks Hours
The problems that can be solved with machine learning, Models: the output of
machine learning, Features, the workhorses of machine learning. Binary 08
classification and related tasks:Classification, Scoring and ranking, Class
probability estimation. Beyond binary classification:Handling more than two
classes, Regression, Unsupervised and descriptive learning.
Unit -2 : Concept learning
The hypothesis space, Paths through the hypothesis space, Beyond conjunctive
concepts Tree models:Decision trees, Ranking and probability estimation trees, 10
Tree learning as variance reduction. Rule models:Learning ordered rule lists,
Learning unordered rule sets, Descriptive rule learning, First-order rule learning
Unit – 3: Linear models
The least-squares method, The perceptron: a heuristic learning algorithm for

linear classifiers, Support vector machines, obtaining probabilities from linear 10
classifiers, Going beyond linearity with kernel methods. Distance Based
Models:Introduction, Neighbors and exemplars, Nearest Neighbors
classification, Distance Based Clustering, Hierarchical Clustering.
Unit – 4: Probabilistic models
The normal distribution and its geometric interpretations, Probabilistic models

for categorical data, Discriminative learning by optimizing conditional
Likelihood Probabilistic models with hidden variables. Features:Kinds of 10
feature, Feature transformations, Feature construction and selection. Model
ensembles: Bagging and random forests, Boosting
Unit – 5: Dimensionality Reduction
Principal Component Analysis (PCA), Implementation and demonstration.

Artificial Neural Networks:Introduction, Neural network representation,
12
appropriate problems for neural network learning, Multilayer networks and the
back-propagation algorithm.
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
SOFTWARE QUALITY ASSURANCE
(PROGRAM ELECTIVE – V)
Credits – 03
Unit -1: FUNDAMENTALS OF SOFTWARE QUALITY ASSURANCE Hours
The Role of SQA, SQA Plan, SQA considerations, SQA people, Quality,
08
Management, Software Configuration Management.
Unit -2 :MANAGING SOFTWARE QUALITY
Managing Software Organizations, Managing Software Quality, Defect
10
Prevention, Software Quality Assurance Management.
Unit – 3:SOFTWARE QUALITY ASSURANCE METRICS
Software Quality, Total Quality Management (TQM), Quality
10
Metrics, Software Quality Metrics Analysis.
Unit – 4:SOFTWARE QUALITY PROGRAM
Software Quality Program Concepts, Establishment of
a Software Quality Program, Software Quality Assurance Planning, An 10
Overview, Purpose & Scope.
Unit – 5:SOFTWARE QUALITY ASSURANCE STANDARDIZATION
Software Standards–ISO 9000 Quality System Standards, Capability
Maturity Model and the Role of SQA in Software Development Maturity, SEI 10
CMM Level 5, Comparison of ISO 9000 Model with SEI’s CMM.

T1 Software Quality, Mordechai Ben-Menachem / Garry S Marliss, Vikas Publishing
House, Pvt, Ltd., New Delhi.
T2 Managing the Software Process, Watts S Humphrey, Pearson Education Inc.
R1 Handbook of Software Quality Assurance, Gordon G Schulmeyer, Third Edition,
Artech House Publishers 2007
R2 Software Quality Assurance: Principles and Practice, Nina S Godbole, Alpha
Science International, Ltd, 2004
W1 https://www.udemy.com/software-quality-assurance/
W2 https://www.coursera.org/courses?query=quality%20assurance

CO1 To learn Software quality factors
CO2 To learn Common software testing methodologies
CO3 To learn about project process control
CO4 To learn about software metrics and standardizations
CO5 To learn about certifications
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - - - 3 - - - - - 2 -
CO2 2 2 2 - - - 3 - - - - - 2 -
CO3 2 2 2 - - - 3 - - - - - 2 -
CO4 2 2 2 - - - 3 - - - - - 2 -
CO5 2 2 2 - - - 3 - - - - - 2 -
Course 2 2 2 - - - 3 - - - - - 2 -
Ad-Hoc & SENSOR NETWORKS
Credits – 03
Unit -1: Ad-HOC Introduction Hours
Issues in Ad-Hoc Wireless Networks, MAC Protocols Issues,
08
Classifications of MAC protocols, Multi-channel MAC & Power control MAC
protocol.
Unit -2 :Ad-HOC Network routing & TCP
Issues, Classifications of routing protocol, Hierarchical and Power aware,
Multicast routing, Classifications, Tree based, Mesh based. Ad Hoc 10
Transport Layer Issues, TCP Over Ad Hoc, Feedback based, TCP with explicit
link, TCP Bus, Ad Hoc TCP, and Split TCP.
Unit – 3:WSN and MAC
Introduction, Sensor Network Architecture, Data dissemination, Gathering.
10
MAC Protocols, self-organizing, Hybrid TDMA/FDMA and CSMA based
MAC.
Unit – 4:WSN Routing, Localization & QOS
Issues in WSN routing, OLSR, AODV. Localization, Indoor and Sensor
10
Network, Localization, QOS in WSN.
Unit – 5:Mesh Networks
Necessity for Mesh Networks, MAC enhancements, IEEE 802.11s
Architecture, Opportunistic routing, Self-configuration and Auto configuration
12
Capacity, Models, Fairness, Heterogeneous Mesh Networks, Vehicular Mesh
Networks.

T1 Mobile Ad hoc Networking, Marco Conti, Silvia Giordano, Ivan Ivan Stojmenovic
Stefano Basagni, Wiley, Second Edition,2015
T2 Ad Hoc Wireless Networks – Architectures and Protocols, C.SivaRamMurthy and
B.Smanoj, Pearson Education, 2006.
R1 Ad hoc Networking, Perkins, Pearson Education, 2008.
R2 Wireless Sensor Networks, Feng Zhao and Leonidas Guibas, Morgan Kaufman
Publishers, 2004.
R3 Ad Hoc MobileWireless Networks, C.K.Toh,
R4 Wireless Mesh Networking, Thomas Krag and Sebastin Buettrich, O’Reilly
Publishers, 2007.
W1 https://www.coursera.org/lecture/iot/lecture-3-2-manets-ED6nz
W2 https://nptel.ac.in/courses/106105160/
CO1 Understand the basic testing procedures
CO2 To support in generating test cases and test suites
CO3 To test the applications manually by applying different testing methods
CO4 To test the applications manually by automation tools
CO5 Apply tools to resolve the problems in Real time environment

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 3 - - - - - - - - 2 -
CO2 2 2 2 3 - - - - - - - - 2 -
CO3 2 2 2 3 - - - - - - - - 2 -
CO4 2 2 2 3 - - - - - - - - 2 -
CO5 2 2 2 3 - - - - - - - - 2 -
Course 2 2 2 3 - - - - - - - - 2 -
HADOOP & BIGDATA
Credits – 03
Unit -1: Data structures in Java Hours
Linked List, Stacks, Queues, Sets, Maps; Generics: Generic classes and Type
08
parameters, Implementing Generic Types, Generic Methods, Wrapper Classes,
Concept of Serialization
Unit -2 :Working with Big Data
Google File System, Hadoop Distributed File System (HDFS) – Building
blocks of Hadoop (Name node, Data node, Secondary Name node, Job Tracker, 10
Task Tracker), Introducing and Configuring Hadoop cluster (Local, Pseudo-
distributed mode, Fully Distributed mode), Configuring XML files.
Unit – 3:Writing MapReduce Programs
A Weather Dataset, Understanding Hadoop API for MapReduce Framework
(Old and New), Basic programs of Hadoop MapReduce: Driver code, Mapper
code, Reducer code, Record Reader, Combiner, Partitioned Hadoop I/O: The
Writable Interface, Writable Comparable and comparators, Writable Classes: 10
Writable wrappers for Java primitives, Text, Bytes Writable, Null Writable,
Object Writable and Generic Writable, Writable collections, Implementing a
Custom Writable: Implementing a Raw Comparator for speed, Custom
comparators.
Unit – 4:Pig
Hadoop Programming Made Easier Admiring the Pig Architecture, Going with
the Pig Latin Application Flow, Working through the ABCs of Pig Latin,
10
Evaluating Local and Distributed Modes of Running Pig Scripts, Checking out
the Pig Script Interfaces, Scripting with Pig Latin.
Unit – 5:Applying Structure to Hadoop Data with Hive
Saying Hello to Hive, Seeing How the Hive is Put Together, Getting Started
with Apache Hive, Examining the Hive Clients, Working with Hive Data
12
Types, Creating and Managing Databases and Tables, Seeing How the Hive
Data Manipulation Language Works, Querying and Analyzing Data

T1 Big Java, Cay Horstmann, 4th Edition, Wiley John Wiley & Sons, INC
T2 Hadoop: The Definitive Guide by Tom White, 3rd Edition, O’reilly
T3 Hadoop in Action by Chuck Lam, MANNING Publ.
T4 Hadoop for Dummies by Dirk deRoos, Paul C.Zikopoulos, Roman B.Melnyk,Bruce
Brown, Rafael Coss
R1 Hadoop in Practice by Alex Holmes, MANNING Publ.
R2 Hadoop MapReduce Cookbook, SrinathPerera, ThilinaGunarathne
W1 https://www.edx.org/learn/hadoop
W2 https://intellipaat.com/big-data-hadoop-training/
CO1 Preparing for data summarization.
CO2 Preparing for query, and analysis.
CO3 Applying data modeling techniques to large data sets
CO4 Creating applications for Big Data analytics
CO5 Building a complete business data analytic solution

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - 2 -
CO2 2 2 2 - 3 - - - - - - - 2 -
CO3 2 2 2 - 3 - - - - - - - 2 -
CO4 2 2 2 - 3 - - - - - - - 2 -
CO5 2 2 2 - 3 - - - - - - - 2 -
Course 2 2 2 - 3 - - - - - - - 2 -
SOFTWARE PROJECT MANAGEMENT
(PROGRAM ELECTIVE – VI)
Credits – 03
Project, Management, Software Project Management activities, Challenges in
software projects, stake holders, objectives & goals. Project Planning: Step-
wise planning, Project scope, Project products & deliverables, Project activities, 08
Effort estimation, Infrastructure. Project Approach: Life cycle models,
choosing technology, prototyping, life cycle phases, process artefacts, process
work flows.
Unit -2 :Effort estimation & Activity Planning
Estimation techniques, Function point analysis, SLOC, COCOMO, Usecase-
10
based estimation, Activity identification approaches, network planning models,
critical path analysis.
Unit – 3:Risk management
Risk categories, Identification, Assessment, Planning and management, PERT 10
technique, Monte Carlo approach.
Unit – 4:Project management and control
Creating framework for monitoring and control, progress monitoring, Cost
monitoring, Earned value analysis, defects tracking, issues tracking, status
10
reports, Types of resources, Identifying resource requirements, Resource
scheduling.
Unit – 5:Software Quality
Planning quality, defining quality – ISO 9016, Quality measures, quantitative
quality management planning, product quality & process quality metrics,
12
statistical process control capability maturity model, enhancing software
quality.

T1 Software Project Management, Bob Hughes & Mike Cotterell, TATA Mc Graw-
Hill
T2 Software Project Management, Walker Royce: Pearson Education, 2005
T3 Software Project Management in practice, Pankaj Jalote, Pearson
R1 Software Project Management, Joel Henry, Pearson Education
W1 https://www.coursera.org/courses?query=software%20project%20management
W2 https://www.qaiglobalinstitute.com/product/certificate-program-in-software-
project-management/

CO1 To match organizational needs to the most effective software development model
CO2 To understand basic concepts and issues of software project management
CO3 To effectively plan and implement the projects through managing people
CO4 To effectively plan and implement the projects through communication and
change.
CO5 To select and employ mechanisms for tracking the software projects

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 - 2 2 - - - - - 3 2 - - 2 -
CO2 - 2 2 - - - - - 3 2 - - 2 -
CO3 - 2 2 - - - - - 3 2 - - 2 -
CO4 - 2 2 - - - - - 3 2 - - 2 -
CO5 - 2 2 - - - - - 3 2 - - 2 -
Course - 2 2 - - - - - 3 2 - - 2 -
CYBER FORENSICS
Credits – 03
Unit -1: NETWORK LAYER SECURITY &TRANSPORT LAYER Hours
SECURITY
IPSec Protocol, IP Authentication Header, IP ESP, Key Management Protocol
08
for IPSec. Transport layer Security: SSL protocol, Cryptographic
Computations, TLS Protocol.
Unit -2:E-MAIL SECURITY & FIREWALLS
PGP, S/MIME, Internet Firewalls for Trusted System: Roles of Firewalls,
10
Firewall related Terminology, Types of Firewalls, Firewall designs, SET for
E-Commerce Transactions.
Unit – 3:INTRODUCTION TO COMPUTER FORENSICS
Introduction to Traditional Computer Crime, Traditional problems associated
with Computer Crime. Introduction to Identity Theft & Identity Fraud. Types of
CF techniques, Incident and incident response methodology, Forensic 10
duplication and investigation. Preparation for IR: Creating response tool kit and
IR team, Forensics Technology and Systems, Understanding Computer
Investigation, Data Acquisition.
Unit – 4:EVIDENCE COLLECTION AND FORENSICS TOOLS
Processing Crime and Incident Scenes, Working with Windows and DOS
10
Systems. Current Computer Forensics Tools: Software/ Hardware Tools.
Unit – 5:ANALYSIS AND VALIDATION
Validating Forensics Data, Data Hiding Techniques, Performing Remote
Acquisition, Network Forensics, Email Investigations, Cell Phone and Mobile 12
Devices Forensics.

T1 Internet Security: Cryptographic Principles, Algorithms and Protocols, Man Young
Rhee, Wiley Publications, 2003
T2 Computer Forensics and Investigations, Nelson, Phillips, Enfinger, Steuart,
Cengage Learning, India Edition, 2008.
R1 Computer Forensics, John R.Vacca, Cengage Learning, 2005
R2 Internet Cryptography, Richard E.Smith, 3rd Edition Pearson Education, 2008
W1 https://www.edx.org/course/computer-forensics-2
W2 https://www.coursera.org/courses?query=forensic

CO1 Understand the basic theory and concepts of cyber security and privacy including
policies, models, and mechanisms, ethics, legal issues, and human factors
associated with cyber security and forensics.
CO2 Understand security vulnerabilities and be able to describe threats and risks
directed at computer hardware and software and recognize and categorize network
vulnerabilities and attacks.
CO3 Be able to explain best practices in giving access to systems and networks and
implement proper authentication techniques, familiar with cryptographic
techniques, asymmetric key algorithms, and create certificates.
CO4 Describe the requirements for a cyber forensic investigation and demonstrate an
understanding of tools, techniques and procedures
CO5 Be conversant in current security-related issues in the fields of cyber security and
cyber forensics.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - - 3 - - - - - - 2 -
CO2 2 2 2 - - 3 - - - - - - 2 -
CO3 2 2 2 - - 3 - - - - - - 2 -
CO4 2 2 2 - - 3 - - - - - - 2 -
CO5 2 2 2 - - 3 - - - - - - 2 -
Course 2 2 2 - - 3 - - - - - - 2 -
DATA ANALYTICS
Credits – 03
Unit -1: Introduction to Big Data Hours
Big Data and its importance, Characteristics, Big data analytics, Basic
requirements, Big data applications, Map Reduce framework, Algorithms using 08
map reduce. NoSQL Databases: Key-value databases, Column-family
databases, Document databases, Graph databases
Unit -2:Apache Hadoop
Introduction, System principle, Architecture, Hadoop distributed file system,
Hadoop Map Reduce, YARN, Operation modes, Hadoop Installation, Cluster 10
creation, Hadoop commands, HDFS commands, YARN commands, Map
Reduce commands, Moving Data in and out of Hadoop, Hadoop programming.
Unit – 3:Hadoop Ecosystem
Introduction to Pig, Installation, Execution, Pig Latin: Basics, Data types,
Building blocks, Operators, Functions, Example Scripts. Introduction to
10
Hive: Installing and Running Hive, Hive QL, Tables, Querying data, User
defined functions, Partitioning, Joins, Simple projects. Overview of Spark:
Zookeeper, and other Hadoop Ecosystem tools.
Unit – 4:Data Analysis Techniques
Linear and logistic regression modelling, Naive Baye's classifier, Support
vector machine, Neural networks, Principal component analysis, Linear
10
Discriminant Analysis, K Nearest Neighbor, Decision Trees, Fuzzy logic,
Clustering Techniques : Hierarchical, agglomerative, and K– Means.
Unit – 5:Introduction to R
R Installation, Basic statements of R, Importing and exporting data,
Ordered and unordered factors, Arrays and matrices, Lists and data frames,
Reading data from files, Data visualization, Probability distributions,
12
Statistical models in R, Manipulating objects, Data Pre-processing, Feature
selection, Clustering, Classification and regression. Case Studies: Social
network analysis, Text analysis, Marketing analysis.

T1 Understanding Big data, Chris Eaton, Dirk deroos et al, McGraw Hill, 2012
T2 Hadoop: The Definitive Guide, Tom White, 3rd Edition, O’reilly, 2012
T3 Beginning R - The Statistical Programming Language, Mark Gardener, John Wiley
& Sons, Inc., 2012
R1 Professional Hadoop Solutions, Boris lublinsky, Kevin t. Smith, Alexey
Yakubovich, Wiley, 2015
R2 Principles of Data Mining, David Hand, Heiki Mannila, Padhria Smyth, PHI 2013
R3 Big Data Analytics: Disruptive Technologies for Changing the Game, Arvind Sathi,
1st Edition, IBM Corporation, 2012.
R4 An Introduction to R, W. N. Venables, D. M. Smith and the R Core Team,
R5 Mining of Massive Datasets, Jure Leskovec, Anand Rajaraman, Jeffrey D.
Ullman, Cambridge University Press, 2014.
R6 Data Mining: Concepts and Techniques, Jiawei Han and Micheline Kamber,
Morgan Kaufmann Publishers, Third Edition, 2010.
W1 https://www.coursera.org/browse/data-science/data-analysis
W2 https://www.edx.org/learn/data-analysis

CO1 Categorize and summarize big data and its importance
CO2 Differentiate various big data technologies like Hadoop, MapReduce.
CO3 Differentiate various big data technologies like Hadoop Ecosystem, R, and No-
SQL
CO4 Apply tools and techniques to analyze big data
CO5 Earn tips and tricks for big data use cases and solutions.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - 2 -
CO2 2 2 2 - 3 - - - - - - - 2 -
CO3 2 2 2 - 3 - - - - - - - 2 -
CO4 2 2 2 - 3 - - - - - - - 2 -
CO5 2 2 2 - 3 - - - - - - - 2 -
Course 2 2 2 - 3 - - - - - - - 2 -
OPEN ELECTIVES
INTERNET OF THINGS
Subject Code IA Marks 30
Credits – 03
Unit -1: The Internet of Things Hours
An Overview of Internet of things, Internet of Things Technology, behind IoTs
08
Sources of the IoTs, M2M Communication, Examples OF IoTs, Design
Principles for Connected Devices
Unit -2 :Business Models
Business Processes in the Internet of Things ,IoT/M2M systems LAYERS
AND designs standardizations ,Modified OSI Stack for the IoT/M2M
10
Systems ,ETSI M2M domains and High-level capabilities ,Communication
Technologies, Data Enrichment and Consolidation and Device Management
Gateway Ease of designing and affordability
Unit – 3:Design Principles for the Web Connectivity
Design Principles for the Web Connectivity for connected-Devices, Web
10
Communication protocols for Connected Devices, Message Communication
protocols for Connected Devices, Web Connectivity for connected-Devices.
Unit – 4:Internet Connectivity Principles
Internet Connectivity Principles, Internet connectivity, Application Layer
Protocols: HTTP, HTTPS, FTP, Telnet. Data Acquiring, Organizing and
Analytics in IoT/M2M, Applications/Services/Business Processes, IOT/M2M
10
Data Acquiring and Storage, Business Models for Business Processes in the
Internet of Things, Organizing Data, Transactions, Business Processes,
Integration and Enterprise Systems.
Unit – 5:Data Collection
Data Collection, Storage and Computing Using a Cloud Platform for IoT/M2M
Applications/Services, Data Collection, Storage and Computing Using cloud
platform Everything as a service and Cloud Service Models, IOT cloud-based
services using the Xively (Pachube/COSM), Nimbits and other platforms 12
Sensor, Participatory Sensing, Actuator, Radio Frequency Identification, and
Wireless, Sensor Network Technology, Sensors Technology, Sensing the
World.

T1 Internet of Things: Architecture, Design Principles And Applications, Rajkamal,
McGraw Hill Higher Education
T2 Internet of Things, A.Bahgya and V.Madisetti, Univesity Press, 2015
R1 Designing the Internet of Things, Adrian McEwen and Hakim Cassimally, Wiley
R2 Getting Started with the Internet of Things CunoPfister , Oreilly
W1 https://www.coursera.org/specializations/internet-of-things
W2 https://alison.com/course/internet-of-things-and-the-cloud
CO1 Demonstrate knowledge and understanding of the security and ethical issues of the
Internet of Things
CO2 Conceptually identify vulnerabilities in Internet of Things
CO3 Conceptually identify recent attacks, involving the Internet of Things
CO4 Develop critical thinking skills
CO5 Compare and contrast the threat environment based on industry and/or device type.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 2 - 3 - - - - - - - 2 -
CO2 2 2 2 - 3 - - - - - - - 2 -
CO3 2 2 2 - 3 - - - - - - - 2 -
CO4 2 2 2 - 3 - - - - - - - 2 -
CO5 2 2 2 - 3 - - - - - - - 2 -
Course 2 2 2 - 3 - - - - - - - 2 -
BLOCK CHAIN
Credits – 03
Overview of Block chain, public ledgers, bitcoin, smart contracts, block in a
block chain, transactions, distributed consensus, public vs private block chain,
understanding crypto currency to block chain, permissioned model of block 08
chain, overview of security aspects of block chain, cryptographic hash function,
properties of a hash function, hash pointer and Merkle tree, digital signature,
public key cryptography, a basic crypto currency.
Unit -2 :Understanding block chain with crypto currency
: Creation of coins, payments and double spending, bitcoin scripts, bitcoin P2P
network, transaction in bitcoin network, block mining, block propagation and
block relay, distributed consensus in open environments, consensus in a bitcoin
10
network, Proof of Work (PoW)- Basic Introduction, hashcash PoW, Bitcoin
PoW, Attacks on PoW and the monopoly problem, Proof of Stake, Proof of
burn and proof of elapsed time, the life of a bitcoin miner, Mining- Difficulty,
mining pool.
Unit – 3:Permissioned Block Chain
Permissioned model and usecases, design issues for permissioned block chains,
execute contracts, state machine replication, overview of consensus models for
10
permissioned block chain, Distributed consensus in closed environment, paxos,
RAFT consensus, Byzantine general problem, Byzantine fault tolerance system,
Lamport-Shostak-Pease BFT algorithm, BFT over Asynchronous systems.
Unit – 4:Enterprise application of Block chain
Cross border payments, Know Your Customer, Food security, Mortgage over
block chain, Block chain enabled trade, trade finance network, supply chain 10
financing, identity on block chain.
Unit – 5:Block chain application development
Hyperledger fabric- architecture, identities and policies, membership and access
control, channels, transaction validation, writing smart contract using
12
Hyperledger fabric, writing smart contract using Ethereum, overview of Ripple
and Corda.

T1 Block Chain: Blueprint for a new economy, Melanie Swan, O’Reilly, 2015.
T2 Block Chain: The Block Chain for Beginners- Guide to Block Chain Technology
and Leveraging Block Chain Programming, Josh Thompsons
R1 Block Chain Basics, Daniel Drescher, Apress; 1st edition, 2017
R2 Block Chain and Crypto Currencies, Anshul Kaushik, Khanna Publishing House,
Delhi.
R3 Mastering Block Chain: Distributed Ledger Technology, Decentralization and
Smart Contracts Explained, Imran Bhashir, Packt Publishing.
W1 https://www.edx.org/learn/blockchain
W2 https://www.coursera.org/courses?query=blockchain

CO1 Understand block chain technology.
CO2 Develop block chain-based solutions

CO3 Write smart contract using Hyperledger Fabric and Ethereum frameworks.
CO4 Build and deploy block chain application for on premise and cloud-based
architecture.
CO5 Integrate ideas from various domains and implement them.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
QUANTUM COMPUTING
Credits – 03
Unit -1:Introduction to Quantum computing Hours
Motivation for studying Quantum computing,, Mojor players in industry,
08
Origin of Quantum Computing, overview of major concepts in Quantum
Computing.
Unit -2 :Math Foundation for Quantum Computing
Matrix algebra- Basic vectors and orthogonality, inner product and Hilbert
10
spaces, matrices and tensors, unitary operators and projectors, dirac notation,
Eigen values and Eigen vector
Unit – 3: Building Blocks for Quantum Program
Architectures of a Quantum Computing Platform, Details of q-bit system of
information representation- Block sphere, Multi-qubits states, Quantum
superposition of qubits, Quantum entanglement, Useful states from quantum
10
algorithmic perceptive, Operations on qubits, Quantum Logic gates and
circuits, Programming model for a Quantum Computing Program- Steps
performed on classical computer, steps performed on Quantum computer,
Moving data between bits and qubits.
Unit – 4: Quantum Algorithms
Amplitude amplification, Quantum Fourier Transform, Phase Kick-back,
10
Quantum Phase estimation, Quantum Walks
Unit – 5: Algorithms
Shor’s Algorithm, Grover’s Algorithm, Deutsch’s Algorithm, Deutsch-Jozsa
10
Algorithm, IBM Quantum Experience, Microsoft Q, Rigetti PyQuil

T1 Quantum Computation and Quantum Information, Michael A. Nielsen, Cambridge
University Press.
R1 Quantum Computation Explained, David Mc Mahon, Wiley
W1 https://quantumcurriculum.mit.edu/
W2 https://www.coursera.org/courses?query=quantum%20computing

CO1 To explain the working of Quantum computing program.
CO2 To explain architecture and program model.
CO3 Develop Quantum logic gate circuits
CO4 Develop quantum algorithm
CO5 Program Quantum algorithm on major toolkits.
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
VIRTUAL REALITY
Credits – 03
Unit -1:Virtual reality and Virtual Environment Hours
Introduction, Computer graphics, Real time computer graphics, flight
simulation, virtual environment requirement, benefits of virtual reality,
historical development of VR, scientific landmark. 3D Commuter Graphics:
08
Introduction, virtual world space, positioning the virtual observer, perspective
projection, human vision, stereo perspective projection, 3D clipping, Colour
theory, simple 3D modelling, Illumination models, reflection models, shading
algorithms, radiosity, hidden surface removal, realism- stereographic image.
Unit -2 :Geometric Modelling
Introduction, from 2D to 3D, 3D space curves, 3D boundary representation.
Geometric transformation: Introduction, frames to reference, modelling
10
transformations, instances, picking, flying, scaling the VE, Collision and
detection. Generic VR system: Virtual environment, computer environment,
VR technology- models of interaction, VR systems.
Unit – 3:Animating the Virtual Environment
Introduction, the dynamics of numbers, linear and non-linear and non-linear
interpolation, the animation of objects, linear and non-linear translation, shape
10
& object in between, free from deformation, particle system. Physical
Simulation: Objects falling in a gravitational field, rotating wheels, elastic
collisions, projectiles, simple pendulum, springs, flight dynamics of an aircraft
Unit – 4:Human Factors
the eye, the ear, the somatic senses. VR Hardware: Sensor hardware, head-
coupled displays, acoustic hardware, integrated VR systems. VR Software:
10
Modelling virtual world, physical simulation, VR toolkits, Introduction to
VRML.
Unit – 5:VR Applications
Shor’s Algorithm, Grover’s Algorithm, Deutsch’s Algorithm, Deutsch-Jozsa
12
Algorithm, IBM Quantum Experience, Microsoft Q, Rigetti PyQuil

T1 Virtual Reality Systems, John Vince, Pearson Education Asia, 2007.
T2 Augmented and Virtual Reality, Anand R, Khanna Publishing House. Delhi

R1 Visualizations of Virtual Reality, Adams, Tata Mc Graw Hill, 2000
R2 Virtual Reality Technology, Grigore C. Burdea, Philippe Coieffet, Wiley Inter
Science, 2nd edition, 2006.
W1 https://www.coursera.org/courses?query=virtual%20reality
W2 https://www.classcentral.com/tag/virtual-reality
CO1 Understand geometric modelling
CO2 Understand Virtual environment
CO3 Study about Virtual Hardware and Software
CO4 Study about Software needed for developing virtual reality environment.
CO5 Develop Virtual Reality applications.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
DATA STRUCTURES THROUGH C
Credits – 03
Unit -1: INTRODUCTION TO DATA STRUCTURE Hours
Data Management concepts, Data types – primitive and non-primitive,
Performance Analysis and Measurement (Time and space analysis of 08
algorithms-Average, best- and worst-case analysis), Types of Data Structures-
Linear & Non-Linear Data Structures.
Unit -2 :LINEAR DATA STRUCTURE
Array: Representation of arrays, Applications of arrays, sparse matrix and its
representation Stack: Stack-Definitions & Concepts, Operations On Stacks,
Applications of Stacks, Polish Expression, Reverse Polish Expression And
Their Compilation, Recursion, Tower of Hanoi Queue: Representation Of
10
Queue, Operations On Queue, Circular Queue, Priority Queue, Array
representation of Priority Queue, Double Ended Queue, Applications of Queue
Linked List: Singly Linked List, Doubly Linked list, Circular linked list ,Linked
implementation of Stack, Linked implementation of Queue, Applications of
linked list.
Unit – 3:NONLINEAR DATA STRUCTURE
Tree-Definitions and Concepts, Representation of binary tree, Binary tree
traversal (Inorder, postorder, preorder), Threaded binary tree, Binary search
trees, Conversion of General Trees To Binary Trees, Applications Of Trees,
10
Some balanced tree mechanism, eg. AVL trees, 2-3 trees, Height Balanced,
Weight Balance, Graph-Matrix Representation Of Graphs, Elementary Graph
operations, (Breadth First Search, Depth First Search, Spanning Trees, Shortest
path, Minimal spanning tree)
Unit – 4:HASHING AND FILE STRUCTURES
Hashing: The symbol table, Hashing Functions, Collision Resolution
Techniques, File Structure: Concepts of fields, records and files, Sequential,
10
Indexed and Relative/Random File Organization, Indexing structure for index
files, hashing for direct files, Multi-Key file organization and access methods.
Unit – 5:SORTING AND SEARCHING
Sorting – Bubble Sort, Selection Sort, Quick Sort, Merge Sort Searching –
12
Sequential Search and Binary Search

T1 An Introduction to Data Structures with Applications. by Jean-Paul Tremblay &
Paul G. Sorenson Publisher-Tata McGraw Hill.
T2 Data Structures using C & C++ -By Ten Baum Publisher – Prenctice-Hall
International
R1 Fundamentals of Computer Algorithms by Horowitz, Sahni,Galgotia Pub. 2001 ed
R2 Fundamentals of Data Structures in C++-By Sartaj Sahani.
R3 Data Structures: A Pseudo-code approach with C -By Gilberg & Forouzan
Publisher Thomson Learning
W1 https://www.coursera.org/specializations/data-structures-algorithms
W2 https://online-learning.harvard.edu/course/data-structures-and-algorithms

CO1 Choose appropriate data structure as applied to specified problem definition.
CO2 Handle operations like searching, insertion, deletion, traversing mechanism etc. on
various data structures
CO3 Apply concepts learned in various domains like DBMS
CO4 Apply concepts learned in various domains like compiler construction
CO5 Use linear and non-linear data structures like stacks, queues , linked list

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
DESIGNING DATABASE MANAGEMENT SYSTEMS
Credits – 03
Unit -1: Introduction to Databases Hours
Traditional file-based systems and their limitations, Database approach
08
(DBMS) and its components, Roles in the database environment, Advantages
and disadvantages of database systems, Distributed databases.
Unit -2 :The Relational Model
Definition of relational data structures, database relations and keys,
10
Representation of relational database schemas, Relational Algebra, Relational
integrity (entities and relationships), Views.
Unit – 3:Structured Query Language
Introduction, objectives, terminology, Data manipulation- Querying, sorting,
grouping of data, logical and list operators, Single row numeric and string
functions, Group functions, Joins, Sub-queries, Inserting, deleting and updating 10
data. Data definition- Creating, altering and dropping database objects: tables,
views, indexes, synonyms, constraints, users. Creating Procedures and
Functions, Creating Database Triggers.
Unit – 4:Entity–Relationship Modelling and Logical Database Design
Entity and Relationship Types, Attributes (single, composite and derived),
Structural Constraints (1:1, 1:*, *:* relationships), Multiplicity, Cardinality and 10
participation.
Unit – 5:Normalization
Update anomalies, Functional dependencies, First, second, and third normal
12
forms.

T1 The Semantic Web, Berners-Lee, T., Hendler, J. and Lassila, Scientific American,
279, 2001.
T2 Extending the database relational model to capture more meaning, Codd, E.F.,
ACM Transactions on Database Systems (TODS), v.4 n.4, p.397-434
T3 Fundamentals of database systems, Elmasri, R., & Navathe, S., Pearson Addison
Wesley.
R1 Database systems: a practical approach to design, implementation, and
management, Connolly, T. & Begg, C, Addison-Wesley
W2 https://www.edx.org/learn/databases

CO1 Demonstrate understanding of the fundamental concepts of the relational database
model and utilize database management systems to organize, store and retrieve
data.
CO2 Make use of SQL (Structured Query Language) for database definition and
manipulation, use of a conventional programming language to implement database
connections.
CO3 Apply conceptual database modelling methods such as entity-relationship to model
business requirements.
CO4 Make use of a step-by-step approach from conceptual and logical to a physical
model to design databases.
CO5 Identify functional dependencies and apply normal forms to evaluate the quality of
a relational database design.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
OPERATING SYSTEMS CONCEPTS
Credits – 03
Unit -1: Evolution of Operating Systems Hours
Types of operating systems, Different views of the operating systems,
Principles of Design and Implementation, The process concept, system
08
programmer’s view of processes, operating system’s views of processes,
operating system services for process management, Process scheduling,
Schedulers, Scheduling Algorithms.
Unit -2 : Process synchronization
Structural overview, Concept of process and Process synchronization, Process
10
Management and Scheduling, Hardware requirements: protection, context
switching, privileged mode, Threads and their Management.
Unit – 3: Deadlock
Tools and Constructs for Concurrency, Detection and Prevention of deadlocks,
10
Mutual Exclusion: Algorithms, semaphores, concurrent programming using
semaphores.
Unit – 4:Memory Management
Memory Management paging, virtual memory management, Contiguous
allocation: static, dynamic partitioned memory allocation, segmentation. Non-
10
contiguous allocation: Paging, Hardware support: Virtual Memory, Dynamic
Resource Allocation.
Unit – 5:File Systems
A Simple file system, General model of a file system, Symbolic file system,
Access control verification, Logical file system, Physical file system, allocation
12
strategy module, Device strategy module, I/O initiators, Device handlers, Disk
scheduling, Design of IO systems, File Management.

T1 Operating System Concepts – Abraham Silberschatz, Peter Baer Galvin, Greg
Gagne, 8th edition, Wiley-India, 2009.
T2 Modern Operating Systems – Andrew S. Tanenbaum, 3rd Edition, PHI
T3 Operating Systems: A Spiral Approach – Elmasri, Carrick, Levine, TMH Edition
R1 Operating Systems – Flynn, McHoes, Cengage Learning
R2 Operating Systems – Pabitra Pal Choudhury, PHI
R3 Operating Systems – William Stallings, Prentice Hall
R4 Operating Systems – H.M. Deitel, P. J. Deitel, D. R. Choffnes, 3rd Edition, Pearson
W1 https://www.coursera.org/courses?query=operating%20system
CO1 Demonstrate knowledge in fundamental operating system abstractions such as
processes, threads, and process management
CO2 Demonstrate knowledge in semaphores, monitors, conditions, deadlocks, IPC
abstractions, shared memory regions, etc.
CO3 Demonstrate knowledge in principles of memory management
CO4 Demonstrate knowledge in file abstraction and storage management
CO5 Apply knowledge outlines in the above to design and develop system

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
R PROGRAMMING
Credits – 03
How to run R, R Sessions and Functions, Basic Math, Variables, Data Types,
08
Vectors, Conclusion, Advanced Data Structures, Data Frames, Lists, Matrices,
Arrays, Classes.
Unit -2 :R Programming Structures, Control Statements, Loops
- Looping Over Nonvector Sets,- If-Else,
Arithmetic and Boolean Operators and values, Default Values for Argument,
10
Return Values, Deciding Whether to explicitly call return- Returning Complex
Objects, Functions are Objective, No Pointers in R, Recursion, A Quicksort
Implementation-Extended Extended Example: A Binary Search Tree.
Unit – 3:Math and Simulation in R
Doing Math and Simulation in R, Math Function, Extended Example
Calculating Probability- Cumulative Sums and Products-Minima and Maxima-
Calculus, Functions Fir Statistical Distribution, Sorting, Linear Algebra
10
Operation on Vectors and Matrices, Extended Example: Vector cross Product-
Extended Example: Finding Stationary Distribution of Markov Chains, Set
Operation, Input /out put, Accessing the Keyboard and Monitor, Reading and
writer Files
Unit – 4:Graphics
Creating Graphs, The Workhorse of R Base Graphics, the plot() Function –
Customizing Graphs, Saving Graphs to Files, Probability Distributions, Normal
10
Distribution- Binomial Distribution- Poisson Distributions Other Distribution,
Basic Statistics, Correlation and Covariance, T-Tests,-ANOVA.
Unit – 5:Linear Models
Simple Linear Regression, -Multiple Regression Generalized Linear Models,
Logistic Regression, - Poisson Regression- other Generalized Linear Models- 12
Survival Analysis, Nonlinear Models, Splines- Decision- Random Forests

T1 The Art of R Programming, Norman Matloff, Cengage Learning
T2 R for Everyone, Lander, Pearson
R1 R Cookbook, PaulTeetor, Oreilly
R2 R in Action, Rob Kabacoff, Manning
W1 https://www.edx.org/learn/r-programming
W2 https://www.coursera.org/learn/r-programming
CO1 List motivation for learning a programming language
CO2 Access online resources for R and import new function packages into the R
workspace
CO3 Import, review, manipulate and summarize data-sets in R
CO4 Explore data-sets to create testable hypotheses and identify appropriate statistical
tests
CO5 Perform appropriate statistical tests using R Create and edit visualizations

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
PYTHON PROGRAMMING
Credits – 03
History of Python, Need of Python Programming, Applications Basics of
08
Python Programming Using the REPL(Shell), Running Python Scripts,
Variables, Assignment, Keywords, Input-Output, Indentation
Unit -2 : Types, Operators and Expressions
Types - Integers, Strings, Booleans; Operators- Arithmetic
Operators, Comparison (Relational) Operators, Assignment Operators, Logical
Operators, Bitwise Operators, Membership Operators, Identity Operators, 10
Expressions and order of evaluations Control Flow- if, if-elif-else, for, while,
break, continue, pass. Data Structures Lists - Operations, Slicing, Methods;
Tuples, Sets, Dictionaries, Sequences. Comprehensions.
Unit – 3: Functions
Defining Functions, Calling Functions, Passing Arguments, Keyword
Arguments, Default Arguments, Variable-length arguments, Anonymous
Functions, Fruitful Functions(Function Returning Values), Scope of the
10
Variables in a Function - Global and Local Variables. Modules: Creating
modules, import statement, from. Import statement, name spacing, Python
packages, Introduction to PIP, Installing Packages via PIP, Using Python
Packages
Unit – 4: Object Oriented Programming in Python
Classes, 'self variable', Methods, Constructor Method, Inheritance, Overriding
Methods, Data hiding, Error and Exceptions: Difference between an error and
10
Exception, Handling Exception, try except block, Raising Exceptions, User
Defined Exceptions
Unit – 5: Brief Tour of the Standard Library
Operating System Interface - String Pattern Matching, Mathematics, Internet
Access, Dates and Times, Data Compression, Multithreading, GUI
12
Programming, Turtle Graphics Testing:Why testing is required?, Basic
concepts of testing, Unit testing in Python, Writing Test cases, Running Tests.

T1 Python Programming: A Modern Approach, Vamsi Kurama, Pearson
T2 Learning Python, Mark Lutz, Orielly
R1 Think Python, Allen Downey, Green Tea Press
R2 Core Python Programming, W.Chun, Pearson
R3 Introduction to Python, Kenneth A. Lambert, Cengage
W1 https://www.coursera.org/courses?query=python
W2 https://www.edx.org/learn/python
CO1 Making Software easily right out of the box
CO2 Experience with an interpreted Language
CO3 To build software for real needs.
CO4 Prior Introduction to testing software
CO5 Experience with implementation in current technologies

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
JAVA PROGRAMMING
Credits – 03
Unit -1: Introduction to OOP Hours
procedural programming language and object-oriented language, principles
of OOP, applications of OOP, history of java, java features, JVM, program
08
structure. Variables, primitive data types, identifiers, literals, operators,
expressions, precedence rules and associativity, primitive type conversion and
casting, flow of control.
Unit -2 :Classes and objects
Classes and objects, class declaration, creating objects, methods, constructors
10
and constructor overloading, garbage collector, importance of static keyword
and examples, this keyword, arrays, command line arguments, nested classes.
Unit – 3:Inheritance
Inheritance, types of inheritance, super keyword, final keyword, overriding and
abstract class. Interfaces, creating the packages, using packages, importance of 10
CLASSPATH and java.lang package. Exception handling, importance of try,
catch, throw, throws and finally block, userdefined exceptions, Assertions
Unit – 4:Multithreading
Introduction, thread life cycle, creation of threads, thread priorities, thread
synchronization, communication between threads. Reading data from files and 10
writing data to files, random access file.
Unit – 5:Applet
Applet class, Applet structure, Applet life cycle, sample Applet programs.
Event handling: event delegation model, sources of event, Event Listeners,
adapter classes, inner classes. AWT: introduction, components and containers, 12
Button, Label, Checkbox, Radio Buttons, List Boxes, Choice Boxes, Container
class, Layouts, Menu and Scrollbar.

T1 The complete Reference Java, 8th edition, Herbert Schildt, TMH
T2 Programming in JAVA, Sachin Malhotra, SaurabhChoudary, Oxford
R1 Introduction to java programming, 7th edition by Y Daniel Liang, Pearson
W1 https://www.coursera.org/courses?query=java
W2 https://www.udemy.com/java-tutorial/
CO1 Understand Java programming concepts and utilize Java Graphical User Interface
in Program writing.
CO2 Write, compile, execute and troubleshoot Java programming for networking
concepts.
CO3 Build Java Application for distributed environment.
CO4 Design and Develop multi-tier applications.
CO5 Identify and Analyze Enterprise applications.

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
APP TECHNOLOGIES
Credits – 03
Unit -1: Android Programming Environment Hours
Android programming environment, linking activities using intents, calling 08
built-in applications using intents.
Unit -2:User Interface
Creating the user interface programmatically, Listening for UI notifications,
10
build basic views, build picker views, build list views, Using image views,
Using menus with views, Saving and loading user preferences
Unit – 3:Data
Persisting data to files, Creating and using databases, Study Session, sharing 10
data in android, Using a content provider, Creating a content provider
Unit – 4: Networking
SMS messaging, sending emails, Networking, displaying maps, Getting
10
location data
Unit – 5: Services
Creating your own services, communicating between a service and an Activity,
Binding Activities to Services, A complete lab work for Android service 12
development, Deploy APK files.

T1 Beginning Android Application Development, Wei-Meng Lee, 1st Ed, Wiley
Publishing.
T2 Android: A Programmers Guide, J. F. DiMarzio, McGraw Hill Education (India)
Private Limited.1st Edition.
R1 Android for Programmers: An App-Driven Approach, Paul Deitel, 1st Edition,
Pearson India
R2 Beginning Android 4 Application Development, Wei-Meng Lee, Wiley India Pvt
Ltd
W1 https://www.coursera.org/browse/computer-science/mobile-and-web-development
W2 https://in.udacity.com/course/new-android-fundamentals--ud851

CO1 Demonstrate their understanding of the fundamentals of Android operating
systems
CO2 Demonstrate their skills of using Android software development tools
CO3 Demonstrate their ability to develop software with reasonable complexity on
mobile platform
CO4 Demonstrate their ability to deploy software to mobile devices
CO5 Demonstrate their ability to debug programs running on mobile devices
PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
WEB TECHNOLOGIES
Credits – 03
Unit -1: Introduction to HTML Hours
HTML Common tags- Block Level and Inline Elements, Lists, Tables, Images,
Forms, Frames; Cascading Style sheets, CSS Properties; Java Script: 08
Introduction to Java Script, Objects in Java Script, Dynamic HTML with Java
Script
Unit -2: JDBC
Data Base, Database Schema, A Brief Overview Of The JDBC Process, JDBC
Driver Types, JDBC Packages, Database Connection, Associating The JDBC- 10
ODBC Bridge With Database, Creating, Inserting, Updating And Deleting Data
In Database Tables, Result Set, Metadata.
Unit – 3:Web Servers and Servlets
Tomcat web server, Introduction to Servlets: Servlets, the Advantage of
Servlets over “Traditional” CGI, Basic Servlet Structure, Simple Servlet
Generating Plain Text, Compiling and Installing the Servlet, Invoking the 10
Servlet, Lifecycle of a Servlet, The Servlet API, Reading Servlet parameters,
Reading Initialization parameters, Context Parameters, Handling Http Request
& Responses, Using Cookies-Session Tracking, Servlet with JDBC.
Unit – 4: Introduction to JSP
The Problem with Servlet. The Anatomy of a JSP Page, JSP Processing, JSP
Application Development: Generating Dynamic Content, Using Scripting
Elements, Implicit JSP Objects, Declaring Variables and Methods, Sharing 10
Data Between JSP pages, Users Passing Control and Data between Pages, JSP
application design with JDBC, JSP Application Design with MVC.
Unit – 5: Introduction to PHP
Basics of PHP, Functions, Error Handling, Interaction between PHP and
MySQL, Database using Forms, Using PHP to manipulate and Retrieve Data in 12
MySQL.

T1 Beginning Web Programming, Jon Duckett, WROX
T2 Core Servlets and Java Server pages Vol. 1: Core Technologies, Marty Hall and
Larry Brown, Pearson
R1 Open Source for the Enterprise: Managing Risks, Reaping Rewards, DanWoods
and Gautam Guliani, O’Reilly, Shroff Publishers and Distributors, 2005
R2 Programming world wide web, Sebesta, Pearson
R3 Internet and World Wide Web – How to program, Dietel and Nieto, PHI/Pearson
Education Asia
R4 Murach’s beginning JAVA JDK 5, Murach, SPD
R5 An Introduction to web Design and Programming, Wang, Thomson
W1 https://www.edx.org/learn/web-development
W2 https://www.coursera.org/courses?query=web%20development

CO1 To develop a dynamic webpage by the use of java script and DHTML
CO2 To write a well formed / valid XML document
CO3 To connect a java program to a DBMS and perform insert, update and delete
operations on DBMS table
CO4 To write a server-side java application called Servlet to catch form data sent from
client, process it and store it on database
CO5 To write a server-side java application called JSP to catch form data sent from
client and store it on database

PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -
ARTIFICIAL INTELLIGENCE
Credits – 03
Unit -1 Hours
Introduction to artificial intelligence
08
Introduction, history, intelligent systems, foundations of AI, applications, tic-
tac-tie game playing, development of ai languages, current trends in AI
Unit -2
Problem solving: state-space search and control strategies
Introduction, general problem solving, characteristics of problem, exhaustive
searches, heuristic search techniques, iterative deepening a*, constraint 10
satisfaction
Problem reduction and game playing : Introduction, problem reduction, game
playing, alpha beta pruning, two-player perfect information games
Unit – 3
Logic concepts
Introduction, propositional calculus, proportional logic, natural deduction 08
system, axiomatic system, semantic tableau system in proportional logic,
resolution refutation in proportional logic, predicate logic
Unit – 4
Knowledge representation
Introduction, approaches to knowledge representation, knowledge
representation using semantic network, extended semantic networks for KR,
10
knowledge representation using frames
Advanced knowledge representation techniques : Introduction, conceptual
dependency theory, script structure, cyc theory, case grammars, semantic web
Unit – 5
Expert system and applications
Introduction phases in building expert systems, expert system versus traditional
systems, rule-based expert systems blackboard systems truth maintenance
systems, application of expert systems, list of shells and tools
Uncertainty measure: probability theory
Introduction, probability theory, Bayesian belief networks, certainty factor 12
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.
T1 Artificial Intelligence- Saroj Kaushik, CENGAGE Learning
T2 Artificial intelligence, A modern Approach , 2nded, Stuart Russel, Peter Norvig,
PEA
T3 Artificial Intelligence- Rich, Kevin Knight, Shiv Shankar B Nair, 3rded, TMH
T4 Introduction to Artificial Intelligence, Patterson, PHI
R1 Artificial intelligence, structures and Strategies for Complex problem solving, -
George F Lugar, 5thed, PEA
R2 Introduction to Artificial Intelligence, Ertel, Wolf Gang, Springer
R3 Artificial Intelligence, A new Synthesis, Nils J Nilsson, Elsevier
W1 https://www.edx.org/course/artificial-intelligence-ai-columbiax-csmm-101x-0
W2 https://academy.microsoft.com/en-us/professional-program/tracks/artificial-
intelligence/


PO PSO
1 2 3 4 5 6 7 8 9 10 11 12 1 2
CO1 2 2 3 - - - - - - - - - 2 -
CO2 2 2 3 - - - - - - - - - 2 -
CO3 2 2 3 - - - - - - - - - 2 -
CO4 2 2 3 - - - - - - - - - 2 -
CO5 2 2 3 - - - - - - - - - 2 -
Course 2 2 3 - - - - - - - - - 2 -

III & IV B.tech Cse Autonomous Syllabus Book (A4)

Uploaded by

Copyright:

Available Formats

III & IV B.tech Cse Autonomous Syllabus Book (A4)

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

III & IV B.tech Cse Autonomous Syllabus Book (A4)

Uploaded by

Copyright:

Available Formats

COURSE STRUCTURE AND

III & IV B.Tech.

III B. Tech II Semester

Information Transfer: The molecular basis of coding and decoding genetic

Text(T) / Reference(R) Books:

Course Outcomes: On completion of this course, students can

a) Understanding the complexity at workplace-

a) Active listening skills- note taking- 10

Text(T) / Reference(R) Books:

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Functional Management: Concept of HRM, HRD and PMIR- Functions of

Development of Network – Difference between PERT and CPM Identifying 12

Text(T) / Reference(R) Books:

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

The Channel Allocation Problem, Static Channel Allocation, Assumptions for

Congestion Control Algorithms, Approaches to Congestion Control-Traffic

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

System model, Deadlock characterization, Methods for handling deadlocks,

File concept, Access methods, Directory structure, File-system mounting,

Linux System: Components of LINUX, Inter-process Communication,

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Course Outcomes: On completion of this course, students can

Definition, Model, Graphical Notation, Instantaneous Description Language

Definition, Model, Representation of Turing Machines-Instantaneous

Decidable and Un-decidable Problems, Halting Problem of Turing Machines,

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Purpose of Normalization or schema refinement, concept of functional

Transaction, properties of transactions, transaction log, and transaction

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Coding, Code Review, Software Documentation, Testing, Unit Testing, Black-

Software Reliability, Statistical Testing, Software Quality, Software Quality

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Process to Process communication, TCP Services, Segment, Options,

Concept-Network Virtual Terminal, NVT character set , Embedding, Option

HTTP overview, Proxy, Gateway, Tunnel, Cache, Messages, General Header 12

Text(T) / Reference(R) Books:

Course Outcomes: On completion of this course, students can

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

User Interaction, Delightful user experience, Testing your UI. 10

Unit – 3: Background Tasks

Background Tasks, Triggering, scheduling and optimizing background tasks. 10

Permissions, Performance and Security, Firebase and Ad Mob, Publish. 12

Text(T) / Reference(R) Books:

Course Outcomes to Program Outcomes Mapping: (1: Low, 2: Medium, 3: High)

Market Structures: Perfect Competition, Monopoly and Monopolistic and

Introduction to Double Entry Systems – Preparation of Financial Statements-

Capital Budgeting: Meaning of Capital-Capitalization-Meaning of Capital

Text(T) / Reference(R) Books:

Course Outcomes: On completion of this course, students can