ACADEMIC REGULATIONS & COURSE STRUCTURE
For
--- Content provided by FirstRanker.com ---
COMPUTER SCIENCE & ENGINEERING
(Applicable for batches admitted from 2016-2017)
JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY: KAKINADA
KAKINADA - 533 003, Andhra Pradesh, India
--- Content provided by FirstRanker.com ---
I Semester
| S.No. | SUBJECT | L | P | C |
|---|---|---|---|---|
| 1 | ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS | 4 | -- | 3 |
| 2 | MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE | 4 | -- | 3 |
| 3 | COMPUTER ORGANIZATION AND ARCHITECTURE | 4 | -- | 3 |
| 4 | DATABASE MANAGEMENT SYSTEMS | 4 | -- | 3 |
| 5 | ADVANCED OPERATING SYSTEMS | 4 | -- | 3 |
| 6 | DATA WAREHOUSING AND DATA MINING | 4 | -- | 3 |
| 7 | CSE LAB 1 | -- | 3 | 2 |
| Total Credits 20 | ||||
II Semester
| S.No. | SUBJECT | L | P | C |
|---|---|---|---|---|
| 1 | CYBER SECURITY | 4 | -- | 3 |
| 2 | COMPUTER NETWORKS | 4 | -- | 3 |
| 3 | BIG DATA ANALYTICS | 4 | -- | 3 |
| 4 | ADVANCED UNIX PROGRAMMING | 4 | -- | 3 |
| 5 | Elective - 1 | |||
| 1. SOFTWARE ENGINEERING | ||||
| 2. ARTIFICIAL INTELLIGENCE | 4 | -- | 3 | |
| 3. COMPILER DESIGN | ||||
| 4. MACHINE LEARNING | ||||
| 6 | Elective - 2 | |||
| 1. IMAGE PROCESSING | ||||
| 2. PARALLEL ALGORITHMS | 4 | -- | 3 | |
| 3. CLOUD COMPUTING | ||||
| 4. MOBILE COMPUTING | ||||
| 7 | CSE LAB 2 | -- | 3 | 2 |
| Total Credits 20 | ||||
III Semester
| S. No. | Subject | L | P | Credits |
|---|---|---|---|---|
| 1 | Comprehensive Viva-Voce | -- | -- | 2 |
| 2 | Seminar - I | -- | -- | 2 |
| 3 | Project Work Part - I | -- | -- | 16 |
| Total Credits 20 | ||||
IV Semester
| S. No. | Subject | L | P | Credits |
|---|---|---|---|---|
| 1 | Seminar - II | -- | -- | 2 |
| 2 | Project Work Part - II | -- | -- | 18 |
| Total Credits 20 | ||||
--- Content provided by FirstRanker.com ---
I Year - I SEMESTER
ADVANCED DATA STRUCTURES AND ALGORITHM ANALYSIS
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT- I:
Introduction to Data Structures, Singly Linked Lists, Doubly Linked Lists, Circular Lists-Algorithms.
Stacks and Queues: Algorithm Implementation using Linked Lists.
--- Content provided by FirstRanker.com ---
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:
--- Content provided by FirstRanker.com ---
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, Realising a Priority Queue Using Heaps, Definition, Insertion,
Deletion .Search Trees- Binary Search Trees, Definition, ADT, Implementation, Operations-Searching,
--- Content provided by FirstRanker.com ---
Insertion, Deletion.
UNIT-V:
Search Trees- AVL Trees, Definition, Height of AVL Tree, Operations, Insertion, Deletion and
Searching. Search Trees- Introduction to Red-Black and Splay Trees, B-Trees, Height of B-Tree,
Insertion, Deletion and Comparison of Search Trees.
--- Content provided by FirstRanker.com ---
TEXT BOOKS:
1. Data Structures: A Pseudocode Approach, 2/e, Richard F.Gilberg, Behrouz A. Forouzon, Cengage.
2. Data Structures, Algorithms and Applications in java, 2/e, Sartaj Sahni, University Press.
REFERENCES BOOKS:
1. Data Structures And Algorithm Analysis, 2/e, Mark Allen Weiss, Pearson.
--- Content provided by FirstRanker.com ---
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, S Chand & Co,2009.
I Year - I SEMESTER
--- Content provided by FirstRanker.com ---
MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT-I:
Mathematical Logic: Statements and notations, Connectives, Well formed formulas, Truth Tables,
tautology, equivalence implication, Normal forms, Theory of inference for the statement calculus, Rules
of inference, Consistency of premises and indirect method of proof, Automatic Theorem Proving
--- Content provided by FirstRanker.com ---
Predicate calculus: Predicates, statement functions, variables and quantifiers, predicate formulas, free &
bound variables, universe of discourse, inference theory of predicate calculus
UNIT-II:
Set theory & Relations: Introduction, Relations and ordering, Properties of binary Relations,
Equivalence, Compatibility Relations, Partial ordering, Hasse diagram. Functions: composition of
--- Content provided by FirstRanker.com ---
functions, Inverse Function, Recursive Functions, Lattice and its Properties, Pigeon hole Principles and
its application. Algebraic structures: Algebraic systems, Examples and general properties, Semi groups
and Monoids, groups, sub groups, Definitions, Examples, homomorphism, Isomorphism and related
problems.
UNIT- III:
--- Content provided by FirstRanker.com ---
Elementary Combinatorics: Basis of counting, Enumeration of Combinations & Permutations,
Enumerating of Combinations & Permutations with repetitions and constrained repetitions,
Binomial Coefficients, Binomial Multinomial theorems, principles of Inclusion – Exclusion.
UNIT- IV:
Recurrence Relations: Generating Function of Sequences, Calculating Coefficient of generating
--- Content provided by FirstRanker.com ---
functions, Recurrence relations, Solving recurrence relation by substitution and Generating
functions, The method of Characteristic roots, Solution of Inhomogeneous Recurrence Relation.
UNIT- V:
Graph Theory: Representation of Graph, Spanning Trees, BFS, DFS, Kruskals Algorithm, Binary trees,
Planar Graphs, Graph Theory and Applications, Basic Concepts, Isomorphism and Sub graphs, Multi
--- Content provided by FirstRanker.com ---
graphs and Euler circuits, Hamiltonian graphs, Chromatic Numbers
TEXT BOOKS:
1. Discrete Mathematical Structures with Applications to computer science J.P Tremblery,
R.Manohar, TMH
--- Content provided by FirstRanker.com ---
2. Discrete Mathematical for computer Scientists & Mathematicians “J.L. Molt, A.Kandel
T.P.Baker, PHI
REFERENCE TEXTBOOKS:
1. Elements of Discrete Mathematics, C L Liu, DP Mohanpatra, TMH
2. Discrete Mathematics, Schaum's Outlines, Lipschutz, Lipson TMH.
--- Content provided by FirstRanker.com ---
3. Discrete Mathematical Structures, Kolman, Busby, Ross, 6th ed., PHI, 2009
I Year - I SEMESTER
COMPUTER ORGANIZATION AND ARCHITECTURE
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT- I:
--- Content provided by FirstRanker.com ---
Number Systems And Computer Arithmetic Signed And Unsigned Numbers, Addition and Subtraction,
Multiplication, Division, Floating Point Representation Logical Operation, Gray Code, BCD Code,
Error Detecting Codes. Boolean Algebra, Simplification of Boolean Expressions- Maps.
UNIT-II:
Combinational and Sequential Circuits Decoders, Encoders, Multiplexers, Half and Full Adders, Shift
--- Content provided by FirstRanker.com ---
Registers, Flip-Flops, Binary Counters, Memory Unit.
UNIT-III:
Memory Organisation Memory Hierarchy, Main Memory, Auxiliary Memory, Associative Memory,
Cache Memory, Virtual Memory Concept.
UNIT- IV:
--- Content provided by FirstRanker.com ---
ALU Design Addition and Subtraction, Sign and Unsigned Numbers, Multiplication and Division
Algorithms, BCD Adders.
UNIT- V:
Input –Output Organisation Peripheral Devices, Input-Output Interface, Asynchronous data transfer,
Modes of Transfer, Priority Interrupts, DMA, Input Output Processor, Serial Communication.
--- Content provided by FirstRanker.com ---
TEXT BOOKS:
1. Computer System Architecture, 3/e, Moris Mano, Pearson/PHI.
2. Micro Processor and Interfacing, 2/e, Douglas V.Hall, TMH.
REFERENCE BOOKS:
1. Digital Logic and Computer Organisation, Rajaraman, Radha Krishnan, PHI.
--- Content provided by FirstRanker.com ---
2. Micro Computer Systems: 8086/8088 family, 2/e, Liu, Gibson, PHI.
3. Computer Organisation and Architecture, 7/e, Stallings, Pearson.
I Year - I SEMESTER
DATABASE MANAGEMENT SYSTEMS
--- Content provided by FirstRanker.com ---
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT- I:
Database System Applications, Purpose of Database Systems, View of Data Data Abstraction,
Instances and Schemas, Data Models the ER Model, Relational Model, Other Models – Database
Languages - DDL, DML, Database Access from Applications Programs, Transaction Management,
Data Storage and Querying, Database Architecture, Database Users and Administrators, History of
--- Content provided by FirstRanker.com ---
Database Systems. Introduction to Database design, ER diagrams, Beyond ER Design, Entities,
Attributes and Entity sets, Relationships and Relationship sets, Additional features of ER Model,
Conceptual Design with the ER Model, Conceptual Design for Large enterprises. Relational Model:
Introduction to the Relational Model Integrity Constraints Over Relations, Enforcing Integrity
constraints, Querying relational data, Logical data base Design, Introduction to Views Destroying
--- Content provided by FirstRanker.com ---
/altering Tables and Views.
UNIT-II:
Relational Algebra and Calculus: Relational Algebra Selection and Projection, Set operations,
Renaming, Joins, Division, Examples of Algebra Queries, Relational calculus Tuple relational
Calculus – Domain relational calculus – Expressive Power of Algebra and calculus. Form of Basic SQL
--- Content provided by FirstRanker.com ---
Query - Examples of Basic SQL Queries, Introduction to Nested Queries, Correlated Nested Queries,
Set - Comparison Operators, Aggregate Operators, NULL values Comparison using Null values
Logical connectives AND, OR and NOT – Impact on SQL Constructs, Outer Joins, Disallowing
NULL values, Complex Integrity Constraints in SQL Triggers and Active Databases
UNIT-III :
--- Content provided by FirstRanker.com ---
Introduction to Schema Refinement – Problems Caused by redundancy, Decompositions Problem
related to decomposition, Functional Dependencies - Reasoning about FDS, Normal Forms FIRST,
SECOND, THIRD Normal forms BCNF -Properties of Decompositions- Loss less- join Decomposition,
Dependency preserving Decomposition, Schema Refinement in Data base Design Multi valued
Dependencies FOURTH Normal Form, Join Dependencies, FIFTH Normal form, Inclusion Dependencies.
--- Content provided by FirstRanker.com ---
UNIT- IV:
Overview of Transaction Management: The ACID Properties, Transactions and Schedules, Concurrent
Execution of Transactions – Lock Based Concurrency Control, Deadlocks – Performance of Locking
Transaction Support in SQL. Concurrency Control: Serializability, and recoverability – Introduction to
Lock Management – Lock Conversions, Dealing with Dead Locks, Specialized Locking Techniques
--- Content provided by FirstRanker.com ---
Concurrency Control without Locking. Crash recovery: Introduction to Crash recovery, Introduction to
ARIES, the Log, Other Recovery related Structures, the Write-Ahead Log Protocol, Check pointing,
recovering from a System Crash, Media recovery
UNIT-V:
--- Content provided by FirstRanker.com ---
Overview of Storage and Indexing: Data on External Storage, File Organization and Indexing
Clustered Indexes, Primary and Secondary Indexes, Index data Structures – Hash Based Indexing, Tree
based Indexing, Comparison of File Organizations. Storing data: Disks and Files: -The Memory
Hierarchy Redundant Arrays of Independent Disks. Tree Structured Indexing: Intuitions for tree
Indexes, Indexed Sequential Access Methods (ISAM) B+ Trees: A Dynamic Index Structure, Search,
--- Content provided by FirstRanker.com ---
Insert, Delete. Hash Based Indexing: Static Hashing, Extendable hashing, Linear Hashing, Extendble
vs.Linear Hashing.
TEXT BOOKS:
1. Database Management Systems, Raghu Ramakrishna, Johannes Gehrke, TMH, 3rd Edition,
2003.
--- Content provided by FirstRanker.com ---
2. Database System Concepts, A.Silberschatz, H.F. Korth, S. Sudarshan, McGraw hill, VI
edition, 2006.
3. Fundamentals of Database Systems 5th edition. Ramez Elmasri, Shamkant B.Navathe,
Pearson Education, 2008.
REFERENCE BOOKS:
--- Content provided by FirstRanker.com ---
1. Database Management System Oracle SQL and PL/SQL,P.K.Das Gupta, PHI.
2. Database System Concepts, Peter Rob & Carlos Coronel, Cengage Learning, 2008.
3. Database Systems, A Practical approach to Design Implementation and Management Fourth
edition, Thomas Connolly, Carolyn Begg, Pearson education.
--- Content provided by FirstRanker.com ---
I Year - I SEMESTER
ADVANCED OPERATING SYSTEMS
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT - I:
Architectures of Distributed Systems - System Architecture types issues in distributed operating
systems communication networks - communication primitives. Theoretical Foundations - inherent
--- Content provided by FirstRanker.com ---
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 - II:
--- Content provided by FirstRanker.com ---
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, applications of agreement algorithms. Distributed resource
--- Content provided by FirstRanker.com ---
management: introduction-architecture - mechanism for building distributed file systems - design issues
- log structured file systems.
UNIT - III:
Distributed shared memory-Architecture- algorithms for implementing DSM - memory coherence and
protocols - design issues. Distributed Scheduling introduction issues in load distributing
--- Content provided by FirstRanker.com ---
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
--- Content provided by FirstRanker.com ---
recovery - check pointing for distributed database systems- recovery in replicated distributed databases.
UNIT - IV:
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-
--- Content provided by FirstRanker.com ---
public key cryptography - multiple encryption - authentication in distributed systems.
UNIT - V:
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
--- Content provided by FirstRanker.com ---
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
--- Content provided by FirstRanker.com ---
concurrency control algorithms, data replication.
TEXT BOOKS:
1. Mukesh Singhal, Niranjan G.Shivaratri, "Advanced concepts in operating systems: Distributed,
Database and multiprocessor operating systems", TMH, 2001
--- Content provided by FirstRanker.com ---
REFERENCE Books:
1. Andrew S.Tanenbaum, "Modern operating system", PHI, 2003
2. Pradeep K.Sinha, "Distributed operating system-Concepts and design", PHI, 2003.
3. Andrew S.Tanenbaum, "Distributed operating system", Pearson education, 2003
--- Content provided by FirstRanker.com ---
I Year - I SEMESTER
DATA WAREHOUSING AND DATA MINING
| L | P | C |
|---|---|---|
| 4 | 0 | 3 |
UNIT 1: DATA WAREHOUSING:
Data warehousing Components -Building a Data warehouse Mapping the Data Warehouse to
a Multiprocessor Architecture DBMS Schemas for Decision Support Data Extraction, Cleanup,
--- Content provided by FirstRanker.com ---
and Transformation Tools -Metadata.
UNIT II: BUSINESS ANALYSIS:
Reporting and Query tools and Applications Tool Categories The Need for Applications
Cognos Impromptu – Online Analytical Processing (OLAP) – Need – Multidimensional Data Model
OLAP Guidelines Multidimensional versus Multirelational OLAP Categories of Tools OLAP
--- Content provided by FirstRanker.com ---
Tools and the Internet.
UNIT III: DATA MINING:
Introduction Data Types of Data Data Mining Functionalities Interestingness of Patterns
Classification of Data Mining Systems Data Mining Task Primitives Integration of a Data
Mining System with a Data Warehouse – Issues –Data Preprocessing.
--- Content provided by FirstRanker.com ---
UNIT IV: ASSOCIATION RULE MINING AND CLASSIFICATION:
Mining Frequent Patterns, Associations and Correlations – Mining Methods – Mining various Kinds
of Association Rules – Correlation Analysis – Constraint Based Association Mining – Classification
and Prediction – Basic Concepts – Decision Tree Induction – Bayesian Classification – Rule Based
Classification – Classification by Back propagation – Support Vector Machines
--- Content provided by FirstRanker.com ---
Associative Classification – Lazy Learners – Other Classification Methods – Prediction.
UNIT V: CLUSTERING AND TRENDS IN DATA MINING:
Cluster Analysis Types of Data Categorization of Major Clustering Methods K-means-
Partitioning Methods Hierarchical Methods Density-Based Methods –Grid Based Methods
Model-Based Clustering Methods – Clustering High Dimensional Data – Constraint – Based Cluster
--- Content provided by FirstRanker.com ---
Analysis – Outlier Analysis – Data Mining Applications.
TEXT BOOKS:
1. Alex Berson and Stephen J.Smith, “Data Warehousing, Data Mining and OLAP”, Tata
McGraw – Hill Edition, Thirteenth Reprint 2008.
2. Jiawei Han and Micheline Kamber, “Data Mining Concepts and Techniques", Third
--- Content provided by FirstRanker.com ---
Edition, Elsevier, 2012.
REFERENCES:
1. Pang-Ning Tan, Michael Steinbach and Vipin Kumar, “Introduction to Data Mining”, Person
Education, 2007.
--- Content provided by FirstRanker.com ---
2. K.P. Soman, Shyam Diwakar and V. Aja, “Insight into Data Mining Theory and Practice",
Eastern Economy Edition, Prentice Hall of India, 2006.
3. G. K. Gupta, “Introduction to Data Mining with Case Studies", Eastern Economy Edition,
Prentice Hall of India, 2006.
4. Daniel T. Larose, “Data Mining Methods and Models", Wiley-Interscience, 2006.
--- Content provided by FirstRanker.com ---
I Year - I SEMESTER
CS LAB 1
| L | P | C |
|---|---|---|
| 0 | 3 | 2 |