www.jntuworld.

com

www.android.jntuworld.com
M. TECH. (PARALLEL COMPUTING)-R13 Regulations

www.jwjobs.net

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD
(Established by an Act No.30 of 2008 of A.P. State Legislature) Kukatpally, Hyderabad – 500 085, Andhra Pradesh (India)
M. TECH. (PARALLEL COMPUTING) (R13) COURSE STRUCTURE AND SYLLABUS I Year - I Semester Code Group Subject Advanced Data Structures and Algorithms Parallel Algorithms Parallel Computer Architecture Distributed Systems Web Services Semantic Web and Social Networks Java & Web Technologies Wireless Networks and Mobile Computing Information Retrieval Systems Neural Networks Parallel Algorithms Lab Seminar Total Subject Distributed Databases Grid and Cloud Computing Adhoc and Sensor Networks Information Security Machine Learning Pattern Recognition Data Mining Storage Area Networks Advanced Computer Networks Pervasive Computing Grid Computing Lab Seminar Total Subject Comprehensive Viva Project Seminar Project Work Total Subject Project Work and Seminar Total L 3 3 3 3 3 T/P/D 0 0 0 0 0 C 3 3 3 3 3

Elective -I

Elective -II

3

Lab

I Year II Semester Code Group

Elective -III

Elective -IV

II Year I Semester Code Group

J

Lab

T N

W U

R O
0 18 L 3 3 3 3 3 3 0 18 L 0 L -

D L
0 3 3 3 2 2 22 C 3 3 3 3 3 T/P/D 0 0 0 0 0 0 3 3 3 T/P/D 3 3 T/P/D 2 2 22 C 2 2 18 22 C 22 22

II Year II Semester Code Group

www.jntuworld.com

www.jntuworld.com

www.android.jntuworld.com
M. TECH. (PARALLEL COMPUTING)-R13 Regulations

www.jwjobs.net

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Tech – I Year – I Sem. (Parallel Computing) ADVANCED DATA STRUCTURES AND ALGORITHMS Objectives: The fundamental design, analysis, and implementation of basic data structures. Basic concepts in the specification and analysis of programs. Principles for good program design, especially the uses of data abstraction. Significance of algorithms in the computer field Various aspects of algorithm development Qualities of a good solution UNIT I Algorithms, Performance analysis- time complexity and space complexity, Asymptotic Notation-Big Oh, Omega and Theta notations, Complexity Analysis Examples. Data structures-Linear and non linear data structures, ADT concept, Linear List ADT, Array representation, Linked representation, Vector representation, singly linked lists -insertion, deletion, search operations, doubly linked lists-insertion, deletion operations, circular lists. Representation of single, two dimensional arrays, Sparse matrices and their representation. UNIT II Stack and Queue ADTs, array and linked list representations, infix to postfix conversion using stack, implementation of recursion, Circular queue-insertion and deletion, Dequeue ADT, array and linked list representations, Priority queue ADT, implementation using Heaps, Insertion into a Max Heap, Deletion from a Max Heap, java.util package-ArrayList, LinkedList, Vector classes, .Stacks and Queues in java.util,Iterators in java.util. UNIT III Searching–Linear and binary search methods, Hashing-Hash functions, Collision Resolution methods-Open Addressing, Chaining, Hashing in java.util-HashMap, HashSet, Hashtable . Sorting –Bubble sort, Insertion sort, Quick sort, Merge sort, Heap sort, Radix sort, comparison of sorting methods. UNIT IV Trees- Ordinary and Binary trees terminology, Properties of Binary trees, Binary tree ADT , representations, recursive and non recursive traversals, Java code for traversals, Threaded binary trees. Graphs- Graphs terminology, Graph ADT, representations, graph traversals/search methods-DFS and BFS, Java code for graph traversals, Applications of Graphs-Minimum cost spanning tree using Kruskal’s algorithm, Dijkstra’s algorithm for Single Source Shortest Path Problem. UNIT V Search trees- Binary search tree-Binary search tree ADT ,insertion, deletion and searching operations, Balanced search trees, AVL trees-Definition and examples only, Red Black trees – Definition and examples only, B-Trees-definition, insertion and searching operations, Trees in java.util-TreeSet, TreeMap Classes, Tries(examples only),Comparison of Search trees. Text compression-Huffman coding and decoding, Pattern matching-KMP algorithm. TEXT BOOKS: 1. Data structures, Algorithms and Applications in Java, S.Sahni, Universities Press. rd 2. Data structures and Algorithms in Java, Adam Drozdek,3 edition, Cengage learning. 3. Data structures and Algorithm Analysis in Java, M.A. Weiss, 2nd edition, Addison-Wesley (Pearson Education). REFERENCE BOOKS: 1 Java for Programmers, Deitel and Deitel, Pearson education. 2. Data structures and Algorithms in Java, R.Lafore, Pearson education. th 3 Java: The Complete Reference, 8 editon, Herbert Schildt, TMH.

J

T N

W U

R O

D L

www.jntuworld.com

www.jntuworld.com

www.android.jntuworld.com
M. TECH. (PARALLEL COMPUTING)-R13 Regulations
rd

www.jwjobs.net

4

Data structures and Algorithms in Java, M.T.Goodrich, R.Tomassia, 3 edition, Wiley India Edition. 5 Data structures and the Java Collection Frame work, W.J.Collins, Mc Graw Hill. 6 Classic Data structures in Java, T.Budd, Addison-Wesley(Pearson Education). 7 Data structures with Java, Ford and Topp, Pearson Education. 8 Data structures using Java, D.S.Malik and P.S.Nair, Cengage learning. 9 Data structures with Java, J.R.Hubbard and A.Huray, PHI Pvt. Ltd. 10 Data structures and Software Development in an Object-Oriented Domain, 11 J.P.Tremblay and G.A.Cheston, Java edition, Pearson Education.

J

T N

W U

R O

D L

www.jntuworld.com

simulation of one model from another one. Combinations. Cengage Learning. Chapman & Hall/CRC. TEXTBOOK: 1. Fully Connected model.L.A. UNIT-III Parallel Sorting Networks.android.jntuworld. Kth element in X+Y on PRAM. Chapman &Hall/CRC. K. Example to illustrate Cost-optimal algorithmssuch as summation.jntuworld. Cost optimality. Solution of Linear Equation. MCC.Berman and J. Perfect Shuffle Computers. UNIT-II Performance Measures of Parallel Algorithms.com www. 4. linear array on UNIT-IV Parallel Searching Algorithm.Permutation. Handbook of Parallel Computing.A.Legrand. Root finding. Butterfly. A.Paul. (Parallel Computing) PARALLEL ALGORITHMS Objectives:  To learn parallel and distributed algorithms development techniques for shared memory and message passing models. Algorithms.jntuworld.  To study the main classes of parallel algorithms. www. LMCC. TECH.Rajasekaran.com . search and traversal. Combinatorial Algorithms.com M. Henri Casanova. EREW models.Taylor and Francis Group. UNIT-I Sequential model.Connected Graphs. UNIT-V Graph Algorithms . Cube Connected Cycle. “Designing Efficient Algorithms for Parallel Computer” by Mc Graw Hill. 2. Derangements. Quinn. Tech – I Year – I Sem. Tree model.J.jwjobs. REFERENCE BOOKS: 1. need of alternative model.  To study the complexity and correctness models for parallel algorithms. J T N W U R O D L CREW/EREW/MCC/. 3. Hypercube. John Reif. speed-up and efficiency of PA. Taylor and Francis Group. Y. Pyramid model. Parallel Algorithms. Vector-Matrix Multiplication. Kth element. M.www.Lynch. Distributed Algorithms. Parallel Matrix Transportation and Multiplication Algorithm on PRAM. (PARALLEL COMPUTING)-R13 Regulations www. parallel computational models such as PRAM. PRAM-CREW. Elsevier.Robert. Morgan Kaufmann Publishers. Parallel Merging Algorithms Parallel Sorting Networks on CREW/EREW/MCC/. S. N.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Min/Max on various models.

Morgan Kaufmann Publishers. Tech – I Year – I Sem.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Anoop Gupta. UNIT-III Snoop-Based Multiprocessor Design: Correctness Requirements. TECH. Synchronization. UNIT-V Latency Tolerance: Overview of Latency Tolerance. Interconnection Network Design: Basic Definitions.2002 2. Design Challenges for Directory Protocols. Multithreading in a Shared Address Space. Id E Culler. Data Access and Communication in a Multi memory System. Overcoming Capacity Limitations. Flow Control. Mc Graw Hill. Performance Parameters and Protocol Performance. Gulf Professional Publishing. Evaluating Design Trade-Offs in Network Topology. India . Memory-Based Directory Protocols: The SGI Origin System. TEXT BOOKS: 1. Assessing Protocol Design Trade-offs.  To explain the meaning of Pipeline processing and describe pipeline processing Architectures.jntuworld. Jaswider Pal Singh.android.  To describe architectures based on associative memory organizations. Design Space for Snooping Protocols. Multilevel Cache Hierarchies. superscalar and vector processing and their Architectures.com www. (Parallel Computing) PARALLEL COMPUTER ARCHITECTURE Objectives:  To identify the differences between scalar.  To explain the concept of multithreading and its use in parallel computer architecture. Proceeding past Long-Latency Events. Latency Tolerance in a Shared Address Space. Routing.www. J T N W U R O D L www. REFERENCE BOOK: 1.jntuworld. 3. Lockup-Free Cache Design. Assessing Directory Protocols and Trade-Offs. Latency Tolerance in Explicit Message Passing. Synchronization. UNIT-I Parallel Computer Architecture: Trends. Inc. Implications for Software.jwjobs. Mogan Kaufman. John L.jntuworld. Elsevier Science. Split-Transaction Bus. Jaswinder Pal Singh and Anoop Gupta “ Parallel Computer Architecture”. Implications for Programming Models. UNIT-II Shared Memory Multiprocessors: Cache Coherence. Case Studies. Overview of Directory Based approaches. Basic Communication Performance. Kai Hwang. Advanced Computer Architecture. Implications for Parallel Software. Hennessy & David A Patterson. Extending Cache Coherence. Putting It All Together: A Taxonomy and simple COMA. Future Directions: Technology and Architecture. Block Data Transfer in a Shared Address Space. Precommunication in a Shared Address Space.com M. Switch Design. Culler. Computer Architecture A Quantitative Approach. Fundamental Design Issues Programming for Performance: Partitioning for Performance. Memory Consistency. Cache-Based Directory Protocols: The Sequent NUMA-Q. Implications for Parallel Software.com . David E. UNIT-IV Hardware / Software Trade-Offs: Relaxed Memory Consistency Models. Advanced Topics. Directory – Based Cache Coherence: Scalable Cache Coherence. Convergence of Parallel Architecture. Parallel Computer Architecture: A Hardware/Software Approach. 1999. Case Studies: SGI Challenge and Sun Enterprise 6000. 1996. Reducing Hardware Cost. (PARALLEL COMPUTING)-R13 Regulations www. Interconnection Topologies. Applications and System Software. Organizational Structure. Advanced Topics.

System models-Introduction. Communication and Invocation.802. G Coulouris. Digital signatures. Peer to Peer middleware. File Service architecture.com M. global states. Case study of the Global Name Service. distributed debugging. logical time and logical clocks. Clocks. System model and group communication.500 Directory Service. Resource sharing and web. Distributed mutual exclusion. Release consistency and Munin case study. OS layer. be able to recognize when this is not possible. etc. UNIT III Peer to Peer Systems–Introduction. Processes and Threads. Distributed shared memory.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Case study of the X.  To design a distributed system that fulfills requirements with regards to key distributed systems properties (such as scalability. Architectural and Fundamental models. Overlay case studies-Pastry.com www. Transactions.jntuworld. UNIT II Operating System Support. UNIT V Security-Introduction. Communication between distributed objects. Name Services-Introduction. Transaction recovery.11 Wi-Fi. Synchronizing physical clocks. Distributed File SystemsIntroduction. TEXT BOOKS: Distributed Systems Concepts and Design. Networking and Internetworking. Concurrency control in distributed transactions. Case study-Java RMI. and evaluate the effectiveness and shortcomings of their solutions. Sequential consistency and Ivy case study. and what the desired properties of such systems are. Optimistic concurrency control. Distributed deadlocks. Distributed Transactions-Introduction. Locks. Design and Implementation issues.TLS. Time and Global States-Introduction.Introduction. Cryptographic algorithms. Coordination and Agreement-Introduction. Ocean Store. Napster and its legacy. Interprocess Communication. Events and notifications.jwjobs. J T N W U R O D L www. TECH. CORBA case study-Introduction. Case studies-Kerberos. Elections. Timestamp ordering. Fourth Edition. Operating system architecture.SUN network file systems. transparency. (PARALLEL COMPUTING)-R13 Regulations www.com . Protection. Multicast communication. Examples of Distributed systems. Flat and Nested Distributed Transactions. Tech – I Year – I Sem. Name Services and the Domain Name System. challenges. RPC.android. explain how they affect the software design. and be able to identify features and design decisions that may cause problems. Routing overlays. events and Process states. and explain why.jntuworld. Transactions with replicated data. Application case studies-Squirrel.  To list the principles underlying the functioning of distributed systems. Nested Transactions. CORBA RMI. consensus and related problems. Other consistency models. UNIT IV Transactions and Concurrency control-Introduction. CORBA Services.www. Overview of Security techniques. J Dollimore and T Kindberg. case study. Distributed objects and Remote Invocation-Introduction.  To build distributed system software using both basic OS mechanisms as well as higher-level middleware and languages. Pearson Education.). Comparison of methods for concurrency control.  To recognize how the principles are applied in contemporary distributed systems. (Parallel Computing) DISTRIBUTED SYSTEMS Objectives:  To explain what a distributed system is. Replication-Introduction. UNIT I Characterization of Distributed Systems-Introduction. why you would design a system as a distributed system.jntuworld. Fault tolerant services. describe the problems and challenges associated with these principles. Atomic commit protocols. Tapestry.

N G Shivarathri. Pradeep K. rp 2010. Distributed Systems – Principles and Paradigms.jntuworld.jntuworld. Pearson Education. Principles. J T N W U R O D L www. PHI. S. Distributed Operating Systems Concepts and Design.jwjobs. S. T. Steen.www. Distributed Operating Systems.Kshemakalyani and Mukesh Singhal. 2010.Birman. (PARALLEL COMPUTING)-R13 Regulations www. Algorithms and Systems. Taylor & Francis Group.Shah.Mahajan and S. Advanced Concepts in Operating Systems. R.com . TMH.Tanenbaum. A.Sinha. Pearson education.com www. Reliable Distributed Systems. Tanenbaum and M. REFERENCE BOOKS: Distributed Computing. Pearson. M Singhal.P. Springer.S.V.net Distributed Systems.Johnson. Chapman &Hall/CRC. Distributed Operating Systems and Algorithm Analysis.com M. A. Oxford University Press.android.Chow. Distributed Computing.S.Ghosh. TECH. K.jntuworld. Cambridge. Ajay D.

Nagappan. Chatterjee. S. SOAP communication and messaging. web services communication. role of J2EE and XML in distributed computing. Core distributed computing technologies – client/server.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M.com M. UNIT V Web Services Interoperability – Means of ensuring Interoperability.Coyle. Pearson Education. 2. R. Webber. 2008. developing web services enabled applications.P.android. Micro Soft DCOM. G. J2EE Web Services.jwjobs. WSDL bindings. McGovern. 2. XML encryption. limitations of UDDI.P.A. Developing Java Web Services. UDDI data structures. basic steps of implementing web services. Jewell. Chappell & T. Web Services Security – XML security frame work. 2005. emergence of Web Services and Service Oriented Architecture (SOA). 2008.com . support for categorization in UDDI Registries. Springer. REFERENCE BOOKS: 1. Web Services. R.www. UDDI – UDDI Registries.NET and J2EE. service discovery mechanisms. (PARALLEL COMPUTING)-R13 Regulations www. tools and technologies enabling web services. benefits and challenges of using web services .com www. 3. MOM. Challenges in Distributed Computing.jntuworld. WSDL Tools. Alonso. 3. JAVA RMI. Publishing information to a UDDI Registry. guidelines for signing XML documents. SOAP encoding. Programming with UDDI.jntuworld. Pearson Edn. J. Graham and others. Tech – I Year – I Sem. F. 2008.SPD. Publishing API. R. Richard Monson-Haefel.2005. Web Services. searching information in a UDDI Registry. limitations of WSDL Discovering Web Services – Service discovery. limitations of SOAP. TEXT BOOKS: J T N W U R O D L 1.jntuworld.. XKMS structure. et al. S. SOAP security . deleting information in a UDDI Registry. D. compliance testing and load testing of Web Services  To Identify bug-finding ideas in testing Web Services UNIT I Evolution and Emergence of Web Services . XML digital signature. TECH..Developing Web Services using SOAP – Building SOAP Web Services. anatomy of WSDL definition document. role of service discovery in a SOA. 5. Developing Enterprise Web Services. Pearson Education. developing SOAP Web Services using Java. Pearson Education. CORBA. Casati and others. Web Services life cycle. 4. XML. Sriganesh. rp – www. Wiley India. Morgan Kaufmann Publishers. (Parallel Computing) WEB SERVICES (ELECTIVE-I) Objectives:  To Understand paradigms needed for testing Web Services  To explore different Test Strategies for SOA-based applications  To implement functional testing. “Java Web Services Architecture”. Java Web Services. core building blocks of web services. and the Data Revolution.Evolution of distributed computing. standards and technologies available for implementing web services. Overview of . basic operational model of web services. UNIT II Introduction to Web Services – The definition of web services. UNIT IV Describing Web Services – WSDL – WSDL in the world of Web Services. UNIT III Core fundamentals of SOAP – SOAP Message Structure. 2nd Edition. O’Reilly. Skoczylas. SOAP message exchange models. F.Web Services Architecture – Web services Architecture and its characteristics. Building Web Services with Java. uses of UDDI Registry.

Web Search Agents and Semantic Methods. (Parallel Computing) SEMANTIC WEB AND SOCIAL NETWORKS (ELECTIVE-I) Objectives:  To learn Web Intelligence  To learn Knowledge Representation for the Semantic Web  To learn Ontology Engineering  To learn Semantic Web Applications. Semantic Web and Semantic Web Services -Liyang Lu Chapman and Hall/CRC Publishers.www. Machine Intelligence. Godel and Turing. Social Networks and the Semantic Web . Electronic Sources for Network Analysis – Electronic Discussion networks.OntologyWebLanguage(OWL). John Wiley & Sons. Semantic Bioinformatics.Warren. TECH. J.jntuworld. Creating an OWL-S Ontology for Web Services.T.The World Wide Web.Evans. Limitations of Today’s Web.Taylor. O’Reilly.com . 4. Tech – I Year – I Sem. e-learning.UML.XML Based Web Services. Trends and Research in Ontology Based Systems. (PARALLEL COMPUTING)-R13 Regulations www. Services and Technology Semantic Web applications and services. Web Based Networks. C. www. Wiley interscience. Logic.jntuworld. TEXT BOOKS: J T N W U R O D L 1.com www. Springer Publications.Peter Mika. development of the social networks analysis.2008. Logic on the semantic Web. J. Blogs and Online Communities. 2. Ontologies Languages for the Semantic Web – ResourceDescriptionFramework(RDF)/RDFSchema. Berners-Lee www. Ontology Libraries and Ontology Mapping. Semantic Road Map. Ontology Sharing and Merging. The Information Age .jwjobs. Services and Technology  To learn Social Network Analysis and semantic web UNIT I Web Intelligence Thinking and Intelligent Web Applications.Springer.Studer. P. UNIT V Social Network Analysis and semantic web What is social Networks analysis. Information Sharing on the semantic Web .jntuworld. The Next Generation Web. Programming the Semantic Web.2007. Artificial Intelligence.android. Constructing Ontology. 2.Segaran. Semantic Search Technology. Ontology Methods. UNIT IV Semantic Web Applications. Semantic Web Technologies. REFERENCE BOOKS: 1.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Software Agents. UNIT II Knowledge Representation for the Semantic Web Ontologies and their role in the semantic web.Berners Lee. Rule and Inference Engines.(Taylor & Francis Group) 3. Knowledge Base . Inference engines.SPD.Heiner Stuckenschmidt. Ontology. Thinking on the Web . UNIT III Ontology Engineering Ontology Engineering. XML/XML Schema.com M. Ontology Development Tools. Semantic Search.Davies. Building Semantic Web Applications with social network features. R. Frank Van Harmelen.

Requests. Tech – I Year – I Sem.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. UNIT I HTML Common tags. Document Object model.4. JSP Processing.servelet HTTP package. Java Beans API.www. Handling Swing Controls like Icons – Labels – Buttons – Text Boxes – Combo – Boxes – Tabbed Pains – Scroll Pains – Trees – Tables Differences between AWT Controls & Swing Controls Developing a Home page using Applet & Swing. Dynamic HTML with Java Script. WILEY Dreamtech (UNIT 1..servelet Package. Tables. Objects in Java Script. Handling Http Request & Responses.sql.* package Accessing a Database from a JSP Page Application – Specific Database Actions Deploying JAVA Beans in a JSP Page J T N W U R O D L TEXT BOOKS: 1. TECH. The complete Reference Java 2 Fifth Edition.jwjobs. images. Using XML Processors: DOM and SAX Review of Applets. Customizes. SPD O’Reilly (UNITs 3. Event Handling. UNIT IV More on Servlets: The javax.com M. UNIT III Java Beans: Introduction to Java Beans. Chris Bates 2 edition. Cascading Style sheets. Using Cookies-Session Tracking.jntuworld. 3. Programming world wide web-Sebesta. Using Bound properties.com . 2) 2. Reading Initialization parameters. XML Schemas. 2. Patrick Naughton and Herbert Schildt. Introduction to Servelets: Lifecycle of a Serverlet. forms. Web Programming. The javax. (PARALLEL COMPUTING)-R13 Regulations www. Dietel and Nieto PHI/Pearson. Using Scripting Elements Implicit JSP Objects. UNIT V JSP Application Development: Generating Dynamic Content. Bean Info Interface. Advantages of Java Beans. Security Issues. AJAX. The Anatomy of a JSP Page. Pearson Core SERVLETS ANDJAVASERVER PAGES VOLUME 1: CORE TECHNOLOGIES. Conditional Processing – Displaying Values Using an Expression to Set an Attribute.List. Introduction to JSP: The Problem with Servelet. Introduction to Swing: JApplet. Introduction to Java Scripts.3) 3. AWT Programming. JSDK The Servelet API. Java Server Pages –Hans Bergsten.5) REFERENCE BOOKS: 1. JSP Application Design with MVC architecture. Declaring Variables and Methods Error Handling and Debugging Sharing Data Between JSP pages. Marty Hall and Larry Brown Pearson Internet and World Wide Web – How to program. and Users Passing Control and Date between Pages – Sharing Session and Application Data – Memory Usage Considerations Database Access Database Programming using JDBC Studying Javax.com www. Presenting XML. Class. TMH (Chapters: 25) (UNIT 2. Frames. Reading Servelet parameters. (Parallel Computing) JAVA & WEB TECHNOLOGIES (ELECTIVE-I) Objectives:  To learn the basics of java Console and GUI based programming  To introduce XML and processing of XML Data with Java  To introduce Server side programming with Java Servlets and JSP  To introduce Client side scripting with JavaScript and AJAX.jntuworld.android. nd www. Constrained properties Persistence.jntuworld. building internet applications. Web servers: Tomcat Server installation & Testing. BDK Introspection. CSS UNIT II XML: Document type definition.

Murach.jntuworld. Jakarta Struts Cookbook.Ivan Bayross and others. S P D O’Reilly for chap 8. 9. 7.net 4.Flanagan. 8. SPD An Introduction to web Design and Programming –Wang-Thomson Professional Java Server Programming.www. 5.SPD. S.jntuworld.android. SPD Web Warrior Guide to Web Programmming-Bai/Ekedaw-Thomas Beginning Web Programming-Jon Duckett WROX. J T N W U R O D L www. O’Reilly. TECH. Pearson.Allamaraju and others Apress(dreamtech).com . Bill Siggelkow. Murach’s beginning JAVA JDK 5. 11. Java Script. (PARALLEL COMPUTING)-R13 Regulations www. 10. 12. 6.com www. Pekowsky. Java Server Programming .jwjobs. Java Server Pages.jntuworld. The X Team. D.com M.

Ivan Stojmenovic. HIPERLAN 2.com . SPD O’REILLY. Tunneling and Encapsulation. Mobile Devices. “Mobile Computing”. Optimizations. Matthew S.11a.11: System Architecture. 2. (Parallel Computing) WIRELESS NETWORKS AND MOBILE COMPUTING (ELECTIVE – II) Objectives:  To understand GSM and UMTS architectures  To have an in-depth knowledge of mobile computing  To understand Mobile network layer and transport layer  To understand Bluetooth technology UNIT I WIRELESS NETWORKS: Wireless Network.11b. Mobile TCP. “Mobile Computing”. OXFORD UNIVERSITY PRESS. Indirect TCP. 5. 802. Infrastructure and Ad-hoc Network. Newer Developments. “Handbook of Wireless Networks and Mobile Computing”. Hui Chen. “Mobile Computing”. Handbook of Security of Networks. et al “Wireless and Mobile Networks: Concepts and Protocols”. Asoke K Talukder. UMTS: UMTS System Architecture.jntuworld. Mobile System Networks. 802. Yang Xiao. Protocols. 2011. Bluetooth : User Scenarios. 2007. Wireless Network Architecture. “Mobile Communications”. UNIT III GLOBAL SYSTEM FOR MOBILE COMMUNICATIONS (GSM): Mobile Services. 2008. System Architecture. Transaction oriented TCP.com www. IP Packet Delivery. Security.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. “802. Tech – I Year – I Sem. 2008. Second Edition. Wireless Switching Technology. 2. Agent Discovery.11 Wireless Networks”. 3. Mobility Management UNIT II WIRELESS LAN: Infra red Vs radio transmission. Frank H Li. Fast retransmit/fast recovery.com M.www. Snooping TCP. Assumptions. MOBILE COMPUTING: Mobile communication. et al. Dynamic Host Configuration Protocol (DHCP) UNIT V MOBILE TRANSPORT LAYER: Traditional TCP. 4. Sunilkumar. Wireless Networking Issues & Standards. World Scientific. Pearson. (PARALLEL COMPUTING)-R13 Regulations www. Architecture. Localization & Calling. TECH. Dr. 3. Wiley India. Wireless Network Reference Model. Mobile Computing Architecture. Jochen Schiller. Kumkum Garg. Selective retransmission.jwjobs. Transmission /time-out freezing. Registration. Wiley.5G/3G Wireless Networks. J T N W U R O D L www. REFERENCES BOOKS: 1. Wireless Communication problem. TEXT BOOKS: 1.jntuworld. GPRS: GPRS System Architecture. HIPERLAN 1.Gast.jntuworld. Raj Kamal. IEEE 802. TCP over 2. Pearson Education. Mobile computing. Entities and Terminology. Protocol Architecture. Tata McGraw Hill. LTE: Long Term Evolution UNIT IV MOBILE NETWORK LAYER: Mobile IP: Goals. Handover.android.

Information Retrieval: Algorithms and Heuristics.jntuworld. Web crawling and indexes. Manning and Prabhakar Raghavan and Hinrich Schütze. David A Grossman and Ophir Frieder.com . term weighting and the vector space model. (Parallel Computing) INFORMATION RETRIEVAL SYSTEMS (ELECTIVE. Introduction to Information Retrieval . Flat clustering. UNIT I Boolean retrieval.jntuworld. Index construction. J T N W U R O D L www. Cambridge University Press.android.II) Objectives:  To use different information retrieval techniques in various application areas  To apply IR principles to locate relevant information large collections of data  To analyze performance of retrieval systems when dealing with unmanaged data sources  To implement retrieval systems for web search tasks. Vector space classification. Modern Information Retrieval. Mark T Maybury. Evaluation in information retrieval. Christopher D.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Matrix decompositions and latent semantic indexing. Information Storage & Retrieval. Probabilistic information retrieval. 3. 2. 2008. Ricardo Baeza-Yates. 1992.com M. UNIT II Scoring. John Wiley & Sons. REFERENCE BOOKS: 1. (PARALLEL COMPUTING)-R13 Regulations www. William B Frakes. Robert Korfhage . Pearson Education. TECH. Dictionaries and tolerant retrieval. Relevance feedback and query expansion. Text classification. The term vocabulary and postings lists. Ricardo BaezaYates. Springer. 2nd Edition. Tech – I Year – I Sem.com www. Information Storage and Retrieval Systems: Theory and Implementation. Computing scores in a complete search system. Index compression. 2004.jntuworld. Springer. 2007. UNIT III XML retrieval. UNIT V Web search basics. UNIT IV Support vector machines and machine learning on documents. 4. Information Retrieval Data Structures and Algorithms. Kowalski.www. Language models for information retrieval. TEXT BOOK: 1.jwjobs. 5. Link analysis. Pearson Education. Hierarchical clustering. Gerald.

Pearson Education 2004 J T N W U R O D L Edition www. Memory based learning. no’s 680-701.com . manipulation of attarctors as a recurrent network paradigm (p. (p. feature detection. (PARALLEL COMPUTING)-R13 Regulations www. neurodynamical models.1 –9. Unconstrained Organization Techniques.jwjobs. Pearson Education 2 2004 REFERENCE BOOKS: 1. Li Min Fu.jntuworld. Neural networks in Computer intelligence. Adaption. Hessian matrix. TECH. Learning rate annealing techniques. supervised learning. Linear least square filters.android. ‘UNIT I INTRODUCTION . 2005 2.7 –14. learning curves. James A Freeman David M S Kapura. computer experiment I (p. no’s 50 –116) SINGLE LAYER PERCEPTRONS – Adaptive filtering problem. no’s 202 –234) UNIT IV SELF ORGANIZATION MAPS – Two basic feature mapping models.com M.www.8 ) UNIT V NEURO DYNAMICS – Dynamical systems. Neural networks A comprehensive foundations. Accelerated convergence. least mean square algorithm.What is a neural network? Human Brain. TMH 2003 3. Artificial neural networks . Hierechel Vector quantilizer.  To practical approach for using artificial neural networks in various technical. Adaptive patter classification.jntuworld. Heuristics. Prentice Hall. organizational and economic applications. Boltzmann learning.back propagation and differentiation. Statistical nature of the learning process.B. Knowledge Representation. Neural networks viewed as Directed Graphs. Relation between perceptron and Bayes classifier for a Gaussian Environment (p. attractors. no’s 1 –49) LEARNING PROCESS – Error Correction learning. perceptron –convergence theorem. Generalization.1 –14.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. contexmel Maps (p. no’s 443 –469. (p. no’s 664 –680. (Parallel Computing) NEURAL NETWORKS (ELECTIVE. Tech – I Year – I Sem. Virtues and limitations of back propagation learning. Network pruning Techniques. Network Architectures.com www. stavility of equilibrium states. Artificial Intelligence and Neural Networks (p. computer simulations. Hebbian learning UNIT II Competitive. learning vector quantization. Models of a Neuron. properties of feature map. Credit Assignment Problem. no’s 117 –155) UNIT III MULTILAYER PERCEPTRON – Back propagation algorithm XOR problem.jntuworld. Output representation and decision rule.8) TEXT BOOK: nd 1. 9. Memory. (p. Cross validation. SOM algorithm. Simon Haykin. 14.II) Objectives:  To survey of attractive applications of artificial neural networks.Yegnanarayana. 14.6) HOPFIELD MODELS – Hopfield models. Neural networks. Self organization map. Comuter experiment. no’s 156 –201) BACK PROPAGATION .

.android. The channel should be used to communicate stream of integer values 1. and conduct experiments to compare the performance of the two versions. Use this template to implement simple reduction. both within the same processor and on remote processors. Design and implement a program that can be used to quantify CC ++ processor object and thread creation costs. 6. the tree is not represented by an explicit data structure. 17. Coupled Climate Model: Implement a coupled climate modeling system comprising I an ocean model and an atmosphere model which can be structured as ct parallel. 1992. 3. the latter routine may perform global communication. 1. Use this module to implement the database search problem described in that section. 16. Modify the program developed above to use spawn to implement the RPC used for a send operation. 7. In the program. 9. These names are read from a file. Provide a constructor for the processor object class Tree that copies the Mapping object to each new processor object as it is created. and connects them with a channel.jntuworld. 12.neighbor communication and a reduction routine used to detect termination. Composition of the two component models. developed above. 15. instead. which returns a proc_t structure on a randomly selected processor. Search (I): Develop a program that uses processor objects and the par construct to implement a prototypical tree-structured computation. in which each model executes on one half of P processors as described in the text book. (PARALLEL COMPUTING)-R13 Regulations www.com . Use these constructs to implement a simple shared queue class. Design and construct a decentralized version of the manager/worker structure. Tech – I Year – I Sem. One of the processor object allocation should call in the search function is augmented with a "call to random_p. t1 t2 Conduct experiments to measure these costs. Search (II): Define a global Mapping object and initialize at the beginning of main to contain the names of the processors on which the program is to execute. 2. Develop a program to provide a 2-D decomposition of principal data structures. C++ implementation of the manager/worker structure used in the parameter study problem. The program should explore a binary tree recursively creating a task (processor object + thread) for each tree node and returning the total number of leaf nodes that represent solutions. and obtain estimates for and .com www. 13. and broadcast algorithms.100 from foundry to bridge. Extend the channel library to allow polling for pending messages.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M.computation used to illustrate sequential composition. vector reduction. Bridge Construction: Develop a program to create two tasks. followed by the value --I to signal termination. Extend the above program to allow for non binary trees: that is.jwjobs. This class can be used to implement channel communication between two concurrently executing producer and consumer tasks: we simply allocate a queue object and provide both tasks with pointers to this object.com M.communication costs on various parallel computers. 5. J T N W U R O D L REFERENCE BOOK: 1. Extend the channel library to provide a merger that allows multiple senders on a channel. 4. 10. www. 14. Design and construct a C.jntuworld. Channel Communication: Global pointers and sync variables can be used to implement a variety of communication mechanisms. II. Design and carry out experiments to determine when each version is more efficient.  To design and implement the parameter study problem. foundry and bridge. Finite Difference: We apply the two approaches to the SPMD finite difference . This computation may be structured as a sequence of calls to a finite difference routine that performs nearest.jntuworld. Construct a CC++ imp1ementation of the tuple space module. Implement a hypercube communication template. trees with an arbitrary number of subtrees rooted at each node.www. Introduction to Parallel algorithms by Jaja from Pearson. (Parallel Computing) PARALLEL ALGORITHMS LAB Objectives:  To implement the various tree structures. Implement and instrument the channel library and use this code to measure CC++ . 8. a process's position in the tree is represented by an integer. TECH.  To implement the RPC concepts.

Distributed Object Storage. 2009 2.jntuworld. Catalog Management in Distributed Databases. Principles of Distributed Databases. Concurrency Control based on Timestamps. PUSH-Based Technologies J T N W U R O D L TEXT BOOKS: 1. Distributed Database Administration. Nonblocking Commitment Protocols. Tech – I Year – II Sem.jwjobs. Object Management Architecture CORBA and Database interoperability. Transaction Management. Query Execution. Query Processing Issues. Distributed database systems by Chhanda Ray from Pearson Education.android. Alternative Client/Server Architectures. Integrity Constraints in Distributed Databases. Types of Data Fragmentation. TMH. Levels Of Distribution Transparency. Concurrency Control for Distributed Transactions. Query Processing Query Processing Layers in Distributed Multi-DBMSs. UNIT IV Reliability. Equivalence transformations for Queries. Scheme Translation. Object Identifier Management. Giuseppe Pelagatti. Parametric Queries. Determining a Consistent View of the Network. 2. Cache Consistency. Principles of Distributed database systems by Tamer and Ozsu from Pearson. Reliability and concurrency Control. Supporting Atomicity of Distributed Transactions. REFERENCE BOOKS: 1.com www. Checkpoints and Cold Restart. Object Query Processing. Patrick Valduriez . Pearson Education. A Framework for Query Optimization.com M. Distributed Database Design. Pointer Swizzling. Object Migration. Object Query Processor Architectures. Distributed Component Object Model. Transactions as Objects Database Integration. Multidatabase Recovery.www. COM/OLE and Database Interoperability. (PARALLEL COMPUTING)-R13 Regulations www. www. Principles of Distributed Database Systems. Foundation of Distributed Concurrency Control. (Parallel Computing) DISTRIBUTED DATABASES Objectives:  To implement the Distributed databases management system concepts.jntuworld. UNIT II Translation of Global Queries to Fragment Queries. Distributed Deadlocks. Basic Concepts.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M.com . TECH. Multidatabase Concurrency Control. Join Queries. Optimistic Methods for Distributed Concurrency Control.  To enforcing Integrity Constraints to keep the database consistent  Normalizing the tables to eliminate redundancies  Querying relational data  Optimizing and processing the queries  Storage Strategies for easy retrieval of data through index UNIT I Features of Distributed versus Centralized Databases. M. Distributed Grouping and Aggregate Function Evaluation. Object Management. Query Optimization Issues Transaction Management Transaction and Computation Model. Transforming Global Queries into Fragment Queries. Detection and Resolution of Inconsistency. Authorization and Protection UNIT V Architectural Issues. General Queries. Optimization of Access Strategies. Reference Architecture for Distributed Databases. Distributed Databases Principles & Systems. A Framework for Transaction Management. Scheme Integration. Architectural Aspects of Distributed Transactions Concurrency Control. Stefano Ceri. UNIT III The Management of Distributed Transactions. 2006. 2nd Edition.jntuworld. Object Orientation and Interoperability. Transaction Management in Object DBMSs. Tamer Ozsu.

Tech – I Year – II Sem. Gautam Shroff .jntuworld. UNIT-I System models for advanced computing –clusters of cooperative computing. techniques and tools for Grid & Cloud Computing. TEXT BOOKS: 1.jntuworld. Enterprise Cloud Computing.Map Reduce Hadoop Library from Apache. Christian Vecchiola and S. Grid resource management. UNIT-III Virtualization. 2. REFERENCE BOOKS: 1. TMH.jntuworld. Pros and Cons of Cloud Computing. J T N W U R O D L www.com .Fox and Jack J Dongrra. TECH.  To understand any kind of heterogeneous resources over a network using open standards  To implement the service models. Virtualization and Cloud Computing. CRC Press. UNIT-IV Cloud programming Environmental. grid computing and cloud computing. Distributed and Cloud Computing. Features of cloud computing architectures and simple case studies.Raj Kumar Buyya. Open Source Cloud Software Systems –Eucalyptus.com www. UNIT-V Grid Architecture and Service modeling. Cambridge University Press.2012. software systems for advanced computing-service oriented software and parallel and distributed programming models with introductory details. 2.com M. Elsevier India 2012.android. Paas and Iaas. (PARALLEL COMPUTING)-R13 Regulations www. 2012.www.Characteristic features. Mastering Cloud Computing. Technology Examples/Case Studies.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M.jwjobs. Features of grid and cloud platform. Cloud Computing. Ritting House and James F Ramsome. UNIT-II Cloud Computing services models and features in Saas . Taxonomy Hypervisor.Tanurai Selvi. Grid Application trends. (Parallel Computing) GRID AND CLOUD COMPUTING Objectives:  To implement Basics. John W. Kaittwang Geoffrey C. Service oriented architecture and web services. 2012.

TOSSIM TEXT BOOKS: 1.com M. Other MAC Protocols. et al. Wireless Sensor Networks – Principles and Practice. Shih-Lin Wu. Leonidas Guibas. Design Issues.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Tech – I Year – II Sem. Subir Kumar Sarkar. Fei Hu. LA-TinyOS. Network Security Attacks. Taylor & Francis Group. Secure Routing in Ad hoc Wireless Networks UNIT IV Basics of Wireless. 3. UNIT III Security protocols for Ad hoc Wireless Networks Security in Ad hoc Wireless Networks.jntuworld. Energy consumption. UNIT V Sensor Network Hardware: Components of Sensor Mote. 2007 J T N W U R O D L www. Network Security Requirements. Wireless Sensor Networks: An Information Processing Approach. Classification of Transport layer solutions. Yu-Chee Tseng. Pearson Education. Operating System in Sensors– TinyOS.jwjobs. Classifications of Routing Protocols Transport Layer for Ad Hoc Wireless Networks Issues in Designing a Transport layer protocol for Ad hoc Wireless Networks. Carlos Corderio Dharma P. Ad Hoc and Sensor Networks – Theory and Applications. Adapting to the inherent dynamic nature of WSNs. Taylor & Francis Group. Clustering of Sensors.com . Protocols and Applications. 2010 REFERENCE BOOKS: 1. Feng Zhao. 2008. Elsevier Science imprint. B. RETOS Imperative Language: nesC. World Scientific Publications / Cambridge University Press. Auerbach Publications. C.android. Other Transport layer protocols for Ad hoc Wireless Networks. Transport layer. Sensing and Communication Range. Xiaojun Cao. 2004 2. 2005. Dataflow style language: TinyGALS. Ad hoc Networking. Issues and Challenges in Security Provisioning. Adhoc Wireless Networks – Architectures and Protocols. UNIT II Routing Protocols for Ad Hoc Wireless Networks Issues in Designing a Routing Protocol for Ad hoc Wireless Networks. 2001.S. Wireless Ad hoc Networking.Perkins. 4. (Parallel Computing) ADHOC AND SENSOR NETWORKS Objectives:  To understand the concepts of sensor networks  To understand the MAC and transport protocols for adhoc networks  To understand the security of sensor networks  To understand the applications of adhoc and sensor networks UNIT I Ad Hoc Wireless Networks Introduction.www. Design Goals for a MAC Protocol for Ad hoc Wireless Networks. Wireless Ad hoc Mobile Wireless Networks – Principles.Siva Ram Murthy. rp2009 2. Ad hoc wireless Internet MAC protocols for Ad hoc Wireless Networks Issues in Designing a MAC Protocol for Ad hoc Wireless Networks. Issues in Ad hoc wireless networks.jntuworld. Charles E.jntuworld. Applications Data Retrieval in Sensor Networks: Classification of WSNs.com www. Design goals of a Transport layer protocol for Ad hoc Wireless Networks. An Auerbach book. Routing layer. MAC layer. Morgan Kauffman Publishers. CRC Press.Murthy. \Aggarwal. ns-2 and its sensor network extension. March 2006 3. TCP over Ad hoc Wireless Networks. High-level application layer support. SOS. Sensors and Applications: The Mica Mote. Pearson Education. Classifications of the MAC Protocols. Taylor & Francis Group. TECH. Node-Level Simulators. Key Management. (PARALLEL COMPUTING)-R13 Regulations www.. Auerbach Publications.

2007.jntuworld. Gialuigi Ferrari.www.android. 2010 7. Performance and Control.jwjobs. et al. . 6. Wireless Sensor Networks – Signal processing and communications perspectives.net 5. World Scientific Publications / Cambridge University Press. 2006. 2007. World Scientific. Wireless Ad hoc and Sensor Networks – Protocols. rp2009. Ozan K. 2010.com M. rp 2010. Wiley India. Ad hoc Wireless Networks – A communication-theoretic perspective. Handbook on Sensor Networks – Yang Xiao.com . 9.com www.. Hui Chen & Frank Haizhon Li. CRC Press.Tonguz. 8. rp2009. J T N W U R O D L www. Wiley India. Ananthram Swami.. et al.jntuworld. Jagannathan Sarangapani. TECH. Raheem Beyah. Security in Ad hoc and Sensor Networks. (PARALLEL COMPUTING)-R13 Regulations www.jntuworld. Taylor & Francis Group.

Security Issues in Wireless and Mobile Communications. Some of M-Commerce Security Solutions TEXT BOOKS: 1. Application Level Security in Wireless Networks: Application of WLANs.Gupta et al. Vincent Lu.V Security for mobile commerce applications: M-Commerce Applications. TMH. Bruce Potter & Bob Fleck. 3. M-Commerce Initiatives. Need for Novel Security Schemes for UC. Types of attacks on mobile e-commerce.jntuworld.android. Security Attacks on MANETs. Panos C.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Hacking Exposed Wireless: Johnny Cache. K. UMTS security for applications.jwjobs. REFERENCE BOOKS: 1. Internal threats for MANET Applications. Tech – I Year – II Sem. and Server Levels: Mobile Devices Security Requirements.S. 3G security for applications. Security for 2g Wi-Fi Applications. TMH 2005. (PARALLEL COMPUTING)-R13 Regulations www. GPRS Security for applications. SPD O’REILLY 2005. Joshua Wright.com . GSM Security for applications. 2 Edition. 2006. Advantages and Disadvantages of Application – level Security UNIT – II Security of Device. 2010. Mobile Wireless network level Security. External Threats for MANET applications. Frank Adelstein. A Secure Mcommerce model based on wireless local area network. nd 4.jntuworld. Security problems and attacks in heterogeneous wireless networks. TMH. Threats and Solutions. 2. Some security solutions for heterogeneous wireless networks UNIT . Security Challenges for UC. Security for Mobile Applications. Server Level Security. Security Challenges in mobile e-commerce. Lekkas. Security – Wired Vs Wireless. Wireless Security Models. Application Level Security in Heterogeneous wireless networks: Introduction. Security Challenges in MANETs. MANET Features. Fundamentals of Mobile and Pervasive Computing.www.com M. Some applications of MANETs. Wireless & Mobile Network Security: Pallapa Venkataram. Security Issues and attacks in cellular networks. Recent Security Schemes for Wi-Fi Applications UNIT – III Application Level Security in Cellular Networks: Generations of Cellular Networks. Security for 1g Wi-Fi Applications. TECH. 2. (Parallel Computing) INFORMATION SECURITY Objectives:     To learn Security Issues in Mobile Communication To learn Application Level Security in Cellular Networks.com www.11 Security. Security Requirements in Wireless and Mobile Communications. MANETs To learn Application Level Security in Ubiquitous networks To learn Security for mobile commerce applications UNIT – I Security Issues in Mobile Communication: Mobile Communication History. Network. Satish Babu. Heterogeneous network application in Disaster management. Nichols. 802. Application Level Security in MANETs: MANETs.jntuworld. Randall k. Wireless Threats. Some of the Security Solutions UNIT – IV Application Level Security in Ubiquitous networks: Ubiquitous Computing. Some of Security and authentication Solutions. Guide to Wireless Network Security. Security Attacks on UC networks. Springer. Some Vulnerabilities and Attach Methods over WLANs. Some of the Heterogeneous wireless network architectures. J T N W U R O D L www. Some of the security solutions for UC. Mc Graw Hill.

Gibs algorithm. Relationship to Dynamic Programming www. Using Prior Knowledge to Augment Search Operators. Inductive-Analytical Approaches to Learning. Learning First Order Rules. Temporal Difference Learning. Sample Complexity for infinite Hypothesis Spaces. Generalizing from Examples. k -Nearest Neighbor Learning. Bayes theorem. Find-S: finding a maximally specific hypothesis. Estimation hypothesis accuracy. Perceptions. The basic decision tree learning algorithm. The Learning Task. Explanation-Based Learning of Search Control Knowledge UNIT V Combining Inductive and Analytical Learning – Motivation. Learning Rule Sets: Summary.jwjobs. A concept learning task. Q Learning. Genetic Algorithms. Rewards and Actions.com .jntuworld. Models of Evolution and Learning. Comparing learning algorithms UNIT III Bayesian learning – Introduction.Instance-Based Learning. An Illustrative Example. Maximum likelihood hypotheses for predicting probabilities. An example learning to classify text. (Parallel Computing) MACHINE LEARNING (ELECTIVE – III) Objectives:  To be able to formulate machine learning problems corresponding to different applications. Bayesian belief networks The EM algorithm Computational learning theory – Introduction. Concept learning as search. Using Prior Knowledge to Initialize the Hypothesis. Minimum description length principle. Basics of sampling theory. Probability learning an approximately correct hypothesis. Parallelizing Genetic Algorithms J T N W U R O D L UNIT IV Learning Sets of Rules – Introduction.android.com M.Well-posed learning problems. Remarks on Lazy and Eager Learning Genetic Algorithms – Motivation. designing a learning system. Locally Weighted Regression. Maximum likelihood and least squared error hypotheses. Decision tree representation. Naïve bayes classifier.  To be able to apply machine learning algorithms to solve problems of moderate complexity. Appropriate problems for decision tree learning. Bayes optimal classifier. Inverting Resolution Analytical Learning . Bayes theorem and concept learning. Remarks on the back propagation algorithm.  To understand a range of machine learning algorithms along with their strengths and weaknesses. The mistake bound model of learning . Sample complexity for Finite Hypothesis Space. Multilayer networks and the back propagation algorithm.Introduction. Neural network representation. Tech – I Year – II Sem. Perspectives and issues in machine learning Concept learning and the general to specific ordering – Introduction.jntuworld.Introduction. An illustrative example face recognition Advanced topics in artificial neural networks Evaluation Hypotheses – Motivation. UNIT I INTRODUCTION . Genetic Programming. Sequential Covering Algorithms. Radial Basis Functions. Appropriate problems for neural network learning. TECH. Inductive bias UNIT II Decision Tree learning – Introduction. (PARALLEL COMPUTING)-R13 Regulations www. Learning Sets of First Order Rules: FOIL. Hypothesis space search in decision tree learning.com www.  To be able to read current research papers and understands the issues raised by current research. Version spaces and the candidate elimination algorithm. Remarks on version spaces and candidate elimination. Learning with Perfect Domain Theories: Prolog-EBG Remarks on Explanation-Based Learning.  To understand the basic theory underlying machine learning.www. Non-Deterministic. Issues in decision tree learning Artificial Neural Networks – Introduction. A general approach for deriving confidence intervals. Reinforcement Learning – Introduction. Difference in error of two hypotheses.jntuworld. Case-Based Reasoning. Hypothesis Space Search. Inductive bias in decision tree learning. Induction as Inverted Deduction.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Using Prior Knowledge to Alter the Search Objective.

jntuworld.jntuworld.www. Mitchell.net TEXT BOOK: 1.com www. Stephen Marsland. Machine Learning – Tom M. TECH.com M. (PARALLEL COMPUTING)-R13 Regulations www.android. Machine Learning: An Algorithmic Perspective. .jntuworld.com .MGH REFERENCE BOOK: 1. Taylor & Francis J T N W U R O D L www.jwjobs.

John Wiley.jntuworld. Digital Image Processing.Introduction. recognition grammars. 2. the single-linkage. “Pattern Recognition Principle”. estimation of error rates. Richard duda.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. K-means’s algorithm. Ward’s method Partition clustering-Forg’s algorithm. complete-linkage and average-linkage algorithm. Tech – I Year – II Sem. syntactic pattern description. Gonzalez. Tou. Finger prints. nearest neighbour classification techniques. CLUSTERING AND PARTITIONING .www. Multiple features. Hart. IRIS scon. Application of pattern recognition techniques in bio-metric.Probability of events: Random variables. Y.Hierarchical Clustering: Introduction. facial recognition. Movements of random variables. (Parallel Computing) PATTERN RECOGNITION (ELECTIVE -III) Objectives:  To implement pattern recognition and machine learning theories  To design and implement certain important pattern recognition techniques  To apply the pattern recognition theories to applications of interest  To implement the entropy minimization. characteristic curves. Isodata algorithm.jntuworld. STATISTICAL DECISION MAKING . “ Pattern recognition and Image Analysis”. binary feature selection.com www. M. Baye’s classifier for normal patterns. UNIT V SYNTACTIC PATTERN RECOGNITION & APPLICATION OF PATTERN RECOGNITION Introduction. estimating the composition of populations.Anji Reddy. Examples of Automatic Pattern recognition systems.Basic concepts. agglomerative clustering algorithm. choosing a decision making techniques. clustering in feature selection through entropy minimization. etc. Conditionally independent features. implementations of decision functions. Adaptive decision boundaries. UNIT IV PATTERN PREPROCESSING AND FEATURE SELECTION: Introduction. automata as pattern recognizers. Rafael. concepts from formal language theory.Introduction. features selection through orthogonal expansion. Pattern space and weight space. clustering transformation and feature ordering UNIT I INTRODUCTION . TEXT BOOKS: 1. UNIT II PROBABILITY .. Joint distributions and densities. TECH. kernel and window estimation. Jost.Linear and generalized decision functions. Gose. J T N W U R O D L www. Johnsonbaugh.jwjobs. David Strok. (PARALLEL COMPUTING)-R13 Regulations www. Estimation of parameter from samples. Minimum squared error discriminant functions. Baye’s theorem. Minimum-distance pattern classifications. PHI. UNIT III NON PARAMETRIC DECISION MAKING . Pearson Education REFERENCE BOOK: 1.android. histogram. “Pattern Classification”.com . Geometrical properties.Hari Shankar. distance measures.com M. Simple pattern recognition model DECISION AND DISTANCE FUNCTIONS . BS Publications. Fundamental problems in pattern Recognition system design.jntuworld. the leaving-one-out-techniques. Unequal cost of error. clustering transformation and feature ordering. Decision boundaries. 2. Design concepts and methodologies. formulation of syntactic pattern recognition problem. Applications. adaptive discriminant functions.

Constraint-Based Cluster Analysis. Michael Steinbach and Vipin Kumar. Integration of a Data Mining System with a Database or a Data Warehouse System. Model-Based Clustering Methods. Data Mining Introductory and advanced topics –Margaret H Dunham. Multimedia. The Data Warehouse Life cycle Tool kit – Ralph Kimball Wiley student edition 4.Jiawei Han & Micheline Kamber. Morgan Kaufmann Publishers. Mining Sequence Patterns in Biological Data.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Text Mining.jwjobs. Associative Classification. (Parallel Computing) DATA MINING (ELECTIVE –III) Objectives:  To develop the abilities of critical analysis to data mining systems and applications. Density-Based Methods. UNIT II Mining Frequent Patterns.com www. Data Warehousing in the Real World – Sam Aanhory & Dennis Murray Pearson Edn Asia. Efficient and Scalable Frequent Item set Mining Methods.com M.android. Mining the World Wide Web. 2. Data Reduction.jntuworld. Ensemble Methods UNIT IV Cluster Analysis Introduction :Types of Data in Cluster Analysis. Lazy Learners. Bayesian Classification. Data Cleaning. Data Mining – Concepts and Techniques . Data Mining System Products and Research Prototypes. Data Mining Functionalities. Classification by Decision Tree Induction. Data Warehousing Fundamentals – Paulraj Ponnaiah Wiley student Edition 3. Hierarchical Methods. Constraint-Based Association Mining – UNIT III Classification and Prediction: Issues Regarding Classification and Prediction. Clustering High-Dimensional Data. Partitioning Methods. Grid-Based Methods.jntuworld. 2006. Spatial.com . Mining Time-Series Data. 2nd Edition. Prediction.Applications and Trends in Data Mining: Data Mining Applications. Tech – I Year – II Sem. Pearson education www. Time Series and Sequence Data: Mining Data Streams. Text and Web Data: Multidimensional Analysis and Descriptive Mining of Complex Data Objects. Mining Sequence Patterns in Transactional Databases. Data Mining Task Primitives. Data Mining Techniques – Arun K Pujari. John Wiley & Sons Inc.Mining Streams. Spatial Data Mining. 2. 5. Building the Data Warehouse by William H Inmon. Multimedia Data Mining. Additional Themes on Data Mining and Social Impacts of Data Mining. Pearson education. A Categorization of Major Clustering Methods. Classification by Back propagation. . Discretization and Concept Hierarchy Generation. Accuracy and Error measures. J T N W U R O D L TEXT BOOKS: 1. Social Network Analysis and Multirelational Data Mining: UNIT V Mining Object. Major issues in Data Mining. From Association Mining to Correlation Analysis. Data Integration and Transformation.www. Data Preprocessing: Need for Preprocessing the Data. University Press REFERENCE BOOKS: 1. TECH. Support Vector Machines.  To implement practical and theoretical understanding of the technologies for data mining  To understand the strengths and limitations of various data mining models UNIT I Introduction: Fundamentals of data mining. Other Classification Methods. Classification of Data Mining systems. Rule-Based Classification.jntuworld. Associations and Correlations: Basic Concepts. Evaluating the accuracy of a Classifier or a Predictor. (PARALLEL COMPUTING)-R13 Regulations www. Outlier Analysis . Introduction to Data Mining – Pang-Ning Tan. Mining various kinds of Association Rules. Graph Mining. 3. 2005.

Information Storage and Management. Tata McGraw Hill.www. Storage security domains.jwjobs. Virtualization technologies. Different RAID levels and their suitability for different application environments: RAID 0. Concept of RAID and its components . Benefits of the different networked storage options. Architecture. RAID 4. TEXT BOOK: 1. and IPSAN. EMC Corporation. components. Wiley. Robert Spalding. Industry standards for data center monitoring and management. Differentiate between business continuity (BC) and disaster recovery (DR) .jntuworld. logical constructs of a physical disk. Osborne. understand the need for long-term archiving solutions and describe how CAS fulfills the need. Key metrics to monitor for different components in a storage infrastructure. Identify single points of failure in a storage infrastructure and list solutions to mitigate these failures . RAID 1+0. NAS. Critical security attributes for information systems. RAID 0+1. Key management tasks in a data center J T N W U R O D L UNIT V: Securing Storage and Storage Virtualization Information security.android. RAID 3.com www. RAID 1.Major physical components of a disk drive and their function. role of each element in supporting business activities UNIT II: Storage Systems Architecture Hardware and software components of the host environment. RAID 5. Architecture of backup/recovery and the different backup/recovery topologies . (PARALLEL COMPUTING)-R13 Regulations www. Tech – I Year – II Sem. access characteristics. List and analyzes the common threats in each domain.com M. 2003. Practice variations of SANOS features UNIT I: Introduction to Storage Technology Review data creation and the amount of data being created and understand the value of data to a business. (Parallel Computing) STORAGE AREA NETWORKS (ELECTIVE-IV) Objectives:  To understand Storage Area Networks characteristics and components. and topologies of FC-SAN. RAID 6. understand the appropriateness of the different networked storage options for different application environments UNIT IV: Information Availability & Monitoring & Managing Datacenter List reasons for planned/unplanned outages and the impact of downtime.jntuworld. Remote replication technologies and their role in providing disaster recovery and business continuity capabilities Identify key areas to monitor in a data center. replication technologies and their role in ensuring information availability and business continuity. and performance Implications. Core elements of a data center infrastructure. challenges in data storage and data management.RTO and RPO. Solutions available for data storage.  To understand the use of all SAN-OS commands. Key protocols and concepts used by each component .jntuworld.High-level architecture and working of an intelligent storage system UNIT III: Introduction to Networked Storage Evolution of networked storage.  To become familiar with the SAN vendors and their products  To learn Fibre Channel protocols and how SAN components use them to communicate with each other  To become familiar with Cisco MDS 9000 Multilayer Directors and Fabric Switches Thoroughly learn Cisco SAN-OS features.Physical and logical components of a connectivity environment . REFERENCE BOOKS: 1. Impact of downtime. TECH. block-level and filelevel virtualization technologies and processes Case Studies The technologies described in the course are reinforced with EMC examples of actual solutions. Realistic case studies enable the participant to design the most appropriate solution for given sets of criteria. www.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. “Storage Networks: The Complete Reference“.com . Compare and contrast integrated and modular storage systems .

Osborne.com M.jwjobs.jntuworld.jntuworld.jntuworld.android. Marc Farley.net 2.com . 2001.com www. TECH. Tata McGraw Hill . J T N W U R O D L www. 3. “Building Storage Networks”. 2002.www. Meeta Gupta. Pearson Education Limited. (PARALLEL COMPUTING)-R13 Regulations www. Storage Area Network Fundamentals.

Network Address Translation (NAT). Unit II describes the architecture. UDP sockets (datagram sockets). Networking Devices. Routing Protocols & Concepts. The Network edge. The OSI reference model and the Internet architecture. Kurose.Ross. Implementation details . protocols.Client-Server Application. and interfaces. OPNET. Access Networks and Physical media.www. Networking Models: 5-layer TCP/IP Model. VTP. Frame Relay concepts. and operation of routers.com . UNIT V: Network Programming using Java TCP sockets. Server programs that can handle one connection at a time and multiple connections (using multithreaded server). Dynamic Host Configuration Protocol (DHCP). TEXT BOOKS: Computer Networking: A Top-Down Approach Featuring the Internet. Suggested Simulator tools: NS-2/NS-3.android. IPv6. Virtual LANs (VLANs). Point-to-Point Protocol (PPP) concepts. Building a Routing Table. Tech – I Year – II Sem. Static Routing.com www. Inter-VLAN Routing. J T N W U R O D L www. Basic Switch Configuration. Pearson Education. Students need to develop the necessary skills to implement a WLAN in a small-to-medium network. multimedia-based.jwjobs. This section explains how to configure a switch for basic functionality and how to implement Virtual LANs. The course will expose students to the concepts of traditional as well as modern day computer networks . EIGRP). VLAN Trunking Protocol (VTP).wireless and mobile.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Network applications. Network Fundamentals. components. (Parallel Computing) ADVANCED COMPUTER NETWORKS (ELECTIVE-IV) Objectives: The objective of this course is to build a solid foundation in computer networks concepts and design To understand computer network architectures. TECH. RIPv2. Packet Tracer. Fifth Edition. and Inter-VLAN routing in a converged network. Keith W. UNIT II: Network Routing Routing and its concepts: Structure of a Router.jntuworld. Rick Graziani. UNIT III: LAN Switching Switching and its concepts: Structure of a Switch. James F. Link State Routing Protocols (OSPF). Basic Router Configuration. UNIT I: Review Computer Networks and the Internet: History of Computer Networking and the Internet. Unit V makes the student to implement networking using Java programs. Boson. Through Unit III a student can learn the technologies and protocols needed to design and implement a converged switched network. Pearson Education.jntuworld. ISPs and Internet Backbones. Internet Protocols and Addressing. Remote Method Invocation (Java RMI) Basic RMI Process. UNIT IV: Wide Area Networks (WANs) Introduction to WANs. Pearson Education. Especially the Routing protocols need to be understood thoroughly with the help of any freely downloadable simulator tool. 7-Layer OSI Model. Students completing this course will understand the key concepts and practices employed in modern computer networking Prerequisite: Computer Networks Course description: This course will enable the student to refresh the fundamentals of Computer Networks in Unit I. Dynamic Routing – Distance Vector Routing Protocol (RIPv1. This course in Unit IV discusses the WAN technologies and network services required by converged applications in enterprise networks.jntuworld. The Network core. Mark Dye. Equal-Sized Packets Model: ATM.com M. 2012. (PARALLEL COMPUTING)-R13 Regulations www. Spanning Tree Protocol (STP). and explains the principles of Routing and Routing protocols. Wireshark.

2012. Behrouz A. Tenth Edition. Computer and Communication Networks. Fifth Edition. Pearson Education. Bhushan Trivedi. rp2012. Davie.R. 2007. Forouzan.android. Nader F. 2006. E. Prentice Hall. Tanenbaum.com www. Next-Generation Internet: Architectures and Protocols. 2005. 2011. SPD.jntuworld. Fifth edition. Andrew S. Behrouz A. Fundamentals of Business Data Communications. Pearson Education. th Comer. TECH. Mir. Natalia Olifer. Firoz Mosharaf . Volume 1. Accessing the WAN.jntuworld. Bob Vachon. Peterson & Bruce S. O’Reilly. Computer Networks. Larry L. rd Java Network Programming. Douglas E. 2011. An Introduction to Network Programming with Java. 2009. Wayne Lewis. S. Internetworking with TCP/IP: Principles. 4 edition. PHI. Tata McGraw Hill.com M. Springer. Computer Networks: Principles.net LAN Switching & Wireless.jntuworld. Computer Networks: A Top-Down Approach. Oxford University Press. J T N W U R O D L www. Wiley. Tata McGraw Hill. 2007 Data Communications and Networking. Pearson Education.(Unit V) An Engineering Approach to Computer Networking. Cambridge.www. (PARALLEL COMPUTING)-R13 Regulations www. Jan Graba.Keshav. Jerry FitzGerald and Alan Dennis. rp 2010. Technologies And Protocols For Network Design.jwjobs. Computer Networks. Wiley India. Harold.3 edition. Protocols and Architecture. REFERENCE BOOKS: Computer Networks: A Systems approach. Elsevier. Fourth Edition. Pearson Education.com . Forouzan. 1997. Byrav Ramamurthy et al. Victor Olifer.

jwjobs. --. performance objectives and quality of services.Wearable computing Architecture TEXT BOOKS: 1.jntuworld.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Rahul Banerjee: Lecture Notes in Pervasive Computing. BITS-Pilani.XML and its role in Pervasive Computing Wireless Application Protocol (WAP) Architecture and Security – Wireless Mark-Up language (WML) – Introduction UNIT III Voice Enabling Pervasive Computing . Thomas Schaec & Klaus Rindtorff.com M.based Authentication Mechanisms . 2003.Pervasive Computing devices and Interfaces .Verlag. Rahul Banerjee: Internetworking Technologies: An Engineering Perspective. New Delhi. 2. Outline Notes. (PARALLEL COMPUTING)-R13 Regulations www. emerging trends .com . TECH. 2. J T N W U R O D L www. Standards. Jochen Burkhardt.android. 2003. Martin S Nicklous & Thomas Stober: Principles of Mobile Computing. Springer.www.PDA Based Access Architecture UNIT V User Interface Issues in Pervasive Computing. Architecture . Uwe Ha nsman.PDA Device characteristics . Prentice –Hall of India. 2002. Addision Wesley. REFERENCE BOOKS: 1.Smart Card.PDA software Components. (Parallel Computing) PERVASIVE COMPUTING (ELECTIVE – IV) Objectives:  To discover the characteristics of pervasive computing applications including the basic computing application problems. Lothat Merk. Stefan Hepper. New Delhi. 2003.Device technology trends.com www.Voice Standards . Tech – I Year – II Sem. Horst Henn.Pervasive Computing Technology and Architecture of Mobile Internet Applications. Reading.jntuworld. Connecting issues and protocols UNIT II Pervasive Computing and web based Applications .jntuworld. Second Edition. (ISBN 81-203-2185-5) 2. major system components and architectures of the systems.Speech Applications in Pervasive Computing and security UNIT IV PDA in Pervasive Computing – Introduction . UNIT I Pervasive Computing Application .

com . PVM (Parallel Virtual Machine).com M. Tools :OpenMPI . Tools used SimGrid 3. e. Play Ping-Pong using 2 processors on the SMA Hydra Cluster Write a short program to estimate the message latency ts and reciprocal of the bandwidth tc for SMA Hydra Cluster. Write simple Java programs (clients) for accessing the functionality of grid services J T N W U R O D L www.jwjobs. 7. Parallel your code for calculating the value of PI using Monte Carlo Method from Computational Lab1.jntuworld. (Parallel Computing) GRID COMPUTING LAB 1. MPI (Message Passing Interface) and so on. Parallelization Using MPI There are a number of parallel software environments that allow users to use the networked computers as a unified computing resource.com www. 6. responsible for exchanging control data. Simulation of Chord with SimGrid (Networking) Description Large-scale simulation of the Chord peer-to-peer algorithm with SimGrid. Distributed algorithm for resources allocation (Networking) Description The objective of this experiment is to deploy and evaluate a distributed algorithm for dynamic network resources allocation.jntuworld. The aim is to explore the scalability and reliability issues of the proposed algorithm which is running on a real experimental platform (such as GRID 5000).g. will be distributed over multiple nodes interconnected together via high speed network. This question will focus on the parallelization of the sequential code what you have written in the computational lab1 to evaluate PI number using Monte Carlo method. TECH.android. HPC performance modeling (Networking) Description In these experiments we continue investigating performance model for HPC-based network such as Infini-Band.jntuworld.www.net JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD M. Tech – I Year – II Sem. (PARALLEL COMPUTING)-R13 Regulations www. Multiple software entities. Tools used JAVA 2. MPI is a set of specifications that has become a de-factor standard in mes-sage passing protocol 5.