Resources » Articles/Knowledge Sharing » Education

JNTU M.Tech (Computer science) Syllabus


Last Updated:   Category: Education    
Author: Member Level: Silver    Points: 5






JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech (CSE) II Semester

ADVANCED COMPUTER ARCHITECTURE
(ELECTIVE I)

UNIT-I
Fundamentals of Computer design- Technology trends- cost- measuring and reporting performance quantitative principles of computer design.

UNIT-II
Instruction set principles and examples- classifying instruction set- memory addressing- type and size of operands- addressing modes for signal processing-operations in the instruction set- instructions for control flow- encoding an instruction set.-the role of compiler

UNIT- III:
Instruction level parallelism (ILP)- over coming data hazards- reducing branch costs –high performance instruction delivery- hardware based speculation- limitation of ILP

UNIT-IV
ILP software approach- compiler techniques- static branch protection- VLIW approach- H.W support for more ILP at compile time- H.W verses S.W solutions

UNIT- V
Memory hierarchy design- cache performance- reducing cache misses penalty and miss rate – virtual memory- protection and examples of VM.

UNIT-VI
Multiprocessors and thread level parallelism- symmetric shared memory architectures- distributed shared memory- Synchronization- multi threading.

UNIT-VII
Storage systems- Types – Buses - RAID- errors and failures- bench marking a storage device- designing a I/O system.

UNIT-VIII
Inter connection networks and clusters- interconnection network media – practical issues in
interconnecting networks- examples – clusters- designing a cluster

Text Book:
1. Computer Architecture A quantitative approach 3rd edition John L. Hennessy &
David A. Patterson Morgan Kufmann (An Imprint of Elsevier)

Reference:
1. “Computer Architecture and parallel Processing” Kai Hwang and A.Briggs International
Edition McGraw-Hill.
2. Advanced Computer Architectures, Dezso Sima, Terence Fountain, Peter Kacsuk,
Pearson.
I Year M.Tech (CSE) I Semester

COMPUTER COMUNICATIONS

UNIT-I
Introduction: Uses of computer Networks, Network H/w, Network S/W, Reference Models, Example Networks , Network Standardization.

UNIT-II
Physical Layer: Guided transmission media – Magnetic media, Twisted Pair, coaxial cable, fiber optics .

Data Link Layer: Design Issues, Error detection and correction , Elementary Data Link
Protocols, Sliding Window Protocols, Protocol Verification, Example Data Link protocols.

UNIT-III
The Medium Access Sub Layer : The channel allocation problem, Multiple access Protocols, Ethernet , Wireless LANs , Broadband Wireless, Bluetooth ,Data Link Layer Switching.

UNIT-IV
The Network Layer : Network Layer Design Issues, Routing Algorithms ,Congestion Control Algorithms ,Quality Of Service, Internet Working ,Network Layer in Internet.

UNIT-V
The Transport Protocol: The Transport Service, Elements of transport protocol, A simple Transport Protocol, Internet Transport Protocols UDP, Internet Transport Protocols TCP, Performance Issues.

UNIT-VI
The Application Layer: DNS-(Domain Name System), Electronic Mail, World Wide Web Multimedia,

UNIT-VII
Network Security: Cryptography , Symmetric _key Algorithms, Public–Key Algorithms, Digital Signatures, Management of public keys.

UNIT-VIII
Communication Security, Authentications Protocols, E-mail Security, Web security, Social Issues.

TEXT BOOKS:
1. Computer Networks -- Andrew S Tanenbaum,4th Edition. Pearson Education/PHI

REFERENCE BOOKS:
1. Computer Communications and Networking Technologies –Michael A.Gallo, William
M .Hancock - Thomson Publication
2. Data Communications and Networking – Behrouz A. Forouzan. Third Edition TMH.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech (CSE) I Semester
COMPUTER ORGANIZATION

UNIT-I:

BASIC STRUCTURE OF COMPUTERS: Computer Types, Functional unit, Basic OPERATIONAL concepts, Bus structures, Software, Performance, multiprocessors and multi computers. Data Representation. Fixed Point Representation. Floating – Point Representation. Error Detection codes.

COMPUTER ARITHMETIC: Addition and subtraction, multiplication Algorithms, Division Algorithms, Floating – point Arithmetic operations. Decimal Arithmetic unit Decimal Arithmetic operations

UNIT-II:
REGISTER TRANSFER LANGUAGE AND MICROOPERATIONS: Register Transfer language. Register Transfer Bus and memory transfers, Arithmetic Mircrooperatiaons, logic micro operations, shift micro operations, Arithmetic logic shift unit. Instruction codes. Computer Registers Computer instructions – Instruction cycle.
Memory – Reference Instructions. Input – Output and Interrupt. STACK organization. Instruction formats. Addressing modes. DATA Transfer and manipulation. Program control. Reduced Instruction set computer.

UNIT-III:
MICRO PROGRAMMED CONTROL: Control memory, Address sequencing, icroprogram example, design of control unit Hard wired control. Microprogrammed control

UNIT-IV:
PROGRAM AND NETWORK PROPERTIES
Conditions of Parallelism. Program Paritioning and Scheduling, Program flow Mechanism, System Interconnect Archcitectures.

SCALABILITY AND PERFORMANCE
Poricipels of Scalable Performance, Performance Metrics and Measures, Parallel Processing Applications. Speedup Performance Laws. Scalability Analysis and Approaches.

UNIT-V:
THE MEMORY SYSTEM: Basic concepts semiconductor RAM memories. Read-only memories Cache memories performance considerations, Virtual memories secondary storage. Introduction to RAID.


UNIT-VI:
INPUT-OUTPUT ORGANIZATION: Peripheral Devices, Input-Output Interface, Asynchronous data transfer Modes of Transfer, Priority Interrupt Direct memory Access, Input –Output Processor (IOP) Serial communication; Introduction to peripheral component, Interconnect (PCI) bus. Introduction to standard serial communication protocols like RS232, USB, IEEE1394.

UNIT-VII:
PIPELINE AND VECTOR PROCESSING:
Parallel Processing, Pipelining, Arithmetic Pipeline, Instruction Pipeline, RISC Pipeline Vector Processing, Array Processors.

UNIT-VIII:
MULTI PROCESSORS:Characteristics or Multiprocessors, Interconnection Structures, Interprocessor Arbitration. InterProcessor Communication and Synchronization Cache Coherance. Shared Memory Multiprocessors.



MULTIPROCESSING
Multiprocessor System Interconnects. Cache Coherence and Synchronization Mechanisms.
Vector Processing Principles. SIMD Computer Implementation Models. Larency Hiding Techniques. Principles of Multi Threading. Data Flow Architecture Evaluation.

TEXT BOOKS:
1. Computer Systems Architecture – M.Moris Mano, IIIrd Edition, Pearson/PHI
2. Computer Organization – Car Hamacher, Zvonks Vranesic, SafeaZaky, Vth Edition,
McGraw Hill.

REFERENCE:
1. Computer Organization and Architecture – William Stallings Sixth Edition, Pearson/PHI
2. Structured Computer Organization – Andrew S. Tanenbaum, 4th Edition PHI/Pearson
3. Fundamentals or Computer Organization and Design, - Sivaraama Dandamudi Springer
Int. Edition.
4. Computer Organization, Anjaneyulu, Himalaya Pub house.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD

I Year M.Tech (CSE) I Semester

DESIGN AND ANALYSIS OF ALGORITHMS

UNIT-I
Overview of OOP Principles: Encapsulation, Inheritance, and Polymorphism. Review of C++-Classes and Objects, Class members, Access control, class scope, constructors and destructors, dynamic memory allocation and deallocation (new and delete), Polymorphism-Function overloading, operator overloading, generic programming-function and class templates, Inheritance, run time polymorphism using virtual functions, abstract classes, File I/O and Exception handling.

UNIT-II
Algorithm Analysis and Review of Data Structures: Algorithms, Psuedo code for expressing algorithms, Performance Analysis-time complexity and space complexity-notation, Omega notation and Theta notation, little o notation, Probabilistic analysis, Amortized analysis, Review of Data Structures- The List ADT, Stack ADT, Queue ADT, Implementations using template class, Hash Functions, Collision Resolution in hashing, Priority queues-Definition, Priority queues-ADT, Heaps-Definition, Insertion and Deletion, Applications-Heap sort, Disjoint sets-Disjoint set ADT, Union and Find algorithms.

UNIT-III
Divide and conquer: General method, applications-Binary search, Quick sort, Merge sort, Strassen’s Matrix Multiplication.

UNIT-IV
Greedy method: General method, applications-Job sequencing with dead lines, 0/1 knapsack problem, Minimum cost spanning trees, Single source shortest path problem.

UNIT-V
Dynamic Programming: General method, applications-Matrix chain multiplication, Optimal binary search trees, 0/1 knapsack problem, All pairs shortest path problem, Traveling sales person problem, Reliability design.

UNIT-VI
Searching and Traversal Techniques: Efficient non-recursive Tree Traversal Algorithms, DFS, BFS of Graphs, AND/OR graphs, game trees, Bi-Connected components, Search Trees- Balanced search trees-AVL trees, representation, Operations-insertion, deletion and searching, B-Trees-B-Tree of order m, Operations- insertion, deletion and searching.

UNIT-VII
Backtracking and Branch and Bound: General method (Backtracking), Applications-n-queen problem, sum of subsets problem, graph coloring, Hamiltonian cycles. General method (Branch and Bound), Applications - Traveling sales person problem, 0/1 knapsack
problem-LC Branch and Bound solution, FIFO Branch and Bound solution.
UNIT-VIII
NP-Hard and NP-Complete problems: Basic concepts, non-deterministic algorithms, NP - Hard and NP- Complete classes, Cook’s theorem.

Text Books:
1. Computer Algorithms/C++, E.Horowitz, S.Sahani and S.Rajasekharan, Galgotia Publishers pvt. Limited.

2. Data Structures and Algorithm Analysis in C++, 2nd Edition, Mark Allen Weiss, Pearson
Education.

3. Introduction to Algorithms, 2nd Edition, T.H.Cormen, C.E.Leiserson, R.L.Rivest, and C.Stein, PHI Pvt.Ltd./ Pearson Education.



Reference Books:
1. Design and Analysis of algorithms, Aho, Ullman and Hopcroft, Pearson Education.
2. Introduction to the Design and Analysis of Algorithms, A.Levitin, Pearson Education.
3. Data structures, Algorithms and Applications in C++, S.Sahni, University press (India)
pvt ltd, 2nd edition, Orient Longman pvt.ltd.
4 Object Oriented Programming Using C++, 2nd Edition, I.Pohl, Pearson Education.
5 Fundamentals of Sequential and Parallel Algorithms, K.A.Berman, J. L.Paul, Thomson
6 Data Structures And Algorithms in C++, 3rd Edition, Adam Drozdek, Thomson.
7. Algorithm Design: Foundations, Analysis and Internet examples, M.T.Goodrich and
R.Tomassia, John Wiley and sons.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech (CSE) I Semester

DESIGN AND ANALYSIS OF ALGORITHMS LAB (Through C++)

1. Write C++ programs to implement the following using an array.
a) Stack ADT
b) Queue ADT
2. Write C++ programs to implement the following using a singly linked list.
a) Stack ADT
b) Queue ADT
3. Write C++ program to implement the deque (double ended queue) ADT using a doubly
linked list.
4. Write a C++ program to perform the following operations:
a) Insert an element into a binary search tree.
b) Delete an element from a binary search tree.
c) Search for a key element in a binary search tree.
5. Write a C++ program to implement circular queue ADT using an array.
6. Write a C++ program to implement all the functions of a dictionary (ADT) using hashing.
7. Write a C++ program to perform the following operations on B-Trees and AVL-trees:
a) Insertion.
b) Deletion.
8. Write C++ programs for the implementation of bfs and dfs for a given graph.
9. Write C++ programs to implement the following to generate a minimum cost spanning tree:
a) Prim’s algorithm.
b) Kruskal’s algorithm.
10.Write a C++ program to solve the single source shortest path problem.
(Note: Use Dijkstra’s algorithm).
11. Write C++ program that uses non-recursive functions to traverse a binary tree in:
a) Pre-order.
b) In-order.
c) Post-order.
12. Write C++ programs for sorting a given list of elements in ascending order using the following sorting methods:
a) Quick sort.
b) Merge sort.

13.Write a C++ program to find optimal ordering of matrix multiplication. (Note: Use Dynamic programming method).
14.Consider the problem of eight queens on an (8x8) chessboard. Two queens are said to attack each other if they are on the same row, column, or diagonal. Write a C++ program that implements backtracking algorithm to solve the problem i.e. place eight non-attacking queens on the board.
15.Write a C++ program to find the strongly connected components in a digraph.
16.Write a C++ program to implement file compression (and uncompression) using Huffman’s algorithm.
17.Write a C++ program to implement dynamic programming algorithm to solve the all pairs shortest path problem.
18.Write a C++ program to solve 0/1 knapsack problem using the following:
a) Greedy algorithm.
b) Dynamic programming algorithm.
c) Backtracking algorithm.
d) Branch and bound algorithm.
19.Write a C++ program that uses dynamic programming algorithm to solve the optimal binary search tree problem.
20.Write a C++ program for solving traveling sales persons problem using the following:
a) Dynamic programming algorithm.
b) The back tracking algorithm.
c) Branch and Bound.



Suggested Books for lab:
Data Structures, A Pseudocode Approach with C++, Richard F.Gilberg, Behrouz A.Forouzan, Thomson. Data Structures Using C++, D.S.Malik, Thomson.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD

I Year M.Tech (CSE) I Semester

DATABASE MANAGEMENT SYSTEMS

UNIT – I:
Data base System Applications, data base System VS file System – View of Data – Data Abstraction – Instances and Schemas – data Models – the ER Model – Relational Model – Other Models – Database Languages – DDL – DML – database Access for applications Programs – data base Users and Administrator – Transaction Management – data base System Structure – Storage Manager – the Query Processor – History of Data base Systems. Data base design and ER diagrams – Beyond ER Design Entities, Attributes and Entity sets – Relationships and Relationship sets – Additional features of ER Model – Concept Design with the ER Model – Conceptual Design for Large enterprises.

UNIT – II:
Relational Model: Introduction to the Relational Model – Integrity Constraint Over relations – Enforcing Integrity constraints – Querying relational data – Logical data base Design – Introduction to Views – Destroying /altering Tables and Views.
Relational Algebra and Calculus: Relational Algebra – Selection and projection set operations – renaming – Joins – Division – Examples of Algebra overviews – Relational calculus – Tuple relational Calculus – Domain relational calculus – Expressive Power of Algebra and calculus.

UNIT – III:
Form of Basic SQL Query – Examples of Basic SQL Queries – Introduction to Nested Queries – Correlated Nested Queries Set – Comparison Operators – Aggregative Operators – NULL values – Comparison using Null values – Logical connectivity’s – AND, OR and NOTR – Impact on SQL Constructs – Outer Joins – Disallowing NULL values – Complex Integrity Constraints in SQL Triggers and Active Data bases.

UNIT – IV:
Schema refinement – Problems Caused by redundancy – Decompositions – Problem related to decomposition – reasoning about FDS – FIRST, SECOND, THIRD Normal forms – BCNF – Lossless join Decomposition – Dependency preserving Decomposition – Schema refinement in Data base Design – Multi valued Dependencies – forth Normal Form.

UNIT – V:
Overview of Transaction Management: ACID Properties – Transactions and Schedules – Concurrent Execution of transaction – Lock Based Concurrency Control – Performance Locking – Transaction Support in SQL – Introduction to Crash recovery.

UNIT – VI:
Concurrency Control: Serializability, and recoverability – Introduction to Lock Management – Lock Conversions – Dealing with Dead Locks – Specialized Locking Techniques – Concurrency without Locking.
Crash recovery: Introduction to ARIES – the Log – Other Recovery related Structures – the Write- Ahead Log Protocol – Check pointing – re3covering from a System Crash – Media recovery – Other approaches and Interaction with Concurrency control.

UNIT – VII:
Overview of Storage and Indexing: Data on External Storage – File Organization and Indexing – Cluster Indexes, Primary and Secondary Indexes – Index data Structures – Hash Based Indexing – Tree base Indexing – Comparison of File Organizations – Indexes and Performance Tuning.

UNIT – VIII:
Storing data: Disks and Files: - The Memory Hierarchy – Redundant Arrays of Independent – Disks – Disk Space Management – Buffer Manager – Files of records – Page Formats – record formats.
Tree Structured Indexing: Intuitions for tree Indexes – Indexed Sequential Access Methods (ISAM) – B+ Trees: A Dynamic Index Structure.
Hash Based Indexing: Static Hashing – Extendable hashing – Linear Hashing – Exendble vs. Liner hashing.

TEXT BOOKS:
1. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition
2. Data base System Concepts, Silberschatz, Korth, McGraw hill, IV edition.

REFERENCE BOOK:
1. Introduction to Database Systems, C.J.Date Pearson Education
2. Data base Systems design, Implementation, and Management, Rob & Coronel 5th Edition.
Thomson
3. Data base Management System, Elmasri Navrate Pearson Education
4. Data base Management System Mathew Leon, Leon Vikas.
5. Data base Systems, Connoley Pearson education

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY, HYDERABAD
I Year M.Tech (CSE) II Semester
DATA WAREHOUSING AND MINING

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,

UNIT-II
Data Preprocessing: Needs Preprocessing the Data, Data Cleaning, Data Integration and
Transformation, Data Reduction, Discretization and Concept Hierarchy Generation,
Online Data Storage.

UNIT-III
Data Mining Primitives, 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-IV
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-V
Mining Association Rules in Large Databases: Association Rule Mining, Mining Single-Dimensional Boolean Association Rules from Transactional Databases, Mining Multilevel Association Rules from Transaction Databases, Mining Multidimensional Association Rules from Relational Databases and Data Warehouses, From Association Mining to Correlation Analysis, Constraint-Based Association Mining.

UNIT-VI
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-VII
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.

UNIT-VIII
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

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech(CSE) II Semester

EMBEDDED SYSTEMS

Unit I
Embedded Computing: Introduction, Complex Systems and Microprocessor, The Embedded System Design Process, Formalisms for System Design, Design Examples

Unit II
The 8051 Architecture : Introduction, 8051 Micro controller Hardware, Input/Output Ports and Circuits, External Memory, Counter and Timers, Serial data Input/Output, Interrupts.

Unit III
Basic Assembly Language Programming Concepts : The Assembly Language Programming Process, Programming Tools and Techniques, Programming the 8051.
Data Transfer and Logical Instructions.

Unit IV
Arithmetic Operations, Decimal Arithmetic. Jump and Call Instructions, Further Details on Interrupts.

UNIT V
Applications: Interfacing with Keyboards, Displays, D/A and A/D Conversions, Multiple Interrupts, Serial Data Communication.

Unit VI
Introduction to Real – Time Operating Systems: Tasks and Task States, Tasks and Data, Semaphores, and Shared Data; Message Queues, Mailboxes and Pipes, Timer Functions, Events, Memory Management, Interrupt Routines in an RTOS Environment

Unit VII
Basic Design Using a Real-Time Operating System: Principles, Semaphores and Queues, Hard Real- Time Scheduling Considerations, Saving Memory and Power, An example RTOS like uC-OS (Open Source); Embedded Software Development Tools: Host and Target machines, Linker/Locators for Embedded Software, Getting Embedded Software into the Target System; Debugging Techniques: Testing on Host Machine, Using Laboratory Tools, An Example System.

Unit VIII
Introduction to advanced architectures: ARM and SHARC, Processor and memory organization and Instruction level parallelism; Networked embedded systems: Bus protocols, I2C bus and CAN bus; Internet-Enabled Systems, Design Example-Elevator Controller.

Text Books:
1. Computers and Components, Wayne Wolf, Elseveir.
2. The 8051 Microcontroller, Third Edition, Kenneth J.Ayala, Thomson.
3. An Embedded Software Primer, David E. Simon, Pearson Education.

Reference Books:
1. Embedding system building blocks, Labrosse, via CMP publishers.
2. Embedded Systems, Raj Kamal, TMH.
3. Micro Controllers, Ajay V Deshmukhi, TMH.
4. Embedded System Design, Frank Vahid, Tony Givargis, John Wiley.
5. Microcontrollers, Raj kamal, Pearson Education.

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech (CSE) II Semester

MOBILE COMPUTING
(ELECTIVE – II)

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
(Wireless) Medium Access Control: Motivation for a specialized MAC (Hidden and exposed terminals, Near and far terminals), SDMA, FDMA, TDMA, CDMA.

UNIT- III
Mobile Network Layer:Mobile IP (Goals, assumptions, entities and terminology, IP packet delivery, agent advertisement and discovery, registration, tunneling and encapsulation, optimizations), Dynamic Host Configuration Protocol (DHCP).

UNIT- IV
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- V
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- VI
Data Dissemination: Communications asymmetry, classification of new data delivery mechanisms, push-based mechanisms, pull-based mechanisms, hybrid mechanisms, selective tuning (indexing) techniques.

UNIT- VII
Mobile Ad hoc Networks (MANETs): Overview, Properties of a MANET, spectrum of MANET applications, routing and various routing algorithms, security in MANETs.

UNIT- VIII
Protocols and Tools:Wireless Application Protocol-WAP. (Introduction, protocol architecture, and treatment of protocols of all layers), Bluetooth (User scenarios, physical layer, MAC layer, networking, security, link management) and J2ME.

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)

Reference Books:
1) Reza Behravanfar, “Mobile Computing Principles: Designing and Developing Mobile
Applications with UML and XML”, ISBN: 0521817331, Cambridge University Press, October2004,
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

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD
I Year M.Tech (CSE) II Semester

MIDDLEWARE TECHNOLOGIES
(ELECTIVE – II)

UNIT-I:
Introduction to client server computing: Evolution of corporate computing models from centralized to distributed computing, client server models. Benefits of client server computing, pitfalls of client server programming.

UNIT-II:
CORBA with Java: Review of Java concept like RMI, RMI API, JDBC. Client/Server CORBA-style, The object web: CORBA with Java.

UNIT III:
Introducing C# and the .NET Platform; Understanding .NET Assemblies; Object –Oriented Programming with C#; Callback Interfaces, Delegates, and Events.

UNIT IV:
Building c# applications: Type Reflection, Late Binding, and Attribute-Based Programming; Object Serialization and the .NET Remoting Layer; Data Access with ADO.NET; XML Web Services.

UNIT-V:
Core CORBA / Java: Two types of Client/ Server invocations-static, dynamic. The static CORBA, first CORBA program, ORBlets with Applets, Dynamic CORBA-The portable count, the dynamic count multi count.

UNIT-VI:
Existential CORBA: CORBA initialization protocol, CORBa activation services, CORBAIDL mapping CORBA java- to- IDL mapping, The introspective CORBA/Java object.

UNIT-VII:
Java Bean Component Model: Events, properties, persistency, Intrespection of beans, CORBA Beans

UNIT-VIII:
EJBs and CORBA: Object transaction monitors CORBA OTM’s, EJB and CORBA OTM’s, EJB container frame work, Session and Entity Beans, The EJB client/server development Process The EJB container protocol, support for transaction EJB packaging EJB design Guidelines.

Text Books:
1 Client/Server programming with Java and CORBA Robert Orfali and Dan Harkey,
John Wiley & Sons ,SPD 2nd Edition
2 Java programming with CORBA 3rd Edition, G.Brose, A Vogel and K.Duddy,
Wiley-dreamtech, India John wiley and sons
3 C# and the .NET Platform Andrew Troelsen, Apress Wiley-dreamtech, India Pvt Ltd

Reference: Books:
1. Distributed Computing, Principles and applications, M.L.Liu, Pearson Education
2. Client/Server Survival Guide 3rd edition Robert Orfali Dan Harkey and Jeri Edwards, John Wiley & Sons
3. Client/Server Computing D T Dewire, TMH.
4. IBM Webspere Starter Kit Ron Ben Natan Ori Sasson, TMh, New Delhi
5. Programming C#, Jesse Liberty, SPD-O’Reilly.
6. C# Preciesely Peter Sestoft and Henrik I. Hansen, Prentice Hall of India
7. Intoduction to C# Using .NET Pearson Education
8. C# How to program, Pearson Education


Did you like this resource? Share it with your friends and show your love!




Responses to "JNTU M.Tech (Computer science) Syllabus"
Feedbacks      

Post Comment:




  • Do not include your name, "with regards" etc in the comment. Write detailed comment, relevant to the topic.
  • No HTML formatting and links to other web sites are allowed.
  • This is a strictly moderated site. Absolutely no spam allowed.
  • Name:   Sign In to fill automatically.
    Email: (Will not be published, but required to validate comment)



    Type the numbers and letters shown on the left.


    Submit Article     Return to Article Index

    Awards & Gifts
    Active Members
    TodayLast 7 Daysmore...

    Online Members

    K Mohan
    More...
    ISC Technologies, Kochi - India. Copyright © All Rights Reserved.