Documente Academic
Documente Profesional
Documente Cultură
Vidisha(M.P.)
PROGRAMME: B.E. Information Technology. VIII Semester
Categories of
Course
Departmental
Core
Course Title
Network Security &
Cryptography
Course
Code
IT 1181
Credits = 6C
L
3
T
1
P
2
Max Marks: 70
Min Marks: 22
Duration: 3:00
Hrs.
UNIT -I: Introductionto network security: Security Needs and Threats, Goals of network security, Types
of Computer Crime and Criminals-scavenging, leakage, wire taping etc. Controlling Physical Access:
Role of physical Security, Weakness, Types of Identification Badges, security factors. Desktop security:
Challenges, security techniques, physical security and procedural methods, Protecting data hardware and
software problem and their solutions. Role of Password network security, strength and weakness of
password, Administering a password system,Virus, Worms, Trap doors, Trojan horse, Firewall.
UNIT-II: Security: Attacks, Services, Mechanism, OSI security architecture, Symmetric ciphers:
Substitution Ciphers: Caesar cipher, Hill cipher, Play fair cipher, Mono-alphabetic Cipher, Polyalphabetic cipher, Shannon Theorem, One Time pad, Transposition Cipher: Rail fence technique, Rotor
machines, Steganography.
UNIT- III:Block Cipher: Data confidentiality, Simplified DES, Feistal Structure, Blowfish, RC5, Data
Encryption Standard, Strength of DES, Differential and Linear Cryptanalysis, Block Cipher Design
principles, Block Cipher Modes of Operation. Advanced Encryption standard
UNIT- IV: Number Theory: Group, Ring, Field, Modular Arithmetic, Euclidean Theorem, Fermats
Theorem, Eulers Theorem, Chinese Remainder Theorem, Public Key Cryptography: RSA algorithm.
Diffie-Hellman Key Exchange Algorithm, Elliptic Curve Cryptography.
UNIT- V: Cryptographic Data Integrity: Hash Function, Requirement and security, Secure hash
algorithm (SHA) and its Version, Message Digest MD-4 and MD-5, RIPMED, Message Authentication
Codes, Digital Signature standard, Key Management and Distribution, PKI, User Authentication Protocol:
Kerberos. Transport layer Security: SSL, TLS, HTTPS, Email Security: PGP, S/MIME, IP Security
Reference Books: 1.William Stallings Cryptography and Network Security-Principles and Practice Forth Edition, Prentice
Hall Publication.
2. Behrouz A. Forouzan, DebdeepMukhopadhyay Cryptography and Network Security Second Edition
Tata Macgraw Hill Education.
Course Title
Departmental
Core
Soft Computing
Course Code
IT-1182
Credits=6C
Max. Marks-70
Min. Marks- 22
Duration- 3Hrs.
Unit I :Soft Computing: Introduction of soft computing, soft computing vs. hard computing,
various types of soft computing techniques, applications of soft computing. Neural Network :
Structure and Function of a single neuron: Biological neuron, artificial neuron, Difference and
characteristics and applications of ANN, Evolution of Neural Networks, Basic Models of
Artificial Neural Network, Important Terminologies of ANNs, McCulloch-Pitts Neuron model.
Widrow&Hebb;s learning rule/Delta rule.
Unit II :Supervised Learning Network Introduction, Perception Networks, Back-Propagation
Network, Radial Basis Function Network, Time Delay Neural Network Single layer network,
Perceptron training algorithm, Linear separability, , ADALINE, MADALINE. Introduction of
MLP, Error back propagation algorithm, derivation of BBPA, momentum, limitation,
characteristics and application of EBPA.
Unit III:Unsupervised Learning Networks Introduction, Fixed Weight Competitive Nets,
Kohonen Self-Organizing Motor Maps, Adaptive Resonance Theory (ART 1,ART 2):
Architecture, classifications, Implementation and training Counter propagation network,
architecture, functioning & characteristics of counter Propagation network, Hopfield/ Recurrent
network, configuration, stability constraints, associative memory, and characteristics, limitations
and applications. Hopfield v/s Boltzman machine. Associative Memory.
Unit IV:Fuzzy Logic: Fuzzy set theory, Fuzzy set versus crisp set, Crisp & fuzzy relations,
Fuzzy systems: crisp logic, fuzzy logic, , Predicate Logic, introduction & features of membership
functions, Fuzzy rule base system: Defuzzification Methods,Fuzzification ,fuzzy propositions,
formation, decomposition & aggregation of fuzzy rules, fuzzy reasoning, fuzzy inference
systems, fuzzy decision making & Applications of fuzzy logic.
Unit V:Genetic algorithm : Fundamentals of Genetic Algorithms History, Basic Concepts,
Creation of Offsprings, Working Principle, working principle, encoding, fitness function,
reproduction, Genetic modelling: Inheritance operator, cross over, inversion & deletion, mutation
operator, Bitwise operator, Generational Cycle, Convergence of GA, Applications & advances in
GA, Differences & similarities between GA& other traditional method.
Reference Books:
1. Neural Network, Fuzzy logic,and Genetic Algortihms Synthesis and Applications, S.Rajsekaran
,G.A VijayalakshmiPai
2. Neural Networks: A Comprehensive Foundation (2nd Edition), Simon Haykin, Prentice Hall.
3. Elements of artificial neural networks by Kishan Mehrotra, Chilukuri K. Mohan and Sanjay
Ranka.
4. Neural networks and fuzzy systems by Bart Kosko, Prentice Hall of India.
5. Fundamentals of artificial neural networks by Mohammad H. Hassoun, Prentice Hall of India.
Course Title
Advanced
Computer
Architecture
Course
Code
IT-1183(A)
L
3
Credits=4C
T
1
P
--
Max.Marks-70
Min. Marks- 22
Duration-3hrs.
Course Title
Data Compression
Techniques
Course Code
IT-1183(B)
Credits=4C
Max. Marks-70
Min. Marks- 22
Duration- 3Hrs.
Unit-I:Introduction To Data Compression, The Data Compression Lexicon, With A History The
Two Kingdoms, Data Compression Modeling,Coding, The Dawn Age, Coding An improvement
Modeling, Statistical Modeling, Ziv & Lempel LZ77 LZ78, Lossy Compression, Programs to
Know. Minimum Redundancy Coding The Sahnnon-Fano Algorithm.
Unit-II: The Huffman Algorithm, Prototypes, Huffman Code, Counting the Symbols, Saving the
Counts, Building the Tree, Using the tree ,Adaptive Huffman Coding Adaptive Coding,
Updating Huffman Tree, swapping, The Algorithm, Enhancement, Escape Code, Overflow
Bonus, Rescaling Bonus, Initialization of the Array, Compress Main Program, Expand Main
Program, Encoding Symbol, Decoding Symbol
Unit-III:Huffman One Better: Arithmetic Coding Difficulties, Arithmetic Coding: A Step
Problem, LZSS compression, Data structures, A balancing Act Greedy vs. Best Possible. The
expansionRoutine,Improvements.Speech Compression,Digital Audio Concepts, Fundamentals,
Sampling Variables, PC-Based sound,Lossless Compression of Sound, Problems and Results,
Loss compression, Silence Compression, Other Techniques.
Lossy Graphics Compression,Enter Compression, Statistical And Dictionary
Compression Methods Lossy Compression Differential Modulation Adaprive Coding, A
Standard that Works:JPEG, JPEG Compression Discrete Cosine Transform, DCT
Specifics,Implementing DCT. Matrix Multiplication, Cpmtomied Improvements,Output Of The
DCT, Quantization, Selecting A Qualtization Matrix. Sample Program, Input Format,
Initialization, Forward DCT Routine, Write DCT Data(),File Expansion, Read DCT
Data(),Inverse DCT.
Unit-V:
Reference Books:
1. Data Compression, Mark Nelson
2. Data Compression, Khalid shayood, Morgon Kaufmann
3. Data Compression : The Complete Reference, David Saloman, Springer
Title
Elective -III
Code
IT-1183(C)
Credits- 4C
L
Marks Distribution
Max. Marks-70
Min.Marks-22
Duration-3hrs.
Reference Books:
1. Fundamentals of Digital Image Processing, S. Annadurai, Pearson Education
2. Digital Image processing, Rafael E. Gonzalez, Pearson education
Category of
Course
Elective-IV
Course Title
Ad Hoc Networks
Course Code
IT-1184(A)
Credits=4C
Max. Marks-70
Min. Marks- 22
Duration- 3Hrs.
Unit II: Ad Hoc wireless MAC protocols-Introduction, Design goal, Problems in Ad Hoc channel access,
Classification of Ad Hoc wireless MAC protocols, Synchronous and asynchronous MAC protocols,
Receiver-initiated and sender-initiated MAC protocols, MACA, DBTMA, PA-MAC.
Unit III: Ad Hoc Routing Protocols: Introduction, Design Issues, Classifications of Routing Protocols,
Table-Driven Routing Protocols, DSDV, CSGR, etc., Source-Initiated On-Demand Approaches, AODV, DSR,
LAR, ZRP, etc., Ad Hoc Multicast Routing Protocols: Introduction, Tree-Based Multicast Routing
Protocols, Mesh-Based Multicast Routing Protocols, Energy-Efficient Multicasting.
Unit IV: Transport Layer Protocols: Introduction, Design Issues, Design Goals, Classification of Transport
Layer Solutions, TCP Over Ad Hoc Wireless Networks. Security in Ad Hoc Wireless Networks: Network
Security Requirements, Issues and Challenges in Security Provisioning, Network Security Attacks on
different layers, Key Management, Secure Routing in Ad Hoc.
Unit V: QoS Management: Introduction, Issues and Challenges in Providing QoS, Classifications of QoS
Solutions, QoS Frameworks for Ad Hoc Wireless Networks. Energy Management: Introduction,
Classification of Energy Management Schemes, Battery Management Schemes, Transmission Power
Management Schemes, System Power Management Schemes.
References1.C.K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice Hall PTR, 2001.
2.C. Siva Ram Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols,
Prentice Hall PTR, 2004.
3.Charles E. Perkins, Ad Hoc Networking, Addison Wesley, 2000
Course Title
Cyber Law and
Forensic Science
Course
Code
IT 1184 (B)
Credits = 4C
L
3
T
1
P
--
Max Marks: 70
Min Marks: 22
Duration: 3:00
Hrs.
Unit I: Introduction to Cyber laws In indian Context- Information technology act 2000, Amendments
made in the indian ITA 2000, Positive Aspects of ITA 2000, The Weak Areas of ITA 2000,
Challenges in India Law and Cyber-crime scenario in india, consequences of Not Addressing the
weakness in information technology act amendments to indian ITA 2008, Impact of IT act
Amendments Impact Information Technology Organizations Cyber-crime and Punishments.
Unit II: Private ordering solutions, Regulation and Jurisdiction for global Cyber security, Copy
Right-source of risks, Pirates, Internet Infringement, Fair Use, postings, criminal liability, First
Amendments, Data Losing.
Unit III :Copy Right-Source of risks, Pirates, Internet Infringement, Fair Use, postings, Criminal
Liability, First Amendments, Losing Data, Trademarks, Defamation, Privacy-Common Law Privacy,
Constitutional law, Federal Statutes, Anonymity, Technology expanding privacy rights.
Unit IV:
Duty of Care, Criminal Liability, Procedural issues, Electronic Contracts & Digital Signatures,
Misappropriation of information, Civil Rights, Tax, Evidence.
Unit V: Ethics, Legal Developments, Late 1990 to 2000,Cyber security in Society, Security in cyber
laws case studies, General law and Cyber Law-a Swift Analysis.
Reference Books:
1.Law Relating to computer internet and E commerce by Nandan Kamath, 2nd Edition Universal
Law Publishing Co. Pvt Limited.
2.Jonathan Rosenoer,Cyber Law: The law of the Internet, Springer-Verlag, 1997.
3.Mark F Grady, Fransesco Parisi, The Law and Economics of Cyber Security, Cambridge
University Press, 2006
Course Title
Mobile Computing
Course
Code
IT 1184(C )
Credits = 4C
L
3
T
1
P
-
Max Marks: 70
Min Marks: 22
Duration: 3:00
Hrs.
Course Title
Course Code
Data Mining
IT-1184(D)
Credits=4C
L
T
P
3
1
-
Max. Marks-70
Min. Marks- 22
Duration- 3Hrs.
Unit -I: Data Warehousing: Overview, Definition, Delivery Process, Difference between Database
System and Data Warehouse, Multi-Dimensional Data Model, Data Cubes, Stars, Snow Flakes, Fact
constellations, Concept hierarchy, Process Architecture, 3 Tier Architecture, Data Warehousing Vs Data
Mart.
Unit-II: OLAP in Data Warehouse: Overall concept of online analytical processing (OLAP), OLAP
definition, and rules, OLAP characteristics, major features and function of OLAP- general features,
dimensional analysis, hyper cubes, drill down and roll up, slice and dice, rotations, uses and benefits,
familiarity with OLAP models overview of variation, MOLAP, ROLAP, HOLAP, DOLAP, database
OLAP, web OLAP.
Unit-III: Data Mining: overview of data mining definition, knowledge discovery process (relationship,
patterns, phases of the process), OLAP versus data mining, some aspects of data mining- association
rules, outlier analysis, predictive analysis etc, concept of data mining in a data warehouse environment,
major data mining techniques cluster detection, decision trees, memory based reasoning, link analysis,
neural network, genetic algorithm etc.
Unit -IV: Mining association rules in large databases, association rule mining, minimum single
dimensional Boolean association rules from transaction database and mining, multi-dimensional
association rules from relational databases.
Unit -V: Classification and Clustering, What is Classification, Issues regarding Classification, Decision tree,
Classification methods K-nearest neighbor classifiers. Cluster Analysis: Data types in cluster analysis, Categories of
clustering methods, Partitioning methods. K-Means clustering, Hierarchical Clustering- CURE, Density Based
Methods-DBSCAN.
Reference Books:
1.
2.
Jiawei Han, Micheline Kamber, Data Mining Concepts & Techniques Elsevier
3.
Sam Anahory, Dennis Murray, Data Warehousing in the Real World : A Practical Guide for Building
Decision Support Systems, Pearson Education
4.
of Course Title
Major Project
Course Code
IT-1185
Credits=4C
L
--
--
Max Marks:
120
Core