dev bhoomi institute of technology dehradun · dev bhoomi institute of technology dehradun...

DEV BHOOMI INSTITUTE OF

TECHNOLOGY

DEHRADUN Department of Computer Science and Engineering

HAND BOOK

Session 2017-18

Class :7th Sem/4th Year

Prerequisite: Knowledge of advanced topics in computer architectures focusing on emerging uni processor

and multiprocessor architectures, implementation issues (architect's perspective) in deep sub micron CMOS

Objective:

1) To identify and analyze the attributes of computer architecture design with recent trend technology

2) To identify the techniques to improve the speed and performance of computers – Parallelism in Instruction

level – Hardware approaches - pipelining,dynamic scheduling, superscalar processors, and multiple issue of

instructions.

3) To implement the design aspects and categorize various issues , causes and hazards due to parallelisms

4) To examine and compare the performance with benchmark standards

5) Its important to understand and apply that design principles in real systems.

Unit 1 Parallel computer models: The state of computing, Classification of parallel computers,

Multiprocessors and multicomputers, Multivector and SIMD computers.

Program and network properties: Conditions of parallelism, Data and resource Dependences,

Hardware and software parallelism, Program partitioning and scheduling, Grain Size and latency,

Program flow mechanisms, Control flow versus data flow, Data flow Architecture, Demand driven

mechanisms, Comparisons of flow mechanisms

Unit 2 System Interconnect Architectures: Network properties and routing, Static interconnection Networks,

Dynamic interconnection Networks, Multiprocessor system Interconnects, Hierarchical bus systems,

Crossbar switch and multiport memory, Multistage and combining network.

Advanced processors: Advanced processor technology, Instruction-set Architectures, CISC Scalar

Processors, RISC Scalar Processors, Superscalar Processors, VLIW Architectures, Vector and

Symbolic processors

Unit 3 Pipelining: Linear pipeline processor, nonlinear pipeline processor, Instruction pipeline Design,

Mechanisms for instruction pipelining, Dynamic instruction scheduling, Branch Handling techniques,

branch prediction, Arithmetic Pipeline Design

Memory Hierarchy Design: Cache basics & cache performance, reducing miss rate and miss

penalty, multilevel cache hierarchies, main memory organizations, design of memory hierarchies.

Memory consistency models: SC, PC,WO/WC, RC;

Unit 4

Dev Bhoomi Institute Of Technology

SEMESTER: IV

Department of Computer Science & Engineering

Course Level: Beginner Course Type: Core Credit:

Total Contact Hours: 40 LTP -3-1-0 External Marks/Internal Marks:

100/50

Course Title: ADVANCE COMPUTER

ARCHITECTURE

Course Code: TCS-702 Duration of External Exam: 3 Hours

Multiprocessor architectures: Symmetric shared memory architectures, distributed shared memory

architectures, cache coherence protocols (MSI, MESI, MOESI), scalable cache coherence, overview of

directory based approaches, design challenges of directory protocols, memory based directory

protocols, cache based directory protocols, synchronization. Introduction of OpenMP and MPI,

threads, mutex etc.

Unit 5 Introduction to multi-core architectures, multiprocessor Chip architecture case studies: Intel core 2

duo, Core i3, Core i5

Text Books:

1. Kai Hwang, “Advanced computer architecture”; TMH. 2000

2. D. A. Patterson and J. L. Hennessey, “Computer organization and design”, Morgan

Kaufmann, 2nd Ed. 2002

3. www.intel.com

Reference Books:

1. J.P. Hayes, “computer Architecture and organization”; MGH. 1998.

2. V. Rajaranam & C.S.R. Murthy, “Parallel computer- Theory and practices”; PHI. 2002.

3. J. Quin, “Parallel Computing”, TMH

4. R.K. Ghose, Rajan Moona & Phalguni Gupta, “Foundation of Parallel Processing”, Narosa

Publications, 2003

5. Kai Hwang and Zu, “Scalable Parallel Computers Architecture”, MGH. 2001

6. Stalling W, “Computer Organization & Architecture”, PHI. 2000

7. D.A. Patterson, J.L. Hennessy, “Computer Architecture :A quantitative approach”; Morgan

Kauffmann, 2002.

Course Outcome Description

CO1 Describe the operations of performance such as parallel computers ,SIMD computers

and have good knowledge of program and network properties.

CO2 Ability to utilize various techniques developed for System Interconnect Architectures

and Advanced processors

CO3 Describe the operations of performance such as pipelines ,dynamic scheduling branch

predictions, caches

CO4 Describe the operations of performance such as Symmetric shared memory

architectures, distributed shared memory architectures, cache coherence protocols

(MSI, MESI, MOESI).

CO5 Ability to understand the need for multi-core architectures and multiprocessor Chip

architecture

DBIT DEHRADUN

LESSON PLAN

SEM/YEAR: 8th

/4th

DEPARTMENT : CSE

COURSE: Advanced Computer Architecture COURSE CODE: TCS-702

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

Unit-1

1. The state of computing T1 1 Chalk

&Talk

2. Classification of parallel computers T1 1 PPT

3. Multiprocessors and multicomputers T1 & R1 2 PPT

4. Multivector and SIMD computers T1 & R1 1 PPT

7. Conditions of parallelism T1 & R1 1 Chalk

&Talk

8. Data and resource Dependences T1 & R1 1 Chalk

&Talk

9. Hardware and software parallelism T1 & R1 1 Chalk

&Talk

10. Program partitioning and scheduling T1 1 Chalk

&Talk

11. Grain Size and latency T1 1 Chalk

&Talk

12. Program flow mechanisms, Control flow versus data flow T1 1 PPT

13. Data flow Architecture, Demand driven

mechanisms, Comparisons of flow mechanisms

T1 1 PPT

Unit-2

14. System Interconnect Architectures: Network properties and

routing

T1 1 Chalk

&Talk

15. Static interconnection Networks T1 1 PPT

16. Dynamic interconnection Networks T1 1 PPT

17. Multiprocessor system Interconnects T1 1 Chalk

&Talk

18. Hierarchical bus systems T1 1 Chalk

&Talk

19. Crossbar switch and multiport memory R2 1 Chalk

&Talk

20. Multistage and combining network R2 1 PPT

21. Advanced processor technology T1 1 Chalk

&Talk

22. Instruction-set Architectures, CISC Scalar Processors T1 1 Chalk

&Talk

23. RISC Scalar Processors, Superscalar Processors T1 1 PPT

24. VLIW Architectures, Vector and Symbolic processors T1 1 PPT

Unit-3

25. Pipelining: Linear pipeline processor T1 1 Chalk

&Talk

26. nonlinear pipeline processor, Instruction pipeline Design T1 1 PPT

27. Mechanisms for instruction pipelining T1 1 PPT

28. Dynamic instruction scheduling, Branch Handling techniques T1 1 PPT

29. branch prediction, Arithmetic Pipeline Design T1 1 PPT

30 Memory Hierarchy Design: Cache basics & cache performance, T1 2 Chalk

reducing miss rate and miss

penalty

&Talk

31. multilevel cache hierarchies, main memory organizations T1 1 Chalk

&Talk

32. design of memory hierarchies. T1 1 PPT

33. Memory consistency models: SC, PC,WO/WC, RC; T1 2 Chalk

&Talk

Unit-4

34. Multiprocessor architectures: Symmetric shared memory

architectures

T1 1 PPT

35. distributed shared memory

architectures, cache coherence protocols (MSI, MESI, MOESI)

T1 1 PPT

36. scalable cache coherence, overview

of directory based approaches

T1 1 Chalk

&Talk

37. design challenges of directory protocols, memory based directory

protocols,

T1 1 Chalk

&Talk

38. cache based directory protocols, synchronization T1 1 Chalk

&Talk

39. Introduction of OpenMP and MPI,

threads, mutex etc

T1 1 Chalk

&Talk

Unit-5

40. Introduction to multi-core architectures T1 1 Chalk

&Talk

41. multiprocessor Chip architecture case studies T1 1 Chalk

&Talk

42. Intel core 2 duo T1 1 Chalk

&Talk

43. Core i3, Core i5 T1 1 Chalk

&Talk

Total Lectures: 45

REMARKS/RECOMMENDATIONS FOR FUTURE:

EXTRA CLASS TAKEN (IF ANY):

TEXT BOOKS:

[T1] Diane Tiare and Catherine Paquet, Campus Network Design Fundamentals , Pearson Education, 2006.

REFERENCE BOOKS:

[R1] Craig Zacker, The Complete Reference: Upgrading and Troubleshooting Networks , Tata

[R2] William Stallings, Cryptography and Network Security: Principals and Practice , Prentice Hall, New

Jersy.McGraw-Hill, 2000.

Signature of HOD:__________

Date: __________

1. What is the difference between Serial and Parallel Processing?

2. Discuss architectural evaluation from sequential scalar to vector processor and parallel

computers in detail.

3. What is the different system attributes used to judge the performance of the system?

4. What do you mean by parallelism in uniprocessor system? Identify the various

mechanisms that have been developed for this.

5. Discuss different ways to improve system performance.

6. Discuss architectural evaluation from sequential scalar to vector processor and parallel

computers in detail.

7. Explain any one classification of Parallel computers.

8. What is the different system attributes used to judge the performance of the system?

DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN ASSIGNMENT SHEET

Course Name: Advanced Computer Architecture Assignment No. 1

Course Code: TCS-702

Faculty : Mr. Dhajvir Singh Rai

Branch: CSE Semester: 7th

Unit/Title: Unit 1 Date of Issue: Date of Submission:

1. Differentiate between CISC and RISC scalar processor. Write an example of each.

2. Differentiate between static and dynamic Interconnection network. Name five

example of each.

3. Show recursive construction of baseline network. Draw a baseline network with 16(0-

15)nodes.

4. Differentiate between static and dynamic Interconnection network. Name five

example of each.

5. Explain VLIW architecture. How pipeline is done in VLIW architecture?

6. Differentiate between direct and indirect Interconnection network. Give two example

of each.

7. What is hypercube static interconnection network? Draw routing by-

a. By least significant bit Co

b. By middle bit C1

c. By most significant bit C2

For a 3-cube with modes denoted by in C2C1C0 binary

8. What is the significance of vector computing over scalar computing? Discuss multi-

vector supercomputer with the help of a diagram.







1. Explain cache addressing models. Differentiate between physical address caches and

virtual address caches?

2. Explain the aliasing problem in cache. Discuss the possible solution.

3. Compare and contrast set-associative mapping and sector caches.

4. Write short notes on cache performance issues.

5. Explain the role of memory manager in an operating system kerne.

6. What is hypercube static interconnection network? Draw routing by-

i.By least significant bit Co

ii.By middle bit C1

iii.By most significant bit C2

7. What is crossbar switches in interconnection network? Draw a 8*8 omega network

and explain how many nodes are required to build a 8*8 omega network?

8. Explain Data flow architecture. Write short on drawback of data flow architecture.


Course Name: :Advanced Computer Architecture Assignment No. 3

Course Code: TCS -702




1 Differentiate between DSB model and TSO model for week consistency memory

systems?

2 What are clocks skewing? Derive the effect of skew ‘s’ on clock period.

3 Derive speed up, efficiency and throughput for pipeline.

4 Discuss different mechanisms for instruction pipelining.

5 Differentiate between static instruction scheduling and dynamic instruction scheduling.

6 Discuss the effect of branching on pipeline throughput and efficiency. Derive the

expression for effective throughput.

7 What is pipeline stalling? Discuss.

8 Differentiate between in-order issue and out-of-order issue pipeline.

9 Consider the following reservation table for a four stage pipeline with a clock cycle of

2ns.

I. What are the forbidden latencies and initial collision vector.

II. Determine the MAL associated with the shortest Greedy cycle.







1. Write an algorithm that performs an SIMD matrix multiplication with a time

complexity.

2. Describe a multiport memory with private memories.

3. Describe how 1-by-8 demultipluxer is derived from 2*2 switches.

4. Given the circular diagram of a buffered 2*2 crossbar.

5. Write asynchronous parallel algorithms for finding the zeroes of a function f(x) using

Newton’s iteration method.

6. Explain briefly the methodology for everlasting the performance of a parallel

algorithm.

7. Compare data driven and dependence driven computing models.

8. Explain the multilevel program abstraction in the event driven data flow computing

model.


Course Name: :Advanced Computer Architecture Assignment No. 5





1. Consider the following HLL program. Detect the parallelism embedded in five

statements P1 P2 =P3 P4 and P5 in order

P1 C=D*E

P2 M= G+C

P3 A= B+C

P4 C=C+M

P5 F=G/E

Show the execution sequence with the diagram.

2. Explain different level of Instruction (Granularity of a program) in detail.

3. What Is the significance of grain packing in program? Explain with the help of an

example.

4. Two 2*2 matrix A and B are multiplied to compute the sum of the four elements in

matrix C=A*B. To calculate sum of C11,C12,C21,C22 calculate grain size and

communication latency if communication delay between two successive stages of

processors is 212 cycles.

Multiplication 101 cycles and addition fuses 8 cycles.

5. Differentiate between dataflow and control flow mechanism of computing.

DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN TUTORIAL SHEET

Course Name: Advanced Computer Architecture Tutorial Sheet No. 1


Faculty : Mr. Dhajvir Rai

Branch: CSE Semester:7th

Unit/Title: Unit 1 Date of Discussion:

1. An 8*8 omega network is built with 2*2 switches and perfect shuffle Interstage

connection . Answer the following

a) How many stages are required?

b) Calculate total number of switches

c) Permutation 𝜋=(0,7,6,4,2) (1,3) (5) is blocking or not ?

2. Show recursive construction of baseline network. Draw a baseline network with 16(0-

15) nodes.

3. Write short note-

a) Superscalar and vector processor

b) Vector and Symbolic processor

4. Differentiate between CISC and RISC scalar processor. Write an example of each.

5. Explain different Vector processing methods with suitable illustrations.



Course Code : TCS-702




7. Explain demand paging memory system with examples.

8. Explain the effects of block size, set number, associativity, and cache size on the

performance of set-associative cache organisation.

9. With each cache organization, explain the effect of block mapping policies on the hit

ratio issues.

10. With respect to flexibility in implementing block replacement algorithm, rank the four

cache organizations. Also justify the ranking order.

11. Determine the similarities and subtle differences among the conditions on sequential

consistency imposed by:

Lamport

Dubois et al

Sindhu et al

Respectively.







1. Explain in detail MESI and MOESI.

2. Explain computer arithmetic principles.

3. Explain cache basics and cache performance.

4. Explain multilevel cache hierarchies.

5. Explain static arithmetic principles.



Course Code: TCS -702




9. Explain the staging memory concept in MPP and instruction set of the MPP.

10. How new image processing techniques are developed using MPP.

11. Explain Asynchronous and synchronous pipelining models in detail with proper

diagram.

12. What is the mechanism of Instruction pipelining?

13. Explain branch prediction.







1. Explain hazard avoidance in instruction pipelining.

2. What is internal data forwarding?

3. Explain non linear pipelining?

4. Explain Instruction pipelining design?

5. Explain branch handling techniques?





Branch: CSE Semester:7th


1. What is the difference between Pipelining and Parallel Processing?

2. Discuss in brief how system attributes like instruction set architecture and compiler

technology effect different performance factor?

3. Classify different shared memory multiprocessor architectures.

4. What are different data and resource dependencies of parallelism? How Berstein

conditions are used to detect maximum parallelism?

5. Discuss the mismatch between software and hardware parallelism. How it can be

solved?







1. Explain linear pipelining.

2. Explain Distributed shared memory architecture.

3. Explain cache based directory protocols.

4. Explain OpenMP.

5. Define threads?







Prerequisite: Fundamentals of database systems design and SQL

Objective:

1. Provide students with the opportunity to build upon the knowledge learned in Database Systems 2. Prepare students for an entry-level database administration position 3. Demonstrate to students how to manage database services and clients

4. Demonstrate to students how to implement and configure a database environment

5.Explain to students best practices for data management

6.Demonstrate and apply database optimization, maintenance and recovery procedures

UNIT 1 DBA Fundamental I

Oracle Architectural Components, Getting Started With Oracle Server , Managing an Oracle Instance,

Creating a Database, Data Dictionary Contents and Usage, Maintaining the Control File, Redo Log Files,

Managing Tablespaces and Data Files, Storage Structures and Relationships, Managing Undo Data, Tables,

Indexes, Maintaining Data Integrity, Managing Password, Managing Security, Resources, users, Privileges &

Roles, Loading Data Into a Database & Globalization Support

UNIT 2 DBA Fundamental II

Networking Overview, Basic Oracle Net Architecture, Server-Side Configuration, Basic Oracle Net Services

Client-Side Configuration, Usage and Configuration of the Oracle Shared Server, Backup and Recovery

Overview, Instance and Media Recovery Structures, Configuring the Database Archiving Mode, Oracle

Recovery Manager Overview and Configuration, User Managed Backups, RMAN Backups, User Managed

Complete & Incomplete Recovery, RMAN Complete Recovery, Incomplete Recovery & Maintenance,

Recovery Catalog Creation and Maintenance, Transporting Data Between Databases

UNIT 3 Performance Tuning

Overview Of Oracle 9i Performance Tuning, Diagnostic and Tuning Tools, Sizing the Shared Pool & the

Buffer Cache, Sizing The Other SGA Structures, Database Configuration and I/O Issues, Optimizing Sort

Operations, Diagnosing Contention For Latches, Tuning Rollback Segments, Monitoring and Detecting Lock

Contention, Tuning The Oracle Shared Server, Application Tuning, Using Oracle Blocks Efficiently

SQL Statement Tuning, Tuning the OS and Using Resource Manager


SEMESTER: IV


Course Level: Intermediate Course Type: Core Credit:


100/50

Course Title : DATABASE

ADMINISTRATION Course Code: TCS-082/TIT-083 Duration of External Exam: 3

Hours

UNIT 4 Managing Oracle

Oracle10i: Overview, Preparing the Operating System & Install Oracle9i Software, Create a Custom Oracle

Database, Install and Configure Enterprise Manager, Customize the Oracle Database Linux Measurement

Tools, Oracle Measurement Tools, Tuning Oracle

UNIT 5 Database Troubleshooting

One Time Troubleshooting, Adhoc Troubleshooting, Escalations, Connectivity, Business Continuity, High

Availability and Scalability, Data Sharing and information Integration

BOOKS: For Oracle:

1. Oracle Database Administrator’s Guide 2. Oracle DBA Handbook


CO1 To learn the basic concepts of DBMS and Oracle architecture

CO2 Explain and analyze oracle net architecture and services

CO3 Ability to understand Oracle 9i Performance Tuning

CO4 Preparing the Operating System & Install Oracle9i Software and understanding oracle

measurement tools.

CO5 Understanding database troubleshooting techniques

Prerequisite: Knowledge of UNIX & Shell Programming

Objective: 1. To understand the various techniques of Administration tool and processes.

2. To design and implement network, utilities and security features.

3. Understanding NT/Novell environment interoperating with WAN/LAN connectivity.

4. Understanding TCP/IP and network security.

Unit-I

Introduction: Duties of the Administrator, Administration tools, Overview of permissions.

Processes: Process status, Killing processes, process priority. Starting up and Shut down:

Peripherals, Kernel loading, Console, The scheduler, init and the inittab file, Run-levels, Run

level scripts.

Managing User Accounts: Principles, password file, Password security, Shadow file,

Groups and the group file, Shells, restricted shells, user management commands, homes and

permissions, default files, profiles, locking accounts, setting passwords, Switching user,

Switching group, Removing users.

Unit - II

Managing Unix File Systems: Partitions, Swap space, Device files, Raw and Block files,

Formatting disks, Making file systems, Superblock, I-nodes, File system checker, Mounting

file systems, Logical Volumes, Network File systems, Boot disks

Configuring the TCP/IP Networking : Kernel Configuration; Mounting the /proc File

system, Installing the Binaries, Setting the Hostname, Assigning IP Addresses, Creating

Subnets, Writing hosts and networks Files, Interface Configuration for IP, ifconfig, netstat

command, Checking the ARP Tables; Name service and resolver configuration.

Unit- III

TCP/IP Firewall : Methods of Attack, What Is a Firewall? What Is IP Filtering? Setting Up

Linux for Firewalling Testing a Firewall Configuration; A Sample Firewall Configuration:

IPAccounting, Configuring the Kernel for IP Accounting, Configuring IP Accounting, Using

IPAccounting Results

IP Masquerade and Network Address Translation : Side Effects and Fringe Benefits,

Configuring the Kernel for IP Masquerade, Configuring IP Masquerade.

Unit-IV

The Network Information System : Getting Acquainted with NIS, NIS Versus NIS+ , The

Client Side of NIS, Running an NIS Server, NIS Server Security.

Network file system: Preparing NFS, Mounting an NFS Volume, The NFS Daemons, The

exports File.


SEMESTER: IV




100/50

Course Title: System Administration Course Code: TCS- 701 Duration of External Exam: 3

Hours

System Backup & Recovery: Log files for system and applications; Backup schedules and

methods (manual and automated).

Unit- V

Active Directory, LDAP

Text Books:

1. L.L. Beck – “System Software “ (3rd Ed.)- Pearson Education 2. Michel Ticher – “PC System Programming”, Abacus 3. Kirch – “ Linux network Administrator’s guide (2nd Ed.)” – O’Rielly 4. Maxwell – “Unix system administration” – TMH 5. Limoncelli –“The Practice of System & Network Administration”-Pearson 6. Wells, LINUX Installation & Administration, Vikas

Reference Books:

E. Nemeth, G. Snyder, S. Seebass, T. R. Hein – “ Unix system administration

handbook” – Pearson Education


CO1 Demonstrate essential IT support skills including installing, configuring,

securing and troubleshooting operating systems and hardware.

CO2 Ability to develop a network and file system according requirement.

CO3 Demonstrate the ability to research technology problems, provide

security to various web threats, and to learn new technology tools.

CO4 Troubleshoot software and hardware problems on a personal computer

(PC); install new PC components; develop skills required to research

hardware components and their associated software drivers.

CO5 Ability to understand new technology such as LDAP

DBIT DEHRADUN

LESSON PLAN

SEMESTER/YEAR: VIIth

/4th

DEPARTMENT: CSE

COURSE: SYSTEM ADMINISTRATION COURSE CODE: TCS-701

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

1. Introduction: Duties of the Administrator T1 1 Chalk &Talk

2. Administration tools, Overview of permissions T1 1 Chalk &Talk

3. Processes: Process status, Killing processes, process priority R1 1 Chalk &Talk

4. Starting up and Shut down: Peripherals, Kernel loading T2 2 Chalk &Talk

and PPT

5. Console, The scheduler, init and the inittab file, Run-levels,

Runlevel scripts.

T2 1 Chalk &Talk

6. Managing User Accounts: Principles,password file, Password

security, Shadow file,Groups and the group file, Shells,

restricted shells

R1 2 Chalk &Talk

and PPT

7. user management commands, homes and permissions, default

files, profiles, locking accounts, setting passwords

R1 2 Chalk &Talk

8. Switching user,Switching group, Removing users. T2 1 Chalk &Talk

and PPT

9. Managing Unix File Systems: Partitions, Swap space, Device

files

T1 1 Chalk &Talk

10. Raw and Block files,Formatting disks, Making file systems,

Superblock, I-nodes

T2 1 Chalk &Talk

11. File system checker, Mountingfile systems, Logical Volumes,

Network File systems, Boot disks

R1 2 Chalk &Talk

12. Configuring the TCP/IP Networking : Kernel Configuration;

Mounting the /proc Filesystem

R1 1 PPT

13. Installing the Binaries, Setting the Hostname, Assigning IP

Addresses, CreatingSubnets

R1 2 PPT

14. Writing hosts and networks Files, Interface Configuration for IP,

ifconfig

T1 2 Chalk &Talk

15. netstatcommand, Checking the ARP Tables; Name service and

resolver configuration

T1 1 PPT

16. TCP/IP Firewall : Methods of Attack, What Is a Firewall? What Is

IP Filtering?

T1 2 Chalk &Talk

17. Setting UpLinux for Firewalling Testing a Firewall Configuration;

A Sample Firewall Configuration

T2 1 Chalk &Talk

18. IPAccounting, Configuring the Kernel for IP Accounting T2 1 PPT

19. Configuring IP Accounting, UsingIPAccounting Results R1 2 PPT

20. IP Masquerade and Network Address Translation : Side Effects

and Fringe Benefits

T2 1 Chalk &Talk

21. Configuring the Kernel for IP Masquerade, Configuring IP

Masquerade

T1 1 PPT

22. The Network Information System : Getting Acquainted with NIS R1 1 Chalk &Talk

Total Lectures: 41



TEXT BOOKS:

[T1] L.L. Beck – System Software (3rd Ed.)- Pearson Education

[T2] Michel Ticher – PC System Programming , Abacus

Reference Books:

[R1] E. Nemeth, G. Snyder, S. Seebass, T. R. Hein – Unix system administration handbook – Pearson

Education


Date: __________

23. NIS Versus NIS+ , The Client Side of NIS, Running an NIS Server,

NIS Server Security

R1 2 Chalk &Talk

24. The NFS Daemons, exports File. T1 2 PPT

25. System Backup & Recovery: Log files for system and

applications

R1 1 PPT

26. Backup schedules andmethods (manual and automated). T2 2 PPT

27. Active Directory T1 2 PPT

28. LDAP T2 2 PPT

Q1. What is the need of system administrator?

Q2. How do you change file access permissions?

Q3. What is a process? How UNIX identifies a process?

Q4. What are different administrative tools? Explain kill process with the help of an

example.

Q5. What do you mean by run level? Explain the difference between a shell and kernel.

DEV BHOOMI INSTITUTE OF TECHNOLOGY,

DEHRADUN ASSIGNMENT SHEET

Course Name: System Administration Assignment No. 1

Course Code: TCS 701 Faculty: Ankit Maithani


Unit/Title:1

Date of Conduction:

Q1. How do you change file access permissions?

Q2. Explain various information which password file contain. How do we provide

password security?

Q3. Explain locking and unlocking of account with an example.

Q4. What is a shell? Explain the working of a shell.

Q5. What is a file structure? How it is organized.






Unit/Title:2

Date of Conduction:

Q1. Define firewall. Explain its types.

Q2. Explain the function of IP masquerade and Network address translation.

Q3. What are different methods of attack?

Q4. Write down the steps to configure firewall in Linux operating system.

Q5. Discuss in detail configuration settings of firewall in Linux.






Unit/Title:3

Date of Conduction:

Q1. What do you mean by starting and stopping NFS?

Q2. What do you mean by mounting a NFS Volume?

Q3. What are shadow files? How they work?

Q4. Why is backup important? Explain different kinds of tools for it.

Q5. State features of NFS and NFS daemons. What is function of export file in NFS?

Q6. What is NIS? Explain various maps used in NIS.






Unit/Title:4

Date of Conduction:

Q1. State the differences between LDAP and active directories.

Q2. Explain the active directory in Linux Operating system.

Q3. What are the different partitions in active directory? Explain all of them.

Q4. What do you mean by active directory and LDAP?

Q5. What is LVM? What is the use of ns switch and host configuration file?






Unit/Title:5

Date of Conduction:

1. Explain the 5-major role of the System Administration.

2. Give an overview of various permissions and roles for a System Administration.

3. What are the various components of a process?


Course Name: System Administration Tutorial Sheet No. 1

Course Code: TCS 701

Faculty: Ankit Maithani


Unit/Title: UNIT 1 Introduction Date of Discussion:

1. How can you kill a process using the kill command?

2. Write the short notes on: Swap Space and File System Checker.

3. Explain boot process and shut down process in Linux system.






Unit/Title: UNIT 1 Introduction Date of Discussion:

1. Explain the duties of the kernel with real time example.

2. How can you access any file system under LINUX SYSTEM.

3. Write the process of swap partition.




Faculty : Ankit Maithani Branch: CSE Semester: 7th

Unit/Title: Unit-I&II Introduction, Managing Unix File Systems Date of Discussion:

1. Explain any eight commands with syntax in LINUX operating System?

2. Write the short notes on Kernel loading and Console in Linux.

3. Explain mounting and unmounting in file system.




Faculty : Ankit Maithani


Unit/Title: Unit-I&II Introduction, Managing Unix File Systems Date of Discussion:

1. Describe Raw and Block files in Linux system.

2. Explain Name service and resolver configuration in Linux system.

3. How do you mean by formatting? How formatting is done in UNIX?






Unit/Title: Unit-II Managing Unix File Systems Date of Discussion:

1. Discuss the importance of firewall in networks?

2. What do you mean by IP Accounting? Why it is so important?

3. How can we mount an NFS volume?






Unit/Title: Unit-II&III Managing Unix File Systems,TCP/IP Firewall Date of Discussion:

1. What is the difference between NIS and NIS+ ?

2. What do you mean by soft mounted and hard mounted?

3. What is Network File System? Explain its main feature?






Unit/Title: Unit-IV The Network Information System Date of Discussion:

1. Explain NIS client and server over the network.

2. Define Light weighted Directory Access Protocol (LDAP)? Define its main goals?

3. What are Single server operations in Active Directory?




Faculty : Ankit Maithani Branch: CSE Semester: 7th

Unit/Title: Unit-IV& V Date of Discussion:

1. Explain the essential role of the System Administration.

2. Give an overview of various permissions and roles for a System Administration.

3. What do you mean by a process? What are the various components of a process?

4. How can you kill a process using the kill command? Also give its syntax.

5. Define process states. Give all the states of the process.

6. How can boot process and shutdown process is executed in Linux system.

7. What is kernel? Explain the duties of the kernel.

8. What is meant by multi user and multi tasking operating system?

9. What is Password file? Explain various information which password file contain?

How do we provide password security?

10. What is the RUN Level in UNIX/LINUX Operating System? Describe RUN level

Script?

11. Explain the different types of permissions assigned to System Administration?

12. Write the short notes on: Swap Space and File System Checker

13. Explain any five commands with syntax in LINUX operating System?

DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN QUESTION BANK

Course Name: System Administration Question bank no. 1




Unit/Title: UNIT 1

Date of Conduction:

1. What is I-NODE? What is the use of I-NODE? What information is stored in I-NODE?

2. What are the various steps involved in logging into UNIX/LINUX/WINDOWS?

3. What is Partition? What are the benefits of Partitions?

4. Discuss in details about log files.

5. Discuss the various steps to mounting the proc file system and kernel configuration.

6. What is Network File System? How can you access any file system under LINUX?

Explain the format of the mount command with the help of examples.

7. How can you manage swap space in LINUX?

8. How do you mean by formatting? How formatting is done in UNIX?

9. What do you mean by logical volume? What are different types of logical volume ?

10. Write the methods of setting the hostnames in unix ?

11. What is Interface configuration for IP ? Explain various types of interfaces in details ?

12. What are the commands for checking the ARP tables in UNIX?

13. Explain the different issues in TCP/IP networking.

14. How DNS works? Explain its working in details.






Unit/Title: UNIT 2

Date of Conduction:

1. What is Firewall? Discuss the importance of firewall in networks?

2. What do you mean by Network Address Translation (NAT)?

3. What do you mean by IP masquerade? What are the side effects and fringe benefits of IP

masquerade?

4. Discuss various methods of attack and methods to prevent them.

5. What is IP Filtering? How we can build Linux IP firewalls?

6. What do you mean by IP Accounting? Why it is so important?

7. What are the side effects and fringe benefits of IP masquerade ?






Unit/Title: UNIT 3

Date of Conduction:

1. Differentiate between NIS and NIS+? How can we run an NIS Server?

2. What is Network File System? Explain its main feature? How can we mount an NFS

volume?

3. What do you means by Soft-mounted and Hard-mounted? Explain exports File.

4. Explain Network Information System?

5. What are main security flaw in NIS Server? How can we overcome from them?

6. What do you mean by soft mounted and hard mounted?

7. What do you mean by term Backups? Why we make backup?

8. What are the other types of backup products available in Linux?






Unit/Title: UNIT 4

Date of Conduction:

DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN

1. Define Light weighted Directory Access Protocol (LDAP)? Define its main goals?

2. What are the various components of an LDAP entry?

3. What are the various operations of LDAP?

4. What do you mean by the term “Schema”? Define it.

5. What do you mean by Active Directory?

6. What are Single server operations in Active Directory?

7. What is Active Directory Lightweight Directory Service?

QUESTION BANK





Unit/Title: UNIT 5

Date of Conduction:

Prerequisite: Knowledge of Computer Network

Objective:

1. To understand the history of networks and their evolution and describe the various forms of

network addressing, including DNS 2.To investigate novel ideas in the area of Networking via term-long research projects 3. List and describe different network standards and protocols

Unit – 1 Introduction

Liberalization of communications Industry, Digitalization of content, changes in spectrum

management, cellular reuse, drive towards broadband, IEEE 802.11 networks

Unit – 2 Wireless Network Systems

Cellular networks

Tthe GSM circuit switched network, GSM channel structure, Authentication and location

updating, physical channels, TMN

GPRS

Introduction to GPRS, contexts, PDP context, Mobility management context, MS-SGSN

physical layer, MS-SGSN protocols, GPRS operations

Unit – 3 Principles of access network planning

Circuit voice networks

Introduction to CVN, coverage, capacity, planning for circuit multimedia services

Planning for packet multimedia services

Planning approaches, buffer-pipe model, characterization of applications, practical modeling

methodologies, multiuser packet transport configurations

Unit – 4 Planning and design

RAN, GSM RAN, UMTS RAN, Cellular OFDM RAN, Mesh network

Unit – 5 Network operation and optimization

Enhanced telecom operations model (eTOM), wireless network life cycle – strategy,

infrastructure and product, operations, enterprise management, GSM network performance

optimization – principles and key performance indicators, coverage optimization, GPRS RAN

optimization, UMTS network performance optimization


SEMESTER: IV




100/50

Course Title :WIRELESS NETWORKS Course Code: TCS-073/TIT-073 Duration of External Exam: 3

Hours

Text Books:

1. Deploying Wireless networks, Andy wilton, Tim charity, Cambridge university press

2. Fundamental of Wireless Networking, Ron Price, TMH

3. 3G Wireless Networks, Clint Smity, TMH

4. Essentials


CO1 Understand and analyze proposed protocols at computer network, MAC and routing

layers of WSN

CO2 Ability to design and evaluate a component or system to meet desired needs within the

field of wireless network

CO3 Ability to apply knowledge of mathematics, basic science, and engineering to solve

problems encompassing fundamental areas of wireless communications, with greatest

emphasis by option

CO4 Understanding of contemporary engineering and societal issues, and the impact of

engineering decisions on society in both a local and global context

CO5 Understand and analyze Network operation and optimization

1) What are the applications and limitation of wireless networks?

2) Discuss about the cellular system.

3) Describe the features of IEEE 802.11

4) What are the uses of communication in industries?

5) Explain the various types of Handover/Hand off in GSM.

6) What is spread spectrum in wireless communication network?

7) What is the difference between FDMA and TDMA?

8) What is the difference between TDMA and CDMA?


ASSIGNMENT SHEET

Course Name: Wireless Networks Assignment No. 1

Course Code: CS-014

Faculty : Preeti Raturi

Branch: CSE Semester: VII

Unit/Title: I/ Introduction of Wireless Network

Date of Issue: Date of

Submission:

1) What is PDP context and also explain about the Ad Hoc network.

2) Explain in detail the difference types of channels used in GSM network. Explain the

architecture of GSM.

3) Explain the process of planning the UMTS radio access network design.

4) What do you understand by Mesh Network? Explain the working of orthogonal frequency

multiplexing cellular system.

5) Explain the functioning of GPRS architecture with suitable diagram and also describe its

services and applications.

6) Explain the concept of frequency reuse in cellular networks with suitable example and

diagram.

7) Explain buffer-pipe model used in packet multimedia services with an example.

8) What are the principles and key performance indicators for GSM network performance

optimization. Discuss GPRS radio access network optimization.


ASSIGNMENT SHEET


Course Code: CS-014



Unit/Title: II/ Wireless Network Systems


Submission:

1) Explain Circuit Voice Network in Details and also describe its applications.

2) What are the required principles to access network planning?

3) Describe the planning for circuit multimedia services.

4) Describe the planning for packet multimedia services.

5) What is the buffer pipe model explain it with diagram and detail.

6) What are parameters used to design for the circuit voice network?

7) Differentiate between Circuit switching and packet switching network.

8) Explain the practical medeling methodologies and multiuser packet transport

configurations.


ASSIGNMENT SHEET


Course Code: CS-014



Unit/Title: III/ Circuit Voice Network


Submission:

1) What do you mean by Radio Access Network? Explain its application.

2) Explain the type of Radio Access Network in details.

3) Draw the architecture of UMTS RAN and describe it’s working.

4) What is cellular OFDM Radio Access Network?

5) Explain the Mesh Network. What is role of Mesh Network in the Wireless

Communication?

6) Explain the different techniques of technologies for Wireless Geo location with necessary

diagram.


ASSIGNMENT SHEET


Course Code: CS-014



Unit/Title: IV/ Planning and Design


Submission:

1) Discuss the Enhanced Telecom Operation Model (eTOM) used as standard for business

processes in the telecommunications industry in detail.

2) What are the principles and key performance indicators for GSM network performance

optimization.

3) Discuss GPRS radio access network optimization.

4) Define the 3G cellular system.

5) What is meant by cell breathing effect?

6) Discuss the Universal Mobile Telecommunication system (UMTS) network performance

optimization through design.

7) What is the use of Channels in the wireless network and how many types of channels

used?

8) Explain the GSM network performance optimization – principles and key performance

indicators, coverage optimization and UMTS network performance optimization


ASSIGNMENT SHEET


Course Code: CS-014



Unit/Title: V/ Network operations and Optimization.


Submission:

1) What is the wireless network in industries and explain its real life application.

2) Discuss the Generations of Wireless Communication or Network.

3) Write the Short notes on:

a. First Generation (1G)

b. Second Generation(2G)

c. Third Generation(3G)

4) Differentiate the Analog Technology and Digital Technology in Details with example


Course Name: Wireless Networks Tutorial Sheet No. 1

Course Code: CS-014



Unit/Title: I/ Introduction Date of Discussion:

1) Write the Short Notes on:

a. TDMA

b. FDMA

c. CDMA

2) What is Spread Spectrum? Explain the Cellular Network.

3) Discuss the Frequency Reuse in Cellular Network with diagram

4) Describe the IEEE 802.1 1 Networks.



Course Code: CS-014



Unit/Title: I/ Introduction Date of Discussion:

1) Explain the GSM Circuit Switched Network in Deetail.

2) Draw the GSM architecture and also explain its services and applications.

3) How many types of channels works during a call. Explain these in details.

4) Explain the Hand off and Handover technique.



Course Code: CS-014



Unit/Title: II/ Wireless Network System Date of Discussion:

1) Explain GPRS architecture, its service and applications.

2) Discuss the TDMA frame structure.

3) What is PDP address and PDP Context in the wireless system?

4) What are the types of GPRS operations? Explain these with details.



Course Code: CS-014



Unit/Title: III/ Wireless Network System Date of Discussion:

1) What is Circuit switched network? Discuss Circuit Voice network.

2) How to install the BTS in the real life and what are the parameters used to install them.

3) How to increase the network capacity and call routing.



Course Code: CS-014



Unit/Title: IV/ Planning and Design Date of Discussion:

1) Discuss the planning for packet multimedia services.

2) Discuss the buffer pipe model for the packet based network.

3) Explain planning for Coverage and capacity.



Course Code: CS-014




1) Discuss the Radio Access Network with Network.

2) Discuss the RAN types in wireless network.

3) Discuss the Cellular Orthogonal Frequency Division Modulation Radio Access Network.

4) How to create Mesh Network in Wireless Network.



Course Code: CS-014




1) Discuss the Enhanced telecom operations model (eTOM) in Wireless Network.

2) Discuss the wireless network life cycle and strategy.

3) Discuss GSM network performance optimization – principles and key performance

indicators, coverage optimization.

4) Discuss the RAN optimization and UMTS optimization.



Course Code: CS-014



Unit/Title: V/ Planning and Design Date of Discussion:

1) What do you mean by “capacity on Demand” principle in GPRS network.

2) Explain the function of GPRS support node in a GPRS network. Also differentiate between

GGSN and SGSN.

3) Short Notes on:

i. HPNA and Home Access Network

ii. Simulation and ARC tool

4) Explain the MAC management sub layer in terms of hand off and power management.



Course Code: CS-014



Unit/Title: V/ Planning and Design Date of Discussion:

1. Define – Spread Spectrum

2. What are the spread spectrum techniques?

3. What is the principle behind FHSS?

4. What are the major issues in WLAN?

5. List out the applications of WLAN

6. What is IEEE 802.11?

7. What is WIMAX?

8. Write the throughput feature in WIMAX.

9. What is UMTS? List important features of the UMTS air interface.

10. Discuss forward and reverse link channels in the CDMA 2000.


Course Name: Wireless Networks Question bank no. 1

Course Code: CS-014

Faculty: Preeti Raturi


Unit/Title: UNIT 1

Date of Conduction:

1. Differentiate between frequency hopping and direct sequence spread spectrum.

2. What are various states in Bluetooth system? Explain difference between them.

3. Difference between registration and call establishment.

4. What are the reasons to perform handoff?

5. Difference between network decided and mobile assisted handovers?

6. Name five most important logical channels in GSM.


Course Name: Wireless Networks Question bank No. 2

Course Code: CS-014



Unit/Title: UNIT 2

Date of Conduction:

1. What are the three types of bursts?

2. What are the three types of control channels?

3. Draw the protocol architecture of GSM and explain in detail

4. What is GPRS? Explain in detail about GPRS.

5. Name three sub systems in the GSM architecture. 15.

6. What are VLR and HLR and why we need them?

7. Name the connectionless and connection oriented services provided by the GPRS?



Course Code: CS-014



Unit/Title: UNIT 3

Date of Conduction:

1. Expand ESS and BSS in the IEEE802.11?

2. What is buffer pipe model?

3. Explain the architecture of GSM RAN.

4. Explain the wireless network life cycle. What is the significance of strategy and infrastructure in

wireless life cycle?

5. How the CVN networks are characterized according to coverage and capacity?

6. Why the cellular concept gave hexagonal pattern to denote a geographical location?



Course Code: CS-014



Unit/Title: UNIT 4

Date of Conduction:

1. What is cell? What are the cell reuse factors?

2. What is frequency reuse? How is it achieved?

3. Explain the liberalization of communication industry.

4. Explain the different phases of PDP context.

5. Give the architecture of GSM channel structure.

6. How authentication and location updating performed in a GSM network?

7. Give the architecture of GPRS network.

8. What are the roles of GGSN and SGSN?

9. What is mobility management in GSM networks?

10. What are handovers? How are they handled?

11. Explain eTOM.

12. What are the various factors that influence the performance of a wireless network?

13. Explain cellular OFDM RAN with its architecture.



Course Code: CS-014



Unit/Title: UNIT 5

Date of Conduction:

Prerequisite: To understand fundamentals in 2-D digital image processing with emphasis in image

processing techniques, image filtering design and applications.

Objective: 1.Develop a theoretical foundation of fundamental Digital Image Processing concepts

2. Provide mathematical foundations for digital manipulation of images; image acquisition; preprocessing;

segmentation; Fourier domain processing; and compression.

3. Gain experience and practical techniques to write programs using MATLAB language for digital manipulation

of images; image acquisition; preprocessing; segmentation; Fourier domain processing; and compression.

UNIT-I Introduction and Fundamentals

Motivation and Perspective, Applications, Components of Image Processing System, Element of Visual

Perception, A Simple Image Model, Sampling and Quantization.

Image Enhancement in Spatial Domain: Introduction; Basic Gray Level Functions – Piecewise- Linear Transformation Functions: Contrast Stretching; Histogram Specification; Histogram

Equalization; Local Enhancement; Enhancement using Arithmetic/Logic Operations – Image

Subtraction, Image Averaging;

Basics of Spatial Filtering; Smoothing - Mean filter, Ordered Statistic Filter; Sharpening – The

Laplacian.

UNIT-II

Image Enhancement in Frequency Domain

Fourier Transform and the Frequency Domain, Basis of Filtering in Frequency Domain, Filters –

Low-pass, High-pass; Correspondence Between Filtering in Spatial and Frequency Domain;

Smoothing Frequency Domain Filters – Gaussian Lowpass Filters; Sharpening Frequency Domain

Filters – Gaussian Highpass Filters; Homomorphic Filtering.

Image Restoration: A Model of Restoration Process, Noise Models, Restoration in the presence of

Noise only-Spatial Filtering – Mean Filters: Arithmetic Mean filter, Geometric Mean Filter, Order

Statistic Filters – Median Filter, Max and Min filters; Periodic Noise Reduction by Frequency Domain

Filtering – Bandpass Filters; Minimum Mean-square Error Restoration.

UNIT-III

Color Image Processing

Color Fundamentals, Color Models, Converting Colors to different models, Color Transformation,

Smoothing and Sharpening, Color Segmentation.

Morphological Image Processing: Introduction, Logic Operations involving Binary Images, Dilation

and Erosion, Opening and Closing, Morphological Algorithms – Boundary Extraction, Region Filling,

Extraction of Connected Components.


SEMESTER: IV




100/50

Course Title : DIGITAL IMAGE

PROCESSING Course Code: TCS-071 Duration of External Exam: 3

Hours

UNIT-IV

Registration

Introduction, Geometric Transformation – Plane to Plane transformation, Mapping, Stereo Imaging –

Algorithms to Establish Correspondence, Algorithms to Recover Depth

Segmentation: Introduction, Region Extraction, Pixel-Based Approach, Multi-level Thresholding, Local Thresholding, Region-based Approach, Edge and Line Detection: Edge Detection, Edge

Operators, Pattern Fitting Approach, Edge Linking and Edge Following.

UNIT-V

Feature Extraction: Representation, Topological Attributes, Geometric Attributes

Description: Boundary-based Description, Region-based Description, Relationship.

Object Recognition: Deterministic Methods, Clustering, Statistical Classification, Syntactic

Recognition, Tree Search, Graph Matching

Books:

1. Rafael C. Gonzalvez and Richard E. Woods, Digital Image Processing 2nd Edition,.; PHI.

2. B. Chanda, D.D. Majumder, “Digital Image Processing & Analysis”, PHI

3. R.J. Schalkoff; Digital Image Processing and Computer Vision, John Wiley and Sons, NY

4. A.K. Jain; Fundamentals of Digital Image Processing, Prentice Hall, Upper Saddle River, NJ.

UK Tech University, Dehradun B. Tech. CSE 4th

Year 25


CO1 Have a clear understanding of the principals the Digital Image Processing

terminology used to describe features of images.

CO2 Have a good understanding of the mathematical foundations for digital manipulation

of images; image acquisition; preprocessing; segmentation; Fourier domain

processing, compression and analysis

CO3 Be able to write programs using Matlab language for digital manipulation of images;

image acquisition; preprocessing; segmentation; Fourier domain processing; and

compression.

CO4 Be able to understand the documentation for, and make use of, the MATLAB library

and MATLAB Digital Image Processing Toolbox (IPT).

CO5 Understand the Image Restoration, Compression, Segmentation, Recognition,

Representation and Description.

DBIT DEHRADUN

LESSON PLAN

SEMESTER/YEAR: VII /IV DEPARTMENT: CSE

COURSE: DIGITAL IMAGE PROCESSING COURSE CODE: TCS-071

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

UNIT - I

1 Motivation and Perspective, Applications T1,R1 1 Chalk &Talk

2 Components of Image Processing System, Element of Visual

Perception

T1,R1 2 Chalk &Talk

3 A Simple Image Model, Sampling and Quantization T1,R1 1 Chalk &Talk

4 Image Enhancement in Spatial Domain: Introduction; Basic

Gray Level Functions

T1,R1 1 Chalk &Talk

5 PiecewiseLinear Transformation Functions: Contrast Stretching T1,R1 1 Chalk &Talk

6. Histogram Specification; Histogram Equalization; Local

Enhancement

T1,R1 1 Chalk &Talk

7 Enhancement using Arithmetic/Logic Operations – Image

Subtraction, Image Averaging

T1,R1 1 Chalk &Talk

8 Basics of Spatial Filtering; Smoothing - Mean filter, Ordered

Statistic Filter; Sharpening – The Laplacian

T1,R1 1 Chalk &Talk

UNIT – II

9 Fourier Transform and the Frequency Domain, Basis of Filtering

in Frequency Domain

T1,R1 2 Chalk &Talk

10 Filters – Low-pass, High-pass; Correspondence Between

Filtering in Spatial and Frequency Domain

T1,R1 2 Chalk &Talk

11 Smoothing Frequency Domain Filters – Gaussian Lowpass

Filters; Sharpening

T1,R1,R2 1 Chalk &Talk

12 Frequency Domain Filters – Gaussian Highpass Filters;

Homomorphic Filtering

T1,R1 2 Chalk &Talk

13 Image Restoration: A Model of Restoration Process, Noise

Models,


14 Restoration in the presence of Noise only-Spatial Filtering –

Mean Filters: Arithmetic Mean filter

T1,R1 2 Chalk &Talk

15 Geometric Mean Filter, Order Statistic Filters – Median Filter,

Max and Min filters

T1,R1 1 Chalk &Talk

16 Periodic Noise Reduction by Frequency Domain Filtering –

Bandpass Filters

T1,R1 2 Chalk &Talk

17 Minimum Mean-square Error Restoration T1,R1 1 Chalk &Talk

UNIT – III

18 Color Image Processing Color Fundamentals, Color Models,

Converting Colors to different models

T1,R2 2 Chalk &Talk

19 Color Transformation, Smoothing and Sharpening, Color

Segmentation

T1,R1 1 Chalk &Talk

20 Morphological Image Processing: Introduction, Logic T1,R2 2 Chalk &Talk

Operations involving Binary Images, Dilation and Erosion

21 Opening and Closing, Morphological Algorithms – Boundary

Extraction

T1,R2 2 PPT

22 Region Filling, Extraction of Connected Components T1,R2 2 Chalk &Talk

UNIT – IV

23 Registration Introduction, Geometric Transformation – Plane to

Plane transformation

T2,W2,R1 1 Chalk &Talk

24 Mapping, Stereo Imaging – Algorithms to Establish

Correspondence

T2,W1,W2 2 Chalk &Talk

25 Algorithms to Recover Depth T2,W2,R1 1 Chalk &Talk

26 Segmentation: Introduction, Region Extraction, Pixel-Based

Approach, Multi-level Thresholding


27 Local Thresholding, Region-based Approach, Edge and Line

Detection


28 Edge Detection, Edge Operators, Pattern Fitting Approach,

Edge Linking and Edge Following

T2,W2 2 PPT

UNIT – V

29 Feature Extraction: Representation, Topological Attributes,

Geometric Attributes


30 Description: Boundary-based Description, T1,R1,R2 1 Chalk &Talk

31 Region-based Description, Relationship T1,R1,R2 1 Chalk &Talk

32 Object Recognition: Deterministic Methods, Clustering,

Statistical Classification


33 Syntactic Recognition, Tree Search, Graph Matching T2,W2,R2 1 Chalk &Talk

1. What is gray level slicing?

2. What linear transformation will change an image f(x,y) with gray levels ranging from 4

through 18 to an image g(x,y) with gray levels ranging from 10 through 50?

3. Consider the image shown below; compute the equalized image with eight

possible gray levels. Show each step carefully. Draw the histograms of the

original and equalized images as well as the equalization transformation.

1 2 1 1 2 0

0 1 5 1 0 1

1 6 7 6 1 2

4. The gray levels at four pixels are shown below. What would be the gray level

values at a position 1.3 pixels to the right of, and 1.8 of a pixel below, the

upperleft original pixel assuming (i) zero-order interpolation, (ii) first-order

interpolation using average, and (iii) first-order interpolation using a bilinear

function.

1 5

7 15


Subject Name : DIGITAL IMAGE PROCESSING Assignment No: 1

Subject Code : TCS -071

Faculty :


Unit/Title: UNIT 1

Date of Issue: Date of Submission:

1. Find the DFT and plot the DFT spectrum (i.e., magnitude) of the discrete signal h(n)

defined as follows: h(n)=1 for n=0,1,2,3,4 and h(n)=0 otherwise.

2. Find the FT of the function f(x) = e−Πx2

3. Find and plot the Fourier transform of f(x)=cos(4πx)cos(6πx) 4. If we were to sample f(x), what would be the largest sampling step that still avoids

aliasing?

5. Find and plot the convolution of the following discrete sequences:




Faculty :


Unit/Title: UNIT 2 Date of Issue: Date of Submission:

1. Implement the histogram specification technique. It is suggested that you debug your

algorithm using a small “test” image (e.g., 5 x 5) to make sure that it works correctly.

2. Name the categories of Image Enhancement and explain?

3. What Do You Meant By Zooming Of Digital Images?

4. What Do You Meant By Zooming Of Digital Images?

5. What Are The Applications Of Transform?

6. What Are The Properties Of Unitary Transform?

7. Write the expression to find the number of bits to store a digital image?




Faculty :



1. Why Might Menu-Driven Interfaces Be Bad?

2. Write The Expression Of One-dimensional Discrete Fourier Transforms?

3. Give The Properties Of One-dimensional Dft?

4. What Is Cosine Transform?

5. Name the Categories of Image Enhancement And Explain?

6. What do you mean by edge and line detection?

7. Why is stereo imaging used for?




Faculty :



1. List the application of color models.

2. How will you recover the depth information?

3. What is simultaneous contrast?

4. What is clustering in object recognition?

5. Write the application of sharpening filters.

6. What are various deterministic methods object Recognition? Also explain their use.




Faculty :


Unit/Title: UNIT 5





Faculty :


Unit/Title: UNIT 5


1. .List the hardware oriented color models?

2. Define Image Sampling.

3. What is Dynamic Range?

4. Define Mach band effect.

5. What is meant by Tapered Quantization?

6. What is Hue of saturation?


Subject Name : DIGITAL IMAGE PROCESSING Tutorial Sheet No.1


Faculty :

Branch: CSE

Semester: VII

Unit/Title: UNIT 1 Date of Discussion:

1. Write the properties of Hadamard transform.

2. What is recognition and interpretation?

3. What is Image Transform?

4. Give the Conditions for perfect transform.

5. Write the expression of one-dimensional discrete Fourier transforms.


Subject Name : DIGITAL IMAGE PROCESSING Tutorial Sheet No. 2


Faculty :

Branch: CSE

Semester: VII


1. What is contrast stretching?

2. What is the effect of Mach band pattern?

3. Name the categories of Image Enhancement and explain?

4. What do you mean by Point processing?

5. What is spatial filtering?

6. Define averaging filters.

7. What is a Median filter?


Subject Name : DIGITAL IMAGE PROCESSING Tutorial Sheet No.3


Faculty :

Branch: CSE

Semester: VII


1. What is meant by mutual exclusion?

2. Define Restoration.

3. How a degradation process id modeled?

4. What is homogeneity property and what is the significance of this property?

5. Define circulant matrix.

6. What is the concept behind algebraic approach to restoration?




Faculty :

Branch: CSE

Semester: VII

Unit/Title: 4 Date of Discussion:

1. Which is the most frequent method to overcome the difficulty to formulate thespatial

relocation of pixels?

2. How the blur is removed caused by uniform linear motion?

3. What is inverse filtering?

4. Draw the image observation model.

5. What is run length coding?

6. What are topological attributes of in image extraction?




Faculty :

Branch: CSE

Semester: VII


1. Write about linking edge points.

2. What are the three types of discontinuity in digital image?

3. How the derivatives are obtained in edge detection during formulation?

4. What is clustering?

5. What is meant by object point and background point?

6. Define region growing.




Faculty :

Branch: CSE

Semester: VII

Unit/Title: 4/5 Date of Discussion:

1. What is meant by markers?

2. What are the two principle steps involved in marker selection?

3. What are the demerits of chain code?

4. What is polygonal approximation method?

5. Specify the various polygonal approximation methods.

6. Name few boundary descriptors.

7. Define length of a boundary.




Faculty :

Branch: CSE

Semester: VII

Unit/Title: 2/3/4/5 Date of Discussion:

1. What do you mean by Gray level?

2. What are the steps involved in DIP?

3. What is recognition and Interpretation?

4. Specify the elements of DIP system.

5. What are the types of light receptors?

6. Explain the categories of digital storage?

7. . What is simultaneous contrast?

8. Write short notes on sampling and quantization.

9. Explain Mean filter, Ordered Statistic Filter

10. Explain Sharpening.


Subject Name : DIGITAL IMAGE PROCESSING


Faculty :


Unit/Title: UNIT 1

1. Explain the properties of 2D Fourier Transform.

2. Explain convolution property in 2D fourier transform.

3. Explain Fast Fourier Transform (FFT) in detail.

4. Discuss the properties and applications of 1)Hadamard transform II) Discrete Cosine

Trnsforms

5. Explain low pass and high pass filters.

6. Differentiate between Gaussian Highpass Filters and Homomorphic Filters

7. Explain Periodic Noise Reduction using band pass filters.




Faculty :


Unit/Title: UNIT II

1. Define Image.

2. Define image subtraction.

3. Explain the concept of Morphological Image Processing.

4. What do you mean by boundary extraction? Explain.

5. What are the two approaches for blind image restoration? Explain in detail.

6. Explain Region Filling.

7.With example explain in detail about spatial averaging. Describe in detail about various

types of mean filters.




Faculty :


Unit/Title: UNIT III

1. Discuss the following terms

(i) Region merging

(ii) Erosion and dilation

2. How edge detection is performed in digital images using

(a)Laplacian operator

(b)Sobel operator

(c)Prewit oprator and compare their outcomes

3. How morphological processing is applicable for image processing?

4. What do you mean by optimal thresholding? How do you obtain the threshold for image

processing?

5. Explain Different types of thresholding for segmentation

6. What is Geometric Transformation?




Faculty :


Unit/Title: UNIT IV

1. Discuss about edge detection and edge linking method in brief.

2. Describe constrained least square filtering for image restoration and derive its transfer

function.

3. How do you link edge pixels through global processing?

4. Describe segmentation algorithm.

5. Explain region based segmentation and region growing with example.

6. Discuss how to construct dams using morphological operations.

7. Explain Syntactic Recognition.

8. Differentiate between Tree Search, Graph Matching.




Faculty :


Unit/Title: UNIT V

Prerequisite: Knowledge of Computer Network

Objective:

1. To increase professional skills in terms of information security management and technology

2. To continually strengthen and improve the overall capabilities of the information security

management system

3. To understand security services and policies under information security

4. Integrity of Data or Systems-System and data integrity relate to the processes, policies, and

controls used to ensure information has not been altered in an unauthorized manner and that

systems are free from unauthorized manipulation that will compromise accuracy, completeness,

and reliability

5. Confidentiality of Data or Systems-Confidentiality covers the processes, policies, and controls

employed to protect information of customers and the institution against unauthorized access or

use.

UNIT I Introduction: Security problem in computing, Secure system characteristics, What to secure –How to secure- at what cost?

Elementary Cryptography – DES – AES – Public Key Encryption – Uses of Encryption.

UNIT II Program Security: Security Programs – Non-malicious Program Errors – Virus and other

Malicious Code – Targeted Malicious Code – Control against program Threats.

UNIT III Security in Operating Systems: Protected Objects and Methods of Protection – Memory and

Address Protection –Control of Access generated Objects – File Protection Mechanisms – User

Authentication – Trusted Operating Systems – Models of Security.

UNIT IV Database and Network Security: Database Security Requirements – reliability and integrity – Sensitive Data – Inference – Multilevel Databases and Multilevel Security – Threats in Networks –Network Security Controls – Firewalls – Intrusion Detection Systems – Secure Email.

UNIT V Administering Security and Ethical Issues: Security Planning – Risk Analysis – Organizational Security Policies – Physical Security – Protecting Programs and Data – Information and the Law –Software Failures – Computer Crime – Privacy – Ethical Issues.

TEXT BOOK


SEMESTER: IV




100/50

Course Title: INFORMATION SECURITY Course Code: TCS -084 Duration of External Exam: 3

Hours

1. Charles B. Pfleeger, and Shari Lawrence Pfleeger, “Security in Computing”, Pearson

Education, Third edition, 2003.

REFERENCES 1. Matt Bishop, “Computer Security – Art and Science”, Pearson Education,

First edition, 2003.

2. William Stallings, “Cryptography and Network Security – Principles and Practices”, Prentice-Hall of India, Third edition, 2003.

3. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.


CO1 Have a strong background of appropriate techniques to tackle and solve

problems in the discipline of information security management.

CO2 Describe the significant differences between security considerations for email

over a public network and encrypted traffic over a wireless local area network.

CO3 How an information security management system should be planned,

documented, implemented and improved, according to the BSi standard on

information security management how an information security management

system should be planned, documented, implemented and improved, according

to the BSI standard on information security management.

CO4 Explain the differences between the three major goals of information security:

confidentiality, integrity and availability, and can list and explain one

technique for ensuring each.

CO5 Ability to understand ethical issues of the network and making the information

secure.

DBIT DEHRADUN

LESSON PLAN


COURSE: INFORMATION SECURITY COURSE CODE: TCS-074

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

UNIT - I

1 Introduction: Security problem in computing, Secure system

characteristics-What to secure –How to secure- at what cost

T1,R1 1 Chalk &Talk

2 Elementary Cryptography – DES T2,R2 2 Chalk &Talk

3 AES – Public Key Encryption T1,R2 1 Chalk &Talk

4 Uses of Encryption T2,R2 1 Chalk &Talk

UNIT – II

5 Program Security: Security Programs – Non-malicious Program

Errors

T2,R2 2 Chalk &Talk

6 Virus and other Malicious Code – Targeted Malicious Code T2,R1 2 Chalk &Talk

7 Control against program Threats T1,R1,R2 1 Chalk &Talk

UNIT – III

8 Security in Operating Systems: Protected Objects and Methods

of Protection

T1,R2 2 Chalk &Talk

9 Memory and Address Protection –Control of Access generated

Objects

T2,R2 2 Chalk &Talk

10 File Protection Mechanisms – User Authentication T1,R1 1 Chalk &Talk

11 Trusted Operating Systems – Models of Security T2,R2 2 PPT

UNIT – IV

12 Database and Network Security: Database Security T2,W2,R1 1 Chalk &Talk

13 Requirements – reliability and integrity T2,W1,W2 1 Chalk &Talk

14 Sensitive Data – Inference – Multilevel Databases T2,W2,R1 1 Chalk &Talk

15 Multilevel Security – Threats in Networks T2,W2,R2 2 Chalk &Talk

16 Network Security Controls – Firewalls T2,W2,R2 1 Chalk &Talk

17 Intrusion Detection Systems – Secure Email. T2,W2 2 PPT

UNIT – V

18 Administering Security and Ethical Issues: Security Planning –

Risk Analysis


19 Organizational Security Policies – Physical Security T1,R1,R2 1 Chalk &Talk

20 Protecting Programs and Data – Information and the Law T1,R1,R2 1 Chalk &Talk

21 Software Failures – Computer Crime – Privacy – Ethical Issues T2,W2,R2 2 Chalk &Talk

Total Lectures: 30



TEXT BOOKS:

[T1]. Charles B. Pfleeger, and Shari Lawrence Pfleeger, “Security in Computing”, Pearson Education, Third edition,

2003

[T2]. Atul Kahate, “Cryptography and Network Security”, Tata McGraw-Hill, 2003.

REFERENCE BOOKS:

[R1]. Matt Bishop, Computer Security – Art and Science , Pearson Education, First edition, 2003

[R2]. William Stallings, Cryptography and Network Security – Principles and Practices , Prentice-Hall of India, Third

edition, 2003

WEB RESOURCE:

1: https://www.coursera.org/courses?languages=en&query=information%20security

2: https://www.infosecinstitute.com/topics/information-security

3: www.cyberdegrees.org/resources/free-online-courses/


Date: __________

https://www.coursera.org/courses?languages=en&query=information%20security

1. Explain DES and RSA alogorithms.

2. Discuss security problems in computing.

3. What are secure system characteristics?

4. What is public key encryption?

5. Mention what is data leakage? What are the factors that can cause data leakage?


Subject Name : INFORMATION SECURITY Assignment No: 1


Faculty : Mr. Himanshu Dewedi


Unit/Title: UNIT 1


1. What are ASSET risks?

2. Mention what are personal traits you should consider protecting data?

3. Explain what is phishing? How it can be prevented?

4. Mention what are web server vulnerabilities?

5. For security analyst what are the useful certifications?







1.How do you change your DNS settings in Linux/Windows?

2. Describe the process of a TLS session being set up when someone visits a secure website.

3.If someone steals the server’s private key can they decrypt all previous content sent to that

server?

4.What are some common ways that TLS is attack, and/or what are some ways it’s been

attacked in the past?

5.What is Forward Secrecy?






Unit/Title: UNIT 3


1. What are implementation issues in Firewall?

2. What’s the difference between encoding, encryption, and hashing?

` 3. What’s more secure, SSL or HTTPS?

4. What’s the difference between symmetric and public-key cryptography?

5. What are reliability and integrity issues in network security?






Unit/Title: UNIT 4


1. What do you mean by ethical hacking?

2. Explain Cyber law.

3. How do you classify information security risks across an organization?

4. Why would you want to use SSH from a Windows pc?

5. What is data protection in transit vs data protection at rest?

6. What is administrative level security?






Unit/Title: UNIT 5


1. On a Windows network, why is it easier to break into a local account than an AD

account?

2. What is the CIA triangle?

3. What is the difference between an HIDS and a NIDS?

4. You find out that there is an active problem on your network. You can fix it, but it is out

of your jurisdiction. What do you do?

5. You are an employee for a tech department in a non-management position. A high-level

executive demands that you break protocol and allow him to use his home laptop at work.

What do you do?


Subject Name : INFORMATION SECURITY Tutorial Sheet No.1

Subject Code : TCS-074


Branch: CSE

Semester: VII


1. What’s the difference between Symmetric and Asymmetric encryption?

2. What is SSL and why is it not enough when it comes to encryption?

3. How would you find out what a POST code means?

4. How would you login to Active Directory from a Linux or Mac box?

5. How would you judge if a remote server is running IIS or Apache?


Subject Name : INFORMATION SECURITY Tutorial Sheet No. 2



Branch: CSE

Semester: VI


1. What’s the difference between Diffie-Hellman and RSA?

2. What kind of attack is a standard Diffie-Hellman exchange vulnerable to?

3. How would you implement a secure login field on a high traffic website where

performance is a consideration?

4. What is the difference between HTTP and HTML

5. What’s the goal of information security within an organization?.


Subject Name : INFORMATION SECURITY Tutorial Sheet No.3



Branch: CSE

Semester: VII


1. Describe a UNIX traceroute hitting google.com at all seven layers of the OSI model.

Declare the structure for monitors.

2. Explain file protection mechanism.

3. What practical controls can be put in place to minimise the risk?

4. What are operational risks?

5. What are communications security risks?





Branch: CSE

Semester: VII


1. What are the primary design flaws in HTTP, and how would you improve it?

2. If you could re-design TCP, what would you fix?

3. What is the one feature you would add to DNS to improve it the most?

4. What is likely to be the primary protocol used for the Internet of Things in 10 years?

5. What are some common ways that TLS is attack, and/or what are some ways it’s been

attacked in the past?





Branch: CSE

Semester: VII


1. How do you evaluate the risk of a security flaw you find in a network?

2. How Vulnerability assessment done on Windows machines using various tools?

3. Differentiate between tokenization and encryption.

4. What is anonymous FTP?

5. A software company owns four branches and Internet connection is available at every

branch what will be required to build a Virtual Private Network between them and how it

will be done.





Branch: CSE

Semester: VI


1. Describe the packet flow of ASA between 2 different sites via L2L VPN with nat control

enabled.

2. What is sensitive data?

3. What are Brute Force Attacks?

4. What are the differences among encoding, encryption and hashing?

5. What makes the technology moving to a threatened world?

6. What are advanced encryption standards?

7. Is performing virtual assistant important?





Branch: CSE

Semester: VII

Unit/Title: 3/4/5 Date of Discussion:

1. With a neat block diagram explain the single round of DES algorithm.

2. Explain the various modes in which DES can be used for different applications.

3. What is an intrusion? Briefly write about any eight IDPS terminologies.

4. What are the differences between digital signature and digital certificate?

5. What is an encryption? Discuss the symmetric and asymmetric encryption methods?

6. Who can attack cryptosystems? Discuss different categories of attacks on cryptosystems.

7. What are the components of information system?

8. Differentiate between DES and AES algorithms.


Subject Name : INFORMATION SECURITY




Unit/Title: UNIT 1

1. What are the differences between active and passive security attacks?

2. What is meant by information security? Discuss the three aspects of information security.

3. Briefly explain the four types of security attacks that are normally encountered .Also

distinguish between active and passive attacks.

4. What is a brute force attack?

5. What are the two levels of alerts? List the alerts under them?

6. Discuss how SSL record protocol provides confidentiality and message integrity for SSL

connections?





Branch:CSE Semester: 7th

Unit/Title: UNIT II

1.Describe the need of operating system detecting tools.

2.With a neat diagram, explain network security model.

3.Describe the benefits of IPSec.

4.What are sniffers?

5. Define a Security attack. Explain in detail about the various types of attacks an Internetwork

is vulnerable to.





Branch:CSE Semester: 7th


1. Explain the firewall rules.

2. Explain the screened subnet firewall.

3. What is a firewall? Show the working of a screened host and dual homed firewalls.

4. What is VPN? Explain two modes of a VPN.

5. Explain network based intrusion detection and prevention






Unit/Title: UNIT IV

1. Write short notes on: 1) SSL handshake protocol 2) SSL alert protocol.

2. What are the services provided by SSL record protocol? Describe the operation of this

protocol, with suitable illustration.

3. Explain the format of an ESP packet in IP Security.

4. What are the general categories of unethical and illegal behavior?

5. Explain the substitution techniques a) Ceaser Cipher b) Play Fair Cipher c) Hill Cipher

6. Explain the various web security threats?






Unit/Title: UNIT V

Prerequisite: To understand fundamentals of Fuzzy logic and artificial neural network.

Objective: 1.Understand basics of fuzzy system, genetic algorithms & their relations.

2.Learn artificial neural n/ws, models 7 their functions.

3.Apply genetic algorithms & artificial neural N/ws as computation tools to solve a variety of problems in various

areas of interest ranging from optimization problems to text analytics.

Unit –I Introduction to soft computing. Applications of Artificial Neural Networks, fuzzy logic,

genetic algorithms and other soft-computing techniques. Their strengths and weaknesses.

Synergy of soft computing techniques. Artificial neural networks : over view of history,

Mathematical Models of Neurons, ANN architecture.

Unit-II

Introduction to artificial neural network

Neural Networks: Learning rules, Learning Paradigms-Supervised, Unsupervised and

reinforcement Learning, ANN training Algorithms-perceptions, Training rules, Delta, Back

Propagation Algorithm, Multilayer Perceptron Model, Competitive learning networks, Kohonen

self organizing networks, Hebbian learning; Hopfield Networks,

Unit-III

Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets: Overview of Classical Sets,

Membership Function, Fuzzy rule generation. Operations on Fuzzy Sets: Compliment,

Intersections, Unions, Combinations of Operations, Aggregation Operations. Fuzzy Arithmetic:

Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on Intervals & Numbers, Lattice of

Fuzzy Numbers, Fuzzy Equations.

Unit - IV

Genetic algorithms(Gas), Evolution strategies(Ess), Evolutionary programming(EP), Genetic

Programming(GP),Selecting, crossover, mutation, schema analysis, analysis of selection

algorithms; convergence; Markov & other stochastic models.

Unit - V

Other Soft computing approaches Simulated Annealing, Tabu Search, Ant colony based

optimization.

Text:


SEMESTER: IV




100/50

Course Title : SOFT COMPUTING Course Code: TCS-072/TIT-074 Duration of External Exam: 3

Hours

1. “Neuro-Fuzzy and Soft computing”, Jang, Sun, Mizutani, Pearson

2. “Neural networks: a comprehensive foundation”, Haykin,

3. “Genetic Algorithms”, Goldberg,

4. “Fuzzy Sets & Fuzzy Logic”, G.J. Klir & B. Yuan, PHI.

Reference:

1. Anderson J.A., “An Introduction to Neural Networks”, PHI, 1999

2. Hertz J. Krogh, R.G. Palmer, “Introduction to the Theory of Neural Computation”, Addison- Wesley, California,

3. Melanie Mitchell, “An Introduction to Genetic Algorithm”, PHI, 1998.

4. “Neural Networks-A Comprehensive Foundations”, Prentice-Hall International, New Jersey,

1999

5. Freeman J.A. & D.M. Skapura, “Neural Networks: Algorithms, Applications and

Programming Techniques”, Addison Wesley, Reading, Mass, (1992).


CO1 To explain the fuzzy sets, fuzzy logic systems and its various applications in real life

problem solving.

CO2 To illustrate the concept of Artificial Neural Network and its applications.

CO3 To discuss on the concept of Fuzzy logic.

CO4 To discuss on the concept of Genetic Algorithm and its various applications

CO5 To elaborate the basics of Simulated Annealing, Tabu search, Ant colony optimization

(ACO), Particle Swarm Optimization (PSO).

DBIT DEHRADUN

LESSON PLAN


COURSE: SOFT COMPUTING COURSE CODE: TCS-072

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

UNIT - I

1 Introduction to soft computing T1,R1 1 Chalk &Talk

2 Applications of Artificial Neural Networks, fuzzy logic T1,R1 1 Chalk &Talk

3 genetic algorithms and other soft-computing techniques and

their strengths and weaknesses

T1,R1 1 Chalk &Talk

4 Synergy of soft computing techniques T1,R1 1 Chalk &Talk

5 Artificial neural networks : over view of history, Mathematical

Models of Neurons, ANN architecture

T1,R1 2 Chalk &Talk

UNIT – II

6 Neural Networks: Learning rules, Learning Paradigms-

Supervised, Unsupervised and reinforcement Learning

T1,R1 2 Chalk &Talk

7 ANN training Algorithms-perceptions, Training rules T1,R1 1 Chalk &Talk

8 Delta, Back Propagation Algorithm, Multilayer Perceptron

Model


9 Competitive learning networks, Kohonen self organizing

networks

T1,R1 2 Chalk &Talk

10 Hebbian learning; Hopfield Networks T1,R1,R2 2 Chalk &Talk

UNIT – III

11 Fuzzy Logic: Introduction to Fuzzy Logic, Classical and Fuzzy Sets T1,R2 2 Chalk &Talk

12 Overview of Classical Sets, Membership Function, Fuzzy rule

generation

T1,R1 1 Chalk &Talk

13 Operations on Fuzzy Sets: Compliment, Intersections, Unions,

Combinations of Operations

T1,R2 1 Chalk &Talk

14 Aggregation Operations. Fuzzy Arithmetic: Fuzzy Numbers,

Linguistic Variables

T1,R2 1 PPT

15 Arithmetic Operations on Intervals & Numbers T1,R2 1 Chalk &Talk

16 Lattice of Fuzzy Numbers, Fuzzy Equations T1,R1,R2 2 Chalk &Talk

UNIT – IV

17 Genetic algorithms(Gas), Evolution strategies(Ess) T2,W2,R1 1 Chalk &Talk

18 Evolutionary programming(EP), Genetic Programming(GP) T2,W1,W2 1 Chalk &Talk

19 Selecting, crossover, mutation, schema analysis T2,W2,R1 1 Chalk &Talk

20 analysis of selection algorithms T2,W2,R2 1 Chalk &Talk

21 convergence; Markov & other stochastic models. T2,W2,R2 2 Chalk &Talk

UNIT – V

22 Other Soft computing approaches T1,R1,R2 1 Chalk &Talk

23 Simulated Annealing T1,R1,R2 1 Chalk &Talk

24 Tabu Search T1,R1,R2 1 Chalk &Talk

25 Ant colony based optimization T2,W2,R2 2 Chalk &Talk

Total Lectures: 27



TEXT BOOKS:

[T1]. “Neuro-Fuzzy and Soft computing”, Jang, Sun, Mizutani, Pearson

[T2]. “Neural networks: a comprehensive foundation”, Haykin, REFERENCE BOOKS:

[R1 Anderson J.A., An Introduction to Neural Networks , PHI, 1999

[R2]. Neural Networks-A Comprehensive Foundations , Prentice-Hall International, New Jersey, 1999

WEB RESOURCE:

1:http://www.howtogeek.com/

2:https://www.cs.uic.edu

3:https:// https://onlinecourses.nptel.ac.in/noc18_cs13

http://www.howtogeek.com/

https://www.cs.uic.edu/

1. What is the role a transfer function in artificial neural networks?

2. Draw a 4-5-1 artificial neural network.

3. Compare between soft computing and hard computing.

4. Discuss various applications of artificial neural networks.

5. Write short notes on (a) transfer functions (b) recurrent neural networks.


Subject Name : SOFT COMPUTING Assignment No: 1


Faculty :


Unit/Title: UNIT 1


1. Write a short note on RBF network.

2. Explain error back propagation training algorithm with the help of a flowchart.

3. Write a short note on Learning vector Quantization.

4. Write a short note on Character Recognition using neural network.

5. Write a short note on Kohonen self organizing network.

6. What is supervised and unsupervised learning? Compare different learning rules.




Faculty :



1. Explain the different Fuzzy membership function.

2. Explain cylindrical extension and projection operation of fuzzy relation with example.

3. A neuron with 3 inputs has the weight vector w=[0.1, 0.3 -0.2]. The activation function is

binary sigmoidal activation function. If input vector is [0.8 0.6 0.4] then find the output of

neuron.

4. Explain the Radial Basis function neural network for the solution of XOR.

5. Compare Mamdani and Sugeno fuzzy models.

6. Write any two fuzzy membership functions with diagrams.




Faculty :


Unit/Title: UNIT 3


1. Explain Genetic algorithm with the help of example.

2. Compare between soft computing and hard computing.

3. Why do we use a mutation in genetic algorithm?

4. Draw any binary and real valued chromosome in a genetic algorithm.

5. What is particle swarm optimization?

6. What is Markov model? Explain.




Faculty :



1. What are alpha cuts and strong alpha cuts, explain by taking any suitable example.

2. Write a short note on TSP using simulated Annealing.

3. What are the various types of Mutation techniques?

4. Explain Travelling salesperson problem using simulated Annealing.

5. Learning vector quantization.

6. Derivative based optimization.




Faculty :


Unit/Title: UNIT 5


1. How many types of random variables are available? Which systems are called tightly

coupled systems?

2. Name any four techniques used in soft computing.

3. What is a fuzzy number?

4. What is the role a transfer function in artificial neural networks?

5. What are the 2 types of learning?

6. Supervised Learning is

A. learning with the help of examples

B. learning without teacher

C. learning with the help of teacher

D. learning with computers as supervisor

7. Unsupervised learning is

A. learning without computers

B. problem based learning

C. learning from environment

D. learning from teachers


Subject Name : SOFT COMPUTING Tutorial Sheet No.1


Faculty :

Branch: CSE

Semester: VII


1. Conventional Artificial Intelligence is different from soft computing in which sense?

2. In Sugeno Fuzzy model the first order polynomial is a constant the model is of which

order?

3. In which type of partitioning does orthogonality hold in XxY but not in X, Y alone?

4. In Fuzzy modeling the Second Stage is the Identi6ication of which structure?

5. ANN is composed of large number of highly interconnected processing elements(neurons)

working in unison to solve problems.(T/F)


Subject Name : SOFT COMPUTING Tutorial Sheet No. 2


Faculty :

Branch: CSE

Semester: VII


1. What is process and process control block (PCB)? Explain its different states.

2. Artificial neural network used for

A. Pattern Recognition

B. Classification

C. Clustering

D. All of these

3. A Neural Network can answer

A. For Loop questions

B. what-if questions

C. IF-The-Else Analysis Questions

D. None of these

4. Ability to learn how to do tasks based on the data given for training or initial experience

A. Self Organization

B. Adaptive Learning

C. Fault tolerance

D. Robustness

5.


Subject Name : SOFT COMPUTING Tutorial Sheet No.3


Faculty :

Branch: CSE

Semester: VII


1. What are linguistic variables?

2. Feature of ANN in which ANN creates its own organization or representation of

information it receives during learning time is

A. Adaptive Learning

B. Self Organization

C. What-If Analysis

D. Supervised Learniing

3. What is soft computing? Explain the main components of soft computing paradigm.

4. What are hybrid systems? Explain the types of hybrid systems.

5. Compare and contrast artificial neurons with biological neurons.




Faculty :

Branch: CSE

Semester: VII


1. Explain how fuzzy logic is different from classical two-valued logic.

2. Explain the applications of fuzzy logic in control systems.

3. Explain the types of Neural Network architecture with diagram.

4. What is Adaptive Resonance Theory? Explain the structure of ART 1.

5. Explain the main neuron signal functions commonly used.




Faculty :

Branch: CSE

Semester: VII


1. What are advantages and disadvantages of TABU search?

2. What is Associative Memory? Explain the types of Associative Memory.

3. Explain Counterpropagation learning process.

4. Explain Individual Decision making model.

5. Describe the stages in the development of expert systems.

6. Explain the working of ant-colony systems.

7. Give an account of various tools used in expert systems.




Faculty :

Branch: CSE

Semester: VII


1. Explain Neural Network architecture.

2. Explain model of an artificial neuron.

3. Explain Unsupervised Learning Neural Networks.

4. Explain Competitive Learning Networks.

5. Explain Fuzzy Rule based system.

6. Explain Mathematical Models of Neurons.

7. Difference between Traditional Algorithms and Genetic Algorithm.


Subject Name : SOFT COMPUTING


Faculty :


Unit/Title: UNIT 1

1. Explain learning in neural network..

2. Explain back propagation algorithm.

3. Explain Kohonen Self-Organizing Networks.

4. Write application of neural network.

5. Explain Cross Over process.

6. Write applications for Adaptive Systems.

7. Explain fuzzy associative memory.




Faculty :


Unit/Title: UNIT II



1.Explain basic Fuzzy Set Operations..

2.Explain Fuzzy Inference Systems.

3.Differentiate between fuzzy and crisp sets.

4.Write application of Fuzzy logic.

5.Explain Fuzzy Relations.

6.Explain Fuzzy Reasoning.

7.Explain Neuro-Fuzzy Systems.

8.Write the membership functions corresponding to the fuzzy sets. Hence answer the question:

How cool is 36F?


Faculty :



1. Explain Boltzman selection.

2. Explain Neuro-Genetic hybrid Systems.

3. Explain the operational summary of genetic algorithm.

4. Give an account of various tools used in expert systems.

5. What is defuzzification and what are the advantages of Fuzzy controller?

6. Define mutation.

7. What is the main function of cross over operation in Genetic Algorithm?

8. State the different selection methods in GA.




Faculty :


Unit/Title: UNIT IV

1. Define the term cross over rate in GA. and Define mutation rate in GA.

2. Explain TABU search.

3. Explain Cross Over process.

4. How does the ANT colony optimization differ from evolutionary program of GA.?

5. What are the parameters of GA?

6. Mention the role of fitness function in GA and what are the requirements of GA.

7. What are the limitations of GA? And when does one go for GA?

8. Mention some applications of Ant colony search.

9. What are the disadvantages of ANT algorithm?

10. What ware the components and the characteristics of TABU search?




Faculty :


Unit/Title: UNIT V

Prerequisite: Basic knowledge of products, quality of Product

Objective:

1.Knowledge of various quality standards.

2.Knowledge of registration and accreditation in quality system-certification

Introduction Definition, need of quality systems, role of quality standards, stages of quality assurance

systems. Quality charts, control charts for variables and attributes, acceptance sampling.

Quality Systems Overall responsibility for progress of quality systems. quality manuals, procedures and role of

auditing, auditing for conformance versus quality for effectiveness, auditing a tool for quality

improvement. ISO 9000 quality systems, British Standards BS5750/ISO 9000 origin of standards,

requirements, issues associated with implementation.

Registration Registration and accreditation in quality system-certification, approval, registration of leading

accessors.

Recommended Books: 1. Mohamed Isiri, " Total Quality Management for Engineers". 2. Juran, J., " Quality Planning and Analysis, Mc -Graw Hill. 3. James R. Evans,& J.W. Dean," Total Quality-management, Organization and

Strategy," Thomson Asia Pvt. Ltd., Singapore.


CO1 Have the knowledge of quality system, quality chart and control chart for

variable and attributes

CO2 Study about the overall responsibility for progress of quality system.

CO3 Study about registration and accreditation in quality system-certification and

approval


SEMESTER: IV


Course Level: Beginner Course Type: Core Credit: 4


100/50

Course Title : QUALITY SYSTEM &

MANAGEMENT

Course Code: TOE-08 Duration of External Exam: 3

Hours

DBIT DEHRADUN

LESSON PLAN

SEMESTER/YEAR: 8th

/4th

DEPARTMENT : CSE

COURSE: Quality System and Management COURSE CODE: TOE-08

S.

No.

Topic Name

Reference/

Text Book/

Web

(R/T/W)

No. Of

Lectures

Delivery

Method

Remarks

1. Definition, need of quality systems T1, R1 1 Discussion

2. Role of quality standards,stages of quality assurance systems T1, R2 2 PPT

3. Quality charts T1, R1 2 PPT

4. Control charts for variables and attributes T1, R2 2 PPT

5. Acceptance sampling T1, R1 1 PPT

6. Overall responsibility for progress of quality systems T1, R2 2 Chalk &Talk

7. Quality manuals T1, R1 1 Chalk &Talk

8. Procedures and role of auditing T1, R2 2 PPT

9. Auditing for conformance versus quality for effectiveness T1, R1 1 Chalk &Talk

10. Auditing a tool for quality improvement T1, R2 2 Discussion

11. ISO 9000 quality systems T1, R2 2 Chalk &Talk

12. British Standards BS5750/ISO 9000 origin of standards T1, R2 2 PPT

13. Requirements, issues associated with implementation T1, R1 1 Chalk &Talk

14. Registration and accreditation in quality system-certification T1, R2 1 Chalk &Talk

15. Approval of quality system-certification T1, R3 1 Chalk &Talk

16. Registration of leading accessors T1, R1 2 PPT

Total Lectures: 25



TEXT BOOKS:

[T1] Total Quality Management - K.Shridhara Bhatt

REFERENCE BOOKS:

[R1] Mohamed Isiri, " Total Quality Management for Engineers".

[R2] Juran, J., " Quality Planning and Analysis, Mc -Graw Hill.

[R3] James R. Evans,& J.W. Dean," Total Quality-management, Organization and Strategy,"Thomson Asia Pvt.

Ltd., Singapore.


Date: __________

Q1 Explain quality manuals.

Q2 Explain acceptance sampling.

Q3 What is zero defect concept

Q4 What are the various needs of quality systems?

Q5 What is quality assurance? What are the objectives of quality assurance?

Q6 What are control charts? Write the differences between variable and attribute with example.

Explain the importance of quality in detail

Q7 What is Audit execution.

Q8 What are the steps for implementing zero defect program?


Course Name: B Tech Assignment No. 1

Course Code:TOE-08

Faculty : HIMANSHU KUMAR DIWEDI


Unit/Title: Quality, Acceptance Sampling, Zero Defect Concept Date of Issue: Date of Submission:

Q1What are the three principles of quality assurance? Explain.

Q2What are the different steps of quality control procedure?

Q3What are variables ? Give Examples.

Q4What are the three Basic applications of control charts.

Q5Explain the following terms in any quality audit in Short:

(a) Client

(b) Auditor

(c) Audience

Q6What do you think “Audit is necessary in an organization or not” justify.

Q7what is the difference between defect and defective. Give examples.

Q8 What are the elements of total quality system?



Course Code:TOE-08



Unit/Title: QualityAssurance, Total Quality System, Defect &

Defectives


Q1What is the difference between new quality and old quality?

Q2What is quality assurance? What are the objectives of quality assurance?

Q3What do you understand by quality? what are the benefits of quality to a firm? What is the role of quality

standards?

Q4Define acceptance Sampling in detail? What are the different types of acceptance inspection? Explain in detail

with advantages and disadvantages.

Q5Construct the number of defect chart for the following data.

Sample number number of defect sample number number of defect

1 2 11 0

2 3 12 1

3 0 13 0

4 1 14 2

5 3 15 4

6 5 16 1

7 3 17 2

8 1 18 0

9 2 19 3

10 2 20 2

Q6 What is the difference between ‘p’ chart and ‘np’ chart? why would an ‘np’ chart be used? Also explain

difference between ‘c’ chart and ‘u’’ chart.

Q7 What do you mean by registration and accreditation in quality system? Explain in brief.

Q8 Explain the process of implementation and registration in ISO.



Course Code: TOE-08



Unit/Title: Control Charts, ISO Date of Issue: Date of Submission:

Q1 Construct a fraction defective chart for the following data. The sample size is n=100 for each sample

of the 20 samples.

Sample number number of defectives sample number number of defectives

1 6 11 6

2 5 12 1

3 0 13 8

4 1 14 7

5 4 15 5

6 2 16 4

7 5 17 11

8 3 18 3

9 3 19 0

10 2 20 4

Q2 Write a short note on TYPE ONE ERROR and TYPE TWO ERROR.

Q3 Differentiate between maintainability and reliability.

Q4 What conditions could make acceptance sampling appropriate?

Q5 Differentiate between:

A) Efficiency and Effectiveness

B) Random and assignable causes

C) Variable charts and attribute charts

D) Type A OC(operating characteristics)Curve and Type B OC Curve

Q6 Explain the contribution of Gilb’s and his quality.

Q7 What are the advantages of having ISO certification?

Q8 What do you mean by Statistical process control and discuss its advantages?



Course Code:TOE-08



Unit/Title: Defective Charts, Statistical Process Control Date of Issue: Date of Submission:

Q1 Define elements or Stages of quality assurance systems.

Q2 Give procedure of quality audit work .

Q3 What are the sources of variation which we consider in control charts?

Q4 What are the different stages of Quality audit.

Q5 What are the different elements of ISO 9000 series requirements?

Q6 Define certification process.

Q7 What are the various needs of quality systems.

Q8 Define Quality Audit as given by ISO 9402-1986.


Course Name:B Tech Assignment No. 5

Course Code:TOE-08



Unit/Title: Audit, Certification Process Date of Issue: Date of Submission:

Q1 Explain acceptance sampling with its advantages and disadvantages.

Q2 Write short notes on quality policy and quality manuals


DEV BHOOMI INSTITUTE OF TECHNOLOGY, DEHRADUN Tutorial

Course Name : B Tech Tutorial No. 1

Course Code : TOE-08



Unit/Title: Acceptance Sampling

Date of Conduction:


Q2 Explain the zero defect concept.What are the steps for implementing zero defect program?

Q3 Define quality system as defined by American society for quality control.What are the

various needs of quality systems?


Course Name : B Tech Tutorial No. . 2




Unit/Title: Control chart

Date of Conduction:

Q1 What do you think “Audit is necessary in an organization or not” justify.

Q2 Define quality charts.






Unit/Title: Audit

Date of Conduction:

Q1 Define barriers in ISO implementation ?

Q2 What are the elements of total quality system?






Unit/Title: Total Quality System

Date of Conduction:


Q2 Write a short note on TYPE ONE ERROR and TYPE TWO ERROR.






Unit/Title: Registration & Accredation

Date of Conduction:

Q1 What are the various needs of quality systems?



Q4.Explain the importance of quality in detail

Q5 What is Audit execution.

Q6 What are the steps for implementing zero defect program?

Q7.Explain acceptance sampling with its advantages and disadvantages.

Q8.Write short notes on quality policy and quality manuals

Q9.What is quality assurance? What are the objectives of quality assurance?


Question Bank

Course Name : B Tech Question Bank No. 1




Unit/Title: Acceptance Sampling

Date of Conduction:

Q1. What are control charts? Write the differences between variable and attribute with example.

Q2 Explain the zero defect concept.What are the steps for implementing zero defect program?

Q3 Define quality system as defined by American society for quality control.What are the

various needs of quality systems?

Q4. What are the three principles of quality assurance? Explain.

Q5.What are the different steps of quality control procedure?

Q7.What are variables ? Give Examples.

Q8.What are the three Basic applications of control charts.

Q9.Explain the following terms in any quality audit in Short:

(d) Client

(e) Auditor

(f) Audience


Question Bank





Unit/Title: Control chart

Date of Conduction:

Q1. What is quality assurance? What are the objectives of quality assurance?

Q2. What do you understand by quality? what are the benefits of quality to a firm? What is the

role of quality standards?

Q3. Define acceptance Sampling in detail? What are the different types of acceptance

inspection? Explain in detail with advantages and disadvantages

Q4. What do you think “Audit is necessary in an organization or not” justify.

Q5. Define quality charts.

Q6 What is the difference between ‘p’ chart and ‘np’ chart? why would an ‘np’ chart be used?

Also explain difference between ‘c’ chart and ‘u’’ chart.


Q8 Explain the process of implementation and registration in ISO.


Question Bank





Unit/Title: Audit

Date of Conduction:

Q1, Write a short note on TYPE ONE ERROR and TYPE TWO ERROR.

Q2. Differentiate between maintainability and reliability.

Q3 What conditions could make acceptance sampling appropriate?

Q4. Differentiate between:

E) Efficiency and Effectiveness

F) Random and assignable causes

G) Variable charts and attribute charts

H) Type A OC(operating characteristics)Curve and Type B OC Curve

Q5. Explain the contribution of Gilb’s and his quality.

Q6. What are the advantages of having ISO certification?

Q7. What do you mean by Statistical process control and discuss its advantages?

Q8. Define barriers in ISO implementation ?

Q9.What are the elements of total quality system?


Question Bank





Unit/Title: Total Quality System

Date of Conduction:

Q1 What are the different stages of Quality audit.

Q2. What are the different elements of ISO 9000 series requirements?

Q3 Define certification process.

Q4 What are the various needs of quality systems.

Q5 Define Quality Audit as given by ISO 9402-1986.

Q6.What do you mean by registration and accreditation in quality system? Explain in brief.

Q7. Write a short note on TYPE ONE ERROR and TYPE TWO ERROR.


Question Bank





Unit/Title: Registration & Accredation

Date of Conduction:

dev bhoomi institute of technology dehradun · dev bhoomi institute of technology dehradun...

Documents