SWAMI RAMANAND TEERTH MARATHWADA UNIVERSITY VISHNUPURI, NANDED

PROPOSED STRUCTURE OF SYLLABUS AND SCHEME OF EXAMINATION FOR ME (Computer Networking and Engineering) FIRST YEAR

SEMESTER – I

Sr. No.

SUBJECT TEACHING SCHEME EXAMINATION SCHEME TH PR TOTAL PAPER TW TEST ORAL TOTAL

01 Advanced Computer Networks

4 - 4 100 - 25 - 125

02 Information Theory and Coding

4 - 4 100 - 25 - 125

03 Operating System Design

4 - 4 100 - 25 - 125

04 Elective-I 4 - 4 100 - 25 - 125 05 Elective-II 4 - 4 100 - 25 - 125 06 LAB-I - 2 2 - 25 - - 25 07 LAB-II - 2 2 - 25 - - 25 08 Seminar-I - 2 2 - 50 - - 50 09 Comprehensive

Viva-I - - - - - - 75 75

TOTAL MARKS 800 Select any two subjects from the list of subjects given below for Elective-1 and Elective-II 

1. Distributed Databases 4. Web Engineering 2. Principles and Practices for IT Management 5. Probability theory and Random Processes 3. Design and Analysis of Algorithms

 SEMESTER - II

Sr. No.

SUBJECT TEACHING SCHEME EXAMINATION SCHEME TH PR TOTAL PAPER TW TEST ORAL TOTAL

01 Mobile and Wireless Networks

4 - 4 100 - 25 - 125

02 Network Security and Cryptography

4 - 4 100 - 25 - 125

03 Distributed Systems Concept and Design

4 - 4 100 - 25 - 125

04 Elective-III 4 - 4 100 - 25 - 125 05 Elective-IV 4 - 4 100 - 25 - 125 06 LAB-III - 2 2 - 25 - - 25 07 LAB-IV - 2 2 - 25 - - 25 08 Seminar-II - 2 2 - 50 - - 50 09 Comprehensive

Viva-II - - - - - - 75 75

TOTAL MARKS 800  Select any two subjects from the list of subjects given below for Elective-III and Elective-IV  

1. Data Warehousing and Mining 4. Network Design, Modeling and Analysis 2. Wireless Sensor Networks 5. Image Analysis & Computer Vision 3. Neural Networks And Its Applications

 

SWAMI RAMANAND TEERTH MARATHWADA UNIVERSITY

VISHNUPURI, NANDED PROPOSED STRUCTURE OF SYLLABUS AND SCHEME OF EXAMINATION FOR

ME (Computer Networking and Engineering) SECOND YEAR

SEMESTER-III/

Sr. No.

SUBJECT EXAMINATION SCHEME PAPER TW ORAL /

PRESENTATION TOTAL

01 Dissertation Part-I - 100 100 200  

SEMESTER-IV

Sr. No.

SUBJECT EXAMINATION SCHEMEPAPER TW ORAL/

PRESENTATION TOTAL

01 Dissertation Part-II - 100 200 300  

. Note:

• Lab-I will be based on Advanced Computer Networks OR any of the mandatory Subjects in Sem-1 • Lab-II will be based any of the two Electives, Elective -1 OR Elective-II • Lab-III will be based on Mobile and Wireless Networks OR any of the mandatory subjects in

Sem-II • Lab-IV will be based any of the two Electives, Elective -1II OR Elective-IV • Seminar-I shall be based on current OR recent trends in technology from the syllabus of Sem-I. • Seminar-II shall be based on current OR recent trends in technology from the syllabus of Sem-II • Dissertation shall consist of Research work done by the candidate in the areas related to Computer

Networking and Engineering

SEMESTER I

Advanced Computer Networks

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

Unit I Computer Network and the Internet What is the Internet, The Network core, Network Access and Physical media, ISPs and Internet Backbones, Delay and Loss in Packet-Switched Networks, Protocol layers and their service Models. History of Computer Networking and the Internet.

Unit II Application layer Principles of Application layer protocols. The Web and HTTP, File transfer, FTP, Electronic mail in the Internet, DNS-The Internet’s Directory service, Socket programming with TCP, Socket programming with UDP, Building a simple web server, Content distribution. Unit III Transport Layer

Introduction and Transport layer services, multiplexing and De-multiplexing, Connectionless transport: UDP, Principles of reliable data-transfer, Connection oriented transport: TCP, Principles of congestion control, TCP congestion control. Unit IV Network Layer and Routing Network service models, Routing Principles, Hierarchical Routing, The Internet Protocol (IP), Routing in the Internet, What is inside a Router, IPv6, Multicast Routing, Mobility and the Network layer,

Unit V Link Layer and LAN Data Link layer: Introduction and services, Error detection and correction techniques, Multiple Access Protocols, LAN addresses and ARP, Ethernet, Hubs, Bridges and Switches, Wireless links and PPP: the point to point protocol, Asynchronous Transfer Mode (ATM), Frame Relay. Unit VI Multimedia Networking Multimedia Networking Applications, Streaming stored audio and video, Making Best of the best service: An example on Internet telephony, Protocols for real time interactive applications, beyond best efforts, scheduling and policing mechanism, Integrated services, RSVP, Differentiated services Unit VII Network Security

Cryptography, Symmetric-Key cryptography, Asymmetric-Key cryptography

Unit VIII Network Management Network management system, Configuration management, fault management, performance management) SNMP (concept, management concept, structure of management, information management, information base, lexicographic ordering) References:

1. J.F. Kurose & K.W. Ross, “Computer Networking- A top down approach featuring the internet”, Pearson, 2nd edition, 2003. 2. Walrand .J. Varatya, “High performance communication network”, Margan Kanffman – Harcourt Asia Pvt. Ltd. 2nd Edition, 2000. 3. LEOM-GarCIA, WIDJAJA, “Communication networks”, TMH seventh reprint 2002. 4. Aunurag Kumar, D. MAnjunath, Joy Kuri, “Communication Networking”, Morgan Kaufmann Publishers, 1ed 2004. 5. Hersent Gurle & petit, “IP Telephony, packet Pored Multimedia communication Systems”, Pearson education 2003. 6. Fred Halsall and Lingana Gouda Kulkarni, “Computer Networking and the Internet”, fifth edition, Pearson education 7. Nader F.Mir, “Computer and Communication Networks”, first edition. 8. Larry l.Peterson & Bruce S.David, “Computer Networks: A System Approach”- 1996

Information Theory and Coding

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT I Introduction to Information Theory and Coding: Probability, random variables, probability distribution and probability densities, functions of random variables, statistical averages of random variables, some useful probability distributions.

UNIT II Fundamental Limits on Performance: Introduction : Elements of Digital communication systems ; Communication channels and their characteristics; Fundamental limits on performance, Historical perspective in the development of digital communication; Review of the features of a discrete memo less channel and the channel capacity theorem, Sampling theorem.

UNIT III Source Coding: Coding for analog sources-optimum quantization, scalar quantization, vector quantization, coding techniques for analog sources, temporal waveform coding, PCM, DPCM, adaptive PCM and DPCM, DM, spectral waveform coding, model based source coding. UNIT IV Channel Models and Channel Capacity: Error Control Coding: Linear block codes, generator matrix and parity check matrix, some specific linear block codes, cyclic codes, transfer function of a convolution code, optimum decoding of convolution codes-Viterbi algorithm, BCH codes.

UNIT V Coded Modulation Technique: BPSK, QPSK, 8PSK, QAM and Trellis coded modulation techniques. UNIT VI Error Correcting Codes: Gal’ois fields, vector spaces and matrices – Concatenated block codes - Punctured convolution codes – Non-binary dual-K codes and concatenated codes – Trellis coded modulation - Binary cyclic codes – Multiple error correcting codes – Majority logic decoding – Convolution codes - Burst error correcting codes – Two dimensional codes – ARQ – Performance of codes, Advances in Information theory and coding.

Refrences: 1. Ranjan Bose, Information Theory, Coding and Cryptography, TMH. 2. G. A. Jones and J.M. Jones, Information Theory and Coding, Springer. 3. J. G. Proakis, Digital Communication, Fourth Edition, McGraw Hill 4. Simon Haykin, Digital Communication, John Wiley and Sons. 5. J. G. Proakis and M. Salehi, Communication Systems, 2nd Ed. 6. B. Sklar, Digital communications Fundamentals and applications, Pearson Education

Operating System Design

(One paper 3 Hours, 100 marks, test =25 marks) UNIT I Introduction: Introduction, hardware, hardware interface, operating system interface. Design problems, operating system design techniques, implementation process- the system call interface, system initialization, process switching, system call interrupt handling, program error interrupts, disk driver system, implementing waiting , flow of control through OS, signaling and interrupts, event table managers, process implementation, parallel system- parallel hardware, OS for two processor system, race conditions with shared processes, atomic actions, multiprocessor OS, threads. UNIT II Interprocess Communication Patterns: competing & co-operating, problems, race conditions & atomic actions, new message passing system calls, IPC pattern: mutual exclusion, signaling & rendezvous models, producer-consumer & client server models. Deadlocks-conditions for deadlock, dealing with deadlocks, two phase locking, message variations, synchronization, semaphores, design techniques- some examples design techniques. Memory management levels of memory management, linking and loading process, memory management design, dynamic memory allocation, keeping track allocation of blocks, multiprogramming issues, memory protection, memory management system calls. UNIT III Virtual Memory: fragmentation and compaction, dealing with fragmentation paging, swapping, overlay, page replacement-global and local page replacement algorithms, thrashing and load control, dealing with large page tables, sharing memory, Design techniques-examples of multiplexing and late binding. UNIT IV I/O Devices: Devices and controllers, terminal devices, communication devices. I/O subsystem I/O system software, disk devices driver access strategies, modeling disks, unification of files and device, generalized disk devices driver, disk caching, file system- File abstraction, naming , file system objects and operations. UNIT V File System Organization: Organization, file descriptors, locating file blocks on disks, implementation of logical to physical block mapping, file sizes, booting the OS file system reliability , file security and and protection. Recourse management and protection- recourses in an OS, resource management issues, types of resources, integrated scheduling, queuing authentication, mechanism for protecting hardware recourses, representation of protection information, mechanisms for software protection, Design techniques- caching hierarchical names and naming of objects. UNIT VI Security: Security threats, protection, intruders, malicious software, trusted systems, security features in UNIX and windows 2000.

References: 1.Charles Crowely,”Operating system- a design oriented approach” Tata McGraw- edition , New Delhi, 1998 2.Silberschatz and Galvin,”Operating System concepts” Addison Wesley 1998 3.Tenebaum Andrew S.,”Modern Operating System” Eaglewood Cliffs, NJ: Prentice hall ,1992 4.Stallings W, “Opearting system- Internals and design principles”, 4th Edition, PHI ,2002

Elective 1 and II

Distributed Databases

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT – I: Data base System Applications, data base System VS file System – View of Data – Data Abstraction – Instances and Schema – 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: Stabilizability, 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. Refrences: 1. Data base System Concepts, Silberschatz, Korth, McGraw hill, IV edition. 2. Data base Management Systems, Raghurama Krishnan, Johannes Gehrke, TATA McGrawHill 3rd Edition 3.Introduction to Database Systems, C.J.Date Pearson Education 4. Data base Systems design, Implementation, and Management, Rob & Coronel 5th Edition. Thomson 5. Data base Management System, Elmasri Navrate Pearson Education 6.Data base Management System Mathew Leon, Leon Vikas. 7.Data base Systems, Connoley Pearson education

Elective 1 and II

Principles and Practices for IT Management (Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I Management Perspectives Role and importance of management, process of management – planning, organizing, staffing, directing, controlling. Nature, purpose and principles of management, Business policy, tools and techniques of strategic management, business ethics and social responsibilities

UNIT II Preliminary planning of an IT Project Gathering project Information, defining the project goals, establishing project priorities, requirements analysis, risk management, budgeting a project, creating a work breakdown structure, estimation

UNIT III Organizing an IT Project Organizing a Project Team: - Assessing internal scales, creating a team, managing team issues, resources procurement Preparing and Implementing the project plan: - Defining the project schedule, project network diagram creation and analysis, project constraints, tracking project progress and financial obligations Revising the project plan:-need for revision , establishing change control, implementing the project changes, coping with project delays

UNIT IV Group Dynamics and Team Management Theories of Group Formation –Formal and Informal Groups and their interaction, Importance of teams - Formation of teams – Team Work, Leading the team, Team Meeting. Conflict Management - Traditional vis-à-vis Modern view of conflict, Conflict Process - Strategies for resolving destructive conflict, Stress management, employee welfare, energy management and energy audit.

UNIT V Modern approaches to management Concept of Knowledge management, change management, technology management, supply chain management, introduction to Intellectual property Rights (IPR)and cyber laws, process and project quality standards – six sigma, CMM, CMMI, PCMM, Impact of IT quality management systems, learning organizations

UNIT VI Applications of IT in management Application of IT in functions like finance and accounting, stores, purchase, product design and development, quality control, logistics, customer relationship, marketing, project management, health care, insurance, banking, agriculture and service sector.

Reference Books: 1. Joseph Phillips, “IT Project Management”, Tata McGraw-Hill 2003 Edition 2.Management-Tasks, Responsibilities and practices, Peter Drucker 3. Management Theory and Practice- Ernst Dale 4. Management Information System-Javadekar 5. Business Policy- Azhar Kazmi 6.Industrial Energy Conservation- D.A.Ray, Pergamon Press

7. Resisting Intellectual Property-Halbert, Taylor & Francis Ltd ,2007

Elective 1 and II

Design and Analysis of Algorithms

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

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

Elective 1 and II

Web Engineering

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT I Introduction Motivation, Categories of web applications, Characteristics of web applications, Requirements Engineering: Introduction, Fundamentals, RE specifics in web engineering, Principles of RE for web applications, Adapting RE methods to web application development. UNIT II Modeling Web Application: Introduction, Fundamentals, Modeling specifics in web engineering, Modeling requirements, Content modeling, Hypertext modeling, Presentation modeling, Customization modeling, Methods and tools, Web Application Architectures: Introduction, Fundamentals, Specifics of web application architectures, Components of a generic web application architecture, Layered architectures, Data-aspect architectures. UNIT III Technology-Aware Web Application Design: Introduction, Web design from an evolutionary perspective, Presentation design, Interaction design, Functional design, Technologies for Web Applications: Introduction, Fundamentals, Client/Server communication on the web, Client side technologies, Document-specific technologies, Server-side technologies, Testing Web Applications: Introduction, Fundamentals, Testing specifics in web engineering, Test approaches, Test scheme, Test methods and techniques, Test automation. UNIT IV Operation and Maintenance of Web Applications: Introduction, Challenges following the launch of a web application, Content management, Usage analysis, Web Project Management: From software project management to web project management, Challenges in web project management, Managing web teams, Managing the development process of a web application. UNIT V The Web Application Development Process: Motivation, Fundamentals, Requirements for a web application development process, Analysis of the rational unified process, Analysis of extreme programming, Usability of Web Applications: Motivation, What is usability? What characterizes the usability of web applications? Design guidelines, Web usability engineering methods, Web usability engineering trends. UNIT VI Performance of Web Applications: Introduction, What is performance? What characterizes performance of web applications, System definition and indicators, Characterizing the work load, Analytical techniques, Representing and interpreting results, Performance optimization methods, Security for web Applications: Introduction, Aspects of security, Encryption, digital signatures, and certificates, Secure Client/Server interaction, Client security issues, Service provider security issues, The Semantic Web: Fundamentals of the semantic web, Technological concepts, Specifics of semantic web applications, Tools.

Reference Books: 1. Roger Pressman, David Lowe: Web Engineering: A Practitioner’s Approach, McGraw Hill, 2008 2.Gerti Kappel, Birgit Proll, SiegfriedReich, Werner Retschitzegeer (Editors): Web Engineering, Wiley India, 2007.

Elective 1 and II

Probability theory and Random Processes

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT-I Overview of Probability, Random variables, UNIT-II Probability functions, Functions of Random variables some important probability distributions, sequence of random variables, limit theorem, UNIT III Random Correlation function, power spectral densities, linear systems with random inputs, UNIT IV Gaussian and Poisson process, Markov chain with stationary transition probabilities, properties of transition functions, UNIT-V Classification of states, stationary distribution of Markov chain, Methods based on Markov chains for simulation of random vectors, topics of current research. Refe rences:

1. Alberto Leon and Garcia, “Probability and Random Processes for Computer Engineering “,Pearson Education

2. Papoulis A, Probability, “Random variables and Stochastic Processes”. McGraw Hill, 1984.

3. Taylor H. M. and Karlin S., “An Introduction to stochastic modeling“, 1984. 4. Bhat B. R., “Stochastic Models: Analysis and Applications”, New age publications, 2000.

SEMESTER II

Mobile & Wireless Networks (Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I Overview of transmission fundamentals Antennas and propagation, Signals, propagation, signal encoding, multiplexing, modulation, spread spectrum coding and error control. UNIT II Air interface designs and wireless network operation Characteristics of the wireless medium, physical layer alternatives for wireless networks, wireless medium access alternatives, network planning and wireless network operation UNIT III Wireless LANS , Mobile Network and Transport Layer IEEE 802.11, Bluetooth and Hiperlan IP packet delivery, agent discovery, registration, tunneling and encapsulation, optimization, reverse tunneling, mobile ad-hoc networks Indirect TCP, snooping TCP, mobile TCP, transaction oriented TCP, TCP over 3G wireless networks UNIT IV Wireless WANS Cellular network, GSM, GPRS, UMTS , CDPD and CDMA UNIT V Other Topics Operating Systems for mobile devices, wireless application protocol, WML and WMLScripts References: 1. Mobile Communications, Jochen Schiller 2. Wireless Communications and Networks, William Stallings 3. Mobile Computing, Talukder and Yavagal 4. The Wireless Appilcation Protocol, Singhal, Bridgman, Mauney, Alvinen, Bevis, Chan and Hild

Network Security and Cryptography

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT I INTRODUCTION AND NUMBER THEORY Classic Cipher Techniques – Substitution Ciphers, Mono-alphabetic Substitution and Poly-alphabetic Substitution – Transposition Ciphers. Number Theory and Finite Arithmetic, Counting in Modulus, Arithmetic, Congruence Arithmetic, Fermat’s Theorem and Euler’s Theorem- Exponentiation. UNIT II Cryptography: Substitution ciphers, Transpositions, Symmetric and asymmetric systems, cryptanalysis ,data encryption standard (DES) AES Encryption algorithms Public Key Cryptography, RSA Algorithms , Uses of Encryptions. ElGamal Algorithm – Key Management using Exponential Ciphers - Diffie-Hellman. UNIT III Program Security: Secure programs, Non-malicious program errors, Computer Viruses and Other malicious code, Targeted malicious code, controls against program threats. UNIT IV Operating System Security: Protected Objects and methods of protection, Memory address protection, Control of access to general objects, File protection Mechanism, User Authentication: Authentication basics, Password, Biometrics, UNIT V Database Security: Security requirements for Database , Reliability and integrity, sensitive data, interface, multilevel database, Proposals for multilevel security : separations , design of Multilevel secure databases , Trusted Front-end Practical issues UNIT VI Network Security Threats in networks, Network security controls, Firewalls Intrusion detection systems, Secure E-mail. Current Wireless Technology- Wireless Security WEP Issues, Attacks in wireless networks References: 1.C.P. Pfleeger and S.L.Pfleeger, “Security in Computing”, Pearson Education (LPE) 2.William Stallings “Cryptography and Network Security: Principles and Practice”, 3rd Edition, Pearson Education, 2002. 3. William Stallings “Network Security Essentials: Applications and Standards”, 2nd Edition, Pearson Education, 2000. 4. Behrouz A.Forouzan, “Cryptography and Network Security”, special edition, Tata McGraw Hill, 2007. 5.Bruce Scheneier, “Applied Cryptography”, John Wiley & Sons, 1994. 6.Douglas R.Stinson, “Cryptography: Theory and Practice”, CRC Press Series on Discrete Mathematics and its Applications, 1995. 7.Matt Bishop, “Computer Security: Art and Science”, Pearson Education 8.Kaufman, Perlman, Speciner, “Network Security” PHI. 9.Eric Malwald, “Network Security: A Beginner’s Guide”, TMH

Distributed Systems Concept and Design

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) UNIT I Characterization of Distributed Systems Introduction, Examples of distributed systems, Trends in distributed systems, Focus on resource sharing, Challenges, System models Case Study: the World Wide Web UNIT II Networking and Internetworking Introduction, Types of network, Network principles Internet protocols, Case studies: Ethernet, WiFi and Bluetooth, Remote Invocation: Introduction, Request-reply protocols, Remote procedure call, Remote method invocation UNIT III Interprocess and Indirect Communication Introduction, The API for the Internet protocols, External data representation and marshalling, Multicast communication Network virtualization: Overlay networks, Case study: MPI, Indirect communication: Introduction, Group communication, Publish-subscribe systems, Message queues, Shared memory approaches UNIT IV Operating System Support: Introduction, The operating system layer, Protection, Processes and threads, Communication and invocation, Operating system architecture, Virtualization at the operating system level, Distributed objects and components, Web services: Service descriptions and IDL for web services, XML security Coordination of web services, Peer-to-peer Systems: Napster and its legacy, Peer-to-peer middleware, Routing overlays, Security. UNIT V Distributed File Systems Introduction, File service architecture, Case study: Sun Network File System, The Andrew File System, Enhancements and further developments, Name Services: Introduction, Name services and the Domain Name System ,Directory services, Case study: The Global Name Service, The X.500 Directory Service, Time and Global States: Introduction, Clocks, events and process states ,Synchronizing physical clocks, Logical time and logical clocks, Global states, Distributed debugging. UNIT VI Transactions and Concurrency Control Introduction to coordination and agreement, Distributed mutual exclusion, Elections ,Coordination and agreement in, group communication, Consensus and related problems, Transactions ,Nested transactions, Locks, Optimistic concurrency control, Timestamp ordering, Comparison of methods for concurrency control, Distributed Transactions: Flat and nested distributed transactions, Atomic commit protocols, Concurrency control in distributed transactions, Distributed deadlocks, Transaction recovery UNIT VII Replication and Distributed Multimedia Systems System model and the role of group communication, Fault-tolerant services, Case studies of highly available services: the gossip architecture, Bayou and Coda, Transactions with replicated data, Mobile and Ubiquitous Computing: Introduction, Association, Interoperation, Sensing and context-awareness, Security and privacy, Adaptation ,Case Study: Cooltown ,Characteristics of multimedia data ,Quality of service management Resource management, Stream adaptation Case studies: Tiger, Bit Torrent and End System Multicast

References: 1. Distributed Systems: Concepts and Design by George Coulouris, Jean Dollimore, Tim Kindberg and Gordon Blair Fifth Edition, published by Addison Wesley, May 2011 2. Distributed systems: principles and paradigms by Andrew S. Tanenbaum, Maarten van Steen 3. Distributed systems : Computing over networks by Joel M Crichlow, PHI

ELECTIVE III & IV

Data Warehousing and Mining

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks) 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.  

References:: 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.. 4. Data Warehousing in the Real World – SAM ANAHORY & DENNIS MURRAY. Pearson Edn Asia. 5. Data Warehousing Fundamentals – PAULRAJ PONNAIAH WILEY STUDENT EDITION 6. The Data Warehouse Life cycle Tool kit – RALPH KIMBALL WILEY STUDENT EDITION 7. Data Mining Introductory and advanced topics –MARGARET H DUNHAM, PEARSON EDUCATION

ELECTIVE III & IV

Wireless Sensor Networks (Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I Introduction: Unique Constraints and Challenges, Advantages of Sensor Networks, Energy advantage, Detection advantage, Sensor Network Applications, Habitat monitoring, Wildlife conservation through autonomous, non-intrusive sensing, Tracking chemical plumes, Ad hoc, just-in-time deployment mitigating disasters, Smart transportation: networked sensors making roads safer and less congested, Collaborative Processing. UNIT II Key Definitions and The Problem: Key Definitions of Sensor Networks, Canonical Problem: Localization and Tracking, Tracking Scenario, Problem Formulation, Sensing model, Collaborative localization, Bayesian state estimation, Distributed Representation and Inference of States, Impact of choice of representation, Design desiderata in distributed tracking, Tracking Multiple Objects, State space decomposition, Data association, Sensor Models, Performance Comparison and Metrics. UNIT III Networking and Protocols: Networking Sensors, Key Assumptions, Medium Access Control, The SMAC Protocol, IEEE 802.15.4 Standard and ZigBee, General Issues, Geographic, Energy-Aware Routing, Unicast Geographic Routing, Routing on a Curve, Energy-Minimizing Broadcast, Energy-Aware Routing to a Region, Attribute-Based Routing, Directed Diffusion, Rumor Routing, Geographic Hash Tables. Infrastructure Establishment, Topology Control, Clustering, Time Synchronization, Clocks and Communication Delays, Interval Methods, Broadcasts, Localization and Localization Services, Ranging Techniques, Range-Based Localization Algorithms, Other Localization Algorithms, Location Services. Sensor Tasking and Control, Task-Driven Sensing, Roles of Sensor Nodes and Utilities, Information- Based Sensor Tasking, Sensor selection, IDSQ: Information-driven sensor querying, Cluster leader based protocol, Sensor tasking in tracking relations, Joint Routing and Information Aggregation, Moving center of aggregation, Multi-step information-directed routing, Sensor group management, Case study: Sensing global phenomena. UNIT IV Databases: Sensor Network Databases, Sensor Database Challenges, Querying The Physical Environment, Query Interfaces, Cougar sensor database and abstract data types, Probabilistic queries, High-level Database Organization, In- Network Aggregation, Query propagation and aggregation, Tiny DB query processing, Query processing scheduling and optimization, Data-Centric Storage, Data Indices and Range Queries, One-dimensional indices, Multidimensional indices for orthogonal range searching, Non-orthogonal range searching, Distributed Hierarchical Aggregation, Multi-resolution, Partitioning, Fractional cascading, Locality preserving hashing, Temporal Data, Data aging, Indexing motion data. UNIT V Platforms and Tools: Sensor Network Platforms and Tools, Sensor Network Hardware, Berkeley motes, Sensor Network Programming Challenges, Node-Level Software Platforms, Operating system: Tiny OS, Imperative language: nesC, Dataflow style language: Tiny GALS, Node-Level Simulators, ns-2 and its sensor network extensions, TOSSIM, Programming Beyond Individual Nodes: State-centric programming, Collaboration groups, PIECES: A state-centric design framework, Multi-target tracking problem revisited. Applications and Future Directions.

References: 1. Feng Zhao, Leonidas Guibas: Wireless Sensor Networks – An Information Processing Approach, Elsevier, 2004.

ELECTIVE III & IV Mobile Computing (One paper 3 Hours, 100 Marks, Test =25 marks ) UNIT I Introduction: Evolution of Wireless networks, Wireless Data, wireless LAN, Wireless PAN, Mobile computing & its functions, Schematic representation of mobile computing. UNIT II Wireless Transmission: Frequencies for radio transmission, Signals, Antennas, Signal propagation, Multiplexing, Modulation, Spread Spectrum, Cellular systems. UNIT III Medium access control: Motivation for specialized MAC, SDMA, FDMA, & TDMA UNIT IV Emerging Technologies: Bluetooth, Radio Frequency identification(RFID), Wireless Broadband (WiMax), Mobile IP, Internet Protocol Version 6(IPv6), Java Card UNIT V Global System For Mobile Communication(GSM): GSM history, cell clusters in GSM, GSM architecture, GSM entities, GSM Radio Subsystem, GSM Channel types, frame Structure for GSM, Signal Processing in GSM, example of GSM call, PLMN interface, GSM addresses and identifiers, Network aspects in GSM, Handover, Mobility management, Authentication and security in GSM. UNIT VI General packet radio Service (GPRS): Introduction, GPRS and packet data network, GPRS Network architecture, GPRS Network Operation, Data service in GPRS, Application for GPRS, limitation of GPRS, billing and charging in GPRS. UNIT VII CDMA and 3G: Introduction, Spread Spectrum technology, Is-95, CDMA versus GSM, Wireless Data, third Generation Networks, Application on 3G. UNIT VIII Wireless LAN: Introduction, wireless LAN advantages, IEEE 802.11 standards, Wireless LAN Architecture, Mobility in Wireless LAN, Deploying Wireless LAN, Mobile Adhoc Networks Network and sensor Network, Wireless LAN security , Niti Vs #3G UNIT IX Internet Networks and Interworking: Introduction, Fundamentals Of call Processing, Intelligence in the Networks, SS#7 signaling, IN Conceptual Model (INCM) , Soft-witch, Programmable Networks, Technologies and interfaces for IN.

UNIT X Mobile Computing Architecture: Architecture: for mobile computing, three tier Architecture, Design Consideration for Mobile computing. UNIT XI Client Programming: Introduction, Moving beyond the desktop, Hardware Overview, Mobile phones, PDA, Design constraints, in application for hand-held devices. UNIT XII Programming for palm OS: Introduction, History of Palm OS, palm OS architecture, Application development, Communication in Palm OS, Multimedia, and enhancements in current release. UNIT XIII Wireless Devices with symbian OS Introduction to Symbian OS, Symbian OS architecture, application for symbian, control and compounds controls, active objects, Localization, Security on the Symbain OS. UNIT XIV Wireless devices with windows CE: Introduction, Different flavors of Windows CE, Windows Ce architecture, Windows Ce development Environment. UNIT XV Wireless Application Protocol(WAP) Introduction, WAP, MMS, GPRS applications. UNIT XVI Special topics in Mobile Computing: Mobile Agent & its application, Mobile data management, security framework for mobile envoirment. References:: 1.ASOKE k Talukder, “Mobile Computing”, TMH New Delhi. 2.Jochen Schitler,”mobile Communication”, Pearson Education, New Delhi. 3.T.S. Rappapost, “Wireless Communication”, Pearson Education, New Delhi. 4.Kareh Pallavan & P. Krisnamurti,”Wireless Networks”, Pearson Education, New Delhi.

ELECTIVE III & IV Neural Networks And Its Applications

(Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I BASIC LEARNING ALGORITHMS Biological Neuron – Artificial Neural Model - Types of activation functions – Architecture: Feedforward and Feedback – Learning Process: Error Correction Learning –Memory Based Learning – Hebbian Learning – Competitive Learning - Boltzman Learning – Supervised and Unsupervised Learning – Learning Tasks: Pattern Space – Weight Space – Pattern Association – Pattern Recognition – Function Approximation – Control – Filtering - Beamforming – Memory – Adaptation - Statistical Learning Theory – Single Layer Perceptron – Perceptron Learning Algorithm – Perceptron Convergence Theorem – Least Mean Square Learning Algorithm – Multilayer Perceptron – Back Propagation Algorithm – XOR problem – Limitations of Back Propagation Algorithm.

UNIT II RADIAL-BASIS FUNCTION NETWORKS AND SUPPORT VECTOR MACHINES RADIAL BASIS FUNCTION NETWORKS Cover’s Theorem on the Separability of Patterns - Exact Interpolator – Regularization Theory – Generalized Radial Basis Function Networks - Learning in Radial Basis Function Networks - Applications: XOR Problem – Image Classification. Support Vector Machines: Optimal Hyper-plane for Linearly Separable Patterns and Nonseparable Patterns – Support Vector Machine for Pattern Recognition – XOR Problem - �-insensitive Loss Function – Support Vector Machines for Nonlinear Regression

UNIT III COMMITTEE MACHINES Ensemble Averaging - Boosting – Associative Gaussian Mixture Model – Hierarchical Mixture of Experts Model(HME) – Model Selection using a Standard Decision Tree – A Priori and Postpriori Probabilities – Maximum Likelihood Estimation – Learning Strategies for the HME Model - EM Algorithm – Applications of EM Algorithm to HME Model NEURODYNAMICS SYSTEMS Dynamical Systems – Attractors and Stability – Non-linear Dynamical Systems- Lyapunov Stability – Neurodynamical Systems – The Cohen-Grossberg Theorem. UNIT IV ATTRACTOR NEURAL NETWORKS Associative Learning – Attractor Neural Network Associative Memory – Linear Associative Memory – Hopfield Network – Content Addressable Memory – Strange Attractors and Chaos - Error Performance of Hopfield Networks - Applications of Hopfield Networks – Simulated Annealing – Boltzmann Machine – Bidirectional Associative Memory – BAM Stability Analysis – Error Correction in BAMs – Memory Annihilation of Structured Maps in BAMS – Continuous BAMs – Adaptive BAMs – Applications

ADAPTIVE RESONANCE THEORY Noise-Saturation Dilemma - Solving Noise-Saturation Dilemma – Recurrent On-center – Off-surround Networks – Building Blocks of Adaptive Resonance – Substrate of Resonance Structural Details of Resonance Model – Adaptive Resonance Theory – Applications

UNIT V SELF ORGANISING MAPS Self-organizing Map – Maximal Eigenvector Filtering – Sanger’s Rule – Generalized Learning Law – Competitive Learning - Vector Quantization – Mexican Hat Networks - Self-organizing Feature Maps – Applications Spiking Neuron Model – Integrate-and-Fire Neurons – Conductance Based Models – Computing with Spiking Neurons.

References:: Satish Kumar, “Neural Networks: A Classroom Approach”, Tata McGraw- Hill Publishing Company Limited, New Delhi, 2004. Simon Haykin, “Neural Networks: A Comprehensive Foundation”, 2ed., Addison Wesley Longman (Singapore) Private Limited, Delhi, 2001. Martin T.Hagan, Howard B. Demuth, and Mark Beale, “Neural Network Design”, Thomson Learning, New Delhi, 2003. James A. Freeman and David M. Skapura, “Neural Networks Algorithms, Applications, and Programming Techniques, Pearson Education (Singapore) PrivateLimited, Delhi, 2003.

ELECTIVE III & IV

Network Design, Modeling and Analysis (Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I Essentials of Probability: Probability on a Sample Space, Basic Operations on Events, Probability on Events, Other Properties, Conditional Probability, Bayes Formula ,Independence, Random Variables, Random Variable as a Measurement, Probability Mass Function for a Random Variable, Cumulative Distribution Function, PMF and CDF for the 3 Coin Toss Example, Expectation of a Random Variable, Important Random Variables, Bernoulli Random Variable, Binomial Random Variable, Geometric Random Variable, Poisson Random Variable, Continuous-valued Random Variables, Properties of Continuous Random Variables, Expectation of a Continuous Random Variable, Important Continuous Random Variable: Exponential, Memory less Property of the Exponential

UNIT II Delay Models in Data Networks: Multiplexing of Traffic on a Communication Link, Queuing Models- Little’s Theorem, Little’s Theorem, Probabilistic Form of Little’s Theorem, Application of Little’s Theorem, The M/M/1 Queuing System, Arrival Statistics, Service Statistics, Markov Chain Formulation, Deviation of the Stationary Distribution, Occupancy Distribution upon Arrival, Occupancy Distribution upon Departure, The M/M/m, M/M/�, M/M/m/m, AND Other Markov Systems, The M/M/m: The m-Server Case, M/M/�: The Infinite-Server Case, M/M/m/m: The m-Server Loss System, ltidimensional Markov Chains- Applications in Circuit Switching, The M/G/1 System, M/G/1 Queues with Vacations, Reservations and Polling, Priority Queuing. UNIT III Inside an IMP Queuing in the Network Layer at an IMP, Basic Single Queue Model, Applications of Queuing Analysis Outside of Networking, The Poisson Arrival Model, Properties of a Poisson Process, Inter-arrival Times of a Poisson Process, The M/M/1 Queue, Aside: Queuing Notation, Aside: The D/D/1 Queue, State Analysis of an M/M/1 Queue, Balance Equations , Solving the Balance Equations, The Finite Buffer Case: M/M/1/N, Blocking Probability and the Right Size Buffer, Throughput in the Finite Buffer Case, Alternate way to compute throughput of M/M/1/N: Look at the output side, Aside: Derivation of = Using Throughput, Approximation of a Finite Buffer System by the Infinite Buffer Model, How Long is That Line?, Little's Formula and Queuing Delay, Applying Little's Formula to an M/M/1 Queue, Applying the M/M/1 Results to a Single Network Link, Other Queuing Models UNIT IV Network Design Problem definition : Multipoint line layout heuristics, CMST algorithm, ESAUWilliam’s algorithm, Sharma’s algorithm, Unified algorithm, Bin packing, Terminal assignments, Concentrator location

UNIT V Network Analysis Queuing Networks, Closed Queuing Network Example, Nodes in a Packet Switched Network (PSN), Queuing Network Model of Nodes in a PSN, Queuing Network Analysis of a PSN, performance analysis of Data Link Layer, Network layer, QoS. UNIT VI Network Administration Functions and responsibilities, Network planning and implementation, Sub-netting, Bandwidth management, security issues, Tools for BW and security management, modifying network implementation References : 1. Kershenbaum A., “Telecommunication Network Design Algorithms”, Tata McGraw Hill 2. Keshav S., “An Engineering Approach to Computer Networking,” Addison- Wesley,1997. 3. Bertsekas D. and Gallager R., “Data Networks,” 2nd Ed., Prentice-Hall, Englewood Cliffs, N.J., 1992. 4. Vijay Ahuja, “Design and Analysis of Computer Communication Networks”, McGraw Hill 5. Stallings W., “High Speed Networks and Internet : Performance and Quality of Service”, Prentice- Hall 6. Zacker, “Networking – The Complete Reference”, Tata McGraw Hill

ELECTIVE III & IV

Image Analysis and Computer Vision (Lectures: 3 Hrs/week Theory: 100 Marks, Test: 25 Marks)

UNIT I Introduction: Digital Image presentation, Fundamental steps in Image Processing, elements of DIP System, Specifications and working of Image digitizers, applications of DIP. UNIT II Digital Image Fundamentals: Image sensing and acquisition, Image Sampling and quantization, Data structures for Image analysis. UNIT III Image Transforms: 2D-DFT,FFT, walsh transform, Hadamard transform, DCT, Haar Transform, Hotelling transform, Discrete Wavelet transform UNIT IV Image Pre- Processing: Image enhancement in the spatial domain, Image enhancement in the frequency domain. Fourier transform and wavelet, Feature Extraction & analysis, Image Restoration. UNIT V Image segmentation: Detection of discontinuities, Edge Linking and Boundary Detection, thresholding, Region Based Segmentation. UNIT VI Morphological Image processing: Dilation and erosion, Opening and Closing, the Hit or Miss transformation, basic morphological algorithms. UNIT VII Introduction to Computer Vision: Achieving Simple Vision Goals, High Level & low level capabilities, a range of representations, The role of computers, computer vision research and applications UNIT VIII Image Representation and Description: Representation, Boundary Descriptions, regional Descriptors use of PCE Relational Descriptors. UNIT IX Object Recognition: Patterns and pattern classes, Recognition based on Decision Theoretic Methods, structural Methods.

References: 1.R.C. Gonzalez, R.E. Woods, “Digital Image Processing” 2nd Edition Pearson Education(LPE)-2002 2.M.Sonka, v,Hlavac, R. Boyle,”Image Processing Analysis & Machine Vision ” 2nd Edition-ITP Company-1998. 3.Scoot Umbaugh,”Computer Vision & Image Processing- a Practical approach Using CVIP tools” S & S Company-1998 4.R.C. Gonzalez, R.E. Woods, “Digital Image Processing Using Matlab” 1st Indian Reprint -Pearson Education(LPE)-2004 5.D.Ballard & C. Brown,”Computer Vision”, Prentice-Hall-1982.