Download JNTUK M.Tech R19 CSE M.Tech Computer Science and Engineering Course Structure And Syllabus

FirstRanker.com

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

COURSE STRUCTURE & SYLLABUS M.Tech CSE for COMPUTER SCIENCE & ENGINEERING PROGRAMME (Applicable for batches admitted from 2019-2020)

--- Content provided by‌ FirstRanker.com ---

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY KAKINADA

FirstRanker.com

I-SEMESTER

*Student has to choose any one audit course listed below.

--- Content provided by‍ FirstRanker.com ---

II SEMESTER

*Student has to choose any one audit course listed below.

Audit Course 1 & 2:

1. English for Research Paper Writing

--- Content provided by⁠ FirstRanker.com ---

2. Disaster Management
3. Sanskrit for Technical Knowledge
4. Value Education
5. Constitution of India
6. Pedagogy Studies

--- Content provided by⁠ FirstRanker.com ---

7. Stress Management by Yoga
8. Personality Development through Enlightenment Skills

FirstRanker.com

III-SEMESTER

#Students going for Industrial Project/Thesis will complete these courses through MOOCs

--- Content provided by FirstRanker.com ---

M. Tech. (CSE) IV SEMESTER

Open Electives offered by the Department of CSE

1. Python Programming
2. Principles of Cyber Security
3. Internet of Things

--- Content provided by‌ FirstRanker.com ---

4. Machine Learning
5. Digital forensics
6. Next Generation Databases

I Year - I Semester

Mathematical Foundations of Computer Science (MTCSE1101)

--- Content provided by​ FirstRanker.com ---

Course Objectives: This course is aimed at enabling the students to

• To understand the mathematical fundamentals that is prerequisites for variety of courses like Data mining, Network protocols, analysis of Web traffic, Computer security, Software engineering, Computer architecture, operating systems, distributed systems bioinformatics, Machine learning.
• To develop the understanding of the mathematical and logical basis to many modern techniques in computer science technology like machine learning, programming language design, and concurrency.
• To study various sampling and classification problems.

Course Outcomes:

--- Content provided by‌ FirstRanker.com ---

After the completion of the course, student will be able to

• To apply the basic rules and theorems of probability theory such as Baye's Theorem, to determine probabilities that help to solve engineering problems and to determine the expectation and variance of a random variable from its distribution.
• Able to perform and analyze of sampling, means, proportions, variances and estimates the maximum likelihood based on population parameters.
• To learn how to formulate and test hypotheses about sample means, variances and proportions and to draw conclusions based on the results of statistical tests.
• Design various ciphers using number theory.

--- Content provided by⁠ FirstRanker.com ---

• Apply graph theory for real time problems like network routing problem.

UNIT I: Basic Probability and Random Variables: Random Experiments, Sample Spaces Events, the Concept of Probability the Axioms of Probability, Some Important Theorems on Probability Assignment of Probabilities, Conditional Probability Theorems on Conditional Probability, Independent Events, Bayes Theorem or Rule. Random Variables, Discrete Probability Distributions, Distribution Functions for Random Variables, Distribution Functions for Discrete Random Variables, Continuous Random Variables

UNIT II: Sampling and Estimation Theory: Population and Sample, Statistical Inference Sampling With and Without Replacement Random Samples, Random Numbers Population Parameters Sample Statistics Sampling Distributions, Frequency Distributions, Relative Frequency Distributions, Computation of Mean, Variance, and Moments for Grouped Data. Unbiased Estimates and Efficient Estimates Point Estimates and Interval Estimates. Reliability Confidence Interval Estimates of Population Parameters, Maximum Likelihood Estimates

UNIT III: Tests of Hypothesis and Significance: Statistical Decisions Statistical Hypotheses. Null Hypotheses Tests of Hypotheses and Significance Type I and Type II Errors Level of Significance Tests Involving the Normal Distribution One-Tailed and Two-Tailed Tests P Value Special Tests of Significance for Large Samples Special Tests of Significance for Small Samples Relationship between Estimation Theory and Hypothesis Testing Operating Characteristic Curves. Power of a Test Quality Control Charts Fitting Theoretical Distributions to Sample Frequency Distributions, The Chi-Square Test for Goodness of Fit Contingency Tables Yates' Correction for Continuity Coefficient of Contingency.

UNIT IV: Algebraic Structures and Number Theory: Algebraic Systems, Examples, General Properties, Semi Groups and Monoids, Homomorphism of Semi Groups and Monoids, Group, Subgroup, Abelian Group, Homomorphism, Isomorphism. Properties of Integers, Division Theorem, The Greatest Common Divisor, Euclidean Algorithm, Least Common Multiple, Testing for Prime Numbers, The Fundamental Theorem of Arithmetic, Modular Arithmetic (Fermat's Theorem and Euler's Theorem)

--- Content provided by‍ FirstRanker.com ---

UNIT V: Graph Theory: Basic Concepts of Graphs, Sub graphs, Matrix Representation of Graphs: Adjacency Matrices, Incidence Matrices, Isomorphic Graphs, Paths and Circuits, Eulerian and Hamiltonian Graphs, Multigraphs, Planar Graphs, Euler's Formula, Graph Colouring and Covering, Chromatic Number, Spanning Trees, Algorithms for Spanning Trees (Problems Only and Theorems without Proofs).

Text Books:

1. Foundation Mathematics for Computer Science, John Vince, Springer.
2. Probability & Statistics, 3rd Edition, Murray R. Spiegel, John J. Schiller and R. Alu Srinivasan, Schaum's Outline Series, Tata McGraw-Hill Publishers
3. Probability and Statistics with Reliability, K. Trivedi, Wiley.

--- Content provided by‍ FirstRanker.com ---

4. Discrete Mathematics and its Applications with Combinatorics and Graph Theory, 7th Edition, H. Rosen, Tata McGraw Hill.

Reference Books:

1. Probability and Computing: Randomized Algorithms and Probabilistic Analysis, M. Mitzenmacher and E. Upfal.
2. Applied Combinatorics, Alan Tucker, Wiley.

FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

Advanced Data Structures & Algorithms (MTCSE1102)

Course Objectives: From the course the student will learn

• Single Linked, Double Linked Lists, Stacks, Queues, Searching and Sorting techniques, Trees, Binary trees, representation, traversal, Graphs- storage, traversal.
• Dictionaries, ADT for List, Stack, Queue, Hash table representation, Hash functions, Priority queues, Priority queues using heaps, Search trees.
• AVL trees, operations of AVL trees, Red- Black trees, Splay trees, comparison of search trees.

--- Content provided by FirstRanker.com ---

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

• Ability to write and analyze algorithms for algorithm correctness and efficiency
• Master a variety of advanced abstract data type (ADT) and data structures and their Implementation
• Demonstrate various searching, sorting and hash techniques and be able to apply and solve problems of real life
• Design and implement variety of data structures including linked lists, binary trees, heaps, graphs and search trees

--- Content provided by‍ FirstRanker.com ---

• Ability to compare various search trees and find solutions for IT related problems

UNIT I: Introduction to Data Structures, Singly Linked Lists, Doubly Linked Lists, Circular Lists- Algorithms. Stacks and Queues: Algorithm Implementation using Linked Lists.

UNIT II: Searching- Linear and Binary, Search Methods, Sorting-Bubble Sort, Selection Sort, Insertion Sort, Quick Sort, Merge Sort. Trees- Binary trees, Properties, Representation and Traversals (DFT, BFT), Expression Trees (Infix, prefix, postfix). Graphs-Basic Concepts, Storage structures and Traversals.

UNIT III: Dictionaries, ADT, The List ADT, Stack ADT, Queue ADT, Hash Table Representation, Hash Functions, Collision Resolution-Separate Chaining, Open Addressing-Linear Probing, Double Hashing.

UNIT IV: Priority queues- Definition, ADT, Realizing a Priority Queue Using Heaps, Definition, Insertion, Deletion .Search Trees- Binary Search Trees, Definition, ADT, Implementation, Operations- Searching, Insertion, Deletion.

--- Content provided by​ FirstRanker.com ---

UNIT V: Search Trees- AVL Trees, Definition, Height of AVL Tree, Operations-, Insertion, Deletion and Searching, Introduction to Red-Black and Splay Trees, B-Trees, Height of B-Tree, Insertion, Deletion and Searching, Comparison of Search Trees.

FirstRanker.com

Text Books:

1. Data Structures: A Pseudo Code Approach, 2/e, Richard F.Gilberg, Behrouz A. Forouzon and Cengage
2. Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press

--- Content provided by⁠ FirstRanker.com ---

Reference Books:

1. Data Structures and Algorithm Analysis, 2/e, Mark Allen Weiss, Pearson.
2. Data Structures and Algorithms, 3/e, Adam Drozdek, Cengage
3. C and Data Structures: A Snap Shot Oriented Treatise Using Live Engineering Examples, N.B.Venkateswarulu, E.V.Prasad and S Chand & Co, 2009

FirstRanker.com

--- Content provided by⁠ FirstRanker.com ---

Big Data Analytics ( MTCSE11XX)

Course Objectives: This course is aimed at enabling the students to

• To provide an overview of an exciting growing field of big data analytics.
• To introduce the tools required to manage and analyze big data like Hadoop, NoSQL, Map Reduce, HIVE, Cassandra, Spark.
• To teach the fundamental techniques and principles in achieving big data analytics with scalability and streaming capability.

--- Content provided by‌ FirstRanker.com ---

• To optimize business decisions and create competitive advantage with Big Data analytics

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

• Illustrate on big data and its use cases from selected business domains.
• Interpret and summarize on No SQL, Cassandra
• Analyze the HADOOP and Map Reduce technologies associated with big data analytics and explore on Big Data applications Using Hive.

--- Content provided by​ FirstRanker.com ---

• Make use of Apache Spark, RDDs etc. to work with datasets.
• Assess real time processing with Spark Streaming.

UNIT I: What is big data, why big data, convergence of key trends, unstructured data, industry examples of big data, web analytics, big data and marketing, fraud and big data, risk and big data, credit risk management, big data and algorithmic trading, big data and healthcare, big data in medicine, advertising and big data, big data technologies, introduction to Hadoop, open source technologies, cloud and big data, mobile business intelligence, Crowd sourcing analytics, inter and trans firewall analytics.

UNIT II: Introduction to NoSQL, aggregate data models, aggregates, key-value and document data models, relationships, graph databases, schema less databases, materialized views, distribution models, sharding, master-slave replication, peer- peer replication, sharding and replication, consistency, relaxing consistency, version stamps, Working with Cassandra,Table creation, loading and reading data.

UNIT III: Data formats, analyzing data with Hadoop, scaling out, Architecture of Hadoop distributed file system (HDFS), fault tolerance,with data replication, High availability, Data locality, Map Reduce Architecture, Process flow, Java interface, data flow, Hadoop I/O, data integrity, compression, serialization. Introduction to Hive, data types and file formats, HiveQL data definition, HiveQL data manipulation, Logical joins, Window functions, Optimization, Table partitioning, Bucketing, Indexing, Join strategies.

--- Content provided by‍ FirstRanker.com ---

UNIT IV: Apache spark- Advantages over Hadoop, lazy evaluation, In memory processing, DAG, Spark context, Spark Session, RDD, Transformations- Narrow and Wide, Actions, Data frames „RDD to Data frames, Catalyst optimizer, Data Frame Transformations, Working with Dates and Timestamps, Working with Nulls in Data, Working with Complex Types, Working with JSON, Grouping, Window Functions, Joins, Data Sources, Broadcast Variables, Accumulators, Deploying Spark- On-Premises Cluster Deployments, Cluster Managers- Standalone Mode, Spark on YARN, Spark Logs, The Spark UI- Spark UI History Server, Debugging and Spark First Aid

UNIT V: Spark-Performance Tuning, Stream Processing Fundamentals, Event-Time and State full Processing - Event Time, State full Processing, Windows on Event Time- Tumbling Windows, Handling Late Data with Watermarks, Dropping Duplicates in a Stream, Structured Streaming Basics - Core Concepts, Structured Streaming in Action, Transformations on Streams, Input and Output.

Text Books:

1. Big Data, Big Analytics: Emerging, Michael Minnelli, Michelle Chambers, and Ambiga Dhiraj
2. SPARK: The Definitive Guide, Bill Chambers, O'Reilley, 2018 Edition

--- Content provided by​ FirstRanker.com ---

FirstRanker.com

1. Business Intelligence and Analytic Trends for Today's Businesses", Wiley, 2013
2. P. J. Sadalage and M. Fowler, "NoSQL Distilled: A Brief Guide to the Emerging World Polyglot Persistence", Addison-Wesley Professional, 2012
3. Tom White, "Hadoop: The Definitive Guide", Third Edition, O'Reilley, 2012

Reference Books:

--- Content provided by‍ FirstRanker.com ---

1. "Hadoop Operations", O'Reilley, Eric Sammer, 2012
2. "Programming Hive", O'Reilley, E. Capriolo, D. Wampler, and J. Rutherglen, 2012
3. "HBase: The Definitive Guide", O'Reilley, Lars George, 2011
4. "Cassandra: The Definitive Guide", O'Reilley, Eben Hewitt, 2010
5. "Programming Pig", O'Reilley, Alan Gates, 2011

--- Content provided by​ FirstRanker.com ---

FirstRanker.com

Digital Image Processing ( MTCSE11XX)

Course Objectives:

• Describe and explain basic principles of digital image processing.
• Design and implement algorithms that perform basic image processing (e.g. noise removal and image enhancement).

--- Content provided by FirstRanker.com ---

• Design and implement algorithms for advanced image analysis (e.g. image compression, image segmentation).
• Assess the performance of image processing algorithms and systems.

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

• Demonstrate the components of image processing
• Explain various filtration techniques.

--- Content provided by‌ FirstRanker.com ---

• Apply image compression techniques.
• Discuss the concepts of wavelet transforms.
• Analyze the concept of morphological image processing.

UNIT I: Introduction: Fundamental steps in Image Processing System, Components of Image Processing System, Elements of Visual Perception, Image Sensing and acquisition, Image sampling & Quantization, Basic Relationship between pixels. Image Enhancement Techniques: Spatial Domain Methods: Basic grey level transformation, Histogram equalization, Image subtraction, image averaging.

UNIT II: Spatial filtering: Smoothing, sharpening filters, Laplacian filters, Frequency domain filters, Smoothing and sharpening filters, Homomorphism is filtering. Image Restoration & Reconstruction: Model of Image Degradation/restoration process, Noise models, Spatial filtering, Inverse filtering, Minimum mean square Error filtering, constrained least square filtering, Geometric mean filter, Image reconstruction from projections. Color Fundamentals, Color Models, Color Transformations.

--- Content provided by‌ FirstRanker.com ---

UNIT III: Image Compression: Redundancies- Coding, Interpixel, Psycho visual; Fidelity, Source and Channel Encoding, Elements of Information Theory; Loss Less and Lossy Compression; Run length coding, Differential encoding, DCT, Vector quantization, Entropy coding, LZW coding; Image Compression Standards-JPEG, JPEG2000, MPEG; Video compression.

UNIT IV: Wavelet Based Image Compression: Expansion of functions, Multi-resolution analysis, Scaling functions, MRA refinement equation, Wavelet series expansion, Discrete Wavelet Transform (DWT), Continuous, Wavelet Transform, Fast Wavelet Transform, 2-D wavelet Transform, JPEG-2000 encoding.

UNIT V: Image Segmentation: Discontinuities, Edge Linking and boundary detection, Thresholding, Region Based Segmentation, Watersheds; Introduction to morphological operations; binary morphology- erosion, dilation, opening and closing operations, applications; basic gray-scale morphology operations; Feature extraction; Classification; Object recognition. Digital Image Watermarking: Introduction, need of Digital Image Watermarking, applications of watermarking in copyright protection and Image quality analysis.

Text Books:

1. Digital Image Processing. 2nd ed. Gonzalez, R.C. and Woods, R.E. India: Person Education, (2009)

--- Content provided by⁠ FirstRanker.com ---

Reference Books:

1. Digital Image Processing. John Wiley, Pratt, W. K, (2001)
2. Digital Image Processing, Jayaraman, S., Veerakumar, T. and Esakkiranjan, S. (2009),Tata McGraw-Hill

FirstRanker.com

Advanced Operating Systems ( MTCSE11XX)

--- Content provided by‍ FirstRanker.com ---

Course Objectives: This course is aimed at enabling the students to

• To provide comprehensive and up-to-date coverage of the major developments in distributed Operating System, Multi-processor Operating System and Database Operating System and to cover important theoretical foundations including Process Synchronization, Concurrency, Event ordering, Mutual Exclusion, Deadlock, Agreement Protocol, Security, Recovery and fault tolerance.

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

• Illustrate on the fundamental concepts of distributed operating systems, its architecture and distributed mutual exclusion.
• Analyze on deadlock detection algorithms and agreement protocols.

--- Content provided by​ FirstRanker.com ---

• Make use of algorithms for implementing DSM and its scheduling.
• Apply protection and security in distributed operating systems.
• Elaborate on concurrency control mechanisms in distributed database systems.

UNIT-1: Architectures of Distributed Systems, System Architecture types, issues in distributed operating systems, communication networks, communication primitives. Theoretical Foundations, inherent limitations of a distributed system, lamp ports logical clocks, vector clocks, casual ordering of messages, global state, cuts of a distributed computation, termination detection. Distributed Mutual Exclusion, introduction, the classification of mutual exclusion and associated algorithms, a comparative performance analysis.

UNIT-2: Distributed Deadlock Detection, Introduction, deadlock handling strategies in distributed systems, issues in deadlock detection and resolution, control organizations for distributed deadlock detection, centralized and distributed deadlock detection algorithms, hierarchical deadlock detection algorithms. Agreement protocols, introduction-the system model, a classification of agreement problems, solutions to the Byzantine agreement problem, and applications of agreement algorithms. Distributed resource management: introduction-architecture, mechanism for building distributed file systems design issues, log structured file systems.

--- Content provided by⁠ FirstRanker.com ---

UNIT- 3: Distributed shared memory Architecture, algorithms for implementing DSM, memory coherence and protocols, design issues. Distributed Scheduling, introduction, issues in load distributing, components of a load distributing algorithm, stability, load distributing algorithm, performance comparison, selecting a suitable load sharing algorithm, requirements for load distributing, task migration and associated issues. Failure Recovery and Fault tolerance: introduction, basic concepts, classification of failures, backward and forward error recovery, backward error recovery, recovery in concurrent systems, consistent set of check points, synchronous and asynchronous check pointing and recovery, check pointing for distributed database systems, recovery in replicated distributed databases.

UNIT- 4: Protection and security, preliminaries, the access matrix model and its implementations.-safety in matrix model, advanced models of protection. Data security, cryptography: Model of cryptography, conventional cryptography modern cryptography, private key cryptography, data encryption standard public key cryptography, multiple encryptions, authentication in distributed systems.

UNIT-5: Multiprocessor operating systems, basic multiprocessor system architectures, inter connection networks for multiprocessor systems, caching hypercube architecture. Multiprocessor Operating System, structures of multiprocessor operating system, operating system design issues, threads, process synchronization and scheduling. Database Operating systems: Introduction, requirements of a database operating system Concurrency control :Theoretical aspects, introduction, database systems, a concurrency control model of database systems, the problem of concurrency control, serializability theory, distributed database systems, concurrency control algorithms, introduction, basic synchronization primitives, lock based algorithms, timestamp based algorithms, optimistic algorithms, concurrency control algorithms, data replication.

Text Books:

1. "Advanced concepts in operating systems: Distributed, Database and multiprocessor operating systems", Mukesh Singhal, Niranjan and G.Shivaratri, TMH, 2001

--- Content provided by‍ FirstRanker.com ---

Reference Books:

1. "Modern operating system", Andrew S.Tanenbaum, PHI, 2003
2. "Distributed operating system-Concepts and design", Pradeep K.Sinha, PHI, 2003
3. "Distributed operating system", Pearson education, AndrewS.Tanenbaum, 2003

FirstRanker.com

--- Content provided by‍ FirstRanker.com ---

ADVANCED COMPUTER NETWORKS (MTCSE11YY)

Course Objectives: This course is aimed at enabling the students to

• The course is aimed at providing basic understanding of Computer networks starting with OSI Reference Model, Protocols at different layers with special emphasis on IP, TCP & UDP and Routing algorithms.
• Some of the major topics which are included in this course are CSMA/CD, TCP/IP implementation, LANs/WANs, internetworking technologies, Routing and Addressing.
• Provide the mathematical background of routing protocols.

--- Content provided by‍ FirstRanker.com ---

• Aim of this course is to develop some familiarity with current research problems and research methods in advance computer networks.

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

• Illustrate reference models with layers, protocols and interfaces.
• Describe the routing algorithms, Sub netting and Addressing of IP V4and IPV6.
• Describe and Analysis of basic protocols of computer networks, and how
  

  --- Content provided by FirstRanker.com ---

  This download link is referred from the post: JNTU Kakinada (JNTUK) M.Tech R20-R19-R18 Syllabus And Course Structure