ACADEMIC REGULATIONS, COURSE STRUCTURE

AND DETAILED SYLLABUS

Effective from the Academic Year 2021-22 onwards

Course Structure and 3rd Years Syllabus

for
B.Tech. Computer Science and Engineering (CSE) Programme.
(MR21 Regulations – Effective from Academic Year 2021-22 onwards)

For
B.Tech. - Four Year Degree Programme

MALLA REDDY ENGINEERING COLLEGE

(An UGC Autonomous Institution, Approved by AICTE and Affiliated to JNTUH, Hyderabad)
Recognized under section 2(f) &12 (B) of UGC Act 1956, Accredited 3rd time by NAAC with ‘A++’ Grade, NIRF Rank Band 201-250,
ARIIA Band Performer, NBA Tier-I Accredited (B.Tech.- CE, EEE, ME, ECE &CSE, M.Tech. - SE, EPS, TE)
Maisammaguda (H), Dhulapally (Post Via Kompally), Medchal - Malkajgiri District, Secunderabad– 500100.
Telangana State. e-mail: [email protected], Website: www.mrec.ac.in

1
 MALLA REDDY ENGINEERING COLLEGE
COURSE STRUCTURE – B.Tech. Computer Science and Engineering
(CSE)Programme.
(MR21 Regulations - Effective from Academic Year 2021 – 22 onwards)

SEMESTER – I
Contact
S. Course Credits
Category Name of the Subject hours/week
No Code
L T P
Linear Algebra and
1. BSC B0B01 3 1 - 4
Numerical Methods
2. HSMC B0H01 English 3 - - 3
Basic Electrical and Electronics
3. ESC B0201 3 - - 3
Engineering
4. ESC B0501 Programming for Problem Solving 3 - - 3
English Language and Communication
5. HSMC B0H02 - - 2 1
skills Lab
Basic Electrical and Electronics
6. ESC B0202 - - 2 1
Engineering Lab
7. ESC B0502 Programming for Problem Solving Lab - - 2 1
8. ESC B1201 Engineering and IT Workshop - 1 2 2
Total 12 2 8
18
Total Contact Hours 22

SEMESTER – II
Contact
S. Course Credits
Category Name of the Subject hours/week
No Code
L T P
1. BSC B0B17 Engineering Chemistry 3 1 - 4
2. BSC B0B02 Probability and Statistics 3 - - 3
3. BSC B0B09 Semiconductor Physics 3 1 - 4
4. ESC B0504 Python Programming 3 1 - 4
5. ESC B0305 Engineering Drawing 2 - 2 3
6. BSC B0B18 Engineering Chemistry Lab - - 2 1
7. BSC B0B11 Applied Physics Lab - - 2 1
8. ESC B0506 Python Programming Lab - 1 2 2
Total 14 4 8
22
Total Contact Hours 26

2
 III SEMESTER
Contact
S. Course hours/week Credits
No
Category Course Title
Code L T P
1 PCC B0507 Discrete Mathematics 3 - - 3
Computer Organization and
2 PCC B0508 3 - - 3
Architecture
3 PCC B0509 Data Structures 3 - - 3
4 PCC B0510 Object Oriented Programming 3 - - 3
5 PCC B0511 Operating Systems 3 - - 3
6 PCC B0512 Data Structures Lab - - 3 1.5
7 PCC B0513 Object Oriented Programming Lab - - 3 1.5
8 PCC B0514 Operating Systems Lab - 1 2 2
9 MC B00M1 Gender Sensitization - - 2 -
Total 15 1 10
20
Total Contact Hours 26

IV SEMESTER
S. Course
No Category Code Course Title L T P Credits
Applied Statistics and Optimization
1 BSC B0B07 3 - - 3
Techniques
2 PCC B0515 Database Management Systems 3 - - 3
3 PCC B1202 Web Technologies 3 - - 3
4 PCC B0516 Design and Analysis of Algorithms 3 - - 3
Professional Elective –I
B0517 Mobile Application Development
B0518 Free and Open Source Technologies
5 B0519
PEC-I Artificial Intelligence 3 - - 3
B0522 Computer Graphics
B0523 Mobile Computing
6 PCC B0520 Database Management Systems Lab - 1 2 2
7 PCC B1206 Web Technologies Lab - - 3 1.5
8 PCC B0521 Design and Analysis of Algorithms Lab - - 3 1.5
9 MC B00M2 Environmental Science 2 - - -
Total 17 1 8
20
Total Contact Hours 26

3
 MALLA REDDY ENGINEERING COLLEGE (Autonomous)
III Year COURSE STRUCTURE – B.Tech. Computer Science and Engineering (CSE)
Programme.
(MR21 Regulations - Effective from Academic Year 2021– 22 onwards)

V SEMESTER
Contact
S. Course Credits
Category Name of the Course Hours / week
No. Code
L T P
1 HSMC B0H09 Management Fundamentals 3 - - 3
2 PCC B6201 Computer Networks 3 - - 3
3 PCC B0524 Formal Languages and Automata Theory 3 1 - 4
4 PCC B0525 Software Engineering & Modeling 3 - - 3
Professional Elective –II
B0526 Advanced Databases and Security
B0527 Cloud Computing
5 B0528 Semantic Web
PEC-II 3 - - 3
B0529 Advanced Computer Architecture
B0531 Scripting Languages
6 PCC B6202 Computer Networks Lab - - 3 1.5
7 PCC B0530 Software Engineering & Modeling Lab - - 3 1.5
8 MC B00M3 Quantitative Aptitude and Verbal Reasoning - I 2 - - -
Total 17 1 6 19
Total Contact Hours 24

VI SEMESTER
Contact
S. Course Credits
Category Name of the Course Hours / week
No. Code
L T P
1 HSMC B0H08 Engineering Economics and Accountancy 3 - - 3
2 PCC B0532 Compiler Design 4 - - 4
Professional Elective -III
B0533 Distributed Systems
B0534 Animation Techniques
3 B0535 Multimedia and Rich Internet Applications
PEC-III 3 - - 3
B1208 Augmented Reality and Virtual Reality
B0536 Data Mining
Professional Elective -IV
B0537 Natural Language Processing
B6203 Cryptography and network Security
4 B0538 Agile Methodologies
PEC-IV 3 - - 3
B6920 Adhoc and Sensor Networks
B0541 Image Processing
5 OEC-I Open Elective-I 3 - - 3
6 HSMC B0H03 English Communication and Presentation Skills Lab - - 2 1
7 PCC B0543 Compiler Design Lab - 1 2 2
8 PCC B0544 Data Mining Lab - 1 2 2
9 MC B00M4 Quantitative Aptitude and Verbal Reasoning – II 2 - - -
Total 8 2 6 21
Total Contact Hours 26

4
 MALLA REDDY ENGINEERING COLLEGE (Autonomous)
COURSE STRUCTURE – B.Tech. Computer Science and Engineering (CSE)
Programme.
(MR21 Regulations - Effective from Academic Year 2021 – 22 onwards)

VII SEMESTER
Contact Hours
S. Course / week
Category Name of the Course Credits
No. Code L T P
1 PCC B0542 Big Data Analytics 3 1 - 4
2 PCC B1210 Machine Learning 3 - - 3
3 PCC B6217 Cyber Security 3 - - 3
Professional Elective-V
B0545 Block chain Technologies
B0546 Business Analytics
4 Principles of Programming
PEC-V B0547 3 - - 3
Languages
B6917 Internet of Things
B0548 Software Testing Methodologies
5 OEC-II Open Elective-II 3 - - 3
6 PCC B0549 Big Data Analytics Lab - 1 2 2
7 PCC B1214 Machine Learning Lab - - 2 1
8 PRJ B00P1 Industry Oriented Mini Project 4 2
Total 15 2 8
Total Contact Hours 21
25

VIII SEMESTER
Contact Hours / Credit
Course
S. No. Category Name of the Course week s
Code
L T P
B6705 Python for Data Science
B0550 Deep Learning
B0551 Social Networking
1 PEC-VI B0552 Human Computer Interaction 3 - - 3
Software Quality Assurance and
B0554
Testing
2 OEC-III Open Elective-III 3 - - 3
Technical Seminar on Emerging
3 PRJ B00P3 - - 2 1
Areas
4 PRJ B00P2 MAJOR PROJECT Phase-2 - - 24 12
Total 6 - 26 19
Total Contact Hours 32

5
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous)
(MR-21) V Semester
Code: B0H09 Management Fundamentals L T P
Credits: 3 3 - -

Prerequisites: NIL

Course Objectives:
Through reading the text, references and discussion of cases students should be able to
understand the fundamentals underlying the management of an organization.

MODULE – I: Management and Principles of Management [09 Periods]

Introduction to Management: Concepts of Management and organization-nature,
importance and Functions of Management, Taylor’s Scientific Management Theory, Fayol’s
Principles of Management.
Management Theories: Mayo’s Hawthorne Experiments, Maslow’s Theory of Human
Needs, Douglas McGregor’s Theory X and Theory Y, Herzberg’s Two-Factor Theory of
Motivation, Systems Approach to Management, Leadership Styles, Corporate Social
responsibility.

MODULE – II: Planning, Organization and types of Structures [10 Periods]

Planning: Need for planning- -Steps in the process of planning-Advantages and limitation of
planning. Types of planning - Vision, Mission, Goals, Objectives, Policy, Strategy,
Programmes, Elements of Corporate Planning Process, Management by Objectives (MBO).
Organization and types of Structures: Basic concepts related to Organization -
Departmentation and Decentralization, Types of Organizations- Line organization, Line and
staff organization, functional organization, committee organization, matrix organization,
Virtual Organization, Cellular Organization, boundary less organization, inverted pyramid
structure, lean and flat Organization structure.

MODULE – III: Staffing and controlling [10 Periods]

A. Staffing: Basic concepts of HRM, functions of HR Manager: Manpower planning,
Recruitment, Selection, Training and Development. Performance Appraisal, Job
Evaluation and Merit Rating.
B. Controlling: process of controlling, types of controlling, managing productivity, Quality
Control: chart, R chart, C chart, P chart, (simple Problems), Deming’s contribution to
quality.

MODULE – IV: Operations and Materials Management [09 Periods]

Operations Management :Principles and Types of Plant Layout-Methods of production
(Job, batch and Mass Production), Work Study -Basic procedure involved in Method Study
and Work Measurement.
Materials Management: Objectives, Need for Inventory control, EOQ, ABC Analysis,
Purchase Procedure, Stores Management and Stores Records.

MODULE – V: Project Management and Contemporary Practices [10 Periods]

Project Management (PERT/CPM): Network Analysis, Programme Evaluation and
Review Technique (PERT), Critical Path Method (CPM), Identifying critical path,

6
Probability of Completing the project within given time, Project Cost Analysis, Project
Crashing. (Simple problems)
Contemporary Management Practices: Basic concepts of ERP, Just-In-Time (JIT) System,
Total Quality Management (TQM), six sigma and Capability Maturity Model (CMM) Levels,
Bench marking, Balanced Score card.

TEXT BOOKS:
1. Aryasri, Management Science, 4th edition TMH, 2004. (UNITS I,II,III,IV,V)
2. Stoner, Freeman, Gilbert, Management, Pearson Education, New Delhi, 6th Ed, 2004.
(UNITS I,II)

REFERENCES:
1. Kotler Philip & Keller Kevin Lane, “Marketing Management”, PHI, 12th edition, 2005
2. Koontz &Weihrich, “Essentials of Management”, TMH, 6th edition, 2005.
3. Thomas N.Duening& John M. Ivancevich “Management - Principles and Guidelines”,
Biztantra, 5th edition 2003.
4. Memoria & S.V. Gauker, “Personnel Management”, Himalaya, 25th edition, 2005
5. Samuel C. Certo, “Modern Management”, PHI, 9th edition, 2005.

E RESOURCES:
1. http://freevideolectures.com/Course/2689/Management-Science
2. http://www.onlinevideolecture.com/?course=mba-programs&subject=human-resource-
management
3. http://www.onlinevideolecture.com/?course=mba-programs&subject=marketing-
fundamental
4. http://freevideolectures.com/Course/2371/Project-and-Production-Management
5. http://nptel.ac.in/courses/110105034/

Course Outcomes:
At the end of the course, students will be able to
1. Understand the various concepts, principles and theories of management.
2. Understand the basic concepts of planning and various structures of organizations.
3. Understand the process of staffing and controlling
4. Understand the process of operations management. Also learn the concepts of materials
management and marketing management at an organization.
5. Understand the various contemporary management practices. Also the project
management techniques.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3 1 2
CO2 3 2 1 2
CO3 3 2 1 3
CO4 3 2 1

7
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous)
(MR-21) V Semester
Code: B6201 COMPUTER NETWORKS L T P
Credits: 3 3 - -
Prerequisites: NIL

Course Objectives:
This course provides students to understand the fundamental concepts of computer
networking and communications make use of IEEE standards in the construction of LAN,
build the skills of subnetting and supernetting, explain the concepts of protocols of
Transport Layer, QoS and Congestion control mechanisms and demonstrate different
protocols of Application Layer.
MODULE I: Basics of Networking and Physical layer [10 Periods]
Basics of Networking - Components – Direction of Data flow – Networks – Components
and Categories – Types of Connections – Topologies –Protocols and Standards – ISO /
OSImodel, TCP/IP model.
Physical layer - Digital transmission, Multiplexing, Transmission Media, Switching,
CircuitSwitched Networks, Datagram Networks, Virtual Circuit Networks.

MODULE II: Data link layer [11 Periods]

Functionalities of Data link layer - Introduction, Framing, Error Detection and
Correction
– Parity – LRC – CRC- Hamming code, Flow and Error Control, Noiseless Channels,
Noisy Channels, HDLC, Point to Point Protocols. Random access, Controlled access,
Channelization, Collision Free Protocols.
LAN - LAN - Ethernet IEEE 802.3 - IEEE 802.4 - IEEE 802.5 - IEEE 802.11

MODULE III: Network Layer [09 Periods]

A:Basics of Network Layer - Logical Addressing, Internetworking, Tunneling, Address
mapping,
B: Communication Protocols - ICMP, IGMP, Forwarding, Unicast Routing Protocols,
Multicast Routing Protocols.
MODULE IV: Transport Layer [09 Periods]
Connection Oriented and Connectionless Protocols -Process to Process Delivery, UDP
and TCP protocols, SCTP.
Congestion Control - Data Traffic, Congestion, Congestion Control, QoS, Integrated
Services, Differentiated Services, QoS in Switched Networks.
MODULE V: Application layer [09 Periods]
DNS - Domain name space, DNS in internet, Electronic mail
Protocols and Network Security - FTP, WWW, HTTP, SNMP, Network Security,
Cryptography.

TEXT BOOKS:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 4thEdition,TMH,
2006.
2. Andrew S Tanenbaum, “Computer Networks”, 4th Edition, PearsonEducation/PHI.

8
9
REFERENCES:
1. P.C .Gupta, “Data communications and computer Networks”, PHI.
2. S.Keshav, “An Engineering Approach to Computer Networks”, 2nd Edition,Pearson
Education.
3. W.A. Shay, “Understanding communications and Networks”, 3rd Edition,Cengage
Learning.
4. James F.Kurose & Keith W. Ross, “Computer Networking: A Top-DownApproach
Featuring the Internet”, 3rd Edition, Pearson Education.

E-RESOURCES:
1. https://www.saylor.org/site/wp-content/uploads/2012/02/Computer-
Networking- Principles- Bonaventure-1-30-31-OTC1.pdf
2. http://ebook-dl.com/downloadbook/230
3. https://doi.org/10.1016/0169-7552(89)90019-6
4. http://nptel.ac.in/courses/106105081/

Course Outcomes:
At the end of the course, students will be able to
• Understand the Layered Architecture of Computer Networks.
• Conceptualize the protocols of Data Link Layer and can
build Local areanetworks.
• Apply Subnet and Supernet concepts in the construction of computer network.
• Summarize the protocols used in Transport Layer, QoS and Congestion
controlmechanisms.
• Analyze different protocols of Application Layer and various security risks.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2
CO2 2 2
CO3 3 3
CO4 2

10
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous) V Semester
(MR-21)
Code: B0524 FORMAL LANGUAGES AND AUTOMATA L T P
Credits: 4 THEORY 3 1 -

Prerequisites: NIL

Course Objectives:
This course enables the students to define basic properties of formal languages, explain the
Regular languages and grammars, inter conversion, Normalizing CFG, describe the context
free grammars, minimization of CNF, GNF and PDA, designing Turing Machines and types
of Turing Machines, church’s hypothesis counter machines, LBA, P & NP problems and LR
grammar.

MODULE I: Introduction [10 Periods]

Basics of Formal Languages - Strings, Alphabet, Language, Operations, Chomsky hierarchy
of languages, Finite state machine Definitions, finite automation model, acceptance
languages.
Nondeterministic Finite Automata: Formal Definition, an application, Text Search, Finite
Automata with Epsilon-Transitions. Deterministic Finite Automata: Definition of DFA,
How A DFA Process Strings, The language of DFA, Conversion of NFA with €-transitions to
NFA without €-transitions. Conversion of NFA to DFA, Moore and Melay machines

MODULE II: Regular Languages [10 Periods]

Representation of Regular Expressions - Regular Sets, Regular Expressions, identity Rules,

Constructing Finite automata for the given regular expressions, Conversion of Finite
automata to regular expressions.

Pumping Lemma - Pumping lemma of regular sets, closure properties of regular sets (proofs
not required). Regular Grammars – right linear and left linear grammars, equivalence
between regular grammar and FA.

MODULE III: CFG and PDA [10 Periods]

A: Context Free Grammar - Derivation trees, sentential forms, right most and left most
derivations of strings. Ambiguity in Context frees Grammars. Minimization of Context free
grammars, CNF, GNF, Pumping Lemma for Context Free Languages.

B: Push Down Automata - Definition, model, acceptance of CFL, Acceptance by final state,
acceptance by empty state and its equivalence, Equivalence of CFL and PDA (proofs not
required), Introduction to DCFL and DPDA.

MODULE IV: Computable Functions [09 Periods]

Turing Machine - Definition, model, Design of TM, computable functions. Recursive

Enumerable Languages and Theorems - Recursively enumerable languages, Church’s
hypothesis, counter machine, types of Turing Machines (proofs not required)

11
 MODULE V: Computability Theory [09 Periods]

Linear Bounded Automata - Linear Bounded Automata and context sensitive languages, LR
(0) grammar, decidability of problems, Universal TM. P and NP Problems - Undecidable
problems about Turing Machine – Post’s Correspondence Problem, The classes P and NP.

TEXT BOOKS:

1. H.E. Hopcroft, R. Motwani and J.D Ullman, “Introduction to Automata Theory,

Languages and Computations”, Second Edition, Pearson Education, 2003.
2. KVN SUNITHA N Kalyani, "Formal languages and Automata Theory", Pearson
Education

REFERENCES:

1. H.R.Lewis and C.H.Papadimitriou, “Elements of The theory of Computation”, Second

Edition, Pearson Education/PHI, 2003
2. J.Martin, “Introduction to Languages and the Theory of Computation”, Third Edition,
TMH, 2003.
3. Micheal Sipser, “Introduction of the Theory and Computation”, Thomson Brokecole,
1997.

E-RESOURCES:
1. https://books.google.co.in/books?isbn=8184313020
2. https://www.iitg.ernet.in/dgoswami/Flat-Notes.pdf
3. http://www.jalc.de/
4. https://arxiv.org/list/cs.FL/0906
5. http://freevideolectures.com/Course/3379/Formal-Languages-and-
Automata- Theory
6. http://nptel.ac.in/courses/111103016/

Course Outcomes:
At the end of the course, students will be able to
1. Define the theory of automata types of automata and FA with outputs.
2. Differentiate regular languages and applying pumping lemma.
3. Classify grammars checking ambiguity able to apply pumping lemma for CFL
various types of PDA.
4. Illustrate Turing machine concept and in turn the technique applied in computers.
5. Analyze P vs NP- Class problems and NP-Hard vs NP-complete problems, LBA, LR
Grammar, Counter machines, Decidability of Problems.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 2 2 2
CO2 2 2 2 2 2 2 2
CO3 2 2 2 2 2 2 2
CO4 2 2 2 2 2 2 2
CO5 2 2 2 2 2 2 2

12
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous)
(MR-21) V Semester
Code: B0525 Software Engineering & Modeling L T P
Credits: 3 3 - -

Course Objectives:
1. Student will be able to learn fundamental aspects of Software Engineering and
analyze various process models.
2. To identify various types of requirements and the process for Requirements
Engineering.
3. To make use of various System Models to conceptualize and construct a system.
4. To demonstrate different testing tactics and define metrics for software measurement.
5. To classify and mitigate the Software Risks and learn to achieve quality standards.

Module I: Introduction to Software Engineering [09 Periods]

Basics terms of Software Engineering: Evolving role of software, changing nature of
Software, Software Myths. A Generic View of Process:-Software engineering-A layered
technology, The Capability Maturity Model Integration (CMMI)
Process Models: The water fall model, Incremental process models, evolutionary process
models, and the unified process.

Module II: Requirements of Software Engineering [09Periods]

Software Requirements: Functional and non functional requirements, User requirements,
System requirements, Interface specification, The software requirements document.
Requirements Engineering Process: Feasibility studies, requirements elicitation and
analysis, requirements validation, requirements management
System Models: Context models, Behavioral models, Data models, Object models,
Structured methods

Module III: Phases of Software Engineering [09 Periods]

Design Engineering: Design process and design quality, design concepts the design model
Creating an
Architectural design: software architecture, data design, architectural styles and patterns,
architectural design, conceptual model of UML, basic structural modeling, class diagrams,
sequence diagrams, collaboration diagrams, use case diagrams, component diagrams.

Module IV: Test Strategies [09 Periods]

Methods of Testing: A strategic approach to software testing, Black box and White box
Testing, Validation Testing, System Testing.
Product Metrics: Software Quality, Metrics for analysis model, Metrics for design model,
Metrics for source code, Metrics for testing, Metrics for maintenance Metrics for process and
products: Software measurement, Metrics for software quality

13
Module V: Risk Management [09Periods]
Management of Risk Process: Reactive Vs proactive risk strategies, Software risks, Risk
identification, Risk projection Risk refinement, RMMM, RMMM plan 95
Quality Management: Quality concepts, Software quality assurance, Software reviews,
Formal technical reviews, Statistical Software Quality Assurance, Software Reliability, ISO
9000 Quality standards

TEXT BOOKS:
1. Roger S. Pressman, Software engineering- A practitioner‘s Approach, McGraw Hill
International Edition, 5th edition, 2001.
2. Ian Summerville, Software engineering, Pearson education Asia, 6th edition,2000.

REFERENCES:
1. Pankaj Jalote- An Integrated Approach to Software Engineering, Springer Verlag,1997.
2. James F Peters and WitoldPedryez, ―Software Engineering – An Engineering
Approach, John Wiley and Sons, New Delhi,2000.
3. AliBehforooz and Frederick J Hudson, ―Software Engineering Fundamentals, Oxford
University Press, New Delhi,1996.

E RESOURCES:
1. https://books.google.co.in/books?id=bL7QZHtWvaUC&printsec=frontcover&dq=softwa
re+engineering+by+roger+pressman+vth+edition+free+download&hl=en&sa=X&ved=0
ahUKEwiLkOz-pL_TAhWIuI8KHZSxD2cQ6AEIMDAC#v=one page&q&f=false
2. https://books.google.co.in/books?id=PqsWaBkFh1wC&printsec=frontcover&dq=softwar
e+engineering+by+ian+sommerville+FREE+download&hl=en&sa=X&ved=0ahUKEwjj
v5fhpb_TAhUHOo8KHY5OAC4Q6AEIKjAB#v=onepage&q=software%20engineering
%20by%20ian%20sommerville%20FREE%20download&f=false
3. http://ieeexplore.ieee.org/document/4807670/
1. https://link.springer.com/search?facet-journal id=40411&package=open
accessarticles&query=&facet-sub-discipline=%22Software+Engineering%22
2. http://freevideolectures.com/Course/2318/Software-Engineering
3. http://freevideolectures.com/Course/2318/Software-Engineering/5

Course Outcomes:
At the end of the course, students will be able to:
1. Analyze the customer business requirements and choose the appropriate Process model
for the given project
2. Elicit functional and non-functional requirements using rigorous engineering
methodology
3. Conceptualize and achieve requirements defined for the system using Architectural
styles and Design patterns
4. Design test cases and define metrics for standardization.
5. Assess, mitigate and monitor the risks and assuring quality standards

14
 CO- PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
CO’s Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 3
CO2 2 3 3 3 2
CO3 3 3 2 3
CO4 2 3 2
CO5 2 3 3 3 3

15
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous)
(MR-21) V Semester
Code: B0526 ADVANCED DATABASES AND SECURITY L T P
Credits: 3 [Professional Elective –II] 3 - -
Prerequisites: Database Management Systems
Course Objectives:
 To learn the security of databases
 To learn the design techniques of database security
 To learn the secure software design.
 To learn about Protection of new generation Database Systems
 To learn about Protection of active database systems

Module I: Introduction: [10 Periods]

Introduction to Databases Security Problems in Databases Security Controls Conclusions
Security Models -1: Introduction Access Matrix Model Take-Grant Model Acten Model PN
Model Hartson and Hsiao’s Model Fernandez’s Model Bussolati and Martella’s Model for
Distributed databases

Module II : Security Models [9 Periods]

Bell and LaPadula’s Model Biba’s Model Dion’s Model Sea View Model Jajodia and
Sandhu’s Model The Lattice Model for the Flow Control conclusion Security Mechanisms:
Introduction User Identification/Authentication Memory Protection Resource Protection
Control Flow Mechanisms Isolation Security Functionalities in Some Operating Systems
Trusted Computer System Evaluation Criteria

Module III: Security Software Design [10 Periods]

Introduction A Methodological Approach to Security Software Design Secure Operating
System Design Secure DBMS Design Security Packages Database Security Design Statistical
Database Protection & Intrusion Detection Systems: Introduction Statistics Concepts and
Definitions Types of Attacks Inference Controls Evaluation Criteria for Control Comparison.
Introduction IDES System RETISS System ASES System Discovery

Module IV: Models for the Protection of New Generation Database Systems-1
[10 Periods]
Introduction A Model for the Protection of Frame Based Systems A Model for the Protection
of Object-Oriented Systems SORION Model for the Protection of Object-Oriented Databases

Module V: Models for the Protection of New Generation Database Systems -2

[9 Periods]
A Model for the Protection of New Generation Database Systems: the Orion Model ajodia
and Kogan’s Model A Model for the Protection of Active Databases Conclusions

TEXT BOOKS
1. Database Security by Castano, Pearson Edition
2. Database Security and Auditing: Protecting Data Integrity and Accessibility, 1st Edition,
Hassan Afyouni, THOMSON Edition.

16
REFERENCES
1. Database security by Alfred basta, melissazgola, CENGAGE learning.

E-RESOURCES
1. https://books.google.co.in/books?id=qNCmBRufKBAC&dq=Parallel+Systems-
+Distributed+Systems+%E2%80%93+Parallel+Databases:+I/O+Parallelism+%E2%8
0%93+Inter+and+Intra+Query+Parallelism&hl=en&sa=X&ved=0ahUKEwj83K-
18bncAhUMLY8KHX2qCI8Q6AEIKDAA.
2. http://www.inf.ed.ac.uk/teaching/courses/adbs/slides/adbs.pdf
3. https://books.google.co.in/books?id=qNCmBRufKBAC&dq=Parallel+Systems-
+Distributed+Systems+%E2%80%93+Parallel+Databases:+I/O+Parallelism+%E2%8
0%93+Inter+and+Intra+Query+Parallelism&hl=en&sa=X&ved=0ahUKEwj83K-
18bncAhUMLY8KHX2qCI8Q6AEIKDAA.
4. http://nptel.ac.in/courses/106104135/

Course Outcomes:
At the end of the course, students will be able to:
 Ability to carry out a risk analysis for large database
 Ability to set up, and maintain the accounts with privileges and roles.
 Ensure that only authorized user has access to the data
 Able to Design and Implement secure database systems.
 Solve Complex Problems in a Team of database works

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 1 - - - - 2 2 1 - 1 2 2 2
CO2 3 3 2 2 1 - - 2 2 1 - 2 3 2 2
CO3 3 3 3 1 1 - - 2 2 1 - 2 3 1 1
CO4 3 3 2 2 1 - - 3 3 1 - 2 3 2 2
CO5 3 3 2 2 1 - - 2 2 1 - 2 3 2 2

17
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) IV Semester
(MR-21)
Code: B0527 Cloud Computing L T P
[Professional Elective - II]
Credits: 3 3 - -

Prerequisites
1. A course on “Operating Systems”

Objectives
1. This course provides an insight into cloud computing
2. Topics covered include- distributed system models, different cloud service models,
service oriented architectures, cloud programming and software environments, resource
management.

Module – I: [10 Periods]

Computing Paradigms: High-Performance Computing, Parallel Computing, Distributed
Computing, Cluster Computing, Grid Computing, Cloud Computing, Bio computing, Mobile
Computing, Quantum Computing, Optical Computing, Nano computing.

Module – II: [9 Periods]

Cloud Computing Fundamentals: Motivation for Cloud Computing, The Need for Cloud
Computing, Defining Cloud Computing, Definition of Cloud computing, Cloud Computing Is
a Service, Cloud Computing Is a Platform, Principles of Cloud computing, Five Essential
Characteristics, Four Cloud Deployment Models

Module – III: [10 Periods]

Cloud Computing Architecture and Management: Cloud architecture, Layer, Anatomy of
the Cloud, Network Connectivity in Cloud Computing, Applications, on the Cloud,
Managing the Cloud, Managing the Cloud Infrastructure Managing the Cloud application,
Migrating Application to Cloud, Phases of Cloud Migration Approaches for Cloud Migration.

Module – IV: [9 Periods]

Cloud Service Models: Infrastructure as a Service, Characteristics of IaaS. Suitability of
IaaS, Pros and Cons of IaaS, Summary of IaaS Providers, Platform as a Service,
Characteristics of PaaS, Suitability of PaaS, Pros and Cons of PaaS, Summary of PaaS
Providers, Software as a Service, Characteristics of SaaS, Suitability of SaaS, Pros and Cons
of SaaS, Summary of SaaS Providers, Other Cloud Service Models.

Module – V: [10 Periods]

Cloud Service Providers: EMC, EMC IT, Captiva Cloud Toolkit, Google, Cloud Platform,
Cloud Storage, Google Cloud Connect, Google Cloud Print, Google App Engine, Amazon
Web Services, Amazon Elastic Compute Cloud, Amazon Simple Storage Service, Amazon
Simple Queue, service, Microsoft, Windows Azure, Microsoft Assessment and Planning
Toolkit, SharePoint, IBM, Cloud Models, IBM Smart Cloud, SAP Labs, SAP HANA Cloud
Platform, Virtualization Services Provided by SAP, Sales force, Sales Cloud,

Service Cloud: Knowledge as a Service, Rack space, VMware, Manjra soft, Aneka Platform.

18
Textbook:
1. Essentials of cloud Computing : K.Chandrasekhran , CRC press, 2014

References:
1. Cloud Computing: Principles and Paradigms by Rajkumar Buyya, James Broberg and
Andrzej M. Goscinski, Wiley, 2011.
2. Distributed and Cloud Computing, Kai Hwang, Geoffery C.Fox, Jack J.Dongarra,
Elsevier, 2012.
3. Cloud Security and Privacy: An Enterprise Perspective on Risks and Compliance, Tim
Mather, Subra Kumaraswamy, Shahed Latif, O’Reilly, SPD, rp2011.

E-RESOURCES:
1. https://azure.microsoft.com/en-in/overview/what-is-cloud-computing/
2. https://en.wikipedia.org/wiki/Cloud_computing
3. https://opencirrus.org/cloud-computing-important/
4. https://www.inforisktoday.com/5-essential-characteristics-cloud-computing-a-4189
5. https://www.sam-solutions.com/blog/four-best-cloud-deployment-models-you-need-to-
know/
6. https://medium.com/@chrysaliss.transformation/cloud-computing-architecture-
components-cloud-based-delivery-865c33f51cd2
7. https://www.itu.int/en/ITU-D/Regional-
Presence/AsiaPacific/Documents/Events/2015/July-Could-
Computing/S3_M_I_Deen.pdf
8. https://www.fingent.com/blog/cloud-service-models-saas-iaas-paas-choose-the-right-
one-for-your-business/
9. https://www.bluepiit.com/blog/different-types-of-cloud-computing-service-models/
10. https://data-flair.training/blogs/cloud-service-providers-companies/
11. https://www.salesforce.com/products/service-cloud/features/

Course Outcomes:
At the end of the course, students will be able to
1. Ability to understand various service delivery models of a cloud computing architecture.
2. Ability to understand the ways in which the cloud can be programmed and deployed.
3. Understanding cloud service providers.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 - -
CO2 - 2 2 1 2
CO3 2 2 2 3
CO4 2 2 2 2 2 2
CO5 1 2

19
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous) V Semester
(MR-21)
Code: B0528 SEMANTIC WEB L T P
Credits: 3 [Professional Elective –II] 3 - -

Course Overview:

The Semantic Web is an extension of the traditional web in the sense that information in the
form of natural language text in the web will be complemented by its explicit semantics
based on a formal knowledge representation, Semantic Web technologies enable people to
create data stores on the Web, build vocabularies, write rules for handling data which have
the power to aid in the analysis of the social Web and the design of a new class of
applications that combine human intelligence with machine processing. Social Network
Analysis and the emerging Semantic Web are also the fields that stand to gain most from the
new Web in achieving their full potential. On the one hand, the social Web delivers social
network data at an extraordinary scale, with a dynamics and precision that has been outside of
reach for more traditional methods of observing social structure and behavior. In realizing
this potential, the technology of the Semantic Web provides the key in aggregating
information across heterogeneous sources. The Semantic Web itself benefits by incorporating
user-generated metadata and other clues left behind by users.

Prerequisite(s): Basics of Web Technologies

Course Objectives:
1. To introduce students to the basics of web technologies with semantic models,
ontologies and Inference systems.
2. To develop the basic understanding of knowledge representation for the semantic web.
3. To identify suitable applications for Semantic Web technologies and show some
awareness of Existing applications.
4. To develop skills of semantic search technologies, languages and schemas used to
describe Semantic Web information.
5. To develop professional and ethical attitude, multidisciplinary approach and an ability to
relate Semantic web issues to broader social context.

Module – I (10 Lectures)

Web Intelligence: Thinking and Intelligent Web Applications, The Information Age, The
World Wide Web, Limitations of today’s Web, The Next Generation Web, Artificial
Intelligence, Machine Intelligence, Ontology, Inference engines, Software Agents, Berners-
Lee WWW, Semantic Road Map, Logic on the semantic Web. (T1: Ch-1,3,4)

Module – II (10 Lectures)

Knowledge Representation for the Semantic Web: Ontologies and their role in the
semantic web, Ontologies Languages for the Semantic Web -Resource Description

20
Framework(RDF) / RDF Schema, Ontology Web Language (OWL), UML, XML/XML
Schema. (T2: Ch-4)

Module – III (14 Lectures)

Ontology Engineering: Ontology Engineering, Constructing Ontology, Ontology
Development Tools, Ontology Methods, Ontology Sharing and Merging, Ontology Libraries
and Ontology Mapping. (T1: Ch-7)
Logic, Rule And Inference: Logic and inference, Monotonic and Non monotonic rules,
Description logic, Inference engines, RDF Inference engine. (T1: Ch-8)

Module – IV (10 Lectures)

Semantic Web Applications, Services and Technology: Semantic Web applications and
services, Semantic Search, e-learning, Semantic Bioinformatics, Knowledge Base, XML
Based Web Services, Creating an OWL-S Ontology for Web Services, Semantic Search
Technology, Web Search Agents and Semantic Methods. (T1: Ch 10,11,12)

Module – V (9 Lectures)
Social Network Analysis and Semantic Web: What is social Networks analysis,
development of the social networks analysis, Electronic Sources for Network Analysis -
Electronic Discussion networks, Blogs and Online Communities, Web Based Networks.
Building Semantic Web Applications with social network features. (T2: Ch 2, 3, 6)

Course Outcomes:
At the end of the course, students will be able to
1. Develop web applications using semantic techniques.
2. Relate knowledge representation methods for semantic web.
3. Explain the key aspects of ontology engineering.
4. Design web services and its applications.
5. Analyze and build a social network.

TEXT BOOK(S):
1. Berners Lee, Godel, Turing, H. Peter Alesso Craig F. Smith (2009), Thinking on the
Web, Wiley interscience.
2. Peter Mika (2007), Social Networks and the Semantic Web, Springer, USA.

REFERENCE BOOK(S):
1. J. Davies, Rudi Studer, Paul Warren (2006), Semantic Web Technologies, Trends and
Research in Ontology Based Systems, John Wiley & Sons, England.
2. Liyang Yu (2007), Introduction to the Semantic Web and Semantic Web Services,
Chapman & Hall / CRC , USA.

E-RESOURCES:
1. http://as.wiley.com/WileyCDA/WileyTitle/productCd-0471768669.html
2. http://www.springer.com/in/book/9780387710006
3. https://research.vu.nl/ws/portalfiles/portal/2312133
4. http://nptel.ac.in/courses/106105077/18

21
 CO- PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COS PO 1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 2 3 2
CO2 2 3 1 2
CO3 2 3 3 2 1
CO4 2 2 2 3 2
CO5 2 3 1 2

22
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0529 ADVANCED COMPUTER ARCHITECTURE L T P
Credits: 3 [Professional Elective – II] 3 - -

Prerequisites: Computer Organization.

Course Objectives:
This course helps to explore on the advanced concepts and state-of-the-art developments in
computer architecture: memory systems, pipelining, simultaneous multithreading, run-time
optimization, array processing, parallel processing, multiprocessing, abstract analytic models,
power-aware computing, embedded computing, relationship between computer design and
application requirements, cost/performance tradeoffs, and many example computers of
interesting and unusual features.

MODULE I: [09 Periods]

Fundamentals of Computer design- Technology trends- cost price and their trends-
measuring and reporting performance - quantitative principles of computer design

MODULE II: [09 Periods]

Instruction set principles and examples- Classifying instruction set architecture - memory
addressing- type and size of operands- operations in the instruction set- instructions for
control flow- encoding an instruction set.

MODULE III: [10 Periods]

Instruction level parallelism (ILP)and its dynamic exploitation – Concepts and
challenges-overcoming data hazards- reducing branch costs with dynamic hardware
prediction – high performance instruction delivery- hardware based speculation ILP software
approach- compiler techniques- static branch protection - VLIW approach - H.W support for
more ILP at compile time.

MODULE IV: [10 Periods]

Memory hierarchy design- Cache performance- reducing cache misses penalty and miss
rate – virtual memory. Multiprocessors and thread level parallelism- symmetric shared
memory architectures- distributed shared memory- Synchronization- multi threading

MODULE V: [10 Periods]

Storage systems - Types – Buses - RAID- errors and failures - designing an I/O system in
five easypieces. Inter connection networks and clusters - interconnection network media –
practical issues in interconnecting networks – clusters- designing a cluster

TEXT BOOKS:
1. Computer Architecture A quantitative approach 3rd edition John L. Hennessy & David A.
Patterson Morgan Kaufmann (An Imprint of Elsevier)

REFERENCES:
1. Kai Hwang and A.Briggs “Computer Architecture and parallel Processing” International
Edition McGraw-Hill.
2. DezsoSima, Terence Fountain, Peter Kacsuk “Advanced Computer Architectures”,
Pearson.

23
 Course Outcomes:
At the end of the course, students will be able to:
1. Understand and apply concept and principle of cache memory and virtual memory to high
-performance computer architecture.
2. Understand pipelining and its speed advantage & design pipelined logic.
3. Proficient in fault-tolerant design techniques and examine various methods of error
detection and correction such as TMR and Hamming Codes.
4. Identify tradeoffs between complex instruction set computers (CISC) and reduced
instruction set computers (RISC).
5. Analyze and perform tradeoffs between the cost, performance, and reliability of
alternative computer architectures.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 3 2 3
CO2 3 3 2
CO3 3 2 2 3
CO4 2 2 3 2 2 2
CO5 2 2 3 2 2

24
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) V Semester
(MR-21)
Code: B0531 Scripting Languages L T P
[Professional Elective - II]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Object Oriented Programming

Course Objectives:
The course demonstrates an in depth understanding of the tools and the scripting languages
necessary for design and development of applications dealing real time data. Also this course
gives the capability and knowledge to analyze requirements of software systems for the
purpose of determining the suitability of implementing in Perl, PHP or Ruby.

MODULE I: INTRODUCTION [09 Periods]

What is a scripting language, Motivation for and applications of scripting, how scripting
languages differ from non-scripting languages, Types of scripting languages, client and
server side web scripting
Introduction to PERL and Scripting: PERL- Names and Values, Variables, Scalar
Expressions, Control Structures, arrays, list, hashes, strings, pattern and regular expressions,
subroutines.

MODULE II: Advanced PERL [09 Periods]

Finer points of looping, pack and unpack, file system, eval, data structures, packages,
MODULEs, objects, interfacing to the operating system, Creating Internet ware applications,
Dirty Hands Internet Programming, security Issues.

MODULE III: PHP Basics [10 Periods]

PHP BASICS - Features, Embedding PHP Code in your Web pages, Outputting the data to
the browser, Data types, Variables, Constants, expressions, string interpolation, control
structures, Function, Creating a Function, Function Libraries, Arrays, strings and Regular
Expressions.

MODULE IV: Advanced PHP Programming - [10 Periods]

PHP and Web Forms, Files, PHP Authentication and Methodologies -Hard Coded, File
Based, Database Based, IP Based, Login Administration, Uploading Files with PHP, Sending
Email using PHP, PHP Encryption Functions, the Mcrypt package, Building Web sites for the
World.

MODULE V: Ruby [10 Periods]

What is Ruby, Ruby features, Installation of Ruby, Hello Ruby Program, Operators, data
types, control statements, looping statements, break next, redo retry.
Ruby Object class, Methods, Blocks, Modules, Strings, Arrays, Exception Handing.

TEXTBOOKS
1. David Barron, ‘The World of Scripting Languages’, Wiley Publications.
2. Jason Gilmore, ‘Beginning PHP and MySQL’, 3” Edition, A press Publications (Dream
tech.).
25
26
REFERENCES
1. J.Lee and B.Ware, ‘Open Source Web Development with LAMP using Linux,
Apache, MySQL, Pen and PHP’, (Addison Wesley) Pearson Education.
2. Julie Meloni and Matt Telles, ‘PHP 6 Fast and Easy Web Development’, Cengage
Learning Publications.
3. Larry Wall, T.Christiansen and J.Orwant,O’Reilly, ‘Programming Perl’, SPD
4. V.Vaswani, ‘PHP Programming solutions’, TMH

E-RESOURCES
1. https://www.w3schools.com/php/
2. https://www.tutorialspoint.com/perl/
3. International journal of Programming Languages and Applications
4. International Journal of Advanced and Innovative Research
5. http://nptel.ac.in/courses/117106113/
6. http://nptel.ac.in/courses/106106145/

Course Outcomes:
At the end of the course, students will be able to
1. Understand the significance of various scripting languages.
2. Apply your knowledge to work on PERL Internet applications.
3. Implement the basic web applications using PHP.
4. Design and implement web applications and database connectivity using PHP.
5. Demonstrate the programs on Ruby scripting language.
.

CO- PO-PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-
Medium, 1-Weak
Programme Outcomes(POs) PSOs
CO S PO1 PO 2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO 1 2 2 2 3 3 - - - - 2 - 2 2 2 3
CO 2 2 2 2 3 3 - - - - 1 - 2 2 2 2
CO 3 2 2 2 3 3 - - - - 1 - 2 1 2 2
CO 4 2 2 2 3 3 - - - - 1 - 2 2 2 2
CO 5 2 2 1 3 3 - - - - 1 - 2 3 3 2

27
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(MR-21) (Autonomous) V Semester
Code: B6202 L T P
Credits: 1.5 COMPUTER NETWORKS LAB - - 3
Prerequisites: NIL

Course Objectives:
This course provides students to understand the fundamental concepts of computer
networking and communications make use of IEEE standards in the construction of LAN,
build the skills of subnetting and supernetting, explain the concepts of protocols of Tranport
Layer, QoS and Congestion control mechanisms and demonstrate different protocols of
Application Layer.

Software Requirements: Turbo

C/JDK LIST OF PROGRAMS:

1. Implement the data link layer farming methods:
• Character Count
• Character stuffing and destuffing.
• Bit stuffing and destuffing
2. Implement on a data set of characters the three CRC polynomials: CRC-12,
CRC-16 and CRC-32.
3. Implement Parity Check using the following techniques
• Single Dimensional Data
• Multi Dimensional Data
4. Implement the Even and Odd parity.
5. Impelementation of Data Link Protocols
• Unrestricted Simplex Protocol
• Stop and wait Protocol
• Noisy Channel
6. Impelementation of Sliding Window Protocols
• One bit sliding window protocol
• Go Back N sliding window protocol
• Selective Repeat sliding window protocol
7. Write a code simulating ARP /RARP protocols
8. Impelementation of Routing Protocols
• Dijkstra's algorithm
• Distance Vector routing protocol
• Link State routing protocol
9. Implement the congestion algorithms
a. Token bucket algorithm

28
 b. Leaky bucket algorithm
10. Implement RSA algorithm.

TEXT BOOKS:
1. Behrouz A. Forouzan, “Data Communications and Networking”, 4 t Edition, TMH,
2006.
2. Andrew S Tanenbaum, “Computer Networks”, 4th Edition, PearsonEducation/PHI.

REFERENCES:
1. P.C .Gupta, “Data communications and computer Networks”, PHI.
2. S.Keshav, “An Engineering Approach to Computer Networks”, 2nd Edition,
Pearson Education.
3. W.A. Shay, “Understanding communications and Networks”, 3rd Edition, Cengage
Learning.

COURSE OUTCOMES:
At the end of the course, students will be able to
1. Implement the various protocols.
2. Analyze various Congestion control mechanisms.
3. Implement encryption mechanisms using Symmetric Key and Asymmetric
Keyalgorithms.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs Programme Outcomes(POs) PSOs
PO PO PO PO PO PO PO PO PO PO1 PO1 PO1 PSO PSO PSO
CO1 3 2
CO2 3 2

29
 2021-22 MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards (Autonomous)
(MR-21) V Semester
Code: B0530 L T P
Credits: 1.5
Software Engineering & Modelling Lab - - 3

Course Objectives:
1. To understand the software engineering methodologies involved in the phases for project
development.
2. To gain knowledge about open source tools used for implementing software engineering
methods.
3. To exercise developing product startups implementing software engineering methods

Open source Tools: StarUML /UMLGraph / Topcased.

Prepare the following documents and develop the software project startup, prototype
model, using software engineering methodology for at least two real time scenarios
or for the sample experiments.
• Problem Analysis and Project Planning -Thorough study of the problem –Identify Project
scope, Objectives and Infrastructure.
• Software Requirement Analysis – Describe the individual Phases/modules of the project
and Identify deliverables. Identify functional and non-functional requirements.
a. Data Modeling – Use work products – data dictionary.
b. Software Designing – Develop use case diagrams and activity diagrams, build and test
class diagrams, sequence diagrams and add interface to class diagrams.
c. Prototype model – Develop the prototype of the product.

The SRS and prototype model should be submitted for end semester examination.

List of Sample Experiments:

Course management system (CMS)
A course management system (CMS) is a collection of software tools providing an online
environment for course interactions. A CMS typically includes a variety of online tools
and environments, such as:
a. An area for faculty posting of class materials such as course syllabus and handouts
b. An area for student posting of papers and other assignments
c. A grade book where faculty can record grades and each student can view his or her
grades
d. An integrated email tool allowing participants to send announcement email messages
to the entire class or to a subset of the entire class
e. A chat tool allowing synchronous communication among class participants
f. A threaded discussion board allowing asynchronous communication among
participants

30
In addition, a CMS is typically integrated with other databases in the university so that
students enrolled in a particular course are automatically registered in the CMS as
participants in that course.

The Course Management System (CMS) is a web application for department personnel,
Academic Senate, and Registrar staff to view, enters, and manage course information
formerly submitted via paper. Departments can use CMS to create new course proposals,
submit changes for existing courses, and track the progress of proposals as they move
through the stages of online approval.

Easy Leave
This project is aimed at developing a web based Leave Management Tool, which is of
importance to either an organization or a college.

The Easy Leave is an Intranet based application that can be accessed throughout the
organization or a specified group/Dept. This system can be used to automate the workflow of
leave applications and their approvals. The periodic crediting of leave is also automated.
There are features like notifications, cancellation of leave, automatic approval of leave, report
generators etc in this Tool.

Functional components of the project:

There are registered people in the system. Some are approvers. An approver can also be a
requestor. In an organization, the hierarchy could be Engineers/Managers/Business
Managers/Managing Director etc. In a college, it could be Lecturer/Professor/Head of the
Department/Dean/Principal etc.

Following is a list of functionalities of the system: A person should be able to

a. login to the system through the first page of the application
b. change the password after logging into the system
c. see his/her eligibility details (like how many days of leave he/she is eligible for etc)
d. query the leave balance
e. see his/her leave history since the time he/she joined the company/college
f. apply for leave, specifying the from and to dates, reason for taking leave, address for
communication while on leave and his/her superior’s email id
g. see his/her current leave applications and the leave applications that are submitted to
him/her for approval or cancellation
h. approve/reject the leave applications that are submitted to him/her
i. withdraw his/her leave application (which has not been approved yet)
j. Cancel his/her leave (which has been already approved). This will need to be approved
by his/her Superior
k. get help about the leave system on how to use the different features of the system
l. As soon as a leave application /cancellation request /withdrawal /approval /rejection
/password-change is made by the person, an automatic email should be sent to the person
and his superior giving details about the action

31
m. The number of days of leave (as per the assumed leave policy) should be automatically
credited to everybody and a notification regarding the same be sent to them
automatically
n. An automatic leave-approval facility for leave applications which are older than 2 weeks
should be there. Notification about the automatic leave approval should be sent to the
person as well as his superior

E-Bidding
Auctions are among the latest economic institutions in place. They have been used since
antiquity to sell a wide variety of goods, and their basic form has remained unchanged. In this
dissertation, we explore the efficiency of common auctions when values are interdependent
the value to a particular bidder may depend on information available only to others-and
asymmetric. In this setting, it is well known that sealed-bid auctions do not achieve efficient
allocations in general since they do not allow the information held by different bidders to be
shared.

Typically, in an auction, say of the kind used to sell art, the auctioneer sets a relatively low
initial price. This price is then increased until only one bidder is willing to buy the object, and
the exact manner in which this is done varies. In my model a bidder who drops out at some
price can “reenter” at a higher price. With the invention of Ecommerce technologies over the
Internet the opportunity to bid from the comfort of one’s own home has seen a change like
never seen before. Within the span of a few short years, what may have began as an
experimental idea has grown to an immensely popular hobby, and in some cases, a means of
livelihood, the Auction Patrol gathers tremendous response every day, all day. With the point
and click of the mouse, one may bid on an item they may need or just want, and in moments
they find that either they are the top bidder or someone else wants it more, and you’re outbid!
The excitement of an auction all from the comfort of home is a completely different
experience.

Society cannot seem to escape the criminal element in the physical world, and so it is the
same with Auction Patrols. This is one area where in a question can be raised as to How safe
Auction Patrols.

Proposed system
• To generate the quick reports
• To make accuracy and efficient calculations
• To provide proper information briefly
• To provide data security
• To provide huge maintenance of records Flexibility of transactions can be completed in
time
Electronic Cash counter
This project is mainly developed for the Account Division of a Banking sector to provide
better interface of the entire banking transactions. This system is aimed to give a better out
look to the user interfaces and to implement all the banking transactions like:
• Supply of Account Information
• New Account Creations
• Deposits
• Withdraws
32
• Cheque book issues
• Stop payments
• Transfer of accounts
• Report Generations.

Proposed System:
The development of the new system contains the following activities, which try to automate
the entire process keeping in view of the database integration approach. User friendliness is
provided in the application with various controls. The system makes the overall project
management much easier and flexible. Readily upload the latest updates, allows user to
download the alerts by clicking the URL. There is no risk of data mismanagement at any
level while the project development is under process. It provides high level of security with
different level of authentication

Course Objectives: The student should take up the case studies of ATM system, Online
Reservation System and Model it in different views i.e. Use case view, logical view,
component view, Deployment view.

Week 1
Design a Use case Diagram for ATM system, Online Reservation System
Week 2
Design a Sequence Diagram for ATM system, Online Reservation System. Design a
Collaboration Diagram for ATM system, Online Reservation System.
Week 3
Design a Activity Diagram for ATM system, Online Reservation System.
Design a State Chart Diagram for ATM system, Online Reservation System.
Week 4
Design a Class Diagram for ATM system, Online Reservation System.
Week 5
Design a Component Diagram for ATM system, Online Reservation System.
Week 6
Design a Deployment Diagram for ATM system, Online Reservation System.

Course Outcomes:
Upon completion of this course, students should be able to:
1. Analyze the requirements through Use-Case View
2. Identify all structural and behavioral concepts of the entire system
3. Develop a model using UML concepts by different types of diagrams like Use case
Diagram, Class Diagram, Sequence Diagram etc

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
CO’s Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 2 3 2
CO2 3 2 2 2 2 3 2
CO3 2 3 3 2 2 2 2 2 2

33
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) V Semester
(MR-21)
Code: B00M3 L T P
Quantitative Aptitude and Verbal Reasoning - I
Credits: - 2 - -

Course objectives:

The Quantitative Aptitude course is designed to equip students with essential mathematical
and analytical skills required for various competitive exams, academic pursuits, and real-
world problem-solving scenarios. The primary objective of this course is to enhance
participants' numerical ability and logical reasoning, enabling them to tackle quantitative
questions with confidence and efficiency.

MODULE - I [8 Periods]
Quants: Percentages, Profit and Loss.
Percentages- Percentage Increase/Decrease; Results on Population; Results on Depreciation.
Profit & Loss- Cost Price; Selling Price: Profit or Gain; Gain Percentage; Loss Percentage.

Verbal: Sentence Completion

Sentence Completion- Formats of Question; Strategies to solve sentence completion
questions- Proactive and reactive solving, Identifying clues- Signposts, Types of signposts,
Root words, Sentence structure clues.

Logical: Blood Relation

Blood Relations- Classification of blood relations, Pointing a person, Equation related
problems.

MODULE - II [6 Periods]
Quants: Interests
Interests- Types of interest; Simple interest; principle; Rate of interest; compound interest;
interest is compounded Annually; interest is compounded Half-yearly; interest is
compounded Quarterly; Rates are different for different years, say R1%, R2%, R3% for 1st,
2nd and 3rd year respectively; Present worth of Rs. x due n years.

Verbal: Articles, Interrogatives

Articles- Types of articles, Countable nouns, Uncountable nouns, Usage of articles, Omission
of articles. Interrogatives- Definition, Types of Interrogatives, Question Tags.

Logical: Clocks
Clocks: Introduction, Derivation of angles, Angles between hands of the clock, Hands
together, Hands at angular distance, Gain & Loss problems.

MODULE - III [6 Periods]

Quants: Ratio and Proportion, Averages
Ratios & Proportion- The ratio of two quantities a and b in the same units; Proportion; The
equality of two ratios is called proportion; Fourth Proportional; Mean Proportional;
Comparison of Ratios; Duplicate Ratios; Variations. Averages- Average Speed, Weighted
average.

34
Verbal: Idioms and Miscellaneous Vocabulary
Idioms- Idioms and phrasal verbs, Word Analogy, Patterns of questions on Word Analogy;
Miscellaneous Vocabulary.

Logical: Coding and Decoding

Coding and Decoding- Number Series, Alphabet Series, Analogy, Odd Man Out, Visual
Reasoning.

MODULE - IV [6 Periods]
Quants: Time and Work;
Time & Work- Work from Days: Calculate the one-day work; Days from Work: Shortcut to
calculate the work in given time.

Verbal: Voices and Speech

Voices- Introduction- Sentence, Parts of a sentence, Voice of a sentence, Types of voices,
Identifying the voice of a sentence, Changing the voice of a sentence.
Speech- Direct & Indirect, Identifying the speech, Change of Speech.

Logical: Directions
Directions - Introduction, Direction based questions, Shadow based problems.

MODULE - V [6 Periods]
Quants: Mixtures and Alligations
Alligation- Mean Price; Rule of Alligation; a container contains x of liquid from which y
units are taken out and replaced by water;

Verbal: Reading Comprehension

Reading Comprehension- Speed reading strategies; Reading Comprehension - types of
questions, tackling strategies.

Logical: Cubes
Cubes- Cube & cuboid concepts, 3-2-1-0 faced problems.

Text Books:
1. "Quantitative Aptitude for Competitive Examinations" by R.S. Aggarwal
2. "How to Prepare for Quantitative Aptitude for the CAT" by Arun Sharma
3. "Fast Track Objective Arithmetic" by Rajesh Verma

Reference Books:
1. "Magical Book on Quicker Maths" by M. Tyra
2. "Quantitative Aptitude Quantum CAT" by Sarvesh K. Verma

e-Resources: Concerned Website links:

1. Khan Academy (https://www.khanacademy.org/):
2. MathIsFun (https://www.mathsisfun.com/)
3. GMAT Club (https://gmatclub.com/)
4. IndiaBIX (https://www.indiabix.com/)
5. Studytonight (https://www.studytonight.com/)

35
Course Outcomes:
After completion of the course students will be able to:
1. Develop Strong Mathematical Foundations: Gain a comprehensive understanding of
fundamental mathematical concepts, including arithmetic, algebra, geometry, and data
interpretation, providing a solid basis for tackling quantitative problems.
2. Enhance Problem-Solving Skills: Learn diverse problem-solving techniques and
strategies to approach quantitative questions in a systematic manner, enabling
efficient and accurate solutions.
3. Improve Speed and Accuracy on Averages: Practice through a variety of exercises
and timed quizzes to enhance computational speed and precision, vital for competitive
exams and time-sensitive tasks.
4. Master Time and work: Acquire skills in interpreting data from time and work
scenarios decisions based on the given information.
5. Build Allegation and mixtures: Strengthen logical reasoning abilities to analyze and
deduce patterns, aiding in solving complex quantitative problems.
CO- PO-PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-
Medium, 1-Weak
Programme Outcomes(POs) PSOs
CO S PO1 PO 2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO 1 1 2 2 2
CO 2 1 2 2 2
CO 3 1 2 2 2
CO 4 1 2 2 2
CO 5 1 2 1 2

36
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0H08 L T P
Engineering Economics and Accountancy
Credits: 3 3 - -

Prerequisites: NIL
Course Objectives: EEA is a think beyond program which will make the student to examine
the application of microeconomics theory as applied to the manager’s responsibilities in an
organization. To explain the basic principles of managerial economics, accounting and
current business environment underlying business decision making. This course should
emphasize the quantitative and qualitative applications of economic principle to business
analysis

MODULE-1 Business Environment and Managerial Economics [10 Periods]

Business Environment: Characteristic features of Business, Features and evaluation of Sole
Proprietorship, Partnership, Joint Stock Company, Public Enterprises and their types, Latest
trends in Business Environment (Entrepreneurship).
Managerial Economics: Definition, Nature and Scope of Managerial Economics–Demand
Analysis: Demand Determinants, Law of Demand and its exceptions. Elasticity of Demand,
Types, Significance of Elasticity of Demand, Demand Forecasting, Factors governing
demand forecasting, methods of demand forecasting.

MODULE – II Theory of Production and Cost Analysis [10 Periods]

Theory of Production: Production Function – ISOquants and ISOcosts, MRTS, Least Cost
Combination of Inputs, Cobb-Douglas Production function, Laws of Returns, Internal and
External Economies of Scale.
Cost Analysis: Cost concepts, Opportunity cost, fixed vs. Variable costs, explicit costs Vs.
Implicit costs, Out of pocket costs vs. Imputed costs. Break-even Analysis (BEA)-
Determination of Break-Even Point (simple problems) - Managerial Significance and
limitations of BEA.

MODULE – III Market structures and Pricing Policies [09 Periods]

A. Introduction to Markets & Market structures: Types of competition, Features of
Perfect competition, Monopoly and Monopolistic Competition. Price-Output
Determination in case of Perfect Competition and Monopoly.
B. Pricing Policies & Methods: Cost plus Pricing, Marginal Cost Pricing, Sealed Bid
Pricing, Going Rate Pricing, PLC based pricing methods.

MODULE – IV Capital and Capital Budgeting [09 Periods]

Capital: Capital and its significance, Types of Capital, Estimation of Fixed and Working
capital requirements, Methods and sources of raising finance.
Capital Budgeting: Nature and scope of capital budgeting, features of capital budgeting
proposals, Methods of Capital Budgeting: Payback Method, Accounting Rate of Return
(ARR) and Net Present Value Method (simple problems)

MODULE – V Financial Accounting and Ratios [10 Periods]

Financial Accounting: Introduction, Accounting principles, Accounting Cycle, Journal,
Ledger, Trial Balance- Final Accounts (Trading Account, Profit and Loss Account and
Balance Sheet with simple adjustments).

37
38
Financial Analysis Through Ratios: Computation, Analysis and Interpretation of Liquidity
Ratios (Current Ratio and quick ratio), Activity Ratios (Inventory turnover ratio and Debtor
Turnover ratio), Capital structure Ratios (Debt- Equity ratio, Interest Coverage ratio), and
Profitability ratios (Gross Profit Ratio, Net Profit ratio, Operating Ratio, P/E Ratio and EPS).
TEXTBOOKS:
1. Aryasri, “Managerial Economics and Financial Analysis”, TMH, 2nd edition, 2005.
2. Varshney &Maheswari, “Managerial Economics”, 5th edition Sultan Chand, 2003
REFERENCES:
1. H. Craig Peterson & W. Cris Lewis, “Managerial Economics”, PHI, 4th Edition.
2. Domnick Salvatore, “Managerial Economics In a Global Economy”, Thomson, 4th
Edition.
3. Raghunatha Reddy &Narasimhachary, “Managerial Economics& Financial Analysis”,
4th Edition Scitech.
4. S.N.Maheswari& S.K. Maheswari, “Financial Accounting”, 6th Edition Vikas.
5. Dwivedi, “Managerial Economics”, Vikas, 6th Edition.
E-RESOURCES:
1. http://www.learnerstv.com/Free-Economics-video-lecture-courses.htm
2. http://nptel.ac.in/courses/110105067/
3. http://nptel.ac.in/courses/110107073/
4. http://nptel.ac.in/courses/110101005/
5. http://nptel.ac.in/courses/109104073/
Course Outcomes:
At the end of the course, students will be able to
1. Understand the concepts of managerial economics and their application in evaluating the
demand.
2. Evaluate the production function and identifies the least cost combination to control the
costs of production.
3. Understand the structures of various market types and their pricing policies.
4. Understand the types of business forms and also be able to evaluate the investments using
capital budgeting techniques.
5. Understand the basic concepts of financial accounting and evaluation of company
performance using ratio analysis.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 1 3 2
CO2 3 2 1 2
CO3 1 2 3 2
CO4 2 1 3 2
CO5 1 2 3 2

39
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0532 L T P
COMPILER DESIGN
Credits: 4 4 - -

Prerequisites: Formal Languages and Automata Theory.

Course Objectives:
 To study the various phases in the design of a compiler
 To understand the design of top-down and bottom-up parsers
 To understand syntax directed translation schemes
 To introduce LEX and YACC tools
 To learn to develop algorithms to generate code for a target machine

MODULE I: [09 Periods]

Language Processors, the structure of a compiler, the science of building a compiler,
programming language basics.
Lexical Analysis: The Role of the Lexical Analyzer, Input Buffering, Recognition of
Tokens, The Lexical-Analyzer Generator Lex, Finite Automata, From Regular Expressions to
Automata, Design of a Lexical-Analyzer Generator, Optimization of DFA-Based Pattern
Matchers.

MODULE II: Syntax Analysis: [10 Periods]

Syntax Analysis: Introduction, Context-Free Grammars, Writing a Grammar, Top-Down
Parsing, Recursive and Non recursive top down parsers, Bottom-Up Parsing,
Introduction to LR Parsing: Simple LR, More Powerful LR Parsers, Using Ambiguous
Grammars, Parser Generators.

MODULE III: [10 Periods]

Syntax-Directed Definitions, Evaluation Orders for SDD’s, Applications of Syntax-Directed
Translation, Syntax-Directed Translation Schemes, and Implementing L-Attributed SDD’s.
Intermediate-Code Generation: Variants of Syntax Trees, Three-Address Code, Types and
Declarations, Type Checking, Control Flow, Back patching, Switch-Statements, Intermediate
Code for Procedures.

MODULE IV: [10 Periods]

Run-Time Environments: Storage organization, Stack Allocation of Space, Access to
Nonlocal Data on the Stack, Heap Management, Introduction to Garbage Collection,
Introduction to Trace-Based Collection.
Machine-Independent Optimizations: The Principal Sources of Optimization, Introduction
to Data-Flow Analysis, Foundations of Data-Flow Analysis, Constant Propagation, Partial-
Redundancy Elimination, Loops in Flow Graphs.

MODULE V: [09 Periods]

Code Generation: Issues in the Design of a Code Generator, The Target Language,
Addresses in the Target Code, Basic Blocks and Flow Graphs, Optimization of Basic Blocks,
A Simple CodeGenerator.

40
41
Machine-dependent Optimizations: Peephole Optimization, Register Allocation and
Assignment, Dynamic Programming Code-Generation.

TEXT BOOKS:
1) Compilers: Principles, Techniques and Tools, Second Edition, Alfred V. Aho, Monica S.
Lam, Ravi Sethi, Jeffry D. Ullman, Pearson.
2) Compiler Construction-Principles and Practice, Kenneth C Louden, Cengage Learning.

REFERENCES:
1) Modern compiler implementation in C, Andrew W Appel, Revised edition, Cambridge
University Press.
2) The Theory and Practice of Compiler writing, J. P. Tremblay and P. G. Sorenson, TMH
3) Writing compilers and interpreters, R. Mak, 3rd edition, Wiley student edition.

E-RESOURCES:
1) https://nptel.ac.in/courses/106/104/106104123/

Course Outcomes:
At the end of the course, the students will be able to:
 Design, develop, and implement a compiler for any language
 Use LEX and YACC tools for developing a scanner and a parser
 Design and implement LL and LR parsers
 Design algorithms to perform code optimization in order to improve the performance of a
program in terms of space and time complexity
 Apply algorithms to generate machine code

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 2 2
CO2 3 2 2 2
CO3 2 3 2 2
CO4 3 2 2 2 2
CO5 3 2 2 2

42
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0533 Distributed Systems L T P
[Professional Elective - III]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Computer Networks, DBMS and Operating Systems

Course Objectives:
1. Student will be able to learn fundamental aspects of Distributed systems
2. Analyzebasics of Architectural and Fundamental Models.
3. To identify various types of requirements and the process for Distributed objects.
4. To make use of various OS layers to conceptualize and construct a system
5. To demonstrate different file systems tactics and define Events and time ordering in
distributed transactions.

MODULE I: Basic Concepts [09 Periods]

Characterization of Distributed Systems - Examples - Resource Sharing and the Web -
Challenges- System Models-Architectural and Fundamental Models-Networking and
Internetworking-Types of Networks – Internet Protocols

MODULE II: Processes and Distributed Objects [09 Periods]

Inter-process Communication - The API for the Internet Protocols - External Data
Representation and Marshalling - Client -Server Communication - Group
Communication - Distributed Objects and Remote Invocation - Communication Between
Distributed Objects - Remote Procedure Call - Events and Notifications -

MODULE III: Operating System Issues I [10 Periods]

The OS Layer- Protection - Processes and Threads - Communication and Invocation- OS
Architecture - Security - Overview - Cryptographic Algorithms - Digital Signatures -
Distributed File Systems- File Service Architecture- Sun Network File System-The
Andrew File System.

MODULE IV: Operating System Issues II [10 Periods]

Name Services-Domain Name System - Directory and Discovery Services -Global Name
Service - Clocks - Events and Process States - Synchronizing Physical Clocks - Logical
Time And Logical Clocks - Global States - Distributed Debugging - Distributed Mutual
Exclusion – Elections.

MODULE V: Distributed Transaction Processing [10 Periods]

Transactions - Nested Transactions - Locks - Optimistic Concurrency Control -
Timestamp Ordering - Flat and Nested Distributed Transactions - Atomic Commit
Protocols - Concurrency Control in Distributed Transactions - Distributed Deadlocks -
Transaction Recovery.

43
 COURSE OUTCOMES:
At the end of the course, students will be able to:
1. Design architectural models of distributed systems.
2. Summarize communication between Distributed Objects.
3. Apply security algorithms on distributed systems.
4. Categorize various name services.
5. Examine transaction recovery and concurrency control in distributed transactions

TEXTBOOKS:
1. George Coulouris, Jean Dollimore and Tim Kindberg , "Distributed Systems
Concepts and Design", 3rd Edition, Pearson Education, 2002.
2. Andrew S. Tanenbaum, Maartenvan Steen, Distibuted Systems, "Principles and
Pardigms", Pearson Education, 2002.

REFERENCES:
1. Sape Mullender, " Distributed Systems", 2nd Edition, Addison Wesley, 1993.
2. Albert Fleishman, Distributes Systems, "Software Design and Implementation",
springer, Verlag, 1994 .
3. M. L. Liu, "Distributed Computing Principles and Applications", Pearson Education,
2004.

E- REFERENCES:
1. http://www.gecg .in/papers/ds5thedn.pdf
2. https://cs. uwaterloo.ca /~bemard/courses /cs454 /0.Begin.pdf
3. https://www.cs.helsinki.fi /u/jakangas/Teaching/DistSys/DistSys-08f- l.pdf
4. https: //courses.cs.ut.ee /MTAT.08.009/2014 fall/uplo ads /Main/slides 10-2.pdf

Contribution to Program Outcomes

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

44
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0534 Animation Techniques L T P
[Professional Elective - III]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

PREREQUISITES: NIL

Course Objectives:
This course will enable the students to learn the fundamental concepts of animation,
1. creating flash animation concepts,
2. learn the 3d animation technique with concepts and apply the motion capture
software in animation techniques.
3. Outline 3D Animation and its Concepts and Tracking Applications and Software of
3D Animation.
4. It also introduces students with the advanced scripting skills necessary for
implementing Script Animation among the Software
5. The course allows students to Story Developing Audio and Video Color Model
Device Independent Color Model’s

MODULE I: Introduction [09 Periods]

What is mean by Animation, Why we need Animation, History of Animation, Uses of
Animation, Types of Animation, Principles of Animation, Some Techniques of
Animation, Animation on the WEB, 3D Animation, Special Effects -Creating
Animation?

MODULE II: Creating Animation in Flash [10 Periods]

Introduction to Flash Animation, Introduction to Flash, Working with the Timeline and
Fram e based Animation, Working with the Time line and Twin-based animation,
Understanding Layers, Actionscript.

MODULE III: 3D Animation Effects [09 Periods]

A: 3D Animation and its Concepts Types of 3D Animation Skeleton and Kinetic3D
Animation-
B: Texturing and Lighting of 3D Animation 3D Camera Tracking Applications and
Software of 3D Animation.

MODULE IV: Motion Capture [10 Periods]

Motion Caption, Formats, Methods, Usages, Expression Motion Capture, Script
Animation Usage, Different Language of Script Animation among the Software.

MODULE V: Animated movies [10 Periods]

Concept Development, Story Developing, Audio and Video Color, Model Device
45
46
Independent Color Model, Gamma and Gamma Correction - Production Budgets- 3D
Animated Movies.

TEXTBOOKS:
1. 1. Juke Parent, Animation: Algorithms and Techniques 3rd Edition, (Hard cover,
RickParent).
2. Williams Richars, The Animator's Survival Kit--Revised Edition: A Manual of Methods,
Principles and Formulas for Classical, Computer, Games, Stop Motion and Faber and
Faber, 2012.

REFERENCES:
1. Ranjan Parekh, Principles of Multimedia TMH,2007.
2. Ashok Banerji, Ananda Mohan Ghosh, Multimedia Technologies McGraw Hill.

E- RESOURCES:
1. http://www.bkstr.com/floridastore/home Autodesk Maya 2016
2. https://itunes.apple.com/us/app/the-animators-survival-kit/id627438690?mt=8
3. http://ieeexplore.ieee.org/document/7239940/
4. nptel.ac.in/courses/106102063/25

Course Outcomes:
At the end of the course, students will be able to
 Develop Fundamental concepts of animation
 Analyze the flash animation and scripting concepts
 Outline the scripting concepts in 3D animation methods.
 Understand the different language of scripting animation techniques
 Apply the story developing and color model in 3D animated movies

CO-PO,PSO Mapping
COs (3/2/1indicatesstrengthofcorrelation)3-Strong,2-Medium,1-Weak
POs PSOs
Po1 Po2 Po3 Po4 Po5 Po6 Po7 Po8 Po9 Po10 Po11 Po12 Pso1 Pso2 Pso3
CO 1 3 1 1 - - - - - - - - 1 3 2 -
CO 2 3 3 1 1 1 - - - - - - 1 3 2 1
CO 3 2 1 1 1 1 - - - - - - 1 3 2 -
CO 4 2 1 - - - - - - - - - 1 3 1 1
CO 5 3 2 1 1 1 - - - - - - 1 3 2 1

47
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0535 Multimedia and Rich Internet Applications L T P
[Professional Elective - III]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Prerequisites: NIL
Course Objectives:

1. This course aims to further develop students’ competency in producing dynamic and
creative graphic solutions for multimedia productions.
2. It provides students with the basic concepts and techniques of interactive authoring.
3. It also introduces students with the advanced scripting skills necessary for
implementing highly interactive, rich internet applications using multimedia
technologies and authoring tools.
4. Students will develop aesthetic value and competencies in multimedia authoring.
5. Artistic visual style and layout design are stressed, as well as the editing and
integration of graphic images, animation, video, and audio files.
6. The course allows students to master industry-wide software and technologies to
create highly interactive, rich internet applications.
.

MODULE I: [09 Periods]

MRIA Fundamental concepts in Text and Image Multimedia and hypermedia, World Wide
Web, overview of Multimedia software tools. Graphics and Image data represent from
graphics Image data types, file formats. color in image and Video colors science, color
Models in images color Models in video

MODULE II: [10 Periods]

Fundamental concepts in video and digital audio: Types of Video signals analog video,
digital video, and digitization of sound MIDT, quantization and transmission of audio
Multimedia Data compression Lossless compression algorithms, lossy Compression
algorithms. Image compression standards

MODULE III: [12 Periods]

Basic video compression techniques. Case study: MPEG video coding I, Basic Audio
compression techniques case study MPEG Audio compression, web 2.0 what is web 2.0,
search, content Networks, user Generated content, Blogging.. Social Networking, social
Media. Tagging, Social Marking, Rich Internet Applications, web services. Marshups,
Location Based Services, XMC, RSS, Atom, json, and VOIP web 2.0 Monetization and
Business Models, Future of the web
MODULE IV: [14 Periods]
Rich Internet Applications (RIAS) with Adobe Flash: Adobe Flash - Introduction, Flash
Movie Development, Learning Flash with Hands-on Examples Publish your Flash(with
Hands-on Examples) Movie, creating special effects with Flash Creating a website splash
screen, action Script, web sources. Rich Internet Application (RIAS) with Flex 3-
Introduction, Developing with Flex 3, working with components, Advanced Component
Development, visual effects and Multimedia

48
MODULE V: [10 Periods]
Ajax-Enabled Rich Internet Application: Introduction, Traditional web Applications us
Ajay Applications, Rich Internet Application with Ajax, History of Ajax Raw Ajax example
using xml http request object. Using XML, Creating a full scale Ajax Enabled application.
Dojo Toolkit.

TEXT BOOKS:
1. Multimedia Communications: Protocols and Applications, Franklin F Kuo, J.Joaquin
Garcia, Wolf gang Effelsberg, Prentice Hall Publications.
2. Multimedia Communications: Applications, Networks, Protocols and Standards, Fred
Halsall, Addison Wesley Publications.
3. AJAX, Rich Internet Applications, and Web Development for Programmers, Paul J
Deitel and Harvey M Deitel, Deitel Developer Series, Pearson education.

REFERENCE BOOKS:
1. Professional Adobe Flex 2, Rich Tretola, Simon barber and Renaun Erickson, Wrox,
Wiley India Edition.
2. Multimedia Information Networking, Nalin K Sharda, PHI Learning.
3. Multimedia Computing, Communications & Applications, Ralf Steinmetz and Klara
Nahrstedt, Pearson Education.
4. Multimedia Communication Systems: techniques, standards and networks, K.R.Rao,
Bojkovi and Milovanovic, PHI Learning.
5. Programming Flex 3, C. Kazoun and J. Lott, SPD.
6. Dojo, J.E. Harmon, Pearson Education.
7. Adobe Flex 3: Training from the Source, Tapper & others, Pearson Education.
8. Principles of Multimedia, R.Parekh, TMH.
9. Mastering Dojo, R. Gill, C. Riecke and A. Russell, SPD.

Outcomes
 Understand the basic MRIA Fundamental concepts
 Ability to understand the fundamental concepts in video and digital audio
 Analyze the Rich Internet Applications (RIAS) with Adobe Flash
 Ability to create and design rich internet applications.
 Ability to develop different multimedia tools to produce web based and
independent user interface

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
Cos
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 2 2 2 2 1 1 3 3 2 2
CO2 3 3 2 2 2 2 1 1 3 3 2 1
CO3 3 3 3 2 2 1 3 3 2 1
CO4 3 2 3 2 2 1 1 2 3 2 1
CO5 3 3 3 2 2 1 1 1 2 3 2 1

49
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B1208 Augmented Reality and Virtual Reality L T P
[Professional Elective - III]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Fundamentals of Image Processing

Course Objectives:
1. To describes the fundamentals of sensation, perception, technical and engineering aspects
of virtual reality systems.
2. To explore the concepts of Virtual reality and develop 3D virtual environment.
3. To foundation to the fast growing field of AR and make the students aware of the various
AR devices.
4. To help students build various types of VR experiences and use Unity to develop VR
applications.
5. To expose students to the world of research, technology and innovation.

MODULE-I [10 Periods]

Introduction: The three I’s of virtual reality, commercial VR technology and the five classic
components of a VR system.
Input Devices: Trackers, Navigation, and Gesture Interfaces, Three-dimensional position
trackers, navigation and manipulation, interfaces and gesture interfaces.

MODULE-II [9 Periods]
Output Devices: Graphics displays, sound displays & haptic feedback.
Modeling: Geometric modeling, kinematics modeling, physical modeling, behavior
modeling, model management

MODULE-III [10 Periods]

Human Factors: Methodology and terminology, user performance studies, VR health and
safety issues.
Applications: Medical applications, military applications, robotics applications.

MODULE-IV [10 Periods]

VR Programming-I: Introducing Java 3D, loading and manipulating external models, using
a lathe to make shapes.

MODULE-V [9 Periods]
VR Programming-II: 3D Sprites, animated 3D sprites, particle systems.

TEXT BOOKS :
1. Virtual Reality Technology, Second Edition, Gregory C. Burdea & Philippe
Coiffet, John Wiley & Sons, Inc.,
2. Killer Game Programming in Java, Andrew Davison, Oreilly-SPD, 2005.

50
REFERENCES :
1. Understanding Virtual Reality, interface, Application and Design, William R.Sherman,
Alan Craig, Elsevier(Morgan Kaufmann).
2. 3D Modeling and surfacing, Bill Fleming, Elsevier(Morgan Kauffman).
3. 3D Game Engine Design, David H.Eberly, Elsevier.
4. Virtual Reality Systems, John Vince, Pearson Education.

E-RESOURCES:
1. http://lavalle.pl/vr/book.html
2. https://nptel.ac.in/courses/106/106/106106138
3. https://www.coursera.org/learn/introduction-virtual-reality
4. https://www.vttresearch.com/sites/default/files/pdf/science/2012/S3.pdf
5. https://docs.microsoft.com/en-us/windows/mixed-reality/
6. https://docs.microsoft.com/en-
us/archive/msdnmagazine/2016/november/hololensintroduction-to-the-hololens

COURSE OUTCOMES:
1. Apply the describe how VR systems work and list the applications of VR.
2. Understand the system of human vision and its implication on perception and rendering.
3. Create and deploy a VR application.
4. Identify the describe how AR systems work and list the applications of AR
5. Construct the acquire knowledge in VR and AR technologies in terms of used
devices, building of the virtual environment and modalities of interaction and
modeling.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Contribution to Program Outcomes
CO'S
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3
CO1 2 2 2 1 1
CO2 1 2 2 3 1 1 1
CO3 2 2 2 3 2 1 4 1 1
CO4 2 2 2 2 2 2
CO5 1 2 1 2 1

51
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0536 Data Mining L T P
[Professional Elective - III]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)
Prerequisites: NIL

Course Objectives:
1. Uunderstands stages in building a Data Warehouse
2. Makes Identify the need and importance of preprocessingtechniques
3. Implement similarity and dissimilarity techniques
4. Analyze and evaluate performance of algorithms for Association Rules
5. Analyze Classification and Clustering algorithms.

MODULE I: Introduction and Mining Issues & Data [09 Periods]

Introduction – Data, 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? Which Kinds of
Applications Are Targeted?
Mining Issues and Data - Major Issues in Data Mining, Types of Data, Data Quality

MODULE II: Data, Data Preprocessing [9 Periods]

A: Data Pre-processing: Data Warehousing, Data Cleaning, Data Integration, Data Reduction,
Data Transformation, Aggregation, Sampling,
B: Techniques: Dimensionality Reduction, Feature Subset Selection, Feature Creation, Data
Discretization and Binarization, Variable transformation.

MODULE III: Data Similarity and Dissimilarity Classification [10 Periods]

A:Measuring Data Similarity and Dissimilarity - Similarity and Dissimilarity betweensimple
attributes, Dissimilarities and similarities between data objects, Examples of Proximity
measures, Issues in Proximity Calculation, Selection of right proximity measure.
B:Classification - Basic Concepts, General Approach to solving a classification problem,
Decision Tree Induction: Working of Decision Tree, building a decision tree.

MODULE IV: Classifier and Association Analysis [10 Periods]

Classifiers - Alterative Techniques, Bayes’ Theorem, Naïve Bayesian Classification, Bayesian
Belief NetworksAssociation Analysis - Basic Concepts and Algorithms: Problem Definition,
Frequent Item Set generation, Rule generation, compact representation of frequent item sets, FP-
Growth Algorithm.

MODULE V: Cluster Analysis and DBSCAN [10 Periods]

Cluster Analysis - Basic Concepts and Algorithms: Overview: 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 Clustering: Basic Agglomerative Hierarchical Clustering Algorithm
DBSCAN - Traditional Density Center-Based Approach, DBSCAN Algorithm, Strengths and
Weaknesses.

TEXT BOOKS:
1. Vikram Pudi & P.Radha Krishna, “Data Mining”,4th Edition, Oxford Higher Education .

52
2. Jiawei Han, Michel Kamber,”Data Mining concepts and Techniques”, 3/e,
Elsevier.

REFERENCES:
1. Hongbo Du, “Data Mining Techniques and Applications: An Introduction”,Cengage
Learning.
2. Vikram Pudi and P. Radha Krishna, “Data Mining”, Oxford.
3. Mohammed J. Zaki, Wagner Meira, Jr ,”Data Mining and Analysis-fundamental
Concepts and Algorithms”, Oxford
4. Alex Berson, Stephen Smith ,”Data Warehousing Data Mining & OLAP” , TMH.

E-RESOURCES:
1. http://www-users.cs.umn.edu/~kumar/dmbook/index.php
2. http://myweb.sabanciuniv.edu/rdehkharghani/files/2016/02/The-Morgan-
Kaufmann-Series-in-Data-Management-Systems-Jiawei-Han-Micheline-Kamber-Jian-
Pei-Data-Mining.-Concepts-and-Techniques-3rd-Edition-Morgan-Kaufmann-2011.pdf
3. http://www.ijctee.org/files/Issuethree/IJCTEE_1111_20.pdf
4. https://gunjesh.wordpress.com/

COURSE OUTCOMES:
At the end of the course, students will be able to
1. Acquire knowledge in building a Data Warehouse
2. Understand the need and importance of preprocessing techniques
3. Implement Similarity and dissimilarity techniques
4. Analyze and evaluate performance of algorithms for Association Rules.
5. Deploy Classification and Clustering algorithms

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
POs Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1
CO2 1 2 2 2 1 1 1 2
CO3 1 1 1 2 1 1 1 1
CO4 1 1 1 1 1 1 1 1 1
CO5 1 2 2 2 2 2 2 1 3

53
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0537 Natural Language Processing L T P
[Professional Elective - IV]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Course Objectives:
1. Gain a foundational understanding in natural language processing methods and strategies
2. Learn how to evaluate the strengths and weaknesses of various NLP technologies and
frameworks as they gain practical experience in the NLP toolkits available.
3. learn how to employ literary-historical NLP-based analytic techniques like stylometry,
topic modeling, synsetting also and named entity recognition in their personal research.
4. Enlighten concepts of Predicate – Argument Structure
5. Evaluate various discourse Processing of Cohesion Reference Resolution

Module I: Finding the Structure of Words: [10 Periods]

Words and Their Components, Issues and Challenges, Morphological Models
Finding the Structure of Documents:
Introduction, Methods, Complexity of the Approaches, Performances of the Approaches

Module II: Syntax Analysis: [09 Periods]

Parsing Natural Language, Treebanks: A Data-Driven Approach to Syntax, Representation of
Syntactic Structure, Parsing Algorithms, Models for Ambiguity Resolution in Parsing,
Multilingual Issues

Module III: Semantic Parsing: [10 Periods]

Introduction, Semantic Interpretation, System Paradigms, Word Sense Systems, Software.

Module IV: Predicate-Argument Structure [09 Periods]

Predicate-Argument Structure, Meaning Representation Systems, Software.

ModuleV: Discourse Processing: [10 Periods]

Cohension, Reference Resolution, Discourse Cohension and Structure
Language Modeling:
Introduction, N-Gram Models, Language Model Evaluation, Parameter Estimation, Language
Model Adaptation, Types of Language Models, Language-Specific Modeling Problems,
Multilingual and Crosslingual Language Modeling

TEXT BOOKS:
1. Multilingual natural Language Processing Applications: From Theory to Practice –
Daniel M. Bikel and Imed Zitouni, Pearson Publication
2. Natural Language Processing and Information Retrieval: Tanvier Siddiqui, U.S. Tiwary

54
REFERENCE:
1. Speech and Natural Language Processing - Daniel Jurafsky & James H Martin, Pearson
Publications

E-RESOURCES:
1. https://www.cl.cam.ac.uk/teaching/2002/NatLangProc/revised.pdf
2. https://hpi.de/fileadmin/user_upload/fachgebiete/plattner/teaching/Natural
LanguageProcessing/NLP2016/NLP01_IntroNLP.pdf
3. http://www.sciencedirect.com/science/article/pii/S1532046401910299
4. http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.34.1 r036
5. http://nptel.ac.in/courses/106101007/
6. http://nptel.ac.in/courses/106105158/

Course Outcomes
1. Show sensitivity to linguistic phenomena and an ability to model them with formal
grammars.
2. Understand and carry out proper experimental methodology for training and evaluating
empirical NLP systems
3. Able to manipulate probabilities, construct statistical models over strings and trees, and
estimate parameters using supervised and unsupervised training methods.
4. Able to design, implement, and analyze NLP algorithms
5. Able to design different language modeling Techniques.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 1 - - - - 2 2 1 - 1 2 2 2
CO2 3 3 2 2 1 - - 2 2 1 - 2 3 2 2
CO3 3 3 3 1 1 - - 2 2 1 - 2 3 1 1
CO4 3 3 2 2 1 - - 3 3 1 - 2 3 2 2
CO5 3 3 2 2 1 - - 2 2 1 - 2 3 2 2

55
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: A6203 CRYPTOGRAPHY AND NETWORK SECURITY L T P
[Professional Elective - IV]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and ML), 3 - -
CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Computer Networks

Course Objectives:
• Explain the objectives of information security
• Explain the importance and application of each of confidentiality, integrity,
authentication and availability
• Understand various cryptographic algorithms.
• Understand the basic categories of threats to computers and networks
• Describe public-key cryptosystem.
• Describe the enhancements made to IPv4 by IPSec.
• Understand Intrusions and intrusion detection
• Discuss the fundamental ideas of public-key cryptography
• Generate and distribute a PGP key pair and use the PGP package to send an encrypted
email message.
• Discuss Web security and Firewalls.

MODULE – I: [10 Periods]

Security Concepts: Introduction, The need for security, Security approaches, Principles of
security, Types of Security attacks, Security services, Security Mechanisms, A model for
Network Security
Cryptography Concepts and Techniques: Introduction, plain text and cipher text,
substitution techniques, transposition techniques, encryption and decryption, symmetric and
asymmetric key cryptography, steganography, key range and key size, possible types of
attacks.

MODULE – II: [9 Periods]

Symmetric key Ciphers: Block Cipher principles, DES, AES, Blowfish, RC5, IDEA, Block
cipher operation, Stream ciphers, RC4.
Asymmetric key Ciphers: Principles of public key cryptosystems, RSA algorithm, Elgamal
Cryptography, Diffie-Hellman Key Exchange, Knapsack Algorithm..

MODULE – III: [10 Periods]

Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (SHA-
512),
Message authentication codes: Authentication requirements, HMAC, CMAC, Digital
signatures, Elgamal Digital Signature Scheme.
Key Management and Distribution: Symmetric Key Distribution Using Symmetric &
Asymmetric Encryption, Distribution of Public Keys, Kerberos, X.509 Authentication

56
Service, Public – Key Infrastructure.

MODULE – IV: [9 Periods]

Transport-level Security: Web security considerations, Secure Socket Layer and Transport
Layer Security, HTTPS, Secure Shell (SSH)

Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11
Wireless LAN, IEEE 802.11i Wireless LAN Security

MODULE – V: [10 Periods]

E-Mail Security: Pretty Good Privacy, S/MIME IP Security: IP Security overview, IP
Security architecture, Authentication Header, Encapsulating security payload, combining
security associations, Internet Key Exchange
Case Studies on Cryptography and security: Secure Multiparty Calculation, Virtual
Elections, Single sign On, Secure Inter-branch Payment Transactions, Cross site Scripting
Vulnerability.

TEXT BOOKS:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson
Education, 6th Edition
2. Cryptography and Network Security: AtulKahate, McGraw Hill, 3rd Edition

REFERENCE BOOKS:
1. Cryptography and Network Security: C K Shyamala, N Harini, Dr T R Padmanabhan,
Wiley India, 1st Edition.
2. Cryptography and Network Security: ForouzanMukhopadhyay, McGraw Hill, 3rd Edition
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
2. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
3. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning

Course Outcomes:
• Student will be able to understand basic cryptographic algorithms, message and web
authentication and Security issues
• Ability to identify information system requirements for both of them such as client and
server
 Ability to understand the current legal issues towards information security

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3 1 2
CO2 3 2 1 2
CO3 3 2 1 3
CO4 3 2 1 2
CO5 2 3 1

57
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0538 Agile Methodologies L T P
[Professional Elective - IV]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and ML), 3 - -
CSE (DS), CSE (IOT), AI and IT)

OBJECTIVES:
• To provide students with a theoretical as well as practical understanding of agile software
development practices and how small teams can apply them to create high-quality
software.
• To provide a good understanding of software design and a set of software technologies
and APIs.
• To do a detailed examination and demonstration of Agile development and testing
techniques.
• To understand the benefits and pitfalls of working in an Agile team.
• To understand Agile development and testing.

UNIT I Agile Methodology [10 Periods]

Theories for Agile Management – Agile Software Development – Traditional Model vs.
Agile Model - Classification of Agile Methods – Agile Manifesto and Principles – Agile
Project Management – Agile Team Interactions – Ethics in Agile Teams - Agility in Design,
Testing – Agile Documentations – Agile Drivers, Capabilities and Values

UNIT II Agile Processes [9 Periods]

Lean Production - SCRUM, Crystal, Feature Driven Development- Adaptive Software
Development - Extreme Programming: Method Overview – Lifecycle – Work Products,
Roles and Practices.

UNIT III Agility and Knowledge Management [10 Periods]

Agile Information Systems – Agile Decision Making – Earl’s Schools of KM – Institutional
Knowledge Evolution Cycle – Development, Acquisition, Refinement, Distribution,
Deployment , Leveraging – KM in Software Engineering – Managing Software Knowledge –
Challenges of Migrating to Agile Methodologies – Agile Knowledge Sharing – Role of
Story-Cards – Story-Card Maturity Model (SMM).

UNIT IV Agility and Requirements Engineering [10 Periods]

Impact of Agile Processes in RE–Current Agile Practices – Variance – Overview of RE
Using Agile – Managing Unstable Requirements – Requirements Elicitation – Agile
Requirements Abstraction Model – Requirements Management in Agile Environment, Agile
Requirements Prioritization – Agile Requirements Modeling and Generation – Concurrency
in Agile Requirements Generation.

58
UNIT V Agility and Quality Assurance [9 Periods]
Agile Product Development – Agile Metrics – Feature Driven Development (FDD) –
Financial and Production Metrics in FDD – Agile Approach to Quality Assurance - Test
Driven Development – Agile Approach in Global Software Development.

OUTCOMES: Upon completion of the course, the students will be able to:
• Realize the importance of interacting with business stakeholders in determining the
requirements for a software system
• Perform iterative software development processes: how to plan them, how to execute
them.
• Point out the impact of social aspects on software development success.
• Develop techniques and tools for improving team collaboration and software quality.
• Perform Software process improvement as an ongoing task for development teams.

TEXT BOOKS:
1. David J. Anderson and Eli Schragenheim, ―Agile Management for Software Engineering:
Applying the Theory of Constraints for Business Results, Prentice Hall, 2003.
2. Hazza and Dubinsky, ―Agile Software Engineering, Series: Undergraduate Topics in
Computer Science, Springer, 2009.

REFERENCES:
1. Craig Larman, ―Agile and Iterative Development: A Manager‗s Guide, Addison-
Wesley, 2004.
2. Kevin C. Desouza, ―Agile Information Systems: Conceptualization, Construction, and
Management‖, Butterworth-Heinemann, 2007.
CO- PO-PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
CO S PO1 PO 2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO 1 3 3 2 2 3 - - - - 2 2 2 2 2 2
CO 2 3 2 2 1 2 - - - - 1 2 1 2 1 2
CO 3 2 2 2 2 2 - - - - 1 1 2 1 2 1
CO 4 3 2 2 2 2 - - - - 1 2 2 2 2 2
CO 5 2 2 1 2 2 - - - - 1 1 2 3 3 2

59
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B6920 Adhoc and Sensor Networks L T P
[Professional Elective - IV]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and ML), 3 - -
CSE (DS), CSE (IOT), AI and IT)

Prerequisites:
1. A course on “Computer Networks”
2. A course on “Mobile Computing”

Course Objectives:
 To understand the concepts of sensor networks
 Understand the different routing protocols
 To understand the MAC and transport protocols for ad hoc networks
 To understand the security of sensor networks
 To understand the applications of adhoc and sensor networks

MODULE-I: [10 Periods]

Introduction to Ad Hoc Networks - Characteristics of MANETs, Applications of MANETs
and Challenges of MANETs.
Routing in MANETs - Criteria for classification, Taxonomy of MANET routing algorithms,
Topology-based routing algorithms-Proactive: DSDV; Reactive: DSR, AODV; Hybrid: ZRP;
Position-based routing algorithms-Location Services-DREAM, Quorum-based; Forwarding
Strategies: Greedy Packet, Restricted Directional Flooding-DREAM, LAR.

MODULE-II: [10 Periods]

Data Transmission - Broadcast Storm Problem, Rebroadcasting Schemes-Simple-flooding,
Probability-based Methods, Area-based Methods, Neighbor Knowledge-based: SBA,
Multipoint Relaying, AHBP. Multicasting: Tree-based: AMRIS, MAODV; Mesh-based:
ODMRP, CAMP; Hybrid: AMRoute, MCEDAR.

MODULE-III: [10 Periods]

Geocasting: Data-transmission Oriented-LBM; Route Creation Oriented-GeoTORA, MGR.
TCP over Ad Hoc TCP protocol overview, TCP and MANETs, Solutions for TCP over Ad
hoc

MODULE-IV: [9 Periods]
Basics of Wireless, Sensors and Lower Layer Issues
Applications, Classification of sensor networks, Architecture of sensor network, Physical
layer, MAC layer, Link layer, Routing Layer.

MODULE-V: [9 Periods]
Upper Layer Issues of WSN Transport layer, High-level application layer support, Adapting
to the inherent dynamic nature of WSNs, Sensor Networks and mobile robots.

Course Outcomes:
 Ability to understand the state-of-the-art research in the emerging subject of Ad Hoc
and Wireless Sensor Networks.

60
61
  Apply the knowledge to identify appropriate physical and MAC layer protocols.
 Ability to solve the issues in real-time application development based on ASN.
 Ability to conduct further research in the domain of ASN.
 Be familiar with the OS used in Wireless Sensor Networks and build basic modules.

TEXT BOOKS:
1. Ad Hoc and Sensor Networks – Theory and Applications, Carlos Corderio Dharma P.
Aggarwal,
World Scientific Publications, March 2006, ISBN – 981–256–681–3.
2. Wireless Sensor Networks: An Information Processing Approach, Feng Zhao,
Leonidas Guibas, Elsevier Science, ISBN – 978-1-55860-914-3 (Morgan Kauffman).

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 3 2
CO2 3 3 3 2 1 3 2
CO3 3 3 3 2 1 3 2
CO4 3 2 2 3 1
CO5 3 3 3 2 1 1 1 3 2

62
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0539 Image Processing L T P
[Professional Elective - IV]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and ML), 3 - -
CSE (DS), CSE (IOT), AI and IT)

Course Objectives:
1. To become familiar with digital image fundamentals.
2. To get exposed to simple image enhancement techniques in Spatial and Frequency
domain.
3. To learn concepts of degradation function and restoration techniques.
4. To study the image segmentation and representation techniques.
5. To become familiar with image compression and recognition methods

MODULE-I [ [9 Periods]
Digital Image Fundamentals: Digital Image through Scanner, Digital Camera. Concept of
Gray Levels. Gray Level to Binary Image Conversion. Sampling and Quantization.
Relationship between Pixels. Imaging Geometry. 2D Transformations-DFT, DCT, KLT and
SVD.

MODULE-II [10 Periods]

Image Enhancement in Spatial Domain Point Processing, Histogram Processing, Spatial
Filtering,Enhancement in Frequency Domain, Image Smoothing, Image Sharpening.

MODULE-III [10 Periods]

Image Restoration Degradation Model, Algebraic Approach to Restoration, Inverse Filtering,
Least Mean Square Filters, Constrained Least Squares Restoration, Interactive Restoration.

MODULE-IV [8 Periods]
Image Segmentation Detection of Discontinuities, Edge Linking and Boundary Detection,
Thresholding,Region Oriented Segmentation.

MODULE-V [10 Periods]

Image Compression Redundancies and their Removal Methods, Fidelity Criteria, Image
Compression Models, Source Encoder and Decoder, Error Free Compression, Lossy
Compression.

TEXT BOOKS:
1. Digital Image Processing: R.C. Gonzalez & R. E. Woods, Addison Wesley/
PearsonEducation, 2nd Ed, 2004.

REFERENCES BOOKS:
1. Fundamentals of Digital Image Processing: A. K. Jain , PHI.

63
64
2. Digital Image Processing using MAT LAB: Rafael C. Gonzalez, Richard E. Woods,
Steven L.Eddins: Pearson Education India, 2004.
3. Digital Image Processing: William K. Pratt, John Wilely, 3rd Edition, 2004.

E-RESOURCES:
1. http://www.nptel.iitm.ac.in/courses/IIT-Kanpure.Communication
2. DIP Image Databases
3. http://www.imagescience.org/

COURSE OUTCOMES:
1. Demonstrate the knowledge of the basic concepts of two-dimensional signal
acquisition,sampling, and quantization.
2. Apply the knowledge of filtering techniques.
3. Construct the knowledge of 2D transformation techniques.
4. Demonstrate the knowledge of image enhancement, segmentation, restoration and
compression techniques.
5. Understand the basics of segmentation, features extraction, compression and
recognition methods for color models.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1
CO2 1 2 2 4 3 2 1 1
CO3 2 3 2 4 1 4 1 1 1
CO4 3 2 2 4 5 3 2 2
CO5 4 5 1 4 1 1

65
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0H03 English Communication and Presentation Skills Lab L T P
Credits: 1 (Common for CSE, CSE (Cyber Security), CSE (AI and ML), - - 2
CSE (DS), CSE (IOT), AI and IT)

Pre-requisites: NIL

Course Objectives:
The learners need to be aware of the characteristics of technical communication in their
workplaces; as a result, they are exposed to different channels of technical communication.
Hence the acquired skills make the learners effective communicators using persuasive
language. Besides the above said, one of the major objectives is to maintain objectivity in
writing documents and to produce professional quality documents using different components
of the language.

Methodology: Facilitator’s role: Since classroom learning augments thinking process,

helping them to develop written, spoken and non verbal communication, the facilitator /
Faculty would briefly discuss the topics with the students and later on guide them while the
students involved in activities, writing work and while making presentations. The facilitator
is required to design a lot of practical/industry oriented project works for the students
*Students are required to participate, perform, write and submit the work in the form of
written documents or Power Point Presentations to hone their spoken written and non verbal
communication skills. Students are to take up field work and submit the project work.

MODULE I: Oral Presentation

Mechanics of Presentations – Methodology of Presentation, Importance of Non-verbal
communication during presentations– Nuances of Presentation.
*This particular MODULE is for internal evaluation purpose(s).

MODULE II: E - Correspondence and Email etiquette

Common web mail services, yahoo, gmailetc, fields to pay attention- To:, Cc:, Bcc:, Reply
All, Subject, Salutation, Body, Signature, Font, Caps Lock , Highlight, The ‘KISS’ strategy
( Keep It Simple and Short,)Points to remember while signing off, Introduction to Technical
Vocabulary.
• This MODULE is purely for internal assessment/evaluation

MODULE III: Group Discussion

Initiators- Contributor-Informer-Team Leader-Motivator-Creative Contributor , Importance
of , Non verbal communication -eye contact, voice characters, posture, gestures, do’s and
don'ts, Role play and Simulation- Learners assuming the roles of characters and participating
in Group discussion, analysis, or prediction with strictly defined goals.

MODULE IV: Interview Skills & Office Etiquette

Preparing for the interview, types of interviews, interview session, importance of non verbal
communication during the interview, do’s and don'ts of interview, follow up and thanking
letter. FAQ’s. Formal Conversation, office attire- do’s and don’ts, greetings and meetings,
speaking to seniors and handshakes, offering and taking visiting cards.

66
MODULE V: Job Hunt Process
SWOT analysis, correspondence and browsing the internet to search for a suitable job(s), job
application-cover letter drafting, drafting a winning resume’, types of resume’s -electronic,
video and printed resume’s
• Instruction: Students are required to prepare their video resume which will be assessed by
the faculty member.

REFERENCES:
1. Chrissie: Handbook of Practical Communication Skills: Jaico Publishing house, 1999.
2. Daniels, Aubrey: Bringing Out the Best in People: Tata McGraw-Hill: New York,
2003.
3. Wright, Goulstone, Mark: Just Listen: Discover the Secret to getting through to
absolutely anything : American Management Association, 2010.
4. Leslie. T. Giblin: Skill with people Publication details not known
5. Lewis, Norman: Word Power Made Easy: Goyal Publications: New Delhi, 2009.
6. Murthy, A.G, Krishna,:Ten Much : Tata McGraw-Hill :New Delhi, 2010.

E-RESOURCES:
1. http://www.mindtools.com/pages/article/newTMC_05.htm
2. http://www.kent.ac.uk/careers/intervw.htm
3. http://www.wikihow.com/Write-a-Report

Course Outcomes:
At the end of the course, students will be able to
1. Give Oral Presentations Confidently.
2. Draft appropriate Resume in accordance with the context.
3. Participate and present their view and ideas logically and confidently.
4. Understand the importance of communication in various settings.
5. Utilize the technology for career advancement.

CO- PO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs)
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12
CO1 1 2 2
CO2 1 2
CO3 1 1 2 2
CO4 1 1 1 2 2
CO5 1 1 1 2 2

67
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B0543 Compiler Design Lab L T P
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
Credits: 2 - 1 2
CSE (DS), CSE (IOT), AI and IT)

Prerequisites: NIL

Course Objectives:
1. To understand the various phases in the design of a compiler.
2. To understand the design of top-down and bottom-up parsers.
3. To understand syntax directed translation schemes.

Software Requirements: Turbo C / C++

List of Programs:

1. Write a LEX Program to scan reserved word & Identifiers of C Language. The lexical
analyzer should ignore redundant spaces, tabs and newlines. It should also ignore
comments.
2. Write a C program to recognize strings under 'a*', 'a*b+', 'abb'
3. Write a C program to test whether a given identifier is valid or not
4. Write a Program to implement Recursive Descent Parser for language.
5. Write a Program to Design a Predictive Parser for the Language Accepted by the given
Grammar.
6. Write a Program for Implementation of Shift Reduce parsing
7. Write a program to calculate first function for the given grammar.
8. Write a program to implement Simple LR Parser for the given language
9. Write a program to Implement SLR(1) Parsing algorithm for the given language
10. Write a program to Design LALR bottom-up parser for the given language
11. Write a program to Design CLR bottom-up parser for the given language
12. Write a C program to generate three address codes.

TEXTBOOKS:
1. Andrew N. Appel, ”Modern Compiler Implementation in C”, Cambridge University
Press.
2. A.V. Aho .J.D.Ullman ,”Principles of compiler design” ,Pearson Education.
3. D.M Dhamdhere, ”Systems programming and operating systems” ,2ndedition,tata
McGraw hill publishing comp pvtLtd.

REFERENCES:
1. Dick Grune, Henry E. Bal, Cariel T. H. Jacobs,” Modern Compiler Design”, Wiley
dreamtech.
2. Cooper & Linda,” Engineering a Compiler”, Elsevier.
3. Louden,” Compiler Construction”, Thomson.

68
 Course Outcomes:
At the end of the course, students will be able to
1. Ability to design, develop, and implement a compiler for any language.
2. Able to use lex and yacc tools for developing a scanner and a parser.
3. Able to design and implement LL and LR parsers.
CO- PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 2
CO2 3 2 2 2
CO3 2 2 2 2
CO4 3 2 2 2 2
CO5 3 2 2 2

69
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21))
Code: B0544 Data Mining Lab L T P
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
Credits: 2 - 1 2
CSE (DS), CSE (IOT), AI and IT)
PERQUISITE: NIL
OBJECTIVE:
1. Makes Identify the need and importance of preprocessingtechniques
2. Analyze and evaluate performance of algorithms for Association Rules
3. Analyze Classification and Clustering algorithms.

Software Requirements: WEKA TOOL

List of Programs:
1. Demonstration of preprocessing on dataset student.arff.
2. Implementation of preprocessing on dataset labor.arff.
3. Demonstration of Association rule process on dataset contactlenses.arff using apriori
Algorithm.
4. Implement Association rule process on datasettest.arff using apriori algorithm.
5. Apply classification rule process on dataset student.arff using j48 algorithm.
6. Perform classification rule process on dataset employee.arff using j48 algorithm.
7. Use classification rule process on dataset employee.arff using id3 algorithm.
8. Deploy classification rule process on dataset employee.arff using naïve bayes
Algorithm.
9. Implement clustering rule process on dataset iris.arff using simple k-means.
10. Make use of clustering rule process on dataset student.arff using simple k-means.
11. Design a decision tree by pruning the nodes on your own. Convert the decision trees
into “if- then-else rules”. The decision tree must consists of 2-3 levels and convert
it into a set of rules.
12. Generate Association rules for the following transactional database using Apriori
algorithm.
TID ListofItems
T100 I1,I2,I5
T200 I2,I4
T300 I2,I3
T400 I1,I2,I4
T500 I1,I3
T600 I2,I3
T700 I1,I3
T800 I1,I2,I3,I5

TEXTBOOKS:
1. Pang-Ning Tan & Michael Steinbach, “Introduction to Data Mining”, VipinKumar,
Pearson.
2. Jiawei Han, Michel Kamber ,”Data Mining concepts and Techniques”, 3/e,Elsevier.

70
REFERENCES:
1. Hongbo Du,“Data Mining Techniques and Applications:An Introduction”,Cengage
Learning.
2. Vikram Pudi and P.RadhaKrishna,“Data Mining”,Oxford.
3. Mohammed J.Zaki,Wagner Meira,Jr,”Data Mining and Analysis-Fundamental Concepts
and Algorithms”,Oxford
4. Alex Berson,Stephen Smith,”Data Warehousing Data Mining & OLAP”,TMH.

Course Outcomes:
At the end of the course, students will be able to
1. Analyze the classification rules on various databases.
2. Deploy association rules for any kind of databases.
3. Develop clustering rules for applications.

CO-PO,PSO Mapping
(3/2/1indicatesstrengthofcorrelation)3-Strong,2-Medium,1-Weak
COs Program Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1
CO2 1 2 2 2 2 2 2
CO3 1 2 3 2 1 1 2

71
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VI Semester
(MR-21)
Code: B00M4 Quantitative Aptitude and Verbal Reasoning – II L T P
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
Credits: - 2 - -
CSE (DS), CSE (IOT), AI and IT)

72
 2021-22 B.Tech.
MALLA REDDY ENGINEERING COLLEGE
Onwards VII
(Autonomous)
(MR21) Semester
Code: B0542 L T P
BIG DATA ANALYTICS
Credits: 3 3 1 -

Prerequisites: Databases, programming fundamentals.

Course Objectives:
This course enables the students to learn and understand Big data, data analytics, R language,
developing map reduce programs, discuss about concepts of big data, make use of Hadoop
concepts for designing applications, develop applications using Hadoop I/O and analyze big
data using programming tools such as Pig and Hive.

MODULE I: Big data overview, data analytics, and R Language [09

Periods] Big Data Overview: Data Structures, Analyst Perspective on Data Repositories,
State of the Practice in Analytics, Bl Versus Data Science, Current Analytical Architecture,
Drivers of Big Data, Emerging Big Data Ecosystem and a New Approach to Analytics,
Key Roles for the New Big Data Ecosystem, Examples of Big Data Analytics. Data
Analytics Lifecycle, Model Building and Basic Data Analytic Methods Using R Data
Analytics Lifecycle Overview, Key Roles for a Successful Analytics Project, Background
and Overview of Data Analytics Lifecycle - Discovery, Data Preparation, Learning the
Business Domain , Model Planning , Model building, Communicate Results,
Operationalize and case study example Global Innovation Network and Analysis (GINA)
R Introduction: Introduction to R, Exploratory Data Analysis, Statistical Methods for
Evaluation, Hypothesis Testing, Difference of Means, Rank-Sum Test, Errors, Sample Size
data

MODULE II: Working with Big Data [09 Periods]

Hadoop - Google File System, Hadoop Distributed File System (HDFS)– Building blocks of
Hadoop (Namenode, Datanode, Secondary Namenode, JobTracker, TaskTracker).
Configuring of Hadoop Cluster - Introducing and Configuring Hadoop cluster (Local,
Pseudo-distributed mode, Fully Distributed mode), Configuring XML files.

MODULE III: Hadoop API and Map Reduce Programs [09 Periods]
A: Hadoop API - Writing MapReduce Programs: A Weather Dataset, Understanding
Hadoop API for MapReduce Framework (Old and New)
B: MapReduce Programs with classes - Basic programs of Hadoop MapReduce: Driver
code, Mapper code, Reducer code, RecordReader, Combiner, Partitioner.

MODULE IV: Hadoop I/O and Implementation [09 Periods]

Hadoop I/O - The Writable Interface, Writable Comparable and comparators, Writable
Classes: Writable wrappers for Java primitives, Text, BytesWritable, NullWritable,
ObjectWritable and GenericWritable, Writable collections.
Implementation - Implementing a Custom Writable: Implementing a RawComparator for
speed, Custom comparators.

MODULE V: PIG and HIVE HADOOP TOOL [12 Periods]

PIG - HADOOP TOOL - Hadoop Programming Made Easier - Admiring the Pig
Architecture, Going with the Pig Latin Application Flow, Working through the ABCs of Pig

73
Latin, Evaluating Local and Distributed Modes of Running Pig Scripts, Checking out the Pig
Script Interfaces, Scripting with Pig Latin.

HIVE – HADOOP TOOL - Saying Hello to Hive, Seeing How the Hive is Put Together,
Getting Started with Apache Hive, Examining the Hive Clients, Working with Hive Data
Types, Creating and Managing Databases and Tables, Seeing How the Hive Data
Manipulation Language Works, Querying and Analyzing Data.

TEXTBOOKS:
1. Data Science & Big Data Analytics Discovering, Analyzing, Visualizing and Presenting
Data EMC Education Services, Wiley Publishers, 2015.
2. Cay Horstmann, Wiley John Wiley & Sons, “Big Java”, 4th Edition, INC
3. Tom White, “Hadoop: The Definitive Guide” 3rd Edition, O’reilly

REFERENCES:
1. Alex Holmes, “Hadoop in Practice”, MANNING Publ.
2. Srinath Perera, ThilinaGunarathne, “Hadoop MapReduce” Cookbook.

E-RESOURCES:
1. http://newton.uam.mx/xgeorge/uea/Lab_Prog_O_O/materiales_auxiliares/Big_Java_4th_
Ed.pdf
2. http://www.isical.ac.in/~acmsc/WBDA2015/slides/hg/Oreilly.Hadoop.The.Definitive.Gui
de.3rd.Edition.Jan.2012.pdf-
3. https://static.googleusercontent.com/media/research.google.com/en//archive/mapreduce-
osdi04.pdf
4. http://www.comp.nus.edu.sg/~ooibc/mapreduce-survey.pdf
5. http://freevideolectures.com/Course/3613/Big-Data-and-Hadoop/18
6. http://freevideolectures.com/Course/3613/Big-Data-and-Hadoop/40

Course Outcomes:
At the end of the course, students will be able to
1. Develop simple applications using R language
2. Analyze file systems such as GFS and HDFS.
3. Design applications by applying Map reduce concepts.
4. Build up programs by making use of I/O.
5. Explore and inspect the big data using programming tools like Pig and Hive.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 3 3 3 3 1 1 3 2 1 3 3 2 3
CO2 3 2 3 3 3 2 1 3 2 2
CO3 3 3 3 3 3 3 3 2 2
CO4 3 3 3 3 3 1 3 3 2 2
CO5 2 3 3 3 3 1 3 3 2 2

74
 2021-22 B.Tech.
MALLA REDDY ENGINEERING COLLEGE
Onwards VII
(Autonomous)
(MR21) Semester
Code: B1210 L T P
Credits: 3 Machine Learning 3 - -

prerequisites: NIL
Course Objectives:
This course provides the students a broad introduction to python programming, machine
learning, discuss about various learning algorithms like decision tree learning, Bayesian
learning, computational learning, instance based learning, combined inductive and analytical
learning methods, analyze genetic algorithms and various learning set of rules.

Module I: Python programming -Machine Learning (ML) [10

Periods] Introduction to Python:
Python, expression, variables, assignment statements, functions, built in function, strings,
modules, lists, making choice( Boolean, if, storing conditional statements), repetition(loops,
while, counted loops, user input loops, control loops , style notes), File processing( one
record per line, records with multiple fields, positional data, multiline records, looking ahead,
writing files), sets and dictionaries( sets, dictionaries, inverting a dictionary), Algorithms
with suitable example. Construction of functions, methods, Graphical user interfaces,
databases and applications.
Introduction - Well-posed learning problems, designing a learning system, Perspectives and
issues in ML
Concept Learning - Introduction, Concept Learning task, Concept learning as search, Find-
S: Finding a maximally specific hypothesis, Version spaces and candidate elimination
algorithm, Remarks on version spaces and Candidate elimination, Inductive bias.

Module II: Decision Tree Learning and ANN [09 Periods]

Decision Tree learning - Introduction, Decision Tree representation, Appropriate Problems,
Decision Tree learning algorithm, Hypothesis Space Search, Inductive bias, Issues.
Artificial Neural Networks - Introduction, Neural network representation, Problems for
Neural Network Learning, Perceptions, Multilayer networks and Back Propagation
algorithm, Remarks on back propagation algorithm, Evaluation Hypotheses, Motivation,
Estimation hypothesis accuracy, Sampling theory, General approach for deriving confidence
intervals, Difference in error of two hypotheses,
Module III: Bayesian learning and Instance based Learning [10 Periods]
A: Bayesian learning - Introduction and concept learning, Maximum Likelihood and Least
Squared Error Hypotheses, Maximum likelihood hypotheses for predicting probabilities,
Minimum description length principle.
B: Instance-based Learning - K -Nearest Neighbor Learning, Locally Weighted
Regression, Radial Basis Functions, Case-Based Reasoning, Lazy and Eager Learning,
Genetic Algorithm: Motivation, Hypothesis Space Search, Genetic Programming, Models of
Evolution and Learning, Parallelizing Genetic Algorithms
Module IV: Rules and Analytical Learning [09 Periods]
Learning Sets of Rules - Introduction, Sequential Covering Algorithms, Learning Rule Sets:
Learning First Order Rules, Learning Sets of First Order Rules: FOIL, Induction as Inverted
Deduction, Inverting Resolution.

75
Analytical Learning - Introduction, Learning with Perfect Domain Theories: Prolog-EBG
Remarks on Explanation-Based Learning, Explanation-Based Learning of Search Control
Knowledge
Module V: Learning Techniques [10 Periods]
Combining Inductive and Analytical Learning - Motivation, Inductive-Analytical
Approaches to Learning, Using Prior Knowledge to initialize Hypothesis, Using Prior
Knowledge to alter Search Objective, Using Prior Knowledge to Augment Search Operators.
Reinforcement Learning - Introduction, Learning Task, Q Learning, Non-Deterministic,
Rewards and Actions, Temporal Difference Learning, Generalizing from Examples,
Relationship to Dynamic Programming

TEXT BOOKS:
1. Jennifer Campbell paulGries Jason Montojo Greg Wilson, "Practical Programming" An
introduction to Computer Science Using Python
2. Tom M. Mitchell, “Machine Learning”, MGH, 1st Edition, 2013.
3. Stephen Marsland, “Machine Learning: An Algorithmic Perspective”, Chapman and
Hall / CRC, 2nd Edition, 2014.
REFERENCES:
1. Neural Networks, William WHsieh, “Machine Learning Methods in the
Environmental Sciences”
2. Richard O. Duda, Peter E. Hart and David G. Stork, “Pattern Classification”, John
Wiley & Sons Inc., 2001
3. Chris Bishop, “Neural Networks for Pattern Recognition”, Oxford University Press,
1995
E-RESOURCES:
1. http://www.zuj.edu.jo/download/machine-learning-tom-mitchell-pdf/
2. https://goo.gl/FKioSh
3. http://www.ntu.edu.sg/home/egbhuang/pdf/ieee-is-elm.pdf
4. www.fxpal.com/publications/a-genetic-algorithm-for-video-segmentation-and-
summarization.pdf
5. http://nptel.ac.in/courses/106106139/
6. http://nptel.ac.in/courses/106105152/
Course Outcomes:
At the end of the course, students will be able to
1. Formulate machine learning problems corresponding to different applications.
2. Understand a range of machine learning algorithms like decision trees, and ANN.
3. Apply Machine Learning algorithms, Bayesian and Instance based Learning techniques.
4. Use of machine learning algorithms to solve problems using rules, and analytical
learning techniques
5. Illustrate the Combining Inductive and Analytical Learning and applications of
Reinforcement Learning

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1
CO2 1 2 1 1 1 1 1 2 1
CO3 1 1 2 2 1 1 2 2 2
CO4 1 1 1 2 1 1 3 1 2
CO5 1 1 1 1 1 1 2 1 2

76
 2021-22 B.Tech.
MALLA REDDY ENGINEERING COLLEGE
Onwards VIII
(Autonomous)
(MR21) Semester
Code: B6217 L T P
CYBER SECURITY
Credits: 3 3 - -

Prerequisites: NIL
Course Objectives:
 This course makes the students to understand the concept of cyber security and issues and
challenges associated with it, the cybercrimes, their nature, legal remedies and as to how
report the crimes through available platforms and procedures.
 The course includes the reporting procedure of inappropriate content, underlying legal
aspects and best practices for the use of social media platforms, the basic concepts related
to E-commerce and digital payments, the basic security aspects related to computer and
mobiles.

MODULE-I: Introduction to Cyber Security [9 Periods]

Hacking, Types of hacking, Myths about hacking, Types of hackers, Motives for Hacking,
Ethical hacking, Concept of cyber security, Issues and challenges of cyber security,
Cyberterrorism, Cyber forensics, The INDIAN cyberspace, Regulation of cyberspace,
National cyber security policy, Communication technology, Internet, World wide web,
Advantages of internet, Internet infrastructure for data transfer and governance, Internet
society, Recent cyber-attacks and Data breaches in India.

MODULE-II: Cyber Crime and Cyber Law [10 Periods]

Cybercrime, Classification of cybercrimes, Common cybercrimes- cybercrime targeting

computers and mobiles, cybercrime against women and children, financial frauds, social
engineering attacks, malware and ransomware attacks, zero day and zero click attacks,
Cybercriminals modus- operandi, Reporting of cybercrimes, Remedial and mitigation
measures, Legal perspective of cybercrime, IT Act 2000 and its amendments, Cybercrime
and offences, Organizations dealing with Cybercrime and Cyber security in India, Case
studies.

MODULE-III: Social Media Overview and Security [10 Periods]

Introduction to Social networks, Types of social media, Social media platforms, Social
media monitoring, Hashtag, Viral content, Social media marketing, Social media privacy,
Challenges, opportunities and pitfalls in online social network, Security issues related to
social media, Flagging and reporting of inappropriate content, Laws regarding posting of
inappropriate content, Best practices for the use of social media, Case studies.

MODULE-IV: E-Commerce and Digital Payments [10 Periods]

Definition of E- Commerce, Main components of E-Commerce, Elements of E-Commerce

security, E-Commerce threats, E-Commerce security best practices, Introduction to digital
payments, Components of digital payment and stake holders, Modes of digital payments-
Banking Cards, Unified Payment Interface (UPI), e-Wallets, Unstructured Supplementary
Service Data (USSD), Aadhar enabled Payment Systems (AePS), Digital payments related

77
 common frauds and preventive measures, RBI guidelines on digital payments and customer
protection in unauthorized banking transactions, Relevant provisions of Payment Settlement
Act,2007.

MODULE-V: Digital Devices Security, Tools and Technologies for Cyber Security
[9 Periods]
End Point device and Mobile phone security, Password policy, Security patch management,
Data backup, Downloading and management of third-party software, Device security policy,
Cyber Security best practices, Significance of host firewall and Ant-virus, Management of
host firewall and Anti-virus, Wi-Fi security, Configuration of basic security policy and
permissions, Cyber safety tips.

TEXT BOOKS
1. Cyber Crime Impact in the New Millennium, by R. C Mishra , Auther Press.
Edition 2010.
2. Cyber Security Understanding Cyber Crimes, Computer Forensics and Legal
Perspectives by Sumit Belapure and Nina Godbole, Wiley India Pvt. Ltd. (First
Edition, 2011).

REFERENCE BOOKS
1. Security in the Digital Age: Social Media Security Threats and Vulnerabilities by
Henry
A. Oliver, Create Space Independent Publishing Platform. (Pearson , 13th
November,2001)
2. Electronic Commerce by Elias M. Awad, Prentice Hall of India Pvt Ltd.
Cyber Laws: Intellectual Property & E-Commerce Security by Kumar K,
Dominant Publishers.

COURSE OUTCOMES:
At the end of the course, students will be able to:
1. Explore various concepts of cyber security and issues.
2. Investigate more on various challenges associated with cyber security.
3. Analyze reporting procedure of inappropriate content.
4. Review underlying legal aspects and best practices for the use of social
media platforms.
5. Examine various basic concepts related to E-commerce and digital payments.
CO - PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 1 3 3 3

CO2 2 2 2 2

CO3 2 3 1 1 2 3

CO4 3 3 1 3 2

CO5 3 2 3 3 2 1

78
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VII Semester
(MR21)
Code: B0545 Block chain Technologies L T P
Credits: 3 [Professional Elective - V] 3 - -
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Nil

Course Objectives:
 Understand how block chain systems (mainly Bit coin and Ethereum) work
 Understand how to securely interact with them,
 Design, build, and deploy smart contracts and distributed applications,
 Integrate ideas from block chain technology into their own projects.
 Ethereum Blockchain Implementation.

Module I: [9 Periods]
Introduction, Scenarios, Challenges Articulated, Blockchain, Blockchain Characteristics,
Opportunities Using Blockchain, History of Blockchain.
Evolution of Blockchain: Evolution of Computer Applications, Centralized Applications,
Decentralized Applications, Stages in Blockchain Evolution, Consortia, Forks, Public
Blockchain Environments, Type of Players in Blockchain Ecosystem, Players in Market.

Module II: [10 Periods]

Blockchain Concepts: Introduction, Changing of Blocks, Hashing, Merkle-Tree, Consensus,
Mining and Finalizing Blocks, Currency aka tokens, security on blockchain, data storage on
blockchain, wallets, coding on blockchain: smart contracts, peer-to-peer network, types of
blockchain nodes, risk associated with blockchain solutions, life cycle of blockchain
transaction.

Module III: [10 Periods]

Architecting Blockchain solutions: Introduction, Obstacles for Use of Blockchain,
Blockchain Relevance Evaluation Framework, Blockchain Solutions Reference Architecture,
Types of Blockchain Applications.
Cryptographic Tokens, Typical Solution Architecture for Enterprise Use Cases, Types of
Blockchain Solutions, Architecture Considerations, Architecture with Blockchain Platforms,
Approach for Designing Blockchain Applications.

MODULE IV: [10 Periods]

Ethereum Blockchain Implementation: Introduction, Tuna Fish Tracking Use Case, Ethereum
Ecosystem, Ethereum Development, Ethereum Tool Stack, Ethereum Virtual Machine, Smart
Contract Programming, Integrated Development Environment, Truffle Framework, Ganache,
Unit Testing, Ethereum Accounts, MyEther Wallet, Ethereum Networks/Environments,
Infura, Etherscan, Ethereum Clients, Decentralized Application, Metamask, Tuna Fish Use
Case Implementation, OpenZeppelin Contracts

79
MODULE V: [9 Periods]
Hyperledger Blockchain Implementation, Introduction, Use Case – Car Ownership Tracking,
Hyperledger Fabric, Hyperledger Fabric Transaction Flow, FabCar Use Case
Implementation, Invoking Chaincode Functions Using Client Application.

Advanced Concepts in Blockchain: Introduction, Inter Planetary File System (IPFS), Zero-
Knowledge Proofs, Oracles, Self-Sovereign Identity, Blockchain with IoT and AI/ML
Quantum Computing and Blockchain, Initial Coin Offering, Blockchain Cloud Offerings,
Blockchain and its Future Potential.

Text Books:
1) Ambadas, Arshad SarfarzAriff, Sham “Blockchain for Enterprise Application
Developers”, Wiley
2) Andreas M. Antonpoulos, “Mastering Bitcoin: Programming the Open Blockchain” ,
O’Reilly

Reference Books:
1) Blockchain: A Practical Guide to Developing Business, Law, and Technology Solutions,
Joseph Bambara, Paul R. Allen, Mc Graw Hill.
2) Blockchain: Blueprint for a New Economy, Melanie Swan, O’Reilly

E-RESOURCES
1) https://github.com/blockchainedindia/resources
2) https://onlinecourses.nptel.ac.in/noc22_cs44/preview

Course Outcomes:
At the end of the course, students will be able to:
 Demonstrate the foundation of the Block chain technology and understand the
processes in payment and funding.
 Identify the risks involved in building Block chain applications.
 Review of legal implications using smart contracts.
 Choose the present landscape of Blockchain implementations and Understand Crypto
currency markets
 Examine how to profit from trading crypto currencies.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO PO PO PO PO PO6 PO7 PO8 PO9 PO1 PO11 PO12 PSO1 PSO2 PSO3
0
CO1 1 1 2 1 2
CO2 1 1 1 1 2 1 2 2 1 2
CO3 1 1 1 1 2 2 3 3 3 2
CO4 2 1 1 1 2 3 3 1 1 2
CO5 2 1 1 2 2 1 3 3 2

80
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VII Semester
(MR21)
Code: B0546 Business Analytics L T P
Credits: 3 [Professional Elective - V] 3 - -
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
CSE (DS), CSE (IOT), AI and IT)

Prerequisites: NIL
Course Objective:
 Understand the role of business analytics within an organization.
 Analyze data using statistical and data mining techniques and understand relationships
between the underlying business processes of an organization.
 To gain an understanding of how managers use business analytics to formulate and solve
business problems and to support managerial decision making.
 To become familiar with processes needed to develop, report, and analyze business data
 Use decision-making tools/Operations research techniques
 Mange business process using analytical and management tools.
 Analyze and solve problems from different industries such as manufacturing,
service, retail, software, banking and finance, sports, pharmaceutical, aerospace etc

MODULE-I: [9 Periods]
Business analytics: Overview of Business analytics, Scope of Business analytics, Business
Analytics Process, Relationship of Business Analytics Process and organization, competitive
advantages of Business Analytics. Statistical Tools: Statistical Notation, Descriptive Statistical
methods, Review of probability distribution and data modelling, sampling and estimation methods
overview.

MODULE II: [9 Periods]

Descriptive Statistical Measures: Population and samples, Measures of location, Measures of
Dispersion, Measures of variability, measures of Association. Probability distribution and Data
Modelling – Discrete Probability distribution, Continuous Probability distribution, Random
sampling from Probability Distribution, Data Modelling and Distribution fitting

MODULE III: [12 Periods]

A: Predictive Analytics: Karl Pearson Correlation Techniques - Multiple Correlation-Spearman’s
Rank correlation-Simple and Multiple regression Regressions by the method of least squares
B:Building good regression models: Regression with categorical independent variables-
Linear Discriminate Analysis-One way and Two Way ANOVA

MODULE IV: [9 Periods]

Organization Structures of Business analytics, Team management, Management Issues,
Designing Information Policy, Outsourcing, Ensuring Data Quality, measuring contribution of
Business analytics, Managing Changes. Descriptive Analytics, predictive analytics, predicative
Modelling, Predictive analytics analysis, Data Mining, Data Mining Methodologies, Prescriptive
analytics and its step in the business analytics Process, Prescriptive Modelling, nonlinear
Optimization..
81
82
MODULE V: [10 Periods]
Decision Analysis: Formulating Decision Problems, Decision Strategies with the without
Outcome Probabilities, Decision Trees, The Value of Information, Utility and Decision Making.
Recent Trends in Embedded and collaborative business intelligence, Visual data recovery, Data
Storytelling and Data journalism.

TEXT BOOKS:
1. Business analytics Principles, Concepts, and Applications by Marc J. Schniederjans, Dara
G. Schniederjans, Christopher M. Starkey, Pearson FT Press.
2. Business Analytics by James Evans, persons Education.

REFERENCES:
1. James Evans, Business Analytics, 2e, Pearson, 2017.
2. Camm, Cochran, Fry, Ohlmann, Anderson, Sweeney, Williams Essential of Business
Analytics, Cengage Learning.
3. Thomas Eri, Wajid Khattack & Paul Buhler : Big Data Fundamentals, Concepts,
drivers and Techniques by Prentice Hall of India, New Delhi, 2015
4. Akil Maheswari: Big Data, Upskill ahead by Tata McGraw Hill, New Delhi, 2016
5. Seema Acharya & Subhashini Chellappan: Big Data and Analytics, Wiley
Publications, New Delhi, 2015.

E Resources:
1. https://onlinecourses.nptel.ac.in/noc18_mg09/preview
2. http://nptel.ac.in/courses/110104086/13
3. https://onlinecourses.nptel.ac.in/noc18-mg11/preview
4. http://nptel.ac.in/courses/110106050/

Course Outcomes:
At the end of the course, the student will be able to:
 Students will demonstrate knowledge of business analytics
 know the various descriptive statistical measures and their application
 Understand the tools of predictive analytics and their application for business analysis.
 Understanding the basic concepts of data mining and its importance in business
analytics.
 Students will demonstrate the ability to translate data into clear, actionable insights.
CO- PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes (POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
1 1 1
1 2 2 4 3 2 1 1
2 3 2 4 1 4 1 1 1
3 2 2 4 5 3 2 2
4 5 1 4 1 1

83
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VII Semester
(MR-21)
Code: B0547 Principles of Programming Languages L T P
[Professional Elective - V]
Credits: 3 (Common for CSE, CSE (Cyber Security), CSE (AI and 3 - -
ML), CSE (DS), CSE (IOT), AI and IT)

Course Objectives:
1. Compare programming languages and describe the main principles of imperative,
functional, object oriented and logic oriented programming languages
2. Recite the high points of programming language history; and
3. Read the central formalisms used in the description of programming languages.
4. Assess programming languages critically and in a scientific manner
4. Analyze the principles of an imperative, functional, object oriented or logic oriented
programming language

MODULE I: [10 Periods]

Preliminary Concepts: Reasons for studying, concepts of programming languages,
Programming domains, Language Evaluation Criteria, influences on Language design,
Language categories. Programming Paradigms: Imperative, Object Oriented, functional
Programming, Logic Programming. Programming Language Implementation – Compilation
and Virtual Machines, programming environments.

MODULE II: [10 Periods]

Syntax and Semantics: General Problem of describing Syntax and Semantics, formal
methods of describing syntax - BNF, EBNF for common programming languages features,
parse trees, ambiguous grammars, attribute grammars, denotational semantics and axiomatic
semantics for common programming language features.

MODULE III: [10 Periods]

Data types: Introduction, primitive, character, user defined, array, associative, record, union,
pointer and reference types, design and implementation uses related to these types. Names,
Variable, concept of binding, type checking, strong typing, type compatibility, named
constants, variable initialization. Expressions and Statements: Arithmetic relational and
Boolean expressions, Short circuit evaluation mixed mode assignment, Assignment
Statements, Control Structures – Statement Level, Compound Statements, Selection,
Iteration, Unconditional Statements, guarded commands

MODULE IV: [10 Periods]

Subprograms and Blocks: Fundamentals of sub-programs, Scope and lifetime of variable,
static and dynamic scope, Design issues of subprograms and operations, local referencing
environments, parameter passing methods, overloaded sub-programs, generic sub-programs,
parameters that are sub-program names, design issues for functions user defined overloaded
operators, co routines. Abstract Data types: Abstractions and encapsulation, introductions to
data abstraction, design issues, language examples, C++ parameterized ADT, object oriented
programming in small talk, C++, Java, C#, Ada 95 Concurrency: Subprogram level
concurrency, semaphores, monitors, massage passing, Java threads, C# threads.

MODULE V: [10 Periods]

Exception handling: Exceptions, exception Propagation, Exception handler in Ada, C++ and
Java. Logic Programming Language: Introduction and overview of logic programming,
84
85
 basic elements of prolog, application of logic programming. Functional Programming
Languages: Introduction, fundamentals of FPL, LISP, ML, Haskell, application of Functional
Programming Languages and comparison of functional and imperative Languages.

Course Outcomes:
Upon completion of the course, the students are expected to:
1. Master using syntax‐related concepts including context‐free grammars, parse trees,
Recursive descent parsing, printing, and interpretation.
2. Master analyzing semantic issues associated with function implementations, including
Variable binding, scoping rules, parameter passing, and exception handling.
3. Master implementation techniques for interpreted functional languages.
4. Master using object oriented languages and be familiar with
a) Design issues of object‐oriented and functional languages.
b) Language abstraction constructs of classes, interfaces, packages, and Procedures.
c) Be familiar with implementation of object‐oriented languages.

TEXT BOOKS:
1. Concepts of Programming Languages Robert .W. Sebesta 6/e, Pearson Education
2. Programming Languages –Louden, Second Edition, Thomson.

REFERENCE BOOKS:
1. Programming languages –Ghezzi, 3/e, John Wiley
2. Programming Languages Design and Implementation – Pratt and Zelkowitz, Fourth Edition
PHI/Pearson Education
3. Programming languages –Watt, Wiley Dreamtech
4. LISP Patric Henry Winston and Paul Horn Pearson Education.
5. Programming in PROLOG Clocksin, Springer

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Contribution to Program Outcomes
CO'S
PO-1 PO-2 PO-3 PO-4 PO-5 PO-6 PO-7 PO-8 PO-9 PO-10 PO-11 PO-12 PSO-1 PSO-2 PSO-3
CO1 2 2 2 1 1
CO2 1 2 2 3 1 1 1
CO3 2 2 2 3 2 1 4 1 1
CO4 2 2 2 2 2 2
CO5 1 2 1 2 1

86
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VII Semester
(MR21)
Code: B6917 Internet of Things L T P
Credits: 3 [Professional Elective - V] 3 - -
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
CSE (DS), CSE (IOT), AI and IT)

Prerequisites: Basic knowledge of computer architecture, programming and communication

protocols

Course Objectives:
 Identify problems that are amenable to solution by AI methods, and which AI methods
may be suited to solving a given problem
 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)
 Implement basic AI algorithms (e.g., standard search algorithms or dynamic
programming)
 Design and carry out an empirical evaluation of different algorithms on problem
formalization, and state the conclusions that the evaluation supports
 Data Acquiring, Organizing and Analytics IOT

MODULE I - The Internet of Things (IOT) [10 Periods]

The Internet of Things: An Overview of Internet of Things, Internet of Things Technology,
behind IoTs Sources of the IoTs, M2M Communication, Examples of IoTs, Design Principles
for Connected Devices.

MODULE II - [09 Periods]

Modified OSI Stack for the IoT/M2M Systems, ETSI M2M domains and High-level
capabilities, Communication Technologies, Data Enrichment and Consolidation and Device
Management Gateway Ease of designing and affordability.

MODULE III – [10 Periods]

Design Principles for the Web Connectivity for connected-Devices, Web Communication
protocols for Connected Devices, Message Communication protocols for Connected Devices,
Web Connectivity for connected-Devices.

MODULE IV – [10 Periods]

Data link layer of IoT, Wireless Communication Technologies, Wired Communication
Technologies, Manet Networks: Network Layer of IoT, lowPAN adaptation layer for devices
with limited resources, Dynamic routing protocols for wireless adhoc networks
Communication protocols for IoT, Service oriented protocol(COAP), Communication
protocols based on the exchange of messages(MQTT), Service discovery protocols.

MODULE V – [10 Periods]

Data Acquiring, Organizing and Analytics in IoT/M2M, Applications/ Services/ Business
Processes, IOT/M2M Data Acquiring and Storage, Business Models for Business Processes
in the Internet Of Things, Organizing Data, Transactions, Business Processes, Integration and
Enterprise Systems.

87
Text Books:
1) Internet of Things: Architecture, Design Principles And Applications, Rajkamal,
McGraw Hill Higher Education.
2) The Internet of Things: Key applications and Protocols ‖ Wiley Publications 2nd Edition
3) Internet of Things: A Hands-On Approach by Arsheep Bahga, Vijay Madisetti

Reference Books:
1) An Introduction to Internet of Things, Connecting devices, Edge Gateway and Cloud
with Applications, Rahul Dubey, Cengage, 2019.
2) IoT Fundamentals, Networking Technologies, Protocols and Use Cases for the Internet
of Things, David Hanes, Gonzalo Salgueiro, Patrick Grossetette, rob Barton, Jerome
Henry, CISCO, Pearson, 2018.
3) Designing the Internet of Things, Adrian McEwen and Hakim Cassimally, Wiley.

E-RESOURCES:
1) https://onlinecourses.nptel.ac.in/noc22_cs96/preview
2) https://www.amazon.in/Introduction-IoT-Sudip- Misra/dp/1108959741/ref=sr_1_1?
dchild=1&keywords=sudip+misra&qid=1627359928 &sr=8-1
3) https://www.amazon.in/dp/1032146753/ref=sr_1_3?dchild=1&keywords=sudip+misra&q
id=1627359971&sr=8-3
4) https://www.naukri.com/learning/industrial-internet-of-things-iiot-course-courl4051
5) https://geekflare.com/internet-of-things-iot-learning-resources/

Course Outcomes:
At the end of the course, students will be able to
 Describe the usage of the term 'the internet of things' in different contexts
 Discover the various network protocols used in IoTand familiar with the key wireless
technologies used in IoT systems, such as Wi-Fi, 6LoWPAN, Bluetooth and ZigBee
 Define the role of big data, cloud computing and data analytics in a typical IoT system
Design a simple IoT system made up of sensors, wireless network connection, data
analytics and display/actuators, and write the necessary control software
 Build and test a complete working IoT system
 Data Acquiring, Organizing and Analytics of IoT applications.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3 3 3 3 3 3 3 3 3
CO2 3 2 3 2 3 2 3 3 3
CO3 3 3 3 3 3 3 3 3 3
CO4 3 3 3 3 3 3 3 3 3 3
CO5 3 3 3 3 3 3 3 3 3

88
 2021-22
MALLA REDDY ENGINEERING COLLEGE B. Tech.
Onwards
(Autonomous) VII Semester
(MR21)
Code: B0548 Software Testing Methodologies L T P
Credits: 3 [Professional Elective - V] 3 - -
(Common for CSE, CSE (Cyber Security), CSE (AI and ML),
CSE (DS), CSE (IOT), AI and IT)
Prerequisites: Nil
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, generate a test report
 To expose the 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
MODULE I - The Internet of Things (IOT) [10 Periods]
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.

MODULE II - [09 Periods]

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.

MODULE III – [10 Periods]

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.
MODULE IV – [10 Periods]
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 a prioritized test suite Software Quality Management:
Software Quality metrics, SQA models.
Debugging: process, techniques, correcting bugs.

89
MODULE V – [10 Periods]
Automation and Testing Tools: need for automation, categorization of testing tools, selection
of testing tools, Cost incurred, Guidelines for automated testing, overview of some
commercial testing tools such as Win Runner, Load Runner, Jmeter and JUnit . Test
Automation using 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, Naresh Chauhan, Oxford
2) Software Testing, Yogesh Singh, CAMBRIDGE

Reference Books:
1) Foundations of Software testing, Aditya P Mathur, 2ed, Pearson
2) Software testing techniques – Baris Beizer, Dreamtech, second edition.
3) Software Testing, Principles, techniques and Tools, M G Limaye, TMH
4) Effective Methods for Software testing, Willian E Perry, 3ed, Wiley

E-RESOURCES:
1. https://www.tutorialspoint.com/software_testing_dictionary/test_tools.htm

Course Outcomes:
At the end of the course, students will be able to
 Identify and understand various software testing problems, apply software testing
knowledge and engineering methods and solve these problems by designing and
selecting software test models, criteria, strategies, and methods
 Design and conduct a software test process for a software project
 Analyze the needs of software test automation
 Use various communication methods and skills to communicate with their teammates
to conduct their practice-oriented software testing projects
 Basic understanding and knowledge of contemporary issues in software testing, such
as component-based, web based and object oriented software testing problems
 Write test cases for given software to test it before delivery to the customer and write
test scripts for both desktop and web based applications

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO PO PO PO PO PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3

CO1 2 3 3 3 3 3 3 3 3 3
CO2 3 2 3 2 3 2 3 3 3
CO3 3 3 3 3 3 3 3 3 3
CO4 3 3 3 3 3 3 3 3 3 3
CO5 3 3 3 3 3 3 3 3 3

90
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VII Sem
(MR21)
Code: L T P
Open Elective-II
Credits: 3 3 - -

91
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VII Semester
(MR-21)
Code: B0549 L T P
Big Data Analytics Lab
Credits: 2 - 1 2
Prerequisites: NIL

Course Objectives:
The course should enable the students to:
1. Optimize business decisions and create competitive advantage with Big data analytics
2. Practice java concepts required for developing map reduce programs.
4. Impart the architectural concepts of Hadoop and introducing map reduce paradigm.
5. Practice programming tools PIG and HIVE in Hadoop eco system.
6. Implement best practices for Hadoop development.

Software Requirement: JDK, Hadoop and R Studio

List of Programs

1. INSTALL VMWARE Installation of VMWare to setup the Hadoop environment and its
ecosystems.
2. HADOOP MODES a. Perform setting up and Installing Hadoop in its three operating
modes. i. Standalone. ii. Pseudo distributed. iii. Fully distributed. b. Use web based tools
to monitor your Hadoop setup.
3. USING LINUX OPERATING SYSTEM Implementing the basic commands of LINUX
Operating System – File/Directory creation, deletion, update operations.
4. FILE MANAGEMENT IN HADOOP 6 Implement the following file management tasks
in Hadoop: i. Adding files and directories ii. Retrieving files iii. Deleting files Hint: A
typical Hadoop workflow creates data files (such as log files) elsewhere and copies them
into HDFS using one of the above command line utilities.
5. MAPREDUCE PROGRAM 1 Run a basic word count Map Reduce program to
understand Map Reduce Paradigm.
6. MAPREDUCE PROGRAM 2 Write a Map Reduce program that mines weather data.
Hint: Weather sensors collecting data every hour at many locations across the globe
gather a large volume of log data, which is a good candidate for analysis with Map
Reduce, since it is semi structured and record-oriented
7. MAPREDUCE PROGRAM 3 Implement matrix multiplication with Hadoop Map
Reduce.
8. PIG LATIN LANGUAGE – PIG Installation of PIG.
9. PIG COMMANDS Write Pig Latin scripts sort, group, join, project, and filter your data.
10. PIG LATIN MODES, PROGRAMS a. Run the Pig Latin Scripts to find Word Count
a. Run the Pig Latin Scripts to find a max temp for each and every year.
11. HIVE Installation of HIVE.
12. HIVE OPERATIONS Use Hive to create, alter, and drop databases, tables, views,
functions, and indexes. Reference Books: Jay Liebowitz, ―Big Data And Business
Analytics Laboratory, CRC Press.

References:
1. Jay Liebowitz, ―Big Data And Business Analytics Laboratory, CRC Press
92
93
Course Outcomes:
1. Understand the installation of VMWare
2. Understand and apply the Perform setting up and Installing Hadoop in its three
operating modes.
3. Implementing the basic commands of LINUX Operating System
4. Implement the file management tasks in Hadoop.
5. Understand Map Reduce Paradigm.
6. Apply Map Reduce program that mines weather data.
7. Implement matrix multiplication with Hadoop MapReduce
8. Apply Map Reduce program that makes the dataset to be compressed.
9. Understand the installation of PIG.
10. Understand Pig Latin scripts sort, group, join, project, and filter your data.
11. Implement the Pig Latin scripts in two different modes
12. Understand the installation of HIVE
13. Apply Hive to create, alter, and drop databases, tables, views, functions, and indexes.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 2 3 1 2
CO2 2 3 2 1 1
CO3 1 3 3 1

94
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VII Semester
(MR-21)
Code: B1214 L T P
Machine Learning Lab
Credits: 1 - - 2

Prerequisites: Computer Programming, Python

Course Objective: The objective of this lab is to get an overview of the various machine
learning techniques and can able to demonstrate them using python.

Course Outcomes: After the completion of the course the student can able to:
 understand complexity of Machine Learning algorithms and their limitations;
 understand modern notions in data analysis-oriented computing;
 be capable of confidently applying common Machine Learning algorithms in practice
and implementing their own;
 Be capable of performing experiments in Machine Learning using real-world data

Software Requirement: Python

List of Programs

1. The probability that it is Friday and that a student is absent is 3 %. Since there are 5
school days in a week, the probability that it is Friday is 20 %. What is the probability
that a student is absent given that today is Friday? Apply Baye’s rule in python to get the
result. (Ans: 15%)
2. Extract the data from database using python
3. Implement k-nearest neighbours classification using python
4. Given the following data, which specify classifications for nine combinations of VAR1
and VAR2 predict a classification for a case where VAR1=0.906 and VAR2=0.606,
using the result of k means clustering with 3 means (i.e., 3 centroids)
VAR1 VAR2 CLASS
1.713 1.586 0
0.180 1.786 1
0.353 1.240 1
0.940 1.566 0
1.486 0.759 1
1.266 1.106 0
1.540 0.419 1
0.459 1.799 1
0.773 0.186 1
5. The following training examples map descriptions of individuals onto high, medium and
low credit-worthiness.
medium skiing design single twenties no -> highRisk
high golf trading married forties yes -> lowRisk
low speedway transport married thirties yes -> medRisk
medium football banking single thirties yes -> lowRisk
high flying media married fifties yes -> highRisk
low football security single twenties no -> medRisk
medium golf media single thirties yes -> medRisk
medium golf transport married forties yes -> lowRisk
95
96
 high skiing banking single thirties yes -> highRisk
low golf unemployed married forties yes -> highRisk

Input attributes are (from left to right) income, recreation, job, status, age-group, home-
owner. Find the unconditional probability of `golf' and the conditional probability of
`single' given `medRisk' in the dataset?
6. Implement linear regression using python.
7. Implement the multivariate linear regression.
8. Implement simple logistic regression and multivariate logistics regression.
9. Implement Naïve Bayes theorem to classify the English text
10. Implement an algorithm to demonstrate the significance of genetic algorithm
11. Implement the finite words classification system using Back-propagation algorithm
12. Implement anomaly detection and recommendation.

REFERENCES:
1. Willi Richert, Luis Pedro Coelho, ―Building Machine Learning with Python‖, Packt
Publishing, 2013.

Course Outcomes:
At the end of the course, students will be able to:
1. Understand the implementation procedures for the machine learning algorithms.
2. Design Java/Python programs for various Learning algorithms.
3. Apply appropriate data sets to the Machine Learning algorithms.
4. Identify and apply Machine Learning algorithms to solve real world problems.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
Programme Outcomes(POs) PSOs
COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 2
CO2 1 1 2 1 1 1 1 1 1 1
CO3 1 1 2 2 2 1 1 1 1 3 1 3 1

97
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VII Sem
(MR21)
Code: B00P1 L T P
Industry Oriented Mini Project
Credits: 2 - - 4

98
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VIII Semester
(MR21)
Code: B6705 Python for Data Science L T P
Credits: 3 (Professional Elective – VI) 3 - -

Course Objectives:
1. Learn concepts, techniques and tools they need to deal with various facets of data
science practice, including data collection and integration
2. Understand the basic types of data and basic statistics
3. Identify the importance of data reduction and data visualization techniques

MODULE I: [09 Periods]

Introduction: Definition of Data Science- Big Data and Data Science hype – and getting past
the hype – Datafication – Current landscape of perspectives – Statistical Inference –
Populations and samples -Statistical modeling, probability distributions, fitting a model –
Over fitting. Basics of R: Introduction, R Environment Setup, Programming with R, Basic
Data Types.

MODULE II: [10 Periods]

Data Types & Statistical Description Types of Data: Attributes and Measurement, What is an
Attribute? The Type of an Attribute, The Different Types of Attributes, Describing Attributes
by the Number of Values, Asymmetric Attributes, Binary Attribute, Nominal Attributes,
Ordinal Attributes, Numeric Attributes, Discrete versus Continuous
Attributes. Basic Statistical Descriptions of Data: Measuring the Central Tendency: Mean,
Median, and Mode, Measuring the Dispersion of Data: Range, Quartiles, Variance, Standard
Deviation, and Inter quartile Range, Graphic Displays of Basic Statistical Descriptions of
Data.

MODULE III: [10 Periods]

Vectors: Creating and Naming Vectors, Vector Arithmetic, Vector sub setting, Matrices:
Creating and Naming Matrices, Matrix Sub setting, Arrays, Class. Factors and Data Frames:
Introduction to Factors: Factor Levels, Summarizing a Factor, Ordered Factors, Comparing
Ordered Factors, Introduction to Data Frame, subsetting of Data Frames, Extending Data
Frames, Sorting Data Frames. Lists: Introduction, creating a List: Creating a Named List,
Accessing List Elements, Manipulating List Elements, Merging Lists, Converting Lists to
Vectors

MODULE IV: [10 Periods]

Conditionals and Control Flow: Relational Operators, Relational Operators and Vectors,
Logical Operators, Logical Operators and Vectors, Conditional Statements. Iterative
Programming in R: Introduction, While Loop, For Loop, Looping Over List. Functions in R:
Introduction, writing a Function in R, Nested Functions, Function Scoping, Recursion,
Loading an R Package, Mathematical Functions in R.

MODULE V: [10 Periods]

Data Reduction: Overview of Data Reduction Strategies, Wavelet Transforms, Principal
Components Analysis, Attribute Subset Selection, Regression and Log-Linear Models:
Parametric Data Reduction, Histograms, Clustering, Sampling, Data Cube Aggregation. Data
Visualization: Pixel-Oriented Visualization Techniques, Geometric Projection Visualization

99
Techniques, Icon-Based Visualization Techniques, Hierarchical Visualization Techniques,
Visualizing Complex Data and Relations.

Course Outcomes: After completion of the course, the student should be able to

1. Understand basic terms what Statistical Inference means.

2. Identify probability distributions commonly used as foundations for statistical
modelling. Fit a model to data
3. describe the data using various statistical measures
4. utilize R elements for data handling
5. perform data reduction and apply visualization techniques.

TEXT BOOKS:
2. Doing Data Science, Straight Talk from The Frontline. Cathy O’Neil and Rachel
Schutt, O’Reilly, 2014
3. Jiawei Han, Micheline Kamber and Jian Pei. Data Mining: Concepts and Techniques, 3rd
ed.
4. The Morgan Kaufmann Series in Data Management Systems.
5. K G Srinivas, G M Siddesh, “Statistical programming in R”, Oxford Publications.

REFERENCE BOOKS:
1. Introduction to Data Mining, Pang-Ning Tan, Vipin Kumar, Michael Steinbanch,
Pearson Education.
2. Brain S. Everitt, “A Handbook of Statistical Analysis Using R”, Second Edition, 4
LLC, 2014.
3. Dalgaard, Peter, “Introductory statistics with R”, Springer Science & Business
Media, 2008.
4. Paul Teetor, “R Cookbook”, O’Reilly, 2011

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 3 2 2 3 2 3
CO2 2 3 2 2
CO3 1 3 3 3 2 1 2 3 3
CO4 1 2 3 3 2
CO5 1 2 3 3

100
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VIII Semester
(MR21)
Code: B0550 DEEP LEARNING L T P
Credits: 3 [Professional Elective - VI] 3 - -

Prerequisites: Machine Learning

Course Objectives:
This course aims to present the mathematical, statistical and computational challenges of
building stable representations for high-dimensional data, such as images, text and data.

MODULE I: INTRODUCTION [09 periods]

Feed forward Neural networks, Gradient descent and the back propagation algorithm. Unit
saturation, aka the vanishing gradient problem, and ways to mitigate it. RelU Heuristics for
avoiding bad local minima. Heuristics for faster training. Nestors accelerated gradient descent.
Regularization. Dropout.

MODULE II: Convolution Neural Networks [09 Periods]

Architectures, convolution / pooling layers, Recurrent Neural Networks LSTM, GRU,
Encoder Decoder architectures

MODULE III:Deep Unsupervised Learning [10 Periods]

Autoencoders (standard, sparse, denoising, and contractive, etc), Variational Autoencoders,
Adversarial Generative Networks, Autoencoder and DBM Attention and memory models,
Dynamic memory networks (2 lectures)

MODULE IV: Applications of Deep Learning to Computer Vision [10 Periods]

Image segmentation, object detection, automatic image captioning, Image, generation with
Generative adversarial networks, video to text with LSTM, models. Attention models for
computer vision tasks. Applications of Deep Learning to NLP: Introduction to NLP and
Vector Space Model of Semantics Word Vector Representations: Continuous Skip-Gram
Model, Continuous Bag-of-Words model (CBOW), Glove, Evaluations and Applications in
word similarity.

MODULE V: Analogy reasoning [10 Periods]

Named Entity Recognition, Opinion Mining using Recurrent Neural Networks Parsing and
Sentiment Analysis using Recursive Neural Networks Sentence Classification using
convolutional Neural Networks Dialogue Generation with LSTMs Applications of Dynamic
Memory Networks in NLP Recent Research in NLP using Deep Learning.

TEXTBOOKS:
1. Ian Goodfellow, YoshuaBengio, Aaron Courville. Deep Learning.

REFERENCES:
1. Duda, R.O., Hart, P.E., and Stork, D.G. Pattern Classi cation. Wiley-Interscience. 2nd
Edition. 2001.
2. Theodoridis, S. and Koutroumbas, K. Pattern Recognition. Edition 4. Academic Press,
2008.
3. Russell, S. and Norvig, N. Arti cial Intelligence: A Modern Approach. Prentice Hall
Series in Artificial Intelligence. 2003.
4. Bishop, C. M. Neural Networks for Pattern Recognition. Oxford University Press. 1995.

101
102
5. Hastie, T., Tibshirani, R. and Friedman, J. The Elements of Statistical Learning. Springer.
2001.
6. Koller, D. and Friedman, N. Probabilistic Graphical Models. MIT Press. 2009.

Course Outcomes:
At the end of the course, students will be able to
1. Examine the significant features of neural networks.
2. Explore the architecture of various neural networks.
3. Analyze the strategy for unsupervised learning.
4. Elaborate the various deep learning applications concerned with computer vision.
5. Investigate various reasoning methods using deep learning techniques.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1 2 1
CO2 1 2 1 2 1 1 1 2
CO3 1 3 2 2 1 1 2 1 2 1
CO4 1 3 3 3 1 2 3 2 2 1
CO5 1 3 3 3 1 2 3 2 3 1

103
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VIII Semester
(MR21)
Code: B0551 Social Networking L T P
Credits: 3 [Professional Elective - VI] 3 - -

COURSE OBJECTIVES
 Formalize different types of entities and relationships as nodes and edges and represent
this information as relational data
 Plan and execute network analytical computations
 Use advanced network analysis software to generate visualizations and perform empirical
investigations of network data
 Interpret and synthesize the meaning of the results with respect to a question, goal, or task
 Collect network data in different ways and from different sources while adhering to legal
standards and ethics standards

MODULE I: [9 Periods]
Social Network Analysis: Preliminaries and definitions, Erdos Number Project, Centrality
measures, Balance and Homophily.

MODULE II: [10 Periods]

Random graph models: Random graphs and alternative models, Models of network growth,
Navigation in social Networks, Cohesive subgroups, Multidimensional Scaling, Structural
equivalence, roles and positions.

MODULE III: [9 Periods]

Network topology and diffusion, Contagion in Networks, Complex contagion, Percolation
and information, Navigation in Networks Revisited.

MODULE IV: [10 Periods]

Small world experiments, small world models, origins of small world, Heavy tails, Small
Diameter, Clustering of connectivity, The ErdosRenyi Model, Clustering Models.

MODULE V: [10 Periods]

Network structure -Important vertices and page rank algorithm, towards rational dynamics in
networks, basics of game theory, Coloring and consensus, biased voting, network formation
games, network structure and equilibrium, behavioral experiments, Spatial and agent-based
models.

COURSE OUTCOMES
After completing the course student should:
 Know basic notation and terminology used in network science
 Be able to visualize, summarize and compare networks

104
 Illustrate basic principles behind network analysis algorithms
 Develop practical skills of network analysis in R programming language
 Be capable of analyzing real work networks

TEXT BOOKS
1. S. Wasserman and K. Faust. “Social Network Analysis: Methods and Applications”,
Cambridge University Press.
2. D. Easley and J. Kleinberg, “Networks, Crowds and Markets: Reasoning about a highly
connected world”, Cambridge University Press, 1st edition,2010

REFERENCE BOOKS
1. Maarten van Steen. “Graph Theory and Complex Networks. An Introduction”, 2010.
2. Reza Zafarani, Mohammed Ali Abbasi, Huan Liu. “Social Media Mining: An
Introduction”. Cambridge University Press 2014.
3. Maksim Tsvetovat and Alexander Kouznetsov. “Social Network Analysis for Startups”.
O’Reilly Media, 2011.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1 2 1
CO2 1 2 1 2 1 1 1 2
CO3 1 3 2 2 1 1 2 1 2 1
CO4 1 3 3 3 1 2 3 2 2 1
CO5 1 3 3 3 1 2 3 2 3 1

105
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech.
Onwards
(Autonomous) VIII Semester
(MR21)
Code: B0552 Human Computer Interaction L T P
Credits: 3 [Professional Elective - VI] 3 - -

COURSE OBJECTIVES
To gain an overview of Human-Computer Interaction (HCI), with an understanding of user
interface design in general, and alternatives to traditional “keyboard and mouse” computing;
become familiar with the vocabulary associated with sensory and cognitive systems as
relevant to task performance by humans; be able to apply models from cognitive psychology
to predicting user performance in various human-computer interaction tasks and recognize
the limits of human performance as they apply to computer operation; appreciate the
importance of a design and evaluation methodology that begins with and maintains a focus on
the user; be familiar with a variety of both conventional and non-traditional user interface
paradigms, the latter including virtual and augmented reality, mobile and wearable
computing, and ubiquitous computing; and understand the social implications of technology
and their ethical responsibilities as engineers in the design of technological systems. Finally,
working in small groups on a product design from start to finish will provide you with
invaluable team-work experience.

MODULE –I [10 PERIODS]

Introduction: Importance of user Interface – definition, importance of good design. Benefits
of good design. A brief history of Screen design.
The graphical user interface – popularity of graphics, the concept of direct manipulation,
graphical system, Characteristics, Web user – Interface popularity, characteristics- Principles
of user interface.

MODULE – II [10 PERIODS]

Design process – Human interaction with computers, importance of human characteristics
human consideration, Human interaction speeds, understanding business junctions.
Screen Designing: Design goals – Screen planning and purpose, organizing screen elements,
ordering of screen data and content – screen navigation and flow – Visually pleasing
composition – amount of information – focus and emphasis – presentation information
simply and meaningfully – information retrieval on web – statistical graphics – Technological
consideration in interface design.

MODULE – III [10 PERIODS]

Windows – New and Navigation schemes selection of window, selection of devices based
and screen- based controls. Components – text and messages, Icons and increases –
Multimedia, colors, uses problems, choosing colors.

106
MODULE – IV [10 PERIODS]
HCI in the software process, The software life cycle Usability engineering Iterative design
and prototyping Design Focus: Prototyping in practice Design rationale Design rules
Principles to support usability Standards Golden rules and heuristics HCI patterns Evaluation
techniques, Goals of evaluation, Evaluation through expert analysis, Evaluation through user
participation, Choosing an evaluation method. Universal design, Universal design principles
Multi-modal interaction

MODULE –V [10 PERIODS]

Cognitive models Goal and task hierarchies Design Focus: GOMS saves money Linguistic
models The challenge of display-based systems Physical and device models Cognitive
architectures Ubiquitous computing and augmented realities Ubiquitous computing
applications research Design Focus: Ambient
Wood – augmenting the physical Virtual and augmented reality Design Focus: Shared
experience Design Focus: Applications of augmented reality Information and data
visualization Design Focus: Getting the size right.

COURSE OUTCOMES
 Ability to apply HCI and principles to interaction design.
 Ability to design certain tools for blind or PH people.

TEXT BOOKS
1. The essential guide to user interface design, Wilbert O Galitz, Wiley Dream
Tech. Modules 1, 2, 3
2. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd,
Russell Bealg, Pearson Education Modules 4,5

REFERENCE BOOKS
1. Designing the user interface. 3rd Edition Ben Shneidermann, Pearson Education Asia.
2. Interaction Design Prece, Rogers, Sharps. Wiley Dreamtech.
3. User Interface Design, Soren Lauesen , Pearson Education.
4. Human –Computer Interaction, D. R. Olsen, Cengage Learning.
5. Human –Computer Interaction, Smith – Atakan, Cengage Learning.

CO- PO, PSO Mapping

(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1 2 1
CO2 1 2 1 2 1 1 1 2
CO3 1 3 2 2 1 1 2 1 2 1
CO4 1 3 3 3 1 2 3 2 2 1
CO5 1 3 3 3 1 2 3 2 3 1

107
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VIII Sem
(MR21)
Code: B0554 Software Quality Assurance And Testing L T P
Credits: 3 (Professional Elective-VI) 3 - -

Prerequisites: Software Engineering

Course Objectives:
This course provides the students to learn, describe and determine the purpose, importance of
Software Quality Assurance (SQA) Framework and its Standards, state the metrics,
measurements and methodology in quality assurance, study the Standards, metrics,
methodologies, establishing policies, SDLC process, techniques and software testing tools
like automated testing tools, Load Runner, Win runner and Rational Testing Tools, Silk test,
Java Testing Tools, J Meter testing, assessing, project management in Client / Server and web
applications by providing security.

Module I: SQA Framework and Quality Standards [10 Periods]

SQA Framework and Standards: What is Quality in SQA, Components, SQA Plan, Steps
to develop and implement a SQA Plan.
Quality Standards: ISO 9000 and Companion ISO Standards, CMM, CMMI, PCMM,
Malcom Balridge, 3 Sigma and 6 Sigma.

Module II: Metrics and Methodologies [10 Periods]

SQA Metrics and Measurement Software Quality Metrics: Product Quality metrics, In-
Process Quality Metrics, Metrics for Software Maintenance, Examples of Metric Programs
Software Quality Metrics methodology: Establish Quality Requirements, Identify Software
quality metrics, Implement software quality metrics, Analyze software metrics results,
Validate Software Quality Metrics, Software Quality Indicators, Fundamentals in
Measurement theory.

Module III: Software Testing Methodologies [9 Periods]

A: Software Testing Strategy and Environment
Establishing testing policy, structured approach to testing, test factors, Economics of System
Development Life Cycle (SDLC) Testing.
B: Software Testing Methodology
Verification and validation, functional and structural testing, work bench concept, eight
considerations in developing testing methodologies, testing tactics checklist.

Module IV: Techniques and Tools [10 Periods]

Software Testing Techniques: Black-Box, Boundary value, Bottom-up, Branch coverage,
Cause-Effect graphing, CRUD, Database, Exception, Gray-Box, Histograms, Inspections,
JADs, Pareto Analysis, Prototyping, Random Testing, Risk-based Testing, Regression
Testing, Structured Walkthroughs, Thread Testing, Performance Testing, White-Box Testing.
Software Testing Tools: Taxonomy of Testing tools, Methodology to evaluate automated
testing tools, Load Runner, Win runner and Rational Testing Tools, Silk test, Java Testing
Tools, J Meter, J MODULE and Cactus.

108
MODULE V: Testing Process and Applications [9 Periods]
Testing Process: Eleven Step Testing Process: Assess Project Management Development
Estimate and Status, Develop Test Plan, Requirements Phase Testing, Design Phase Testing,
Program Phase Testing, Execute Test and Record Results, Acceptance Test, Report test
results, testing software installation, Test software changes, Evaluate Test Effectiveness.
Testing Specialized Systems and Applications: Testing Client/Server and Web
applications, testing off the Shelf Components, Testing Security, Testing a data Warehouse.

TEXT BOOKS
1. William E. Perry, “Effective Methods for Software Testing”, Wiley India, 2nd Edition,
2006.
2. Mordechai Ben-Menachem Garry S. Mar Liss, “Software Quality”, Thomson Learning
Publication, 1997.
3. K.V.K.K. Prasad, “Software Testing Tools”, Dream Tech Publishers, Third Edition
2009.

REFERENCE BOOKS
1. Bories Beizer, “Software Testing Techniques”, 2nd Edition, Dream Tech Press.
2. G.Gord on Schulmeyer, James I. Mc Manus, “Hand book of Software Quality
Assurance”, International Thomson Computer Press, 2nd Edition.

E-RESOURCES
1. https://hientl.files.wordpress.com/2011/12/effective-methods-for-software-testing2.pdf
2. http://www.softwaretestinggenius.com/download/EMFST.pdf
3. https://www.adturtle.biz/LP_TA/index.cfm?T=436379
4. http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=32
5. http://dl.acm.org/citation.cfm?id=2597724
6. http://nptel.ac.in/courses/106101061/18
7. http://ndl.iitkgp.ac.in/document/zyMnqgZQXCJME6wgSqrU87VCGcelOw5mZ-
5ybmrhKB j79VQPP0_ZQHLqcOopPDoaFWhZybCrPg_joTbBU8ZpGA

Course Outcomes:
At the end of the course, students will be able to:
1. Define state-of-the-art, and apply their findings to framework for software testing and
quality assurance.
2. Analyze different approaches to software testing and quality assurance, metrics
measurement, and select optimal solutions for different situations and projects.
3. Demonstrate software testing & quality assurance and apply that knowledge in SDLC,
functional, structural testing, other testing methods their future research & its practice.
4. Evaluate different testing tools and techniques
5. Justify the testing process and its applications in quality assurance for client/server, web
applications with security.

109
 CO- PO, PSO Mapping
(3/2/1 indicates strength of correlation) 3-Strong, 2-Medium, 1-Weak
COs
Programme Outcomes(POs) PSOs
PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 PSO1 PSO2 PSO3
CO1 1 1 1 1 1 1 1 2 1
CO2 1 2 1 2 1 1 1 2
CO3 1 3 2 2 1 1 2 1 2 1
CO4 1 3 3 3 1 2 3 2 2 1
CO5 1 3 3 3 1 2 3 2 3 1

110
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VIII Sem
(MR21)
Code: L T P
Open Elective-III
Credits: 3 3 - -

111
 2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VIII Sem
(MR21)
Code: B00P3 L T P
Technical Seminar on Emerging Areas
Credits: 1 - - 2
2021-22
MALLA REDDY ENGINEERING COLLEGE B.Tech
Onwards
(Autonomous) VIII Sem
(MR21)
Code: B00P2 L T P
MAJOR PROJECT
Credits: 12 - - 24

112