13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms...

24
NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY (AUTONOMOUS) - Affiliated To JNTUA, Anantapur I M.Tech. I Semester Computer Science and Engineering w.e.f. Academic Year 2013-14 13CS1101 - ADVANCED DATA STRUCTURES AND ALGORITHMS Hours / Week : 4 Sessional Marks : 40 Credits : 4 End Examination Marks : 60 UNIT - I Overview of Data Structures: Review of Arrays, Stacks, Queues, linked lists, Linked stacks and Linked queues, Applications Algorithm Analysis : Efficiency of algorithms, Apriori Analysis, Asymptotic Notations, Time complexity of an algorithm using O notation, Polynomial Vs Exponential Algorithms, Average, Best, and Worst Case Complexities UNIT II Trees and Graphs: Introduction, Definition and Basic terminologies of trees and binary trees, Representation of trees and Binary trees, Binary tree Traversals, Graphs-basic concepts, representation and traversals. Binary Search Trees, AVL Trees and B Trees: Introduction, Binary Search Trees: Definition, Operations and applications. AVL Trees: Definition, Operations and applications. B Trees: Definition, Operations and applications. UNIT III Red Black Trees, Splay Trees and Hash Tables: Red Black Trees, Splay Trees and its applications. Hash Tables: Introduction, Hash Tables, Hash Functions and its applications. UNIT IV Divide and Conquer & Greedy Method : General Method, Binary Search, Finding Maximum and Minimum, Quick Sort, Merge sort, Strassen’s Matrix Multiplication, Greedy Method - General Method, Minimum Cost Spanning Trees, Single Source Shortest Path. UNIT V Dynamic Programming : General Method, All Pairs Shortest Path, Single Source Shortest Path, 0 / 1 Knapsack problem, Reliability Design, Travelling Sales Person’s Problem. Back Tracking and Branch and Bound: General Method, 8 Queen’s Problem, Graph Coloring. Branch and Bound: The Method, LC Search, Control Abstraction, Bounding, 0/1 Knapsack Problem TEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz, Sartaj Sahni and Sanguthevar Rajasekaran, 2nd edition, University Press. REFERENCE BOOKS 1. Classic Data Structures by D. Samanta, 2005, PHI 2. Design and Analysis of Computer Algorithms by Aho, Hopcraft, Ullman 1998, PEA. 3. Introduction to the Design and Analysis of Algorithms by Goodman, Hedetniemi, TMG. 4. Design and Analysis of Algorithms by E. Horowitz, S. Sahani, 3rd Edition, Galgotia. 5. Data Structures and Algorithms in C++ by Drozdek 2nd Edition, Thomson

Transcript of 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms...

Page 1: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1101 - ADVANCED DATA STRUCTURES AND ALGORITHMS

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Overview of Data Structures: Review of Arrays, Stacks, Queues, linked lists, Linked stacks and Linked

queues, Applications

Algorithm Analysis : Efficiency of algorithms, Apriori Analysis, Asymptotic Notations, Time

complexity of an algorithm using O notation, Polynomial Vs Exponential Algorithms, Average, Best, and

Worst Case Complexities

UNIT – II

Trees and Graphs: Introduction, Definition and Basic terminologies of trees and binary trees,

Representation of trees and Binary trees, Binary tree Traversals, Graphs-basic concepts, representation

and traversals.

Binary Search Trees, AVL Trees and B Trees: Introduction, Binary Search Trees: Definition,

Operations and applications. AVL Trees: Definition, Operations and applications. B Trees: Definition,

Operations and applications.

UNIT – III

Red – Black Trees, Splay Trees and Hash Tables: Red – Black Trees, Splay Trees and its applications.

Hash Tables: Introduction, Hash Tables, Hash Functions and its applications.

UNIT – IV

Divide – and – Conquer & Greedy Method : General Method, Binary Search, Finding Maximum and

Minimum, Quick Sort, Merge sort, Strassen’s Matrix Multiplication, Greedy Method- General Method,

Minimum Cost Spanning Trees, Single Source Shortest Path.

UNIT – V

Dynamic Programming : General Method, All Pairs Shortest Path, Single Source Shortest Path, 0 / 1

Knapsack problem, Reliability Design, Travelling Sales Person’s Problem.

Back Tracking and Branch – and – Bound: General Method, 8 – Queen’s Problem, Graph Coloring.

Branch – and – Bound: The Method, LC Search, Control Abstraction, Bounding, 0/1 Knapsack

Problem

TEXT BOOKS

1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH.

2. Fundamentals of Computer Algorithms by Ellis Horowitz, Sartaj Sahni and Sanguthevar

Rajasekaran, 2nd edition, University Press.

REFERENCE BOOKS

1. Classic Data Structures by D. Samanta, 2005, PHI

2. Design and Analysis of Computer Algorithms by Aho, Hopcraft, Ullman 1998, PEA.

3. Introduction to the Design and Analysis of Algorithms by Goodman, Hedetniemi, TMG.

4. Design and Analysis of Algorithms by E. Horowitz, S. Sahani, 3rd Edition, Galgotia.

5. Data Structures and Algorithms in C++ by Drozdek 2nd Edition, Thomson

Page 2: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1102 - ADVANCED COMPUTER ARCHITECTURE

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Introduction: Technological Advances, Performance Metrics and Evaluation. Basics – Pipelining,

Caches, Virtual Memory and Paging

UNIT – II

Superscalar Processors: From Scalar to Superscalar Processors, Instruction Pipeline of the DEC Alpha

21164, Register Renaming, Reorder Buffer and Reservation Stations, Pentium P6 Microarchitecture

Overview, VLIW/EPIC Processors.

UNIT – III

Front-End: Branch Prediction (The DEC Alpha 21264 Predictor), Instruction Fetching, Decoding,

Register Renaming – a second look. Back-End: Instruction Issue and Scheduling, Memory-Accessing

Instructions, Back-End Optimizations.

UNIT – IV

Cache Hierarchy: Improving Access to L1 Caches, Hiding Memory Latencies, Design Issues for Large

Higher-Level Caches, Main Memory

Multiprocessors: Multiprocessor Organization, Cache Coherence, Synchronization, Relaxed Memory

Models, Multimedia Instruction Set Extensions

UNIT – V

Multimedia and Chip Multiprocessing(CMP): Single-Processor Multithreading, General-Purpose

Multithreaded Chip Multiprocessors, Special-Purpose Multithreaded Chip Multiprocessors,

Current Limitations and Future Challenges: Power and Thermal Management, Technological

Limitations: Wire Delays and Pipeline Depths, Challenges for Chip Multiprocessors.

TEXT BOOKS

1. Microprocessor Architecture: From Simple Pipelines to Chip Multiprocessors. By Jean-Loup Baer,

Cambridge University Press.

2. Hennessy J L, Patterson D A, Computer Architecture: A Quantitative Approach, 4th edition,

Morgan Kaufmann Publishers, 2007.

REFERENCE BOOKS

1. Jordan H F, Alaghband G, Fundamentals of Parallel Processing, Prentice-Hall of India Ltd, 2003.

2. Dongarra J, Foster I, Fox G, Gropp W, Kennedy K, Torczon L, and White A, Morgan, Source

Book of Parallel Computing, Kaufmann Publishers, 2003.

3. Hwang K, Advanced Computer Architecture: Parallelism, Scalability, Programmability, McGraw-

Hill, 2001.

4. Sima D, Fountain T, Kacsuk P, Advanced Computer Architectures, Pearson Education, 1997.

Page 3: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1103 - OBJECT ORIENTED ANALYSIS AND DESIGN

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

FUNDAMENTALS: An overview of object oriented systems development – Object basics – Object

Oriented systems development life cycle.

UNIT – II

OBJECT ORIENTED METHODOLOGIES: Rum Baugh methodology − Booch methodology −

Jacobson methodology − Patterns − Frameworks − Unified approach − Unified modeling language − Use

case diagram − Class diagram − Interaction diagram − Package diagram − State diagram − Activity

diagram – Implementation diagram.

UNIT – III

OBJECT ORIENTED ANALYSIS: Identifying use cases – Object analysis – Classification –

Identifying object relationships – Attributes and methods.

UNIT – IV

OBJECT ORIENTED DESIGN: Design axioms – Designing classes – Access layer – Object storage –

Object interoperability.

UNIT – V

SOFTWARE QUALITY AND USABILITY: Designing interface objects – Software quality assurance

– System usability – Measuring user satisfaction.

TEXT BOOKS

1. Ali Bahrami, “Object Oriented Systems Development”, Tata McGraw - Hill, 1999.

2. Martin Fowler, “UML Distilled”, 2nd Edition, Prentice Hall of India / Pearson Education, 2002.

REFERENCE BOOKS

1. Stephen R. Schach, “Introduction to Object Oriented Analysis and Design”, Tata McGraw - Hill,

2003.

2. James Rumbaugh, Ivar Jacobson and Grady Booch “The Unified Modeling Language Reference

Manual”, Addison Wesley, 1999.

Page 4: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1104 - ADVANCED DATABASE MANAGEMENT SYSTEMS

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Database System Concepts: Data Models, Schemas and Instances, Three-Schema Architecture,

Database Languages and Interfaces, The Database System Environment, Centralized and Client/Server

Architectures for DBMSs, Classification of DBMS.

Data Modeling Using ER Model: ER Diagrams, Naming Conventions, and Design Issues.

EER Model: Subclasses, Super Classes, and Inheritance, Data Abstraction, Knowledge Representation

and Ontology Concepts.

UNIT – II

Database Design: Functional Dependencies, Normal forms Based on Primary Keys, Second Normal

Forms, Third Normal Forms, Multivalued Dependencies and Fourth Normal Form, Join Dependencies and

Fifth Normal Form.

Query Processing and Optimization: Algorithms for External Sorting, SELECT and JOIN Operations,

PROJECT and SET Operations, Aggregate Operations and OUTER JOINS, Using Heuristics in Query

Optimization, Using Selectivity and Cost Estimates in Query Optimization.

UNIT – III

Object and Object-Relational Databases: Object-Oriented Concepts, Object Model of ODMG, Object

Definition Language, Object Query Language, Object Database Conceptual Design, Overview of SQL

and Its Object-Relational Features, Evolution of Data Models and Current Trends of Database

Technology, Object Relational Features of oracle 8.

UNIT – IV

Security and Advanced Modeling: Database Security Issues, Discretionary Access Control Based on

Granting and Revoking Privileges, Mandatory Access Control and Role-Based Access Control for

Multilevel Security, Statistical Database Security, Privacy Issues and Preservation, Challenges of

Database Security.

Enhanced Data Models for Advanced Applications: Active Database Concepts and Triggers, temporal

Database Concepts, Spatial and Multimedia Databases, Deductive Databases.

UNIT – V

Emerging Database Technologies and Applications:

Mobile Databases: Architecture, Characteristics, Data management Issues.

Multimedia Databases: Multimedia Data, Data management Issues, Open Research Problems,

Applications.

Geographic Information Systems (GIS): Components of GIS Systems, Characteristics, Data models for

GIS, GIS Applications and software, Future work in GIS.

Genome Data Management: Characteristics, The Human Genome Project and existing Biological

Databases.

TEXT BOOKS

1. Ramez Elmasri & Shamkant B. Navethe, Fundamentals of Database Systems, fourth Edition,

Pearson Education, 2004.

2. Abraham Silberchatz, Henry F. Korth, S.Sudarsan, Database System Concepts, Fifth Edition,

McGraw-Hill, 2006.

Page 5: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

3. Stefano Ceri, Giuseppe Pelagatti, Distributed Databases Principles and Systems, McGraw-Hill

International Editions, 1985.

REFERENCE BOOKS

1. Thomas M. Connolly, Carolyn E. Begg, Database Systems – A Practical Approach to Design,

Implementation and Management, Third edition, Pearson Education, 2003.

2. Jefrey D. Ullman, Jenifer Widom, A First Course in Database Systems, Pearson Education Asia,

2001.

3. Stefano Ceri, Giuseppe Pelagatti, Distributed Databases Principles and Systems, McGraw-Hill

International Editions, 1985.

4. Rajesh Narang, Object Oriented Interfaces and Databases, Prentice Hall of India, 2002.

Page 6: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1105 - CRYPTOGRAPHY & NETWORK SECURITY

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I Fundamentals - Introduction: OSI security architecture, Security Attacks, Services and Mechanisms, Model for network Security. Conventional Encryption: Conventional Encryption model, Steganography, Classical Encryption Techniques, Placement of Encryption function, Traffic Confidentiality. Modern Techniques: Cipher Principles, Feistel Cipher structure, Data Encryption Standard, Strength of DES, triple DES, Block Cipher design, principles and Modes of Operations, AES-Evaluation criteria for AES.

UNIT – II Public Key Cryptography: Key management & Distribution, Diffie- Hellman key exchange, Elliptic curve Cryptography, Public key cryptography and RSA. Number theory: Prime and Relatively prime numbers, Modular arithmetic, Fermat’s and Euler’s theorems, Test for primality, Euclid’s Algorithm, Chinese remainder theorem, Discrete logarithms.

UNIT – III Authentication and Hash Function: Authentication requirements, Authentication functions, Message authentication Code, Hash functions, Security of hash functions and MACs, MD5 Message Digest algorithm , Secure hash algorithm, HMAC, Digital signatures, Authentication protocols, Digital signature standard.

UNIT – IV

Network Security: Authentication applications, Kerberos , X.509 Authentication service , Electronic mail

security, PGP, S/MIME.

IP Security: Overview, Architecture, Authentication, Encapsulating Security Payload, Combining

security Associations. Web Security: Web Security requirements, Secure socket layer and Transport layer security, Secure Electronic Transaction.

UNIT – V System Level Security: Intruders, Intrusion detection, Password management, Malicious Software: Viruses and related threats, Virus counter measures. Firewall: Need for Firewall & Characteristics, Types of Firewalls, Firewall design principles, Firewall Configuration, Trusted systems.

TEXT BOOKS 1. Cryptography and Network Security: Principles and Practice-William Stallings, Pearson

Education. 2. Network Security Essentials (Applications and Standards) by William Stallings, Pearson

Education.

Page 7: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

Page 8: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1201 - ADVANCED COMPUTER NETWORKING

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Network Overview: Interfaces, protocols and services, connection-oriented and connectionless services,

OSI & TCP/IP Reference Models, ATM, Novel Netware, Local Area Networks: Topologies - star, bus,

ring.

UNIT – II

Media Access Control: deterministic and probabilistic, IEEE 802.x. wireless networking. Data Link

Protocols: framing and data transparency, error detection & correction, flow control.

UNIT – III

Interconnecting Networks: Transparent and source routing bridges, switches. Routers - adaptive and

non-adaptive routing protocols. Internet Protocols: IP Addressing, ARP & RARP, IP & ICMP, UDP &

TCP

UNIT – IV

Overview of distributed system architecture: Motivation, system structures, ODS Reference model and

distribution transparencies, design issues, Client-Server Model. Interaction primitives: message passing,

remote procedure call, remote object invocation.

UNIT – V

Interaction implementation: message passing, RPC, concurrency and threads

Security: threat analysis, access control concepts - identification, authentication, authorization and

delegation, access control lists, capabilities, secret and public key encryption, Kerberos

TEXT BOOKS

1. Computer Networks, 5th / 4th Ed., A.S.Tanenbaum, Prentice Hall, 2010.

2. Advanced Operating System, 2nd Ed., A.S.Tanenbaum

REFERENCE BOOKS

1. Data Communications and Networking, Behrouz a Forouzan.

2. Distributed Systems: principles and paradigms, A.S.Tanenbaum,

Page 9: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1202 - SERVICE ORIENTED ARCHITECTURE

Hours /week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT-I

Software Architecture – Types of IT Architecture – SOA – Evolution – Key components – perspective of

SOA – Enterprise-wide SOA – Architecture – Enterprise Applications – Solution Architecture for

enterprise application – Software platforms for enterprise Applications – Patterns for SOA – SOA

programming models

UNIT-II

Service-oriented Analysis and Design – Design of Activity, Data, Client and business process services –

Technologies of SOA – SOAP – WSDL – JAX – WS – XML WS for .NET – Service integration with

ESB – Scenario – Business case for SOA – stakeholder objectives – benefits of SPA – Cost Savings

UNIT-III

SOA implementation and Governance – strategy – SOA development – SOA governance – trends in SOA

– event-driven architecture – software as service – SOA technologies – proof-of-concept – process

orchestration – SOA best practices

UNIT-IV

Meta data management – XML security – XML signature – XML Encryption – SAML – XACML –

XKMS – WS-Security – Security in web service framework - advanced messaging

UNIT–V

Transaction processing – paradigm – protocols and coordination – transaction specifications – SOA in

mobile – research issues

References :

1. Service –Oriented Architecture for Enterprise Applications by Shankar Kambhampaly, Wiley

India Pvt Ltd, 2008.

2. Understanding SOA with Web Services by Eric Newcomer, Greg Lomow, Pearson Education.

3. Web Services Security by Mark O’ Neill, et al., Tata McGraw-Hill Edition, 2003.

Page 10: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1203 - SOFTWARE ARCHITECTURE

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Introduction to Software Architecture: An Engineering Discipline for Software, Status of S/W

Architecture. Architecture Business Cycle, Where do Architectures Come from. Software Processes and

the Architecture Business Cycle, Features of Good Architecture

UNIT – II

Architecture Styles: Pipes and Filters, Data Abstraction and Object Oriented organization, Even-based

Implicit Invocation, Layered Systems, Registers, Interpreters, Process Control, Other Familiar

Architectures, Heterogeneous Architectures. Shared Information Systems Database Integration,

Interpretation in Software Development Environments, Architectural Structures for Shared Information

Systems.

UNIT – III

Architectural Design Guidance: Guidance for User Interface Architectures, Case Study in Inter-

Operability: World Wide Web. Pattern Types Architectural Patterns, Structural Patterns, Patterns for

Distribution, Patterns for Interactive Systems

UNIT – IV

Formal Models And Specifications: Finalizing the Architectural of a Specific System, Architectural

Style, Architectural Design Space, Case Study of an Industry Standard Computing. Infrastructure:

CORBA Architectural Description Languages, ADL’s today, capturing Architectural Information in an

ADL, Application of ADL’s in system Development, Choosing an ADL, Example of ADL.

UNIT – V

Reusing Architectural Assets Within An Organization: Creating Products and Evaluating a Product

Line, Organizational Implications of a Product Line, Component Based Systems. Software Architectures

in Figure: Legacy Systems. Achieving an architecture, from Architecture to System.

TEXT BOOKS

1. S/W Arch. Perspective: on an Emerging Discipline by Mary Show, David Garlan, 1996, PHI.

2. Software Architecture in Practice by Len Bass, Paul Elements, Rick Kazman, 1998, PEA.

Page 11: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1204 - DATA MINING & DATA WAREHOUSING

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

Introduction : Fundamentals of data mining, Data Mining Functionalities, Classification of Data Mining

systems, Major issues in Data Mining, Data Warehouse and OLAP Technology for Data Mining Data

Warehouse, Multidimensional Data Model, Data Warehouse Architecture, Data Warehouse

Implementation, Further Development of Data Cube Technology, From Data Warehousing to Data

Mining,

Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and Transformation,

Data Reduction, Discretization and Concept Hierarchy Generation, Online Data Storage.

UNIT – II

Languages and System Architectures: Data Mining Primitives, Data Mining Query Languages,

Designing Graphical User Interfaces Based on a Data Mining Query Language Architectures of Data

Mining Systems

UNIT – III

Concepts Description: Characterization and Comparison: Data Generalization and Summarization-

Based Characterization, Analytical Characterization: Analysis of Attribute Relevance, Mining Class

Comparisons: Discriminating between Different Classes, Mining Descriptive Statistical Measures in

Large Databases.

UNIT – IV

Classification and Prediction: Issues Regarding Classification and Prediction, Classification by Decision

Tree Induction, Bayesian Classification, Classification by Back propagation, Classification Based on

Concepts from Association Rule Mining, Other Classification Methods, Prediction, Classifier Accuracy

UNIT – V

Cluster Analysis Introduction: Types of Data in Cluster Analysis, A Categorization of Major Clustering

Methods, Partitioning Methods, Density-Based Methods, Grid-Based Methods, Model-Based Clustering

Methods, Outlier Analysis.

Mining Complex Types of Data: Multidimensional Analysis and Descriptive Mining of Complex, Data

Objects, Mining Spatial Databases, Mining Multimedia Databases, Mining Time-Series and Sequence

Data, Mining Text Databases, Mining the World Wide Web.

TEXT BOOKS

1. Data Mining-Concepts and Techniques-JIAWEI HAN & MICHELINE KAMBER Harcourt India.

2. Data Mining Techniques - ARUN K PUJARI, University Press

3. Building the DataWarehouse- W. H. Inmon, Wiley Dreamtech India Pvt. Ltd.

REFERENCE BOOKS

1. Data Warehousing in the Real World-Sam Anahory & Dennis Murray. Pearson Edn Asia.

2. Data Warehousing Fundamentals - Paulraj Ponnaiah Wiley Student Edition

3. The Data Warehouse Life cycle Tool kit - Ralph Kimball Wiley Student Edition

4. Data Mining Introductory and advanced topics -Margaret H Dunham, Pearson Education

Page 12: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS1205 - GRID COMPUTING

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

CONCEPTS AND ARCHITECTURE: Introduction - Parallel and Distributed Computing -Cluster

Computing - Grid Computing - Anatomy and Physiology of Grid - Web and Grid Services - Grid

Standards – OGSAWSRF - Trends, Challenges and applications.

UNIT – II

GRID MONITORING: Grid Monitoring Architecture (GMA) - An Overview of Grid Monitoring

Systems- R-GMA - GridICE – MDS- Service Level Agreements (SLAs) - Other Monitoring Systems -

Ganglia, GridMon, Hawkeye and Network Weather Service.

UNIT – III

GRID SECURITY AND RESOURCE MANAGEMENT: Grid Security - A Brief Security Primer –

PKI - X509 Certificates - Grid Security - Grid Scheduling and Resource Management, Gridway and

Gridbus Broker - principles of Local Schedulers - Overview of Condor, SGE, PBS, LSF - Grid Scheduling

with QoS.

UNIT – IV

DATA MANAGEMENT AND GRID PORTALS: Data Management - Categories and Origins of

Structured Data - Data Management Challenges - Architectural Approaches - Collective Data

Management Services - Federation Services - Grid Portals - Generations of Grid Portals.

UNIT – V

GRID MIDDLEWARE: List of globally available Middlewares - Case Studies - Recent version of

Globus Toolkit and gLite - Architecture, Components and Features. Features of next generation grid.

REFERENCE BOOKS

1. The Grid 2: Blueprint for a New Computing Infrastructure by Ian Foster, Carl Kesselman, Elsevier

Series, 2004.

2. Grid Computing for Developers by Vladimir Silva, Charles River Media, January 2006.

3. Global Grids and Software Toolkits: A Study of Four Grid Middleware Technologies, High

Performance Computing: Paradigm and Infrastructure by Parvin Asadzadeh, Rajkumar Buyya,

Chun Ling Kei, Deepa Nayar, and Srikumar Venugopal, Laurence Yang and Minyi Guo (editors),

Wiley Press, New Jersey, USA, June 2005.

4. Grid Resource Management: State of the Art and Future Trends , (International Series in

Operations Research & Management Science) by Jarek Nabrzyski, Jennifer M. Schopf, Jan

Weglarz, Springer; First edition, 2003

5. Designing a Resource Broker for Heterogeneous Grids, Software: Practice and Experience, by

Srikumar Venugopal, Krishna Nadiminti, Hussein Gibbins and Rajkumar Buyya, Wiley Press,

New York, USA, 2008.

6. Grid Computing: Making The Global Infrastructure a Reality by Fran Berman , Geoffrey Fox,

Anthony J.G. Hey, Wiley, 2003

7. The Grid: Core Technologies by Maozhen Li , Mark Baker , Wiley, 2005

8. Grid Computing by Joshy Joseph, Craig Fellenstein, IBM Press, 2004

9. Toolkit 4 : Programming Java Services by Borja Sotomayor , Lisa Childers, Globus, The Elsevier

Series in Grid Computing, Morgan Kaufmann, 2005

Page 13: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

M.Tech. – Computer Science and Engineering – w.e.f. Academic Year 2013-14

Elective-I

Title of the subject Code

1. Artificial Intelligence & Neural Networks (13CS11E1)

2. Image Processing (13CS11E2)

3. Advanced Operating Systems (13CS11E3)

4. Adhoc & Sensor Networks (13CS11E4)

Elective- II

Title of the subject Code

1. Cloud Computing (13CS12E1)

2. Mobile Computing (13CS12E2)

3. Software Quality Assurance & Testing (13CS12E3)

4. Web Technologies (13CS12E4)

Page 14: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS11E1 - ARTIFICIAL INTELLIGENCE & NEURAL NETWORKS

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT- I

Introduction: AI problems, foundation of AI and history of AI intelligent agents: Agents and

Environments, the concept of rationality, the nature of environments, structure of agents,

problem solving agents, problem formulation.

UNIT- II

Searching: Searching for solutions, uniformed search strategies - Breadth first search, depth first

Search. Search with partial information (Heuristic search) Greedy best first search, A* search

Game Playing: Adversial search, Games, minimax algorithm, optimal decisions in multiplayer

games, Alpha-Beta pruning, Evaluation functions, cutting of search.

UNIT- III

Knowledge Representation & Reasoning logical Agents, Knowledge - Based Agents, the

Wumpus world, logic, propositional logic, Resolution patterns in propositional logic, Resolution,

Forward & Backward Chaining.

Characteristics of Neural Networks, Historical Development of Neural Networks Principles,

Artificial Neural Networks: Terminology, Models of Neuron, Topology

UNIT- IV

Basic Learning Laws, Pattern Recognition Problem, Basic Functional Units, Pattern Recognition

Tasks by the Functional Units. Feedforward Neural Networks:

Introduction, Analysis of pattern Association Networks, Analysis of Pattern Classification

Networks, Analysis of pattern storage Networks, Analysis of Pattern Mapping Networks.

UNIT-V

Feedback Neural Networks: Introduction, Analysis of Linear Autoassociative FF Networks,

Analysis of Pattern Storage Networks.

Competitive Learning Neural Networks & Complex pattern Recognition: Introduction, Analysis

of Pattern Clustering Networks, Analysis of Feature Mapping Networks, Associative Memory.

Text Books :

1. Artificial Intelligence - A Modern Approach. Second Edition, Stuart Russel, Peter Norvig, PHI/

Pearson Education.

2. Artificial Neural Networks B. Yagna Narayana, PHI

Page 15: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

References :

1. Artificial Intelligence , 2nd Edition, E.Rich and K.Knight (TMH).

2. Artificial Intelligence and Expert Systems - Patterson PHI.

3. Expert Systems: Principles and Programming- Fourth Edn, Giarrantana/ Riley, Thomson.

4. PROLOG Programming for Artificial Intelligence. Ivan Bratka- Third Edition - Pearson

Education.

5. Neural Networks Simon Haykin PHI

6. Artificial Intelligence, 3rd Edition, Patrick Henry Winston., Pearson Edition.

Page 16: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS11E2 - IMAGE PROCESSING

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

Introduction: Examples of fields that use digital image processing, fundamental steps in digital

image processing, components of image processing system. Digital Image Fundamentals: A

simple image formation model, image sampling and quantization, basic relationships between

pixels.

UNIT – II

Image enhancement in the spatial domain: Basic gray-level transformation, histogram

processing, enhancement using arithmetic and logic operators, basic spatial filtering, smoothing

and sharpening spatial filters, combining the spatial enhancement methods .

UNIT – III

Image restoration: A model of the image degradation/restoration process, noise models,

restoration in the presence of noise–only spatial filtering, Weiner filtering, constrained least

squares filtering, geometric transforms; Introduction to the Fourier transform and the frequency

domain, estimating the degradation. Color Image Processing: Color fundamentals, color models,

pseudo color image processing

UNIT – IV

Image Compression: Fundamentals, image compression models, error-free compression, loss

predictive coding, image compression standards. Morphological Image Processing:

Preliminaries, dilation, erosion, open and closing, hit or miss transformation, basic morphologic

algorithms.

UNIT – V

Image Segmentation: Detection of discontinuous, edge linking and boundary detection,

thresholding, region–based segmentation. Object Recognition : Patterns and patterns classes,

recognition based on decision–theoretic methods, matching, optimum statistical classifiers,

neural networks, structural methods – matching shape numbers, string matching.

Text books:

1. Digital Image Processing, Rafeal C.Gonzalez, Richard E.Woods, Second Edition, Pearson

Education/PHI.

Page 17: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

References:

1. Image Processing, Analysis, and Machine Vision, Milan Sonka, Vaclav Hlavac and Roger Boyle,

Second Edition, Thomson Learning.

2. Introduction to Digital Image Processing with Matlab, Alasdair McAndrew, Thomson Course Technology

3. Computer Vision and Image Processing, Adrian Low, Second Edition, B.S.Publications

4. Digital Image Processing using Matlab, Rafeal C.Gonzalez, Richard E.Woods, Steven L. Eddins,

Pearson Education. 5. Digital Image Processing, William K. Prat, Wily Third Edition

6. Digital Image Processing and Analysis, B. Chanda, D. Datta Majumder, Prentice Hall of India, 2003

Page 18: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS11E3 - ADVANCED OPERATING SYSTEMS

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

Distributed systems: Introduction, Hardware concepts, Software concepts and Design issues.

Layered protocols, Asynchronous transfer mode networks, Client server model, Remote

procedure call and Group communication.

UNIT-II

Synchronization: Clock synchronization, Mutual exclusion, Election algorithms, Atomic

transactions, Deadlocks in distributed systems. Processes and processors in Distributed Systems:

Threads, System models, Processor allocation, Scheduling in distributed systems.

UNIT-III

Processes and processors in Distributed Systems: Fault tolerance, Real-time distributed

systems. Distributed file systems: Design, Implementation: File usage, System Structure,

Caching, Replication. Distributed shared memory: Introduction, shared memory concept.

UNIT-IV

Distributed shared memory: Consistency models, Page-based distributed shared memory.

Case Study Amoeba: Introduction, Objects and capabilities, Process management, Memory

management, Communication and Servers.

UNIT-V

Case Study MACH: Introduction, Process management, Memory management,

Communication. Case Study DCE: Introduction, Threads, Remote procedure call, Time

Service, Directory Service, Security Service, Distributed File System.

TEXT BOOKS:

1. Tanenbaum A S, Distributed Operating Systems, Pearson Education, 2005.

REFERENCES :

1. Sinha P K, Distributed Operating Systems: Concepts and Design, Prentice-Hall of India Pvt Ltd, 2005. 2. Coulouris G, Dollimore J, and Kindberg T, Distributed System Concepts and Design, 4th Edition, Pearson Education, 2005.

Page 19: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. I Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS11E4 - ADHOC & SENSOR NETWORKS

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

AD-HOC MAC: Introduction – Issues in Ad-Hoc Wireless Networks. MAC Protocols – Issues,

Classifications of MAC protocols, Multi channel MAC & Power control MAC protocol.

UNIT-II

AD-HOC NETWORK ROUTING & TCP: Issues – Classifications of routing protocols –

Hierarchical and Power aware. Multicast routing – Classifications, Tree based, Mesh based.

Adhoc Transport Layer Issues. TCP Over Ad Hoc – Feedback based, TCP with explicit link,

TCP-BuS, Ad Hoc TCP, and Split TCP.

UNIT-III

WSN -MAC: Introduction – Sensor Network Architecture, Data dissemination, Gathering.

MAC Protocols – self-organizing, Hybrid TDMA/FDMA and CSMA based MAC.

UNIT-IV

WSN ROUTING, LOCALIZATION & QOS: Issues in WSN routing – OLSR, AODV.

Localization – Indoor and Sensor Network Localization. QoS in WSN.

UNIT-V

Necessity for Mesh Networks – MAC enhancements – IEEE 802.11s Architecture –

Opportunistic routing – Self configuration and Auto configuration – Capacity Models – Fairness

– Heterogeneous Mesh Networks – Vehicular Mesh Networks.

REFERENCES :

1. Ad Hoc Wireless Networks – Architectures and Protocols by C.Siva Ram Murthy and B.Smanoj,

Pearson Education, 2004. 2. Wireless Sensor Networks by Feng Zhao and Leonidas Guibas, Morgan Kaufman Publishers,

2004.

3. Ad Hoc Mobile Wireless Networks by C.K.Toh, Pearson Education, 2002. 4. Wireless Mesh Networking by Thomas Krag and Sebastin Buettrich, O’Reilly Publishers, 2007.

Page 20: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS12E1 - CLOUD COMPUTING

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

UNDERSTANDING CLOUD COMPUTING: Cloud Computing – History of Cloud Computing

– Cloud Architecture – Cloud Storage – Why Cloud Computing Matters – Advantages of Cloud

Computing – Disadvantages of Cloud Computing – Companies in the Cloud Today – Cloud

Services.

UNIT-II

DEVELOPING CLOUD SERVICES: Web-Based Application – Pros and Cons of Cloud Service

Development – Types of Cloud Service Development – Software as a Service – Platform as a

service – Web Services – On-Demand Computing – Discovering Cloud Services Development

Services and Tools – Amazon Ec2 – Google App Engine – IBM Clouds

UNIT-III

CLOUD COMPUTING FOR EVERYONE: Centralizing Email Communications –

Collaborating on Schedules – Collaborating on To-Do Lists – Collaborating Contact Lists –

Cloud Computing for the Community – Collaborating on Group Projects and Events – Cloud

Computing for the Corporation.

UNIT-IV

USING CLOUD SERVICES: Collaborating on Calendars, Schedules and Task Management –

Exploring Online Scheduling Applications – Exploring Online Planning and Task Management –

Collaborating on Event Management – Collaborating on Contact Management – Collaborating

on Project Management – Collaborating on Word Processing - Collaborating on Databases –

Storing and Sharing Files.

UNIT-V

OTHER WAYS TO COLLABORATE ONLINE: Collaborating via Web-Based Communication

Tools – Evaluating Web Mail Services – Evaluating Web Conference Tools – Collaborating via

Social Networks and Groupware – Collaborating via Blogs and Wikis.

Text Books:

1. Michael Miller, Cloud Computing: Web-Based Applications That Change the Way You Work and

Collaborate Online, Que Publishing, August 2008. 2. Haley Beard, Cloud Computing Best Practices for Managing and Measuring Processes for On-

demand Computing, Applications and Data Centers in the Cloud with SLAs, Emereo Pty Limited,

July 2008.

Page 21: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS12E2 - MOBILE COMPUTING

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

Introduction to Mobile Communications and Computing: Mobile Computing (MC): Introduction

to MC, novel applications, limitations, and architecture.

GSM: Mobile services, System architecture, Radio interface, Protocols, Localization and calling,

Handover, Security, and New data services.

UNIT-II

Mobile Network Layer : Mobile IP (Goals, assumptions, entities and terminology, IP packet

delivery, agent advertisement and discovery, registration, tunneling and encapsulation,

optimizations), DynamicHost Configuration Protocol (DHCP),Mobile Transport Layer :

Traditional TCP, Indirect TCP, Snooping TCP, Mobile TCP, Fast retransmit/fast recovery,

Transmission /time-out freezing, Selective retransmission, Transaction oriented TCP.

UNIT-III

Database Issues: Hoarding techniques, caching invalidation mechanisms, client server computing

with adaptation, power-aware and context-aware computing, transactional models, query

processing, recovery, and quality of service issues.

UNIT-IV

Data Dissemination: Communications asymmetry, classification of new data delivery

mechanisms, push-based mechanisms, pull-based mechanisms, hybrid mechanisms, selective

tuning (indexing) techniques.

UNIT–V

Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum of MANET

applications, routing and various routing algorithms, security in MANETs.

Page 22: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

Text books :

1.Jochen Schiller, Mobile Communications, Addison-Wesley. (Chapters 4,7,9,10,11), second edition,

2004.

2. Stojmenovic and Cacute, Handbook of Wireless Networks and Mobile Computing, Wiley, 2002, ISBN

0471419028. (Chapters 11, 15, 17, 26 and 27)

References :

1. Reza Behravanfar, Mobile Computing Principles: Designing and Developing Mobile Applications with

UML and XML , ISBN: 0521817331, Cambridge University Press, October 2004,

2. Adelstein, Frank, Gupta, Sandeep KS, Richard III, Golden , Schwiebert, Loren, Fundamentals of

Mobile and Pervasive Computing , ISBN: 0071412379, McGraw-Hill Professional, 2005.

3. Hansmann, Merk, Nicklous, Stober, Principles of Mobile Computing, Springer, second edition, 2003.

4. Martyn Mallick, Mobile and Wireless Design Essentials, Wiley DreamTech, 2003

Page 23: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS12E3 - SOFTWARE QUALITY ASSURANCE & TESTING

Hours /week : 3 Hrs Sessional Marks : 40

Credits : 3 End Examination Marks : 60

UNIT-I

Introduction to software quality - challenges – objectives – quality factors – components of SQA

– contract review – development and quality plans – SQA components in project life cycle –

SQA defect removal policies – Reviews

UNIT-II

Basics of software testing – test generation from requirements – finite state models –

combinatorial designs - test selection, minimization and prioritization for regression testing – test

adequacy, assessment and enhancement

UNIT-III

Testing strategies – white box and black box approach – integration testing – system and

acceptance testing – performance testing – regression testing - internationalization testing – ad-

hoc testing – website testing – usability testing – accessibility testing Test plan – management –

execution and reporting – software test automation – automated testing tools

UNIT-IV

Hierarchical models of software quality – software quality metrics –function points - Software

product quality – software maintenance quality – effect of case tools – software quality

infrastructure – procedures – certifications – configuration management – documentation

control.

UNIT–V

Project progress control – costs – quality management standards – project process standards –

management and its role in SQA – SQA unit

References :

1. Software quality assurance – from theory to implementation by Daniel Galin, Pearson education,

2009.

2. Foundations of software testing by Aditya Mathur, Pearson Education, 2008 3. Software testing – principles and practices by Srinivasan Desikan and Gopalaswamy Ramesh,

Pearson education, 2006

4. Software testing by Ron Patton, second edition, Pearson education, 2007

5. Software Quality Theory and Management by Alan C Gillies, Cengage Learning, Second edition, 2003

Page 24: 13CS1101 - ADVANCED DATA STRUCTURES AND ... (2013).pdfTEXT BOOKS 1. Data Structures and Algorithms by G.A.V. Pai, 2009, TMH. 2. Fundamentals of Computer Algorithms by Ellis Horowitz,

NBKR INSTITUTE OF SCIENCE AND TECHNOLOGY(AUTONOMOUS) - Affiliated To JNTUA, Anantapur

I M.Tech. II Semester – Computer Science and Engineering – w.e.f. Academic Year 2013-14

13CS12E4 - WEB TECHNOLOGIES

Hours / Week : 4 Sessional Marks : 40

Credits : 4 End Examination Marks : 60

UNIT - I

HTML Common Tags - List, Tables, images, forms, Frames, Cascading Style sheets.

Introduction to Java Scripts, Objects in Java Script, Dynamic HTML with Java Script.

XML: Document type definition, XML Schemas, Document Object model, Presenting XML,

Using XML Processors: DOM and SAX

UNIT – II

Introduction to Servlets: Lifecycle of a Servlet, JSDK, The Servlet API, The javax.servlet

Package, Reading Servlet parameters, Reading initialization parameters.

More on Servlets: The javax.servelet HTTP package, Handling Http Request & Responses,

Using Cookies-Session Tracking, Security Issues.

UNIT – III

Introduction to JSP: The Problem with Servlet. The Anatomy of a JSP Page, JSP Processing. JSP

Application Design with MVC architecture. AJAX.

JSP Application Development: Generating Dynamic Content, Using Scripting Elements, Implicit

JSP Objects, Conditional Processing. Accessing a Database from a JSP Page Application.

UNIT – IV

Displaying Values Using an Expression to Set an Attribute, Declaring Variables and Methods

Error Handling and Debugging Sharing Data between JSP pages, Requests, and Users Passing

Control and Date between Pages.

UNIT – V

Introduction to Perl, PHP, ASP, ASP.Net, VBScript

TEXT BOOKS

1. Jeffrey C Jackson, “Web Technologies: Computer Science Perspective, 2006

REFERENCE BOOKS

1. Web Programming, building internet applications, Chris Bates 2nd edition, WILEY

Dreamtech

2. Java Server Pages by Hans Bergsten, SPD O’Reilly

3. Servlets and java server Pages - volume 1: core technologies , Marty Hall and Larry

Brown Pearson