m.tech (cse) second semester -...

M.Tech (CSE) SECOND SEMESTER

Paper Code Nomenclature of Paper External Marks Internal Marks Duration

of Exam

(Hrs.)

Max Min Max Min Total

MT-CSE-14-21 OBJECT ORIENTED

ANALYSIS & DESIGN

USING UML

100 40 50 20 150 3

MT-CSE-14-22 DIGITAL IMAGE

PROCESSING

100 40 50 20 150 3

MT-CSE-14-23 ELECTIVE – I 100 40 50 20 150 3

MT-CSE-14-24 ELECTIVE - II 100 40 50 20 150 3

MT-CSE-14-25 S/W LAB – III BASED ON

MT-CSE-14-21

100 40 100 3

MT-CSE-14-26 S/W LAB – IV BASED ON

MT-CSE-14-22

100 40 100 3

MT-CSE-14-27 Seminar 50 20 50 3

total 600 250 850

Elective Papers

MT-CSE-14-23(i) SOFTWARE QUALITY MODELS

& TESTING

MT-CSE-14-24(i) DISTRIBUTED

SYSTEMS

MT-CSE-14-23(ii) HIGH PERFORMANCE

NETWORKS

MT-CSE-14-24(ii) BIOMETRICS SYSTEM

SECURITY

MT-CSE-14-23(iii) ADVANCES IN DATABASES MT-CSE-14-24(iii) SECURITY IN

COMPUTING

MT-CSE-14- 21

OBJECT ORIENTED ANALYSIS & DESIGN USING UML

Maximum marks: 150 (External: 100, Internal: 50) Time: 3 hr

Note: Examiner will be required to set NINE questions in all. Question Number

1 will consist of objective type/short-answer type questions covering the entire

syllabus. In addition to question no. 1, the examiner is required to set eight more

questions selecting two from each unit. Student will be required to attempt FIVE

questions in all. Question Number 1 will be compulsory. In addition to

compulsory question, student will have to attempt four more questions selecting

one question from each Unit. All questions will carry equal marks.

UNIT – I UML: History of UML, Goals of UML, nature & purpose of models, UML

views & diagrams – static, design, use case, state machine, activity, interaction

deployment, model management, profile; relationships in UML – association,

dependency, generalization, realization; UML extensibility mechanisms –

constraints, stereotypes, tagged values.

Unified Process (UP): UP structure, phases of UP

UNIT – II Requirements: Meta Model, Workflow, Functional and Non-functional

Requirements; Requirement Attributes, Finding Requirements

Use Case Modeling: Finding Actors and Use Cases, Use Case Scenario – main

flow, branching within a flow, repletion within a flow, modeling alternative

flows; relationships among actors and use cases; use case diagrams

UNIT – III

Analysis: Meta Model, Workflows, Finding Analysis Classes – using noun/verb

analysis, CRC analysis, using RUP stereotypes - entity, boundary and control;

Modeling Classes – Association (role name, multiplicity, navigability,

association classes, qualified association) dependencies (usage, abstraction,

permission), class generalization, generalization sets, power types; Analysis

Package – nested packages, dependencies, transitivity, package generalization,

architectural analysis, finding analysis packages; Concepts of Patterns &

Frameworks Use Case Realization – interaction diagram, sequence diagram;

Activity Diagrams.

UNIT – IV Design: Meta Model, Workflow, design classes – well-formed design classes,

inheritance, templates, nested classes, design relationships, aggregation and

composition, refining analysis relationships; interfaces and components –

provided and required interfaces, interface realization v/s interface, components,

finding interfaces, designing with interfaces; interaction diagram in design,

modelling concurrency, active classes, concurrency in sequence diagram,

concurrency in communication diagram; state machine - state machine diagrams

Implementation: Meta model, workflow, deployment diagram

Text Books: 1. Jim Arlow, Ila Neustadt, “UML 2 and the Unified Process – Practical Object

Oriented Analysis and Design”, Pearson Education.

2. Bernd Bruegge, Allen H. Dutoit, “Object Oriented Software Engineering

using UML”, Pearson Education.

Reference Books: 1. Rumbaugh J., Jacobson I., Booch G., “The Unifed Modeling Language

Reference Manual”, Pearson Education.

2. Blaha M., Rumbaugh J., “Object-Oriented Modeling and Design with UML”,

Pearson Education.

3. Timothy C. Lethbridge, Robert Laganiere, “Object Oriented Software

Engineering”, Tata McGraw-Hill.

4. Booch G., Rumbaugh J., Jacobson I., “The Unified Modeling Language User

Guide”, Pearson education.

5. Satzinger, Jackson, Burd, “Object-Oriented Analysis & Design with the

Unified Process”, Course Technology Inc.

MT-CSE-14-21 OBJECT ORIENTED ANALYSIS & DESIGN USING

UML

(LECTURE PLAN)

Lecture Topics

1. Overview of OO methodologies: concepts abstraction, Encapsulation,

Object, Class, Message Passing, Inheritance

2. Polymorphism, Genericity, Overriding abstract class and Methods,

Concurrency, persistence of objects

3. Object modeling technique (OMT) – Object Model

4. Dynamic Model

5. Functional Model

6. Modeling with UML: Modeling Concepts-System, Model & Views

7. Event Classes, Events & Messages

8. Object Oriented Modeling; Falsification and Prototyping

9. UML Diagrams- Use Case diagram, Class diagram

10. Interactive diagrams, statechart diagram, activity diagram

11. Requirements Elicitation: Functional & nonfunctional requirements

12. Greenfield, Reengineering & Interface engineering

13. Activity – Identifying Actors, Scenarios & Use cases; Relationship

among actors & Use cases

14. Identifying initial analysis Objects and nonfunctional requirements

15. Analysis: Analysis object models and Dynamic models: Entity,

Boundary and Control objects

16. Generalization & Specialization

17. Activities – Identifying entity, Boundary and control objects; Mapping

Use cases to objects with sequence diagram

18. Modeling interaction among objects; Identifying Association,

Aggregates and attributes

19. Modeling State development behavior of individual objects; Modeling

inheritance relationships between objects

20. System Design: Concepts-subsystems and classes; Coupling and

cohesion

21. Layers and Partition; Architectural Styles; Activities-Design Goals

and subsystems

22. Addressing design goals, UML Deployment Diagram

23. Activities- Mapping Subsystems to processors; Identifying and storing

persistent data

24. Providing Access control, Designing the Global Control flow,

identifying boundary conditions; Review System Design

25. Reusing Pattern solutions: Reuse concepts- application & Solution

Objects

26. Specification & Implementation Inheritance Delegation, Liskov

substitution principle

27. Design patterns- Elements of a design pattern, Reuse activities-

Selecting Design patterns & components- Heuristic for selecting

Design patterns

28. Identifying and Adjusting Application frameworks

29. Specifying Interfaces: concepts-Class Extender & Class user: Types,

Signature & Visibility

30. Invariants, precondition & post conditions; Object Constraint

language(OCL); OCL Collections; OCL Qualifiers

31. Identifying Missing Attributes and operations; Specifying type

signatures, visibility

32. Preconditions, post conditions and invariants; inheriting contracts

TUTORIAL SHEET 1

1. Explain Object Modelling Techniques.

2. Explain UML Diagram with example.

3. Explain Class & Methods.

4. Explain Events & Classes.

5. Draw an Activity diagram of Employee Management System.

TUTORIAL SHEET 2

1. What are the functional and non functional requirements?

2. Differentiate association and aggregation with example.

3. Explain access control and designing the global control flow.

4. Explain Dynamic model.

5. Differentiate Generalization and specialization with example.

TUTORIAL SHEET 3

1. Explain Reusing Pattern Solutions.

2. Explain patterns and frameworks.

3. Explain OCL.

4. Explain Preconditions and post conditions.

5. Explain Type Signature.

TUTORIAL SHEET 4

1. Explain UML deployment diagram with example.

2. Explain layers and subsystems.

3. Explain Coupling and Cohesion.

4. What is the goal of System Design?

5. Explain Mapping Subsystem to pre-processor.

OBJECT ORIENTED ANALYSIS & DESIGN USING UML

Time: 3 hours

MM: 100

Note: Attempt five questions in all, selecting exactly one question from each

unit. Q. No. 1 is compulsory.

1. Answer the following questions in brief:

a) Define genericity, overriding and persistence of objects.

b) Explain the terms event, event class and messages.

c) What is actor? How can you identify it?

d) Distinguish between coupling and cohesion.

e) Explain Liskov substitution principle.

f) What are OCL qualifiers? Explain.

g) Distinguish between framework and pattern.

UNIT-1

2. a) What is functional model of OMT? Draw a DFD for a library system.

b) What is sequence diagram? Draw a sequence diagram for setting time

on a two button watch. They do that the user first presses both button

simultaneously then watch enters the set mode. In the set time mode, the

watch blinks the number being changed. Initially, the hours blink. The user

presses the first button, the next number blinks. If the user presses the

second button, the blinking number reaches the end of its range, it is reset

to the beginning of range. The user exits the set time mode by pressing

both buttons simultaneously.

3. a) What is class diagram in UML? Explain the following with examples

in respect to class diagram: Link class, qualifier, composition and

qualifier.

b) What is activity diagram? Draw the activity diagram for the problem

stated in Q. No. 2(b).

UNIT- II

4. a) What is non-functional requirements? What are quality requirements and

pseudo requirements? Explain them with examples.

b) What are the desirable properties of requirements specification? Explain

them.

5. a) What is scenario? Write a scenario for Report Emergency use case.

b) What are entity and control objects? Discuss heuristics and identify them.

UNIT-III

6. a) Explain Model/View/ Controller and pipe and filter software architectural

styles.

b) How can you identify goals? Explain.

7. a) What is component diagram? How is it different from deployment

diagram?

Give one example of component diagram.

b) What are boundary conditions of a system? Explain.

UNIT-IV

8. a) Distinguish between implementation, inheritance and delegation. Explain

the inheritance and delegation in Bridge pattern by giving an example.

b) How can you encapsulate context with the strategy pattern? Explain with

an example.

9. a) What are contracts? Explain with example.

b) Differentiate among class implementer, class user and class extender.

c) What are OCL collections? Explain them by giving examples.

d) Discuss interfaces specification activities

MT-CSE-14-22

DIGITAL IMAGE PROCESSING

Maximum marks: 150 (External: 100, Internal: 50)

Time: 3 hours




questions selecting two from each unit. Student will be required to attempt

FIVE questions in all. Question Number 1 will be compulsory. In addition to



Unit-I

Introduction to Digital Image Processing, Applications of digital image

processing, Steps in digital image processing, Components of an Image

Processing system, Image sampling and Quantization, Relationships between

pixels.

Image Enhancement: Intensity transformations and spatial filtering, Point and

Mask based techniques, Histogram processing, Fundamentals of spatial

filtering, Smoothing and sharpening spatial filters.

Unit-II

Filtering in frequency domain: Fourier Series and Transform, Discrete Fourier

Transform, Frequency Domain Filtering Fundamentals, Homomorphic

Filtering.

Color Image Processing: Color Fundamentals, Color characteristics, Color

models, RGB, CYK, CMYK, HIS, YIQ models, Pseudo color image processing,

full color image processing, color transformations, Smoothening and sharpening

of images.

Unit-III

Image Restoration: Model of Image Degradation/Restoration process, Noise

models, Linear, Inverse filtering, Mean Square Error Restoration, Least Square

Restoration. Image Compression Fundamentals: Lossless and Lossy

Compression, Basic Compression Methods: Huffman Coding, Run-Length

Coding, LZ.W Coding, Arithmetic Coding, Bit-Plane Coding, Predictive

Coding, Transform Coding, Wavelet Coding, Compression standards.

Unit-IV

Image Segmentation: Fundamentals, Point, Line and Edge Detection,

Thresholding, Region based Segmentation.

Image Representation: Boundary Representation, Chain Codes, Polygonal

Approximations, Signatures, Boundary Descriptors, Simple Descriptors, Shape

Numbers, Regional Descriptors, Topological Descriptors, Texture.

Text Books:

1. Gonzalez R.C., Woods R.E., "Digital Image Processing", Pearson Education.

2. Vipula Singh, "Digital Image Processing with MATLAB and LABVIEW",

Elsevier India.

Reference Books:

1. Ganzalez R.C., "Digital Image Processing with MATLAB", Tata McGraw Hill.

2. Sonka Milan, "Image Processing Analysis and Machine vision", Cengage

Leaming.

3. William K. Pratt, "Digital Image Processing", Wiley India Pvt. Ltd.

4. Chanda B., Majumder D. Dutta, "Digital Image Processing and Analysis", PHI

Learning.

5. Jain A.K., "Fundamental of Digital Image Processing", PHI Learning.

6. Jayaraman S., Esakkirajan S., Veerakumar T., "Digital Image Processing", Tata

McGraw Hill.

7. Annadurai, "Digital Image Processing", Pearson Education.

LECTURE PLAN

1. Introduction to Digital Image Processing, Applications of digital image

Processing

2. Steps in digital image processing

3. Components of an Image Processing system

4. Image sampling and Quantization

5. Relationships between pixels

6. Image Enhancement: Intensity transformations and spatial filtering

7. Point and Mask based techniques, Histogram processing

8. Fundamentals of spatial filtering

9. Smoothing and sharpening spatial filters

10. Filtering in frequency domain: Fourier Series and Transform

11. -Do-

12. Discrete Fourier Transform, Frequency Domain Filtering Fundamentals

13. -Do-

14. Homomorphic Filtering

15. Color Image Processing: Color Fundamentals, Color characteristics

16. Color models, RGB, CYK

17. CMYK, HIS

18. YIQ models

19. Pseudo color image processing

20. Full color image processing

21. Color transformations

22. Smoothening and sharpening of images

23. Image Restoration: Model of Image Degradation/Restoration process

24. Noise models

25. Linear Inverse filtering

26. Mean Square Error Restoration, Least Square Restoration

27. Image Compression Fundamentals: Lossless and Lossy Compression

28. Basic Compression Methods

29. Huffman Coding

30. Run-Length Coding

31. LZW Coding, Arithmetic Coding

32. Bit-Plane Coding

33. Predictive Coding

34. Transform Coding

35. Wavelet Coding, Compression standards

36. Image Segmentation: Fundamentals, Point, Line and Edge Detection,

37. Thresholding

38. Region-Based Segmentation

39. Image Representation: Boundary Representation, Chain Codes

40. Polygonal Approximations

41. Signatures

42. Boundary Descriptors

43. Simple Descriptors

44. Shape Numbers

45. Regional Descriptors

46. Topological Descriptors

47. Texture

TUTORIAL SHEET-1

1. What is digital image processing? What are the applications of digital

image processing?

2. Explain Histogram processing.

3. Explain Spatial Filltering.

4. Define Smoothing.

TUTORIAL SHEET-2

1. What do you meant by color model? Explain the hardware oriented color

model.

2. Specify the concept of CMYK model.

3. Explain Homomorphic filtering.

4. Define Fourier transform.

TUTORIAL SHEET -3

1. What is segmentation? Explain Region Based segmentation.

2. What is the need of compression? What are different compression model.

3. Explain LZW coding

4. Explain topological distourcter.

TUTORIAL SHEET-4

1. Write short note on neighbor of a pixel.

2. Explain arithmetic coding.

3. Explain noise model.

4. Explain model of image Degradation.

Case Studies

Unit-1:

Usage of Spatial Filtering in Satellite Image Processing.

Unit-2:

Color Image Quality in Projection Displays.

Unit-3:

Image Restoration & Compression

Unit-4:

Significance of Region based Segmentation techniques in Bio-Medical

Applications

Question Paper (MM 100)

(Digital Image Processing)

1. (a) Discuss the various distance measures.

(b) Define Box Filter.

(c) Explain any two methods for estimating the degradation function for

image relational model.

(d) Differentiate between Wiener and Least Square Filtering.

(e) Explain what is meant by color model. Which color model is oriented

towards hardware?

(f) What is meant by block transform coding?

(g) Explain in brief Adaptive Threshold. (7X4)

2. (a) Discuss the image smoothening filter with its model in the spatial domain.

(9)

(b) What is meant by Laplace Filter? How it can be helpful in sharpening the

image? Derive the mask for high boost filter.

(9)

3. (a) What does it mean when we say an object is in a certain color? Describe in

(9)

detail the color model that is most suitable to describe human vision.

(b) Discuss about the following in detail:

(i) Difference between Additive Color System and Subtractive Color

System.

(ii) Chromaticity. (9)

4. (a) Explain the steps for filtering in the frequency domain. (8)

(b) Discuss how periodicity and its inverse are important issued in the

implementation of DFT.

(10)

5. (a) Explain HIS Color Model. How colors can be converted from HIS to

RGB? (10)

(b) Describe the transformation used for color slicing and color correction.

(8)

6. (a) What is meant Periodic Noise? Define the Spatial and Frequency

characteristics of noise in general.

(10)

(b) Explain how Wiener Filtering incorporates both the degradation function

and statistical characteristics of noise into the restoration process.

(8)

7. (a) Give any two parameters that can be used to quantify the efficiency of an

image compression technique. Also write mathematical formula to compute

them. (9)

(b) What is meant by block transformation coding? How it can be achieved

using discrete wavelet transform? (9)

8. (a) Describe what is the principle of region based image segmentation. State

the condition to be met by the partitions in region based segmentation.

(8)

(b) Explain what is meant by Global, Local and Adaptive thresholding

techniques. Also give the merits and demerits of each technique.

(10)

9. (a) Describe in detail the minimum perimeter polygon algorithm for boundary

detection. (9)

(b) Write notes on the following: (9)

(i) Chain Codes

(ii) Regional descriptors

MT-CSE-14-23(iii)

ADVANCES IN DATABASES

Maximum marks: 150 (External: 100, Internal: 50)

Time: 3 hours




questions selecting two from each unit. Student will be required to attempt FIVE

questions in all. Question Number 1 will be compulsory. In addition to



UNIT – I Database System Concepts and Architecture: Three - Schema

Architecture and Data Independence, ER Diagrams, Naming conventions and

Design Issues. Relational Model Constraints and Relational Database Schemas,

EER model: Subclasses, Super classes, Inheritance, Specialization and

Generalization, Constraints and characteristics of specialization and

Generalization.

UNIT – II Object Model: Overview of Object-Oriented concepts, Object

identity, Object structure, Type constructors, Encapsulation of operations,

Methods, and Persistence, Type hierarchies and Inheritance, Complex objects.

Query Processing and Optimization: Using Heuristics in Query Optimization,

Semantic Query Optimization, Database Tuning in Relational Systems.

UNIT – III Databases for Advance Applications: Architecture for parallel

database; Distributed database concepts, Data fragmentation, Replication, and

allocation techniques, Overview of Client-Server Architecture, Active Database

Concept and Triggers, Temporal Databases Concepts, Spatial and Multimedia

Databases, Deductive Databases, XML Schema, Documents and Databases

UNIT – IV Principles of Big Data: Ontologies and Semantics: Classifications,

The Simplest of Ontologies, Ontologies, Classes with Multiple Parents,

Choosing a Class Model. Data Integration and Software Interoperability

Versioning and Compliance Issues, Stepwise Approach to Big Data Analysis,

Failures and Legalities.

Text Books: 1. Elmasri and Navathe, “Fundamentals of Database Systems”,

Pearson Education. 2. Jules J. Berman, “Principles of Big Data”, Elsevier India.

Reference Books: 1. Date C.J., “An Introduction to Database Systems”, Pearson

Education. 2. Hector G.M., Ullman J.D., Widom J., “Database Systems: The

Complete Book”, Pearson Education. 3. Silberschatz A., Korth H., Sudarshan S.,

“Database System Concepts”, Tata McGraw Hill.

Lecture Plan-ADBMS

Lectures Topics

L1 Database System Concepts and Architecture: Three - Schema

Architecture and Data Independence

L2 ER Diagrams, Naming conventions and Design Issues

L3 Do

L4 Relational Model Constraints and Relational Database Schemas

L5 Do

L6 EER model: Subclasses, Super classes, Inheritance

L7 Do

L8 Specialization and Generalization

L9 Constraints and characteristics of specialization and

Generalization

L 10 Object Model: Overview of Object-Oriented concepts

L 11 Object identity, Object structure, Type constructors

L 12 Encapsulation of operations, Methods, and Persistence

L 13 DO

L 14 Type hierarchies and Inheritance, Complex objects

L 15 Processing and Optimization: Using Heuristics in Query

Optimization

L 16 DO

L 17 Query, Semantic Query Optimization

L 18 Database Tuning in Relational Systems.

L 19 Databases for Advance Applications: Architecture for parallel

database

L 20 Distributed database concepts, Data fragmentation

L 21 DO

L 22 Replication, and allocation techniques

L 23 Overview of Client-Server Architecture

L 24 Active Database Concept and Triggers

L 25 Temporal Databases Concepts

L 26 Spatial and Multimedia Databases

L 27 Deductive Databases

L 28 XML Schema, Documents and Databases

L 29 DO

L 30 Principles of Big Data: Ontologies

L 31 Semantics: Classifications

L 32 The Simplest of Ontologies

L 33 Ontologies, Classes with Multiple Parents

L 34 Choosing a Class Model

L35 Data Integration and Software Interoperability Versioning and

Compliance Issues

L 36 DO

L 37 Stepwise Approach to Big Data Analysis

L 38 Failures and Legalities

Tutorial Sheets

TUTORIAL SHEET 1

1. What is the significance of ER model? Explain its disadvantages with an

example.

2. Explain notations used for EER diagram while designing database for an

enterprise.

3. Explain how the concept of OID in OO model differs from the concept of

tuple equality in relational model.

4. Illustrate the concept of class and class instance.

TUTORIAL SHEET 2

1. What are type hierarchies and inheritance. Explain its types also.

2. What is the use of constructor in OO databases. Explain its type also.

3. Explain Semantic Query Optimization.

TUTORIAL SHEET 3

1. Explain architecture for parallel database. What are its applications.

2. How do we perform database turning in relational systems.

3. Define : Data Fragmentation,Replication and allocation Techniques.

4. Explain Xml Schema and Xml Database.

TUTORIAL SHEET 4

1. What is Bigdata. what are its current usage. what is stepwise approach to

bigdata analysis.

2. Explain Data integaration and how it is performed.

3. Explain spatial and multimedia databases.

4. Classify ontologies and their meaning.

ADVANCES IN DATABASES

Note: Attempt Five Questions in all, selecting one question from each unit.

Question no. 1 is compulsory. All questions carry equal marks.

Compulsory Question

1. A) Discuss the importance of design issues in databases.

B) Discuss the terms Specialization and Generalization.

C) Discuss the term Type constructors and Type hierarchies

D) Discuss the terms: Query Optimization with example.

E) Discuss the term Active Database and Triggers.

F) Discuss importance of XML Schema in database

G) Explain How to Choose a model for Bigdata.

H) Discuss the term Failures and Legalities with reference to bigdata.

Unit-I

2. Explain the purpose of Subclasses, Super classes, Inheritance and their

importance in Object databases.

3. Explain the constraints and characteristics of Specialization and

Generalization

4. List and explain the Query Optimization with example and method of your

own choice.

Unit-II

5. Explain the following terms: Type constructors and Type hierarchies

6. Explain the usage of client Server architecture in database.

Unit-III

7. Explain the Multimedia Databases and Deductive Database.

8. Explain the types of Data fragmentation and replication Techniques with

example.

Unit-IV

9. Discuss the Ontologies and explain how a class model is opted for it.

10. Explain the Software Interoperability and Compliance Issues in Big Data.

MT-CSE-14-24(iii)

SECURITY IN COMPUTING

Maximum marks: 150 (External: 100, Internal: 50) Time: 3 hours

NOTE: Examiner will be required to set NINE questions in all. Question

Number 1 will consist of objective type/short-answer type questions covering

the entire syllabus. In addition to question no. 1, the examiner is required to set

eight more questions selecting two from each unit. Student will be required to

attempt FIVE questions in all. Question Number 1 will be compulsory. In

addition to compulsory question, student will have to attempt four more

questions selecting one question from each Unit. All questions will carry equal

marks.

UNIT – I

Computer Security Concept, Threats, Attacks and Assets, Security

Functional Requirements, Security Architecture for Open System, Scope of

Computer Security, Computer Security Trends and Strategy. Cryptography:

Terminology and Background, Substitution Ciphers, Transpositions,

Cryptanalysis, Data Encryption Standard, DES & AES Algorithms and

comparison, Public Key Encryption, Possible Attacks on RSA Malicious

Software: Types of Malicious Software, Viruses, Virus countermeasures,

Worms, Bots, Rootkits.

UNIT – II

Protection in General-Purpose Operating Systems: Security Methods of

Operating Systems, Memory and Address Protection. Designing Trusted

Operating Systems: Security Policies, Models of Security, Designing of

Trusted Operating System. Linux Security: Linux Security Model, Linux

Vulnerabilities, Linux System Hardening, Application Security, Mandatory

Access Control.

UNIT – III

Database Security: Relational Database, Database Access Control, Inference,

Statistical Databases, Database Encryption. Data Mining Security: Security

Requirements, Reliability and Integrity, Sensitive data, Multilevel Databases,

Proposal for Multilevel Security, Data Mining - Privacy and Sensitivity, Data

Correctness and Integrity, Data Availability. Trusted Computing: Concept of

Trusted System, Trusted Computing and Trusted Platform Module, Common

Criteria for Information Technology Security Evaluation.

UNIT – IV

Security in Networks: Threats in networks, Network security controls,

Firewall and Intrusion Prevention Systems: Need, Characteristics, Types of

Firewalls, Firewall Basing, Intrusion Prevention Systems. Intrusion Detection

Systems. Internet Security Protocols and Standards: Secure Socket Layer (SSL)

and Transport Layer Security (TLS), IP4 and IP6 Security, Secure Email. Legal

and Ethical Aspects: Cybercrime and Computer Crime, Intellectual Property,

Copyrights, Patents, Trade Secrets, Privacy and Ethical Issues.

TEXT BOOKS:

1. Pfleeger C. & Pfleeger S.L., “Security in Computing”, Pearson Education.

2. Stalling W., Brown L., “Computer Security Principles and Practice”, Pearson

Education.

REFERENCE BOOKS:

1. Schneier B., “Applied Cryptography: Protocols, Algorithms and Source

Code in C”, Wiley India Pvt. Ltd.

LECTURE PLAN

LECTURE TOPICS

1. Computer Security Concept, Threats

2. Attacks and Assets, Security Functional Requirements

3. Security Architecture for Open System

4. Scope of Computer Security

5. Computer Security Trends and Strategy

6. Cryptography: Terminology and Background, Substitution

Ciphers

7. Transpositions, Cryptanalysis

8. Data Encryption Standard, DES Algorithm

9. AES Algorithms, comparison between DES and AES

10. Public Key Encryption, Possible Attacks on RSA

11. Malicious Software: Types of Malicious Software, Viruses,

Virus countermeasures

12. Worms, Bots, Rootkits

13. Protection in General-Purpose Operating Systems: Security

Methods of Operating Systems

14. Memory and Address Protection

15. Designing Trusted Operating Systems: Security Policies

16. Models of Security

17. Designing of Trusted Operating System.

18. Linux Security: Linux Security Model

19. Linux Vulnerabilities, Linux System Hardening

20. Application Security, Mandatory Access Control

21. Database Security: Relational Database, Database Access Control

22. Inference, Statistical Databases

23. Database Encryption

24. Data Mining Security: Security Requirements, Reliability and

Integrity

25. Sensitive data, Multilevel Databases

26. Proposal for Multilevel Security

27. Data Mining - Privacy and Sensitivity, Data Correctness and

Integrity

28. Data Availability. Trusted Computing: Concept of Trusted System

29. Trusted Computing and Trusted Platform Module

30. Common Criteria for Information Technology Security Evaluation

31. Security in Networks: Threats in networks, Network security

controls

32. Firewall and Intrusion Prevention Systems: Need,

Characteristics

33. Types of Firewalls, Firewall Basing

34. Intrusion Prevention Systems. Intrusion Detection Systems

35. Internet Security Protocols and Standards: Secure Socket Layer

(SSL)

36. Transport Layer Security (TLS)

37. IP4 and IP6 Security

38. Secure Email

39. Legal and Ethical Aspects: Cybercrime and Computer Crime

40. Intellectual Property, Copyrights

41. Patents, Trade Secrets

42. Privacy and Ethical Issues

TUTORIAL SHEET # 1

1. Explain Cryptography.

2. Explain DES and AES algorithms with examples.

3. Explain types of malicious softwares.

4. Define virus, worms, bots, rootkits.

TUTORIAL SHEET-2

1. Explain security methods of OS.

2. Explain security policies.

3. Explain Linux security model.

4. How do we design a trusted operating system?

TUTORIAL SHEET- 3

1. Explain database security.

2. What are the requirements of security?

3. Explain privacy and sensitivity in data mining.

4. What is the common criteria for information technology security

evaluation?

TUTORIAL SHEET - 4

1. What is firewall? Explain its types.

2. Explain SSL and TLS.

3. How can we make our email secure?

4. What is cybercrime and computer crime? Explain.

MT-CSE/ M-14

SECURITY IN COMPUTING

MT-CSE-240 (III)

Time: 3 Hrs. M.M : 100

Note: Attempt five questions in all, selecting at least one question from each

unit. Question no. 1 is compulsory.

COMPULSORY QUESTION

1. a) Differentiate between vulnerability, threats and control.

b) Differentiate between failure, fault and error.

c) Write note on base and bound registers.

d) What do you mean by challenge response system?

e) Explain database security and precision.

f) What do you understand by wiretapping?

g) Write a note on copyright for digital objects. 7*4=28

UNIT-I

2. a) Discuss the mechanism for control against threats.

b) What are the different kinds of malicious code? Explain the truth and

misconceptions about viruses? 9,9

3. a) How would you quickly test a piece of cipher text to suggest whether it

was likely the result of transposition?

b) DES and AES are both „turn the handle‟ algorithms. In that they use

repetition of some number of very similar cycles. What are the advantages

(to implementer, to users, to cryptanalysts etc.) of this approach? 9, 9

UNIT-II

4. a) What do you mean by protected objects? Explain the different security

methods of operating system.

b) What are some other levels of protections that user might want to apply to

code or data, in addition to command read, write ad execute permission?9,

9

5. What are trusted systems? Explain the various models of security. Also

discuss protection system commands. 18

UNIT-III

6. a) What do you mean by sensitive data? Discuss the factors which influence

the data to be sensitive.

b) What are the advantages of using database? List out the requirements for

database security. Discuss in detail. 9, 9

7. a) Explain the disadvantages of partitioning as a means of implementing

multilevel security for databases.

b) What is the purpose of encryption in a multilevel secure database

management system?

9, 9

UNIT-IV

8. a) Firewalls are targets for penetrators. Why are there few compromises of

firewalls?

b) What are the advantages and disadvantages of an email program that

automatically applies and removes protection to email message between

sender and receiver? 9, 9

9. What do you mean by computer crime? Why a separate category for

computer crime is needed? Discuss , how a computer crime is hard to

prosecute. 18

UML PRACTICALS LIST

PRACTICAL - 1

Case Study: Library Management System

a) Derive Functional and Non-functional requirements.

b) Draw Use Case diagram.

c) Draw Class diagram.

d) Draw Interaction diagram.

PRACTICAL - 2

Case Study: Online Job Seeking System

a) Derive Functional and Non-functional requirements of the system.



PRACTICAL – 3

Case Study: Students Course Registration System

a. Derive Functional and Non-functional requirements.

b. Draw Use Case diagram

c. Draw Class diagram

d. Draw Sequence diagram

e. Draw State chart diagram

PRACTICAL - 4

Case Study: Pay Roll Processing System




PRACTICAL - 5

Case Study: Cellular Network




d) Draw Sequence diagram.

e) Draw State chart diagram.

f) Draw Activity diagram.

PRACTICAL - 6

Case Study: Automatic Teller Machine

a) Draw Use Case diagram.

b) Draw Sequence diagram.

PRACTICAL – 7

Case Study: Book

a. Draw Class diagram

b. Draw Object diagram

PRACTICAL - 8

Case Study: Pizza Shop

a) Draw Activity diagram.

b) Draw Activity diagram with exceptions.

PRACTICAL - 9

Implement the given UML class diagram in C++

CLASS DIAGRAM :

Person

- Name : String

- employer : Company

+ Person()

+ Person(name:String,empof :Company)()

+ showname() : void

Company

- name : string

- employees : Person

+ Company()

+ Company(name:String,emp[]:Person)()

+ showcompname() : void

+ hasemp(emp[]:Person)() : void

worksfor

*#employees

1#employer

Chair

- materialtype : string

- person : Person

+ Chair(materialtype:string,person:Person)()

sitson1 1

cd employee

PROGRAM - 10

Write a Program to implement following association.

CLASS DIAGRAM :

supplier

p[5] : part

sname[20] : char

suppid : int

getname() : void

getid() : void

supp_parts() : void

show() : void

part

*s[5] : supplier

name[20] : char

id : int

price : int

getname() : void

getid() : void

pshow(): void

* * Supplies

Practical List of Digital Image Processing

S. No. Name

1. To implement Image resizing.

2. To implement Spatial resolution reduction.

3. To reduce the size of an image.

4. To increase the size of an image by nearest neighbour interpolation.

5. To increase size of an image by bilinear interpolation.

6. To find connected components in an image.

7. To count no. of objects using connected components.

8. To calculate distance in an image using Euclidean, City Block, Chessboard distance

measures.

9. To display magnitude & phase of Fourier transform of an image.

10. To display magnitude & phase of Fourier transform of a synthetic image.

11. To implement phase interchange of two images.

12. To implement brightness & contrast modification.

13. To implement image negatives.

14. To implement log transformation.

15. To implement power law transformation.

16. To implement contrast stretching.

17. To extract 8 bit planes from an image.

18. To find histogram of an image.

19. To implement histogram equalization of an image.

20. To implement addition of two images.

21. To implement filtering with a mask with different way of image border handling.

22. To apply smoothing filters of diff. sizes.

23. To implement noise removal using smoothing filter.

24. To apply image sharpening using laplacian filter.

25. To apply image sharpening & high boost filtering.

26. To implement edge detection by various operations.

27. To implement edge detection using masks.

28. To remove salt & pepper noise using mean, median & max/min filters.

29. To implement Ideal Low Pass Filter in frequency domain.

30. To implement Spatial domain LPF converted into frequency domain.

31. To implement Homomorphic filter.

32. To separate RGB, HSV, YIQ components.

33. To implement pseudo colour image processing.

34. To implement colour complements.

35. To implement contrast enhancement of a colour image.

36. To implement smoothing of a colour image.

37. To implement sharpening of a colour image.

38. To implement edge detection of an image.

39. To implement noise reduction of an image.

40. To remove Gaussian noise using mean filter.

41. To remove salt & pepper noise using mean & median filter.

42. To implement deblurring using weiner filter.

43. To perform Huffman encoding & decoding.

44. To perform Arithmetic encoding & decoding.

45. To perform Run length encoding & decoding.

46. To perform Lossy predictive encoding & decoding.

47. To implement isolated point detection.

48. To implement line detection.

49. To implement edge detection using different methods.

50. To implement segmentation based on thresholding.