0% found this document useful (0 votes)
27 views42 pages

Mca Bos

The document outlines the proposed course structure and syllabus for a two-year Master of Computer Applications (MCA) program for the academic year 2025-2026 at Visakha Institute of Engineering & Technology. It details the courses offered in each semester, including core subjects, labs, and projects, along with their respective credits. The curriculum covers a range of topics from foundational subjects to advanced technologies such as Machine Learning, Web Technologies, and Database Management Systems.

Uploaded by

satyanarayana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views42 pages

Mca Bos

The document outlines the proposed course structure and syllabus for a two-year Master of Computer Applications (MCA) program for the academic year 2025-2026 at Visakha Institute of Engineering & Technology. It details the courses offered in each semester, including core subjects, labs, and projects, along with their respective credits. The curriculum covers a range of topics from foundational subjects to advanced technologies such as Machine Learning, Web Technologies, and Database Management Systems.

Uploaded by

satyanarayana
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 42

DEPARTMENT OF MASTER OF COMPUTER APPLICATIONS

Proposed 2 Years Course Structure and Syllabus for the Academic Year

(2025-2026)

VR 24 REGULATIONS

VISAKHA INSTITUTE OF ENGINEERING & TECHNOLOGY (A)


NARAVA, VISAKHAPATNAM -530027
MASTER OF COMPUTER APPLICATIONS (MCA)
(For Two-Year PG Program)
Proposed Course Structure and Syllabus for VR 24

I Year I-Semester

Course Course
S.No Course Name L T p Credits
Category Code
1
BS&H Business Communication 2 0 0 2

2 BS&H Mathematical and statistical 3 0 0 3


Foundations.
PC Computer organization
3 3 1 0 4
&Operating System
4 PC 0 0
Data Structures 3 3

Object oriented Programming


5 PC 3 0 0 3
With JAVA

6 PC Operating System and Linux Lab 0 0 3 1.5


7 PC Data Structures Lab 0 0 3 1.5
8 PC JAVA Programming Lab 0 0 3 1.5

9 MC Socially Relevant Project 0 0 1 0.5


using Design Thinking
Total 15 1 10 20

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
MASTER OF COMPUTER APPLICATIONS (MCA)
(For Two-Year PG Program)
Proposed Course Structure and Syllabus for VR 24

I Year II Semester

Course Course
S.No Course Name L T p Credits
Category Code
1 PC Database Management System 3 0 0 3
PC 3
2 Computer Networks 0 0 3

PC
3 Software Engineering and Design 3 0 0 3
Patterns

4 PC Data warehousing and Mining 3 0 0 3

1.No SQL Data base


2.Design and Analysis of
Algorithms
5 PE 3 0 0 3
3.Mobile Application Development
4.Artificial Intelligence
5.Accounting for Managers
6 PC DBMS Lab 0 0 3 1.5
PC 0 0 3 1.5
7
Computer Networks Lab

PC 0 0 3 1.5
8 Software Engineering and Design
Patterns Lab
0 0 1 0.5
9 MC
Employability Skills
Bridge Course (Python
10 MC Programming to be taken 0 0 0 0
through MOOCs)
TOTAL 15 0 10 20

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
MASTER OF COMPUTER APPLICATIONS (MCA)
(For Two-Year PG Program)
Proposed Course Structure and Syllabus for VR 24

II Year I-Semester

Course Course
S.No Course Name L T p Credits
Category Code
1 PC Machine Learning with Python 3 0 0 3
2 PC Internet of Things 3 0 0 3
PC
3 Web Technologies 3 0 0 3
4 PC
Cryptography and Network Security 3 0 0 3

1. Soft Computing
2. Software Project
5 PE II Management 3 0 0 3
3. Cloud Computing
4. Optimization
. Techniques
5. Cyber Security
6 PC Machine Learning with Python Lab 0 0 3 1.5

7 PC IoT Lab 0 0 3 1.5


8 PC Web Technologies Lab 0 0 4 2

Internship /Industry Oriented


Mini Project/ Skill
9 PR 0 0 0 2
Development Course
(Minimum 6 weeks)
Total 15 0 10 22

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
MASTER OF COMPUTER APPLICATIONS (MCA)
(For Two-Year PG Program)
Proposed Course Structure and Syllabus for VR 24
II Year II Semester

S. No Course Course L T P Credits


Title
Category Code
1. Digital Marketing
1 PE III 2. Human Resource Management. 3 0 0 3
3. Deep Learning
4. Ad-hoc and Sensor Networks
MOOCs-1 (NPTEL/SW AYAM) -
Full Stack Technologies - Any
recommended course
1. Network Programming
2 PE IV 2. Blockchain technologies. 3 0 0 3
3. Software Testing Methodologies
4. Big Data Analytics MOOCs-2
(NPTEL/SW AYAM) -Data
Science -Any recommended course

3 PR Project Work/Dissertation\ 0 0 12

Total 6 0 0 18

Students going for Industrial Project/Thesis will complete these courses through MOOCs (even
in earlier Semester)

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year I Semester L T p C
3 0 0 3
MACHINE LEARNING WITH PYTHON
Course Objectives:
From the course the student will learn
• To design and analyze various machine learning algorithm sand techniques with a
modern out look focusing on recent advances.
• Explore supervised and unsupervised learning paradigms of machine learning.
• To explore Deep learning technique and various feature extraction strategies.

Course Outcomes (CO's): At the end of the course, student will be able to
CO1: Illustrate and comprehend the basics of Machine Learning with Python. (L2)
CO2: Demonstrate supervised learning algorithms and differentiate between linear and logistic regression.
(L3)
CO3: Demonstrate unsupervised learning algorithms and understand clustering techniques. (L3)
CO4: Evaluate binning and pipeline interfaces with practical examples. (L5)
CO5: Apply sentiment analysis techniques to various case studies. (L3)

UNIT-I:
Introduction to Machine Learning with Python: Introduction to Machine Learning, basic
terminology, Types of Machine Learning and Applications, Using Python for Machine Learning:
Installing Python and packages from the Python Package Index, Introduction to Jumpy, Skippy,
marplot lib and sickie-learn, tiny application of Machine Learning.

UNIT-II:
Supervised Learning: Types of Supervised Learning, Supervised Machine Learning
Algorithms: k- Nearest Neighbors, Regression Models, Naïve Bayes Classifiers, Decision Trees,
Ensembles of Decision Trees, Kernel zed Support Vector Machines, Uncertainty Estimates from
Classifiers.

UNIT-III:
Building good training datasets: Dealing with missing data, handling categorical data,
partitioning a data set into separate training and test datasets, bringing features onto the same
scale, selecting meaningful features, assessing feature importance with random forests.
Compressing data via dimensionality reduction: Unsupervised dimensionality reduction via
PCA, Supervised data compression via linear discriminate analysis (Text Book 2)

UNIT-IV:
Learning best Practices for Model Evaluation and Hyper Parameter tuning: streamlining
Work flows with pipelines, using k-fold cross validation to assess model performance,
Debugging algorithms with learning and validation curves, fine-tuning machine learning models
via grid search, and looking at different performance evaluation metrics
Combining different models for Ensemble learning: learning with ensembles, combining
Classifiers via major it vote, bagging-building an ensemble of classifiers from bootstrap
Samples, leveraging weak learners via adaptive boosting (Text Book 2)

UNIT-V:
Working with Text Data (Data Visualization): Types of Data Represented as Strings, Example
Application: Sentiment Analysis of Movie Reviews, Representing Text Data as a Bag of Words,
Stop Words, Rescaling the Data with tied, Investigating Model Coefficients, Approaching a
Machine Learning Problem, Testing Production Systems, Ranking, Recommender Systems and
Other kinds of Learning.

Text Books:
1) Introduction to Machine Learning with Python: A Guide for Data Scientists, Andreas C.
Muller & Sarah Guido, O'Reilly Publications, 2019.
2) Python Machine Learning, Sebastian Raschka &Vahid Mirjalili, 3rd Edition, 2019.
3) Machine Learning using Python, Manaranjan Pradhan, U Dinesh Kumar, Wiley, 1st
Edition, 2019

Reference Books:
1) Machine Learning, Tom M. Mitchell, McGraw-Hill Publication, 2017
2) Building Machine Learning Systems with Python, Luis Pedro Coelho, Willis Richer, 2nd
Edition, 2015.
3) Programming and Problem Solving with Python, Ashok Named Methane, Amity Ashok
Kathie, TMH, 2019.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 3 3
CO3 3 2 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 2 3 3 2 0 0 0 0 1 0 1 3 3
CO5 3 2 3 2 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.0 2.8 2.4 2.0 0 0 0 0 1.0 0 1.0 2.8 2.8

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year I Semester L T p C
3 0 0 3
WEB TECHNOLOGIES
Course Objectives:
• To Learn PHP language for server side scripting
• To introduce XML and processing of XML Data with Java
• To introduce Server side programming with Java Servlets and JSP to
introduce Client side scripting with JavaScript.
Course Outcomes (COs):
At the end of the course, student will be able to

CO1: Analyze a webpage and identify its elements and attributes. (L4)
CO2: Understand XML fundamentals and its usage in electronic data interchange. (L2)
CO3: Build dynamic web pages using JavaScript for client-side programming. (L3)
CO4: Design and develop web-based enterprise systems using JSP and Servlets. (L5)
CO5: Build interactive web applications using PHP. (L3)

UNIT-I:
Web Basics- Introduction, Concept of Internet- History of Internet, Protocols of Internet,
World Wide Web, URL, Web Server, Web Browser. HTML- Introduction, History of
HTML, Structure of HTML Document: Text Basics, Structure of HTML Document: Images
and Multimedia, Links and webs, Document Layout, Creating Forms, Frames and Tables,
Cascading Style Sheets.

UNIT-II:
XML Introduction- Introduction of XML, Defining XML tags, their attributes and values,
Document Type Definition, XML Schemes, Document Object Model, XHTML Parsing XML
Data - DOM and SAX Parsers in java.

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

UNIT-IV:
Introduction to JSP: The Anatomy of a JSP Page, JSP Processing, Declarations, Directives,
Expressions, Code Snippets, implicit objects, Using Beans in JSP Pages, Using Cookies and
session for session tracking, connecting to database in JSP. Client-side Scripting: Introduction to
JavaScript, JavaScript language -declaring variables, scope of variables, functions. Event handlers
(on-Click, on-Submit etc.), Document Object Model, Form validation.

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

Text books:
1) Web Technologies, UttamKRoy, Oxford University Press, 2010
2) The Complete Reference PHP-Steven Holster, Tata McGraw-Hill, 2017.

Reference Books:
nd
1) Web Programming, building internet applications, Chris Bates 2 edition, Wiley
Dramatic, 2002.
2) Java Server Pages-Hans Bergsten, 2e, SPDO' Reilly, 2002.
3) Java Script, D.Flanagan, 6e, O'Reilly Media, 2011.
4) Beginning Web Programming-Jon Docket WROX, 2110.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 2 3 3 2 0 0 0 0 1 0 1 3 3
CO4 3 2 3 3 2 0 0 0 0 1 0 1 3 3
CO5 3 2 3 2 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.0 2.8 2.4 2.0 0 0 0 0 1.0 0 1.0 2.8 2.8

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year I Semester
3 0 0 3
CRYPTOGRAPHY AND NETWORK SECURITY
Course Objectives:
• To learn various crypto graphic algorithms including secret key cryptography, hashes and
message digests public key algorithms.
• To Familiar in design issues and working principles of various authentication protocols
and various secure communication standards including Kerberos, IP sec, and S/MIME

Course Outcomes:
At the end of the course, student will be able to
CO1: Explain basic security principles, threats, countermeasures, cryptographic foundations, and
symmetric encryption. (L2)
CO2: Classify symmetric key algorithms and their operations. (L4)
CO3: Design cryptographic hash functions like SHA-3 and digital signatures such as ElGamal. (L6)
CO4: Explain key management, distribution, and user authentication concepts. (L2)
CO5: Determine the use of network and internet security protocols such as S/MIME. (L5)

UNIT-I:
Basic Principles: Security Goals, Cryptographic Attacks, Services and Mechanisms,
Mathematics of Cryptography. Symmetric Encryption: Mathematics of Symmetric Key
Cryptography, Introduction to Modern Symmetric Key Ciphers, Data Encryption Standard,
Advanced Encryption Standard.

UNIT-II:
Asymmetric Encryption: Mathematics of Asymmetric Key Cryptography-Primes, optimality
Testing, Factorization, Asymmetric Key Cryptography-RSA Cryptosystem, Rabin Cryptosystem,
Megamall Cryptosystem, Elliptic Curve Cryptosystem

UNIT-III:
Cryptographic Hash Functions: Applications of Cryptographic Hash Functions, Two Simple
Hash Functions Requirements and Security Hash Functions Based on Cipher Block Chaining,
Secure Hash Algorithm (SHA), SHA-3. Digital Signatures: Megamall Digital Signature Scheme,
Schnorr Digital Signature, NIST Digital Signature Algorithm.

UNIT-IV:
Key Management and Distribution: Symmetric Key Distribution Using Symmetric Encryption,
Symmetric Key Distribution Using Asymmetric Encryption, Distribution of Public Keys, X.509
Certificates.
User Authentication: User Authentication, Remote User-Authentication Principle, Remote User-
Authentication Using Symmetric Encryption, Kerberos, Remote User-Authentication Using
Asymmetric Encryption
UNIT-V: Network and Internet Security
Electronic Mail Security: Internet Mail Architecture, Email Formats, Email Threats and
Comprehensive Email Security, S/MIME. IP Security: IP Security Policy, Encapsulating
Security Payload, Combining Security Associations Internet Key Exchange

Text Books:
1) Cryptography and Network Security, Beerhouse A Frozen, Debden Mukhopadhyay, 3rd
Edition, McGraw Hill, 2015
2) Cryptography and Network Security, William Stallings, Global Edition,7e Pearson,2017

Reference Books:
1) Network Security and Cryptography, Bernard Ménages, First Edition, Cengage
Learning,2018

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 1 0 0 0 1 0 1 3 3
CO2 3 2 3 3 2 1 0 0 0 1 0 1 3 3
CO3 3 2 3 3 2 1 0 0 0 1 0 1 3 3
CO4 3 2 2 2 2 1 0 0 0 1 0 1 3 3
CO5 3 2 3 3 2 1 0 0 0 1 0 1 3 3
Avg 3.0 2.0 2.6 2.6 2.0 1.0 0 0 0 1.0 0 1.0 3.0 3.0

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year I Semester p
L T C
SOFT COMPUTING 3 0 0 3
Course Objectives:
• Develop the skills to gain a basic understanding of neural network theory and fuzzy logic
theory.
• Introduce students to artificial neural networks and fuzzy theory from an engineering
perspective

Course Outcomes:
CO1: Comprehend fuzzy logic concepts and fuzziness in systems using fuzzy set theory. (L2)
CO2: Understand fuzzy sets, fuzzy rules, approximate reasoning, and inference systems. (L2)
CO3: Identify neural network architectures, algorithms, applications, and limitations. (L3)
CO4: Apply learning rules to various neural network paradigms and explore their applications. (L3)
CO5: Analyze applications of fuzzy and neural models for solving engineering problems. (L4)

UNIT-I:
Fuzzy Set Theory: Introduction to Neuron, Fuzzy and Soft Computing, Fuzzy Sets, Basic
function and Terminology, Set-theoretic Operations, Member Function Formulation and
Parameterization, Fuzzy Rules and Fuzzy Reasoning, Extension Principle and Fuzzy Relations
,Fuzzy If-Then Rules, Fuzzy Reasoning, Fuzzy Inference Systems, Madman Fuzzy Models,
Surgeon Fuzzy Models, Tsukamoto Fuzzy Models, Input Space Partitioning and Fuzzy Modeling.

UNIT-II:
Optimization: Derivative based Optimization, Descent Methods, and The Method of Steepest
Descent, Classical Newton's Method, Step Size Determination, Derivative-free Optimization,
Genetic Algorithms, Simulated Annealing, and Random Search, Downhill Simplex Search.

UNIT-III:
Artificial Neural Networks: Introduction and ANN Structure, Biological neurons and artificial
neurons. Model of an ANN, Activation functions used in ANNs, Typical classes of network
architectures, Single-layer perceptions, Structure and learning of perceptions. Feed forward ANN,
Structures of Multi-layer feed forward networks, back propagation algorithm, Back propagation-
training and convergence.

UNIT- IV:
Neuron Fuzzy Modeling: Adaptive Neuron-Fuzzy Inference Systems, Architecture Hybrid
Learning Algorithm, Learning Methods that Cross-fertilize ANFIS and RBFN Coactive Neuron
Fuzzy Modeling, Framework Neuron Functions for Adaptive Networks Neuron Fuzzy Spectrum.
UNIT-V:
Applications of Computational Intelligence: Printed Character Recognition, Inverse Kinematics
Problems, Automobile Fuel Efficiency Prediction, Soft Computing for Colorize Prediction.

Text Books:
1) "Neuro-Fuzzy and Soft Computing", J. S. R. Jang, C.T. Sunand E. Mizutani, PHI,2004,
Pearson Education 2004
2) "Neural Networks: A classroom approach", Salish Kumar, Tata McGrawHill, 2004.
3) "Artificial Intelligence and Intelligent Systems",N.P.Padhy, Oxford University Press,2006

Reference Books:
1) Artificial Intelligence, Elaine Rich &Kevin Knight, Tata McGraw-Hill Publishing Comp.,
New Delhi, 2nd edition-2006
2) "FuzzyLogicwithEngineeringApplications",TimothyJ.Ross,McGraw-Hill,3rdedition-1997

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 2 3 2 2 0 0 0 0 1 0 1 3 3
CO4 3 2 3 2 2 0 0 0 0 1 0 1 3 3
CO5 3 2 3 3 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.0 2.6 2.2 2.0 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year I Semester L T p C
3 0 0 3
SOFTWARE PROJECT MANAGEMENT
Course Objectives:
At the end of the course, the student shall be able to:
• To describe and determine the purpose and importance of project management from the
perspectives of planning, tracking and completion of project
• To compare and differentiate organization structures and project structures
• To implement a project to manage project schedule, expenses and resources with the
application of suitable project management tools

Course outcomes:
Upon the completion of the course students will be able to:-
CO1: Apply software development life-cycle models in practice. (L3)
CO2: Apply project management and planning concepts in software projects. (L3)
CO3: Implement project plans through effective people, communication, and change management.
(L3)
CO4: Conduct closure and completion activities for successful software project delivery. (L3)
CO5: Implement communication, modeling, construction, and deployment practices. (L3)

UNIT--I:
Conventional Software Management: The water fall model, conventional software Management
performance.
Evolution of Software Economics: Software Economics, pragmatic software cost estimation.
Improving Software Economics: Reducing Software product size, improving software
processes, improving team effectiveness, improving automation, Achieving required quality, peer
inspections.
The old way and the new: The principles of conventional software Engineering, principles of
modern software management, transitioning to an iterative process.

UNIT--II:
Life cycle phases: Engineering and production stages, inception, Elaboration, construction,
transition phases.
Artifacts of the process: The artifact sets, Management artifacts, Engineering artifacts,
programmatic artifacts.

UNIT--III:
Model based software architectures: A Management perspective and technical perspective.
Work Flows of the process: Software process work flows, Iteration work flows.
Checkpoints of the process: Major mile stones, Minor Milestones, Periodic status assessments.
Iterative Process Planning: Work break down structures, planning guidelines, cost and schedule
estimating, Iteration planning process, Pragmatic planning.
UNIT--IV:
Project Organizations and Responsibilities: Line-of-Business Organizations, Project
Organizations, Evolution of Organizations.
Process Automation: Automation Building Blocks, the Project Environment.
Project Control and process instrumentation: The seven core Metrics; manage men indicators,
quality indicators, life cycle expectations, pragmatic Software Metrics, Metrics automation.

UNIT--V:
Agile Methodology, adapting to Scrum, Patterns for Adopting Scrum, Iterating towards Agility.
FundamentalsofDevOps: Architecture, Deployments, Orchestration, Need, Instance of
applications, DevOps delivery pipe line, and Dev. Osco system. Dev posed optioning projects:
Technology aspects, Ailing capabilities, Tool stack implementation, People aspect, processes

Textbooks:
1) Software Project Management, Walker Royce, PEA, 2005.
2) Succeeding with Agile: Software Development Using Scrum, Mike Cohn, and Addison
Wesley, 2010
3) How to Create World-Class Agility, Reliability, and Security m Technology
Organizations, The Develops Handbook, Gene Kim, John Willis, Patrick Dubois, Jazz
Humb,1st Edition, O'Reilly publications, 2016.

Reference Books:
1) Software Project Management, Bob Hughes,3/e, Mike Cottrell, TMH, 2002.
2) Software Project Management, Joel Henry, PEA, 2002.
3) Software Project Management in practice, Panda Jabot, PEA, 2005,
4) Effective Software Project Management, Robert K.Wysocki,Wiley,2006
5) Project Management in IT, Kathy Schwalbe, Cengage, 2010.
6) Quality Software Project Management, Futrell, Donald F.Shafer,Donald I.Shafer, PEA,
2012.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 3 2 2 1 1 0 1 1 0 1 2 2
CO2 3 2 3 2 2 1 1 0 1 1 0 1 2 2
CO3 3 2 3 2 2 1 1 0 1 1 0 1 2 2
CO4 3 2 3 2 2 1 1 0 1 1 0 1 2 2
CO5 3 2 3 2 2 1 1 0 1 1 0 1 2 2
Avg 3.0 2.0 3.0 2.0 2.0 1.0 1.0 0 1.0 1.0 0 1.0 2.0 2.0
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year I Semester 3 0 0 3

CLOUD COMPUTING
Course Objectives:
The main objective of the course is to implement Virtualization, Task Scheduling algorithms,
apply Map-Reduce concept to applications, building Private Cloud and to know the impact of
engineering on legal and societal issues involved

Course Outcomes:
At the end of the course, student will be able to
CO1: Interpret the key dimensions of cloud computing challenges. (L2)
CO2: Examine economic, financial, and technological implications of adopting cloud computing. (L4)
CO3: Assess financial, technological, and organizational readiness for cloud application deployment.
(L5)
CO4: Evaluate organizational needs for capacity building and cloud-related IT training. (L5)
CO5: Illustrate virtualization concepts for data center automation. (L2)

UNIT--I:
Systems modeling, Clustering and virtualization: Scalable Computing over the Internet,
Technologies for Network-based systems, System models for Distributed and Cloud Computing,
Software environments or distributed systems and clouds, Performance, Security and Energy
Efficiency.

UNIT--II:
Virtual Machines and Virtualization of Clusters and Data Centers: Implementation Levels of
Virtualization, Virtualization Structures/Tools and mechanisms, Virtualization of CPU, Memory
and 1/0Devices, Virtual Clusters and Resource Management, Virtualization for Data Centre
Automation.

UNIT--III:
Cloud Platform Architecture: Cloud Computing and service Models, Architectural Design of
Compute and Storage Clouds, Public Cloud Platforms, Inter Cloud Resource Management, Cloud
Security and Trust Management. Service Oriented Architecture, Message Oriented Middleware.

UNIT--IV:
Cloud Programming and Software Environments: Features of Cloud and Grid Platforms,
Parallel & Distributed Programming Paradigms, Programming Support of Google App Engine,
Programming on Amazon AWS and Microsoft Azure, Emerging Cloud Software Environments.
Storage Systems: Evolution of storage technology, storage models, file systems and database,
distribute file systems, general parallel file systems. Google file system, Apache Hardtop, Big
Table, Megastore, and Amazon Simple Storage Service (S3).
UNIT--V:
Cloud Resource Management and Scheduling: Policies and Mechanisms for Resource
Management Applications of Control Theory to Task Scheduling on a Cloud, Stability of a two
level Resource Allocation Architecture, and Feedback Control Based on Dynamic Thresholds.
Coordination of Specialized Autonomic Performance Managers, Resource Bundling, Scheduling
Algorithms for Computing Clouds, Fair Queuing, Start Time Fair Queuing, Borrowed Virtual
time, Cloud Scheduling Subject to Deadlines, Scheduling Map Reduce Applications Subject to
Dead lines.

Text books:
1. Distributed and Cloud Computing, Kai Hwang, Geoffry C.Fox, Jack J.Dongarra MK
Elsevier, 2018.
2. Cloud Computing Theory and Practice, Dan C Marines cu, MK Elsevier, 2013.
3. Cloud Computing, A Hands-on Approach, Arshadeep Bahga, Vijay Madisetti, University
Press, 2014.

Reference Books:
1. Cloud Computing: A Practical Approach. Anthony T. Volte. TobyJ.VeFte,
RobertElsenpeter. Tata McGraw Hill. rp2011.
2. Enterprise Cloud Computing Gautama Shrift, Cambridge University Press 2010.
3. Cloud Computing: Implementation, Management and Security, John W. Rittinouse, James
F Ransomed. CRC Press, rp 2012.
4. Cloud Application Architectures: Building Applications and Infrastructure in the Cloud.
George Reese, Orally SPD, rp2O11.
5. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim
Mather, Sutra Ktriaraswamy, Shahed Latif, Oared SPD, rp2Oll.
Note: The students hall register in another Clouds like AWS/Azure,etc and learn about cloud
Services.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 3 3 3 3 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO5 3 2 2 2 2 0 0 0 0 1 0 1 2 2
Avg 3.0 2.6 2.6 2.6 2.6 0 0 0 0 1.0 0 1.0 2.4 2.4
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
3 0 0 3
II Year I Semester CYBER SECURITY

Course Objectives:
• To familiarize various types of cyber-attacks and cyber-crimes
• To give an overview of the cyber laws
• To study the defensive techniques against the seat tacks

Course Outcomes:
At the end of the course.
CO1: Understand basic cyber security concepts, threats, attacks, and defense mechanisms. (L3)
CO2: Apply cyber laws and forensics techniques to investigate cybercrimes. (L3)
CO3: Analyze mobile-related cybercrimes and suggest appropriate security measures. (L4)
CO4: Evaluate the impact of cybercrimes on organizations and understand hacker behavior. (L5)
CO5: Analyze privacy issues and design domain-specific privacy policies. (L4)

UNIT-I:
Introduction to Cyber Security: Basic Cyber Security Concepts, layers of security,
Vulnerability, threat, Harmful acts, Internet Governance-Challenges and Constraints, Computer
Criminals, CIA Triad, Assets and Threat, motive of attackers, active attacks, passive attacks,
Software attacks, hardware attacks, Spectrum of attacks, Taxonomy of various attacks, IP
spoofing, Methods of defense, Security Models, risk management, Cyber Threats-Cyber Warfare,
Cyber Crime, Cyber terrorism, Cyber Espionage, etc., Comprehensive Cyber Security Policy.

UNIT-II:
Cyberspace and the Law &Cyber Forensics: Introduction, Cyber Security Regulations, Roles
of International Law. The INDIAN Cyberspace, National Cyber Security Policy. Introduction,
Historical background of Cyber forensics, Digital Forensics Science, The Need for Computer
Forensics, Cyber Forensics and Digital evidence, Forensics Analysis of Email, Digital Forensics
Lifecycle, Forensics Investigation, Challenges in Computer Forensics, Special Techniques for
Forensics Auditing

UNIT-III:
Cybercrime: Mobile and Wireless Devices: Introduction, Proliferation of Mobile and Wireless
Devices, Trends in Mobility, Credit card Frauds in Mobile and Wireless Computing Era, Security
Challenges Posed by Mobile Devices, Registry Settings for Mobile Devices, Authentication
service Security, Attacks on Mobile/Cell Phones, Mobile Devices: Security Implications for
Organizations, Organizational Measures for Handling Mobile, Organizational Security Policies
and Measures in Mobile Computing Era, Laptops
UNIT-IV:
Cyber Security: Organizational Implications: Introduction cost of cybercrimes and IPR issues,
web threats for organizations, security and privacy implications, social media marketing: security
risks and perils for organizations, social computing and the associated challenges for
organizations. Cybercrime and Cyber terrorism: Introduction, intellectual property in the
cyberspace, the ethical dimension of cybercrimes the psychology, mindset and skills of hackers
and other cyber criminals.

UNIT-V:
Privacy Issues: Basic Data Privacy Concepts: Fundamental Concepts, Data Privacy Attacks, Data
linking and profiling, privacy policies and their specifications, privacy policy languages, privacy
in different domains- medical, financial, etc.

Text Books:
1. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal Perspectives,
Nina God bole and SUNIT-Belpure, Wiley, 2012.
2. Computer and Cyber Security: Principles, Algorithm, Applications, and Perspectives,
B.B.Gupta, D.P.Agrawal, HaoxiangWang, CRC Press, ISBN 9780815371335, 2018.

Reference Books:
1. Cyber Security Essentials, James Graham, Richard Howard and Ryan Orson, Repress,
2011.
2. Introduction to Cyber Security, Chan- Haw (john)Wu, J. David Irwin, CRC Press T&F
Group, 2013.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 1 0 0 0 1 1 1 3 3
CO2 3 2 2 2 3 1 0 0 0 1 1 1 3 3
CO3 3 2 2 3 3 1 0 0 0 1 1 1 3 3
CO4 3 3 3 3 3 2 0 0 0 1 1 1 3 3
CO5 3 3 3 3 3 2 0 0 0 1 1 1 3 3
Avg 3.0 2.4 2.4 2.6 3.0 1.4 0 0 0 1.0 1.0 1.0 3.0 3.0

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year I Semester
0 0 3 1.5
MACHINE LEARNING WITH PYTHON LAB

Course Objectives:
• Make use of Dataset sin implementing the machine learning algorithms
• Implement the machine learning concepts and algorithms in any suitable language of choice.
• Design Python programs for various Learning algorithms.

Course Outcomes (COs):


At the end of the course, student will be able to
CO1: Implement procedures for the machine learning algorithms. (L3)
CO2: Design Python programs for various learning algorithms. (L3)
CO3: Apply appropriate data sets to the machine learning algorithms. (L3)
CO4: Identify and apply machine learning algorithms to solve real-world problems. (L4)
Note: Consider any data set from Haggle

Experiment-1:
Installation of Python and its packages (Pandas, Jumpy, Skippy, matplotlib and sickest-learn)
(Install Anaconda, Jupiter Notebook, Programs covering basic concepts in Python Programming)
Basics of Python:
Write a program to read two numbers from user and display the result using bitwise&, I and A
Operator son the numbers.
Write a program to calculate the sum of numbers from 1to20 which are not divisible by 2,3 or 5.
Write a program to find the maximum of two numbers using functions.
Implement slicing operation on string sand lists.

Experiment-2:
Implement python program to load structured data onto Data Frame and perform exploratory data
analysis
Implement python program for data preparation activities such as filtering, grouping, ordering and
joining of datasets.

Experiment-3:
Implement Python program to prepare plots such as bar plot, histogram, distribution plot, boxplot,
scatter plot.

Experiment4:
Implement Simple Linear regression algorithm in Python
Implement Gradient Descent algorithm for the above line regression model
Experiment-5:
Implement multiple line regression algorithms using Python.

Experiment-6:
Implement Python Program to build logistic regression and decision tree models using the Python
package stats mode land sclera Apes.

Experiment-7:
Implement Python Program perform the activities such as
- Splitting the data set into training and validation data sets
- Building model using Python package on training dataset and test on the validation dataset

Experiment-8:
Write a Python program to implement k-Nearest Neighbor algorithm to classify the iris data set.
Print both correct and wrong predictions.

Experiment-9:
Implement Support vector Machine algorithm on any dataset

Experiment-10:
Write a program to implement the naive Bayesian classifier for a sample training data set stored
asa .cave file. Compute the accuracy of the classifier, considering few test data sets.

Experiment-11:
Write a Python program to construct a Bayesian network considering medical data. Use this
model to demonstrate the diagnosis of heart patients using standard Heart Disease Data Set.

Experiment-12:
Assuming a set of documents that need to be classified, use the naive Bayesian Classifier model
to perform this task. Built-in Java classes/API can be used to write the program. Calculate the
accuracy, precision and recall for your data set.
Experiment-13:
Implement PCA on any Image dataset for dimensionality reduction and classification of images
into different classes
Experiment-14:
Implement the non-parametric Locally Weighted Regression algorithm in order to fit data points.
Select appropriate data set for your experiment and draw graphs.
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO2 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO3 3 2 2 2 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 3 3 0 0 0 0 1 0 1 3 3
Avg 3.0 2.25 2.25 2.25 2.25 0.0 0.0 0.0 0.0 1.0 0.0 1.0 3.0 3.0
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year I Semester L T p C
0 0 4 2
WEB TECHNOLOGIES LAB
Course Objectives:
• To implement the web pages using HTML and apply styles.
• A belt develop dynamic web page by the use of java script.
• Design to create structure of webpage, to store the data in web document, and
transport information through web.
• A belt writes a well formed/valid XML document.

Course Outcomes (COs):


At the end of the course, student will be able to
CO1: Demonstrate installation and configuration of Tomcat Server and implement client-server
programs using Ruby programming. (L3)
CO2: Learn and implement XML concepts. (L3)
CO3: Develop web applications using PHP. (L5)
CO4: Create dynamic and interactive web pages using HTML, CSS & JavaScript. (L6)

Experiment-1:
Develop static pages (using HTML and CSS) of an online book store. The pages should
resemble: www.flipkart.com the website should consist the following pages.
a) Homepage
b) Registration and user Login
c) User Profile Page
d) Books catalog
e) Shopping Cart
f) Payment By credit card
g) Order Conformation

Experiment-2:
Create and save an XML document on the server, which contains 10 users information. Write a
program, which takes User Id as an input and returns the user details by taking the user
information from the XML document.

Experiment-3:
Write a PHP script to merged worries and sort the mass numbers, in descending order.

Experiment-4:
Write a PHP script the treads data from one file and write into another file.
Experiment-5:
Write a PHP script to printprimenumbersbetween1-50.

Experiment-6:
Valid ate the Registration, user login, user profile and payment by credit card pages using
JavaScript.

Experiment-7:
Write a PHP script to: a. Find the length of a string. b. Count no of word sine string. c.
Reverse string.
d. Search for specific string.

Experiment-8:
Install TOMCAT web server. Convert the static web pages of assignments 2 into dynamic
web pages using serves and cookies. Hint: Users information (user id, password, credit card
number) would be stored in web.xml. Each user should have a separate Shopping Cart.

Experiment-9:
Redo the previous task using JSP by converting the static web pages of assignments 2 into
dynamic web pages. Create a database with user information and books information. The
books catalogue should be dynamically loaded from the database. Follow the MVC
architecture while doing the website.

Experiment-10:
Install a database (My SQL or Oracle). Create a table which should contain at least the
following fields: name, password, email-id, phone number (these should hold the data from
the registration form). Practice 'JDBC' connectivity. Write a java program/served /JSP to
connect to that database and extract data from the tables and display them. Experiment with
various SQL queries. Insert the details of the users who register with the web site, whenever
a new user clicks the submit button in the registration page.

Experiment-11:
Write a JSP which does the following job: Insert the details of the 3or4 users who register
with the web site (week9) by using registration form. Authenticate the user when he submits
the login form using the username and password from the database.

Experiment-12:
Create a simple visual bean with an area filled with a color. The shape of the area depends on
the property shape. If it is set to true then the shape of the area is Square and it is Circle, if it
is false. The color of the area should be changed dynamically for every mouse click.
Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 3 0 0 0 0 2 0 1 3 3
CO4 3 3 3 2 3 0 0 0 0 2 0 1 3 3
Avg 3.0 2.5 2.5 2.25 2.75 0.0 0.0 0.0 0.0 1.5 0.0 1.0 2.5 2.5

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year II Semester
3 0 0 3

DEEP LEARNING
Course Objectives:
• Demonstrate the major technology trends driving Deep Learning
• Build, train and apply fully connected deepener networks
• Implement efficient (vector zed)neural net works
• Analyze the key parameter sandy per parameter sin an aural network architecture

Course Outcomes:
CO1: Demonstrate the mathematical foundation of neural networks. (L2)
CO2: Describe the basics of machine learning. (L2)
CO3: Compare different architectures of deep neural networks. (L4)
CO4: Build a convolutional neural network. (L3)
CO5: Build and train recurrent neural networks (RNN) and LSTMs. (L3)

UNIT-I:
Linear Algebra: Scalars, Vectors, Matrices and Tensors, Matrix operations, types of matrices,
Norms, Eigen decomposition, Singular Value Decomposition, Principal Components Analysis.
Probability and Information Theory: Random Variables, Probability Distributions, Marginal
Probability, Conditional Probability, Expectation, Variance and Covariance, Bays' Rule,
Information Theory. Numerical Computation: Over flow and Underflow, Gradient-Based
Optimization, Constrained Optimization, Linear Least Squares.

UNIT-II:
Machine Learning: Basics and Under fitting, Hyper parameters and Validation Sets, Estimators,
Bias and Variance, Maximum Likelihood, Bayesian Statistics, Supervised and Unsupervised
Learning, Stochastic Gradient Descent, Challenges Motivating Deep Learning. Deep Feed
forward Networks: Learning XOR, Gradient-Based Learning, Hidden UNIT-s, Architecture
Design, Back-Propagation and other Differentiation Algorithms.

UNIT-III:
Regularization for Deep Learning: Parameter Norm Penalties, Norm Penalties as Constrained
Optimization, Regularization and Under-Constrained Problems, Dataset Augmentation, Noise
Robustness, Semi-Supervised Learning, Multi-Task Learning, Early Stopping, Parameter Tying
and Parameter Sharing, Sparse Representations, Bagging and Other Ensemble Methods, Dropout,
Adversarial Training, Tangent Distance, Tangent Prop and Manifold Tangent Classifier.
Optimization
for Training Deep Models: Pure Optimization, Challenges in Neural Network Optimization,
Basic Algorithms, Parameter Initialization Strategies, Algorithms with Adaptive Learning Rates,
Approximate Second-Order Methods, Optimization Strategies and Meta-Algorithms.

UNIT-IV:
Convolution Networks: The Convolution Operation, Pooling, Convolution, Basic Convolution
Functions, Structured Outputs, Data Types, Efficient Convolution Algorithms, Random or
Unsupervised Features, Basis for Convolution Networks.

UNIT-V:
Sequence Modeling: Recurrent and Recursive Nets: Unfolding Computational Graphs, Recurrent
Neural Networks, Bidirectional RNNs, Encoder-Decoder Sequence-to-Sequence Architectures,
Deep Recurrent Networks, Recursive Neural Networks, Echo State Networks, LSTM, Gated
RNNs, Optimization for Long-Term Dependencies, Auto encoders, Deep Generative Models.

Text Books:
1) "Deep Learning", Ian Good fellow, Joshua Bagnio, Aaron Carville, MIT Press, 2016.
2) "Deep learning: A practitioner's approach", Josh Patterson and Adam Gibson, O'Reilly
Media, First Edition, 2017.
Reference Books:
1) Fundamentals of Deep Learning, Designing next-generation machine intelligence
algorithms, Nikhil Bud Uma, O'Reilly, Sheriff Publishers, 2019.
2) Deep learning Cook Book, Practical recipes to get started Quickly, Do we Using, O'Reilly,
Sheriff Publishers, 2019.
e- Resources:
1) https://keras.io/datasets/
2) http://deepleaming.net/tutorial/deepleaming.pdf
3) https://arxiv.org/pdf/1404.7828v4.rxlf
4) https://github.com/lisa-lab/DeepLearningTutorials

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO4 3 3 3 2 2 0 0 0 0 1 0 1 3 3
CO5 3 3 3 2 2 0 0 0 0 1 0 1 3 3
Avg 3.0 2.6 2.6 2.4 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year II Semester L T p C
AD-HOCANDSENSOR NETWORKS 3 0 0 3

Course Objectives:
• From the course the student will learn
• Architect sensor networks for various application setups
• Devise appropriated ate d insemination protocols and model links cost
• Understandingofthefundamentalconceptsofwirelesssensornetworksandhasabasic
knowledge of the various protocols at various layers
• Evaluate the performance of sensor networks and identify bottlenecks

Course Outcomes:
CO1: Evaluate the principles and characteristics of mobile ad hoc networks (MANETs) and
distinguish them from infrastructure-based networks. (L5)
CO2: Determine the principles and characteristics of wireless sensor networks (WSNs). (L3)
CO3: Discuss the challenges in designing MAC, routing, and transport protocols for wireless ad
hoc sensor networks. (L4)
CO4: Illustrate various sensor network platforms, tools, and applications. (L3)
CO5: Demonstrate issues and challenges in security provisioning and explain mechanisms for
security and trust in MANETs and WSNs. (L3)

UNIT-I:
Introduction: Fundamentals of Wireless Communication Technology, The Electromagnetic
Spectrum, Radio propagation Mechanisms, Characteristics of the Wireless channel mobile ad hoc
networks (MANETs),Wireless Sensor Networks (WSNs): concepts and architectures,
Applications of Ad Hoc and Sensor Networks, Design Challenges in Ad hoc and Sensor
Networks.

UNIT-II:
MAC Protocols For Ad Hoc Wireless Networks: Issues in designing a MAC Protocol, Issues in
Designing a MAC Protocol for Ad Hoc Wireless Networks, Design Goals of a MAC Protocol for
Ad Hoc Wireless Networks, Classification of MAC Protocols, Contention-based protocols,
Contention based protocols with Reservation Mechanisms, Contention based protocols with
Scheduling Mechanisms, Multi channel MAC - IEEE 802.11.

UNIT-III:
Routing Protocols And Transport Layer In Ad Hoc Wireless Networks: Routing Protocol:
Issues in designing a routing protocol for Ad hoc networks, Classification, proactive routing,
reactive routing (on- demand), hybrid routing, Transport Layer protocol for Ad hoc networks,
Design Goals of a Transport Layer Protocol for Ad Hoc Wireless Networks, Classification of
Transport Layer solutions-TCP over Ad hotwire less, Network Security, Security in Ad Hoc
Wireless Networks, Network Security Requirements.
UNIT-IV:
Wireless Sensor Networks (WSNS) and Mac Protocols: Single node architecture - hardware
and software components of a sensor node, WSN Network architecture: typical network
architectures, data relaying and aggregation strategies, MAC layer protocols: self-organizing,
Hybrid TDMA/FDMA and CSMA based MAC -IEEE 802.15.4.

UNIT-V:
WSN Routing, Localization &Quos: Issues in WSN routing, OLSR, Localization, Indoor and
Sensor Network Localization, absolute and relative localization, triangulation, QOS in WSN,
Energy Efficient Design, Synchronization.

Text Books:
1) "Ad Hoc Wireless Networks: Architectures and Protocols ", C.Siva Ram Murthy, and
B.S. Manor, Pearson Education, 2008
st
2) "Wireless Adhoc and Sensor Networks", Labiod. H, Wiley,1 edition-2008
3) Theory and Applications", Wireless ad-hoc and sensor Networks, Li, X, Cambridge
University Press, fifth edition-2008.
Reference Books:
1) Theory and Applications",AdHoc & Sensor Networks, 2nd edition, Carlos De Morays
Curdier, Dharma Parkas Agawam, World Scientific Publishing Company, 2011
2) "Wireless Sensor Networks ", Fang Zhao and Leon ides Gibes, Elsevier Publication
nd
2 Edition- 2004
3) "Protocols and Architectures for Wireless Sensor Networks”, Holder Kurland Andreas
Willig, Wiley,2005 (soft copy available)

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 3 2 2 3 0 0 0 0 1 0 1 3 3
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO4 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO5 3 2 2 2 2 0 0 0 0 1 0 1 2 3
Avg 3.0 2.4 2.6 2.2 2.4 0 0 0 0 1.0 0 1.0 2.4 2.6

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year II Semester L T p C
3 0 0 3
NETWORK PROGRAMMING

Course Objectives:
• Student able to learn about the protocols which are using in the current scenario.
• To learn and understand client server relations and OSI programming Implementation of
the socket and IPC.

Course Outcomes:

CO1: Explain OSI model, TCP/UDP protocols, and internet services. (L2)
CO2: Describe TCP client-server functions and server process management. (L2)
CO3: Demonstrate TCP socket programming and I/O multiplexing. (L3)
CO4: Illustrate UDP socket programming and DNS address resolution. (L3)
CO5: Explain IPC mechanisms and remote login concepts. (L2)

UNIT-I:
Introduction to Network Programming: OSI model, UNIX standards, TCP and UDP& TCP
connection establishment and Format, Buffer sizes and limitation, standard internet services,
Protocol usage by common internet application.

UNIT-II:
TCP client server: Introduction, TCP Echo server functions, Normal startup, terminate and
signal handling server process termination, Crashing and Rebooting of server host shutdown of
server host.

UNIT-III:
Sockets: Address structures, value -result arguments, Byte ordering and manipulation function
and related functions Elementary TCP sockets-Socket, connect, bind, listen, accept, fork and
exec function, concurrent servers. Close function and related function.
1/0Multiplexingand socket options: I/O Models, select function, Batch input, shutdown
function, poll function, TCP Echo server, get sock opt and set sock opt functions. Socket states,
Generic socket option IPV6 socket option ICMPV6 socket option IPV6 socket option and TCP
socket options.

UNIT-IV:
Elementary UDP sockets: Introduction UDP Echo server function, lost datagram, summary of
UDP example, Lack of flow control with UDP, determining outgoing interface with UDP.
Elementary name and Address conversions: DNS, get host by Name function, Resolver
option, Function and IPV6 support, unnamed function, other networking information.
UNIT-V:
IPC: Introduction, File and record locking, Pipes, FIFOs streams and messages, Name spaces,
system IPC, Message queues, Semaphores. Remote Login: Terminal line disciplines, Pseudo-
Terminals, Terminal modes, Control Terminals, rlogin Overview, RPC Transparency Issues.

Text books:
1) UNIX Network programming, Vol. I, Sockets API, 2nd Edition.- W.Richard Stevens,
Pearson Eddo. Asia, 2003.
2) UNIX Network Programming, 1stEdition,-W.RichardStevens.PHI, 2003.

References Books:
1) UNIX Systems Programming using C++ TCHAN, PHI, 2005.
2) UNIX for Programmers and Users,3rd Edition Graham GLASS, King albs, Pearson
Education, 2007.
3) Advanced UNIX Programming 2ndEdition M.J.ROCHKIND, Pearson Education, 2005.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO3 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO4 3 3 3 2 2 0 0 0 0 1 0 1 2 3
CO5 3 2 2 2 2 0 0 0 0 1 0 1 2 2
Avg 3.0 2.4 2.4 2.2 2.2 0 0 0 0 1.0 0 1.0 2.2 2.2

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year II Semester 3 0 0 3

BLOCKCHAIN TECHNOLOGIES
Course Objectives:
• Impart strong technical understanding of Block chain technologies
• Develop familiarity of current technologies, tools, and implementation strategies
• Introduce application areas, current practices, and research activity

Course Outcomes (Cos) :At the end of the course, student will be able to
CO1: Demonstrate the foundation of block chain technology and understand payment and funding
processes. (L3)
CO2: Identify risks involved in building block chain applications. (L3)
CO3: Review legal implications of smart contracts. (L4)
CO4: Analyze the current landscape of block chain implementations and understand crypto
currency markets. (L4)
CO5: Examine strategies to profit from trading crypto currencies. (L4)

UNIT-I:
The consensus problem, Asynchronous Byzantine Agreement, AAP protocol and its analysis,
Nanaimo to Consensus on permission-less, nameless, peer-to-peer network, Abstract Models for
BLOCKCHAIN, GARAY model, RLA Model, Proof of Work (Paw) as random oracle, formal
treatment of consistency, likeness and fairness - Proof of Stake (Pops) based Chains, Hybrid
models (Paw + Pops).

UNIT-II:
Crypto graphic basics for crypto currency, A short overview of Hashing, signature schemes,
encryption schemes and elliptic curve cryptography

UNIT-III:
Bit co n, Wallet, Blocks, Berkley Tree, hardness of mining, transaction verifiability, anonymity,
forks, double spending, mathematical analysis of properties of Bit coin.

UNIT-IV:
Ethereal: Ethereal Virtual Machine (EVM), Wallets for Ethereal, Solidity, Smart Contracts,
some attacks on smart contracts

UNIT-V:
(Trends and Topics): Zero Knowledge proofs and protocols in Blockchain, Succinct non-
interactive Argument for Knowledge (SNARK), pairing on Elliptic curves, cash.
Text Books:
1. Arvin Narayanan, Joseph Bonnie, Edward Felton, Andrew Miller, and Steven Gold
feeder. Bit coin and crypto currency technologies: a comprehensive introduction.
Princeton University Press, 2016. (Free download available)

Reference Books:
1. Research perspectives and challenges for Bit coin and crypto currency, IEEE
Symposium on security and Privacy, Joseph Bonne aortal, SoK,2015 (article available
for free download) {curtain raiser kind of generic article, written by seasoned experts
and pioneers}.
2. The bit coin backbone protocol - analysis and applications, J.A. Gray et al,
EUROCRYPT 2015 LNCS Vole 9057, (VOLII), pp 281-310. (Also available at
eprint.iacr.org/2016/1048). (Serious beginning of discussions related to formal models
for bit coin protocols).
3. Analysis of Block chain protocol in Asynchronous networks, Repasts et al,
EUROCRYPT 2017, (eprint.iacr.org/2016/454). A significant progress and
consolidation of several principles).

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 3 0 0 0 0 1 0 1 3 3
CO2 3 3 2 2 3 0 0 0 0 1 0 1 2 2
CO3 2 3 2 2 2 0 0 0 0 1 0 1 3 3
CO4 3 3 3 2 3 0 0 0 0 1 0 1 2 2
CO5 2 2 2 2 3 0 0 0 0 1 0 1 3 3
Avg 2.6 2.6 2.2 2.0 2.8 0 0 0 0 1.0 0 1.0 2.6 2.6

Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
L T p C
II Year II Semester 3 0 0 3
SOFTWARE TESTING METHODOLOGIES

Course Objectives:
• To study fundamental concepts in software testing and discuss various software
testing issues and solutions in software unit, integration, regression and system
testing
• To learn how to plan a test project, design test cases and data, conduct testing,
manage software problems and defects, and generate a test report
• To expose advanced software testing concepts such as object-oriented software
testing methods, web-based and component-based software testing
• To understand software test automation problems and solutions
• To learn how to write software test documents and communicate with engineers in
various forms

Course Outcomes:
By the end of the course, the student should have the ability to:
CO1: Understand the fundamentals, goals, lifecycle, and methodologies of software testing. (L2)
CO2: Apply black-box and white-box testing techniques for dynamic software testing. (L3)
CO3: Perform static testing, validation activities, and regression testing effectively. (L3)
CO4: Analyze test suite management techniques and apply software quality and debugging methods.
(L4)
CO5: Evaluate test automation tools and testing approaches for object-oriented and web-based
systems. (L5)

UNIT-I:
Software Testing: Introduction, Evolution, Myths & Facts, Goals, Psychology, definition,
Model for testing, Effective vs. Exhaustive Software Testing.
Software Testing Terminology and Methodology: Software Testing Terminology, Software
Testing Life Cycle, Software Testing Methodology.
Verification and Validation: Verification & Validation Activities, Verification, Verification
of Requirements, High-level and low-level designs, verifying code, Validation

UNIT-II:
Dynamic Testing-Black Box testing techniques: Boundary Value Analysis, Equivalence
class Testing, State Table based testing, Decision table based testing, Cause-Effect Graphing
based testing, Error guessing
White-Box Testing: need, Logic Coverage criteria, Basis Path testing, Graph matrices, Loop
testing, data flow testing, mutation testing

UNIT-III:
Static Testing: Inspections Structured Walkthroughs, Technical Reviews
Validation activities: UNIT testing, Integration Testing, Function testing, system testing,
acceptance testing
Regression testing: Progressives Vs regressive testing, Regression test ability, Objectives of
regression testing, Regression testing types, Regression testing techniques

UNIT-IV:
Efficient Test Suite Management: growing nature of test suite, Minimizing the test suite and
its benefits, test suite prioritization, Types of test case prioritization, prioritization
techniques, measuring the effectiveness of prioritized test suite. Software Quality
Management: Software Quality metrics, SQA models Debugging: process, techniques,
correcting bugs.

UNIT-V:
Automation and Testing Tools: need for automation, categorization of testing tools, selection
of testing tools, Cost incurred, Guidelines for automated testing, over view of some
commercial testing tools such as Win Runner, Load Runner, Meter and JUNIT. Test
Automation using the Selenium tool.
Testing Object Oriented Software: basics, Object-oriented testing Testing Web-based
Systems: Challenges in testing for web-based software, quality aspects, web engineering,
testing of web-based systems, testing mobile systems

Text Books:
1) Software Testing, Principles and Practices, Marsh Chatham Oxford, 2015
2) Software Testing- Yogis Singh, CAMBRIDGE, 2012.

Reference books:
1) Foundations of Software testing, AdityaPMathur, 2ed, Pearson, 2013.
2) Software testing techniques- Bares Beizer, Dreamtech, and second edition, 1990.
3) Software Testing, Principles, techniques and Tools, MGL image, TMH, 2000.
4) Effective Methods for Software testing, Willian EPerry, 3ed, Wiley, 2006.

e- Resources:
https://www.tutorialspoint.com/softwaretestingdictionary/testtools.htm

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 3 3 2 3 0 0 0 0 1 0 1 3 3
CO3 3 2 2 3 2 0 0 0 0 1 0 1 2 2
CO4 3 3 3 3 3 0 0 0 0 1 0 1 3 3
CO5 2 3 3 3 3 0 0 0 0 1 0 1 3 3
Avg 2.8 2.6 2.6 2.6 2.6 0 0 0 0 1.0 0 1.0 2.6 2.6
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert
II Year II Semester L T p C
3 0 0 3
BIG DATA ANALYTICS
Course Objectives:
• To know the fundamental concepts of big data and analytics.
• To explore to island practices for working with big data
• To learn about stream computing.
• To know about there search that requires the integration of large amounts of data.

Course Outcomes (COs): At the end of the course, students will be able to

CO1: Identify the need-based tools like Pig and Hive to implement data analytics projects. (L3)
CO2: Organize distributed file systems and technologies for big data analysis. (L3)
CO3: Discuss various clustering and classification techniques used in data analytics. (L2)
CO4: Analyze stream memory and Spark models for big data processing. (L4)
CO5: Explain the role of NoSQL databases in big data analytics. (L2)

UNIT-I:
Introduction to Big Data- Evolution of Big data, Best Practices for Big data Analytics, Big data
characteristics, Validating, The Promotion of the Value of Big Data, Big Data Use Cases,
Characteristics of Big Data Applications, Perception and Quantification of Value, Understanding
Big Data Storage, A General Over view of High, Performance Architecture, HDFS, Map Reduce
and YARN, Map Reduce Programming Model

UNIT-II:
Frameworks-Applications on Big Data Using Pig and Hive, Data processing operator sin
Pig, Hive services, Hive QL, Querying Data in Hive, fundamentals of Base and Zoo Keeper,
IBM Info Sphere Big Insights and Streams

UNIT-III:
Clustering and Classification-Advanced Analytical Theory and Methods: Overview of
Clustering, K-means, Use Cases - Overview of the Method, Determining the Number of
Clusters, Diagnostics, Reasons to Choose and Cautions. Classification: Decision Trees,
Overview of a Decision Tree, The General Algorithm, Decision Tree Algorithms ,Evaluating
Decision Tree, Decision Trees in R, Naive Bays, Bays Theorem, Naive Bays Classifier.
UNIT-IV:
Stream Memory and Spark- Introduction to Streams Concepts, Stream Data Model and
Architecture, Stream Computing, Sampling Data in a Stream, Filtering Streams, Counting
Distinct Elements in a Stream, Introduction to Spark Concept, Spark Architecture and
components, spark installation, spark RDD(Resilient Distributed Dataset), spark RDD
operations.

UNIT-V:
NOSQL Data Management for Big Data and Visualization- Nasal Databases: Schema-less
Models: Increasing Flexibility for Data Manipulation, Key Value Stores, Document Store,
Tabular Stores, Object Data Stores, Graph Databases Hive, Shading, Base, analyzing big data
with twitter, Big data for E- Commerce Big data for biogas, Review of Basic Data Analytic
Methods using R.

Text Books:
1. Anand Rajaraman and Jeffrey David Pullman, "Mining of Massive Datasets", Cambridge
University Press, 2012.
2. David Lashing, “Big Data Analytics: From Strategic Planning to Enterprise Integration with
Tools, Techniques, No SQL, and Graph", Morgan Kaufmann/Elsevier Publishers, 2013.

Reference Books:
1. "Intelligent Data Analysis", Michael Berthold, David. Hand, Springer, 2007.
2. The Definitive Guide", Tom White "Hardtop, Third Edition, O’reilly Media, 2012.
3. Bill Franks," Taming the Big Data Tidal Wave: Finding Opportunities in Streams with Huge
Data Advanced Analytics", John Wiley& sons,2012.
4. "Making Sense of Data", Glenn J.Myatt, John Wiley & Sons,2007.
5. "Data Mining Concepts and Techniques", Jiawei Han, Michelin Kamber, 2nd Edition,
Elsevier, Reprinted 2008.

Course Program
Outcomes Specific
Program Outcomes(POs)
(COs) Outcomes
(PSOs)
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2
CO1 3 2 2 2 2 0 0 0 0 1 0 1 2 2
CO2 3 2 3 2 2 0 0 0 0 1 0 1 2 2
CO3 3 2 2 3 2 0 0 0 0 1 0 1 3 3
CO4 3 2 3 3 2 0 0 0 0 1 0 1 3 3
CO5 3 2 2 3 3 0 0 0 0 1 0 1 3 3
Avg 3.0 2.0 2.8 2.6 2.2 0 0 0 0 1.0 0 1.0 2.6 2.6
Dr.CH Bindhu Madhuri Dr.K. Amarendra Dr.Kunjam Nageswara Rao Dr.P. Lalitha Kumari
University Nominee Subject Expert Subject Expert Chair Person, BOS

Mrs G.Amala Devi Mrs. K.Jyothi Mr P. Gopi


Internal Member Internal Member Industry Expert

You might also like