course structure & scheme for master of technology … 2012‐2013 page 1 course structure &...

47
w.e.f 2012‐2013 Page 1 Course Structure & Scheme For Master of Technology In Network Security BPS Mahila Vishwavidyalaya Khanpur Kalan, Sonepat (India) www.bpswomenuniversity .ac.in

Upload: phungnhan

Post on 16-Mar-2018

215 views

Category:

Documents


1 download

TRANSCRIPT

w.e.f 2012‐2013    Page 1 

Course Structure & Scheme

For

Master of Technology

In

Network Security

BPS Mahila Vishwavidyalaya Khanpur Kalan, Sonepat (India)

www.bpswomenuniversity .ac.in

w.e.f 2012‐2013    Page 2 

School of Engineering & Sciences

COURSE CURRICULUM & SCHEME OF EXAMINATIONS OF Master of Technology

Network Security (W.E.F SESSION 2012-2013)

First Semester

S. No

Code Course Title Hrs/Week Total Credit

Marks L T P Internal

Marks External Marks

Total Marks

Theory 1 CSL-2601 Advanced Computer

Networks 3 2 - 4 50 50 100

2 CSL-2603 Digital System Design 3 2 - 4 50 50 100 3 CSL-2605 Network Security 3 2 - 4 50 50 100 4 CSL-2607 Advanced Computer

Architecture 3 2 - 4 50 50 100

Lab 7 CSP-2609 Advanced Computer

Networks Lab - - 2 1 25 25 50

8 CSP-2611 Digital system Design Lab

- - 2 1 25 25 50

9 *CSP-2613 Term Paper - - - 2 50 - 50 Total 12 08 04 20 300 250 550

Total Contact Hours =24 Total Credit= 20

*None University Examination.

w.e.f 2012‐2013    Page 3 

School of Engineering & Sciences

COURSE CURRICULUM & SCHEME OF EXAMINATIONS OF Master of Technology

Network Security (W.E.F SESSION 2012-2013)

Second Semester

S. No

Code Course Title Hrs/Week Total Credit

Marks L T P Internal

Marks External Marks

Total Marks

Theory 1 CSL-2602 Analysis and design of

algorithms 3 2 - 4 50 50 100

3 CSL-2604 Security of Information Systems

3 2 - 4 50 50 100

4 CSL-2606 Network Programming 3 2 - 4 50 50 100 5 Elective-I 3 2 - 4 50 50 100 Lab 6 CSP-2610 Networks Security Lab - - 2 1 25 25 50 7 CSP-2612 Network Programming

Lab - - 2 1 25 25 50

8 *CSP-2614 Term Paper - - - 2 50 - 50 Total 12 08 04 20 300 250 550

Total Contact Hours =24 Total Credit= 20

*None University Examination. Elective-I

1. CSL-2608 - Information Theory and coding 2. CSL-2616- Computer Graphics 3. CSL-2618- Microprocessor and Interfacing

w.e.f 2012‐2013    Page 4 

School of Engineering & Sciences

COURSE CURRICULUM & SCHEME OF EXAMINATIONS OF Master of Technology

Network Security (W.E.F SESSION 2012-2013)

Third Semester

S. No

Code Course Title Hrs/Week Total Credit

Marks L T P Internal

Marks External Marks

Total Marks

Theory 1 CSL-2615 System Simulation 3 2 - 4 50 50 100 2 Elective-II 3 2 - 4 50 50 100 3 CSL-2619 Advanced Data Base

Management System 3 2 - 4 50 50 100

4 CSP-2621 Seminar 2 - - 2 100 - 100 5 CSP-2623 Dissertation Phase-1 - - - 4 50 50 100 6 CSP-2625 System Simulation Lab - - 2 1 25 25 50 6 CSP-2627 *Term Paper - - - 2 50 - 50 7 Total 11 06 2 21 375 225 600

Total Contact Hours =19 Total Credit= 21

*None University Examination. Elective-II

1. CSL-2617- Soft Computing 2. CSL-2629- Software Verification, Validation & Testing 3. CSL-2631 -Embedded System Design

.

w.e.f 2012‐2013    Page 5 

School of Engineering & Sciences COURSE CURRICULUM & SCHEME OF

EXAMINATIONS OF Master of Technology

Network Security (W.E.F SESSION 2012-2013)

Fourth Semester Paper Code Paper L/P Credits Marks

Internal Marks

External Marks

Total Marks

CSP-2622 Dissertation Phase-II

- 20 250 250 500

CSP-2624 Seminar & Progress Report

- 4 100 - 100

Total - 24 200 350 600 Total Credit= 24

NOTE: 1. The total number of credits of the Programme M. Tech. = 85. 2. Each student shall be required to appear for examination in all courses. However, for the award of the degree a student shall be required to earn the minimum of 80. 3. Dissertation phase-I and Independent Study load will be counted as two hours per

week for each concerned faculty guiding/supervising the student

w.e.f 2012‐2013    Page 6 

School of Engineering & Sciences COURSE CURRICULUM & SCHEME OF

EXAMINATIONS OF Master of Technology

Network Security (W.E.F SESSION 2012-2013)

Sr.No. Semester Total

Credits Total Marks

1 First 20 550 2 Second 20 550 3 Third 21 600 4 Fourth 24 600 TotalCredit/Marks 85 2300

w.e.f 2012‐2013    Page 7 

Semester-1

Advanced Computer Networks

Code No.: CSL-2601 Total Credits: 4

L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Duration of Exam: 3 Hrs

Course Objective: The objective of this course is to make students aware about advanced

concepts of networking principles and various protocols.

Unit- 1

Introduction to Networks -Application of Networks - Architecture Topology Switching -

SLIP, PPP -ALOHA protocols, CSMA/CD, IEEE 802.3, 802.4, 802.5

The Data Link Layer:Error detection and correction, data link protocols, sliding window

protocols, Examples of Data Link Protocols.

Unit- 2

Network Layer Issues- Routing, Congestion control- Internetworking - Issues, Address

Learning Bridges, Spanning tree, Source routing, Bridges, Routers, Gateway.

Network Protocol- IP datagram - hop by hop routing, ARP, RARP, DHCP -Sub net

Addressing, Address Masking, ICMP, RIP, RIPV2, OSPF, DNS, LAN and WAN

Multicast

Unit- 3

Transport Layer- Design issues, Connection Management, Transmission Control Protocol

(TCP) - User Datagram Protocol (UDP).

w.e.f 2012‐2013    Page 8 

Unit- 4

Application Layer Protocol- Telnet - TFTP - FTP - SMTP - Ping Finger, Bootstrap

Network

Time Protocol- SNMP.

.

TEXT BOOK

1. S. Tanenbaum, "Computer Networks ", Third Edition, Prentice Hall India, Latest

Edition

REFERENCE BOOK

1. W Richard Stevens, "TCP/IP Illustrated -Volume I, The protocols ", Addition-Wesley

Professional Computing Series, 1994

2.U. Black, “Computer Networks-Protocols, Standards and Interfaces”, PHI, 1996.

3.W. Stallings, “Computer Communication Networks”, PHI, 1999.

4.Laura Chappell (ed), “Introduction to Cisco Router Configuration”, Techmedia, 1999.

5.Michael A. Miller, “Data & Network Communications”, Vikas Publication, 1998.

6.William A. Shay, “Understanding Data Communications & Networks”, Vikas

Publication, 1999.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 9 

Digital System Design

Code No.: CSL-2603 Total Credits: 4

L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Duration of Exam: 3 Hrs

Course Objective: The objective of this course is to make students enable to design

various circuits in VHDL, FPGA’s and CPLD’s

Unit-1 : Introduction: Introduction to Computer-aided design tools for digital systems.

Hardware description languages; introduction to VHDL, data objects, classes and data

types, Operators. Entity and Architecture declaration. Introduction to behavioural,

dataflow and structural models.

VHDL Statements : Assignment statements, sequential statements and process,

conditional statements, case statement Array and loops, resolution functions, Packages

and Libraries, concurrent statements.

Subprograms: Application of Functions and Procedures, Structural Modelling,

component declaration, structural layout and generics.

Unit-2 : Combinational Circuit Design: VHDL Models and Simulation of combinational

circuits such as Multiplexers, Demultiplexers, encoders, decoders, code converters,

comparators, implementation of Boolean functions etc.

Sequential Circuits Design : VHDL Models and Simulation of Sequential Circuits Shift

Registers, Counters etc.

Unit -3 : Design of Microcomputer : Basic components of a computer, specifications,

architecture of a simple microcomputer system, implementation of a simple

microcomputer system using VHDL

w.e.f 2012‐2013    Page 10 

Unit-4 : Design with CPLDs and FPGAs : Programmable logic devices : ROM, PLAs,

PALs, GAL, PEEL, CPLDs and FPGA. Design implementation using CPLDs and

FPGAs

TEXT BOOK :

1. Charles H.Roth,” Digital System Design using VHDL”, PWS,1998

2. Navabi Z,” VHDL-Analysis & Modeling of Digital Systems”, Mc-Graw Hill

REFERENCE BOOKS:

1. IEEE Standard VHDL Language Reference Manual (1993).

2 KC Chang,” . Digital Design and Modelling with VHDL and

Synthesis”, IEEE

Computer Society Press.

3. Bhaskar,”A VHDL Primer”, Prentice Hall, 1995.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 11 

Network Security

Code No.: CSL-2605

L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: This course provides the basic idea of network security and various

telecommunication architectures

Unit-1: Introduction: Codes and Ciphers – Stream ciphers, Block ciphers, design

consideration for stream ciphers, rotor based system, shift register based systems. Block

Ciphers – DES and variant, modes of use of DES.

Unit-2: –Public key systems – Knapksack systems – RSK – Diffle Hellman Exchange –

Authentication and Digital signatures, Elliptic curve based systems. Security- Hash

function – Authentication: Protocols – Digital Signature standards.

Unit-3: Electronics Mail Security – PGP (Pretty Good Privacy) MIME, data Compression

technique. IP Security: Architecture, Authentication Leader, Encapsulating security

Payload – Key Management.

Web security: Secure Socket Layer & Transport Layer security, Secure electronics

transactions. Firewalls Design principle, established systems.

Unit-4: Telecommunication Network Architecture, TMN management layers,

Management ,information Model, Management servicing and functions, Structure of

management information and TMN information model, SNMP v1, SNMP2 & SNMP3,

RMON1 & 2, Broadband Network Management (ATM, HFC, DSL), ASN

w.e.f 2012‐2013    Page 12 

Text Books:

1. Upper SaddleRiver, “Cryprotography and Network Security: Principal & Practices”,

2nd Edition by PHI

2. Stalling, Willian (AWL),”Network Management Principles & Practices by

Subramanian”, Mani (AWL) SNMP,

Reference Books:

SNMP: A Guide to Network Management (MGH)

H.H. Wang , “Telecom Network Management”,Mc-Graw Hill

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 13 

Advanced Computer Architecture

Code No.: CSL-2607 L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: This course is basically designed to give students awareness about the

various instruction sets, memory designing, cache memory schemes used in a computer

system.

Unit–1: Architecture And Machines: Some definition and terms, interpretation and

microprogramming. The instruction set, Basic data types, Instructions, Addressing and

Memory. Virtual to real mapping. Basic Instruction Timing.

Unit–2: Time, Area And Instruction Sets: Time, cost-area, technology state of the Art,

The Economics of a processor project: A study, Instruction sets, Professor Evaluation

Matrix

Unit-3: Cache Memory Notion: Basic Notion, Cache Organization, Cache Data, adjusting

the data for cache organization, write policies, strategies for line replacement at miss

time, Cache Environment, other types of Cache. Split I and D-Caches, on chip caches,

Two level Caches, write assembly Cache, Cache references per instruction, technology

dependent Cache considerations, virtual to real translation, overlapping the Tcycle in V-R

Translation, studies. Design summary.

Unit–4: Memory System Design: The physical memory, models of simple processor

memory interaction, processor memory modeling using queuing theory, open, closed and

mixed-queue models, waiting time, performance, and buffer size, review and selection of

queueing models, processors with cache.

w.e.f 2012‐2013    Page 14 

Unit–5: Concurrent Processors: Vector Processors, Vector Memory, Multiple Issue

Machines, Comparing vector and Multiple Issue processors.

Shared Memory Multiprocessors: Basic issues, partitioning, synchronization and

coherency, Type of shared Memory multiprocessors, Memory Coherence in shared

Memory Multiprocessors.

Text Book:

1. Hwang & Briggs, “Advance computer architecture”,TMH,1993

Reference Books:

1. Michael J. Fiynn, “ Pipelined and Parallel processor design”, Narosa,1995

Note: Eight questions will be set in all by the examiners taking at least one question from

each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 15 

Advanced Computer Networks Lab

Paper Code: CSP-2609 L P C

- 2 1

External Marks: 25 Total Marks: 50

Internal Marks: 25

Course Objective: This practical course will familiarize the students with various basic

tools, devices, components required for networking.

List of Experiments:

1.Experiments to support study of the Internet protocol stack

2. Experimental study of application protocols such as HTTP, FTP, SMTP, using network

packet sniffers and analyzers such as Ethereal.

3. Small exercises in socket programming in C/C++/Java.

4. Experiments with packet sniffers to study the TCP protocol. Using OS (netstat, etc)

tools to understand TCP protocol FSM, retransmission timer behavior, congestion control

behaviour.

Note: Examiner can select any other practical related to the subject.

w.e.f 2012‐2013    Page 16 

Digital System Design Lab

CSP-2611

L T P Total Credit=1

- - 2

External Marks: 25 Total Marks: 50

Internal Marks: 25

Course Objective: Familiarization and designing of various types of combinational and

sequential circuits.

Practical must be based on VHDL

w.e.f 2012‐2013    Page 17 

Term Paper

Paper Code: CSP-2613 L T C

- - 2

Internal Marks: 50 Total Marks: 50

The term paper will be based on any latest technology in the field of Network Security.

w.e.f 2012‐2013    Page 18 

Semester-2

Analysis & Design of Algorithms

Code No.: CSL-2602 L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: This course is designed to be aware of various NP Problems, Sorting

Techniques, Graph Algorithms etc.

Unit-1

Preliminaries: Recurrences: The substitution method, The iteration method, The master

method, Data Structures for Disjoint Sets.

Divide and Conquer Approach: Merge Sort, Quick sort, Medians and Order statistics,

Strassen’s algorithm for Matrix Multiplications.

Unit- 2

Dynamic Programming: Elements of Dynamic Programming, Matrix Chain

Multiplication, Longest common subsequence and optimal binary search trees problems.

Greedy Algorithms: Elements of Greedy strategy, An activity selection problem,

Huffman Codes, A task scheduling problem.

Unit- 3

Graph Algorithms: Representation of Graphs, Breadth First Search, Depth First Search,

Topological Sort, Strongly Connected Components, Algorithm for Kruskal’s and Prim’s

for finding Minimum cost Spanning Trees, Dijkstra’s Algorithm for finding Single source

shortest paths. All pair shortest paths and matrix multiplication, Floyd – Warshall

algorithm for all pair shortest paths.

w.e.f 2012‐2013    Page 19 

Unit- 4

String matching: The naïve String Matching algorithm, The Rabin-Karp Algorithm,

String Matching with finite automata, The Knuth-Morris Pratt algorithm.

NP-Complete Problem: Polynomial-time verification, NP-Completeness and

Reducibility, NP-Completeness Proof, NP-Complete problems.

TEXT BOOKS:

1. T. H. Cormen, C. E. Leiserson, R. L. Rivest, Clifford Stein, “Introduction to

Algorithms”, 2nd Ed., PHI, 2004.

REFERENCES BOOKS:

1. A. V. Aho, J. E. Hopcroft, J. D. Ullman, “The Design and Analysis of Computer

Algorithms”, Addition Wesley, 1998.

2. Ellis Horowitz and Sartaz Sahani, “Computer Algorithms”, Galgotia Publications,

1999.

3. D. E. Knuth, “The Art of Computer Programming”, 2nd Ed., Addison Wesley,

1998

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 20 

Security of Information System

Paper Code: CSL-2604 L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: It deals about various security issues like database , operating system,

program ,web based, email security.

Unit-1

Basic Encryption and Decryption ,Perfect Substitution Cipher such as the Vernam

Cipher, Stream and Block Ciphers, Characteristics of ‘Good’ Ciphers: Shannon

Characteristics, Confusion and Diffusion, Information Theoretic Tests, Unicity Distance.

Unit-2

Secure Encryption Systems, Properties of Arithmetic Operations: Inverses, Primes,

Greatest Common Divisor, Euclidean Algorithm, Modular Arithmetic, Properties of

Modular Arithmetic, Computing the inverse, Fermat's Theorem, Algorithm for

Computing Inverses, Random number generation.

Hash Algorithms: Hash Concept , Description of Hash Algorithms , Message Digest

Algorithms such as MD4 and MD5 , Secure Hash Algorithms such as SHA1 and SHA2.

Secure Secret Key (Symmetric ) Systems:Analyzing and Strengthening of DES, Key

Escrow and Clipper, Introduction to Advance Encryption Standard (AES)

Unit–3

Applied Cryptography, Protocols and Practice, Key Management Protocols:Solving Key

Distribution Problem, Public Key Infrastructure (PKI): Concept of Digital Certificate,

Certificate Authorities and it's roles, X509 Structure of Digital Certificate, Types of

Public Key Infrastructures. Legal Issues: Copyrights, Patents, Trade Secrets, Computer

Crime, Cryptography and the Law.

w.e.f 2012‐2013    Page 21 

Unit–4

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

Ordinary Operating System, Security Features of Trusted Operating System.

Database Security: Security Requirements of Databases, Reliability and Integrity,

Protection of Sensitive Data, Inference Problem: Direct and Indirect Attacks

Program Security: Kinds of Malicious Code, How Viruses Attach and Gain Control,

Homes for Viruses, Virus Signatures, Preventing Virus Infection, Trapdoors, Convert

Channels, Control Against Program Threats, Java mobile codes.

Unit-5

Network Security Issues such as Impersonation, Message Confidentiality, Message

Integrity, Code Integrity, Denial of Service, Secure Communication Mechanisms such as

IPSec, PKI based Authentication and Kerberos Authentication, Biometrics

Authentication Mechanisms, Access Control Mechanisms, Firewalls

Web Security: Solving Privacy Problems, Solving Authentication Problems, Safe

Guarding Web Servers.

Text Books:

1. Charles P Pfleeger,”Security in Computing”

2. Bruce Schnneier , “ Applied Cryptography Protocols”

3. Lincoln d stein, “World wide web security FAQ”

4. RSA Laboratories, “Cryptographic Message Synatx Standards”

Reference Books:

1. William Stallings, “Network Security Principles”, Pearson

2. William stallings, “Cryptography Essentials”, Pearson

Note: Eight questions will be set in all by the examiners taking at least one question from

each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 22 

Network Programming

L T C

Paper Code: CSL-2606 3 2 4

Duration of Exam: 3 Hrs.

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective:

It deals with programming issues of various protocols, socket programming, file system

concepts.

Unit-1:

Introduction to networking, TC/IP Protocol architecture, Classful internet addresses,

subnets, super netting, address resolution Protocol (RAP) and RARP, IP datagram

format, UDP and TCP/data grams , ICMP its purpose , FINGER, NET STAT details &

IPconfig, Ping, TRACERT,ROUTE.

Unit-2:

Socket introduction, elementary TCP sockets, TCP client sever, I/O functions, select&

poll functions, socket options elementary UDP sockets, elementary node and address

conversions, echo service (TCP and UDP).

Unit-3:

Algorithm and issues in server software design :iterative connectionless servers, (UDP),

Iterative, connection oriented servers (TCP), single process, concurrent servers

multiprotocol servers (TCP,UDP), multi service servers (TCP,UDP).

Unit-4:

w.e.f 2012‐2013    Page 23 

Remote procedure call concept (RCP) :RPC models, analogy between RPC of client and

server, remote programs and procedures, their multiple versions and mutual exclusion

communication semantics, RPC retransmits, dynamic port mapping ,authentication.

Unit-5:

Network file system concept of data link access, debugging techniqu,es ,Routing sockets,

broadcasting to mobile network.

Text Books:

1. W.Richard Stevens, “Unix Network programming”, Vol -2nd edition,

2. Doubles e-commer , “Internet working with TCP/IP Vol-1,”.

3. Doubles E comer, David L.Stevens, “Internetworking TCP/IP Vol III”

Reference Book:

1. Internetworking with TCP/IP, Vol II

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 24 

Elective -1

Information Theory and Coding

CSL-2608

L T C

3 2 4

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: The objective of this course is to give awareness about different types

of coding schemes used like source coding, channel coding, convolution coding.

Unit-1

Information, channel capacity, The concept of amount of information, entropy,

Information rate, Conditional and joint entropies.

Unit- 2

Source coding: Noise less coding, Shannon’s first fundamental theorem, Discrete

memory less channel, Mutual information, Sources with finite memory, Markov sources,

Shannon’s second fundamental theorem on coding, Huffman coding, Lempel – Ziv

algorithm, Shannon-Fano algorithm.

Unit- 3

Channel coding : Error detecting codes, Hamming distance, Error correcting codes,

Repitition codes, Linear block codes, binary cyclic codes, BCH codes, Reed-Soleman

codes, Golay codes.

Unit- 4

Convolution Coding: Code tree, state diagram, Trellis diagram, Maximum-Likelihood

decoding – Viterbi’s algorithm, sequential decoding.

w.e.f 2012‐2013    Page 25 

Network information theory, introduction to Stenography.

TEXT BOOKS:

1. S. Haykins, “Digital Communications”, Wiley, 2000.

REFERENCE BOOKS:

1. T M Gover, J M Thomos, “Elements of Information Theory”, Wiley, 1999.

2. J G Proakis, “ Digital Communications”, Mc Graw Hill, 2001.

w.e.f 2012‐2013    Page 26 

Computer Graphics

CSL- 2616 L T C

3 2 4

Duration of Exam: 3 Hrs

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: The objective of this course is to make aware about various2-D, 3-D ,

transformations, projections, clipping .and shading

Unit- 1

Transformation, Projections, and Clipping Algorithms: Bresenham’s Line Drawing

Algorithm, Homogeneous Coordinate System for 2D and 3D, Various 2D, 3D

Transformation matrices (Translation, Scaling, Rotation, Shear), Rotation about an

arbitrary point (2D), Rotation about an arbitrary axis (3D), Computing location of V.P,

Clipping Algorithms, Sutherland-Cohen Clipping Algorithm.

Unit-2

Curves and Surfaces: Bresenham’s Circle Drawing Algorithm, Bezier Curves, 4 point

and 5 point Bezier curves using Bernstein Polynomials, Conditions for smoothly joining

curve segments, Bezier bi-cubic surface patch, B-Spline Curves, Cubic B-Spline curves

using uniform knot vectors, Testing for first and second order continuities

Unit-3

Projection and Solid Modelling: Parallel Projection, Oblique Projection on xy plane,

Isometric Projection, Perspective Projection, One Vanishing Point (V.P.) projection from

a point on z axis, Generation of 2 V.P. Projection, Isometric Projection, Perspective,

Projection, one vanishing Pint (VP), projection from 0 point on z axis, Generation of 2

VP Projector & Projections, Solid Modelling.

Unit-4

w.e.f 2012‐2013    Page 27 

Shading and Hidden Surface Removal: Shading, Illumination Model for diffused

Reflection, Effect of ambient lighting, distances, Specular Reflection Model, Computing

Reflection Vector, Curved Surfaces, Polygonal Approximations, Gourard Shading, Phong

Model, Hidden Surface Removal, Back Face Detection, Depth Buffer (Z-Buffer, A-

Buffer) Method, Scan Line Method, Depth Sorting Method, Area Subdivision Method.

TEXT BOOKS:

1. Foley et. al., “Computer Graphics Principles & practice”, Addison Wesley, 1999.

2. David F. Rogers, “Procedural Elements for Computer Graphics”, McGraw Hill

Book Company, 1985.

REFERENCES BOOKS:

1. D. Rogers and J. Adams, “Mathematical Elements for Computer Graphics”,

MacGraw-Hill International Edition, 1989.

2. D. Hearn and P. Baker, “Computer Graphics”, Prentice Hall, 1986.

3. R. Plastock and G. Kalley, “Theory and Problems of Computer Graphics”,

Schaum’s Series, McGraw Hill, 1986.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 28 

Microprocessor & Interfacing

CSL-2618 L T C

3 2 4

Duration of Exam: 3 Hrs

External Marks: 50 Total Marks: 100

Internal Marks: 50

Course Objective: This course deals with various types of microprocessors and generations, futnctions, chipsets of 8085,8086 and other advance versions. Unit 1. THE 8085 PROCESSOR: Introduction to microprocessor, 8085 microprocessor: Architecture, instruction set, interrupt structure, and assembly language programming. Unit 2. THE 8086 MICROPROCESSOR ARCHITECTURE: Architecture, block diagram of 8086, details of sub-blocks such as EU, BIU; Special functions of General purpose registers. 8086 flag register and function of 8086 Flags, memory segmentation and physical address computations, program relocation, addressing modes, instruction formats, pin diagram and description of various signals. Unit 3. INSTRUCTION SET OF 8086: Instruction execution timing, assembler instruction format, data transfer instructions, arithmetic instructions, branch instructions, looping instructions, NOP and HLT instructions, flag manipulation instructions, logical instructions, shift and rotate instructions, directives and operators, programming examples. Unit 4. INTERFACING DEVICE: The 8255 PPI chip: Architecture, control words, modes and examples, Interfacing Keyboard, Displays, Stepper Motor and actuators, D/A and A/D converter interfacing. Introduction to DMA process, Need for DMA, 8237 DMA controller, DMA data transfer Method, Interfacing with 8257, 8259 Programmable interrupt controller, Programmable interval timer chips. TEXT BOOKS: 1. Microprocessor Architecture, Programming & Applications with 8085: Ramesh S

Gaonkar; Wiley Eastern Ltd. 2. The Intel Microprocessors 8086- Pentium processor: Brey; PHI 3. Microprocessors and interfacing - Douglas V. Hall, TMH, 2nd Edition, 1999. REFERENCE BOOKS:

w.e.f 2012‐2013    Page 29 

1. The 8088 & 8086 Microprocessors-Programming, interfacing, Hardware & Applications: Triebel & Singh; PHI

2. Advanced Microprocessors and Interfacing: Badri Ram; TMH. 3. Advanced microprocessor and Peripherals - A.K.Ray and K.M.Bhurchandi, TMH, 2000. 4. Design with PIC Micro Controllers – John B. Peatman, 2005. 5. 8051 Micro Controllers and Embedded Systems – Dr. Rajiv Kapadia, Jaico Publishers. 6. 8051 Microcontroller - Kenneth J. Ayala, Penram International/ Thomson, 3rd

Edition, 2005.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 30 

Network Security Lab

Paper Code : CSP-2610 L P C

- 2 1

External Marks: 25 Total Marks: 50

Internal Marks: 25

Course Objective: The objective of this course is to make students familiar to various

network security issues.

Practical will be based on Network Security.

Introduction to ns2 (network simulator) - small simulation exercises to study TCP

behavior under different scenarios. Setting up a small IP network - configure interfaces,

IP addresses and routing protocols to set up a small IP network. Study dynamic behaviour

using packet sniffers Experiments with ns2 to study behaviour (especially performance

of) link layer protocols such as Ethernet and 802.11 wireless LAN.

w.e.f 2012‐2013    Page 31 

CSP-2612 Network Programming Lab

L T P Total Credit=2

- - 2

External Marks: 25 Total Marks: 50

Internal Marks: 25

Duration of Exam: 3 Hrs.

Course Objective: This course focuses on Socket programming in C/C++/VC++/Java

The socket programming can be done on Unix/Linux operating or/and Windows. Socket

programming, and the language can be C/VC++ and/or Java

1. Write a program to Create Sockets For Sending And Receiving Data.

2. Write a program to Obtain The Local & Remote Socket Address.

3. Write a program to Create Sockets For Handling Multiple Connection

4. Write a program to Obtain The Information About The (A) Host (B) Network (C)

Protocols (D) Domains

5. Write a program to Manipulate The IP Address.

6. Write a program to Write A Telnet Client.

7. Write a program to Make An FTP Client

Note: At least 5 to 10 more exercises to be given by the teacher concerned.

w.e.f 2012‐2013    Page 32 

CSP-2614 Term Paper

L T P Total Credit=2

- - -

Internal Marks: 50

The Term Paper will be based on Network Security.

w.e.f 2012‐2013    Page 33 

Semester-3

CSL-2615 System Simulation

L T P Total Credits=4

3 2 -

External Marks: 50 Total Marks: 100

InternalMarks: 50

Course Objective: The main objective of this course is to introduce about various

simulation tools and techniques and relevant cases study.

Unit-1

System models and role of simulation. Entities, Attributes, States and Activities. Types of

systems - Deterministic, Stochastic, Continuous and Discrete systems. Steps in

simulation studies.

Unit-2

Statistical tools and techniques- generation of pseudorandom numbers, random variate

generation for uniform, Poisson and normal distributions, sampling and estimation,

maximum likelihood estimation, confidence intervals and hypothesis testing, stochastic

processes and Markov models.

Unit-3

Discrete event simulation languages. Simulation of inventory and queuing systems -

single and multiserver queues, network of queues. Modelling and performance evaluation

of computers and computer communication networks. Workload characterization.

w.e.f 2012‐2013    Page 34 

Continuous system simulation languages, growth and decay models, system dynamics

diagrams.

Unit-4

Biological and Sociological system simulation. Verification and validation of simulation

models - input/output validation, sensitivity analysis, performance measures and their

estimation. Case studies.

Text Books:

1. Bernard P. Zeigler, Theory of Modelling and Simulation, Krieger Publishing Co., Inc.,

Melbourne, FL, 1984

2. Narsingh Deo, System Simulation with Digital Computer, Prentice Hall PTR, Upper

Saddle River, NJ, 1983

3. Graham M. Birtwistle, DEMOS: a system for discrete event modelling on Simula,

Springer-Verlag New York, Inc., New York, NY, 1987

Note: Eight questions will be set in all by the examiners taking two questions from each

unit. Students will be required to attempt five questions in all selecting at least one

question from each unit.

w.e.f 2012‐2013    Page 35 

Elective –II Soft Computing

CSL-2617 L T P

3 2 -

External Marks: 50 Total Marks:100

Internal Marks: 50

Course Objective: This Course gives an idea about various soft computing techniques

like neural networks and fuzzy logic.

Unit-1

Neural Networks : History, overview of biological Neuro-system,Mathematical Models

of Neurons, ANN architecture, Learning rules, Learning Paradigms-Supervised,

Unsupervised and reinforcement Learning ANN training algorithms-perceptrons,

Training rules, Delta, Back Propagation Algorithm, Multilayer Perceptron Model

Unit-2

Hopfield Networks, Associative Memories, Applications of Artificial Neural Networks.

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

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

Compliment, Intersection, Union, Combination of Operations, Aggregation Operation.

Unit-3

Fuzzy Arithmetic : Fuzzy Numbers, Linguistic Variables, Arithmetic Operations on

Intervals & Numbers, Lattice of Fuzzy Numbers, Fuzzy Equations. Classical Logic,

Multi-valued Logics, Fuzzy Propositions, Fuzzy Qualifiers, Linguistic Hedges.

Unit-4

Uncertainty based information : Information & Uncertainty, Nonspecificity of Fuzzy &

Crisp Sets, Fuzziness of Fuzzy Sets.

Text Books:

1.Zuarda, “Introduction to Neural Networks”,Jaico Publishers

2. Rajshekran, “ Neural Networks,Fuzzy Logic, Genetic Algorithms”, PHI

References :

1.Simon Haykin, “ Neural Networks “,PHI

2. Kosko, “Neural Networks”, PHI

w.e.f 2012‐2013    Page 36 

Software Verification, Validation& Testing

CSL- 2629 L T C

3 2 4

External Marks: 50 Total Marks:100

Internal Marks: 50

Course Objective: This course focuses on various types of testing techniques, verification

and validation methods.

Unit 1 : Introduction

Definition of testing, goals, psychology, model for testing, effective testing, limitations of

testing. Testing terminology and Methodology Defs of Failure, faults or bug, error,

incident, test case, test ware, life cycle of bug, bug effects, bug classification, test case

design, testing methodology, development of test strategy, verification, validation,

testing life cycle model, testing techniques, testing principles.

Unit 2 : Verification and validation

Verification activities, verification of requirements, verification of HL design,

verification of data design, verification of architectural design, verification of UI design,

verification of LL design, intro to validation activities.

Unit 3 : Black Box testing

Boundary value analysis, equivalence class partitroning, state table based testing,

decision table based, graph based testing, error guessing. White Box testing

Logic coverage criteria, basic path testing, graph matrices, loop testing, data flow testing,

mutation testing. Static testing Types of static testing, technical reviews, inspections,

inspection process, structured walk through, walk through process, adv. of static testing.

Unit 4 : Validation Testing

w.e.f 2012‐2013    Page 37 

Unit testing, drivers stubs, integration testing, methods, effect of module coupling and

cohesion, functional testing, sytem testing, recovery testing, security testing, stress

testing, performance testing, usability testing.

Test Automation and debugging S/w measurement and testing, testing metrics, tools,

debugging design of practical test cases, reducing no of test cases, regression testing

and test case mgmt.

TEXT BOOKS:

1. K. K. Aggarwal & Yogesh Singh, “Software Engineering”, 2nd Ed., New Age

International, 2005.

2. R. S. Pressman, “Software Engineering – A practitioner’s approach”, 5th Ed.,

McGraw Hill Int. Ed., 2001.

REFERENCE BOOKS:

1. Stephen R. Schach, “Classical & Object Oriented Software Engineering”, IRWIN,

TMH, 1996.

2. James Peter, W. Pedrycz, “Software Engineering: An Engineering Approach”,

John Wiley & Sons, 2004.

3. I. Sommerville, “Software Engineering”, Addison Wesley, 2004

4. K. Chandrasehakhar, “Software Engineering & Quality Assurance”, BPB, 2005.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 38 

Embedded System Design

Code No.: CSL-2631 L T C

3 2 4

External Marks: 50 Total Marks:100

Internal Marks: 50

Duration of Exam: 3 Hrs

Course Objective: This course focuses on designing of embedded system, operating

system and microcontrollers.

Unit-1

Introduction to an embedded systems design & RTOS: Introduction to Embedded system,

Processor in the System, Microcontroller, Memory Devices, Embedded System Project

Management, ESD and Co-design issues in System development Process, Design cycle in

the development phase for an embedded system, Use of target system or its emulator and

In-circuit emulator, Use of software tools for development of an ES.

Inter-process Communication and Synchronization of Processes, Tasks and Threads,

Problem of Sharing Data by Multiple Tasks, Real Time Operating Systems: OS Services,

I/O Subsystems, Interrupt Routines in RTOS Environment, RTOS Task Scheduling

model, Interrupt Latency and Response times of the tasks.

Unit-2

Overview of Microcontroller: Microcontroller and Embedded Processors, Overview of

8051 Microcontroller family: Architecture, basic assembly language programming

concepts, The program Counter and ROM Spaces in the 8051, Data types, 8051 Flag Bits

ad PSW Register, 8051 Register Banks and Stack Instruction set, Loop and Jump

Instructions, Call Instructions, Time delay generations and calculations, I/O port

programming Addressing Modes, accessing memory using various addressing modes,

Arithmetic instructions and programs, Logical instructions, BCD and ASCII application

w.e.f 2012‐2013    Page 39 

programs, Single-bit instruction programming, Reading input pins vs. port Latch,

Programming of 8051 Timers, Counter Programming

Unit-3

Communication with 8051: Basics of Communication, Overview of RS-232, I2C Bus,

UART, USB, 8051 connections to RS-232, 8051 serial communication programming,

8051 interrupts, Programming of timer interrupts, Programming of External hardware

interrupts, Programming of the serial communication interrupts, Interrupt priority in the

8051.

Unit- 4

Interfacing with 8051: Interfacing an LCD to the 8051, 8051 interfacing to ADC,

Sensors, Interfacing a Stepper Motor, 8051 interfacing to the keyboard, Interfacing a

DAC to the 8051, 8255 Interfacing with 8031/51, 8051/31 interfacing to external memory

TEXT BOOKS:

1. Raj Kamal, “Embedded Systems”, TMH, 2004.

2. M.A. Mazidi and J. G. Mazidi, “The 8051 Microcontroller and Embedded

Systems”, PHI, 2004.

REFERENCES BOOKS:

1. David E. Simon, “An Embedded Software Primer”, Pearson Education, 1999.

2. K.J. Ayala, “The 8051 Microcontroller”, Penram International, 1991.

3. Dr. Rajiv Kapadia, “8051 Microcontroller & Embedded Systems”, Jaico Press

4. Dr. Prasad, “Embedded Real Time System”, Wiley Dreamtech, 2004.

Note: Eight questions will be set in all by the examiner taking at least one question

from each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 40 

Advanced Data Base Management System

Paper Code: CSL-2619 L T C

3 2 4

Internal Marks: 50 Total Marks: 100

External Marks: 50

Course Objective: This paper deals with advanced concepts of Data base management

system, SQL, Object Oriented Data Base.

Unit- 1

Introduction : Architecture, Data models, relational algebra, SQL, Normal forms. Query

Processing : General strategies for query processing, transformations, expected size,

statistics in estimation, query improvement, query 'evaluation, view processing, query

processor.

Unit-2

Recovery : Reliability, transactions, recovery in centralized DBMS, reflecting updates,

Buffer management, logging schemes, disaster recovery. Concurrency : Introduction,

serializability, concurrency control, locking schemes, timestamp based ordering,

optimistic scheduling, multiversion techniques, deadlocks.

Unit-3

Object Oriented Data base Development : Introduction, Object definition language,

creating object instances, Object query language. Distributed Databases : Basic concepts,

options for distributing a database, distributed DBMS.

Unit-4

Data warehousing : Introduction, basic concepts, data warehouse architecture, data

characteristics, reconciled data lyer, data transformation, derived data layer, user

interface. Object Relational Databases : Basic concepts, enhanced SQL, advantages of

object relational approach.

w.e.f 2012‐2013    Page 41 

References :

1. An Introduction to database systems by Bipin C. Desai, Galgotia

Publications.

2. Modern Database Management by Feffray A. Lioffer, Mary B. Prescotl, Fred R

Mcfadden, 6th editio n, Pearson Educatio n.

3. Principles of distributed database systems, by M.Tamer & Valduriez, 2nd edition, LPE

Pearson education.

4. Database system concepts by Korth.

Note: Eight questions will be set in all by the examiner taking at least one question from

each unit. Students will be required to attempt five questions in all.

w.e.f 2012‐2013    Page 42 

Seminar

Code No.: CSP-2621 L P C

- - 2

Internal Marks: 50 Total Marks: 50

Seminar will be based on current topic of Network Security.

w.e.f 2012‐2013    Page 43 

Dissertation Phase-I

Code No: CSP-2623 L P C

- - 4

Internal Marks: 50 Total Marks:100

External Marks:50

Dissertation phase-I mainly focus on the problem defining and literature survey specific

to the problem. The student will submit a synopsis at the beginning of the semester for

the approval from the project committee in a specified format that clearly define the

problem.

w.e.f 2012‐2013    Page 44 

System Simulation Lab

Code No.: CSP-2625 L P C

- 2 1

Internal Marks: 25 Total Marks:50

External Marks:25

Practical will be based on simulators like NS,NS2,GLOMOSIM, etc.

w.e.f 2012‐2013    Page 45 

Term Paper

Paper Code: CSP-2627 L T C

- - 2

The term paper will be based on the Network Security.

w.e.f 2012‐2013    Page 46 

Fourth Semester

Dissertation Phase-II

Code No: CSP-2622 L P C

- - 20

Internal Marks: 250 Total Marks: 500

External Marks:250

The student will submit a synopsis at the beginning of the semester for the approval from

the project committee in a specified format. Synopsis must be submitted within a two

seeks. The first defence, for the dissertation work, should be held with in a one month.

Dissertation Report must be submitted in a specified format to the project committee for

evaluation purpose.

w.e.f 2012‐2013    Page 47 

Seminar & Progress Report

Code No: CSP-2624 L P C

- - 4

Internal Marks: 100 Total Marks: 100

The student will have to present the progress of the project work through seminars and

progress reports at the interval of four weeks.