CMS-A-DSE-A--4-P: Multimedia and its Applications Lab. DSE-A: Choice-4: Practical, Credit:02, Contact hour: 40.

 Sample practical problems can be included related to theory.

CMS-A-DSE-A--4-TH: Multimedia and its Applications DSE-A: Choice-4, Theory, Credit:04, Contact hours: 60.

 Multimedia

Introduction to multimedia, Components, uses of multimedia.

04 hours

Making Multimedia

Stages of a multimedia project, requirements to make good multimedia, Multimedia

Hardware - Macintosh and Windows production Platforms, Hardware peripherals -

Connections, Memory and storage devices, Multimedia software and Authoring tools.

06 hours

Text

Fonts & Faces, Using Text in Multimedia, Font Editing & Design Tools, Hypermedia

& Hypertext.

04 hours

Images

Still Images – Bitmaps, Vector Drawing, 3D Drawing & rendering, Natural Light &

Colors, Computerized Colors, Color Palettes, Image File Formats.

06 hours

Sound

Digital Audio, MIDI Audio, MIDI vs Digital Audio, Audio File Formats.

06 hours

Video

How Video Works, Analog Video, Digital Video, Video File Formats, Video Shooting

and Editing.

06 hours

Animation

Principle of Animations. Animation Techniques, Animation File Formats.

08 hours

Multimedia System

An overview of multimedia system and media streams, Source representation and

compression techniques text, speech and audio, still image and video, Graphics and

animation.

10 hours

Multi-modal Communication

Video conferencing, networking support, Trans-coding.

CMS-A-DSE-A--3-P: Embedded Systems Lab. DSE-A: Choice-3, Practical, Credit: 02, Contact hours: 40 hours

 CMS-A-DSE-A--3-P: Embedded Systems Lab.

DSE-A: Choice-3, Practical, Credit: 02, Contact hours: 40 hours

Practical: Sample practical problems can be included related to theory.

1. Assembly Language Programming related to Microcontroller 8051.

2. Programming Using Embedded C for 8051.

3. VHDL programs for construction and simulation of various digital circuits.

CMS-A-DSE-A--3-TH: Embedded Systems DSE-A: Choice-3: Theory, Credit:04, Contact hours: 60.

 Introduction to 8051

Overview of Microcontroller, Memory, I/O interface

Intel Microcontroller 8051: Architecture, Peripheral Interface Controller (PIC).

15 hours

Assembly Language Programming

Instruction set, Addressing Modes, Jump, Loop and Call instructions, I/O Manipulation,

Serial communication, Arithmetic and logical instructions.

10 hours

Introduction to Embedded System Programming

Data types and time delays, I/O programming, Logic operations, Data conversions, Data

serialization, Interrupt programming, LCD and Keyboard interfacing, ADC, DAC,

sensors interfacing, interfacing 8255, I/O interfacing for 8051, interfacing 8255, 8257,

8259/ 8279, ADC, DAC, Motor control using 8051 C.

15 hours

Programmable logic devices and Hardware description Language

PAL, PLA, PLD, ASIC, FPGA (Qualitative study).

10 hours

Hardware Description Language (VHDL):

Basic Terminology, Entity Declaration, Architecture body, Configuration and package

declaration, Package body, Model analysis and Simulation.

Basic Language elements, Behavioral Model, Dataflow Model, Structural Model,

Subprogram and overloading, Applications.

CMS-A-CC-6-14-P: ProjectWork Core Course-14, Practical, Credit:04, Contact hours: 60.

 

Candidates have to do their project in any relevant topic, under the supervision

of teachers.

CMS-A-CC-6-14-TH: Theory of Computation. Core Course-14: Theory, Credit:04, Contact hours: 60.

 Finite Automata

Definition of a Finite Automaton, Model, Representation, Classification – with respect to

output function Mealy and Moore Machines, with respect to State Transition –

Deterministic and Non-Deterministic Machine, Examples, conversion algorithms Mealy

to Moore and Moore to Mealy, Finite and Infinite state machines, Finite Automaton,

Deterministic and Non-Deterministic Finite automaton, Non-Deterministic to equivalent

Deterministic Automaton-Optimized and Non-optimized technique ideas and algorithms,

Acceptability of String by a Finite Automaton.

15 hours

Formal Languages and Grammar

Introduction to Formal Grammar and Language, Chomsky’s Classification of Grammar –

Type-0, Type-1 or Context Sensitive, Type-2 or Context Free and Type-3 or Regular

Grammar, Illustration of each of these classes with example, Sentential form, Sentences –

Languages or strings, Derivations, Ambiguous Grammar and Language, Designing of

Grammar for a language, Find the Language for given Grammar, Definition and basic

idea about Push Down Automaton.

15 hours

Regular Expression:

Basic Idea and Definition, Regular Expression basic Identities, Arden’s Theorem –

Statement (without Proof) and application for reduction of equivalent regular expressions,

Regular expression to Finite Automata conversion, State Transition System to Regular

Expression conversion algorithm by Arden’s Algebraic Method, FA to Regular Grammar

and Regular Grammar to FA conversion algorithms and applications.

15 hours

Turing Machine

Concepts of Turing Machine, Formal Definitions, Classifications – Deterministic and

Non-Deterministic Turing Machines, Simple Design of Turing Machines: Odd / even

count and concepts of Universal Turing Machines, Difference and Similarities between

Turing Machine and a General Purpose Computer, Definition and significant of Halting

Problem in Turing Machine.

CMS-A-CC-6-13-TH: Software Engineering. Core Course-13: Theory, Credit:04, Contact hours 60.

 Introduction

Defining system, open and closed system, modeling of system through computer

hardware, communication systems, external agents and software systems; Importance of

Engineering Methodology towards computerization of a system.

03 hours

Software Life Cycle

Classical and Iterative Waterfall Model; Spiral Model; Prototype Model; Evolutionary

model and its importance towards application for different system representations,

Comparative Studies.

07 hours

Software Requirement and Specification Analysis

Requirements Principles and its analysis principles; Specification Principles and its

representations

Software Design Analysis – Different level of DFD Design, Physical and Logical DFD,

Use and Conversions between them, Decision Tables and Trees, Structured analysis,

Coupling and Cohesion of different modules

Software Cost Estimation Modeling –COCOMO.

23 hours

Software Testing

Software Verification and Validation; Testing objectives, Testing Principles, Testability;

Error and Faults; Unit Testing, White Box and Blank Box Testing, Test Case Design:

Test Vector, Test Stub.

17 hours

Software Quality Assurances

Concepts of Quality, Quality Control, Quality Assurance, IEEE Standard for Statistical

Software Quality Assurances (SSQA) criterions.

CMS-A-DSE-B--2-P: Python 3 Programming Lab. DSE-B: Choice-2, Practical, Credit: 02, Contact hours: 40 hours.

 Use Python 3.6 or above. Use a text editor sensitive to whitespace like Notepad++, gedit, vim,

Sublime Text, and NOT Notepad / WordPad. The following exercises are suggestive in nature.

1. The Interpreter as a calculator. Basic arithmetic operations. Introduction to the simple

numeric data types – integers, floating point numbers, Boolean, complex numbers.

Inter conversion of data types.

a. Use the Python prompt as a basic calculator. Explore the order of operations

using parentheses.

b. Explore the various functions in the math module. Eg: find GCD of two

numbers, area and perimeter of circle using math.pi, etc.

c. Exploring the complex data type and their operations, eg: finding the modulus

and phase angle of a complex number.

d. The print function – Printing values. Repeat the previous experiments now

using the print function

2. Basic user interactions using the print() and input() functions.

a. Write a simple python script using the print function in a text editor, save it

with the extension “.py”. Run it in the terminal / command prompt.

b. Take input two strings from the user, and print the first one twice, and the

other one thrice.

c. Ask the user to enter two numbers, and output the sum, product, difference,

and the GCD.

d. More programs that test concepts learned in week 1 which involves the usage

of the print and input functions.

3. Strings, List, Tuples, the re (regular expression) module

a. Ask the user for two strings, print a new string where the first string is

reversed, and the second string is converted to upper case. Sample strings:

“Pets“, “party”, output: “steP PARTY”. Only use string slicing and +

operators.

b. From a list of words, join all the words in the odd and even indices to form

two strings. Use list slicing and join methods.

c. Simulate a stack and a queue using lists. Note that the queue deletion

operation won’t run in O(1) time.

d. Explore the ‘re’ module, especially re.split, re.join, re.search and re.match

methods.

4. Conditionals, looping constructs, and generators

a. Use list comprehension to find all the odd numbers and numbers divisible by

3 from a list of numbers.

b. Using while loops to do Gaussian addition on a list having an even number of

numbers. Print each partial sum. Eg: if the list is [1, 2, 3, 4, 5, 6], the program

should output “1 + 6”, “2 + 5”, and “3+4” in separate lines, and the result of

the addition “21”. Extend it to handle lists of odd length.

c. Primarily testing using for and while loops.

d. Use (c) to generate a list of primes within a user-given range.

e. Explore the ‘key’ function of sum( ), min( ), max( ), and sort( ) functions

using lambdas.

5. User defined functions

a. Implement popular sorting algorithms like quick sort and merge sort to sort

lists of numbers.

b. Implement the Pascal’s triangle.

c. Three positive integers a, b, and c are Pythagorean triples if a2+ b2 =c2. Write

a function to generate all Pythagorean triples in a certain range.

d. Write two functions that simulate the toss of a fair coin, and the roll of an

unbiased ‘n’ sided die using the random module.

e. Like (d), but now the coin and the die are not fair, with each outcome having

a given probability.

6. File handling, sys, pickle and csv modules

a. Basic file operations. Explore the different file modes.

b. Emulate the unix ‘cp’, ‘grep’, ‘cat’ programs in Python. In each case, the user

should pass the arguments to the program as command line arguments.

c. Use pickle for persistent storage of variables

7. Sets and dictionaries

a. Use sets to de-duplicate a list of numbers, and a string such that they contain

only the unique elements

b. Use the set union and intersection operations to implement the Jaccard and

Cosine similarity of two sets.

c. Use dictionaries to count the word and letter occurrences in a long string of

text.

d. Invert a dictionary such the previous keys become values and values keys.

Eg: if the initial and inverted dictionaries are d1 and d2, where d1 = {1: ‘a’, 2:

‘b’, 3: 120}, then d2 = {‘a’: 1, 2: ‘b’, 120: 3}.

e. What if the values in (d) are not immutable? Use frozensets. For repeated

values, use lists. Eg: if d1 = {1: ‘a’, 2: ‘a’, 4: [1, 2]}, then d2 = {‘a’: [1, 2],

frozenset([1, 2]): 4}.

f. Write a function to generate the Fibonacci numbers in (a) exponential time

using the naïve algorithm, and (b) in linear time using dynamic programming

(memorization) with a dictionary.

8. Object Oriented Programming

a. Create a ‘Graph’ class to store and manipulate graphs. It should have the

following functions:

i. Read an edge list file, where each edge (u, v) appears exactly once in

the file as space separated values.

ii. Add and remove nodes and edges

iii. Print nodes, and edges in a user readable format

iv. Computes basic statistics of the graph like degree distribution,

clustering coefficient, and the number of connected components.

v. Finding all the neighbors of a node

vi. Finding all the connected components and storing them as individual

Graph objects inside the class

vii. Finding single source shortest paths using Breadth First Search

b. Make a ‘DiGraph’ class to handle directed graphs which inherits from the

‘Graph’ class. In addition to all of the functionalities of (a), it should support

the following operations

i. Finding the predecessors and successors of a node

ii. Creating a new ‘DiGraph’ object where all the edges are reversed.

iii. Finding the strongly connected components

c. Extend (a) and (b) to handle weighted graphs, and implement Dijkstra’s and

Floyd-Warshall algorithms to compute the single source and all pairs shortest

paths.

d. Use the graph containers in (a), (b), and (c) to implement additional graph

algorithms.

CMS-A-DSE-B--2-TH: Programming using Python 3 DSE-B: Choice-2: Theory, Credit: 04, Contact hour: 60.

 Introduction to the Python

Interpreted vs. compiled languages. Bytecodes. The importance of whitespace.

Variables and the lack of explicit data types and how Python uses the concepts of duck,

strong, and static typing, to figure out data types in runtime.

The assignment operator, the binding of names to objects, and aliasing.

Keywords and their significance.

04 hours

Strings: definition, declaration, and immutability, string constants, declaration, and the

equivalence of single and double quotes. Multi-line strings. Raw strings. String formatting

using the format function and the % operator. f-strings in Python 3.6+. Built-in functions:

count, find, replace, upper, lower, strip, etc. Time and space complexities of the functions

and operations.

Lists: definition, declaration, and mutability. Nested lists. Indexing and slicing: same as

strings. List comprehensions. The split and join methods. Built-in list functions – append,

extend, count, find, index, etc. Time and space complexities of the functions and

operations.

Tuples: definition, declaration, and immutability. Packing and unpacking lists and tuples.

The + and * operators on strings, lists, and tuples. Indexing and slicing strings, lists, and

tuples.

06 hours

Conditionals, Iterators, and Generators

Conditionals: If, elif, and else statements. Nested conditionals. Containment checking in

containers using the in keyword.

Looping constructs: while and for loops. Flow control using break, continue, and pass.

Nested loops.

Generators: range, zip, sorted, reversed, and enumerate.

15 hours

User-defined Functions and Recursion

Functions: definition, function signature, positional, default, and keyword arguments.

Documentation strings. Unnamed functions – lambda, filter, and map.

Recursion: basic idea, implementing recursion, sharing variables across the recursion

stack, modifying the size of the recursion stack.

10 hours

File Handling and Exception Handling

File handling: open and close methods, the different read and write modes. Using the with

open approach to files. read, readline, readlines functions. The csv module for efficient

read/write of structured data. The pickle module for persistent storage of variables in a

program.

Exception handling: the popular errors- Name Error, Value Error, Syntax Error, Key

Error, Attribute Error, etc, and their cause and effects. Using try-except blocks for

graceful handling of exceptions.

05 hours

Unordered data types - Sets and Dictionaries

Basic concepts of hashing: hash functions, open chain, closed chain, advantages and

disadvantages compared to conventional ordered data types. The hash() function in

Python.

Sets and frozensets: definition, declaration, mutability, and advantages over lists / tuples.

05 hours

Insertion, deletion, union, intersection, and other built-in operations. Time and space

complexities of the functions and operations.

Dictionaries: Concept of keys and values. Immutability requirement for keys. Basic

operations on dictionaries. Iterating over the keys and key, value pairs of a dictionary.

Dictionary inversions

Intro to Object Oriented Programming

The Python data model, magic methods (__init__, __str__, __eq__, etc) and their utilities,

accessing and mutating data, constructors, class methods, and the lack of explicit access

modifiers of class methods – naming conventions of private, protected, and public

variables and methods.

Inheritance: inheriting a parent class, the super() method. Basic multiple inheritance.

CMS-A-DSE-B-1-P:Operation Research (O.R)Lab using C DSE-B: Choice-1: Practical, Credit: 02, Contact hours: 40.

  Lab sessions related to Simplex Method, Transportation Problem and Assignment Problem.

CMS-A-DSE-B--1-TH: Operation Research (O.R.) DSE-B: Choice-1: Theory, Credit:04, Contact hours: 60.

 Introduction

Origin and development of operation research, Nature and characteristic features, models

in O.R., application of O.R.

05hours

Linear Programming Problem

Introduction, mathematical formulation of the problem and graphical solution method.

05hours

Simplex Method

Introduction, computational procedure, artificial variable, problem of degeneracy,

application of simplex method.

20hours

Duality:

Concept, formulation of primal – dual, duality and simplex method, Dual Simplex method.

10hours

Transportation Problem:

Introduction, mathematical formulation, finding initial basic feasible solution, optimality,

degeneracy, unbalanced transportation problem.

05hours

Assignment Problem:

Introduction, mathematical formulation and solution.

05hours

Game Theory:

Some basic terminology, Two-person Zero-sum Game, Game without Saddle Point –

Mixed strategy, Algebraic method for 2×2 Game

05hours

Network Scheduling:

Introduction, Critical Path Method (CPM), PERT calculation.

CMS-A-DSE-A--2-P: Data Mining Lab. DSE-A: Choice-2: Practical, Credit:02, Contact hours: 40. Data mining using PYTHON/C

 CMS-A-DSE-A--2-P: Data Mining Lab. DSE-A: Choice-2: Practical, Credit:02, Contact hours: 40.

 Data mining using PYTHON/C

CMS-A-DSE-A--2-TH: Data Mining and its Applications DSE-A: Choice-2: Theory, Credit:04, Contact hours: 60.

 Introduction

Definition of Data Mining, Data pre-processing, Data cleaning, Data transformation,

Data Reduction, Data Visualization, Data extraction from large dataset, Data integration,

sub-sampling, Feature selection, Scalability issues of data mining algorithms, text

mining, web mining.

15hours

Classification and Prediction

Structural patterns of data, Tools for pattern recognition (preliminary concept), Linear

models for classification, Evaluating the accuracy of the classifier or predictor, Bayesian

Classification, Training and Test sets, Parametric and Non-parametric Learning,

Minimum Distance Classifiers, k-NN rule, Discriminant Analysis, Decision trees.

Similarity Measure, Basic hierarchical and non-hierarchical Clustering algorithms,

Some Applications, Neural Learning.

30hours

Data Warehousing (DWH)

Introduction: Definition and description, need for data ware housing, need for strategic

information, failures of past decision support systems, Application of DWH.

CMS-A-DSE-A--1-P: Image Processing Lab. DSE-A: Choice-1: Practical, Credit:02, Contact hours: 40.

 Assignments on Different Image Processing Functions based on Open CV & Python/Scilab

CMS-A-DSE-A--1-TH: Digital Image Processing. DSE-A: Choice-1: Theory, Credit:04, Contact hours: 60.

 Introduction

Image definition and its representation, Pixels, Co-ordinate conventions, Image

formats (Study of the image matrix), neighbourhood metrics, Sampling and

quantization, Types of distance measure (concept only).

15hours

Spatial Domain

Image enhancement techniques in spatial domain, Contrast stretching, Histogram

Processing, Noise smoothing, Sharpening, Pixel Classification, RGB & Grey image.

Transformation: Arithmetic Transformation, Logical Geometric Transformation,

Hough Transformation, FFT.

Filtering: Spatial domain filters: Convolution, Edge Detection Filters

15hours

Thresholding

Grey level thresholding, global/ local thresholding, Iterative thresholding, Edge

detection operators, Region growing, Split/ merge techniques, Image feature/

primitive extraction, Background correction, Color enhancement.

15hours

Image Segmentation

Boundary detection based techniques, Point, line detection, Edge detection, Local

processing.

CMS-A-CC-5-12-P: Object Oriented Programming Lab. Core Course- 12: Practical, Credit: 02, Contact hours: 40 hours. OOPs Lab Using JAVA

 CMS-A-CC-5-12-P: Object Oriented Programming Lab.

Core Course- 12: Practical, Credit: 02, Contact hours: 40 hours.

OOPs Lab Using JAVA

CMS-A-CC-5-12-TH: Object Oriented Programming System (OOPs) Core Course- 12: Theory, Credit:04, Contact hours: 60.

 Concept of OOPs

Difference with procedure oriented programming, Data abstraction and information hiding:

Objects, Classes, methods.

02hours

Introduction to Java

Java Architecture and Features, Understanding the semantic and syntax differences

between C++ and Java, Compiling and Executing a Java Program, Variables, Constants,

Keywords Data Types, Operators (Arithmetic, Logical and Bitwise) and Expressions,

Comments, Doing Basic Program Output, Decision Making Constructs (conditional

statements and loops) and Nesting, Java Methods (Defining, Scope, Passing and Returning

Arguments, Type Conversion and Type and Checking, Built-in Java Class Methods).

04hours

Arrays, Strings and I/O

Creating & Using Arrays (One Dimension and Multi-dimensional), Referencing Arrays

Dynamically, Java Strings: The Java String class, Creating & Using String Objects,

Manipulating Strings, String Immutability & Equality, Passing Strings To & From

Methods, String Buffer Classes. Simple I/O using System.out and the Scanner class, Byte

and Character streams, Reading/Writing from console and files.

08hours

Object-Oriented Programming Overview

Principles of Object-Oriented Programming, Defining & Using Classes, Controlling

Access to Class Members, Class Constructors, Method Overloading, Class Variables &

Methods, Objects as parameters, final classes, Object class, Garbage Collection.

04hours

Inheritance, Interfaces, Packages, Enumerations, Autoboxing and Metadata.

Single Level and Multilevel, Method Overriding, Dynamic Method Dispatch, Abstract

Classes, Interfaces and Packages, Extending interfaces and packages, Package and Class

Visibility, Using Standard Java Packages (util, lang, io, net), Wrapper Classes,

Autoboxing/Unboxing, Enumerations and Metadata.

14hours

Exception Handling, Threading, Networking and Database Connectivity

Exception types, uncaught exceptions, throw, built-in exceptions, Creating your own

exceptions; Multi-threading: The Thread class and Runnable interface, creating single and

multiple threads, Thread prioritization, synchronization and communication,

suspending/resuming threads. Using java.net package, Overview of TCP/IP and Datagram

programming. Accessing and manipulating databases using JDBC.

15hours

Applets

Java Applets: Introduction to Applets, Writing Java Applets, Working with Graphics,

Incorporating Images & Sounds. Event Handling Mechanisms, Listener Interfaces,

Adapter and Inner Classes. The design and Implementation of GUIs using the AWT

controls, Swing components of Java Foundation Classes such as labels, buttons, textfields,

layout managers, menus, events and listeners; Graphic objects for  for drawing figures such as

lines, rectangles, ovals, using different fonts. Overview of servlets.

CMS-A-CC-5-11-TH: Database Management System (DBMS). Core Course- 11: Theory, Credit: 04, Contact hour: 60 hours.

 Introduction

Drawbacks of Legacy System; Advantages of DBMS; Layered Architecture of Database,

Data Independence; Data Models; Schemas and Instances; Database Languages; Database

Users, DBA; Data Dictionary.

04hours

Entity Relationship(ER) Modeling

Entity, Attributes and Relationship, Structural Constraints, Keys, ER Diagram of Some

Example Database, Weak and strong Entity Set, Specialization and Generalization,

Constraints of Specialization and Generalization, Aggregation.

04hours

Relational Model

Basic Concepts of Relational Model; Relational Algebra; Tuple Relational Calculus;

Domain Relational Calculus.

08hours

Integrity Constraints

Domain Constraints, Referential Integrity, View.

04hours

Relational Database Design

Problems of Un-Normalized Database; Functional Dependencies (FD),Derivation Rules,

Closure of FD Set, Canonical Cover; Normalization: Decomposition to 1NF, 2NF, 3NF or

BCNF Using FD; Lossless Join Decomposition Algorithm; Dependency preservation.

16hours

SQL

Basic Structure, Data Definition, Constraints and Schema Changes; Basic SQL Queries

(Selection, Insertion, Deletion, Update); Order by Clause; Complex Queries, Aggregate

Function and Group by Clause; Nested Sub Queries; Views, Joined Relations; Set

Comparisons (All, Some); Derived Relations.

16hours

Record Storage and File Organization (Concepts only)

Fixed Length and Variable Length Records; Spanned and Un-Spanned Organization of

Records; Primary File Organizations and Access Structures Concepts; Unordered,

Sequential, Hashed; Concepts of Primary and Secondary Index; Dense and Sparse Index;

Index Sequential Files; Multilevel Indices.

CMS-A-SEC-B-4-2-TH: E-Commerce Skill Enhancement Course: SEC-B: Choice -2: Theory, Credit:02, Contact hours: 40.

 An introduction to Electronic commerce

What is E-Commerce (Introduction And Definition), Main activities E-Commerce, Goals of

E-Commerce, Technical Components of E-Commerce, Functions of E-Commerce,

Advantages and disadvantages of E-Commerce, Scope of E-Commerce, Electronic

Commerce Applications, 9 Electronic Commerce and Electronic Business (C2C) (C2G,G2G,

B2G, B2P, B2A, P2P, B2A, C2A, B2B, B2C).

05hours

The Internet and WWW

Evolution of Internet, Domain Names and Internet Organization (.edu, .com, .mil, .gov, .net

etc.) , Types of Network, Internet Service Provider, World Wide Web, Internet & Extranet,

Role of Internet in B2B Application, building own website, Cost, Time, Reach, Registering a

Domain Name, Web promotion, Target email, Banner, Exchange, Shopping Bots.

10hours

Internet Security

Secure Transaction, Computer Monitoring, Privacy on Internet, Corporate Email privacy,

Computer Crime( Laws , Types of Crimes), Threats, Attack on Computer System, Software

Packages for privacy, Hacking, Computer Virus( How it spreads, Virus problem, virus

protection, Encryption and Decryption, Secret key Cryptography, DES, Public Key

Encryption, RSA, Authorization and Authentication, Firewall, Digital Signature( How it

Works).

10hours

Electronic Data Exchange

Introduction, Concepts of EDI and Limitation, Applications of EDI, Disadvantages of EDI,

EDI model, Electronic Payment System: Introduction, Types of Electronic Payment System,

Payment Types, Value Exchange System, Credit Card System, Electronic Fund Transfer,

Paperless bill, Modern Payment Cash, Electronic Cash.

05hours

Planning for Electronic Commerce

Planning Electronic Commerce initiates, Linking objectives to business strategies, Measuring

cost objectives, Comparing benefits to Costs, Strategies for developing electronic commerce

web sites.

05hours

Internet Marketing:

The PROS and CONS of online shopping, The cons of online shopping, Justify an Internet

business, Internet marketing techniques, The E-cycle of Internet marketing, Personalization

e-commerce.

Skill Enhancement Course: SEC-B: Information Security/ E-Commerce CMS-A-SEC-B-4-1-TH: Information Security

 Overview

Overview of Security Parameters: Confidentiality, Integrity and availability-security

violation, Assumptions and Trust- Security assurance, OSI security architecture.

05 hours

Cryptography

Mathematical Tools for Cryptography, Symmetric Encryption Algorithm, Theory of Block

cipher design, Symmetric cipher model, Risk assessment, quantitative and qualitative

approaches, Network security management, Firewalls, Web and wireless security

management, Computer security log management, IT security infrastructure, Operating

system security, user security, program security.

10 hours

Finite Field and Number Theory

Groups, Rings, Fields-Modular, Prime numbers, Fermat's and Euler's Theorem, Chinese

remainder Theorem, Discrete Logarithm.

03 hours

Hash Functions and Digital Signatures

Authentication requirement – Authentication function -MAC, Hash functions, Security of

hash function, Hashing Algorithms: MD5.

05 hours

Internet Firewalls for Trusted System

Roles of Firewalls, Firewall related terminology, Types of Firewalls, Firewall designs.

02 hours

E-Mail, IP & Web Security (Qualitative study)

E-mail Security: Security Services for E-mail-attacks possible through E-mail, Pretty

Good S/MIME.

IP Security: Overview of IPSec, IP Security Architecture, Authentication Header,

Encapsulation Security Payload.

Web Security: Secure Socket Layer/Transport Layer Security, Basic Protocol, SSL

05 hours

Attacks, Secure Electronic Transaction (SET).

Cyber

Cyber laws to be covered as per IT 2008

Definitions, Digital Signature And Electronic Signature.

1) [Section 43] Penalty and Compensation for damage to computer, computer system,

etc.

2) [Section 65] Tampering with Computer Source Documents.

3) [Section 66 A] Punishment for sending offensive messages through communication

service, etc.

4) [Section 66 B] Punishments for dishonestly receiving stolen computer resource or

communication device.

5) [Section 66C] Punishment for identity theft.

6) [Section 66D] Punishment for cheating by personation by using computer resource.

7) [Section 66E] Punishment for violation of privacy.

8) [Section 66F] Punishment for cyber terrorism.

9) [Section 67] Punishment for publishing or transmitting obscene material in

electronic form.

10) [Section 67A] Punishment for publishing or transmitting of material containing

sexually explicit act, etc. in electronic form.

11) [Section 67B] Punishment for publishing or transmitting of material depicting

children in sexually explicit act, etc. in electronic form.

12) [Section 72] Breach of confidentiality and privacy.