10:41 Q l 26%

( R20-FINAL-SYLLABU... a

Dr YSR ANU College of Engineering & Technology

ACHARYA NAGARJUNA UNIVERSITY
SCHEME OF INSTRUCTION AND EXAMINATION, W.e.f. 2020-2024 (R20)
COMPUTER SCIENCE & ENGINEERING (CSE)

IV/IV B. TECH - SEMESTERI (R20 Regulation - Structure & Syllabus)

Scheme of

S.No.
Course Details Category Instruction Scheme of Examination

Code Subject Name Hours in a Week Marks

L T P Internal External Credits
Design O
of Deep
CSE 41| Learning Networks PC 3 0 30 70 3
Design & Analysis of
2 CSE 412 Parallel Algorithms PC 3 0 30 70 3
3 CSE 413 Data Science PC 3 0 30 70 3

CSE 414 Job Elective -3 JE -3 3 30 70 3

CSE 415 Open Elective-I OE-1 3 0 30 70 2

Research
6 CSE 416 Methodology BS 30 70 3
Skill
Oriented
7 CSE 451 TensorFlow Course 0 30 70 2
Industrial Research
Internship (2 months)
after 3rd year (to be
evaluated during VII
8 CSE 452 semester) MC 3 00
Total Credits 23
Honors/Minor Courses ( The hours distribution can be 3-0-2 or 3-1-0 also)

JOB ELECTIVE-3
CSE 414 A. Wireless Networks
CSE 414 B. Storage Area Networks
CSE 414 C. Introduction to NoSQL Databases
CSE 414 D. Multicore Architecture & Programming

OPEN ELECTIVE-1
CSE 415 A. Principles of Entrepreneurship
CSE 415 B. Intellectual Property Rights
CSE 415 C. Biomedical Applications
CSE 415D. Fundamentals of Robotics

Dr YSR ANU College of Engineering & Technology

ACHARYA NAGARJUNA UNIVERSITY
SCHEME OF INSTRUCTION AND EXAMNATION, w.e.f. 2020-2023 (R20)
COMPUTER SCIENCE & ENGINEERING (CSE)
COMPUTER SCIENCE & INFORMATION TECHNOLOGY(CI)

IVIV B.TECH SEMESTER II (R20 Regulation - Structure & Syllabus)

Scheme of
Course Details Category Instruction Scheme of Examination
S.No.
Hours in a Week Marks
Code Subject Name
LTP Internal External Credits
Project work, seminar
and internship in Major
CSE 461 industry Project ) 0 50 100
CSE 462 Seminar Seminar ) 0 50 |0

3 CSE 463 MOOCs MOOC 0 00 2

Total Credits 12
CSE 411 | Design of Deep Learning Networks

Course Objectives:
" Understand the context of neural networks and deep learning
" Introduces convolutional, recurrent, and other neural network architectures for deep
learning.
" Introduce major deep learning algorithms, the problem settings, and their applications
to solve real world problems.

UNIT I:

Challenges in Machine Learning, Curse of dimensionality, local consistency, smoothing

regularization, manifold learning. Deep feed forward networks, gradient based learning.
UNIT II:

Architectural design of deep learning networks, hidden units, computational graphs, chine rule,
forward propagation and backward propagation, back propagation and other differentiation
algorithms.
UNIT II:

Regularization for deep learning, data set augmentation, semi-supervised learning, multitask
learning. early stopping. parameter sharing. bagging, dropout, adversal training.
UNIT IV:

Optimization of Deep Learning, Learning Vs Optimization, ANN optimization, parameter

initialization strategies, adaptive learning, convolution operation, CNN variants, Capsule
neural networks.

UNIT V:

Sequence Modelling, Unfolding Graphs, Recurrent Neural Networks, Teacher forcing for
RNN, RNN gradients, RNN-PGM, bidirectional RNN, Recursive Neural Networks, LSTM.

Text Books:

1. Deep Learning by lan Goodfellow, Yoshua Bengio and Aaron Courville.

2. Deep Learning - A Practical Approach (using Python) by Dr Rajiv Chopra.
3. Beginning with Deep Learning with TensorFlowby Mohan kumar Silaparasetty.
4. Fundamentals of Deep Learning by Nikhil Buduma.
5. Deep Learning illustrated by Jon Krohn.

Course Outcomes:

1. The advantages and disadvantages of deep learning neural network archi 160/236
other approaches.

2. Evaluate the performance of different deep learning models (e.g., with respect to
the bias-variance trade-off., overfitting and underfitting, estimation of test error).

3. Perform regularization, training optimization, and hyperparameter selection on

deep models.
4. Implement deep learning models in Python.
|CSE 412 Design & Analysis of Parallel Algorithms

Course Objective:
" To expose students to basic techniques of parallel algorithm development
and programming on different parallel platform.
" To learn about parallel computing models, design and analyse parallel
algorithms for PXAM machines and Interconnection networks.

UNIT I
INTRODUCTION
Introduction to Parallel Algorithms Models of Parallel Computation - Sorting on an
EREW SIMD.
PRAM Computer - Relation between PRAM Models - SIMD Algorithms - MIMD
Algorithms Selection - Desirable Properties for Parallel Algorithms - Parallel Algorithm
for Selection Analysis of Parallel Algorithms.
UNIT I
MERGING, SORTING AND SEARCHING
Merging on the EREW and CREW Models - Fast Merging on EREW - Sorting Networks -
Sorting ona Linear Array - Sorting on CRCW, CREW, EREW Models - Searching a
Sorted Sequence -Searching a Random Sequence.

UNIT III
MATRIX OPERATIONS
Matrix 1Transpositions - Mairix by Matrix Multiplications - Matrix by Vector multiplication.
GRAPH LEMS
Connectivity Matrix - Connected Components All Pairs Shortest Paths - Minimum
Spanning Trees.
UNIT IV
DECISION AND OPTIMIZATION PROBLEMS
Computing Prefix Sums - Applications - Job Sequencing with Deadlines Knapsack
Problem- The Bit Complexity of Parallel Computations.
UNIT V
THE BIT COMPLEXITY OF PARALLEL cOMPUTATIONS:
Adding Two Integers, Adding NIntegers, Multiplying Two Integers, Computing Prefix Sums,
Matrix Multiplication, Selection, Sorting.

REFERENCES:

1. Selim G. Akl, "The Design and Analysis of Parallcl Algorithms", Prentice Hall, New Jerscy, 1989
2. Michacl J. Quinn, "ParallelComputing : Theory &Practice", Tata McGraw Hill Edition, 2003.
3. Justin R. Smith, "The Design and Analysis of Parallel Algorithms", Oxford University Press, USA

1993.
4. Joseph JaJa, "Introduction to Parallel Algorithms", Addison-Wesley, 1992.

Learning Outcomes:
1. Define the structure of, and cost models associated with, the PRAM, mesh and hypercube
models of parallel computation.
2. Define the metrics of cost, speed-up and efficiency and use these as conceptual tr-- ..iat.
which to analyse and discriminate between alternative candidate parallel als 163/236
given problems. They will be able to demonstrate, by the use of appropriat
examples, the importance of scalability in parallel algorithm design.
3. Explain and, with appropriate use of diagrams, sketch the structure and operation of well
known parallel algorithms in a range of application areas, including sorting, matrix and
graph based problems.
CSE 413 Introduction to data Science

Course Objectives:
Will gain knowledge in the basic concepts of Data Analysis
"To acquire skills in data preparatory and pre-processing steps.
" To understand the mathematical skills in statistics.

" To learn the tools and packages in Python for data science.
"To gain understanding in classification and Regression Model.
" To acquire knowledge in data interpretation and visualization techniques.
" To leam the essential concepts of data analytics and data visualization.
UNIT I

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
Aray Object, Creating ndarrays Data Types for ndarrays, Operations between Arrays and
Scalars, Basic Indexing and Slicing, Boolean Indexing, Fancy Indexing, Data Processing Using
Arays, Expressing Conditional Logic as Aray Operations, Methods for Boolean Arrays ,
Sorting, Unique.
UNIT II

Getting Started with pandas: Introduction to pandas, Library Architecture, Features,

Applications, Data Structures, Series, DataFrame, Index Objects, Essential Functionality
Reindexing, Dropping entries from an axis, Indexing, selection, and filtering). Sorting and
ranking, Summarizing and Computing Descriptive Statistics, Unique Values, Value Counts,
Handling Missing Data, filtering out missing data.
UNIT I

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
HDES Format, Reading Microsoft Excel Files. Interacting with Databases, Storing and Loading
Data in MongoDB.
UNIT IV

Data Wrangling: Combining and Merging Data Sets, Database style DataFrame Merges,
Merging on Index, Concatenating Along an Axis, Combining Data with Overlap, Reshaping
and Pivoting. Reshaping with Hierarchical Indexing. Data Transformation, Removing
Duplicates, Replacing Values.
UNIT V

Plotting and Visualization: A Brief matplotlib API Primer, Figures and Subplots, Colors,
Markers, and Line Styles, Ticks, Labels, and Legends, Annotations and Drawing on
Saving Plots to File, Plotting Functions in pandas, Line Plots, Bar Plots, Hist 165/236
Density Plots, Scatter Plots.
Text Books:

1. Wes McKinney, "Python for Data Analysis",0"REILLY, ISBN:978-1-449-31979-3, Ist

edition, October 2012.

2. Rachel Schutt & O'neil, "Doing Data Science", O'REILLY, ISBN:978-1-449-35865-S, Ist
edition, October 2013.
Reference Books:

1. Joel Grus, "Data Science from Scratch: First Principles with Python", O'Reilly Media, 2015
2. Matt Harrison, "Learning the Pandas Library: Python Tools for Data Munging, Analysis,
and Visualization ,O»Reilly, 2016.
Course Outcomnes:
Upon successful completion of the course, the student will be able to:

" Apply principles of NumPy and Pandas to the analysis of data.

" Make use of various file formats in loading and storage of data.
" Identify and apply the need and importance of pre-processing techniques.
" Show the results and present them in a pictorial format
CSE 414 A Wireless Networks

Course Objectives:
" The students should get familiar with the wireless/mobile market and the future needs and
challenges.
" To get familiar with key concepts of wireless networks, standards, technologies and their
basic Operations.

" To lean how to design and analyze various medium access.

" To learn how to evaluate MAC and network protocols using network simnulation software
tools.

" The students should get familiar with the wireless/mobile market and the future needs and
challenges
UNIT-I: Introduction- Wireless Networking Trends, Key Wireless Physical Layer Concepts,
Multiple Access Technologies CDMA, FDMA, TDMA, Spread Spectrum technologies,
Frequency reuse, Radio Propagation and Modelling. Challenges in Mobile Computing:
Resource poorness, Bandwidth, energy etc. Wireless Local Area Networks- IEEE 802.11
Wireless LANs Physical & MAC layer, 802.11 MAC Modes (DCF& PCF) IEEE 802.11
standards, Architecture & protocols, Infrastructure vs. Adhoc Modes, Hidden Node & Exposed
Terminal Problem, Problems, Fading Effects in Indoor and outdoor WLANS, WLAN
Deployment issues.
UNIT -I: Wireless Cellular Networks-1G and 2G, 2.5G, 3G, and 4G, Mobile IPv4, Mobile
IPv6, TCP over Wireless Networks, Cellular architecture, Frequency reuse, Channel
assignment strategies, Handoff strategies, nterference and system capacity. Improving
coverage and capacity in cellular systems, Spread spectrum Technologies.
UNIT-III: WiMAX (Physical layer, Media access control, Mobility and Networking),
IEEE802.22 Wireless Regional Area Networks, IEEE 802.21 Media Independent Handover
Overview, Wireless Sensor Networks: Introduction, Application, Physical, MAC layer and
Network Layer, Power Management, Tiny OS Overview.

UNIT-IV: Wireless PANs-Bluetooth AND Zigbee, Introduction to Wireless Sensors.

UNIT-V: Security-Security in wireless Networks Vulnerabilities, Security techniques, Wi-Fi
Security, DoS in wireless communication. Advanced Topics: IEEE 802.I1x and IEEE 802.1 li
standards, Introduction to Vehicular Adhoc Networks

Text Books:

1. Schiller J., Mobile Communications, Addison Wesley, 2000. 2. Stallings W., Wireless
Communications and Networks, Pearson Education 2005

Reference Books:

1. Stojmenic Ivan, Handbook of Wireless Networks and Mobile Computing, John Wiley and
Sons Inc, 2002

2. YiBing Lin and Imrich Chlamtac, Wireless and Mobile Network Architectures, John Wiley
and Sons Inc, 2000

3. Pandya Raj, Mobile and Personal Communications Systems and Services, PHI, 2000

Course Outcomes: At the end of the course, student will be able to

" Demonstrate advanced knowledge of networking and wireless networking and understand
various types of wireless networks, standards, operations and use cases.

"Be able to design WLAN, WPAN, WWAN, Cellular based upon underlying propagation and
performance analysis.

" Demonstrate knowledge of protocols used in wireless networks and learn simulating wireless
networks.

" Design wireless networks exploring trade-offs between wire line and wireless links.
" Develop mobile applications to solve some of the real-world problems.
CSE 416 RESEARCH METHODOLOGY

Course Objectives: At the end of this course, the students should be able to

understand some basic concepts of research and its methodologies

identify appropriate research topics
select and define appropriate research problem and parameters
prepare a project proposal (to undertake a project)
organize and conduct research (advanced project) ina more appropriate manner
write a research report and thesis
write a research proposal (grants)

Unit-I
Introduction to Research Methodology: Objectives of Research, Motivation in Research,
Types
of Research, Research process and Phases of Research.

Unit-II
Research Design: Need, Problem Definition, variables, research design concepts, Literature
survey and review, Research design process, Errors in research.
Unit-III
Research Modeling: Types of Models, Model building and stages, Data consideration and
Testing. , Heuristic and Simulation modeling. Simulation: Need for simulation, Types of
simulation.

Unit-IV
Report Writing: Pre-writing considerations, Thesis writing, formats of report writing.
Formats of publications in Research Journals. Technique of Interpretation, Precaution in
Interpretation, Significance of Report writing. Different steps in writing Report, Layout of the
Research Report, Types of Reports, Report Format, Typing Instructions, Oral Presentations.
Unit-V
Research Ethics and Morals: Issues related to plagiarism, collaborative models and ethics,
acknowledgements. Intellectual Property Rights: copy rights, copy left; Patents, Industrial
designs, Trade marks.
Textbooks:
1. C.R. Kothari: Research Methodology, Methods & Techniques, 2nd Edition, New Age
International Publications.

2. Krishnaswamy, KN Sivakumar, Appa lyer and Mathiranjan M(2006). Management

Research
Methodology: Integration of Principles, Methods and Techniques (Person Education, New
Delhi).
3. R Pannerselvam, Research Methodology. PHI.

References:
1. Graziano, A.M.Raulin,M.L : Research Methods -A Process of Inquiry, Pearson
Publications.
2. Bhandarkar & Wilkinson: Methodology and Techniques of Social Research, Himalaya
publications, 2009.
3. Bell. J.2005: Doing your Research Project, 4th Edition, Open University Press, Berkshire.
4. How to write a Thesis:, Murray.R. Tata Mc Graw-Hill.
5. Writing for Academic Journals, Murray. R. 2009, McGraw-Hill International.
6. A Handbook of Academic Writing, Murray, R. and Moore, S. 2006, Tata Mc Graw-Hill.
7. Wrinting for Publication, Henson, K.T. 2005.
8 Kumar, Research Methodology: a step-by-step Guide for Beginners, SAGT
lications 184/236
Course Outcomes: By the end of the course students should be able to:
Demonstrate the ability to choose methods appropriate to research aims and
objectives
Understand the limitations of particular research methods
Develop skills in qualitative and quantitative data analysis and presentation
Develop advanced critical thinking skills
Demonstrate enhanced writing skills