Post on 28-Sep-2020
DETAIL TEACHING SCHEME
SCHOOL OF ENGINEERING PROGRAM :M. TECH – COMPUTER ENGINEERING
ACADEMIC YEAR - 2018-19 SEMESTER – II (Batch: 2018-20)
DEFINATION OF ONE CREDIT : 1. Lecture(L): 1 hour / week / semester, 2. Practical(P): 2 hour / week / semester, 3. Tutorial(T): 2 hour /
week / semester
Course
Code Course Name
Teaching Hours Credits CIE PSEE
Theory Tutorial Practical
CP208 Soft computing 3 0 2 4 Y Y
CP209 Embeded System 4 0 2 5 Y Y
CP200 Service Oriented Architecture 3 0 2 4 Y Y
CP115 Cryptography and Network
Security
3 0 2 4 Y Y
Elective I 3 0 2 4 Y Y
Elective II 3 0 2 4 Y Y
Total 19 0 12 25
Total Hours 31
N- No CIE – Continuous internal evaluation
Y – Yes PSEE – Practical semester end examination including ITD, Dissertation, Industrial project, Industrial training etc..
Elective – I
1. CP910 – Computer Unified Device Architecture
2. CP905 – Real Time Operating Systems
Elective – II
1. CP906 – Digital Image Processing
2. CP909 – Digital Forensics
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Computer Unified Device Architecture
Course Code CP910
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
On the completion of the course, students will be able: Apply knowledge of the Multicore processor’s internal memory optimization by use
of a NVIDIA GPU card. Design and analyze algorithms that execute efficiently on GPU. Accelerate computational research and engineering applications with NVIDIA
CUDA GPUs. Reduce accesses of global memory by using shared memory. Write kernel code that minimizes thread divergence and branch divergence Use thrust library and use in memory a Implement algorithm using new features of CUDA 6. Use different tools for profiling CUDA code.
Detailed Syllabus
Sr. No.
Name of chapter & details
1. Introduction to Massively Parallel ComputingGeneric Multicore Chip Heterogeneous Parallel ComputingUnit – GPU, Architecture of a Modern GPUCUDA Hardware: Memory Model, CUDA Programming Model, Program execution
2. Introduction to Data Parallelism and CUDA CData Parallelism, CUDA Program Structure, ADevice Global Memory and Data Transfer, Kernel Functions and Threading, CUDA Thread Organization, Mapping Threads to Multidimensional Data,
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Computer Unified Device Architecture
CP910
Theory :03
Practical :01
Tutorial :00
Credits :04
Course Learning Outcomes:
the course, students will be able: Apply knowledge of the Multicore processor’s internal memory optimization by use
Design and analyze algorithms that execute efficiently on GPU. Accelerate computational research and engineering applications with NVIDIA
Reduce accesses of global memory by using shared memory. Write kernel code that minimizes thread divergence and branch divergence Use thrust library and use in memory allocation and application. Implement algorithm using new features of CUDA 6. Use different tools for profiling CUDA code.
Name of chapter & details
SECTION-I
Introduction to Massively Parallel Computing Generic Multicore Chip – CPU, Generic Many core Chip Heterogeneous Parallel Computing, CPU Vs. GPU, Graphics Processing
Architecture of a Modern GPU, Compute Capability, CUDA, dware: Memory Model, CUDA Programming Model, Program
Introduction to Data Parallelism and CUDA C Data Parallelism, CUDA Program Structure, A Vector Addition Kernel, Device Global Memory and Data Transfer, Kernel Functions and
CUDA Thread Organization, Mapping Threads to
SYLLABUS
Page 1
Computer Unified Device Architecture
Apply knowledge of the Multicore processor’s internal memory optimization by use
Accelerate computational research and engineering applications with NVIDIA
Write kernel code that minimizes thread divergence and branch divergence
Hours Allotted
CPU, Generic Many core Chip – GPU, . GPU, Graphics Processing , Compute Capability, CUDA,
dware: Memory Model, CUDA Programming Model, Program
04
Vector Addition Kernel, Device Global Memory and Data Transfer, Kernel Functions and
CUDA Thread Organization, Mapping Threads to 07
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
3. Data-Parallel Execution ModelMatrix-Matrix MultiplicationTransparent Scalability, Assigning Resources to Blocks, Querying Device Properties, Thread Scheduling and Latency Tolerance
4. CUDA Memories Importance of Memory Access Device Memory, Shared Memory, PageMemory, Write-Combining Memory, Mapped Memory, Texture memory, Surface Memory
5. Basic Parallel Communication Patterns and parallel communication patterns like map, gather, scatter, stencilFundamental GPU algorithms:Reduction computation parallel reduction, Work complexity and step complexity, Shared Memory allocation in CUDA.Thread Synchronization, Gridreduction with shared memory(Version1) and its disadvantages.
6. Optimization of parallel reductionThread Divergence, Control (Branch) Flow Divergence, reduction with stride index and nonmemory bank conflicts, Linear addressing, and parallel reduction with linear addressing (Version3). With two loads and first add of the reduction (Version4), Loop unrolling,Parallel reduction with loop unrcomparison of all versions
7. Thrust : Productivity-Oriented Library for CUDACUDA Libraries, Thrust Thrust – Provide generic function, Containers, Iterator, Algorithms.
8. New Features in CUDA 6 Unified Memory, XT and drop in libraries, GPU Direct RDMA in MPI, CUDA tools for performance checking MEMCHECK, NSight.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multietc.
Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval.
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Parallel Execution Model Matrix Multiplication—A More Complex Kernel, Synchronization and
Transparent Scalability, Assigning Resources to Blocks, Querying Device Properties, Thread Scheduling and Latency Tolerance
Importance of Memory Access Efficiency, CUDA Device Memory Types Device Memory, Shared Memory, Page-Locked Host Memory, Portable
Combining Memory, Mapped Memory, Texture memory,
SECTION-II
Basic Parallel Communication Patterns and Algorithms parallel communication patterns like map, gather, scatter, stencil Fundamental GPU algorithms: Reduction computation – Sequential reduction, Tree based approach of parallel reduction, Work complexity and step complexity, Shared Memory
n in CUDA.Thread Synchronization, Grid-Stride Loops, Parallel reduction with shared memory(Version1) and its disadvantages.
Optimization of parallel reduction Thread Divergence, Control (Branch) Flow Divergence, Warps, parallel
index and non-divergent branch (Version2), Shared memory bank conflicts, Linear addressing, and parallel reduction with linear addressing (Version3). With two loads and first add of the reduction (Version4), Loop unrolling,Parallel reduction with loop unrolling(Version 5), comparison of all versions
Oriented Library for CUDA CUDA Libraries, Thrust – Introduction, Thrust – Provide generic data type,
Provide generic function, Containers, Iterator, Algorithms.
New Features in CUDA 6 Unified Memory, XT and drop in libraries, GPU Direct RDMA in MPI, CUDA tools for performance checking – nvproof, visual profiler,
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media projector, blackboard, OHP
Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval.
SYLLABUS
Page 2
A More Complex Kernel, Synchronization and Transparent Scalability, Assigning Resources to Blocks, Querying Device 04
Efficiency, CUDA Device Memory Types Locked Host Memory, Portable
Combining Memory, Mapped Memory, Texture memory, 06
Total 21
Sequential reduction, Tree based approach of parallel reduction, Work complexity and step complexity, Shared Memory
Stride Loops, Parallel
07
Warps, parallel divergent branch (Version2), Shared
memory bank conflicts, Linear addressing, and parallel reduction with linear addressing (Version3). With two loads and first add of the reduction
olling(Version 5),
07
Provide generic data type, Provide generic function, Containers, Iterator, Algorithms.
03
Unified Memory, XT and drop in libraries, GPU Direct RDMA in MPI, 04
Total 21
media projector, blackboard, OHP
Assignments based on course contents will be given to the students at the end of
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Reference Books:
“Programming Massively Parallel Processorssecond edition
“CUDA_C_Programming_Guide V5.5”
“CUDA by Example: An Introduction to General
Jason Sanders Edward Kandrot
“CUDA Application Design and Development
“Multicore Processors and Systems” by Keckler, Olukotun, &Hofstee
Additional Resources
1. developer.nvidia.com/cuda-downloads2. http://developer.download.nvidia.com/compute/cuda/2_1/toolkit/docs/ NVIDIA_CUDA_Programming_Guide_2.1.pdf3. http://forums.nvidia.com/index.php?sho4. http://gpucoder.livejournal.com/990.html5. http://developer.nvidia.com/gpu
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Programming Massively Parallel Processors” by David B. Kirk & Wen
ng_Guide V5.5” http://docs.nvidia.com/cuda/index.html
“CUDA by Example: An Introduction to General-Purpose GPU Programming” by
Jason Sanders Edward Kandrot
CUDA Application Design and Development” by Rob Farber
“Multicore Processors and Systems” by Keckler, Olukotun, &Hofstee
downloads http://developer.download.nvidia.com/compute/cuda/2_1/toolkit/docs/NVIDIA_CUDA_Programming_Guide_2.1.pdf http://forums.nvidia.com/index.php?showtopic=181472 http://gpucoder.livejournal.com/990.html http://developer.nvidia.com/gpu-computing-webinars
SYLLABUS
Page 3
by David B. Kirk & Wen-mei W. Hwu,
http://docs.nvidia.com/cuda/index.html
Purpose GPU Programming” by
“Multicore Processors and Systems” by Keckler, Olukotun, &Hofstee
http://developer.download.nvidia.com/compute/cuda/2_1/toolkit/docs/
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Cryptography and Network Security
Course Code CP115
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
At the end of the course, Students will be able to:
Understandbasic security concepts and applications.
Understand and apply
security.
Understandbasic web security principles
Identify andinvestigate
Understand and apply
Understand and implement
Identify security threats for given system and
Detailed Syllabus
Sr. No.
Name
1. Attacks & Computer SecurityNeed for Security, Security Approaches, Principles of Security, Types of Attacks, Virus, Worm, Trojan Horse, Cookies, Phishing, Pharming
2. Classical Encryption Techniques:Cryptography, Plain Text, Key, Cipher Text, Substitution Techniques, Transposition Techniques, Steganography
3. Private Key CryptographyIntroduction to Symmetric Key Cryptography, Types of Algorithms, Modes of Algorithms, Data Encryption Standard (DEAES, Diffie-Hellman Key Exchange Algorithm
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Cryptography and Network Security
CP115
Theory :03
Practical :01
Tutorial :00
Credits :04
Course Learning Outcomes:
course, Students will be able to:
basic security concepts and applications.
apply classical and modern encryption techniques to provide
basic web security principles.
investigatesystem threats.
various authentication applications for security.
implement important network security tools and mechanisms
security threats for given system and Design appropriate solution
Name of chapter & details
SECTION-I
Attacks & Computer Security: Need for Security, Security Approaches, Principles of Security, Types of Attacks, Virus, Worm, Trojan Horse, Cookies, Phishing, Pharming
Classical Encryption Techniques: Cryptography, Plain Text, Key, Cipher Text, Substitution Techniques, Transposition Techniques, Steganography
Private Key Cryptography Introduction to Symmetric Key Cryptography, Types of Algorithms, Modes of Algorithms, Data Encryption Standard (DES), Double DES, Triple DES,
Hellman Key Exchange Algorithm
SYLLABUS
Page 1
classical and modern encryption techniques to provide
various authentication applications for security..
important network security tools and mechanisms.
appropriate solution.
Hours Allotted
Need for Security, Security Approaches, Principles of Security, Types of Attacks, Virus, Worm, Trojan Horse, Cookies, Phishing, Pharming
04
Cryptography, Plain Text, Key, Cipher Text, Substitution Techniques, 04
Introduction to Symmetric Key Cryptography, Types of Algorithms, Modes S), Double DES, Triple DES,
04
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
4. Number Theory: Prime And Relative Prime Numbers, Modular Arithmetic, Euler’s Theorem, Euclid’s Algorithm, Discrete Logarithm Tics
5. Public Key CryptographyIntroduction to Asymmetric Key Cryptography, Overview of Asymmetric Key Cryptography, RSA Algorithm, Elliptic Curve Cryptosystems, Comparison of Symmetric Key Cryptography and Asymmetric Key Cryptography
6. Integrity, Authentication and NonHash Functions, Message Authentication Code, Digital Signature, HMAC
7. Public Key Infrastructure: Digital Certificates, X.509 Directory Authentication Service, Kerberos
8. Web Security: Web Security Considerations, Secure socket layers and Transport Layer Security. Secure Electronic Transaction, EPrivacy, S/MIME (Secure/Multipurpose Mail Extension)
9. Internet Security Protocol:SSL, Email Security: PGP,
10. Intrusion: Intruders, Audit Records, Intrusion Detection, Distributed Intrusion Detection, Honeyports
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multietc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval
Minimum eight experiments shall be there in the laboratory in which ciphers will be taught.
Minimum one experiments shall be there in the laboratory in which project will be given.
Reference Books:
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Prime And Relative Prime Numbers, Modular Arithmetic, Euler’s Theorem, Euclid’s Algorithm, Discrete Logarithm Tics
Public Key Cryptography Asymmetric Key Cryptography, Overview of Asymmetric
Key Cryptography, RSA Algorithm, Elliptic Curve Cryptosystems, Comparison of Symmetric Key Cryptography and Asymmetric Key
SECTION-II
Integrity, Authentication and Non-Repudiation: Hash Functions, Message Authentication Code, Digital Signature, HMAC
Public Key Infrastructure: Digital Certificates, X.509 Directory Authentication Service, Kerberos
Web Security Considerations, Secure socket layers and Transport Layer Security. Secure Electronic Transaction, E-mail Security: Pretty Good Privacy, S/MIME (Secure/Multipurpose Mail Extension)
Internet Security Protocol: SSL, Email Security: PGP, S/MIME, IP Security
Intruders, Audit Records, Intrusion Detection, Distributed Intrusion
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media projector, etc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval Minimum eight experiments shall be there in the laboratory in which ciphers will be
mum one experiments shall be there in the laboratory in which project will be
SYLLABUS
Page 2
Prime And Relative Prime Numbers, Modular Arithmetic, 04
Asymmetric Key Cryptography, Overview of Asymmetric Key Cryptography, RSA Algorithm, Elliptic Curve Cryptosystems, Comparison of Symmetric Key Cryptography and Asymmetric Key
05
Total 21
Hash Functions, Message Authentication Code, Digital Signature, HMAC 05
Digital Certificates, X.509 Directory Authentication Service, Kerberos 04
Web Security Considerations, Secure socket layers and Transport Layer mail Security: Pretty Good
05
04
Intruders, Audit Records, Intrusion Detection, Distributed Intrusion 03
Total 21
media projector, blackboard, OHP etc. Assignments based on course contents will be given to the students at the end of
Minimum eight experiments shall be there in the laboratory in which ciphers will be
mum one experiments shall be there in the laboratory in which project will be
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
William Stallings, Cryptography and Network Security, Pearson, 4Cryptography and Network Security by
Forouzan, Cryptography and Network Security, Tata MacGrew Hill, 2 Mark Ciampa,Security + Guide to Network Security Fundamentals, Cengage
Learning, 4th edition. D. Denning, Cryptography and Data Security, Addison Uyless Black, Internet Security Protocols,Pearson Education, 2 AtulKahate, Cryptography and Network Security, Tata MacGrew Hill, 3 Richard Smith,Internet and Cryptography, Addision
Additional Resources
NPTEL video lectures of Cryptography and Network Security course of Computer
Science and Engineering by Dr. Debdeep Mukhopadhyay, IIT Kharagpur.
NPTEL video lectures of Computer Security and Cryptography Computer Science and Engineering by
SEM COMPUTER ENGINEERING (2018-20 BATCH)
William Stallings, Cryptography and Network Security, Pearson, 4Cryptography and Network Security by
, Cryptography and Network Security, Tata MacGrew Hill, 2Mark Ciampa,Security + Guide to Network Security Fundamentals, Cengage
D. Denning, Cryptography and Data Security, Addison-Wesley, 2Black, Internet Security Protocols,Pearson Education, 2nd
AtulKahate, Cryptography and Network Security, Tata MacGrew Hill, 3Richard Smith,Internet and Cryptography, Addision-Wesley
NPTEL video lectures of Cryptography and Network Security course of Computer
Science and Engineering by Dr. Debdeep Mukhopadhyay, IIT Kharagpur.
NPTEL video lectures of Computer Security and Cryptography Computer Science and Engineering by Prof. Bernard Menezes, IIT Bombay.
SYLLABUS
Page 3
William Stallings, Cryptography and Network Security, Pearson, 4th edition
, Cryptography and Network Security, Tata MacGrew Hill, 2nd Edition Mark Ciampa,Security + Guide to Network Security Fundamentals, Cengage
Wesley, 2nd edition nd edition.
AtulKahate, Cryptography and Network Security, Tata MacGrew Hill, 3rd Edition
NPTEL video lectures of Cryptography and Network Security course of Computer
Science and Engineering by Dr. Debdeep Mukhopadhyay, IIT Kharagpur.
NPTEL video lectures of Computer Security and Cryptography – I course of Prof. Bernard Menezes, IIT Bombay.
2019-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Cyber Forensic
Course Code CP909
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
At the end of the course, students will be
Understand the ethics and legality of hacking.
Understand Computer forensic and
specialist.
Identify different computer forensic technology.
Comparison of different t
Analyzing Evidence collection techniques.
Detailed Syllabus
Sr. No.
Name of chapter & details
1. Introduction to Ethical Hacking, Ethics, and Legality Ethical Hacking Terminology, Different Types of Hacking Technologies, Different Phases Involved in Ethical Hacking and Stages of Ethical Hacking: Passive and Active Reconnaissance, Scanning, Gaining Access, Maintaining Access, Covering Tracks, Hacktivism, Classes, Skills Required to Become an Ethical Hacker, Vulnerability Research, Ways to Conduct Ethical Hacking, Creating a Security Evaluation Plan,Types of Ethical Hacks, Testing Types, Ethical Hacking Report.
2. Computer forensics fundamentalsIntroduction to computer forensics, use of computer forensics in law enforcement, computer forensics assistance to human resources/employment proceedings, computer forensics services, benefits of professional forensics methodology, steps forensics specialists
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Cyber Forensic
CP909
Theory :03
Practical :02
Tutorial :00
Credits :04
Course Learning Outcomes:
At the end of the course, students will be able to:
the ethics and legality of hacking.
Computer forensic and describe important and role of forensic
different computer forensic technology.
of different types of computer forensics systems.
Evidence collection techniques.
Name of chapter & details
SECTION-I
Introduction to Ethical Hacking, Ethics, and Legality Ethical Hacking Terminology, Different Types of Hacking Technologies, Different Phases Involved in Ethical Hacking and Stages of Ethical Hacking: Passive and Active Reconnaissance, Scanning, Gaining Access, Maintaining Access, Covering Tracks, Hacktivism, Types of Hacker Classes, Skills Required to Become an Ethical Hacker, Vulnerability Research, Ways to Conduct Ethical Hacking, Creating a Security Evaluation Plan,Types of Ethical Hacks, Testing Types, Ethical Hacking
fundamentals Introduction to computer forensics, use of computer forensics in law enforcement, computer forensics assistance to human resources/employment proceedings, computer forensics services, benefits of professional forensics methodology, steps taken by computer
SYLLABUS
Page 1
important and role of forensic
Hours Allotted
Ethical Hacking Terminology, Different Types of Hacking Technologies, Different Phases Involved in Ethical Hacking and Stages of Ethical Hacking: Passive and Active Reconnaissance, Scanning, Gaining Access,
Types of Hacker Classes, Skills Required to Become an Ethical Hacker, Vulnerability Research, Ways to Conduct Ethical Hacking, Creating a Security Evaluation Plan,Types of Ethical Hacks, Testing Types, Ethical Hacking
05
Introduction to computer forensics, use of computer forensics in law enforcement, computer forensics assistance to human resources/employment proceedings, computer forensics services,
taken by computer
08
2019-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
3. Types of ComputerForensics TechnologyTypes of Military Computer Forensic Technology, Types of Law Enforcement: Computer Forensic Technology, Types of Business Computer Forensic Technology, Specialized ForensiHidden Data and How to Find It, Spyware and Adware, Encryption Methods and Vulnerabilities, Protecting Data from Being Compromised Internet Tracing Methods, Security and Wireless Technologies, Avoiding Pitfalls with Firewalls Biometric Secu
4. Types of Computer Forensics SystemsInternet Security Systems, Intrusion Detection Systems, Firewall Security Systems, Storage Area Network Security Systems, Network Disaster Recovery Systems, Public Key Security Systems, Satellite Encryption Security Systems, Instant Messaging (IM) Security Systems, Net Privacy Systems, Identity Management Security Systems, Identity Theft, Biometric Security Systems
5. Evidence Collection and Data SeizureWhy Collect Evidence, Collection Options Obstacles, Types of Evidence, The Rules of Evidence, Volatile Evidence, General Procedure, Collection and Archiving, Methods of Collection, Artifacts, Collection Steps, Controlling Contamination: The Chain of Custody, Reconstructing the Attack, The digital crime scene, Investigating Cybercrime, Duties Support Functions and Competencies.
6. Identification of Data Timekeeping, Forensic Identification and Analysis of Technical Surveillance Devices, Reconstructing Past Events: How to Become a Digital Detective, Useable File Formats, Unusable File Formats, Converting Files, Investigating Network Intrusions and Cyber Network Forensics and Investigating logs, Investigating network Traffic, Investigating Web attacks, Router Forensics. Cyber forensics tools and case studies.
Instructional Method and Pedagogy:
Lectureswillbeconductedwiththeaidof Thecourseincludestutorials,wherestudentshaveanopportunityt
for the concepts being taugh Assignmentsbasedoncoursecontentwillbegiventothestudentsat
eachunit/topicandwillbeevaluatedat
Reference Books:
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Types of ComputerForensics Technology Types of Military Computer Forensic Technology, Types of Law Enforcement: Computer Forensic Technology, Types of Business Computer Forensic Technology, Specialized Forensics Techniques, Hidden Data and How to Find It, Spyware and Adware, Encryption Methods and Vulnerabilities, Protecting Data from Being Compromised Internet Tracing Methods, Security and Wireless Technologies, Avoiding Pitfalls with Firewalls Biometric Security Systems
SECTION-II
Types of Computer Forensics Systems Internet Security Systems, Intrusion Detection Systems, Firewall Security Systems, Storage Area Network Security Systems, Network Disaster Recovery Systems, Public Key Infrastructure Systems, Wireless Network Security Systems, Satellite Encryption Security Systems, Instant Messaging (IM) Security Systems, Net Privacy Systems, Identity Management Security Systems, Identity Theft, Biometric Security Systems
Collection and Data Seizure Why Collect Evidence, Collection Options Obstacles, Types of Evidence, The Rules of Evidence, Volatile Evidence, General Procedure, Collection and Archiving, Methods of Collection, Artifacts, Collection Steps,
amination: The Chain of Custody, Reconstructing the Attack, The digital crime scene, Investigating Cybercrime, Duties Support Functions and Competencies.
Timekeeping, Forensic Identification and Analysis of Technical Surveillance Devices, Reconstructing Past Events: How to Become a Digital Detective, Useable File Formats, Unusable File Formats, Converting Files, Investigating Network Intrusions and Cyber Network Forensics and Investigating logs, Investigating network Traffic, Investigating Web attacks, Router Forensics. Cyber forensics tools and
Instructional Method and Pedagogy:
Lectureswillbeconductedwiththeaidofmulti –media projector,blackboarThecourseincludestutorials,wherestudentshaveanopportunitytopractice the examples for the concepts being taughtinlectures. Assignmentsbasedoncoursecontentwillbegiventothestudentsat theendof eachunit/topicandwillbeevaluatedatregularinterval.
SYLLABUS
Page 2
Types of Military Computer Forensic Technology, Types of Law Enforcement: Computer Forensic Technology, Types of Business
cs Techniques, Hidden Data and How to Find It, Spyware and Adware, Encryption Methods and Vulnerabilities, Protecting Data from Being Compromised Internet Tracing Methods, Security and Wireless Technologies, Avoiding
08
Total 21
Internet Security Systems, Intrusion Detection Systems, Firewall Security Systems, Storage Area Network Security Systems, Network Disaster
Infrastructure Systems, Wireless Network Security Systems, Satellite Encryption Security Systems, Instant Messaging (IM) Security Systems, Net Privacy Systems, Identity Management Security Systems, Identity Theft, Biometric Security Systems
07
Why Collect Evidence, Collection Options Obstacles, Types of Evidence, The Rules of Evidence, Volatile Evidence, General Procedure, Collection and Archiving, Methods of Collection, Artifacts, Collection Steps,
amination: The Chain of Custody, Reconstructing the Attack, The digital crime scene, Investigating Cybercrime, Duties Support
07
Timekeeping, Forensic Identification and Analysis of Technical Surveillance Devices, Reconstructing Past Events: How to Become a Digital Detective, Useable File Formats, Unusable File Formats, Converting Files, Investigating Network Intrusions and Cyber Crime, Network Forensics and Investigating logs, Investigating network Traffic, Investigating Web attacks, Router Forensics. Cyber forensics tools and
07
Total 21
kboard. practice the examples
heendof
2019-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
1. John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition,
Charles River Media, 2005
2. ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and
Practitioners, 2nd Edition, Springer’s, 2010
3. Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures
for Ethical Hackers & IT Security Experts, Ali Jahangiri, 2009
4. Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec
Series: Computer Forensics), 2010
Additional Resources
SEM COMPUTER ENGINEERING (2018-20 BATCH)
John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition,
Charles River Media, 2005
ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and
Edition, Springer’s, 2010
Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures
for Ethical Hackers & IT Security Experts, Ali Jahangiri, 2009
Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec
Series: Computer Forensics), 2010
SYLLABUS
Page 3
John R. Vacca, Computer Forensics: Computer Crime Scene Investigation, 2nd Edition,
ChristofPaar, Jan Pelzl, Understanding Cryptography: A Textbook for Students and
Ali Jahangiri, Live Hacking: The Ultimate Guide to Hacking Techniques & Countermeasures
Computer Forensics: Investigating Network Intrusions and Cyber Crime (Ec-Council Press
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Digital Image Processing
Course Code CP906
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
On the completion of the course, To know the basic of Digital Image processing
Student can understand issues regarding image enhancement techniques.
Student can understand issues regarding image restoration procedures.
Student can knows
compression.
Student can do research on image segmentation and representation and
compression.
Detailed Syllabus
Sr. No.
Name of chapter & details
1. DIGITAL IMAGE FUNDAMENTALS Elements of visual perception, Image sampling and quantization Basic relationship between pixels, Basic geometric transformations, Introduction to Fourier Transform and DFT, Properties of 2D Fourier Transform, FFT, Separable Image TransformsTransform, Haar, Slant
2. IMAGE ENHANCEMENT TECHNIQUESSpatial Domain methods: Basic grey level transformation, Histogram equalization, Image subtraction, Image averaging, Spatial filtering: Smoothing, sharpening filters, Laplacian filters, Frequency domain filters : Smoothing, Sharpening filters, Homomorphic
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Digital Image Processing
CP906
Theory :03
Practical :03
Tutorial :00
Credits :04
Course Learning Outcomes:
On the completion of the course, students will be able: To know the basic of Digital Image processing.
Student can understand issues regarding image enhancement techniques.
Student can understand issues regarding image restoration procedures.
about principal and techniques of advance image
can do research on image segmentation and representation and
Name of chapter & details
SECTION-I
FUNDAMENTALS AND TRANSFORMS Elements of visual perception, Image sampling and quantization Basic relationship between pixels, Basic geometric transformations, Introduction to Fourier Transform and DFT, Properties of 2D Fourier Transform, FFT, Separable Image Transforms, Walsh – Hadamard, Discrete Cosine Transform, Haar, Slant – Karhunen – Loeve transforms.
IMAGE ENHANCEMENT TECHNIQUES Spatial Domain methods: Basic grey level transformation, Histogram equalization, Image subtraction, Image averaging, Spatial filtering: Smoothing, sharpening filters, Laplacian filters, Frequency domain filters : Smoothing, Sharpening filters, Homomorphic filtering.
SYLLABUS
Page 1
Student can understand issues regarding image enhancement techniques.
Student can understand issues regarding image restoration procedures.
about principal and techniques of advance image
can do research on image segmentation and representation and
Hours Allotted
Elements of visual perception, Image sampling and quantization Basic relationship between pixels, Basic geometric transformations, Introduction to Fourier Transform and DFT, Properties of 2D Fourier Transform, FFT,
Hadamard, Discrete Cosine Loeve transforms.
08
Spatial Domain methods: Basic grey level transformation, Histogram equalization, Image subtraction, Image averaging, Spatial filtering: Smoothing, sharpening filters, Laplacian filters, Frequency domain filters :
10
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
3. IMAGE RESTORATIONModel of Image Degradation/restoration process, Noise models, Inverse filtering, Least mean square filtering, Constrained least mean square filtering, Blind image restoration, Pseudo inverse, Singular value decomposition.
4. Wavelets and Multi-resolution ProcessingImage pyramids, subbandWavelet transforms.
5. IMAGE COMPRESSION Lossless compression: Variable length coding, LZW coding, Bit plane coding, predictive coding, DPCM.Lossy Compression: Transform coding compression standards: JPEG, MPEG,Basics of Vector quantization.
6. IMAGE SEGMENTATION AND REPRESENTATIONEdge detection, Thresholding, Region Based segmentation, Boundary representation: chair codes, Polygonal approximation, Boundary segments, boundary descriptors: Simple descriptors, Fourier descriptors , Regional descriptors, Simple descriptors, Texture.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of blackboard, OHP etc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluatedinterval
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
each head
Reference Books:
Rafael C Gonzalez, Richard E Woods 2nd Edition,
Pearson Education 2003.
William K Pratt, Digital Image Processing
Image Processing Analysis and
Roger Boyle, Broos/colic, Thompson Learniy (1999).
A.K. Jain, PHI, New Delhi (1995)
SEM COMPUTER ENGINEERING (2018-20 BATCH)
IMAGE RESTORATION Model of Image Degradation/restoration process, Noise models, Inverse
mean square filtering, Constrained least mean square filtering, Blind image restoration, Pseudo inverse, Singular value
SECTION-II
resolution Processing Image pyramids, subband coding, Harr transform; multi resolution expression,
Lossless compression: Variable length coding, LZW coding, Bit plane coding, predictive coding, DPCM.Lossy Compression: Transform coding – Wavelet coding, Basics of Image compression standards: JPEG, MPEG,Basics of Vector quantization.
IMAGE SEGMENTATION AND REPRESENTATION Edge detection, Thresholding, Region Based segmentation, Boundary representation: chair codes, Polygonal approximation, Boundary segments, boundary descriptors: Simple descriptors, Fourier descriptors , Regional descriptors, Simple descriptors, Texture.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media proAssignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
Rafael C Gonzalez, Richard E Woods 2nd Edition, “Digital Image Processing“
Pearson Education 2003.
Digital Image Processing John Willey (2001)
Image Processing Analysis and Machine Vision – MillmanSonka, Vaclav hlavac,
Roger Boyle, Broos/colic, Thompson Learniy (1999).
A.K. Jain, PHI, New Delhi (1995)-Fundamentals of Digital Image Processing
SYLLABUS
Page 2
Model of Image Degradation/restoration process, Noise models, Inverse mean square filtering, Constrained least mean square
filtering, Blind image restoration, Pseudo inverse, Singular value 10
Total 28
coding, Harr transform; multi resolution expression, 08
Lossless compression: Variable length coding, LZW coding, Bit plane coding, predictive coding, DPCM.
Wavelet coding, Basics of Image 10
Edge detection, Thresholding, Region Based segmentation, Boundary representation: chair codes, Polygonal approximation, Boundary segments, boundary descriptors: Simple descriptors, Fourier descriptors , Regional descriptors, Simple descriptors, Texture.
10
Total 28
ia projector, Assignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
“Digital Image Processing“-
MillmanSonka, Vaclav hlavac,
Digital Image Processing.
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Additional Resources
technolamp.blogspot.com
www.intelligentedu.com/
N.P.T.L. Video Lecture Series
N.I.T.T.I. Instructional Resources Videos.
SEM COMPUTER ENGINEERING (2018-20 BATCH)
technolamp.blogspot.com
www.intelligentedu.com/
N.P.T.L. Video Lecture Series
N.I.T.T.I. Instructional Resources Videos.
SYLLABUS
Page 3
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Embedded Systems
Course Code CP209
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
On the completion of the course,
Understand the design process and some of the related UML models.
Understand the interrupt
Understand memory systems: cache mapping, virtual memory, and address
translation.
Understand various system buses, protocols, and peripheral interaction
Implement and use various common software components of embedded systems
Understand the software compilation process and various compiler optimizations
Understand context switching and sc
operating systems.
Analyze performance at the CPU, platform, and program levels, and to optimize
various aspects of embedded programs.
Develop ARM-based bare
Detailed Syllabus
Sr. No.
Name of chapter & details
1. Introduction to Embedded Systems. Introduction to embedded systems; requirements analysis; specifications; design methodologiesoverview
2. Microcontroller OrganizationStudy Computer Machines)organization, ARM instruction set, data operations, control flow,PIC (Peripheral Interface Controller
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Embedded Systems
CP209
Theory :04
Practical :01
Tutorial :00
Credits :05
Course Learning Outcomes:
e course, students will be able to:
the design process and some of the related UML models.
the interrupt mechanism and develop interruptdriven C programs.
memory systems: cache mapping, virtual memory, and address
various system buses, protocols, and peripheral interaction
and use various common software components of embedded systems
the software compilation process and various compiler optimizations
context switching and scheduling of periodic processes in real
performance at the CPU, platform, and program levels, and to optimize
various aspects of embedded programs.
based bare-metal embedded software in C.
Name of chapter & details
SECTION-I
Embedded Systems. Introduction to embedded systems; requirements analysis; specifications; design methodologiesoverview.
Microcontroller Organization. Computer architectures, ARM (Advanced RISC
, ARM instruction set, data operations, control Peripheral Interface Controller), TI (Texas Instruments
SYLLABUS
Page 1
the design process and some of the related UML models.
develop interruptdriven C programs.
memory systems: cache mapping, virtual memory, and address
various system buses, protocols, and peripheral interaction.
and use various common software components of embedded systems.
the software compilation process and various compiler optimizations.
heduling of periodic processes in real-time
performance at the CPU, platform, and program levels, and to optimize
Hours Allotted
Introduction to embedded systems; requirements analysis; 4
Advanced RISC , ARM instruction set, data operations, control
Texas Instruments) DSPs.
6
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
3. CPUs. I/O and memory mapping, addressing modes, interrupts and traps, caches, co-processors, memory management unit, virtual memory, address translation, CPU performance, pipelining.
4. Embedded Platforms. Hardware and software components of embedded platforms, bus protocols, DMA, system busmemory devices, example embedded memory performance, performance bottleneck.
5. Program Design and AnalysisState machines, circular buffers, queues, models compilation process, programperformance and optimization, power analysis, program size analysis, validation and testing.
6. Processes and Operating SystemsTasks and processes, process timing requirements, realsystems, pre-emptive execution, context switching, scheduling rocesses, priority scheduling, intermemory systems, message passing.
7. Networks and MultiprocessorsMultiprocessor systems, distributed embedded systems, CAN bus, I2C bus, multiprocessorsystem
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of etc. Assignments based on course contents will be given to the each unit/topic and will be evaluated at regular interval
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
each head
SEM COMPUTER ENGINEERING (2018-20 BATCH)
I/O and memory mapping, addressing modes, interrupts and traps, processors, memory management unit, virtual memory,
address translation, CPU performance, pipelining.
Hardware and software components of embedded platforms, bus protocols, DMA, system busconfigurations, the AMBA and AHB buses, memory devices, example embedded platforms, bandwidth, bus and memory performance, performance bottleneck.
SECTION-II
Program Design and Analysis. State machines, circular buffers, queues, models of programs, the compilation process, programperformance and optimization, power analysis, program size analysis, validation and testing.
Processes and Operating Systems Tasks and processes, process timing requirements, real-time operating
emptive execution, context switching, scheduling rocesses, priority scheduling, inter-process communication, sharedmemory systems, message passing.
Networks and Multiprocessors Multiprocessor systems, distributed embedded systems, CAN bus, I2C bus, multiprocessorsystem-on-chip (MPSoC), accelerators
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media projectAssignments based on course contents will be given to the students at the end of
each unit/topic and will be evaluated at regular interval Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
SYLLABUS
Page 2
I/O and memory mapping, addressing modes, interrupts and traps, processors, memory management unit, virtual memory,
8
Hardware and software components of embedded platforms, bus configurations, the AMBA and AHB buses,
, bus and 10
Total 28
of programs, the compilation process, programperformance and optimization, power
08
time operating emptive execution, context switching, scheduling
process communication, shared-10
Multiprocessor systems, distributed embedded systems, CAN bus, I2C 10
Total 28
ctor, blackboard, OHP students at the end of
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Reference Books:
Wayne Wolf, "Computers as Components: Principles of Embedded Computing
System Design", Third Edition, Morgan Kaufmann, 2012.
Morgan Kaufmann,” Computers as Components: Principles of Embedded
Computing System Design”, Wayne Wolf, 2nd
Frank Vahid and Tony Givargis,”Embedded System Design: A Unified Hardware
Software Approach.
Michael J. Pont, “Embedded C”, Pearson
Additional Resources
Important Web links for Embedded System Design Paper
http://ais.gmd.de/~wilberg/desktop/paper/DAES/TeX/README.html
http://www.jpsco.com/site.nsf/key/jps_y2k_embed_sys
http://www.webopedia.com/TERM/E/embedded_system.html
Video Lectures on Embedded Systems
NPTEL Embedded Systems from IIT Delhi:
http://nptel.ac.in/courses/108102045/25
Important Blogs on Embedded Systems.
https://www.embeddedrelated.com/blogs.phphttps://blogs.mentor.com/embedded/blog/2017/01/03/topsystems-design-blogs
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Wayne Wolf, "Computers as Components: Principles of Embedded Computing
System Design", Third Edition, Morgan Kaufmann, 2012.
Morgan Kaufmann,” Computers as Components: Principles of Embedded
Computing System Design”, Wayne Wolf, 2nd Edition.
Frank Vahid and Tony Givargis,”Embedded System Design: A Unified Hardware
Michael J. Pont, “Embedded C”, Pearson Education, 2007.
Important Web links for Embedded Systems. Embedded System Design Paper
http://ais.gmd.de/~wilberg/desktop/paper/DAES/TeX/README.html
http://www.jpsco.com/site.nsf/key/jps_y2k_embed_system.
http://www.webopedia.com/TERM/E/embedded_system.html
Embedded Systems available at below links:
NPTEL Embedded Systems from IIT Delhi: NPTEL Embedded Systems from IIT Delhi
http://nptel.ac.in/courses/108102045/25
Embedded Systems.
https://www.embeddedrelated.com/blogs.php https://blogs.mentor.com/embedded/blog/2017/01/03/top-10
blogs-in-2016/
SYLLABUS
Page 3
Wayne Wolf, "Computers as Components: Principles of Embedded Computing
Morgan Kaufmann,” Computers as Components: Principles of Embedded
Frank Vahid and Tony Givargis,”Embedded System Design: A Unified Hardware
available at below links:
NPTEL Embedded Systems from IIT Delhi
10-embedded-
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Real Time Operating System
Course Code CP905 (Elective I)
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
At the end of the course, students will be able to:
Understand real-time Operating System requirements and application in control
system design.
Comparison of different real time system.
Design of different model and understand design issues.
Categorize different scheduli
Understand design of commercial real time operating system.
Detailed Syllabus
Sr. No.
Name of chapter & details
1. Introduction: Real-time systems, Properties, requirement, highapplication.
2. Hard versus Soft Real-Jobs and Processors, release time, deadlines, and timing constraints, hard and soft timing constraints, hard real
3. Model of Real-Time Systems:Processors and resources, Parameters of real time workload, Periodic task Model, Aperiodic and Sporadic Tasks, Precedence constraints and data dependency, Other types of dependencies, functional Parameters, resource parameters of jobs and paramete
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Real Time Operating System
CP905 (Elective I)
Theory :03
Practical :01
Tutorial :00
Credits :04
Course Learning Outcomes:
course, students will be able to:
time Operating System requirements and application in control
of different real time system.
of different model and understand design issues.
different scheduling approaches for real time scheduler.
design of commercial real time operating system.
Name of chapter & details
SECTION-I
time systems, Properties, requirement, high-level control, real time
Time System: Jobs and Processors, release time, deadlines, and timing constraints, hard and soft timing constraints, hard real-time systems, soft real time system.
Systems: Processors and resources, Parameters of real time workload, Periodic task Model, Aperiodic and Sporadic Tasks, Precedence constraints and data dependency, Other types of dependencies, functional Parameters, resource parameters of jobs and parameters of resources. .
SYLLABUS
Page 1
time Operating System requirements and application in control
ng approaches for real time scheduler.
Hours Allotted
control, real time 04
Jobs and Processors, release time, deadlines, and timing constraints, hard time systems, soft real time system.
06
Processors and resources, Parameters of real time workload, Periodic task Model, Aperiodic and Sporadic Tasks, Precedence constraints and data dependency, Other types of dependencies, functional Parameters,
06
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
4. Approaches for Real-Time System:Clock-driven approach, weighted roundapproach, Dynamic versus Static system, Effective release times and deadlines, optimality of the EDF and LST Algorithms, EDF and the LST Algorithms, Challenges in validating timing constraints in priority-driven systems, off
5. Clock-Driven scheduling:Static timer-driven scheduler, structure of executives, improving the average response time of aperiodic jobs, scheduling sporadic jobs, algorithm for constructing static schedules.
6. Priority-Driven scheduling of periodic task:Fixed-priority, dynamic priority algorithm, ratemonotonic algorithm, EDF algorithm, optimality of the RM and DM Algorithm.
7. Resources and Resource Access Control:Resource contention and resource access control, Basic PriorityInheritance Protocol, Basic Priority ceiling Protocol.
8. Real time operating system design:The kernel, time service and scheduling mechanisms, other basic operating system functions, commercial real-time operating systems.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of blackboard, OHP etc. Assignments based on course to the students at the end of each unit/topic and will be evaluated at regular interval
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum
each head
Reference Books:
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Time System: driven approach, weighted round-robin approach, priority driven
approach, Dynamic versus Static system, Effective release times and deadlines, optimality of the EDF and LST Algorithms, nonoptimality of the EDF and the LST Algorithms, Challenges in validating timing constraints in
driven systems, off-line versus on-line scheduling.
SECTION-II
Driven scheduling: driven scheduler, structure of cyclic schedules, cyclic
executives, improving the average response time of aperiodic jobs, scheduling sporadic jobs, algorithm for constructing static schedules.
Driven scheduling of periodic task: priority, dynamic priority algorithm, rate-monotonic and Deadline
monotonic algorithm, EDF algorithm, optimality of the RM and DM
Resources and Resource Access Control: Resource contention and resource access control, Basic PriorityInheritance Protocol, Basic Priority ceiling Protocol.
Real time operating system design: The kernel, time service and scheduling mechanisms, other basic operating system functions, operating system architecture, capabilities of
time operating systems.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media proAssignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
SYLLABUS
Page 2
robin approach, priority driven approach, Dynamic versus Static system, Effective release times and
nonoptimality of the EDF and the LST Algorithms, Challenges in validating timing constraints in
05
Total 21
cyclic schedules, cyclic executives, improving the average response time of aperiodic jobs, scheduling sporadic jobs, algorithm for constructing static schedules.
05
monotonic and Deadline monotonic algorithm, EDF algorithm, optimality of the RM and DM
06
Resource contention and resource access control, Basic Priority- 06
The kernel, time service and scheduling mechanisms, other basic operating system architecture, capabilities of
04
Total 21
ia projector, contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
Minimum five experiments shall be there in the laboratory related to course contents
five computer programs in
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Jane W.S. Liu, Real Time System, 6 Doug Abbott , Linux for Embe
Publications Chowdary Venkateswara
Publishing, Qing Li, Caroline Yao, Real Phillip A. Laplante, Real
Additional Resources
NPTEL video Lectures on Real Time Systems, IIT Kharagpur by Prof. Rajib Mall.
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Jane W.S. Liu, Real Time System, 6th Edition, Pearson Education.Doug Abbott , Linux for Embedded and Real-Time applications, 3
Chowdary VenkateswaraPenumuchu, Simple Real-time Operating System
Qing Li, Caroline Yao, Real-Time Concepts for Embedded SystemsPhillip A. Laplante, Real-Time Systems Design and Analysis, Wiley Publishers
NPTEL video Lectures on Real Time Systems, IIT Kharagpur by Prof. Rajib Mall.
SYLLABUS
Page 3
Edition, Pearson Education. Time applications, 3rd Edition, Newnes
time Operating System, Trafford
Time Concepts for Embedded Systems, CRC Press , Wiley Publishers
NPTEL video Lectures on Real Time Systems, IIT Kharagpur by Prof. Rajib Mall.
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Service Oriented Architecture
Course Code CP200
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
At the end of the course, students will be able to:
Understand and describe Understand and describe
implementations
Effectively use market-services
Identify and select the appropriate framework components in the creation of web service solutions
Apply object-oriented programming principles to the creation of web service solutions
Analyze the requirements of a mediumsoftware that meets the requirements
Detailed Syllabus
Sr. No.
Name of chapter & details
1. UNIT I Roots of SOA – Characteristics of SOA and distributed internet architectures in an SOA interrelate - Principles of service orientation
2. UNIT II Web services – Service descriptions exchange Patterns – Coordination activities – Orchestration Application Service Layer Service Layer
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Service Oriented Architecture
CP200
Theory :03
Practical :01
Tutorial :00
Credits :04
Course Learning Outcomes:
students will be able to:
describe the principles of service oriented architecturedescribe the standards & technologies of modern web services
-leading development tools to create and
the appropriate framework components in the creation of web
oriented programming principles to the creation of web service
the requirements of a medium-difficulty programming task, andsoftware that meets the requirements.
Name of chapter & details
SECTION-I
Characteristics of SOA - Comparing SOA to clientarchitectures – Anatomy of SOA- How components
Principles of service orientation
Service descriptions – Messaging with SOAP –Message Coordination –Atomic Transactions – Business
Orchestration –Choreography - Service layer abstraction Application Service Layer – Business Service Layer – Orchestration
SYLLABUS
Page 1
the principles of service oriented architecture
the standards & technologies of modern web services
leading development tools to create and consume web
the appropriate framework components in the creation of web
oriented programming principles to the creation of web service
gramming task, andcreate
Hours Allotted
Comparing SOA to client-server How components 07
Message Business
Service layer abstraction – Orchestration
07
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
3. UNIT III Service oriented analysis services- service modeling SOAP basics – SOA composition guidelines service design – Application service design service design
4. UNIT IV SOA platform basics – SOA support in J2EE web services (JAX-WS) API for XML Registries (JAXR) RPC)- Web Services Interoperability Technologies (WSIT) in .NET – Common Language Runtime web services – Web Services Enhancements (WSE).
5. UNIT V WS-BPEL basics – WS-Coordination overview Policy, WS Security
Instructional Method and
Lectures will be conducted with the aid of blackboard, OHP etc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be evaluated at regular interval
Minimum five experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
each head
Reference Books:
Thomas Erl, “Service-Oriented Architecture: Concepts, Technology, and Design”,Pearson Education, 2005
Thomas Erl, “SOA Principles of Service Design “(TheOriented Computing Series from Thomas Erl), 2005.
Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson Education,2005.
Sandeep Chatterjee, James Webber, “Developing Enterprise Web Services,AnArchitect’s Guide”, Pearson Education, 2005.
Dan Woods and Thomas Mattern, “ Enterprise SOA Designing IT for BusinessInnovation” O’REILLY, First Edition, 2006
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Service oriented analysis – Business-centric SOA – Deriving business modeling - Service Oriented Design – WSDL basics
SOA composition guidelines – Entity-centric business Application service design – Task centric business
SECTION-II
SOA support in J2EE – Java API for XML-WS) - Java architecture for XML binding (JAXB)
API for XML Registries (JAXR) - Java API for XML based RPC (JAXWeb Services Interoperability Technologies (WSIT) - SOA supp
Common Language Runtime - ASP.NET web forms – ASP.NET Web Services Enhancements (WSE).
Coordination overview - WS-Choreography, WS
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media proAssignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
Oriented Architecture: Concepts, Technology, and Design”,Pearson Education, 2005 Thomas Erl, “SOA Principles of Service Design “(The Prentice Hall Service
Computing Series from Thomas Erl), 2005. Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson
James Webber, “Developing Enterprise Web AnArchitect’s Guide”, Pearson Education, 2005.
Dan Woods and Thomas Mattern, “ Enterprise SOA Designing IT for BusinessInnovation” O’REILLY, First Edition, 2006
SYLLABUS
Page 2
Deriving business WSDL basics –
centric business Task centric business
07
Total 21
-based Java architecture for XML binding (JAXB) – Java
Java API for XML based RPC (JAX-SOA support
ASP.NET
12
Choreography, WS- 09
Total 21
ia projector, Assignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
experiments shall be there in the laboratory related to course contents
Minimum six tutorials which includes solution of minimum five computer programs in
Oriented Architecture: Concepts, Technology, and
Prentice Hall Service-
Newcomer, Lomow, “Understanding SOA with Web Services”, Pearson
James Webber, “Developing Enterprise Web
Dan Woods and Thomas Mattern, “ Enterprise SOA Designing IT for
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Additional Resources
SEM COMPUTER ENGINEERING (2018-20 BATCH)
SYLLABUS
Page 3
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Course Title Soft Computing
Course Code CP208
Course Credits
Theory
Practical
Tutorial
Credits
Course Learning Outcomes:
At the end of the course, students will be Understand importance of soft computing.
Understand different soft computing techniques like Genetic Algorithms, Fuzzy
Logic, Neural Networks and their combination.
Implement algorithms based on soft computing.
Apply soft computing techniques to solve engineering or real life problems.
Detailed Syllabus
Sr. No.
Name of chapter & details
1. Introduction to Soft Computing :Introduction, Fuzzy Computing, Neural Computing, Genetic Algorithms,Associative Memory, Adaptive Resonance Theory, Applications
2. Fundamentals of Neural Network :Introduction, Model of Artificial Neuron, Architectures, Learning Methods,Taxonomy of NN Systems, SingleApplications.
3. Back Propagation Network :Background, Back-Propagation Learning, Back
4. Associative Memory : Description, Auto-associative Memory, BiMemory
SEM COMPUTER ENGINEERING (2018-20 BATCH)
Soft Computing
CP208
Theory :03
Practical :01
Tutorial :00
Credits :04
Course Learning Outcomes:
At the end of the course, students will be able to: importance of soft computing.
different soft computing techniques like Genetic Algorithms, Fuzzy
Logic, Neural Networks and their combination.
algorithms based on soft computing.
soft computing techniques to solve engineering or real life problems.
Name of chapter & details
SECTION-I
Introduction to Soft Computing : Introduction, Fuzzy Computing, Neural Computing, Genetic Algorithms,Associative Memory, Adaptive Resonance Theory, Applications
Fundamentals of Neural Network : Introduction, Model of Artificial Neuron, Architectures, Learning Methods,Taxonomy of NN Systems, Single-Layer NN System,
Back Propagation Network : Propagation Learning, Back-Propagation Algorithm.
associative Memory, Bi-directional Hetero-associative
SYLLABUS
Page 1
different soft computing techniques like Genetic Algorithms, Fuzzy
soft computing techniques to solve engineering or real life problems.
Hours Allotted
Introduction, Fuzzy Computing, Neural Computing, Genetic Algorithms, 06
Introduction, Model of Artificial Neuron, Architectures, Learning Layer NN System, 07
Propagation Algorithm. 05
associative 03
Total 21
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
5. Adaptive Resonance Theory :Recap - supervised, unsupervised, backprop algorithms; CompetitiveLearning; Stability-Plasticity Dilemma (SPD), ART Networks, IterativeClustering, Unsupervised ART Clustering.
6. Fuzzy Set Theory : Introduction, Fuzzy set : Relations
7. Fuzzy Systems : Introduction, Fuzzy Logic, Fuzzification, Fuzzy Inference, Fuzzy RuleBased System, Defuzzification
8. Fundamentals of Genetic Algorithms :Introduction, Encoding, Operators ofAlgorithm.
9. Hybrid Systems : Integration of Neural Networks, Fuzzy Logic and Genetic Algorithms,GA Based Back Propagation Networks, Fuzzy Back Propagation Networks,Fuzzy Associative Memories, Simplified Fuzzy
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of blackboard, OHP etc. Assignments based on course contents will be given to the students at the end of each unit/topic and will be interval
Students will read research papers to study how soft computing techniques can be implemented to solve problems.
Students will present TWOimplement ONE of the TWO papers completely.
Reference Books:
Neural Networks, Fuzzy Logic and Genetic Algorithms:Synthesis &
Applications, S. Rajasekaran, G. A. Vijayalakshami, PHI.
Chin Teng Lin, C. S. George Lee,
TomthyRoss,Fuzzy Logic and Engineering Application, TMH
KishanMehrotra,Elements of Artificial Neural Network,
E. Goldberg,Genetic Algorithms: Search and Optimization,
Recent Articles and Research papers
SEM COMPUTER ENGINEERING (2018-20 BATCH)
SECTION-II
Theory : supervised, unsupervised, backprop algorithms; Competitive
Plasticity Dilemma (SPD), ART Networks, IterativeClustering, Unsupervised ART Clustering.
Membership, Operations, Properties; Fuzzy
Introduction, Fuzzy Logic, Fuzzification, Fuzzy Inference, Fuzzy RuleBased System, Defuzzification
Fundamentals of Genetic Algorithms : Introduction, Encoding, Operators of Genetic Algorithm, Basic Genetic
Integration of Neural Networks, Fuzzy Logic and Genetic Algorithms,GA Based Back Propagation Networks, Fuzzy Back Propagation Networks,Fuzzy Associative Memories, Simplified Fuzzy ARTMAP.
Instructional Method and Pedagogy:
Lectures will be conducted with the aid of multi-media proAssignments based on course contents will be given
to the students at the end of each unit/topic and will be evaluated at regular
Students will read research papers to study how soft computing techniques can be implemented to solve problems.
TWO papers in front of class and instructor. They will of the TWO papers completely.
Neural Networks, Fuzzy Logic and Genetic Algorithms:Synthesis &
Applications, S. Rajasekaran, G. A. Vijayalakshami, PHI.
Teng Lin, C. S. George Lee, Neuro-Fuzzy Systems, PHI
Logic and Engineering Application, TMH
KishanMehrotra,Elements of Artificial Neural Network, MIT Press
Genetic Algorithms: Search and Optimization, Addision-Wesley
Recent Articles and Research papers
SYLLABUS
Page 2
supervised, unsupervised, backprop algorithms; Competitive Plasticity Dilemma (SPD), ART Networks, Iterative 04
Membership, Operations, Properties; Fuzzy 05
Introduction, Fuzzy Logic, Fuzzification, Fuzzy Inference, Fuzzy Rule 02
Genetic Algorithm, Basic Genetic 03
Integration of Neural Networks, Fuzzy Logic and Genetic Algorithms, GA Based Back Propagation Networks, Fuzzy Back Propagation
ARTMAP.
07
Total 21
ia projector, Assignments based on course contents will be given
evaluated at regular
Students will read research papers to study how soft computing techniques
papers in front of class and instructor. They will
Wesley
2018-19 M. TECH 2nd SEM COMPUTER ENGINEERING (201
Additional Resources
SEM COMPUTER ENGINEERING (2018-20 BATCH)
SYLLABUS
Page 3