JAWAHARLAL NEHRU TECHNOLOGICAL UNIVERSITY HYDERABAD

Pre-Requisites

UG level course in Algorithm Design and Analysis

Course Objectives:

• Introduce students to the advanced methods of designing and analyzing algorithms.
• The student should be able to choose appropriate algorithms and use it for a specific problem.
• To familiarize students with basic paradigms and data structures used to solve advanced algorithmic problems.
• Students should be able to understand different classes of problems concerning their computation difficulties.
• To introduce the students to recent developments in the area of algorithmic design.

Course Outcomes

After completion of course, students would be able to:

• Analyze the complexity/performance of different algorithms.
• Determine the appropriate data structure for solving a particular set of problems.
• Categorize the different problems in various classes according to their complexity.
• Students should have an insight of recent activities in the field of the advanced data structure.

UNIT - I

Sorting: Review of various sorting algorithms, topological sorting Graph: Definitions and Elementary Algorithms: Shortest path by BFS, shortest path in edge-weighted case (Dijkasra's), depth-first search and computation of strongly connected components, emphasis on correctness proof of the algorithm and time/space analysis, example of amortized analysis.

UNIT - II

Matroids: Introduction to greedy paradigm, algorithm to compute a maximum weight maximal independent set. Application to MST. Graph Matching: Algorithm to compute maximum matching. Characterization of maximum matching by augmenting paths, Edmond's Blossom algorithm to compute augmenting path.

UNIT - III

Flow-Networks: Maxflow-mincut theorem, Ford-Fulkerson Method to compute maximum flow, Edmond-Karp maximum-flow algorithm. Matrix Computations: Strassen's algorithm and introduction to divide and conquer paradigm, inverse of a triangular matrix, relation between the time complexities of basic matrix operations, LUP-decomposition.

UNIT - IV

Shortest Path in Graphs: Floyd-Warshall algorithm and introduction to dynamic programming paradigm. More examples of dynamic programming.

R19 M. TECH. CN/CNIS/CYBER SECURITY

Modulo Representation of integers/polynomials: Chinese Remainder Theorem, Conversion between base-representation and modulo-representation. Extension to polynomials. Application: Interpolation problem. Discrete Fourier Transform (DFT): In complex field, DFT in modulo ring. Fast Fourier Transform algorithm. Schonhage-Strassen Integer Multiplication algorithm.

UNIT - V

Linear Programming: Geometry of the feasibility region and Simplex algorithm NP-completeness: Examples, proof of NP-hardness and NP-completeness. One or more of the following topics based on time and interest: Approximation algorithms, Randomized Algorithms, Interior Point Method, Advanced Number Theoretic Algorithm Recent Trends in problem solving paradigms using recent searching and sorting techniques by applying recently proposed data structures.

References:

• 1. "Introduction to Algorithms" by Cormen, Leiserson, Rivest, Stein.
• 2. "The Design and Analysis of Computer Algorithms" by Aho, Hopcroft, Ullman.
• 3. "Algorithm Design" by Kleinberg and Tardos. R19 M. TECH. CN/CNIS/CYBER SECURITY M. Tech. (CNIS/CN/Cyber Security) – I Year – II Semester Common to CNIS, CN and Cyber Security WEB AND DATABASE SECURITY (PC – IV)

Pre-Requisites

Database Management

Course Objectives:

• 1. Give an Overview of information security
• 2. Give an overview of Access control of relational databases

Course Outcomes

Students should be able to

• 1. Understand the Web architecture and applications
• 2. Understand client side and service side programming
• 3. Understand how common mistakes can be bypassed and exploit the application
• 4. Identify common application vulnerabilities

UNIT - I

The Web Security The Web Security Problem, Risk Analysis and Best Practices Cryptography and the Web: Cryptography and Web Security, Working Cryptographic Systems and Protocols, Legal Restrictions on Cryptography, Digital Identification

UNIT - II

The Web Privacy The Web’s War on Your Privacy, Privacy-Protecting Techniques, Backups and Antitheft, Web Server Security, Physical Security for Servers, Host Security for Servers, Securing Web Applications

UNIT - III

Database Security Recent Advances in Access Control, Access Control Models for XML, Database Issues in Trust Management and Trust Negotiation, Security in Data Warehouses and OLAP Systems

UNIT - IV

Security Re-engineering for Databases Concepts and Techniques, Database Watermarking for Copyright Protection, Trustworthy Records Retention, Damage Quarantine and Recovery in Data Processing Systems, Hippocratic Databases: Current Capabilities and

UNIT - V

Future Trends Privacy in Database Publishing A Bayesian Perspective, Privacy-enhanced Location-based Access Control, Efficiently Enforcing the Security and Privacy Policies in a Mobile Environment

Text Books:

• 1. Web Security, Privacy and Commerce, Simson G. Arfinkel, Gene Spafford, O’ Reilly.
• 2. Handbook on Database security applications and trends, Michael Gertz, Sushil Jajodia. R19 M. TECH. CN/CNIS/CYBER SECURITY M. Tech. (CNIS/CN/Cyber Security) – I Year – II Semester Common to CNIS, CN and Cyber Security