JNTU M.Tech Syllabus

JNTU is one of the oldest University in Hyderabad situated at the heart of the city. Initially this university established as Nagarjuna Sagar Engineering College in the year 1956 by the government of Andhra Pradesh. After seeing the increasing growth of Industrial and technological development in India, new technological education required for the industrial growth of the country in general and more particularly for the State of Andhra Pradesh, "Jawaharlal Nehru Technological University" was established on 2nd October, 1972, by an act of State Legislature.

Following are the Post Graduate courses offered by JNTU, click on it to know the syllabus.

Postgraduate
The following Postgraduate Courses are offered by the Jawaharlal Nehru Technological University.

Civil Engineering: Soil Mechanics and Foundation Engineering

Mechanical Engineering: Machine Design

Electrical Engineering: Power Systems (High Voltage)

Electronics and Communications Engineering: Instrumentation and Controls

Computer Science Engineering

Eligibility Criteria To Take Admission Into Postgraduate Courses:

For admission to the Postgraduate Courses of the JNTU, the student should have successfully completed their Bachelor's Degree in the engineering field. The admissions to the Postgraduate Courses are on the basis of GATE examination. For non-sponsored students, admission is based through an entrance test conducted by the University. For admission to the MCA course, the student needs to take the MCACET, on which the admission is based.

M.Tech COMPUTER SCIENCE ENGINEERING SYLLABUS

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD

M.Tech COMPUTER SCIENCE ENGINEERING

I Year M.Tech (CSE) I Semester
Course Structure

COMPUTER COMUNICATIONS
COMPUTER ORGANIZATION
DESIGN AND ANALYSIS OF ALGORITHMS
DATABASE MANAGEMENT SYSTEMS
DESIGN AND ANALYSIS OF ALGORITHMS LAB (Through C++)

I Year M.Tech (CSE) II Semester
Course Structure

DATA WAREHOUSING AND MINING
EMBEDDED SYSTEMS

ELECTIVE I
ADVANCED COMPUTER ARCHITECTURE

ELECTIVE II
MOBILE COMPUTING

ELECTIVE III
MIDDLEWARE TECHNOLOGIES


JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY
HYDERABAD

I Year M.Tech (CSE) I Semester
Course Structure

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.


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.

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.

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

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.


I Year M.Tech (CSE) II Semester
Course Structure

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

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.


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.


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

MIDDLEWARE TECHNOLOGIES
(ELECTIVE – III)

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

M.Sc Computer Science Syllabus

OSMANIA UNIVERSITY
HYDERABAD
M.Sc (Computer Science) Syllabus
**********************************************************

Osmani University offers a 2-year MSc programme in Computer Science. This master's course is appropriate for students who wish to pursue Research interests in any area of Computer Science Teaching, work for good career in the IT industry. Many colleges in Hyderabad city offering M.Sc Computer Science under Osmania University.

An important aspect of this programme is the project that students undertake in the final semester in collaboration with a well-established software development company. However, it is upto the student, if they want to prepare for prject themselves. There are few colleges offering Final semester project with collaboration with well establsihed software development company. The syllabus for the course, designed by Osmania University, is broad-based and provides courses of study that cover the current and future challenges in this field. The revised syllabus of Osmani University is given below.

Semester I
1.1 Discrete Mathematical Structures
1.2 Modern Operating Systems
1.3 Microprocessors and Microcontrollers
1.4 Software Engineering
1.5 Computer Graphics
1.6 LAB - Unix & Computer Graphics
1.7 LAB- Microprocessors and Microcontrollers

Semester II
2.1 Automata, Languages, and Computation
2.2 Client Server Programming (using Java)
2.3 Computer Networks and Internet Protocols
2.4 Design and Analysis of Algorithms
Elective
2.6(a) Advance Computer Architecture
2.5(b) Embedded Systems
2.6 Network Programming Lab
2.7 Client-Server Programming Lab

Semester III
3.1 Quantitative Techniques
3.2 Artificial Intelligence
3.3 Object Oriented System Development with UML
3.4 Network Security
3.5 Parallel Programming
3.6 LAB - Network Security
3.7 LAB - OOSD

Semester IV
Academic Project.

Complete Syllabus
************************************************************************************* Semester I

M. Sc. COMPUTER SCIENCE
1.1. Discrete mathematical Structures
4 Hr. PER WEEK

UNIT - I
Mathematical Logic and proofs – Propositions from old ones – Algorithms, Truth Tables and Tautologies – Equilent Propositions – the conditional and biconditional – argument and proofs 0 predicate Logic – Logical and electric circuits – Boolean algebra – Boolean functions some applications – Minimization.
Section 1.1 to 1.9,3.1 to 3.6 of (1)

UNIT – II
Graph Theory – Basic ideas and definitions – Planer Graphic – Connectivity – Computer representations of graphs – Directed graphs and trees – paths, cycles etc.- Dijkstra’s algorithm. Euler & Hamiltoniah paths.
Section 5.1 to 5.6, 6.1 to 6.3 of (1)

UNIT – III
Elementary Combinations –Basics of counting – combinations and permutations – their enumerations with repetitions – Engineering permutations with constrained repetitions - Binomial coefficients – the binominal and multinomial theorem – the principle of inclusion – exclusion.
Section 2.1 to 2.8 of (2)

UNIT – IV
Recurrence relations – Generating functions of sequences – calculating coefficients of generating functions – Recurrence relations – Solving recurrence relations by substitution and generating the method of characteristic roots – Solution of inhomogeneous linear recurrence relations.
Section 3.1. to 3.6 of (2)

TEXT BOOKS:
1.Stephen a Wiitala, Discrete Mathematics, a Unified approach Mc Graw Hill International edition, Computer Science Series, 1987. new editions, available (if any)
2.Joe L.Mott, Abraham Kandel, Theodore P.Baker; Discrete Mathematics for Computer Scientists and Mathematics, Prentice Hall, NJ, 1986.

REFERENCE BOOKS:
1.Kenneth H.Rosen; Discrete Mathematics, Mc. Graw Hill International Editions.

***************************************************************************************************************************************

M. Sc. COMPUTER SCIENCE
1.2 Modern Operating System
4 Hr. PER WEEK
UNIT – I
Introduction to Operating Systems: Computer System Structure, Operating System
Structures : Architecture of distributed system, issues in distributed operating system, inherent Limitation of distributed system, logical clocks, global state, Distributed shared memory, Process concepts, process scheduling, inter process communication. CPU Scheduling: Criteria, Scheduling algorithms, Multiple processor scheduling, Real times scheduling, Algorithm evaluation. The critical section problem synchronization. Critical regions, Monitors, Atomic transactions.
Dead locks: System model, Dead lock characterization. Methods of handling Dead
locks, deadlock prevention, Deadlock avoidance, dead lock detection. Recovery from dead lock, combined approach to deadlock handling

UNIT – II
Introduction, Logical versus physical address space. Swapping. Allocation or frames, thrashing, other considerations, demand segmentation. Thread scheduling and dispatching, interrupt and exception handling, system service dispatching, multiprocessor synchronization, file concept, access methods, directory structure and protection. File system implementation: system structure allocation Methods, free space management, directory implementation, secondary Storage structure, disk structure, disk scheduling, disk management, swap – space management.

UNIT – III
Security: Goals of protection and security Management: Revocation of access rights.
Two case studies – one on Unix/ Linux / Solaris and another Windows Server. Failure
recovery, classification of failure, Basic approaches, check – Fault tolerance, commit protocols, voting protocols, concurrency controls, lock time safe ordering.

UNIT – IV
System Administration commands: For – Unix / Linux / Solaris : user management, resource management, network management, security management, process management, backup and recovery.
TEXT BOOKS:
1. Andrew S.Tenen Baum Modern Operating System Prentice Hall of India Easter
Economy Edition, 1998.
2. M.Singhal and H.G.Shivarathi, Advanced concepts in operating system, Mc.Graw
Hill, 1994.
3. Abraham Silberschatz and Peter B.Gavilin, Operating System concept, Addison Wesily Publishing Company, Fifth edition, 1998.
***********************************************************************************

M. Sc. COMPUTER SCIENCE
1.3. Micro processor and Micro Controllers
4 Hr. PER WEEK
UNIT I
Digital System- Number System, Logic Gate, Boolean Algebra, Flip-Flops, Registers,
Encoders, Decoders, Multiplexers, Demultiplexers, Counters, D/A and A/D Converters,
DC Powder Supplies, SMPS, UPS (Block diagram, with technical information).
(text – 1, Ch:2, Ref- 3 Ch.13)
UNIT – II
Micro Processors, 8085 – Evolution of Microprocessors and Digital Computers, memory
(Storage Type and Devices), Buses Bus Architecture, Intel 8085, Instruction Cycle,
Timing Diagrams, Addressing Modes and Instructions with simple examples.
(text – 1, Ch, 1,3,4)
UNIT – III
Microprocessors, 8085 – Intel 8086, Block Diagram and Operations, Registers,
Interrupts, Bus Cycle, Assembler Directives, and Operators, Addressing Modes and
Instructions with simple examples. Interfacing peripheral devices – PPI 8257, PIC 8259, 8253 Counter / Timer.
(text – Ch: 7,11, 2,3: ref- 4)
UNIT – IV
Micro controllers, 8051 – Detailed Architecture of Single chip Micro controller – 8051, Registers, Flags and PSW, Internal Memory, Special Function Registers, I/O Interrupts, Instructions with simple examples, Other 8 bit, 16 bit and 32 bit Micro controllers (block diagram. Only)
(text – 1: Ch: 10 text 3, Ch: 16, Text- 4, Ch:3)
Special Devices – CRT, Floppy, Hard Disk and Printer Controllers, KBD 8279, Memory
Controllers, cache controllers, CRT display printer, scanners, (Brief Technical
Descriptions).
Text books:
1.Fundamentals of Microprocessors and Microcomputers by B.Ram Dhanapat Rai
Publicaitons (P)Ltd, India.
2.Microprocessors Architecture, Programming and Application with the 8-85, 4th
Edition Ramesh S. Gaonkar Penram Inernational Publising (India).
3.Advanced Microprocessors and Peripherals, Architecture, Programming and
Interface by A.K.Ray and K.M.Bhurchandi TMH, India.
4.The 8051 Microcontroller Architecture, Programming & Applications, 2nd Edition
by Kenneth J.Ayala Penram International Publising (India).
Reference Books and Data books:
1.Digital Systems Principal and Applications, 8th Edition by Ronald J.toccl, Neal S.
Widmer Pearson Education PTe, Ltd, India
2.Digital Principles & Applications by – Albert Paul Malvino and Donald P, Leach
TMH, India.
3.Fundamentals of Digital Circuits by A. Anand Kumar PHI, India.
4.Ics & Microprocessors - Data Hand Book BPB Publications, India
5. The Intel Microprocessors 8-856/8088, 80186/188, Pentium Pro Professor
Architecture, Programming and Interfacing 4th Edition By – Barry B.Brey PHI,
India.
6. Microprocessors and Interfacing, Programming and Hardware By Douglas V.Hall
TMH, India.
7. Microprocessor Systems – The 8086/8088 Family, Arch, Prog, and Design by Yu-
cheng Liu and Glenn A.Gibson PHI, India.
8. The 8051 Microcontroller and Embedded systems by Muhammed Ali Mazidi,
Janice Gillispie Mazid person Education Pte, Ltd, India.
9. Programming and Cuistomizing The 8051 Micro controller by Myke Predko
TMH, India.
**********************************************************************************

M. Sc. COMPUTER SCIENCE
1.4 Software Engineering
4 Hr. PER WEEK
UNIT – I
Introduction to Software Engineering project size and its categories planning a software project – software developing life cycle – planning and organizational structure.
UNIT – II
Software cost estimation, Least factor – cost estimation techniques, maintenance cost estimation – Software requirement specifications -formal specification techniques.
UNIT- III
Software Design – Fundamental design concepts and relations o Modularization –
Module design techniques – detailed design consideration – Implementation issues –
Structures coding techniques – coding style – standards and guidelines – Documentation – verification and validation techniques – quality assurance – walk through and inspection – testing – format verification.
UNIT – IV
Software tools – overview of CASE – Software reliability – Software errors – Faculty –Repairs and availability – Software maintenance – Management aspects of maintenance –maintenance tools and techniques.
TEXT BOOKS:
1.RS. Pressman – Software Engineering. Mc. Graw Hill publishing Co. 1987.
Reference: Books:
1.R.Facles – Software Engineering, Mc. Graw Hill Publishing Co. 1986.

*************************************************************************************

M. Sc. COMPUTER SCIENCE
1.5 COMPUTER GRAPHICS
4 Hr. PER WEEK
UNIT – I
A survey of computer graphics, overview of graphic systems, Video Display devices,
Raster Sean systems, Random scare systems, graphic input devices, Hard copy devices. Graphics software.Output Primitives: Line-Drawing Algorithms DDA, Bresenhan line Algorithm, Midpoint circle Algorithm, Ellipse Algorithm, Polygon fill Algorithms, : Scar – line, Boundary fill, Floodfill Algorithms.
UNIT – II
Attributes of output primitives: Line Attributes, Curve Attributes, Area fill and character Attributes Two dimensional transformations: Basic transformations, homogeneous representation, composite transformation, reflection and shear transformation.
UNIT – III
Two – dimensional viewing : Viewing – pipeline, windows to view coordinate
transformation Clipping Operations: Cohen – Sutherland line clipping liang – barsky lion clipping, Nicholl-Lee Nicholl – Line Clipping – Hodgman polygone clipping, weiler Autherton polygon clipping.
UNIT – IV
Three dimensional objective representations, polygon surfaces, plygon tables, plane
Equations, cubic Berier curves, B-spline, octrees. 3D – transformations : Translation, Rotaiton, Rotations about a arbitrary point Projections: Perspective projections and parallel projections Visible surface detection: Back faced detection: Z-buffer Algorithms Depth sorting Algorithm, Area subdivision Algorithm.
TEXT BOOKS:
1.M.Pauline Baker, Computer Graphics, C-Version, Prentice Hall of India Second
Edition 1995.
Reference Books:
1.Computer Graphics by Harinton, Mc.Graw Hill Publishing Co. 1987.

**********************************************************************************

M. Sc. COMPUTER SCIENCE
1.6 (LAB UNIX AND COMPUTER GRAPHICS)
6 Hr. PER WEEK
UNIT – I
a) Shell Programming
1. Using ‘case’, them and ‘if’ Loop
2. To identify the type of a given file
3. Inter process communicating using pipes
4. To wish ‘Good morning’ and good evening’ depending on the time
b) Programmes Using System Calls:
5. Implementation of Cp(Copy) command of UNIX
6. To create a child process using fork ( ) and exce ( ) system calls
7. Process communication using signals
8. To convert upper case to lower case letters of a given ASCII file
UNIT – II
Computer Graphics (using C)
9. Line drawing algorithms – DDA and Bresenham’s method
10. Circle and eclipse drawing algorithms – parametric and Bresenham’s method
11. Algorithm for polygon inside tests and testing convexity
12. Polygon filling using scan conversion method
13. Transformation on 2-D composite objects
14. Line clipping algorithms – Sutherland – Hodgman method
15. Polygon clopping using Sutherland – Hodgman method
16. 3 – D transformation on a cube
17. Bezier curves drawing.
***********************************************************************************

M. Sc. COMPUTER SCIENCE
1.7 LAB – DIGITAL SYSTEMS, MICROPRECESSORS AND MICROCONTROLLLERS
6 Hr. PER WEEK
UNIT – I
Digital Systems:
1. Verification of The Logic Gates, Flip – Flops
2. Encoder / Decoder, Mux / Demux
3. Design of Counters
UNIT – II
1. Addition, Subtraction, Multiplication and Division
2. Fine Ones and Two’s complement of a number
3. Find Square and Square root of a number
4. Find Largest and Smallest Number in Data Array / form a Series of Numbers
5. To Arrange a Data / a Series of Number in Ascending and Descending Order
6. Write a Delay Subroutine Program, using One, Two or More Registers
7. Measurement of Physical Quantities of – Temperature, Speed of a Motor (using a
Tacho generation)
8. Interfacing a Stepper Motor, with forward and Reverse Steps
9. To Generate a Square Wave of Pulse
(text – 1, Ch; 6,9)
UNIT – III
Microprocessors – 8086
1. Addition, Subtraction, Multiplication and Division of the given Operands.
2. Find Largest and Smallest Number in Data Array/from a Series of Numbers\
3. To Arrange a Data Array/ a Series of numbers in Ascending and Descending
order.
4. Display the Message “………………” on the Monitor, String Operations.
5. Write a Program to generate a Delay of 100 ms, 100 sec, 1 minute and 10 minutes
6. To Generate Waveforms of – Sawtooth, Triangular, Pulse, Sine, by Interfacing
DCA
By using – 8086 Kit, DEBUG of DOS utility, MASM or TASM.
UNIT – IV
1. Setting up UMPS and getting a program to assemble
2. Arithmetic Operations
3. Direct and Indirect Bank Register Addressing
4. RAM Direct addressing
5. Subroutines
6. State Machines
Experiments with Universal Microprocessor Program Simulator (UMPS)
(Ref: -9, Ch.9)
**********************************************************************************

Semester III

M.SC. COMPUTER SCIENCE
3.1 QUANTITATIVE TECHNIQUES
4 Hr. per week
UNIT I:
Probability models: Mathematical, Statistical and axiomatic definitions of Probability. Addition and Multiplication rules of probability. Conditional Probability and Bayes Theorem . Discrete and continuous random variables, probability mass function, probability density function, cumulative distribution function and Mathematical expectation of a random variable. Binomial, Poisson, Uniform, Normal, Exponential and Gamma distributions, Mean and variance of these distributions. Concepts of sample, sampling distribution and standard error t, F and Chi – square distributions.

UNIT II:
Statistical Inference: Estimation of Parameters – Unbiasedness, Consistency and
efficiency Methods of maximum likelihood and moments. Interval estimation and
confidence limits of parameters of normal distribution. Testing of hypotheses – Tests of mean (s), variance (s) and proportion (s) and goodness of fit test based on Z, t, F and Chi – square distributions.

UNIT III:
Linear Programming Problem (LPP) : Formulation and solution by Graphical method of LPP. Standard LPP form and its basic solutions. Solution of LPP by simplex algorithm. Use of artificial variables and special cases in simplex algorithm. Definition of dual problem and economic interpretation of duality. Dual simplex method.

UNIT IV:
Transportation Problem(TP) : Formulations of it as LPP. Initial basic feasible solution by North – West Corner rule. Least cost and Vogel’s approximation methods. Optimum solution by modified distribution method. Assignment Problem (AP): Formulation of its as LPP. Optimum solution by Hungarian Method. Queuing Theory: Queuing system and characteristics of a queue. M/M/1 queuing system without proofs.
Reliability : Concept of reliability , failure density and Hazard function.
System reliability of series, parallel and K – out of n systems.
TEXT BOOKS:
1. Trivedi, K.S: Probability and Statistics with Reliability, Queuing and Computer Applications. Prentice Hall of India, New Delhi(1999).
2. Sharma, S.D: Operations Research, Kedarnath and Ramnath and Co. (2002).

REFERENCE BOOKS:

1. Hines, W.W., Montogemery, D.C., Goldsman, D.M. and Borror, C.M: Probability and Statistics in Engineering, Fourth Edition, John Wiley and Sons, Asia Private Limited(2003).
2. Hamdi A. Taha, Operations Research and Introduction Prentice Hall of India New Delhi(1998).
*************************************************************************************

3.2 ARTIFICIAL INTELLIGENCE
4 Hr. per week
Unit I
Artificial Intelligence-Definition, introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test, Hill climbing – Breadth – First search, problem reduction, Constraint satisfaction knowledge representation issues – representation and mapping-approaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic, unification, resolution.

Unit II
Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic Nets-Frames-Conceptual dependency Scripts, CYC. Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning, Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic.

Unit III
Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples, explain based learning – connectist models – Neural networks, applications Natural Language processing, syntax, Semantic and pragmatic processing perception. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions.

Unit IV
The brain as a dynamical system, Neurons as functions, signal monotonicity, Biological activations and signals, Neuron fields. Theory of Fuzzy sets; Definition dilation, concentration, normalizatization, reasoning with fuzzy logic, natural language computation, Fuzzy Maching algorithms.
TEXT BOOKS:
1. W.F.CLICKSIN and C.S.MELLISH, Programming in PROLOG, spinger International Student Edition.
2. Dan.W.Patterson, Introduction to Artificial Intelligence and Expert System, Prentice Hall of India.
REFERENCE BOOK:
1. Artificial Intelligence by Elanine Rich, Mc Graw Hill Book Company.
*************************************************************************************

3.2 ARTIFICIAL INTELLIGENCE
4 Hr. per week
Unit I
Artificial Intelligence-Definition, introduction to AI techniques Problems Problem spaces and search-state space search problem-production system-problem characteristics-Heuristic search – Generate and test, Hill climbing – Breadth – First search, problem reduction, Constraint satisfaction knowledge representation issues – representation and mapping-approaches-issues-the frame problem – knowledge representation using predicate logic – predicate logic, unification, resolution.

Unit II
Procedural versus declarative knowledge-Logic Programming-Forward versus backward reasoning-matching declarative knowledge representation-Semantic Nets-Frames-Conceptual dependency Scripts, CYC. Symbolic reasoning under uncertainty-Non-monotonic reasoning – Implementation of depth-First search and Breadth first search Statistical reasoning, Certainty Factors and rule based systems-Bayesian Networks – Dempster Shafter Theory – Fuzzy logic.

Unit III
Game playing-minmax search-alpha-beta heuristics-refinement intertive depending planning-Components-Goal stack planning-Nonlinear planning – hierarchical planning-Learning-Rote learning-Rote learning – Learning by taking advice – Learning from examples, explain based learning – connectist models – Neural networks, applications Natural Language processing, syntax, Semantic and pragmatic processing perception. Expert System Representation and using domain knowledge – Expert system shells – Explanation Knowledge acquisitions.

Unit IV
The brain as a dynamical system, Neurons as functions, signal monotonicity, Biological activations and signals, Neuron fields. Theory of Fuzzy sets; Definition dilation, concentration, normalizatization, reasoning with fuzzy logic, natural language computation, Fuzzy Maching algorithms.

TEXT BOOKS:
1. W.F.CLICKSIN and C.S.MELLISH, Programming in PROLOG, spinger International Student Edition.
2. Dan.W.Patterson, Introduction to Artificial Intelligence and Expert System, Prentice Hall of India.
REFERENCE BOOK:
1. Artificial Intelligence by Elanine Rich, Mc Graw Hill Book Company.
*************************************************************************************

M.Sc. COMPUTER SCIENCE
3.4 NETWORK SECURITY
Unit I
Conventional encryption, Security attacks, Security, Model for network security,
conventional encryption model, encryption techniques, DES, Triple DES, key
distribution, random number generation.

Unit II
Public – Key cryptology, principles of public – key cryptosystems, RSA algorithm,
key management, distribution of public keys, public key – distribution of
secret keys.

Unit III
Authentication and digital systems, authenticate requirements – functions
cryptographic checksum, hash function, digital signatures authentication protocols,
Kerberos, x-509 directory, authentication services, Diffie – Hellman key exchange,
digital signature standards.

Unit IV
Cryptographic algorithms, The MD 5 message digest algorithm, secure hash algorithm,
international data encryption algorithm, LUCA public key encryption – Electronic mail and management security – pretty good privacy (PGP), Privacy enhanced mail.
TEXT BOOKS:
1. William Stallings, Network and Internet work Security, Prentice Hall of India.

**************************************************************************************

M.SC. COMPUTER SCIENCE
3.5(C) PARALLEL PROGRAMMING (Elective)
4 Hr. per week
Unit I
Introduction to parallel Computing – Motivation, scope, parallel programming
platforms – Implicit parallelism, limitations of memory system performance,
dichotomy, physical organization, communication costs, principles of parallel
algorithm design – preliminaries, decomposition techniques,
(Pages No. 1 to 109 from text book).
Unit II
Tasks and interaction, mapping techniques for load balancing, methods for
containing interaction overheads, parallel algorithm models. Basic communication operations – one-to-all broadcast and all-to-one reduction and all-to-all broadcast and reduction, scatter and gather. Analytical modeling of parallel programs – performance metrics, effect of granularity, scalability. (Page 110-228 from text book).
Unit III
Programming using message passing - building blocks, message passing
interface (MPI), Topology and embedding, non-blocking communication operations,
collective communications and computation operations. Programming shared address space – threads, synchronization, controlling threads, read-write locks, barriers, OpenMP. (Pages 23 – 331 of text books)

Unit IV
Dense matrix algorithms – matrix-vector multiplication, matrix-matrix multiplication, solving a system of linear equations. Sorting algorithms – Issues, sorting networks, bubblesort, quicksort. Fast-Fourier transform – serial algorithm, binary exchange algorithm, transpose algorithm.
(Pages 337-416, 538-560)
TEXT BOOK:
1. Ananth Grama, Anshul Gupta, Geroge Karypis, Vipin Kumar – Introduction to Parallel Computing, Second Edition, Pearson 2003.
REFERENCE BOOKS:
2. Gregory V.Wilson, Practical Programming, PHI 1998.
3. Michael J. Quinn – Parallel Programming in C with MPI and OpenMP, Tata McGraw Hill.
***********************************************************************************

M.SC. COMPUTER SCIENCE
3.6 Lab – System Security Lab
Network Security Practical
Implementation of these Algorithms in Java or C/C++
A. Encryption Techniques.
* Polyalphabetic Ciphers
* Transposition techniques
* Hill Ciphers
* Playfair Ciphers
* Monoalphabetic Ciphers
* DES (Data Encryption Standard) Encryption
* Double DES
* Triple DES
B. Public Key Cryptography using RSA
* Key Generation
* Encryption & Decryption Techniques
* Diffie – Hellman key Exchange
* Hash Function
* Kerboros ( Client & Server ) in Network
* MD5 (Message Digest Algorithm)
* Secure hash Algorithms(SHA)
* Pretty Good Privacy function(services)
* Authentication
* Confidentiality
* Cipher block chaining mode(CBC)
* Electronic code book mode(ECB)
* Cipher feedback mode
* Digital Signature Algorithms
* Message Authentication code
* Hash message authentication code
* Secure Multi purpose Internet mail Extension(S/MIME)
* Envoloped Data
* Signed Data
* Clear Signing
* Internet Data Encryption Algorithms
* Encryption
* Decryption
C. Firewall installation & Configuration on Networking O.S such as Linux
Server System

JNTU All B.Tech Courses Syllabus

JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY,

HYDERABAD

JNTU is one of the oldest University in Hyderabad situated at the heart of the city. Initially this university established as Nagarjuna Sagar Engineering College in the year 1956 by the government of Andhra Pradesh. After seeing the increasing growth of Industrial and technological development in India, new technological education required for the industrial growth of the country in general and more particularly for the State of Andhra Pradesh, "Jawaharlal Nehru Technological University" was established on 2nd October, 1972, by an act of State Legislature.

University main branch is located at Kukatpally, Hyderabad. When the college was under the purview of the Department of Technical Education, it was affiliated to the Osmania University, Hyderabad. This university is established with the noble task to strengthen and improvement the technical education in India. University has a much enhanced infrastructure which determines the progress and prosperity of a nation. It is the first technological industry in India. On its formation, the Government Engineering Colleges at Anantapur, Kakinada and Hyderabad, along with the Government College of Fine Arts and Architecture at Hyderabad, became its Constituent Colleges. It is one of the oldest Engineering College in South India.

There are almost all Engineering colleges in Andhra Pradesh and mostly in Hyderabad are affiliated with JNTU. Before its establishment, other privately owned Engineering and other Fine arts colleges affiliated to their regional Universities such as Osmania University in Hyderabad, Andhra University in Vishakapatnam.

B.Tech Courses Syllabus

ELECTRONICS AND COMMUNICATION ENGINEERING

ELECTRONICS AND INSTRUMENTATION ENGINEERING

ELECTRICAL AND ELECTRONICS ENGINEERING

COMPUTER SCIENCE AND ENGINEERING

CIVIL ENGINEERING

CHEMICAL ENGINEERING

INFORMATION TECHNOLOGY ENGINEERING

MECHANICAL ENGINEERING