M. Tech Information and Cyber Security- CBCS

Subject S. No CBCS R-16 L T P C Code Foundation Course 1. 2160MA103 Probability and Statistics FC 3 2 0 4 Program Core 2161IT108 Computer Oriented Optimization 2. PC 4 0 0 4 Techniques 3. 2161IT109 Modern Number Theory PC 4 0 0 4 4. 2161IT110 Foundations of Modern Networking PC 4 0 0 4 2161IT111 Hacking Techniques and Incidents 5. PC 4 0 0 4 Response 6. 2161IT112 Cloud Computing PC 4 0 0 4 7. 2161IT113 Modern PC 4 0 0 4 8. 2161IT114 Principles of Information Security PC 3 0 0 3 9. 2161IT115 Cyber Security Principles PC 3 0 0 3 Total Credits 30 Specific Elective 10. 2162IT121 Principles of Cyber Physical Systems PE 3 0 0 3 11. 2162IT122 Intrusion Detection Systems PE 3 0 0 3 12. 2162IT123 Cyber Crimes and Laws PE 3 0 0 3 13. 2162IT124 Cyber Forensics PE 3 0 0 3 2162IT125 Bitcoin and 14. PE 3 0 0 3 Technologies Performance Evaluation of Computer 15. 2162IT126 PE 3 0 0 3 Systems 16. 2162IT127 Bio-Informatics PE 3 0 0 3 Independent Learning

17. 2163MG401 Research Methodology Independent Learning 2 18. 2163IT402 ICT Tools Independent Learning 2 19. 2163IT501 Research Seminar Independent Learning 20. 2163IT502 Field Study 2 (Anyone) 21. 2163IT801 Internship 22. 2163GE401 Business Communication Independent Learning 2 Project Work 23. 2164IT601 Project Phase 1 Project Work 10 24. 2164IT701 Project Phase 2 Project Work 16 L – Lecture; T – Tutorial; P – Practical; C – Credit

COURSE CODE COURSE TITLE L T P C 2160MA102 PROBABILITY AND STATISTICS 3 2 0 4 Course Category: Foundation Course A. Preamble : To provide an in-depth knowledge about probability, sampling, Correlation and Random process

B. Course Outcomes :

Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Understanding basic concepts of probability K2 CO2 Applying basic concepts of different types of sampling K3 Applying basic concepts of Hypothesis testing and Chi-square CO3 K3 testing to solve simple problems CO4 Applying basic concepts of Correlation K3 Applying basic concepts of Random process to solve simple CO5 K3 problems C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H H CO3 H H M L CO4 H L M M CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content : UNIT I (9) Axioms of probability - Conditional probability - Total probability - Baye’s theorem - Random variable - Probability mass function - Probability density function – Properties – Moments - Moment generating function and their properties - Binomial, Poisson, Geometric, Negative binomial, Uniform, Exponential, Gamma and Weibull distribution and their properties. UNIT II (9) Sampling: different types of sampling – Sampling distribution – Sampling distribution of Mean Point Estimation of parameters: general concepts of Estimation – Unbiased estimators – Variance of a point Estimator – Standard error – Method of point estimation (method of moments – method of maximum likelihood) – Statistical intervals for a single sample: confidence interval on the mean of a normal distribution with variance known – Confidence interval on the mean of a normal distribution with variance unknown – Confidence interval on the variance and standard deviation of a normal distribution.

UNIT III- TESTING OF HYPOTHESIS (9) Hypothesis testing: one sample and two sample tests for means and properties of large samples (z-test), one sample and two sample tests for means of small samples (t-test), F-test for two sample standard deviations – Chi-square test for single sample standard deviation – Chi-square tests for independence of attributes and goodness of fit.

UNIT IV CORRELATION AND REGRESSION (9) Correlation – Scatter diagram – Karlpearson coefficient of correlation – calculation of the correlation coefficient for a bivariant frequency distribution – rank correlation – repeated rank – Regression – lines of regression – regression curves – regression coefficients – multiple and partial correlation – coefficient of partial correlation – generalization – multiple correlation.

UNIT V RANDOM PROCESSES (9) Classification – Stationary process – Markov Process – Poisson process – Discrete parameter – Markov chain – Chapman Kolmogorov equations – Limiting distributions.

Total: 45 +15(Tutorial) = 60 Periods Text Books: 1. Richard A. Johnson and C. B. Gupta, Probability and Statistics for Engineers, (7th Edn.), Pearson Education, Indian Impression – 2006

COURSE CODE COURSE TITLE L T P C COMPUTER-ORIENTED OPTIMIZATION 2161IT108 4 0 0 4 TECHNIQUES Course Category: Program Core

A. Preamble : Optimization Techniques is one of the most advanced fields of computer science which involves use of Mathematics, Statistics, Management, Information Technology and Information Sciences in discovering new information and knowledge from large databases and optimize Human effort overall in Decision making process.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) Optimization problems defining, understanding and K2 CO1 classification. Formulating Linear Programming problem and similar such K3 CO2 problems into appropriate forms and problem solving. CO3 Working with Non Linear Programming problems K3 CO4 More on Non Linear Programming problems and Game Theory. K3 CO5 Queueing Theory a overview and problem solving. K3

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H H CO3 H H M L CO4 H L M M CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content : UNIT I (9) Statement of Optimization Problem, Classification of Optimization Problems, Classical Optimization Techniques- Single Variable Optimization, Multivariable Optimization with no Constraints, with Equality Constraints, and Inequality Constraints, Convex Programming Problem.

UNIT II (9) Formulation of Linear Programming, Integer Programming, 0-1 Programming and Mixed Integer Programming Problems. Solving by Computer using Graphical Method, Simplex Method, Revised Simplex Method, Transportaion Algorithm ,Karmarkar’s Method and Hungarian Method.

UNIT III (9) Fundamental(2/2) - Congruence Theory , Primitive Roots and Elliptic Curve Formulation of One Dimesional Nonlinear Programming Problems related to Computer Science and Engineering; Solving by Computer Using Fibonacci Elimination Method, Quadratic Interpolation Method, and Newton Method.Formulation of Nonlinear Unconstrained Optimization Problems related to Computer Science and Engineering; Solving by Computer Using Hook-Jeeves Method and Steepest Decent (Cauchy) Methods

UNIT IV PRIMALITY TESTING AND INTEGER FACTORIZATION (9) Formulation of Nonlinear Constrained Optimization, Geometric Programming, Quadratic Programming, Dynamic Programming and Stochastic Programming Problems related to Computer Science and Engineering. Game Theory – Two-person Zero-sum Game and Mixed Stategy Games; Applications of Game Theory in Computer Science and Engineering

UNIT V DISCRETE LOGARITHMS (9) Basic Structure of Queueing Models, The Birth-and-Death Process, Queueing Models based on Birth- and-Death Process, Queueing Models Involing Non-exponetiual Distributiuons, A Priority-Discipline Queueing Models, Queueing Networks and Queueing Decision Models. Applications of Queueing Models in Computer Science and Engineering. Total: 45 Periods Text Books: 1. Singiresu S Rao, Engineering Optimization : Theory and Practice Third Enlarged Edition, New Age International Publishers, 2003 2. Hamdy A Taha, Operations Research- An Introduction, Ninth Edition, Pearson, 2013 3. Frederick S. Hillier and Gerald J. Lieberman, Introduction to Operations Research, Sevetrh Edition, 2002

References: 1. Articles published in reputed journals / transactions related to Computer Science and Engineering

COURSE CODE COURSE TITLE L T P C 2161IT109 MODERN NUMBER THEORY 4 0 0 4 Course Category: Program Core

A. Preamble : To provide an in-depth knowledge about number theory, computation theory and computational number theory in modern cryptography

B. Course Outcomes :

Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) Understanding basic concepts of number theory, computation CO1 K2 theory and computational number theory in modern cryptography Applying basic concepts of elementary number theory to solve CO2 K3 simple problems Applying basic concepts of congruence theory, primitive roots CO3 K3 and elliptic curves to solve simple problems. Applying basic concepts of primality testing to solve simple CO4 K3 problems Applying basic concepts of integer factorization to solve simple CO5 K3 problems Applying basic concepts of discrete logarithms to solve simple CO6 K3 problems

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 H M L L CO4 H M M L CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content :

UNIT I INTRODUCTION TO CRYPTOGRAPHY (9) Introduction - Number Theory, Computation Theory, Computational Number Theory and Modern Cryptography. Secret- Cryptography - Cryptography and , Classic Secret-Key and Modern Secret-Key Cryptography.

UNIT II FUNDAMENTALS OF NUMBER THEORY (9) Fundamental(1/2) - Basic Algebraic Structures, Divisibility Theory and Arithmetic Functions.

UNIT III CONGRUENCE THEORM (9) Fundamental(2/2) - Congruence Theory , Primitive Roots and Elliptic Curves

UNIT IV PRIMALITY TESTING AND INTEGER FACTORIZATION (9) Primality Testing – Basic Tests, Miller-Rabin Test, Elliptic Curve Test and AKS Test Integer Factorization(1/2) - Basic Concepts, Trial Division Factoring, ρ and ρ − 1 Methods and Elliptic Curve Method

UNIT V DISCRETE LOGARITHMS (9) Integer Factorization(2/2) - Continued Fraction Method, Quadratic Sieve and Number Field Sieve- Discrete Logarithms – Basic Concepts, Baby-Step Giant-Step Method, Pohlig-Hellman Method, Index Calculus and Elliptic Curve Discrete Logarithms Total: 45 Periods Text Books: 1. Song Y. Yan, “Computational Number Theory and Modern Cryptography”, John Wiley (ISBN 978-1-118-18858-3), 2013. Reference: 1. David M. Burton, “Elementary Number Theory”, Seventh Indian Edition (Indian , McGraw Hill Education), 2012. 2. K.Rosan, “Elementary Number Theory and its Application”, Fifth Edition, Addison- Wesley,2005. 3. Marlow Anderson, Todd Feil, "A First Course in Abstract Algebra Rings, Groups, and Fields”, Third edition, CRC Press, 2015.

Online resources 1. http://people.reed.edu/~jerry/361/lectures/mats.html 2. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.705.8387&rep=rep1&type=pdf 3. http://nptel.ac.in/courses/111103020/ 4. https://ocw.mit.edu/courses/mathematics/18-785-number-theory-i-fall-2016/syllabus/ 5. http://archives.math.utk.edu/topics/numberTheory.html

COURSE CODE COURSE TITLE L T P C 2161IT110 FOUNDATIONS OF MODERN NETWORKING 4 0 0 4

Course Category: Program Core

A. Preamble : To provide an in-depth knowledge about modern networking

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Ability to understand the basics of modern networking K2 Able to familiarize with the concepts of software defined CO2 K2 networks CO3 Able to explore network function virtualization in detail K2 CO4 Able to analyze QoS and QoE of modern networking K2 CO5 Will gain adequate knowledge in Modern network architecture K2

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 M M L L CO4 M L M M L CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content : UNIT–I Modern Networking (9) Elements of Modern Networking - The Networking Ecosystem - Example Network Architectures - Ethernet - Wi-Fi - 4G/5G Cellular - Cloud Computing - Internet of Things - Network Convergence - Unified Communications - Requirements and Technology - Types of Network and Internet Traffic - Demand: Big Data, Cloud Computing, and Mobile Traffic - Requirements: QoS and QoE - Routing - Congestion Control - SDN and NFV - Modern Networking Elements

UNIT–II Software Defined Networks (9) SDN: Background and Motivation - Evolving Network Requirements - The SDN Approach - SDN and NFV-Related Standards - SDN Data Plane and OpenFlow - SDN Data Plane - OpenFlow Logical Network Device - OpenFlow Protocol - SDN Control Plane Architecture - ITU-T Model - OpenDaylight - REST - Cooperation and Coordination Among Controllers - SDN Application Plane Architecture - Network Services Abstraction Layer - Traffic Engineering - Measurement and Monitoring - Security - Data Center Networking - Mobility and Wireless - Information-Centric Networking

UNIT–III Virtualization (9) Network Functions Virtualization: Concepts and Architecture - Background and Motivation for NFV - Virtual Machines - NFV Concepts - NFV Benefits and Requirements - NFV Reference Architecture - NFV Functionality - NFV Infrastructure - Virtualized Network Functions - NFV Management and Orchestration - NFV Use Cases - SDN and NFV - Network Virtualization - Virtual LANs - OpenFlow VLAN Support - Virtual Private Networks - Network Virtualization - OpenDaylight’s Virtual Tenant Network - Software-Defined Infrastructure

UNIT–IV Defining and Supporting User Needs (9) Quality of Service - QoS Architectural Framework - Integrated Services Architecture - Differentiated Services - Service Level Agreements - IP Performance Metrics - OpenFlow QoS Support - QoE: User Quality of Experience - Service Failures Due to Inadequate QoE Considerations - QoE-Related Standardization Projects - Definition of Quality of Experience - QoE Strategies in Practice - Factors Influencing QoE - Measurements of QoE - Applications of QoE - Classification of QoE/QoS Mapping Models - IP-Oriented Parameter-Based QoS/QoE Mapping Models - Actionable QoE over IP-Based Networks - QoE Versus QoS Service Monitoring - QoE-Based Network and Service Management

UNIT–V Modern Network Architecture-Clouds and Fog (9) Cloud Computing - Basic Concepts - Cloud Services - Cloud Deployment Models - Cloud Architecture - SDN and NFV - The Internet of Things: Components - The IoT Era Begins - The Scope of the Internet of Things - Components of IoT-Enabled Things - IoT Architecture - IoT Implementation TOTAL: 45 periods Text Books : 1. William Stallings, “Foundations of Modern Networking - SDN, NFV, QoE, IoT, and Cloud”, Pearson, 2016.

COURSE CODE COURSE TITLE L T P C HACKING TECHNIQUES AND INCIDENTS 2161IT111 3 0 2 4 RESPONSE

Course Category: Program Core

A. Preamble : To provide an in-depth knowledge about Hacking Techniques and incident response. B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) Explain cryptography and networking concepts associated with CO1 K2 security. CO2 Discuss the tools for Scanning and Enumeration. K3 CO3 Illustrate the attacks on Wireless, Web and Database systems. K3 Classify and describe the various malwares with detection CO4 K2 mechanism. Analyze the cyber-attack incident and infer defensive CO5 K2 technologies.

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 M L L CO4 M L M M L CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content :

Unit 1: Introduction (9) Profiles of hackers, crackers and cybercriminals – History of computer hacking – ethical hacking and penetration testing – Exploring the OSI reference model – TCP/IP – Cryptographic basics – Symmetric and Asymmetric – Purpose of Public Key Encryption – Hashing – Cryptanalysis – Basic Equipment controls – Physical Area controls – Facility, Personal safety and physical access controls.

Unit 2: Technical Overview of Hacking (9) Information gathering process – Discovering financial information – Exploring domain information leakage – Tracking an organization’s employee – Port scanning – OS fingerprinting – Windows basics – enumeration – system hacking – password cracking.

Unit 3: Wireless Vulnerabilities, Web and database attacks (9) Importance of Wireless security – Working with Bluetooth and WLAN – Threats to WLANs – Protecting Wireless Networks – Attacking web servers – Examining an SQL injection – Vandalizing Web Servers – Database vulnerabilities.

Unit 4: Threats & Malwares (9) Malware – Functions of Virus and Worm – Spyware – Adware – Scareware – Trojans – Detection of Virus and Trojans –Sniffers – Session Hijacking – DDoS.

Unit 5: Incident Response and Defensive Technologies (9) Automated Assessment Tools – Incident Response Planning for disaster and recovery - Evidence Handling – Requirements of Regulated Industries – Intrusion Detection Systems – Purpose of Firewalls – Honeypots – Role of controls. Total: 45 Periods

Textbooks: 1. Hacker Techniques, Tools and Incident Handling, Sean Philip Oriyano and Michael Gregg. 2. “Ethical Hacking and Countermeasures (Book 1)”, EC-Council, Publisher: Course Technology; 2nd edition – 2016. Reference Books: 1. “Hands-On Ethical Hacking and Network Defense” by James Corley (Author), Kent Backman (Author) – 17 Apr 2012, Cengage Learning. 2. CEH v9: Certified Ethical Hacker - Version 9 Study Guide by Sean-Philip Oriyano, Publisher: Wiley (28 June 2016).

COURSE CODE COURSE TITLE L T P C 2161IT112 CLOUD COMPUTING 3 0 2 4 Course Category: Program Core

A. Preamble : The main purpose of CLOUD COMPUTING is to present a basic architecture and service models with programming models for cloud applications

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Understanding the Basics of Cloud Computing K2 CO2 To Analyze the Cloud Models and Environments K3 CO3 To Understand the Virtualized cloud Data Centers K3 CO4 To Understand the Basics of Grid ,P2P, and IoT K2 CO5 To Understand the basics of Cloud Securities. K2

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 M L L CO4 M L M M L CO5 H L H H M H- High; M-Medium; L-Low

D. Course Content : UNIT 1 CLOUD COMPUTING FUNDAMENTALS AND ARCHITECTURE (9) Fundamentals of cloud- Essential Characteristics-Architectural Influence-Technological Influences- Operational Influences- Cloud delivery Models.

UNIT II DISTRIBUTED SYSTEMS MODELS AND PARALLEL COMPUTING (9) Scalable computing over the Internet-Technology for Network Based Systems- System models for distributed and cloud computing-Software Environments for Distributed and Clouds. Clustering for massive parallelism-Computer clusters and MPP Architecture-Design principles of computer clusters- Cluster job and Resources Management.

UNIT III COMPUTING CLOUDS, SERVICE ORIENTED ARCHITECTURE AND PROGRAMMING (9) Cloud Platform Architecture over Virtualized Data Centers-Service Oriented Architectures for Distributed Computing- Cloud Programming and Software Environments.

UNIT IV GRID, P2P, AND THE FUTURE INTERNET (9) Grid Computing Systems and Resource Management- Peer to Peer Computing and Overlay Networks- Ubiquitous cloud and Internet of things.

UNIT V CLOUD SECURITY FUNDAMENTALS AND RISK ISSUES (9) Cloud Information Security Objectives- Cloud Security Services- Cloud security Design Principles- Secure Cloud Software Requirements-The CIA Triad- Privacy and Compliance Risks.

TOTAL: 45 periods

Text Books 1. Kai Hwang.Geofferey C.Fox. Jack J.Dongarra “Distributed and Cloud Computing from Parallel Processing to the Internet of Things”, Elsevier Morgan Kauffman Publishers,2012. 2. Ronald L.Krutz and Russell Dean Vines,” Cloud Security-A Comprehensive guide to secure cloud computing”,Wiley Publications Inc. References 1. Michael J. Kavis ,”Architecting the Cloud: Design Decisions for Cloud Computing Service Models”, Wiley Publications Inc, 2014.

2. Rajkumar Buyya, S.Thamarai Selvi and Christian Vecchiola, “Mastering Cloud Computing: Foundations and Applications Programming”, Tata McGraw Hill Education Private Limited.

3. Rajkumar Buyya, James Broberg, Andrzej M. Goscinski “Cloud Computing: Principles and Paradigms”,Wiley Publications,2010.

4. Tim Mather, Subra Kumaraswamy, Shahed Latif, “Cloud Security and Privacy an Enterprise Perspective on Risks and Compliance” O'Reilly Media, 2009.

COURSE CODE COURSE TITLE L T P C 2161IT113 MODERN CRYPTOGRAPHY 4 0 0 4 Course Category: Program Core

A. Preamble : This course describes the explosive growth in computer systems and their interconnections via networks, has increased the dependence of both organizations and individuals on the information stored and communicated using these systems. This, in turn, has led to a heightened awareness of the need to protect data and resources from disclosure, to guarantee the authenticity of data and messages, and to protect systems from network-based attacks and the disciplines of cryptography and network security have matured, leading to the development of practical, readily available applications to enforce network security.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Demonstrate various classical cryptographic techniques. K3 CO2 Implement the private-key cryptographic methods. K3 CO3 Demonstrate block ciphers and public-key cryptography. K3 CO4 Implement private-key management and public-key encryption. K2 Implement Digital signatures and public-key in random oracle K3 CO5 model.

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 L L M M L CO5 L M H M H- High; M-Medium; L-Low

D. Course Content :

UNIT-1: INTRODUCTION AND CLASSICAL CRYPTOGRAPHY (9) Introduction and Classical Ciphers: Cryptography and modern cryptography, setting of private-key encryption, Historical ciphers and cryptanalysis, Basic principles of modern cryptography. Perfectly- Secret Encryption: Definitions and basic properties,One time pad,Limitations of perfect secrecy, Shannon’s theorem.

UNIT-2: PRIVATE-KEY (SYMMETRIC) CRYPTOGRAPHY (9) Private-key encryption and Pseudorandomness: Computational approach to cryptography, Definition of computationally-secure encryption, Pseudorandomness, Constructing secure encryption schemes, Security under chosen plaintext attacks(CPA), Security against chosen attacks (CCA). Message Authentication Codes and Collision-resistant hash functions: Secure communication and message integrity, Encryption and Message authentication, Message authentication codes, Constructing secure MAC’s, CBC-MAC, NMAC & HMAC, Achieving chosen-ciphertext secure encryption, Obtaining privacy and message authentication.

UNIT-3: BLOCK CIPHERS & PUBLIC-KEY(ASYMMETRIC) CRYPTOGRAPHY (9) Block Ciphers: Substitution-Permutation Networks, Feistel Networks, DES, Increasing the for block ciphers, AES, Stream ciphers from block ciphers. Number Theory and Cryptographic hardness assumptions: Preliminaries and basic group theory, Primes and RSA, Assumptions in cyclic groups, Applications of Number-Theoretic assumptions in cryptography.

UNIT-4: PRIVATE –KEY MANAGEMENT &PUBLIC-KEY ENCRYPTION (9) Private-key Management and Public-key revolution: Limitations of Private-key Cryptography, Public- key revolution, Diffie-Hellman . Public-key Encryption: Overview of public-key encryption, Hybrid encryption, RSA encryption, El Gamal encryption scheme, Trapdoor permutations.

UNIT-5: DIGITAL SIGNATURES &PUBLIC-KEY CRYPTING IN RANDOM ORACLE MODEL (9) Schemes: Digital Signatures, RSA Signatures, Hash-and-Sign Paradigm, Lamport’s One-Time Signature, Signatures from Collision-Resistant Hashing, Certificates and Public-key Infrastructures. Public-key : Random Oracle methodology, Public-key encryption in Random Oracle model, RSA signatures in Random Oracle model.

TOTAL : 45 PERIODS

Text Books: 1. W. Mao, “Modern Cryptography – Theory and Practice”, Pearson Education, Second Edition, 2007. 2. Jonathan Katz and Yehuda Lindell.CRC PRESS ,Boca Raton London New York Washington, D.C.. Reference Books: 1. Charles P. Pfleeger, Shari Lawrence Pfleeger – Security in computing Third Edition – Prentice Hall of India, 2006.

COURSE CODE COURSE TITLE L T P C 2161IT114 PRINCIPLES OF INFORMATION SECURITY 3 0 0 3 Course Category: Program Core

A. Preamble : This course describes the concepts of network security.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Understand the core fundamentals of system security K2 Apply the security concepts related to networks in wired and CO2 K2 wireless scenario CO3 Implement and Manage the security essentials in IT Sector K3 Able to explain the concepts of Cyber Security and encryption CO4 K2 Concepts Able to attain a thorough knowledge in the area of Privacy and CO5 K2 Storage security and related Issues

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 L L M H CO5 L M H M H- High; M-Medium; L-Low

D. Course Content :

UNIT I SYSTEM SECURITY (9) Building a secure organization- A Cryptography primer- detecting system Intrusion- Preventing system Intrusion- Fault tolerance and Resilience in cloud computing environments- Security web applications, services and servers.

UNIT II NETWORK SECURITY (9) Internet Security - Botnet Problem- Intranet security- Local Area Network Security - Wireless Network Security - Wireless Sensor Network Security- Cellular Network Security- Optical Network Security- Optical wireless Security.

UNIT III SECURITY MANEGEMENT (9) Information security essentials for IT Managers- Security Management System - Policy Driven System Management- IT Security - Online Identity and User Management System - Intrusion and Detection and Prevention System.

UNIT IV CYBER SECURITY AND CRYPTOGRAPHY (9) Cyber Forensics- Cyber Forensics and Incidence Response - Security e-Discovery - Network Forensics - Data Encryption- Satellite Encryption - Password based authenticated Key establishment Protocols.

UNIT V PRIVACY AND STORAGE SECURITY (9) Privacy on the Internet - Privacy Enhancing Technologies - Personal privacy Policies - Detection of Conflicts in security policies- privacy and security in environment monitoring systems. Storage Area Network Security - Storage Area Network Security Devices - Risk management - Physical Security Essentials. TOTAL : 45 PERIODS

Text Books 1. Michael E. Whitman, Herbert J. Mattord, Principal of Information Security, Fourth Edition, Cengage Learning, 2012.

REFERENCES:

2. John R.Vacca, Computer and Information Security Handbook, Second Edition, Elsevier 2013.

3. Richard E.Smith, Elementary Information Security, Second Edition, Jones and Bartlett Learning, 2016

COURSE CODE COURSE TITLE L T P C 2161IT115 CYBER SECURITY PRINCIPLES 3 0 0 3 Course Category: Program Core A. Preamble : This course describes the concepts of network security and cyber security principles.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Compare and contrast various cryptographic protocols K2 CO2 Demonstrate various ethical hacking and system hacking K3 CO3 Explain the various cyber threats and vulnerabilities. K2 Discuss the pseudo random sequence generators and stream CO4 K2 ciphers CO5 Design and implement secure applications K2

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 M L M M CO5 M M H M H- High; M-Medium; L-Low

D. Course Content :

UNIT I Cryptographic Protocols (9) Introduction to Protocols-Communications Using Symmetric Cryptography-One-Way Functions-One- Way Hash Functions-Communications Using Public-Key Cryptography-Digital Signatures-Digital Signatures with Encryption-Random and Pseudo-Random-Sequence Generation-Basic Protocols-Key Exchange-Authentication-Authentication and Key Exchange.

UNIT II Ethical Hacking and System Hacking (9) Introduction-Importance of Security-Elements of Security-Phase of an Attack- Hacker Attacks – Hacktivism –Ethical Hackers –Computer Crimes and Implication. Introduction–Cracking password– Password cracking websites–Password guessing Algorithms–Password cracking Tools Countermeasure–Escalating Privileges-Executing Applications –Key loggers and spywares.

UNIT III Cyber Threats and Vulnerabilities (9) Cyber Threats-Cyber Activism-Cybercrime-Cyber Espionage-Cyber terrorism-Cyber Warfare-Cyber World Vulnerabilities-Cyber Operations-Cyber Weaponry-Society’s Critical Structures as Targets.

UNIT IV Pseudo-Random-Sequence Generators and Stream Ciphers (9) Linear Congruential Generators-Linear Feedback Shift Registers-Design and Analysis of Stream Ciphers-Stream Ciphers Using LFSRs-A5-Hughes XPD/KPD-Nanoteq-Rambutan-Additive Generators-Real Random-Sequence Generators-RC4-SEAL-WAKE-Feedback with Carry Shift Registers.

UNIT V Real Time Example (9)

IBM Secret-Key Management Protocol-MITRENET-ISDN-STU-III-Kerberos-KryptoKnight- SESAME-Privacy-Enhanced Mail (PEM) - Message Security Protocol (MSP) - Pretty Good Privacy (PGP) - Smart Cards.

TOTAL : 45 PERIODS

Text Books:

1. Bruce Schneier, Applied Cryptography: Protocols, Algorithms, and Source Code in C, John Wiley & Sons,Inc, 2nd Edition, 2007. 2. EC-Council, Ethical Hacking and Countermeasures: Attack Phases, Cengage Learning, 2009.

REFERENCES:

1. Martti Lehto Pekka Neittaanmaki,Cyber Security:Analytics,Technology and Automation, Intelligent Systems, Control and automation: Science and Engineering, Spinger

COURSE CODE COURSE TITLE L T P C 2162IT121 PRINCIPLES OF CYBER PHYSICAL SYSTEMS 3 0 0 3

Course Category: Program Elective A. Preamble : This course describes the concepts of network security and cyber physical systems.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) Able to get an insight to design, specification, modeling and CO1 K2 analysis of CPS CO2 Able to understand asynchronous design methods K2 CO3 Able to analysis the concepts Dynamic systems K2 CO4 Ability to understand the concepts of Time based scheduling K2 CO5 Able to Classify and describe the get Hybrid system K3

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 M M M CO5 M L H M H- High; M-Medium; L-Low

D. Course Content : Unit- 1 (9) Introduction-Synchronous model -Reactive components- Properties of components- Composing components-Synchronous designs

Unit-2 (9) Safety Requirements-Safety specifications-Verifying Invariants-Enumerative Search-Symbolic Search-Asynchronous process- Asynchronous Design primitives-Deadlocks-Shared memory-Fairness assumptions-Asynchronous Coordination Protocols

Unit-3 (9) Liveness Requirements-Temporal Logic-Model Checking-Proving Liveness-Dynamical Systems- Continuous Time models-Linear Systems-Designing Controllers-Analysis Techniques

Unit-4 (9) Timed Model- Timed process- Timing-based protocols-Timed automata-Real-time scheduling- Scheduling concepts-EDF scheduling-Fixed-priority scheduling.

Unit- 5 (9) Hybrid Systems- Hybrid Dynamical models-Designing hybrid systems-Linear Hybrid Automata

TOTAL : 45 PERIODS

TEXT BOOK 1. Rajeev Alur, “Principles of cyber-physical systems”, MIT Press, 2015

Reference 1. Houbing Song, Danda B Rawat, Sabina Jeschke, Christian Brecher, “Cyber-Physical Systems: Foundations, Principles and Applications”, Academic Press, 2016. 2. Danda B. Rawat, Joel J.P.C. Rodrigues, Ivan Stojmenovic,”Cyber-Physical Systems: From Theory to Practice”, CRC Press, 2015.

COURSE CODE COURSE TITLE L T P C 2162IT122 INTRUSION DETECTION SYSTEMS 3 0 0 3 A. Preamble : This course describes the concepts of Intrusion Detection systems.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) A comprehensive knowledge on the subject of intrusion detection CO1 K2 and intrusion detection systems. Understanding the Architecture of IDS and IPS along with CO2 K2 Malicious code detection Understanding the state of the art of Host-Based intrusion CO3 K2 detection System An exposure to the challenges and limitations of intrusion CO4 detection systems. K2 CO5 Able to get Hands-On Experience on Testing and IDS Tools. K3

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 M M M M CO5 M L L H M H- High; M-Medium; L-Low

D. Course Content :

UNIT– I INTRODUCTION (9) An overview of Intrusion Detection-Defining Intrusion Detection-Intrusion Detection Products- Challenges to Effective Intrusion Detection-Implementing Intrusion Detection-Network Based Intrusion Detection Systems-Signature based intrusion detection-Analysis Based Intrusion Detection.

UNIT – II IDS AND IPS ARCHITECTURE (9) Tired Architectures: Sensors-Agents-Manager Component-IDS and IPS Internals: Information Flow in IDS and IPS-Detection of Exploits-Malicious code detection.

UNIT – III HOST-BASED INTRUSION DETECTION (9) Challenges to Host-Based IDS-System Activity-Based Detection-Handling Alerts: Understanding Malicious Activity- Understanding Alerts- Verifying Alerts- Response Activities.

UNIT – IV CHALLENGES TO IDS (9) Architecture Issues- False Positives- False Negatives- Maintaining your IDS to Detect New attacks- Legal Issues- Deploying IDS: Selecting An IDS- Deploying your IDS: Architectural Options- Monitoring Alerts- Fine- Tuning your IDS.

UNIT – V TESTING AND IDS DEPLOYMENT (9) Maximizing your IDS: Correlating all the data- The Example Attack- Verification and Testing- Sample IDS Deployment: The Scenario- Sensor Installation- Console Installation- Using your IDS. TOTAL : 45 PERIODS

Text Book: 1. Carl Endorf, Eugene Schultz and Jim Mellander, “Intrusion Detection & Prevention”, 1st Edition, Tata McGraw-Hill, 2004.

2. Carl Endorf, Eugene Schultz and Jim Mellander, “Intrusion Detection & Prevention”, 1st Edition, Tata McGraw-Hill, 2004.

Reference Books: 1. Matt Bishop, “Computer Security: Art and Science”, Addison-Wesley Professional, 2003.

2. R. D. Pietro & L. V. Mancini, “Intrusion Detection Systems”, Handbook of Advances in Information Security, Springer, 2008. 3. Stephen Northcutt, Judy Novak, “Network Intrusion Detection”, 3rd Edition, New Riders Publishing, 2002.

COURSE CODE L T P C COURSE TITLE 2162IT123 CYBER CRIMES AND LAWS 3 0 0 3 A. Preamble : This course describes the concepts of Cyber Crimes and Laws.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Basic concepts of cyber crime and its phenomena K2 CO2 To know the challenges of fighting cybercrime and its strategies K2 Study of various organizations and its laws with respect to CO3 K2 cybercrime To know the Legal Aspects and Solutions and Strategies that are CO4 K2 needed for it CO5 To learn the technical solutions and the future expectations K2

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 L M M M CO5 L L L H M H- High; M-Medium; L-Low

D. Course Content : UNIT- I (9) Introduction-Infrastructure and services, Advantages and risks , Cyber security and cybercrime , International dimensions of cybercrime Consequences for developing countries . The phenomena of cybercrime –Definitions- Typology of cybercrime , Development of computer crime and cybercrime Extent and impact of cybercrime offenses ,offenses against the confidentiality, integrity and availability of computer data and systems , Content-related offenses Copyright and trademark related offenses , Computer-related offenses ,Combination offenses

UNIT-II (9) The challenges of fighting cybercrime _ Opportunities , General challenges , Legal challenges . Anti-cybercrime strategies - Cybercrime legislation as an integral part of a cybersecurity strategy , A cybercrime policy as starting point , The role of regulators in fighting cybercrime .

UNIT-III (9) Overview of activities of regional and international organizations -International approaches Regional approaches, Scientific and independent approaches ,The relationship between regional and international legislative approaches, The relationship between international and national legislative approaches . Legal response –Definitions,Substantive criminal law , Digital evidence ,Justisdiction , Procedural law , International cooperation , Liability of Internet providers .

UNIT-IV (9) Legal Aspects of Cybersecurity- Purpose and Scope, Executive Summary , General Introductory Remarks , Legal Problematics, Sovereignty and Jurisdictional Fragmentation ,Attribution: Determining the Responsibility for Harmful Conduct

Cyber security as an Umbrella Concept- Cybercrime and Cybercrime Tools ,Hacking and Hacktivism , Cyber war and Cyber terrorism , Cyber espionage – the Advanced Persistent Threat Legal Solutions and Strategies -Criminalization ,Hacktivism and Criminalization , Procedure and Evidence ,Harmonization of Laws , Incident Reporting and Information Sharing , Institutional Arrangements for Cybersecurity Bureaucracy , Personnel Recruitment and Educational Training

UNIT-V (9)

Technical Solutions-Defense and Monitoring Systems , Standardization and Air-Gapped Networks, Policy Considerations ,Vulnerability Mitigation and Threat Deterrence, Private-Public Sector Dynamic 9 International Cooperation in Criminal Matters, Treaty-Based Approach to Cyber security and Cyber crime, General Recommendations TOTAL : 45 PERIODS Text books: Understanding cybercrime: Phenomena, challenges and legal response by Prof. Dr. Marco Gercke, ITU Telecommunication Development Bureau, ITU publication.

Reference books:

Legal Aspects of Cybersecurity- Artur Appazov

Related Web links:

1)www.itu.int/ITU-D/cyb/cybersecurity/legislation.html 2)http://vle.du.ac.in/file.php/697/Cyber_Crimes_Cyber_Security_and_Legal_Aspects/Introduction_to_ Cyber_Crimes_Cyber_Security.pdf 3)http://www.itu.int/ITU-D/cyb/cybersecurity/docs/Cybercrime%20legislation%20EV6.pdf 4) http://business.cch.com/franlaw/cybercrime_whitepaper.pdf 5) http://www.nalsarpro.org/CL/Modules/Module4/Chapter-1.pdf 6)https://archive.org/stream/ATextBookOfCyberCrimeAndPenalties/ATextBookOfCyberCrimesAndPe naltiesByAdv.PrashantMali_djvu.txt

COURSE CODE COURSE TITLE L T P C 2162IT124 CYBER FORENSICS 3 0 0 3 A. Preamble : This course describes the concepts of Cyber Forensics.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Understand the fundamentals of Computer Forensics K2 CO2 Learn the issues of Data Acquisition and Data Recovery K2 CO3 Explore networking in cyber forensics K2 CO4 Learn to analyze and validate forensics data K2 CO5 Be familiar with forensic tools and case studies K3

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 L M M M CO5 L M L H M H- High; M-Medium; L-Low

D. Course Content :

UNIT I INTRODUCTION TO COMPUTER FORENSICS (9)

Computer Forensics Fundamentals, Types of Computer Forensics Technology – Types of Computer Forensics Systems-Data Recovery and Evidence Collection– Forensic duplication and preservation of DE, Understanding Computer Investigation. UNIT II EVIDENCE DATA GATHERING (9)

Data Acquisition. - Data Recovery- Evidence Collection and Data Seizure - Duplication and Preservation of Digital Evidence

UNIT III INVESTIGATIONS (9)

Network Traffic , Web Attacks, Router Forensics, DoS Attacks and Internet Crime

UNIT IV EVIDENCE DATA ANALYSIS (9)

Discovery of Electronic Evidence - Identification of Data - Determining and Validating Forensics Data – Data Hiding Techniques – Performing Remote Acquisition– Cell Phone and Mobile Devices Forensics- Processing Crime and Incident Scenes

UNIT V FORENSICS TOOLS AND CASE STUDIES (9)

Working with Windows and DOS Systems.- Current Computer Forensics Tools: Software/ Hardware Tools. Case Studies.

TOTAL: 45 PERIODS

TEXT BOOKS:

1. Man Young Rhee, “Internet Security: Cryptographic Principles”, “Algorithms and protocols”, Wiley Publications, 2003. 2. Nelson, Phillips, Enfinger, Steuart, “Computer Forensics and Investigations”, Cengage Learning, India Edition, 2008. 3. John R.Vacca, “Computer Forensics”, Cengage Learning, 2005

REFERENCES:

1. Richard E.Smith, “Internet Cryptography”, 3rd Edition Pearson Education, 2008.

2. Marjie T.Britz, “Computer Forensics and Cyber Crime”: An Introduction”, 3rd Edition, Prentice Hall, 2013.

COURSE CODE COURSE TITLE L T P C BITCOIN AND CRYPTOCURRENCY 2162IT125 3 0 0 3 TECHNOLOGIES

A. Preamble : This course describes the concepts of Bitcoin and cryptocurrency technologies.

B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) CO1 Able to understand various cryptographic techniques. K2 CO2 Explore mechanism based on bitcoin transaction. K2 CO3 Able to understand bitcoin mining in detail. K2 Understand policies and hands-on knowledge about virtual K2 CO4 mining CO5 Analyse the concepts of cryptocurrency ecosystem K2

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 H L CO2 H H CO3 L L L CO4 L M M M CO5 L M L H M H- High; M-Medium; L-Low

D. Course Content : UNIT I (9) Introduction to Cryptography & : Cryptographic Hash Functions, Hash Pointers and Data Structures, Digital Signatures, Public Keys as Identities, A Simple Cryptocurrency. Bitcoin Decentralization: Centralization vs. Decentralization, Distributed consensus, Consensus without identity using a block chain, Incentives and proof of work.

UNIT II (9) Mechanics of Bitcoin: Bitcoin transactions, Bitcoin Scripts, Applications of Bitcoin scripts, Bitcoin blocks, The Bitcoin network, Limitations and improvements. Storing and Using Bitcoins: Simple Local Storage, Hot and Cold Storage, Splitting and Sharing Keys, Online Wallets and Exchanges, Payment Services, Transaction Fees, Currency Exchange Markets.

UNIT III (9) Bitcoin Mining: Bitcoin miners, Mining Hardware, Energy consumption and ecology, Mining pools, Mining incentives and strategies. Bitcoin and Anonymity: Anonymity Basics, De-anonymizing Bitcoin, Mixing, Decentralized Mixing, Zerocoin and Zerocash.

UNIT IV (9) Community, Politics, and Regulation: Consensus in Bitcoin, Bitcoin Core Software, Stakeholders, Roots of Bitcoin, Government interaction with Bitcoin, Anti Money‐Laundering, Regulation, Licensing Bitcoin. Alternative Mining Puzzles: Essential Puzzle Requirements, ASIC‐resistant puzzles, Proof‐Of‐Useful‐Work, Nonoutsourceable Puzzles, Proof‐of‐Stake and Virtual Mining. Bitcoin as a Platform: Bitcoin as an Append‐Only Log, Bitcoins as “Smart Property”, Secure Multi‐Party Lotteries in Bitcoin.

UNIT V (9) Bitcoin as Public Randomness Source, Prediction Markets and Real World Data Feeds. Altcoins and the Cryptocurrency Ecosystem: Introduction to Altcoins, Relationship Between Bitcoin and Altcoins, Merge Mining, Atomic Cross‐chain Swaps, Bitcoin‐Backed Altcoins, “Side Chains”, Ethereum and Smart Contracts. Decentralized Institutions: The Block Chain as a Vehicle for Decentralization, Routes to Block Chain Integration, Template for Decentralization, Consequences of Decentralization. TOTAL : 45 PERIODS

Text Book: Narayanan A, Bonneau J, Felten E, Miller A, and Goldfeder S, Bitcoin and Cryptocurrency Technologies – A Comprehensive Introduction, Princeton University Press, 2016.

Reference Books: 1. Dannen C, Introducing Ethereum and Solidity: Foundations of Cryptocurrency and Blockchain Programming for Beginners, Apress, 2017. 2. Drescher D, Blockchain Basics: A Non-Technical Introduction in 25 Steps, Apress, 2017. 3. Karame G, Bitcoin and Blockchain Security, Artech House, 2016. 4. Kleinman B, The Bitcoin Tutorial: Develop an intuitive understanding of the currency and blockchain technology, FSVpress, 2016.

COURSE CODE COURSE TITLE L T P C PERFORMANCE EVALUATION OF 2161IT126 3 0 0 3 COMPUTER SYSTEMS

Course Category: Program Elective

A. Preamble : To provide an in-depth knowledge on Performance Evaluation of Computer Systems B. Course Outcomes : Upon the successful completion of the course, students will be able to: Level of learning CO domain (Based on Course Outcomes Nos. revised Bloom’s taxonomy) Learn the basics of Workload Selection, Workload CO1 K2 Characterization CO2 Understand the Experimental Design K2 CO3 Know the Full Factorial Design K2 CO4 Learn the basics of K3 CO5 Knowing the Verification and Validation of Simulation Models K3

C. Correlation of COs with POs : COs PO1 PO2 PO3 PO4 PO5 PO6 PO7 PO8 PO9 PO10 PO11 PO12 CO1 M H

CO2 L H M CO3 L H L L

CO4 M M H M

CO5 L M H M L

H- High; M-Medium; L-Low

D. Course Content : UNIT–I Performance Evaluation - Performance Analysis and Performance Measurement; Common Mistakes and How to Avoid them,Selection of Techniques and Metrics, Types of Workloads, The Art of Workload Selection, Workload Characterization Techniques, Monitors, Program Execution Monitors and Accounting Logs, Capacity Planning and Benchmarking UNIT–II The Art of Data Presentation, Ratio Games, Introduction to Experimental Design, 2k Factorial Designs, 2kr Factorial Designs with Replications, 2k-p Fractional Factorial Designs andOne Factor Experiments. UNIT–III Two Factor FullFactorial Design without Replications, Two Factor Full Factorial Design with Replications, General Full Factorial Designs with k Factors, Introduction to Simulation andSimulation Examples.

UNIT–IV General Principles, Random Number Generation, Random Variate Generation andInput Modeling

UNIT–V Verification and Validation of Simulation Models, Output Analysis for a Single Model, Comparison and Evaluation of Alternative System Designs.

TOTAL : 45 PERIODS

Text Books:

1. Rah Jain, “The ART of Computer Systems Performance Analysis”, Wiley, 1991.(Unit I, II and III) 2. Jerry Banks, John S. Carson, Barry L. Nelson, David M. Nicol, P. Shahabudeen, “ Discrete Event System Simulation“, Pearson, Fourth Edition, 2008 ( Unit III, IV,V)

Reference Books:

1. Arevill Law, “Simulation Modeling and Analysis”, MC GrawHill ,2017. 2. EltanBachmat, “Mathematical Adventures in Performance Anaysis: From Storage systems through Airplane Boarding to Express Line Queues”, Birkhauser, 2014.

COURSE CODE COURSE TITLE L T P C 2162IT127 Bioinformatics 3 0 0 3 Course Educational Objectives : The student should be made to:

 Understand the theoretical basis behind bioinformatics.

 Search databases accessible on the WWW for literature relating to molecular biology and biotechnology.

 Analyze protein sequences, identify proteins, and retrieve protein structures from databases. View and interpret these structures. Understand homology modelling and computational drug design

 Manipulate DNA and protein sequences using stand-alone PC programs and programs available on the WWW.  Query biological data, interpret and model biological information and apply this to the solution of biological problems in any arena involving molecular data.

Course Content : UNIT I INTRODUCTION 9 Need for Bioinformatics technologies – Overview of Bioinformatics technologies Structural Bioinformatics – Data format and processing – Secondary resources and applications – Role of Structural bioinformatics - Biological Data Integration System.

UNIT II DATAWAREHOUSING AND DATAMINING IN BIOINFORMATICS 9

Bioinformatics data – Data warehousing architecture – data quality – Biomedical data analysis – DNA data analysis – Protein data analysis – Machine learning – Neural network architecture and applications in bioinformatics.

UNIT III MODELING FOR BIOINFORMATICS 9 Hidden Markov modeling for biological data analysis – Sequence identification –Sequence classification – multiple alignment generation – Comparative modeling –Protein modeling – genomic modeling – Probabilistic modeling – Bayesian networks – Boolean networks - Molecular modeling – Computer programs for molecular modeling.

UNIT IV PATTERN MATCHING AND VISUALIZATION 9 Gene regulation – motif recognition – motif detection – strategies for motif detection – Visualization – Fractal analysis – DNA walk models – one dimension – two dimension – higher dimension – Game representation of Biological sequences – DNA, Protein, Amino acid sequences.

UNIT V MICROARRAY ANALYSIS 9 Microarray technology for genome expression study – image analysis for data extraction – preprocessing – segmentation – gridding – spot extraction – normalization, filtering – cluster analysis – gene network analysis – Compared Evaluation of Scientific Data Management Systems – Cost Matrix – Evaluation model - Benchmark – Tradeoffs.

Learning Resources i.TEXT BOOK: 1. Yi-Ping Phoebe Chen (Ed), “BioInformatics Technologies”, First Indian Reprint, Springer Verlag, 2007. ii.REFERENCES: 1. Bryan Bergeron, “Bio Informatics Computing”, Second Edition, Pearson Education, 2003. 2. Arthur M Lesk, “Introduction to Bioinformatics”, Second Edition, Oxford University Press, 2005. iii. Online Resources 1. http://bioinfo.mbb.yale.edu/mbb452a/intro/ 2. http://en.wikipedia.org/wiki/Integrative_bioinformatics 3. http://www.bioinformatics.org/wiki/Protein_structure_prediction 4. http://mathematica.stackexchange.com/questions/73685/how-to-visualize-pattern-matching-process 5. http://en.wikipedia.org/wiki/DNA_microarray