R18 B.Tech.

CSE Syllabus JNTU HYDERABAD

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

B.Tech. in COMPUTER SCIENCE AND ENGINEERING
COURSE STRUCTURE & SYLLABUS (R18)

Applicable From 2018-19 Admitted Batch

I YEAR I SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 MA101BS Mathematics - I 3 1 0 4
2 CH102BS Chemistry 3 1 0 4
3 EE103ES Basic Electrical Engineering 3 0 0 3
4 ME105ES Engineering Workshop 1 0 3 2.5
5 EN105HS English 2 0 0 2
6 CH106BS Engineering Chemistry Lab 0 0 3 1.5
7 EN107HS English Language and Communication Skills Lab 0 0 2 1
8 EE108ES Basic Electrical Engineering Lab 0 0 2 1
Induction Programme
Total Credits 12 2 10 19

I YEAR II SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 MA201BS Mathematics - II 3 1 0 4
2 AP202BS Applied Physics 3 1 0 4
3 CS203ES Programming for Problem Solving 3 1 0 4
4 ME204ES Engineering Graphics 1 0 4 3
5 AP205BS Applied Physics Lab 0 0 3 1.5
6 CS206ES Programming for Problem Solving Lab 0 0 3 1.5
7 *MC209ES Environmental Science 3 0 0 0
Total Credits 13 3 10 18

II YEAR I SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 CS301ES Analog and Digital Electronics 3 0 0 3
2 CS302PC Data Structures 3 1 0 4
3 MA303BS Computer Oriented Statistical Methods 3 1 0 4
4 CS304PC Computer Organization and Architecture 3 0 0 3
5 CS305PC Object Oriented Programming using C++ 2 0 0 2
6 CS306ES Analog and Digital Electronics Lab 0 0 2 1
7 CS307PC Data Structures Lab 0 0 3 1.5
8 CS308PC IT Workshop Lab 0 0 3 1.5
9 CS309PC C++ Programming Lab 0 0 2 1
10 *MC309 Gender Sensitization Lab 0 0 2 0
Total Credits 14 2 12 21

1
 R18 B.Tech. CSE Syllabus JNTU HYDERABAD

II YEAR II SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 CS401PC Discrete Mathematics 3 0 0 3
2 SM402MS Business Economics & Financial Analysis 3 0 0 3
3 CS403PC Operating Systems 3 0 0 3
4 CS404PC Database Management Systems 3 1 0 4
5 CS405PC Java Programming 3 1 0 4
6 CS406PC Operating Systems Lab 0 0 3 1.5
7 CS407PC Database Management Systems Lab 0 0 3 1.5
8 CS408PC Java Programming Lab 0 0 2 1
9 *MC409 Constitution of India 3 0 0 0
Total Credits 18 2 8 21

III YEAR I SEMESTER

Course
S. No. Course Title L T P Credits
Code
1 CS501PC Formal Languages & Automata Theory 3 0 0 3
2 CS502PC Software Engineering 3 0 0 3
3 CS503PC Computer Networks 3 0 0 3
4 CS504PC Web Technologies 3 0 0 3
5 Professional Elective-I 3 0 0 3
6 Professional Elective -II 3 0 0 3
7 CS505PC Software Engineering Lab 0 0 3 1.5
8 CS506PC Computer Networks & Web Technologies Lab 0 0 3 1.5
9 EN508HS Advanced Communication Skills Lab 0 0 2 1
10 *MC510 Intellectual Property Rights 3 0 0 0
Total Credits 21 0 8 22

III YEAR II SEMESTER

Course
S. No. Course Title L T P Credits
Code
1 CS601PC Machine Learning 3 1 0 4
2 CS602PC Compiler Design 3 1 0 4
3 CS603PC Design and Analysis of Algorithms 3 1 0 4
4 Professional Elective – III 3 0 0 3
5 Open Elective-I 3 0 0 3
6 CS604PC Machine Learning Lab 0 0 3 1.5
7 CS605PC Compiler Design Lab 0 0 3 1.5
8 Professional Elective-III Lab 0 0 2 1
9 *MC609 Environmental Science 3 0 0 0
Total Credits 18 3 8 22

IV YEAR I SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 CS701PC Cryptography & Network Security 3 0 0 3
2 CS702PC Data Mining 2 0 0 2

2
 R18 B.Tech. CSE Syllabus JNTU HYDERABAD

3 Professional Elective -IV 3 0 0 3

4 Professional Elective -V 3 0 0 3
5 Open Elective - II 3 0 0 3
6 CS703PC Cryptography & Network Security Lab 0 0 2 1
7 CS704PC Industrial Oriented Mini Project/ Summer Internship 0 0 0 2*
8 CS705PC Seminar 0 0 2 1
9 CS706PC Project Stage - I 0 0 6 3
Total Credits 14 0 10 21

IV YEAR II SEMESTER
Course
S. No. Course Title L T P Credits
Code
1 SM801MS Organizational Behaviour 3 0 0 3
2 Professional Elective - VI 3 0 0 3
3 Open Elective - III 3 0 0 3
4 CS802PC Project Stage - II 0 0 14 7
Total Credits 9 0 14 16

*MC - Environmental Science – Should be Registered by Lateral Entry Students Only.

*MC – Satisfactory/Unsatisfactory

Note: Industrial Oriented Mini Project/ Summer Internship is to be carried out during the summer
vacation between 6th and 7th semesters. Students should submit report of Industrial Oriented Mini
Project/ Summer Internship for evaluation.

Professional Elective - I
CS511PE Information Theory & Coding
CS512PE Advanced Computer Architecture
CS513PE Data Analytics
CS514PE Image Processing
CS515PE Principles of Programming Languages

Professional Elective - II
CS521PE Computer Graphics
CS522PE Advanced Operating Systems
CS523PE Informational Retrieval Systems
CS524PE Distributed Databases
CS525PE Natural Language Processing

Professional Elective - III

CS611PE Concurrent Programming
CS612PE Network Programming
CS613PE Scripting Languages
CS614PE Mobile Application Development
CS615PE Software Testing Methodologies

#
Courses in PE - III and PE - III Lab must be in 1-1 correspondence.

Professional Elective - IV
CS711PE Graph Theory
CS712PE Introduction to Embedded Systems

3
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS701PC: CRYPTOGRAPHY AND NETWORK SECURITY (PC)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3

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

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.

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

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

UNIT - III
Cryptographic Hash Functions: Message Authentication, Secure Hash Algorithm (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 Service, Public – Key
Infrastructure

UNIT - IV
Transport-level Security: Web security considerations, Secure Socket Layer and Transport Layer
Security, HTTPS, Secure Shell (SSH)
Wireless Network Security: Wireless Security, Mobile Device Security, IEEE 802.11 Wireless LAN,
IEEE 802.11i Wireless LAN Security

122
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

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

TEXT BOOKS:
1. Cryptography and Network Security - Principles and Practice: William Stallings, Pearson
Education, 6th Edition
2. Cryptography and Network Security: Atul Kahate, Mc Graw Hill, 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: Forouzan Mukhopadhyay, Mc Graw Hill, 3rd Edition
3. Information Security, Principles, and Practice: Mark Stamp, Wiley India.
4. Principles of Computer Security: WM. Arthur Conklin, Greg White, TMH
5. Introduction to Network Security: Neal Krawetz, CENGAGE Learning
6. Network Security and Cryptography: Bernard Menezes, CENGAGE Learning

123
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS702PC: DATA MINING (PC)

IV Year B.Tech. CSE I - Sem L T P C
2 0 0 2
Pre-Requisites:
 A course on “Database Management Systems”
 Knowledge of probability and statistics
Course Objectives:
 It presents methods for mining frequent patterns, associations, and correlations.
 It then describes methods for data classification and prediction, and data–clustering
approaches.
 It covers mining various types of data stores such as spatial, textual, multimedia, streams.

Course Outcomes:
 Ability to understand the types of the data to be mined and present a general classification of
tasks and primitives to integrate a data mining system.
 Apply preprocessing methods for any given raw data.
 Extract interesting patterns from large amounts of data.
 Discover the role played by data mining in various fields.
 Choose and employ suitable data mining algorithms to build analytical applications
 Evaluate the accuracy of supervised and unsupervised models and algorithms.

UNIT - I
Data Mining: Data–Types of Data–, Data Mining Functionalities– Interestingness Patterns–
Classification of Data Mining systems– Data mining Task primitives –Integration of Data mining system
with a Data warehouse–Major issues in Data Mining–Data Preprocessing.

UNIT - II
Association Rule Mining: Mining Frequent Patterns–Associations and correlations – Mining
Methods– Mining Various kinds of Association Rules– Correlation Analysis– Constraint based
Association mining. Graph Pattern Mining, SPM.

UNIT - III
Classification: Classification and Prediction – Basic concepts–Decision tree induction–Bayesian
classification, Rule–based classification, Lazy learner.

UNIT - IV
Clustering and Applications: Cluster analysis–Types of Data in Cluster Analysis–Categorization of
Major Clustering Methods– Partitioning Methods, Hierarchical Methods– Density–Based Methods,
Grid–Based Methods, Outlier Analysis.

UNIT - V
Advanced Concepts: Basic concepts in Mining data streams–Mining Time–series data––Mining
sequence patterns in Transactional databases– Mining Object– Spatial– Multimedia–Text and Web
data – Spatial Data mining– Multimedia Data mining–Text Mining– Mining the World Wide Web.

TEXT BOOKS:
1. Data Mining – Concepts and Techniques – Jiawei Han & Micheline Kamber, 3rd Edition Elsevier.
2. Data Mining Introductory and Advanced topics – Margaret H Dunham, PEA.

REFERENCE BOOK:
1. Ian H. Witten and Eibe Frank, Data Mining: Practical Machine Learning Tools and Techniques
(Second Edition), Morgan Kaufmann, 2005.

124
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS711PE: GRAPH THEORY (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Pre-requisites:
1. An understanding of Mathematics in general is sufficient.

Course Outcomes:
 Know some important classes of graph theoretic problems;
 Be able to formulate and prove central theorems about trees, matching, connectivity, colouring
and planar graphs;
 Be able to describe and apply some basic algorithms for graphs;
 Be able to use graph theory as a modelling tool.

UNIT - I
Introduction-Discovery of graphs, Definitions, Subgraphs, Isomorphic graphs, Matrix representations
of graphs, Degree of a vertex, Directed walks, paths and cycles, Connectivity in digraphs, Eulerian and
Hamilton digraphs, Eulerian digraphs, Hamilton digraphs, Special graphs, Complements, Larger graphs
from smaller graphs, Union, Sum, Cartesian Product, Composition, Graphic sequences, Graph
theoretic model of the LAN problem, Havel-Hakimi criterion, Realization of a graphic sequence.

UNIT - II
Connected graphs and shortest paths - Walks, trails, paths, cycles, Connected graphs, Distance,
Cut-vertices and cut-edges, Blocks, Connectivity, Weighted graphs and shortest paths, Weighted
graphs, Dijkstra‟s shortest path algorithm, Floyd-Warshall shortest path algorithm.

UNIT - III
Trees- Definitions and characterizations, Number of trees, Cayley‟s formula, Kircho↵-matrix-tree
theorem, Minimum spanning trees, Kruskal‟s algorithm, Prim‟s algorithm, Special classes of graphs,
Bipartite Graphs, Line Graphs, Chordal Graphs, Eulerian Graphs, Fleury‟s algorithm, Chinese Postman
problem, Hamilton Graphs, Introduction, Necessary conditions and sufficient conditions.

UNIT - IV
Independent sets coverings and matchings– Introduction, Independent sets and coverings: basic
equations, Matchings in bipartite graphs, Hall‟s Theorem, K¨onig‟s Theorem, Perfect matchings in
graphs, Greedy and approximation algorithms.

UNIT - V
Vertex Colorings- Basic definitions, Cliques and chromatic number, Mycielski‟s theorem, Greedy
coloring algorithm, Coloring of chordal graphs, Brooks theorem, Edge Colorings, Introduction and
Basics, Gupta-Vizing theorem, Class-1 and Class-2 graphs, Edge-coloring of bipartite graphs, Class-2
graphs, Hajos union and Class-2 graphs, A scheduling problem and equitable edge-coloring.

TEXT BOOKS:
1. J. A. Bondy and U. S. R. Murty. Graph Theory, volume 244 of Graduate Texts in Mathematics.
Springer, 1st edition, 2008.
2. J. A. Bondy and U. S. R. Murty. Graph Theory with Applications.

REFERENCE BOOKS:
1. Lecture Videos: http://nptel.ac.in/courses/111106050/13
2. Introduction to Graph Theory, Douglas B. West, Pearson.

125
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

3. Schaum's Outlines Graph Theory, Balakrishnan, TMH

4. Introduction to Graph Theory, Wilson Robin j, PHI
5. Graph Theory with Applications to Engineering And Computer Science, Narsing Deo, PHI
6. Graphs - An Introductory Approach, Wilson and Watkins

126
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS712PE: INTRODUCTION TO EMBEDDED SYSTEMS (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Pre-requisites:
1. A course on “Digital Logic Design and Microprocessors”
2. A course on “Computer Organization and Architecture”

Course Objectives:
 To provide an overview of principles of Embedded System
 To provide a clear understanding of role of firmware, operating systems in correlation with
hardware systems.

Course Outcomes:
 Expected to understand the selection procedure of processors in the embedded domain.
 Design procedure of embedded firm ware.
 Expected to visualize the role of realtime operating systems in embedded systems.
 Expected to evaluate the correlation between task synchronization and latency issues

UNIT - I
Introduction to Embedded Systems: Definition of Embedded System, Embedded Systems Vs
General Computing Systems, History of Embedded Systems, Classification of Embedded Systems,
Major application areas, Purpose of E bedded Systems, Characteristics and Quality attributes of
Embedded Systems.

UNIT - II
The Typical Embedded System: Core of the Embedded System, Memory, Sensors and Actuators,
Communication Interface, Embedded Firmware, Other System components.

UNIT - III
Embedded Firmware Design and Development: Embedded Firmware Design, Embedded Firmware
Development Languages, Programming in Embedded C.

UNIT - IV
RTOS Based Embedded System Design: Operating System basics, Types of Operating Systems,
Tasks, Process, Threads, Multiprocessing and Multi-tasking, Task Scheduling, Threads-Processes-
Scheduling putting them together, Task Communication, Task Synchronization, Device Drivers, How to
choose an RTOS

UNIT - V
Integration and Testing of Embedded Hardware and Firmware: Integration of Hardware and
Firmware, Boards Bring up
The Embedded System Development Environment: The Integrated Development Environment
(IDE), Types of files generated on Cross-Compilation, Disassembler/Decompiler, Simulators, Emulators
and Debugging, Target Hardware Debugging, Boundary Scan.

TEXT BOOK:
1. Shibu K V, “Introduction to Embedded Systems”, Second Edition, Mc Graw Hill

REFERENCE BOOKS:
1. Rajkamal, Embedded Systems Architecture, Programming and Design, Tata McGraw-Hill

127
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

2. Frank Vahid and Tony Givargis, “Embedded Systems Design” - A Unified Hardware/Software
Introduction, John Wiley
3. Lyla, “Embedded Systems” –Pearson
4. David E. Simon, An Embedded Software Primer, Pearson Education Asia, First Indian Reprint
2000.

128
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS713PE: ARTIFICIAL INTELLIGENCE (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Advanced Data Structures”
3. A course on “Design and Analysis of Algorithms”
4. A course on “Mathematical Foundations of Computer Science”
5. Some background in linear algebra, data structures and algorithms, and probability will all be
helpful

Course Objectives:
 To learn the distinction between optimal reasoning Vs. human like reasoning
 To understand the concepts of state space representation, exhaustive search, heuristic search
together with the time and space complexities.
 To learn different knowledge representation techniques.
 To understand the applications of AI, namely game playing, theorem proving, and machine
learning.

Course Outcomes:
 Ability to formulate an efficient problem space for a problem expressed in natural language.
 Select a search algorithm for a problem and estimate its time and space complexities.
 Possess the skill for representing knowledge using the appropriate technique for a given
problem.
 Possess the ability to apply AI techniques to solve problems of game playing, and machine
learning.

UNIT - I
Problem Solving by Search-I: Introduction to AI, Intelligent Agents
Problem Solving by Search –II: Problem-Solving Agents, Searching for Solutions, Uninformed Search
Strategies: Breadth-first search, Uniform cost search, Depth-first search, Iterative deepening Depth-first
search, Bidirectional search, Informed (Heuristic) Search Strategies: Greedy best-first search, A*
search, Heuristic Functions, Beyond Classical Search: Hill-climbing search, Simulated annealing
search, Local Search in Continuous Spaces, Searching with Non-Deterministic Actions, Searching wih
Partial Observations, Online Search Agents and Unknown Environment .

UNIT - II
Problem Solving by Search-II and Propositional Logic
Adversarial Search: Games, Optimal Decisions in Games, Alpha–Beta Pruning, Imperfect Real-Time
Decisions.
Constraint Satisfaction Problems: Defining Constraint Satisfaction Problems, Constraint
Propagation, Backtracking Search for CSPs, Local Search for CSPs, The Structure of Problems.
Propositional Logic: Knowledge-Based Agents, The Wumpus World, Logic, Propositional Logic,
Propositional Theorem Proving: Inference and proofs, Proof by resolution, Horn clauses and definite
clauses, Forward and backward chaining, Effective Propositional Model Checking, Agents Based on
Propositional Logic.

UNIT - III
Logic and Knowledge Representation
First-Order Logic: Representation, Syntax and Semantics of First-Order Logic, Using First-Order
Logic, Knowledge Engineering in First-Order Logic.

129
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

Inference in First-Order Logic: Propositional vs. First-Order Inference, Unification and Lifting,
Forward Chaining, Backward Chaining, Resolution.
Knowledge Representation: Ontological Engineering, Categories and Objects, Events. Mental Events
and Mental Objects, Reasoning Systems for Categories, Reasoning with Default Information.

UNIT - IV
Planning
Classical Planning: Definition of Classical Planning, Algorithms for Planning with State-Space Search,
Planning Graphs, other Classical Planning Approaches, Analysis of Planning approaches.
Planning and Acting in the Real World: Time, Schedules, and Resources, Hierarchical Planning,
Planning and Acting in Nondeterministic Domains, Multi agent Planning.

UNIT - V
Uncertain knowledge and Learning
Uncertainty: Acting under Uncertainty, Basic Probability Notation, Inference Using Full Joint
Distributions, Independence, Bayes’ Rule and Its Use,
Probabilistic Reasoning: Representing Knowledge in an Uncertain Domain, The Semantics of
Bayesian Networks, Efficient Representation of Conditional Distributions, Approximate Inference in
Bayesian Networks, Relational and First-Order Probability, Other Approaches to Uncertain Reasoning;
Dempster-Shafer theory.
Learning: Forms of Learning, Supervised Learning, Learning Decision Trees. Knowledge in Learning:
Logical Formulation of Learning, Knowledge in Learning, Explanation-Based Learning, Learning Using
Relevance Information, Inductive Logic Programming.

TEXT BOOK:
1. Artificial Intelligence A Modern Approach, Third Edition, Stuart Russell and Peter Norvig,
Pearson Education.

REFERENCE BOOKS:
1. Artificial Intelligence, 3rd Edn, E. Rich and K.Knight (TMH)
2. Artificial Intelligence, 3rd Edn., Patrick Henny Winston, Pearson Education.
3. Artificial Intelligence, Shivani Goel, Pearson Education.
4. Artificial Intelligence and Expert systems – Patterson, Pearson Education.

130
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS714PE: CLOUD COMPUTING (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Pre-requisites:
1. A course on “Computer Networks”
2. A course on “Operating Systems”
3. A course on “Distributed Systems”

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

Course Outcomes:
 Ability to understand various service delivery models of a cloud computing architecture.
 Ability to understand the ways in which the cloud can be programmed and deployed.
 Understanding cloud service providers.

UNIT - I
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.

UNIT - II
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

UNIT - III
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.

UNIT - IV
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.

UNIT V
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

131
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

TEXT BOOK:
1. Essentials of cloud Computing: K. Chandrasekhran, CRC press, 2014

REFERENCE BOOKS:
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, rp 2011.

132
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS715PE: AD-HOC & SENSOR NETWORKS (Professional Elective - IV)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Prerequisites
1. A course on “Computer Networks”
2. A course on “Mobile Computing”
Course Objectives:
 To understand the concepts of sensor networks
 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

Course Outcomes:
 Ability to understand the state-of-the-art research in the emerging subject of Ad Hoc and
Wireless Sensor Networks
 Ability to solve the issues in real-time application development based on ASN.
 Ability to conduct further research in the domain of ASN

UNIT - I
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.

UNIT - II
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.

UNIT - III
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

UNIT - IV
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.

UNIT - V
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.

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).

133
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS721PE: ADVANCED ALGORITHMS (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Pre-requisites:
1. A course on “Computer Programming & Data Structures”
2. A course on “Advanced Data Structures & Algorithms”

Course Objectives:
 Introduces the recurrence relations for analyzing the algorithms
 Introduces the graphs and their traversals.
 Describes major algorithmic techniques (divide-and-conquer, greedy, dynamic programming,
Brute Force, Transform and Conquer approaches) and mention problems for which each
technique is appropriate;
 Describes how to evaluate and compare different algorithms using worst-case, average-case
and best-case analysis.
 Introduces string matching algorithms
 Introduces linear programming.

Course Outcomes:
 Ability to analyze the performance of algorithms
 Ability to choose appropriate data structures and algorithm design methods for a specified
application
 Ability to understand how the choice of data structures and the algorithm design methods
impact the performance of programs

UNIT - I
Introduction: Role of Algorithms in computing, Order Notation, Recurrences, Probabilistic Analysis
and Randomized Algorithms. Sorting and Order Statistics: Heap sort, Quick sort and Sorting in Linear
Time.
Advanced Design and Analysis Techniques: Dynamic Programming- Matrix chain Multiplication,
Longest common Subsequence and optimal binary Search trees.

UNIT - II
Greedy Algorithms - Huffman Codes, Activity Selection Problem. Amortized Analysis.
Graph Algorithms: Topological Sorting, Minimum Spanning trees, Single Source Shortest Paths,
Maximum Flow algorithms.

UNIT - III
Sorting Networks: Comparison Networks, Zero-one principle, bitonic Sorting Networks, Merging
Network, Sorting Network.
Matrix Operations- Strassen's Matrix Multiplication, Inverting matrices, Solving system of linear
Equations

UNIT - IV
String Matching: Naive String Matching, Rabin-Karp algorithm, matching with finite Automata, Knuth-
Morris - Pratt algorithm.

UNIT- V
NP-Completeness and Approximation Algorithms: Polynomial time, polynomial time verification,
NP-Completeness and reducibility, NP-Complete problems. Approximation Algorithms- Vertex cover
Problem, Travelling Sales person problem

134
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

TEXT BOOK:
1. Introduction to Algorithms,'' T.H. Cormen, C.E. Leiserson, R.L. Rivest, and C. Stein, Third
Edition, PHI.

REFERENCE BOOKS:
1. Fundamentals of Computer Algorithms, Ellis Horowitz, Satraj Sahni and Rajasekharam,
Galgotia publications pvt. Ltd.
2. Design and Analysis Algorithms - Parag Himanshu Dave, Himanshu Bhalchandra Dave
Publisher: Pearson
3. Algorithm Design: Foundations, Analysis and Internet examples, M.T. Goodrich and R.
Tomassia, John Wiley and sons.
4. Data structures and Algorithm Analysis in C++, Allen Weiss, Second edition, Pearson
education.

135
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS722PE: REAL TIME SYSTEMS (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Prerequisite: Computer Organization and Operating System

Course Objectives:
 To provide broad understanding of the requirements of Real Time Operating Systems.
 To make the student understand, applications of these Real Time features using case
studies.

Course Outcomes:
 Be able to explain real-time concepts such as preemptive multitasking, task priorities, priority
inversions, mutual exclusion, context switching, and synchronization, interrupt latency and
response time, and semaphores.
 Able describe how a real-time operating system kernel is implemented.
 Able explain how tasks are managed.
 Explain how the real-time operating system implements time management.
 Discuss how tasks can communicate using semaphores, mailboxes, and queues.
 Be able to implement a real-time system on an embedded processor.
 Be able to work with real time operating systems like RT Linux, Vx Works, MicroC /OSII, Tiny
Os

UNIT – I
Introduction: Introduction to UNIX/LINUX, Overview of Commands, File I/O,( open, create, close,
lseek, read, write), Process Control ( fork, vfork, exit, wait, waitpid, exec).

UNIT - II
Real Time Operating Systems: Brief History of OS, Defining RTOS, The Scheduler, Objects, Services,
Characteristics of RTOS, Defining a Task, asks States and Scheduling, Task Operations, Structure,
Synchronization, Communication and Concurrency. Defining Semaphores, Operations and Use,
Defining Message Queue, States, Content, Storage, Operations and Use

UNIT - III
Objects, Services and I/O: Pipes, Event Registers, Signals, Other Building Blocks, Component
Configuration, Basic I/O Concepts, I/O Subsystem

UNIT - IV
Exceptions, Interrupts and Timers: Exceptions, Interrupts, Applications, Processing of Exceptions
and Spurious Interrupts, Real Time Clocks, Programmable Timers, Timer Interrupt Service Routines
(ISR), Soft Timers, Operations.

UNIT - V
Case Studies of RTOS: RT Linux, MicroC/OS-II, Vx Works, Embedded Linux, and Tiny OS.

TEXT BOOK:
1. Real Time Concepts for Embedded Systems – Qing Li, Elsevier, 2011

REFERENCE BOOKS:
1. Embedded Systems- Architecture, Programming and Design by Rajkamal, 2007, TMH.
2. Advanced UNIX Programming, Richard Stevens
3. Embedded Linux: Hardware, Software and Interfacing – Dr. Craig Hollabaugh

136
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS723PE: SOFT COMPUTING (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P C
3 0 0 3
Course Objectives:
 Familiarize with soft computing concepts
 Introduce and use the idea of fuzzy logic and use of heuristics based on human experience
 Familiarize the Neuro-Fuzzy modeling using Classification and Clustering techniques
 Learn the concepts of Genetic algorithm and its applications
 Acquire the knowledge of Rough Sets.

Course Outcomes: On completion of this course, the students will be able to:
 Identify the difference between Conventional Artificial Intelligence to Computational
Intelligence.
 Understand fuzzy logic and reasoning to handle and solve engineering problems
 Apply the Classification and clustering techniques on various applications.
 Understand the advanced neural networks and its applications
 Perform various operations of genetic algorithms, Rough Sets.
 Comprehend various techniques to build model for various applications

UNIT - I
Introduction to Soft Computing: Evolutionary Computing, "Soft" computing versus "Hard" computing,
Soft Computing Methods, Recent Trends in Soft Computing, Characteristics of Soft computing,
Applications of Soft Computing Techniques.

UNIT-II
Fuzzy Systems: Fuzzy Sets, Fuzzy Relations, Fuzzy Logic, Fuzzy Rule-Based Systems

UNIT-III
Fuzzy Decision Making, Particle Swarm Optimization

UNIT-IV
Genetic Algorithms: Basic Concepts, Basic Operators for Genetic Algorithms, Crossover and Mutation
Properties, Genetic Algorithm Cycle, Fitness Function, Applications of Genetic Algorithm.

UNIT-V
Rough Sets, Rough Sets, Rule Induction, and Discernibility Matrix, Integration of Soft Computing
Techniques.

TEXT BOOK:
1. Soft Computing – Advances and Applications - Jan 2015 by B.K. Tripathy and J. Anuradha –
Cengage Learning

REFERENCE BOOKS:
1. S. N. Sivanandam & S. N. Deepa, “Principles of Soft Computing”, 2nd edition, Wiley India, 2008.
2. David E. Goldberg, “Genetic Algorithms-In Search, optimization and Machine learning”,
Pearson Education.
3. J. S. R. Jang, C.T. Sun and E.Mizutani, “Neuro-Fuzzy and Soft Computing”, Pearson
Education, 2004.
4. G.J. Klir & B. Yuan, “Fuzzy Sets & Fuzzy Logic”, PHI, 1995.
5. Melanie Mitchell, “An Introduction to Genetic Algorithm”, PHI, 1998.
6. Timothy J. Ross, “Fuzzy Logic with Engineering Applications”, McGraw- Hill International
editions, 1995

137
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS724PE: INTERNET OF THINGS (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P C
3 0 0 3
Course Objectives:
 To introduce the terminology, technology and its applications
 To introduce the concept of M2M (machine to machine) with necessary protocols
 To introduce the Python Scripting Language which is used in many IoT devices
 To introduce the Raspberry PI platform, that is widely used in IoT applications
 To introduce the implementation of web based services on IoT devices

Course Outcomes:
 Interpret the impact and challenges posed by IoT networks leading to new architectural models.
 Compare and contrast the deployment of smart objects and the technologies to connect them
to network.
 Appraise the role of IoT protocols for efficient network communication.
 Elaborate the need for Data Analytics and Security in IoT.
 Illustrate different sensor technologies for sensing real world entities and identify the
applications of IoT in Industry.

UNIT - I
Introduction to Internet of Things –Definition and Characteristics of IoT, Physical Design of IoT – IoT
Protocols, IoT communication models, Iot Communication APIs IoT enabaled Technologies – Wireless
Sensor Networks, Cloud Computing, Big data analytics, Communication protocols, Embedded
Systems, IoT Levels and Templates Domain Specific IoTs – Home, City, Environment, Energy, Retail,
Logistics, Agriculture, Industry, health and Lifestyle

UNIT - II
IoT and M2M – Software defined networks, network function virtualization, difference between SDN and
NFV for IoT Basics of IoT System Management with NETCOZF, YANG- NETCONF, YANG, SNMP
NETOPEER

UNIT - III
Introduction to Python - Language features of Python, Data types, data structures, Control of flow,
functions, modules, packaging, file handling, data/time operations, classes, Exception handling Python
packages - JSON, XML, HTTPLib, URLLib, SMTPLib

UNIT - IV
IoT Physical Devices and Endpoints - Introduction to Raspberry PI-Interfaces (serial, SPI, I2C)
Programming – Python program with Raspberry PI with focus of interfacing external gadgets, controlling
output, reading input from pins.

UNIT - V
IoT Physical Servers and Cloud Offerings – Introduction to Cloud Storage models and communication
APIs Webserver – Web server for IoT, Cloud for IoT, Python web application framework Designing a
RESTful web API

TEXT BOOKS:
1. Internet of Things - A Hands-on Approach, Arshdeep Bahga and Vijay Madisetti, Universities
Press, 2015, ISBN: 9788173719547
2. Getting Started with Raspberry Pi, Matt Richardson & Shawn Wallace, O'Reilly (SPD), 2014,
ISBN: 9789350239759

138
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS725PE: SOFTWARE PROCESS & PROJECT MANAGEMENT (Professional Elective - V)

IV Year B.Tech. CSE I -Sem L T P C

3 0 0 3
Course Objectives:
 To acquire knowledge on software process management
 To acquire managerial skills for software project development
 To understand software economics

Course Outcomes:
 Gain knowledge of software economics, phases in the life cycle of software development,
project organization, project control and process instrumentation
 Analyze the major and minor milestones, artifacts and metrics from management and technical
perspective
 Design and develop software product using conventional and modern principles of software
project management

UNIT - I
Software Process Maturity
Software maturity Framework, Principles of Software Process Change, Software Process Assessment,
The Initial Process, The Repeatable Process, The Defined Process, The Managed Process, The
Optimizing Process.
Process Reference Models
Capability Maturity Model (CMM), CMMI, PCMM, PSP, TSP).

UNIT - II
Software Project Management Renaissance
Conventional Software Management, Evolution of Software Economics, Improving Software
Economics, The old way and the new way.
Life-Cycle Phases and Process artifacts
Engineering and Production stages, inception phase, elaboration phase, construction phase, transition
phase, artifact sets, management artifacts, engineering artifacts and pragmatic artifacts, model-based
software architectures.

UNIT - III
Workflows and Checkpoints of process
Software process workflows, Iteration workflows, Major milestones, minor milestones, periodic status
assessments.
Process Planning
Work breakdown structures, Planning guidelines, cost and schedule estimating process, iteration
planning process, Pragmatic planning.

UNIT - IV
Project Organizations
Line-of- business organizations, project organizations, evolution of organizations, process automation.
Project Control and process instrumentation
The seven-core metrics, management indicators, quality indicators, life-cycle expectations, Pragmatic
software metrics, metrics automation.

UNIT - V
CCPDS-R Case Study and Future Software Project Management Practices
Modern Project Profiles, Next-Generation software Economics, Modern Process Transitions.

139
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

TEXT BOOKS:
1. Managing the Software Process, Watts S. Humphrey, Pearson Education
2. Software Project Management, Walker Royce, Pearson Education

REFERENCE BOOKS:
1. An Introduction to the Team Software Process, Watts S. Humphrey, Pearson Education, 2000
2. Process Improvement essentials, James R. Persse, O’Reilly, 2006
3. Software Project Management, Bob Hughes & Mike Cotterell, fourth edition, TMH, 2006
4. Applied Software Project Management, Andrew Stellman & Jennifer Greene, O’Reilly, 2006.
5. Head First PMP, Jennifer Greene & Andrew Stellman, O’Reilly, 2007
6. Software Engineering Project Management, Richard H. Thayer & Edward Yourdon,
2nd edition, Wiley India, 2004.
7. Agile Project Management, Jim Highsmith, Pearson education, 2004.

140
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS703PC: CRYPTOGRAPHY AND NETWORK SECURITY LAB (PC)

IV Year B.Tech. CSE I -Sem L T P C

0 0 2 1

List of Experiments:
1. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program
should XOR each character in this string with 0 and displays the result.

2. Write a C program that contains a string (char pointer) with a value ‘Hello world’. The program
should AND or and XOR each character in this string with 127 and display the result.

3. Write a Java program to perform encryption and decryption using the following algorithms
a. Ceaser cipher b. Substitution cipher c. Hill Cipher

4. Write a C/JAVA program to implement the DES algorithm logic.

5. Write a C/JAVA program to implement the Blowfish algorithm logic.

6. Write a C/JAVA program to implement the Rijndael algorithm logic.

7. Write the RC4 logic in Java Using Java cryptography; encrypt the text “Hello world” using
Blowfish. Create your own key using Java key tool.

8. Write a Java program to implement RSA algorithm.

9. Implement the Diffie-Hellman Key Exchange mechanism using HTML and JavaScript.

10. Calculate the message digest of a text using the SHA-1 algorithm in JAVA.

11. Calculate the message digest of a text using the MD5 algorithm in JAVA.

141
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

SM801MS: ORGANIZATIONAL BEHAVIOUR (PC)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 3
Course Objectives: The objective of the course is to provide the students with the conceptual
framework and the theories underlying Organizational Behaviour.

UNIT- I:
Introduction to OB - Definition, Nature and Scope – Environmental and organizational context – Impact
of IT, globalization, Diversity, Ethics, culture, reward systems and organizational design on
Organizational Behaviour. Cognitive Processes-I: Perception and Attribution: Nature and importance of
Perception – Perceptual selectivity and organization – Social perception – Attribution Theories – Locus
of control –Attribution Errors –Impression Management.

UNIT-II:
Cognitive Processes-II: Personality and Attitudes – Personality as a continuum – Meaning of personality
- Johari Window and Transactional Analysis - Nature and Dimension of Attitudes – Job satisfaction and
organizational commitment-Motivational needs and processes- Work-Motivation Approaches Theories
of Motivation- Motivation across cultures - Positive organizational behaviour: Optimism – Emotional
intelligence – Self-Efficacy.

UNIT- III:
Dynamics of OB-I: Communication – types – interactive communication in organizations – barriers to
communication and strategies to improve the follow of communication - Decision Making: Participative
decision-making techniques – creativity and group decision making. Dynamics of OB –II Stress and
Conflict: Meaning and types of stress –Meaning and types of conflict - Effect of stress and intra-
individual conflict - strategies to cope with stress and conflict.

UNIT- IV:
Dynamics of OB –III Power and Politics: Meaning and types of power – empowerment - Groups Vs.
Teams – Nature of groups – dynamics of informal groups – dysfunctions of groups and teams – teams
in modern work place.

UNIT- V:
Leading High performance: Job design and Goal setting for High performance- Quality of Work Life-
Socio technical Design and High-performance work practices - Behavioural performance management:
reinforcement and punishment as principles of Learning –Process of Behavioural modification -
Leadership theories - Styles, Activities and skills of Great leaders.

REFERENCE BOOKS:
1. Luthans, Fred: Organizational Behaviour 10/e, McGraw-Hill, 2009
2. McShane: Organizational Behaviour, 3e, TMH, 2008
3. Nelson: Organizational Behaviour, 3/e, Thomson, 2008.
4. Newstrom W. John & Davis Keith, Organisational Behaviour-- Human Behaviour at Work, 12/e,
TMH, New Delhi, 2009.
5. Pierce and Gardner: Management and Organisational Behaviour: An Integrated perspective,
Thomson, 2009.
6. Robbins, P. Stephen, Timothy A. Judge: Organisational Behaviour, 12/e, PHI/Pearson, New
Delhi, 2009.
7. Pareek Udai: Behavioural Process at Work: Oxford & IBH, New Delhi, 2009.
8. Schermerhorn: Organizational Behaviour 9/e, Wiley, 2008.
9. Hitt: Organizational Behaviour, Wiley, 2008

142
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

10. Aswathappa: Organisational Behaviour, 7/e, Himalaya, 2009

11. Mullins: Management and Organisational Behaviour, Pearson, 2008.
12. McShane, Glinow: Organisational Behaviour--Essentials, TMH, 2009.
13. Ivancevich: Organisational Behaviour and Management, 7/e, TMH, 2008.

143
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS811PE: COMPUTATIONAL COMPLEXITY (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 3
Prerequisites:
1. A course on “Computer Programming and Data Structures”
2. A course on “Discrete Structures and Graph Theory”

Course Objectives:
 Introduces to theory of computational complexity classes
 Discuss about algorithmic techniques and application of these techniques to problems.
 Introduce to randomized algorithms and discuss how effective they are in reducing time and
space complexity.
 Discuss about Graph based algorithms and approximation algorithms
 Discuss about search trees

Course Outcomes:
 Ability to classify decision problems into appropriate complexity classes
 Ability to specify what it means to reduce one problem to another, and construct reductions for
simple examples.
 Ability to classify optimization problems into appropriate approximation complexity classes
 Ability to choose appropriate data structure for the given problem
 Ability to choose and apply appropriate design method for the given problem

UNIT - I
Computational Complexity: Polynomial time and its justification, Nontrivial examples of polynomial-time
algorithms, the concept of reduction (reducibility), Class P Class NP and NP- Completeness, The P
versus NP problem and why it’s hard

UNIT - II
Algorithmic paradigms: Dynamic Programming – Longest common subsequence, matrix chain
multiplication, knapsack problem, Greedy – 0-1 knapsack, fractional knapsack, scheduling problem,
Huffman coding, MST, Branch-and-bound – travelling sales person problem, 0/1 knapsack problem,
Divide and Conquer – Merge sort, binary search, quick sort.

UNIT - III
Randomized Algorithms: Finger Printing, Pattern Matching, Graph Problems, Algebraic Methods,
Probabilistic Primality Testing, De-Randomization Advanced Algorithms.

UNIT - IV
Graph Algorithms: Shortest paths, Flow networks, Spanning Trees; Approximation algorithms,
Randomized algorithms. Approximation algorithms: Polynomial Time Approximation Schemes.

UNIT - V
Advanced Data Structures and applications: Decision Trees and Circuits, B-Trees, AVL Trees, Red and
Black trees, Dictionaries and tries, Maps, Binomial Heaps, Fibonacci Heaps, Disjoint sets, Union by
Rank and Path Compression

TEXT BOOKS:
1. T. Cormen, C. Leiserson, R. Rivest and C. Stein, Introduction to Algorithms, Third Edition,
McGraw-Hill, 2009.
2. R. Motwani and P. Raghavan, Randomized Algorithms, Cambridge University Press, 1995.

144
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

3. J. J. McConnell, Analysis of Algorithms: An Active Learning Approach, Jones & Bartlett

Publishers, 2001.
4. D. E. Knuth, Art of Computer Programming, Volume 3, Sorting and Searching, Second Edition,
Addison-Wesley Professional, 1998.
5. S. Dasgupta, C. H. Papadimitriou and U. V. Vazirani, Algorithms, McGraw-Hill, 2008.

145
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS812PE: DISTRIBUTED SYSTEMS (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 3

Prerequisites
1. A course on “Operating Systems”
2. A course on “Computer Organization & Architecture”

Course Objectives
 This course provides an insight into Distributed systems.
 Topics include- Peer to Peer Systems, Transactions and Concurrency control, Security and
Distributed shared memory

Course Outcomes
 Ability to understand Transactions and Concurrency control.
 Ability to understand Security issues.
 Understanding Distributed shared memory.
 Ability to design distributed systems for basic level applications.

UNIT - I
Characterization of Distributed Systems-Introduction, Examples of Distributed systems, Resource
sharing and web, challenges, System models -Introduction, Architectural and Fundamental models,
Networking and Internetworking, Interprocess Communication, Distributed objects and Remote
Invocation-Introduction, Communication between distributed objects, RPC, Events and notifications,
Case study-Java RMI.

UNIT - II
Operating System Support- Introduction, OS layer, Protection, Processes and Threads, Communication
and Invocation, Operating system architecture, Distributed File Systems-Introduction, File Service
architecture.

UNIT - III
Peer to Peer Systems–Introduction, Napster and its legacy, Peer to Peer middleware, Routing overlays,
Overlay case studies-Pastry, Tapestry, Application case studies-Squirrel, OceanStore.
Time and Global States-Introduction, Clocks, events and Process states, Synchronizing physical
clocks, logical time and logical clocks, global states, distributed debugging.
Coordination and Agreement-Introduction, Distributed mutual exclusion, Elections, Multicast
communication, consensus and related problems.

UNIT - IV
Transactions and Concurrency Control-Introduction, Transactions, Nested Transactions, Locks,
Optimistic concurrency control, Timestamp ordering. Distributed Transactions-Introduction, Flat and
Nested Distributed Transactions, Atomic commit protocols, Concurrency control in distributed
transactions, Distributed deadlocks, Transaction recovery.

UNIT - V
Replication-Introduction, System model and group communication, Fault tolerant services,
Transactions with replicated data.
Distributed shared memory, Design and Implementation issues, Consistency models.

146
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

TEXT BOOKS:
1. Distributed Systems Concepts and Design, G Coulouris, J Dollimore and T Kindberg, Fourth
Edition, Pearson Education.
2. Distributed Systems, S.Ghosh, Chapman & Hall/CRC, Taylor & Francis Group, 2010.

REFERENCE BOOKS:
1. Distributed Systems – Principles and Paradigms, A.S. Tanenbaum and M.V. Steen, Pearson
Education.
2. Distributed Computing, Principles, Algorithms and Systems, Ajay D. Kshemakalyani and
Mukesh Singhal, Cambridge, rp 2010.

147
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS813PE: NEURAL NETWORKS & DEEP LEARNING (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 3
Course Objectives:
 To introduce the foundations of Artificial Neural Networks
 To acquire the knowledge on Deep Learning Concepts
 To learn various types of Artificial Neural Networks
 To gain knowledge to apply optimization strategies

Course Outcomes:
 Ability to understand the concepts of Neural Networks
 Ability to select the Learning Networks in modeling real world systems
 Ability to use an efficient algorithm for Deep Models
 Ability to apply optimization strategies for large scale applications

UNIT-I
Artificial Neural Networks Introduction, Basic models of ANN, important terminologies, Supervised
Learning Networks, Perceptron Networks, Adaptive Linear Neuron, Back-propagation Network.
Associative Memory Networks. Training Algorithms for pattern association, BAM and Hopfield
Networks.

UNIT-II
Unsupervised Learning Network- Introduction, Fixed Weight Competitive Nets, Maxnet, Hamming
Network, Kohonen Self-Organizing Feature Maps, Learning Vector Quantization, Counter Propagation
Networks, Adaptive Resonance Theory Networks. Special Networks-Introduction to various networks.

UNIT - III
Introduction to Deep Learning, Historical Trends in Deep learning, Deep Feed - forward networks,
Gradient-Based learning, Hidden Units, Architecture Design, Back-Propagation and Other
Differentiation Algorithms

UNIT - IV
Regularization for Deep Learning: Parameter norm Penalties, Norm Penalties as Constrained
Optimization, Regularization and Under-Constrained Problems, Dataset Augmentation, Noise
Robustness, Semi-Supervised learning, Multi-task learning, Early Stopping, Parameter Typing and
Parameter Sharing, Sparse Representations, Bagging and other Ensemble Methods, Dropout,
Adversarial Training, Tangent Distance, tangent Prop and Manifold, Tangent Classifier

UNIT - V
Optimization for Train Deep Models: Challenges in Neural Network Optimization, Basic Algorithms,
Parameter Initialization Strategies, Algorithms with Adaptive Learning Rates, Approximate Second-
Order Methods, Optimization Strategies and Meta-Algorithms
Applications: Large-Scale Deep Learning, Computer Vision, Speech Recognition, Natural Language
Processing

TEXT BOOKS:
1. Deep Learning: An MIT Press Book By Ian Goodfellow and Yoshua Bengio and Aaron Courville
2. Neural Networks and Learning Machines, Simon Haykin, 3rd Edition, Pearson Prentice Hall.

148
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS814PE: HUMAN COMPUTER INTERACTION (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 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.

Course Outcomes:
 Ability to apply HCI and principles to interaction design.
 Ability to design certain tools for blind or PH people.

UNIT - I
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.

UNIT - II
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.

UNIT- III
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.

UNIT- IV
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

UNIT- V
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

149
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

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.

TEXT BOOKS:
1. The essential guide to user interface design, Wilbert O Galitz, Wiley Dream Tech. Units 1, 2, 3
2. Human – Computer Interaction. Alan Dix, Janet Fincay, Gre Goryd, Abowd, Russell Bealg,
Pearson Education Units 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.

150
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

CS815PE: CYBER FORENSICS (Professional Elective - VI)

IV Year B.Tech. CSE II -Sem L T P C

3 0 0 3
Prerequisites: Network Security
Course Objectives:
 A brief explanation of the objective is to provide digital evidences which are obtained from digital
media.
 In order to understand the objectives of computer forensics, first of all, people have to recognize
the different roles computer plays in a certain crime.
 According to a snippet from the United States Security Service, the functions computer has in
different kinds of crimes.

Course Outcomes:
 Students will understand the usage of computers in forensic, and how to use various forensic
tools for a wide variety of investigations.
 It gives an opportunity to students to continue their zeal in research in computer forensics

UNIT- I
Introduction of Cybercrime: Types, The Internet spawns crime, Worms versus viruses, Computers' roles
in crimes, Introduction to digital forensics, Introduction to Incident - Incident Response Methodology –
Steps - Activities in Initial Response, Phase after detection of an incident

UNIT-II
Initial Response and forensic duplication, Initial Response & Volatile Data Collection from Windows
system -Initial Response & Volatile Data Collection from Unix system – Forensic Duplication: Forensic
duplication: Forensic Duplicates as Admissible Evidence, Forensic Duplication Tool Requirements,
Creating a Forensic. Duplicate/Qualified Forensic Duplicate of a Hard Drive

UNIT - III
Forensics analysis and validation: Determining what data to collect and analyze, validating forensic
data, addressing data-hiding techniques, performing remote acquisitions
Network Forensics: Network forensics overview, performing live acquisitions, developing standard
procedures for network forensics, using network tools, examining the honeynet project.

UNIT -IV
Current Forensic tools: evaluating computer forensic tool needs, computer forensics software tools,
computer forensics hardware tools, validating and testing forensics software E-Mail Investigations:
Exploring the role of e-mail in investigation, exploring the roles of the client and server in e-mail,
investigating e-mail crimes and violations, understanding e-mail servers, using specialized e-mail
forensic tools.
Cell phone and mobile device forensics: Understanding mobile device forensics, understanding
acquisition procedures for cell phones and mobile devices.

UNIT- V
Working with Windows and DOS Systems: understanding file systems, exploring Microsoft File
Structures, Examining NTFS disks, Understanding whole disk encryption, windows registry, Microsoft
startup tasks, MS-DOS startup tasks, virtual machines.

TEXT BOOKS:
1. Kevin Mandia, Chris Prosise, “Incident Response and computer forensics”, Tata McGraw Hill,
2006.

151
R18 B.Tech. CSE Syllabus JNTU HYDERABAD

2. Computer Forensics, Computer Crime Investigation by John R. Vacca, Firewall Media, New
Delhi.
3. Computer Forensics and Investigations by Nelson, Phillips Enfinger, Steuart, CENGAGE
Learning

REFERENCE BOOKS:
1. Real Digital Forensics by Keith J. Jones, Richard Bejtiich, Curtis W. Rose, Addison- Wesley
Pearson Education
2. Forensic Compiling, A Tractitioneris Guide by Tony Sammes and Brian Jenkinson, Springer
International edition.

152