Cse Ds 3 2 Sem Cs Syllabus Ug r20
Cse Ds 3 2 Sem Cs Syllabus Ug r20
2020 – 21
Course Objectives:
• To provide insight about networks, topologies, and the key concepts.
• To gain comprehensive knowledge about the layered communication architectures (OSI and TCP/IP)
and its functionalities.
• To understand the principles, key protocols, design issues, and significance of each layers in ISO and
TCP/IP.
• To know the basic concepts of network services and various network applications.
Course Outcomes:
By the end of the course, the student will be able to
x Demonstrate different network models for networking links OSI, TCP/IP, B-ISDN, N-BISDN and get
knowledge about various communication techniques, methods and protocol standards.
x Discuss different transmission media and different switching networks.
x Analyze data link layer services, functions and protocols like HDLC and PPP.
x Compare and Classify medium access control protocols like ALOHA, CSMA, CSMA/CD, CSMA/CA,
Polling, Token passing, FDMA, TDMA, CDMA protocols
x Determine application layer services and client server protocols working with the client server
paradigms like WWW, HTTP, FTP, e-mail and SNMP etc.
UNIT I:
Introduction: Network Types, LAN, MAN, WAN, Network Topologies Reference models- The OSI
Reference Model- the TCP/IP Reference Model - A Comparison of the OSI and TCP/IP Reference Models,
OSI Vs TCP/IP, Lack of OSI models success, Internet History.
Physical Layer –Introduction to Guided Media- Twisted-pair cable, Coaxial cable and Fiber optic cable and
unguided media: Wireless-Radio waves, microwaves, infrared.
UNIT II:
Data link layer: Design issues, Framing: fixed size framing, variable size framing, flow control, error
control, error detection and correction codes, CRC, Checksum: idea, one’s complement internet checksum,
services provided to Network Layer, Elementary Data Link Layer protocols: simplex protocol, Simplex
stop and wait, Simplex protocol for Noisy Channel.
Sliding window protocol: One bit, Go back N, Selective repeat-Stop and wait protocol, Data link layer in
HDLC: configuration and transfer modes, frames, control field, point to point protocol (PPP): framing
transition phase, multiplexing, multi link PPP.
UNIT – III:
Media Access Control: Random Access: ALOHA, Carrier sense multiple access (CSMA), CSMA with
Collision Detection, CSMA with Collision Avoidance, Controlled Access: Reservation, Polling, Token
Passing, Channelization: frequency division multiple Access (FDMA), time division multiple access
(TDMA), code division multiple access (CDMA).
Wired LANs: Ethernet, Ethernet Protocol, Standard Ethernet, Fast Ethernet (100 Mbps), Gigabit Ethernet,
10 Gigabit Ethernet.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
UNIT –V:
The Transport Layer: Transport layer protocols: Introduction-services, port number, User data gram
protocol, User datagram, UDP services, UDP applications, Transmission control protocol: TCP services,
TCP features, Segment, A TCP connection, windows in TCP, flow control, Error control, Congestion
control in TCP.
Application Layer: World Wide Web: HTTP, Electronic mail-Architecture, web based mail, email
security, TELENET-local versus remote Logging, Domain Name System: Name Space, DNS in Internet,
Resolution, Caching, Resource Records, DNS messages, Registrars, security of DNS Name Servers, SNMP.
Text Books:
1. Computer Networks, Andrew S Tanenbaum, Fifth Edition. Pearson Education/PHI
2. Data Communications and Networks, Behrouz A. Forouzan, Fifth Edition TMH.
References Books:
1. Data Communications and Networks- Achut S Godbole, AtulKahate
2. Computer Networks, Mayank Dave, CENGAGE
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
x To optimize business decisions and create competitive advantage with Big Data analytics
x To learn to analyze the big data using intelligent techniques
x To introduce programming tools PIG&HIVE in Hadoop echo system
Course Outcomes:
At the end of the course, the students will be able to
x Illustrate big data challenges in different domains including social media, transportation, finance and
medicine
x Use various techniques for mining data stream
x Design and develop Hadoop
x Identify the characteristics of datasets and compare the trivial data and big data for various applications
x Explore the various search methods and visualization techniques
UNITI:
Introduction: Introduction to big data: Introduction to Big Data Platform, Challenges of
Conventional Systems, Intelligent data analysis, Nature of Data, Analytic Processes and Tools,
Analysisvs Reporting.
UNITII:
Stream Processing: Mining data streams: Introduction to Streams Concepts, Stream Data
Modeland Architecture, Stream Computing, Sampling Data in a Stream, Filtering Streams,
Counting Distinct Elements in a Stream, Estimating Moments, Counting Oneness in a Window,
Decaying Window, Real time Analytics Platform (RTAP) Applications, Case Studies-Real Time
Sentiment Analysis-Stock Market Predictions.
UNITIII:
Introduction to Hadoop: History of Hadoop, the Hadoop Distributed File System, Components of
Hadoop Analysing the Data with Hadoop, Scaling Out, Hadoop Streaming, Design of HDFS, Java
interfaces to HDFS Basics, Developing a Map Reduce Application, How Map Reduce Works,
Anatomy of a Map Reduce Job run, Failures, Job Scheduling, Shuffle and Sort, Task execution,
Map Reduce Types and Formats, Map Reduce Features Hadoop environment.
UNITIV:
Frameworks and Applications: Frameworks: Applications on Big Data Using Pig and Hive, Data
processing operators in Pig, Hive services, HiveQL, Querying Data in Hive, fundamentals of H
Base and Zoo Keeper.
UNITV:
Predictive Analytics and Visualizations: Predictive Analytics, Simple linear regression,
Multiplelinear regression, Interpretation of regression coefficients, Visualizations, Visual data
analysis techniques, interaction techniques, Systems and application
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Reference Books:
1. Bill Franks, “Taming the Big Data Tidal Wave: Finding Opportunities in Huge Data Streams with
AdvancedAnalytics”,JohnWiley&sons,2012.
2. Paul Zikopoulos, DirkdeRoos, Krishnan Parasuraman, Thomas Deutsch, James Giles, David Corrigan,
“Harness the Power of Big Data: The IBM Big Data Platform”, Tata McGraw HillPublications,2012.
3. Arshdeep Bahga and Vijay Madisetti, “Big Data Science & Analytics: A Hands OnApproach“, VPT,
2016.
4. Bart Baesens, “Analytics in a Big Data World: The Essential Guide to Data Science and its Applications
(WILEY Big Data Series)”, John Wiley & Sons, 2014.
Software Links:
1. Hadoop:http://hadoop.apache.org/
2. Hive: https://cwiki.apache.org/confluence/display/Hive/Home
3. Piglatin: http://pig.apache.org/docs/r0.7.0/tutorial.html
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
L T P C
III B Tech II Sem
3 0 0 3
DESIGN AND ANALYSIS OF ALGORITHMS
Course Objectives:
The main objective of the course is, students have to build the following:
x Ability to understand, analyze and denote time complexities of algorithms
x To introduce the different algorithmic approaches for problem solving through numerous example
problems
x Describe the dynamic-programming paradigm and explain when an algorithmic design situation calls
for it. Recite algorithms that employ this paradigm. Synthesize dynamic-programming algorithms,
and analyze them.
x To provide some theoretical grounding in terms of finding the lower bounds of algorithms and the
NP-completeness
Course Outcomes:
After the completion of the course, student will be able to
x Analyze the performance of a given algorithm, denote its time complexity using the asymptotic
notation for recursive and non-recursive algorithms
x List and describe various algorithmic approaches and Solve problems using divide and conquer
&greedy Method
x Synthesize efficient algorithms dynamic programming approaches to solve in common engineering
design situations.
x Organize important algorithmic design paradigms and methods of analysis: backtracking, branch and
bound algorithmic approaches
x Demonstrate NP- Completeness theory ,lower bound theory and String Matching
UNIT I:
Introduction: Algorithm Definition, Algorithm Specification, performance Analysis, Performance
measurement, asymptotic notation, Randomized Algorithms.
UNIT II:
Divide and Conquer: General Method, Defective chessboard, Binary Search, finding the maximum and
minimum, Merge sort, Quick sort.
The Greedy Method: The general Method, knapsack problem, minimum-cost spanning Trees, Optimal
Merge Patterns, Single Source Shortest Paths.
UNIT III:
Dynamic Programming: The general method, multistage graphs, All pairs-shortest paths, optimal Binary
search trees, 0/1 knapsack, The traveling salesperson problem.
UNIT IV:
Backtracking: The General Method, The 8-Queens problem, sum of subsets, Graph coloring, Hamiltonian
cycles, knapsack problem.
UNIT V:
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard and NP-
Complete classes, Cook’s theorem.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Text Books:
1. Ellis Horowitz, Sartaj Sahni, Sanguthevar Rajasekaran, “Fundamentals of Computer Algorithms”,
nd
2 Edition, Universities Press.
2. Introduction to Algorithms Thomas H. Cormen, PHI Learning
3. Harsh Bhasin, “Algorithms Design & Analysis”, Oxford University Press.
Reference Books:
nd
1. Horowitz E. Sahani S: “Fundamentals of Computer Algorithms”, 2 Edition, Galgotia
Publications,2008.
2. S. Sridhar, “Design and Analysis of Algorithms”, Oxford University Press.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
Using the course, the students will be expected to:
x Learn deep learning methods for working with sequential data,
x Learn deep recurrent and memory networks,
x Learn deep Turing machines,
x Apply such deep learning mechanisms to various learning problems.
x Know the open issues in deep learning, and have a grasp of the current research directions.
Course Outcomes:
After the completion of the course, student will be able to
x Demonstrate the fundamental concepts learning techniques of Artificial Intelligence, Machine
Learning and Deep Learning.
x Discuss the Neural Network training, various random models.
x Explain the Techniques of Keras, TensorFlow, Theano and CNTK
x Classify the Concepts of CNN and RNN
x Implement Interactive Applications of Deep Learning.
UNIT I:
Fundamentals of Deep Learning: Artificial Intelligence, History of Machine learning: Probabilistic
Modeling, Early Neural Networks, Kernel Methods, Decision Trees, Random forests and Gradient Boosting
Machines, Fundamentals of Machine Learning: Four Branches of Machine Learning, Evaluating Machine
learning Models, Overfitting and Underfitting. [Text Book 2]
UNIT II:Introducing Deep Learning: Biological and Machine Vision, Human and Machine Language,
Artificial Neural Networks, Training Deep Networks, Improving Deep Networks. [Text Book3]
UNIT III:Neural Networks: Anatomy of Neural Network, Introduction to Keras: Keras, TensorFlow,
Theano and CNTK, Setting up Deep Learning Workstation, Classifying Movie Reviews: Binary
Classification, Classifying newswires: Multiclass Classification. [Text Book 2]
UNIT IV:
Convolutional Neural Networks:Nerual Network and Representation Learing, Convolutional Layers,
Multichannel Convolution Operation, Recurrent Neural Networks: Introduction to RNN, RNN Code,
PyTorch Tensors: Deep Learning with PyTorch, CNN in PyTorch. [Text Book 3]
UNIT V:
Interactive Applications of Deep Learning: Machine Vision, Natural Language processing, Generative
Adversial Networks, Deep Reinforcement Learning. [Text Book 1]
Deep Learning Research: Autoencoders, Deep Generative Models: Boltzmann Machines Restricted
Boltzmann Machines, Deep Belief Networks. [Text Book 1]
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Reference Books:
1. Artificial Neural Networks, Yegnanarayana, B., PHI Learning Pvt. Ltd, 2009.
2. Matrix Computations, Golub, G.,H., and Van Loan,C.,F, JHU Press,2013.
3. Neural Networks: A Classroom Approach, Satish Kumar, Tata McGraw-Hill Education, 2004.
Web Link:
1. Swayam NPTEL: Deep Learning: https://onlinecourses.nptel.ac.in/noc22_cs22/preview
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
At the end of the course, the student shall be able to:
• To describe and determine the purpose and importance of project management from the perspectives
of planning, tracking and completion of project
• To compare and differentiate organization structures and project structures
• To implement a project to manage project schedule, expenses and resources with the application of
suitable project management tools
Course outcomes:
Upon the completion of the course students will be able to:-
• Apply the process to be followed in the software development life-cycle models
• Apply the concepts of project management & planning
• Implement the project plans through managing people, communications and change
• Conduct activities necessary to successfully complete and close the Software projects
• Implement communication, modeling, and construction & deployment practices in software
development
UNIT-I:
Conventional Software Management: The waterfall model, conventional software Management
performance.
Evolution of Software Economics: Software Economics, pragmatic software cost estimation.
Improving Software Economics: Reducing Software product size, improving software processes,
improving team effectiveness, improving automation, Achieving required quality, peer inspections.
The old way and the new: The principles of conventional software Engineering, principles of modern
software management, transitioning to an iterative process.
UNIT-II:
Life cycle phases: Engineering and production stages, inception, Elaboration, construction, transition
phases.
Artifacts of the process: The artifact sets, Management artifacts, Engineering artifacts, programmatic
artifacts.
UNIT- III:
Model based software architectures: A Management perspective and technical perspective.
Work Flows of the process: Software process workflows, Iteration workflows.
Checkpoints of the process: Major mile stones, Minor Milestones, Periodic status assessments.
Iterative Process Planning: Work breakdown structures, planning guidelines, cost and schedule estimating,
Iteration planning process, Pragmatic planning.
UNIT- IV:
Project Organizations and Responsibilities: Line-of-Business Organizations, Project Organizations,
evolution of Organizations.
Process Automation: Automation Building blocks, The Project Environment.
Project Control and Process instrumentation: The seven core Metrics, Management indicators, quality
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
UNIT-V:
Agile Methodology, ADAPTing to Scrum, Patterns for Adopting Scrum, Iterating towards Agility.
Fundamentals of DevOps: Architecture, Deployments, Orchestration, Need, Instance of applications,
DevOps delivery pipeline, DevOps eco system. DevOps adoption in projects: Technology aspects, Agiling
capabilities, Tool stack implementation, People aspect, processes
Text Books:
1. Software Project Management, Walker Royce, PEA, 2005.
2. Succeeding with Agile: Software Development Using Scrum, Mike Cohn, Addison Wesley.
3. The DevOps Handbook: How to Create World-Class Agility, Reliability, and Security in Technology
Organizations, Gene Kim , John Willis , Patrick Debois , Jez Humb,1st Edition, O’Reilly
publications, 2016.
Reference Books:
1. Software Project Management, Bob Hughes,3/e, Mike Cotterell, TMH
2. Software Project Management, Joel Henry, PEA
3. Software Project Management in practice, PankajJalote, PEA, 2005,
4. Effective Software Project Management, Robert K.Wysocki, Wiley,2006
5. Project Management in IT, Kathy Schwalbe, Cengage
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
x To understand the foundations of distributed systems.
x To learn issues related to clock Synchronization and the need for global state in distributed systems
x To learn distributed mutual exclusion and dead lock detection algorithms
x To understand the significance of agreement, fault tolerance and recovery protocols in Distributed
Systems
x To learn the characteristics of peer-to-peer and distributed shared memory systems
Course Outcomes:
At the end of the course, the students will be able to:
x Elucidate the foundations and issues of distributed systems
x Illustrate the various synchronization issues and global state for distributed systems
x Illustrate the Mutual Exclusion and Dead lock detection algorithms in distributed systems
x Describe the agreement protocols and fault tolerance mechanisms in distributed systems
x Describe the features of peer-to-peer and distributed shared memory systems
UNIT I:
Distributed Systems: Definition, Relation to computer system components, Motivation, Relation
to parallel systems, Message-passing systems versus shared memory systems, Primitives for
distributed communication, Synchronous versus a synchronous executions, Design issues and
challenges.
A model of distributed computations: A distributed program, A model of distributed executions,
Models of communication networks, Global state, Cuts, Past and future cones of an event,
Models of process communications.
Logical Time: A framework for a system of logical clocks, Scalar time, Vector time, Physical
clock synchronization: NTP.
UNIT II:
Message Ordering & Snapshots: Message ordering and group communication: Message ordering
paradigms, Asynchronous execution with synchronous communication, Synchronous program
order on an asynchronous system, Group communication, Causal order (CO), Total order. Global
state and snapshot recording algorithms: Introduction, System model and definitions, Snap shot
algorithms for FIFO channels.
UNIT III:
Distributed Mutex & Deadlock: Distributed mutual exclusion algorithms: Introduction,
Preliminaries, Lamport‘s algorithm, Ricart-Agrawala algorithm, Maekawa‘s algorithm, Suzuki–
Kasami‘s broadcast algorithm. Deadlock detection in distributed systems: Introduction, System
model, Preliminaries, Models of deadlocks, Knapp‘s classification, Algorithms for the single
resource model, the AND model and the OR model.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
UNIT V:
Peer-to-peer computing and overlay graphs: Introduction, Data indexing and overlays, Chord–
Content addressable networks, Tapestry.
Distributed shared memory: Abstraction and advantages, Memory consistency models, Shared
memory Mutual Exclusion.
Text Books:
1. Distributed Systems Concepts and Design, George Coulouris, Jean Dollimore and Tim Kindberg, Fifth
Edition, Pearson Education, 2012.
2. Distributed computing: Principles, algorithms, and systems, Ajay Kshemkalyani and Mukesh Singhal,
Cambridge University Press, 2011.
Reference Books:
1. Distributed Operating Systems: Concepts and Design, Pradeep K Sinha, Prentice Hall of India, 2007.
2. Advanced concepts in operating systems. Mukesh Singhaland Niranjan G. Shivaratri, McGraw-
Hill, 1994.
3. Distributed Systems: Principles and Paradigms, Tanenbaum A.S., Van Steen M.,Pearson Education,
2007.
e-Resources:
1) https://nptel.ac.in/courses/106/106/106106168/
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course outcomes:
Upon completion of this course, the students will be able to
x Identify and execute the basic data format.
x Perform the computations with Excel and pdf files
x Understand the concepts of data cleanup
x Explore and analyze the Image and video data
x Understand the concepts web scraping
UNIT I:
INTRODUCTION TO DATA WRANGLING: Data Wrangling- Importance of Data Wrangling -How is
Data Wrangling performed- Tasks of Data Wrangling-Data Wrangling Tools-Introduction to Python-Python
Basics-Data Meant to be Read by Machines-CSV Data-JSON Data-XML Data.
UNIT II:
WORKING WITH EXCEL FILES AND PDFS: Installing Python Packages-Parsing Excel Files-Parsing
Excel Files -Getting Started with Parsing-PDFs and Problem Solving in Python-Programmatic Approaches
to PDF Parsing-Converting PDF to Text-Parsing PDFs Using pdf miner-Acquiring and Storing Data-
Databases: A Brief Introduction-Relational Databases: MySQL and PostgreSQL-Non-Relational Databases:
NoSQL-When to Use a Simple File-Alternative Data Storage.
UNIT III:
DATA CLEANUP: Why Clean Data?- Data Cleanup Basics-Identifying Values for Data Cleanup-
Formatting Data-Finding Outliers and Bad Data-Finding Duplicates-Fuzzy Matching-RegEx Matching-
Normalizing and Standardizing the Data-Saving the Data-Determining suitable Data Cleanup-Scripting the
CleanupTesting with New Data
UNIT IV:
DATA EXPLORATION AND ANALYSIS: Exploring Data-Importing Data-Exploring Table Functions-
Joining Numerous Datasets-Identifying Correlations-Identifying Outliers-Creating Groupings-Analyzing
Data-Separating and Focusing the Data, Presenting Data-Visualizing the Data-Charts-Time-Related Data-
Maps-Interactives-Words-Images, Video, and Illustrations-Presentation Tools-Publishing the Data-Open
Source Platforms
UNIT V:
WEB SCRAPING: What to Scrape and How-Analyzing a Web Page-Network/Timeline-Interacting with
JavaScript-In-Depth Analysis of a Page-Getting Pages-Reading a Web Page-Reading a Web Page with
LXML-XPath-Advanced Web Scraping-Browser-Based Parsing-Screen Reading with Selenium-Screen
Reading with Ghost.PySpidering the Web-Building a Spider with Scrapy-Crawling Whole Websites with
Scrapy.
Text Books:
1. Data Wrangling with Python, Jacqueline Kazil& Katharine Jarmul, O’Reilly Media, Inc,2016
2. Data Wrangling with Python: Creating actionable data from raw sources,,Dr. TirthajyotiSarkar,
ShubhadeepPackt Publishing Ltd,2019
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Reference Books;
1. Hands-On Data Analysis with Pandas, Stefanie Molin,Packt Publishing Ltd,2019
2. Practical Data Wrangling, Allan Visochek, Packt Publishing Ltd,2017
3. Principles of Data Wrangling: Practical Techniques for Data Preparation, TyeRattenbury, Joseph M.
Hellerstein, Jeffrey Heer, Sean Kandel, Connor Carreras, , O’Reilly Media, Inc,2017
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objective:
x Develop various applications with ETL principles
Course Outcomes:
By completing the course the students will be able to:
x Understand the basic principles of ETL
x Understand various processes like extraction, cleaning, conforming etc.
UNIT I:
ETL Data Structures: To Stage or Not to Stage, Designing the Staging Area, Data Structures in the ETL
System: Flat files, XML Data Sets, Relational Tables, Independent DBMS Working Tables, Third Normal
Form Entity/Relation Models, Nonrelational Data Sources, Dimensional Data Models, Fact Tables,
Dimension Tables, Atomic and Aggregate Fact Tables, Surrogate Key Mapping Tables
UNIT II:
Extracting: Logical Data Map, Components of the Logical Data Map, Using Tools for the Logical Data
Map, Building the Logical Data Map- Data Discovery Phase, Data Content Analysis, Collecting Business
rules in the ETL Processes, Integrating Heterogeneous Data Sources, Challenge of Extracting from
Disparate Platforms, Flat files, XML Sources, Web Log Sources, ERP System Sources
UNIT III:
Cleaning and Conforming: Defining Data Quality, Cleaning Deliverables, Known Table Row Counts,
Column Nullity, Column Numeric and Date Ranges, Column Length Restriction, Column Explicit Valid
Values, Column Explicit Invalid Values, Conformed Dimensions, Designing the Conformed Dimensions,
Conformed Facts
Delivering Dimension Tables: The Basic Structure of a Dimension, The Grain of a Dimension, Flat
Dimensions and Snowflaked Dimensions, Date and Time Dimensions, Big Dimensions, Small Dimensions,
Dimensional Roles, Degenerate Dimensions, Slowly Changing Dimensions, Multivalued Dimensions and
Bridge Tables
UNIT IV:
Delivering Fact Tables: Basic Structure of a Fact Table, Surrogate Key Pipeline, Fundamental Grains:
Transaction Grain Fact Tables, Periodic Snapshot Fact Table, Accumulating Snapshot Fact Tables,
Managing Indexes, Managing Partitions, Outwitting the Rollback Log, Loading the Data, Incremental
Loading, Inserting Facts, Updating and Correcting Facts, Negating Facts, updating Facts, Deleting Facts,
Factless Fact Tables
UNIT V:
Operations: Scheduling and Support, Migrating to Production, Achieving optimal ETL performance:
Estimating Load Time, Vulnerabilities of Long-Running ETL processes, Minimizing Risk of Load Failures,
Purging Historic Data, Monitoring ETL System: Measuring ETL Specific Performance Indicators,
Measuring Infrastructure Performance Indicators, Tuning ETL Processes, ETL System Security
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Web References:
1. https://www.coursera.org/learn/extract-transform-and-load-data
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Outcomes:
At the end of the Course, Student will be able to:
x Build static web pages using HTML 5 elements.
x Apply JavaScript to embed programming interface for web pages and also to perform Client side
validations.
x Build a basic web server using Node.js, work with Node Package Manager (NPM) and recognize the
need for Express.js.
x Develop JavaScript applications using typescript and work with document database using
MongoDB.
x Utilize Angular JS to design dynamic and responsive web pages.
UNIT-I:
HTML 5: Introduction to Web, Overview of Web Technologies, HTML - Introduction, HTML - Need,
Case-insensitivity, Platform-independency, DOCTYPE Declaration, Types of Elements, HTML Elements -
Attributes, Metadata Element, Sectioning Elements, Paragraph Element, Division and Span Elements, List
Element, Link Element, Character Entities, HTML5 Global Attributes, Creating Table Elements, Table
Elements : Colspan/ Rowspan Attributes, border, cellspacing and cellpadding attributes, Creating Form
Elements, Input Elements - Attributes, Color and Date Pickers, Select and Datalist Elements, Editing
Elements, Media, Iframe, Why HTML Security, HTML Injection, Clickjacking, HTML5 Attributes &
Events Vulnerabilities, Local Storage Vulnerabilities, HTML5 - Cross-browser support, Best Practices For
HTML Web Pages.
UNIT-II:
JavaScript: Why we need JavaScript, What is JavaScript, Environment Setup, Working with Identifiers,
Type of Identifiers, Primitive and Non Primitive Data Types, Operators and Types of Operators, Types of
Statements, Non - Conditional Statements, Types of Conditional Statements, If and Switch Statements,
Types of Loops, Types of Functions, Declaring and Invoking Function, Arrow Function, Function
Parameters, Nested Function, Built-in Functions, Variable Scope in Functions, Working With Classes,
Creating and Inheriting Classes, In-built Events and Handlers, Working with Objects, Types of Objects,
Creating Objects, Combining and cloning Objects using Spread operator, Destructuring Objects, Browser
and Document Object Model, Creating Arrays, Destructuring Arrays, Accessing Arrays, Array Methods,
Introduction to Asynchronous Programming, Callbacks, Promises, Async and Await, Executing Network
Requests using Fetch API, Creating and consuming Modules.
UNIT-III:
Node.js: Why and What Node.js, How to use Node.js, Create a web server in Node.js, Node Package
Manager, Modular programming in Node.js, Restarting Node Application, File Operations.
Express.js: Express Development Environment, Defining a route, Handling Routes, Route and Query
Parameters, How Middleware works, Chaining of Middlewares, Types of Middlewares, Connecting to
MongoDB with Mongoose, Validation Types and Defaults, Models, CRUD Operations, API Development,
Why Session management, Cookies, Sessions, Why and What Security, Helmet Middleware, Using a
Template Engine Middleware, Stylus CSS Preprocessor.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
UNIT-V:
What is Angular, Features of Angular, Angular Application Setup, Components and Modules, Executing
Angular Application, Elements of Template, Change Detection, Structural Directives - ngIf, ngFor,
ngSwitch, Custom Structural Directive, Attribute Directives - ngStyle, ngClass, Custom Attribute
Directive, Property Binding, Attribute Binding, Style and Event Binding, Built in Pipes, Passing Parameters
to Pipes, Nested Components Basics, Passing data from Container Component to Child Component, Passing
data from Child Component to ContainerComponent, Shadow DOM, Component Life Cycle, Template
Driven Forms, Model Driven Forms or Reactive Forms, Custom Validators in Reactive Forms, Custom
Validators in Template Driven forms, Dependency Injection, Services Basics, RxJS Observables, Server
Communication using HttpClient, Communicating with different backend services using Angular
HttpClient, Routing Basics, Router Links, Route Guards, Asynchronous Routing, Nested Routes.
Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson.
2. Pro Mean Stack Development, 1st Edition, ELadElrom, Apress O’Reilly.
3. Full Stack JavaScript Development with MEAN, Colin J Ihrig, Adam Bretz, 1st edition, SitePoint,
SitePoint Pty. Ltd., O'Reilly Media.
4. MongoDB – The Definitive Guide, 2nd Edition, Kristina Chodorow,O’Reilly.
Reference Books:
1. Web Technologies, HTML, JavaScript, PHP, Java, JSP, XML and AJAX, Black book,1st Edition, Dream
Tech.
2. An Introduction to Web Design, Programming, 1st Edition, Paul S Wang, SandaSKatila, Cengage
Learning.
Web Links:
1. https://infyspringboard.onwingspan.com/en/app/toc/lex_17739732834840810000_shared/overview
(HTML5)
2. https://infyspringboard.onwingspan.com/en/app/toc/lex_18109698366332810000_shared/overview
(Javascript)
3. https://infyspringboard.onwingspan.com/en/app/toc/lex_32407835671946760000_shared/overview(Node
.js & Express.js)
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
5. https://infyspringboard.onwingspan.com/en/app/toc/lex_20858515543254600000_shared/overview(Angu
lar JS)
6. https://infyspringboard.onwingspan.com/en/app/toc/lex_auth_013177169294712832113_shared/overvie
w (MongoDB)
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
Learn basic concepts of computer networking and acquire practical notions of protocols with the emphasis
on TCP/IP. A lab provides a practical approach to Ethernet/Internet networking: networks are assembled,
and experiments are made to understand the layered architecture and how do some important protocols work
Course Outcomes:
By the end of the course student will be able to
x Know how reliable data communication is achieved through data link layer.
x Suggest appropriate routing algorithm for the network.
x Provide internet connection to the system and its installation.
x Work on various network management tools
List of Experiments:
1. Study of Network devices in detail and connect the computers in Local Area Network.
2. Write a Program to implement the data link layer farming methods such as
i) Character stuffing ii) bit stuffing.
3. Write a Program to implement data link layer farming method checksum.
4. Write a program for Hamming Code generation for error detection and correction.
5. Write a Program to implement on a data set of characters the three CRC polynomials – CRC 12, CRC 16
and CRC CCIP.
6. Write a Program to implement Sliding window protocol for Goback N.
7. Write a Program to implement Sliding window protocol for Selective repeat.
8. Write a Program to implement Stop and Wait Protocol.
9. Write a program for congestion control using leaky bucket algorithm
10. Write a Program to implement Dijkstra‘s algorithm to compute the Shortest path through a graph.
11. Write a Program to implement Distance vector routing algorithm by obtaining routing table at each node
(Take an example subnet graph with weights indicating delay between nodes).
12. Write a Program to implement Broadcast tree by taking subnet of hosts.
13. Wireshark
i. Packet Capture Using Wire shark
ii. Starting Wire shark
iii. Viewing Captured Traffic
iv. Analysis and Statistics & Filters.
14. How to run Nmap scan
15. Operating System Detection using Nmap
16. Do the following using NS2 Simulator
i. NS2 Simulator-Introduction
ii. Simulate to Find the Number of Packets Dropped
iii. Simulate to Find the Number of Packets Dropped by TCP/UDP
iv. Simulate to Find the Number of Packets Dropped due to Congestion
v. Simulate to Compare Data Rate& Throughput.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Software Requirements :
1. Hadoop : https://hadoop.apache.org/release/2.7.6.html
2. Java : https://www.oracle.com/java/technologies/javase/javase8u211-later-archive-
downloads.html
3. Eclipse : https://www.eclipse.org/downloads/
List of Experiments:
Experiment 1: Week 1, 2:
1. Implement the following Data structures in Java
a) Linked Lists b) Stacks c) Queues d) Set e) Map
Experiment 2: Week 3:
2. (i)Perform setting up and Installing Hadoop in its three operating modes:
Standalone, Pseudo distributed, Fully distributed
(ii)Use web based tools to monitor your Hadoop setup.
Experiment 3: Week 4:
3.Implement the following file management tasks in Hadoop:
x Adding files and directories
x Retrieving files
x 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.
Experiment 4: Week 5:
4. Run a basic Word Count MapReduce program to understand MapReduce Paradigm.
Experiment 5: Week 6:
5. Write a map reduce program that mines weather data.
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.
Experiment 6: Week 7:
6.Use MapReduce to find the shortest path between two people in a social graph.
Hint: Use an adjacency list to model a graph, and for each node store the distance from the original
node, as well as a back pointer to the original node. Use the mappers to propagate the distance to the
original node, and the reducer to restore the state of the graph. Iterate until the target node has been
reached.
Experiment 7: Week 8:
7. Implement Friends-of-friends algorithm in MapReduce.
Hint: Two MapReduce jobs are required to calculate the FoFs for each user in a social network .The
first job calculates the common friends for each user, and the second job sorts the common friends
by the number of connections to your friends.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Outcomes:
On completion of this course, the student will be able to
x Implement deep neural networks to solve real world problems
x Choose appropriate pre-trained model to solve real time problem
x Interpret the results of two different deep learning models
List of Experiments:
1. Implement multilayer perceptron algorithm for MNIST Hand written Digit Classification.
2. Design a neural network for classifying movie reviews (Binary Classification) using IMDB dataset.
3. Design a neural Network for classifying news wires (Multi class classification) using Reuters
dataset.
4. Design a neural network for predicting house prices using Boston Housing Price dataset.
5. Build a Convolution Neural Network for MNIST Hand written Digit Classification.
6. Build a Convolution Neural Network for simple image (dogs and Cats) Classification
7. Use a pre-trained convolution neural network (VGG16) for image classification.
8. Implement one hot encoding of words or characters.
9. Implement word embeddings for IMDB dataset.
10. Implement a Recurrent Neural Network for IMDB movie review classification problem.
Text Books:
1. Reza Zadeh and BharathRamsundar, “Tensorflow for Deep Learning”, O’Reilly publishers, 2018
References:
1. https://github.com/fchollet/deep-learning-with-python-notebooks
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Outcomes:
At the end of the Course, Student will be able to:
x Develop professional web pages of an application using HTML elements like lists, navigations, tables,
various form elements, embedded media which includes images, audio, video and CSS Styles.
x Utilize JavaScript for developing interactive HTML web pages and validate form data.
x Build a basic web server using Node.js and also working with Node Package Manager (NPM).
x Build a web server using Express.js
x Make use of Typescript to optimize JavaScript code by using the concept of strict type checking.
List of Exercises
1.a Course Name: HTML5 - The Language
Module Name: Case-insensitivity, Platform-independency, DOCTYPE Declaration,
Types of Elements, HTML Elements - Attributes, Metadata Element
Include the Metadata element in Homepage.html for providing description as
"IEKart's is an online shopping website that sells goods in retail. This company deals
with various categories like Electronics, Clothing, Accessories etc.
https://infyspringboard.onwingspan.com/web/en/viewer/web-
module/lex_28320667711144660000_shared?collectionId=lex_177397328348408100
00_shared&collectionType=Course
1.b Course Name: HTML5 - The Language
Module Name: Sectioning Elements
Enhance the Homepage.html of IEKart's Shopping Application by adding appropriate
sectioning elements.
https://infyspringboard.onwingspan.com/web/en/viewer/web-
module/lex_6372291347110857000_shared?collectionId=lex_1773973283484081000
0_shared&collectionType=Course
1.c Course Name: HTML5 - The Language
Module Name: Paragraph Element, Division and Span Elements, List Element
Make use of appropriate grouping elements such as list items to "About Us" page of
IEKart's Shopping Application
https://infyspringboard.onwingspan.com/web/en/viewer/web-
module/lex_32785192040894940000_shared?collectionId=lex_177397328348408100
00_shared&collectionType=Course
1.d Course Name: HTML5 - The Language
Module Name: Link Element
Link "Login", "SignUp" and "Track order" to "Login.html", "SignUp.html" and
"Track.html" page respectively. Bookmark each category to its details of IEKart's
Shopping application.
https://infyspringboard.onwingspan.com/web/en/viewer/web-
module/lex_15515105953273338000_shared?collectionId=lex_177397328348408100
00_shared&collectionType=Course
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Text Books:
1. Programming the World Wide Web, 7th Edition, Robet W Sebesta, Pearson.
2. Pro Mean Stack Development, 1st Edition, ELadElrom, Apress O’Reilly.
3. Full Stack JavaScript Development with MEAN, Colin J Ihrig, Adam Bretz, 1st edition, SitePoint,
SitePoint Pty. Ltd., O'Reilly Media.
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Web Links:
1. https://infyspringboard.onwingspan.com/en/app/toc/lex_17739732834840810000_shared/overview
(HTML5)
2. https://infyspringboard.onwingspan.com/en/app/toc/lex_18109698366332810000_shared/overview
(Javascript)
3. https://infyspringboard.onwingspan.com/en/app/toc/lex_32407835671946760000_shared/overview
(Node.js & Express.js)
4. https://infyspringboard.onwingspan.com/en/app/toc/lex_9436233116512678000_shared/overview
(Typescript)
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objective:
x Get exposure on Spark for ETL
Course Outcomes:
By completing the course the students will be able to:
x Develop various applications for ETL with Spark
List of Experiments:
1. Write a program to create a SparkSession and read the data from CSV file
2. Write a program to group record of Supermarket’s sales data of Kaggle Dataset by Gender
3. Write a program to create a Spark Session and display DataFrame of employee.json
4. Write a program to perform various operations of SparkSQL
5. Write a program to create a new data pipeline with ApacheSpark
6. Write a program to Run SQL queries on the data in Parquet table
7. Write a program to develop Parquet table to a platform data container.
8. Write a program to Run SQL queries on the data in NoSQL table
9. Write a program to change the data in an existing Delta Lake table
10. Write a program to create a new ingestion pipeline with ApacheSpark
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
The main objective of this course is to assist students in developing employability skills and personal
qualities related to gaining and sustaining employment.
UNIT I:
Numerical ability l: Number system, HCF & LCM, Average, Simplification, Problems on numbers
Numerical ability II: Ratio & Proportion, Partnership, Percentages, Profit & Loss
UNIT II:
Arithmetical ability l: Problems on ages, Time & Work, Pipes & Cistern, Chain Rule.
Arithmetical ability ll: Time & Distance, Problems on boats &Steams, Problems on Trains
UNIT III:
Arithmetical ability lll: Allegation, Simple interest and compound interest, Races & Games of skills,
Calendar and Clock,
Logical ability: Permutations and Combination and Probability.
UNIT IV:
Mensuration: Geometry, Areas, Volumes
UNIT V:
Data interpretation: Tabulation, Bar graphs, Pie charts, line graphs
E- resources:
1. https://blog.feedspot.com/aptitude_youtube_channels/
2. https://www.tutorialspoint.com/quantitative_aptitude/
3. https://www.careerbless.com/aptitude/qa/home.php
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
Course Objectives:
The main objective of the course is to inculcate the basic understanding of Data Science and it’s
practical implementation using Python.
Course Outcomes:
Upon successful completion of the course, the student will be able to:
x Apply principles of NumPy and Pandas to the analysis of data.
x Make use of various file formats in loading and storage of data.
x Identify and apply the need and importance of pre-processing techniques.
x Show the results and present them in a pictorial format.
UNITI:
Data science: definition, Datafication, Exploratory Data Analysis, The Data science process, A data
scientist role in this process.
NumPy Basics: The NumPy ndarray: A Multidimensional Array Object, Creating ndarrays, Data Types
for ndarrays, Operations between Arrays and Scalars,
UNITII:
Basic Indexing and Slicing, Boolean Indexing, Fancy Indexing, Data Processing Using Arrays,
Expressing Conditional Logic as Array Operations, Methods for Boolean Arrays, Sorting, Unique.
UNITIII:
Getting Started with pandas: Introduction to pandas, Library Architecture, Features,
Applications, Data Structures, Series, Data Frame, Index Objects, Essential Functionality
reindexing, Dropping entries froman axis, Indexing, selection, and filtering),Sorting and ranking,
Summarizing and Computing Descriptive Statistics, Unique Values, Value Counts, Handling
Missing Data, filtering out missing data.
UNITIV:
Data Loading, Storage, and File Formats: Reading and Writing Data in Text Format, Reading
Text Files in Pieces, Writing Data Out to Text Format, Manually Working with Delimited
Formats, JSON Data, XML and HTML: Web Scraping, Binary Data Formats, Using HDF5
Format, Reading Microsoft Excel Files
UNITV:
Plotting and Visualization: A Brief matplotlib API Primer, Figures and Subplots, Colors,
Markers, and LineStyles, Ticks, Labels, and Legends, Annotations and Drawing on a Subplot,
Saving Plots to File, Plotting Functions in pandas, Line Plots, Bar Plots, Histograms and Density
Plots, Scatter Plots.
List of Experiments:
1. Creating a NumPy Array
a. Basic ndarray
b. Array of zeros
c. Array of ones
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
6. Performfollowingoperationsusingpandas
a. Creatingdataframe
b. concat()
c. Settingconditions
d. Addinganewcolumn
7. Performfollowingoperationsusingpandas
a. FillingNaNwithstring
b. Sortingbasedoncolumnvalues
c. groupby()
8. Readthefollowingfileformatsusingpandas
a. Textfiles
b. CSVfiles
c. Excelfiles
d. JSONfiles
TextBooks:
1.WesMcKinney,“PythonforDataAnalysis”,O’REILLY,ISBN:978-1-449-31979-
3,1stedition,October2012.
2.RachelSchutt&O’neil,“DoingDataScience”,O’REILLY,ISBN:978-1-449-35865-
R-20 Syllabus for CSE-DS, JNTUK w. e. f. 2020 – 21
ReferenceBooks:
1. JoelGrus, “DataSciencefromScratch:FirstPrincipleswithPython”, O’ReillyMedia, 2015
2. MattHarrison,“LearningthePandasLibrary:PythonToolsforDataMunging,Analysis,andVisualization
,O'Reilly,2016.
WebReferences:
1. https://www.analyticsvidhya.com/blog/2020/04/the-ultimate-numpy-tutorial-for-data-science-beginners/
2. https://www.analyticsvidhya.com/blog/2021/07/data-science-with-pandas-2-minutes-guide-to-key-
concepts/
3. https://www.analyticsvidhya.com/blog/2020/04/how-to-read-common-file-formats-python/
4. https://www.analyticsvidhya.com/blog/2016/07/practical-guide-data-preprocessing-python-scikit-learn/
5. https://www.analyticsvidhya.com/blog/2020/02/beginner-guide-matplotlib-data-visualization-
exploration-python/