department of computer science & … · ... kdc protocols, shared secret key, diffle-hellman...

DEPARTMENT OF COMPUTER SCIENCE & ENGINEERING

FACULTY OF ENGINEERING,

NNSS’ SAMALKHA GROUP OF INSTITUTIONS

01, HATHWALA ROAD, SAMALKHA, DELHI CHANDIGARH ROAD NCR-132115(HR.)

Academic Calendar (Session August – December 2014)

B. Tech. S. No. Details Date

1. Revision Exercise before 1st sessional Exams - 3rd – 4th October, 2014 (Thursday to Saturday)

2. 1st Sessional Exams (One and half Units) - 7th -10th October, 2014 (Tuesday to Friday)

3. 1st Sessonal Result - 15th October, 2014 (Wednesday)

4. Revision Exercise before 2nd sessional Exams - 7th to 8th November, 2014 (Thursday to Saturday)

5. 2nd Sessional Exams (Next one & half Units) - 10th – 13th November, 2014 (Monday to Thursday)

6. 2nd Sessonal Result - 18th November, 2014 (Tuesday)

7. 3rd Sessional (In class Room)(Full Syllabus) - 01st – 4th December, 2014 (Monday to Thursday)

M. Tech. (CSE, ECE, EEE, CE & ME) S. No. Details Date

1. 1st Sessional Examination - 17-18th October, 2014 (Friday-Saturday)

2. 2nd Sessional Examination - 28-29th November, 2014 (Friday-

Saturday)

BBA & MBA S. No. Details Date

1. 1st Sessional Examination - 7th-14th October,2014 (Tuesday to Tuesday)

2. 2nd Sessional Examination - 10th – 17th November, 2014 (Monday to Monday)

Fresher’s Party Schedule

S. No. Department Venue Date

1. C. S. E. SH1/A2 Block 20th September, 2014 (Saturday)

2. E. C. E. & E. E. E. SH1/A2 Block 27th September, 2014 (Saturday)

3. M. B. A. and B. B. A. SH1/A2 Block 18th October, 2014 (Saturday)

4. M. E. & M.E. (Auto) SH1/A2 Block 15th November, 2014 (Saturday)

5. C. E. and Aero. Engg. SH1/A2 Block 22nd November, 2014 (Saturday)

List of Pending Holidays in Session 2014-15 (Odd Semester)

S. No. Name of Holiday Date Day of the week

1 Raksha Bandhan 10th August SUNDAY

2 Independence Day 15th August FRIDAY

3 Janmashtmi 18th August MONDAY

4 Mahatma Gandhi Birthday 2nd October THURSDAY

5 Dusshera 3rd October FRIDAY

6 Id-ul-Zuha(Bakrid) 6th October MONDAY

7 Diwali 23rd October THURSDAY

8 Vishwa Karma Day 24th October FRIDAY

9 Haryana Day 1st November SATURDAY

10 Guru Nanak Birthday 6th November THURSDAY

11 Christmas Day 25th December THURSDAY

Departmental Elective-II

1. CSE-441 Software Project Management

2. CSE-443 Embedded System Design

3. CSE-445 Artificial Intelligence

4. CSE-447 Image Processing

Departmental Elective-III

1. CSE-471 - Unix & Linux Programming

2. CSE-473 - Security & Cryptography

Software Project Management (CSE-441)

Unit-1

Conventional Software management: Evolution of software economics. Improving software

economics: reducing product size, software processes, team effectiveness, automation through.

Software environments. Principles of modem software management.

Unit-2

Software management Process: Framework: Life cycle phases- inception, elaboration,

construction and training phase. Artifacts of the process- the artifact sets, management artifacts,

engineering artifacts, and pragmatics artifacts. Model based software architectures. Workflows

of the process. Checkpoints of the process.

Unit-3

Software Management Disciplines: Iterative process planning. Project organizations and

responsibilities. Process automation. Project control and process instrumentation- core metrics,

management indicators, life cycle expectations. Process discriminants.

NOTE: There will be 8 questions in all. At least two questions will be set from each unit.

Books

1. Software Project management,Walker Royce, Addison Wesley, 1998.

2. Project management 2/e, Maylor.

3. Managing the Software Process, Humphrey.

4. Managing global software Projects, Ramesh, TMfH,2001.

Subject: Software Project Management(CSE-441)

i Lecture Topic Book name Author

Unit -

1

L1 Conventional Software management:

Software Project

Management Walker Royce

L2 Evolution of software economics

Software Project


L3-4 Improving software economics: reducing

product size, software processes,team

effectiveness, automation through

Software Project


L5 Software environments

Software Project


L6 Principles of modem software management

Software Project


Unit-2

Software management Process:

Framework

L7 Life cycle phases- inception, elaboration,

Construction and training phase

Software Project


L8 Artifacts of the process- the artifact sets,

management artifacts, engineering artifacts

and pragmatics artifacts

Software Project


L9 Model based software architectures

Software Project


L10 Workflows of the process

Software Project


L11 Checkpoints of the process

Software Project


Unit-3

Software Management Disciplines:

L12-13 Iterative process planning

Software Project


L14-15 Project organizations and responsibilities

Software Project


L16 Process automation

Software Project


L17-

L19

Project control and process

instrumentation - core metrics, management

indicators, life cycle expectations Software Project


L20 Process discriminants

Software Project


Software Project Management (CSE-441)

UNIT-1

Assignment-1

1. (a) Define software project management. BT-7/D11

(b) Differentiate between Conventional and modern software management.

2. How you can improve software economics by reducing product size. Explain. BT-7/D11

3. Can we estimate the cost of a software product before its development? If yes, justify

your answer in detail with an example. BT-7/DX

4. Explain briefly the following: BT-7/DX

i. Principles of modern software management

ii. Evolution of software economics

5. Describe various levels of process briefly. How we can improve software process?

Explain with an example. BT-7/DX

Assignment-2

1) Why is software project management important? What are activities covered by software

project management? BT-7/DX

2) What are the problems with software projects?

3) Explain briefly the Evolution of software economics? BT-7/DX

4) Explain the following term: BT-7/D11

i. automation through

ii. Team effectiveness?

UNIT-2

Assignment-1

1. Describe the inception, elaboration, construction and training phase of software life cycle

BT-7/D11

2. Explain the following terms: BT-7/D11

i) Management artifacts

ii) Engineering artifacts

iii) Pragmatics artifacts

3. Write short notes on Check points of the process. BT-7/DX

4. Write short notes on Process core metrics BT-7/DX

Assignment – 2

1. What are artifacts of the process? Explain three types of artifacts in detail. BT-7/DX

2. Explain Model based software architecture. BT-7/DX

3. Explain the software life cycle in detail.

4. Explain the importance of project control. BT-7/D11

UNIT-3

Assignment- 1

1. Explain iterative process planning. BT-7/D11

2. Discuss Process Automation in brief. BT-7/D11

3. Describe project organizations and responsibilities with help of suitable examples.

BT-7/D11

4. Write a short note on life cycle expectations. BT-7/D11

Assignment-2

1. Discuss model based software architectures. BT-7/D11

2. Discuss the following in detail with examples: BT-7/D11

(i) Process discriminants

3. Explain the following brief:

(i) Project control

(ii) Process instrumentation

4. Explain the step Wise Planning Process in detail. BT-7/D11

Security and Cryptography (CSE -473)

Unit-1

Traditional Cryptography: Crypto analysis, substitution and transposition ciphers,

cryptographic principles, secret – key algorithms: DES, DES chaining, Breaking DES, IDEA,

Differential and Linear crypto analysis Public –key algorithms : RSA, Knapsack.

Unit-2

Authentication protocols: KDC protocols, shared secret key, Diffle-Hellman Key exchange,

Needham –n Schroeder protocol, Using Kerbros, interlock protocol, digital signatures- Secret

key and public key signatures, DSS, message digest, MD5 and Secure Hash algorithms

Unit-3

Computer security Mechanisms: Role of different security Mechanisms, passwordstechnology

and administration, principles of database system security , epidemic of viruses: types of viruses

Study of different virus codes, means of spread, prevention from virus, life cycle of a virus,

immunization, Trojan horse and bombs with examples, writing antivirus /

Trojan codes.

Unit-4

Network security: Basics, Security Functions, preventing loss and damage, securing local area

network- authorization, security plan and policy, Securing enterprise network- setting priorities,

security plans, securing network components, hardware security, levels of access control and

authorization.

Note: - There will be 8 questions in all. Two Questions will be set from each unit. Students are

required to attempt five questions selecting at least one question from each unit.

Books

1. Richard H. Baker, Network security , Mcgraw Hill International Ed. 1996

2. B. Schneier , Applied Cryptography, John Wiley New York, 1996

3. C. Kaufman et. Al, Network security , Prentice Hall International,1998

Unit Lecture Topic

UNIT-1

L-1 Crypto analysis ,substitution and transposition ciphers

L-2 cryptographic principles,secret – key algorithms

L-3 DES, DES chaining,

L-4 Breaking DES,

L-5 IDEA

L-6 cryptographic principles, secret – key algorithms: DES,

DES chaining, Breaking DES, IDEA,

Differential and Linear crypto analysis

L-7 Public –key algorithms

L-8 RSA,

L-9 Knapsack

UNIT-2

L-10 KDC protocols

L-11 shared secret key

L-12 Diffle-Hellman Key exchange,

L-13 Needham –n Schroeder protocol

L-14 Using Kerbros

L-15 interlock protocol

L-16 digital signatures- Secretkey and public key signatures

L-17 DSS, message digest

L-18,19 MD5 and Secure Hash algorithms

UNIT-3

L-20 Role of different security Mechanisms

L-21 passwords technologyand administration,

L-22 principles of database system security

L-23 epidemic of viruses:types of viruses

L-24 study of different virus codes

L-25 means of spread, prevention from virus,

L-26 life cycle of a virus,immunization

L-27 Trojan horse and bombs with examples

L-28 writing antivirus/Trojan codes.

UNIT-4

L-29 Network security: Basics, Security Functions

L-30 preventing loss and damage,

L-31 local area network- authorization

L-32 security plan and policy

L-33 Securing enterprise network- setting priorities

L-34 security plans, securing network components

L-35 hardware security

L-36 levels of access control andauthorization

Security and Cryptography (CSE -473)

UNIT-1

Assignment-1

1. Define the following terms: BT-7/M-11

(i) Non-repudiation

(ii) Stream and block ciphers

(iii) Digital envelope

(iv) Session key

2. Explain briefly about block cipher principles and modes of operation. BT-7/M-11

3. Write the detailed description of RSA algorithm. Is RSA algorithm is useful for employing in

mass cryptography? Explain. BT-7/DX

4. Describe any two applications of public key cryptosystem. BT-7/DX

UNIT-1

Assignment-2

1. Perform encryption/decryption using RSA algorithm for the following: BT-7/M-11

P=3, q=11, c=7, m=s (7)

2. Encrypt “IN/TERNET” using transposition cipher with the following key: BT-7/M-11

3 5 2 1 4

1 2 3 4 5

3. What are the criteria used while designing the DES algorithm? Describe the block modes of

operations of DES with their advantages. BT-7/DX

4. (a) When an encryption algorithm is said to be computationally secure? BT-7/DX

(b) Define the one way property to be possessed by any hash function.

UNIT-2

Assignment-3

1. Describe the Diffie- Hellman key exchange algorithm and explain it with example.

BT-7/M-11

2. Alice and Bob want to establish a secret key using the Diffie-Hellman key exchange protocol

using n=11, g=5, x=2, y=3.Find the values A and B and the secret key. BT-7/M-11

3. How discrete logarithm is evaluated for a number? What is the role of discrete logarithms in

the Diffie-Hellman key exchanging the secret Key among two users? BT-7/DX

4. Explain MD5 message digest algorithm, with its logic and compression function. BT-7/DX

UNIT-2

Assignment-4

1. Describe the secure hash algorithm. What are the key requirements of message digests?

BT-7/M-11

2. Describe the various steps in the creation of a digital certificate BT-7/M-11

3. What are digital signature algorithms and show how signing and verification is done using

DSS. BT-7/DX

4. Write a short note on Needham-n Schroeder protocol. BT-7/DX

UNIT-3

Assignment-5

1. Describe the time stamping protocol. What is its significance? BT-7/M-11

2. What is a virus life cycle? Describe the various types of computer viruses? What are the mean

through which it can spread and possible prevention mechanism that can be employed?

BT-7/M-11

3. Suggest any three password selection strategies and identify their advantage and disadvantages

if any. BT-7/DX

4. Describe how pretty good privacy(PGP) provides confidentiality and authentication service

for email applications. BT-7/DX

UNIT-3

Assignment-6

1. What is password based encryption? What are the problems associated with it? BT-7/M-11

2. Describe the KERBEROS protocol and it’s working. BT-7/M-11

3. (a) List and brief various generation of anti-virus software’s BT-7/DX

(b) Discuss XML security concepts.

4. How is privacy related to statistical database security? What measures can be taken to ensure

some degree of privacy in statistical databases. BT-7/DX

UNIT-4

Assignment-7

1. What are the characteristics of a good firewall implementation? BT-7/M-11

2. What is a VPN? Explain briefly about the VPN architecture. How it provides security to the

network? BT-7/M-11

3. What kind of attacks is possible on packet filtering firewalls? Suggest appropriate counter

measures. BT-7/DX

4. Explain any two approaches for intrusion detection. BT-7/DX

UNIT-4

Assignment-8

1. Write short notes on: BT-7/M-11

a) One time pad

b) Pretty good privacy

2. Explain in detail computationally secure algorithm BT-7/M-11

3. Describe familiar types of firewall configurations. BT-7/DX

4. Write short notes on: BT-7/DX

(i) Kerbros

(ii) Cryptanalysis

(iii) Computer Virus

Compiler Design (CSE-401)

Unit-1

Assemblers, linkers, loaders, compilers and translators, the structure of a compiler, different

states in the construction of a compiler, Design of lexical analyzer, Basic Parsing Techniques,

Parsers, shift-reduce parsing, operator- precedence parsing, top-down parsing predictive parsers,

L.R. Parsers, the canonical collection of L R (O) items, construction of SLR parsing tables,

construction canonical L.R. Parsing tables, Constructing LALR parsing tables implementation of

L R Parsing tables.

Unit – 2

Syntax-Directed Translation: Syntax-directed translation schemes, implementation of syntax

directed translators, intermediate code, postfix notation, parse trees and syntax trees, three

address code, quadruples, and triples, translation of assignment statements. Boolean expressions,

control statements.

Symbol labels: The contents of a symbol table data structures for symbol tables representing

scope information.

Unit-3

Run Time Storage Administration: Implementation of a simple stack allocation scheme,

implementation of block structured languages, storage allocation in block structured languages.

Error Detection And Recovery: Error, Lexical-phase errors, syntactic-phase errors, semantic

errors.

Unit -4

Code Optimization: The principle sources of optimization, loop optimization, the DAG

representation of basic blocks, value number and algebraic laws, global dataflow analysis. Code

Generation: Object programs, problems in code generation, a machine model, a single code

generator, register allocation and assignment, code generation from DAGs, peephole

optimization.



BOOKS

1. Aho A.V. and Ullaman J.D. Principles of Compiler Design, Addison Wesley

2. Donovan, J, System Programming, TMH

3. D.M. Dhamdhere: Compiler construction- Principles and Practice Mc Milan India

UNIT LECTURE TOPIC

UNIT -

1

L1 Assemblers, linkers, loaders, compilers and translators

L2,3 The structure of a compiler & different states

L4 Design of lexical analyzer

L5 Basic Parsing Techniques

L6 Parsers, shift-reduce parsing

L7 operator- precedence parsing

L8 top-down parsing predictive parsers

L9 L.R. Parsers, the canonical collection of L R items

L10 Construction of L R, canonical parsing table

L11 Implementation of L R parsing table

UNIT -

2

L12,13 Syntax-directed translation schemes & impl.

L14 Intermediate code, postfix notation

L15 Parse trees and syntax trees,

L16 Three address code, quadruples, and triples

L17 Assignment statmts,boolean expsn, control statmts.

L18,19 Data structures for symbol tables scope information

Unit - 3

L20 Implementation of stack allocation scheme

L21,22,23 Impl. of block structured lang& storage allocation

L24 Lexical-phase errors

L25 Syntactic-phase errors

L26 Semantic errors

Unit-4

L27 Principle sources of optimization

L28 Loop optimization

L29 DAG representation

L30 Value number and algebraic laws

L31 Global dataflow analysis

L32 Object programs, problems in code generation

L33 A single code generator

L34 Register allocation and assignment

L35 Peephole optimization

Compiler Design (CSE-401)

UNIT-1

ASSIGNMENT-1

1. Explain the different states of compiler construction. BT-7/D11

2. What is a lexical analyzer? Discuss the design and construction technique of lexical

analyzer. BT-7/D11

3. Explain in detail shift-reduce parsing with the help of an example. BT-7/D11

4. Explain the term LR Parsers. BT-7/D11

5. Explain the construction of SLR parsing table BT-7/D11

6. Explain different types of parsers. BT-7/D11

ASSIGNMENT-2

1. Explain top-down parsing. Give example. BT-7/M11

2. Write short note on construction of LR parsing table. BT-7/D11

3. Explain in detail operator-precedence parsing with the help of an example. BT-7/D11

4. Write short note on compiler and translator. BT-7/M11

5. What do you mean by assembler, linker and loader? BT-7/M11

6. Explain in detail basic parsing techniques. BT-7/M11

UNIT-2

ASSIGNMENT-1

1. Explain:- a) Quadruples b) Three address code BT-7/D11

2. How postfix notation is useful in the compiler operations. Explain with the help of

proper example. BT-7/D11

3. Explain:- a) Syntax trees b) Parse trees BT-7/D11

4. What is syntax directed translation schemes? BT-7/D08

5. Explain Boolean expressions in brief. BT-7/D11

6. Explain the content of symbol table and its scope. BT-7/D11

ASSIGNMENT-2

1. Explain the translation of assignment statements. BT-7/D11

2. What do you understand by intermediate code? How it helps in machine independent or

platform independent code. BT-7/D11

3. Distinguish between parse tree and syntax tree. BT-7/D11

4. Explain the reusability concept of symbol table space. BT-7/M11

UNIT-3

ASSIGNMENT-1

1. Explain syntactic phase errors. BT-7/D11

2. What are block structured languages. How these are implemented. BT-7/D11

3. Semantic errors are more difficult to find as compared to syntax errors. Why? What are

the various techniques to find out semantic errors? BT-7/D11

4. Explain semantic errors in brief. BT-7/D11

5. What do you mean by storage allocation in block structured languages? BT-7/D11

6. Explain the implementation of simple stack allocation scheme. BT-7/D11

UNIT-4

ASSIGNMENT-1

1. Explain Global data flow analysis. BT-7/D11

2. Explain Peephole optimization. BT-7/D11

3. How code is generated in object oriented languages. What are the problems in code

generation? BT-7/D11

4. What is DAG representation? Illustrate with a suitable example. BT-7/M11

5. Explain code optimization. BT-7/M11

6. What do you mean by lop optimization. BT-7/M11

ASSIGNMENT-2

1 Explain problems in code generation. BT-7/M11

2 Explain register allocation and assignment in code generation. BT-7/M11

3 Explain code generation from DAGs. BT-7/M11

4 Explain principle sources of optimization. BT-D/M11

5 What do you mean by object program in code generation? BT-7/M11

6 Explain DAG representation of algebraic laws. BT-7/M11

Web Engineering (CSE-403)

Unit-1

Information Architecture: The role of Information Architect, Collaboration and

communication, Organizing information, organizational challenges, Organizing web sites and

Intranets, Creating cohesive organization systems, designing navigation systems, types of

navigation systems, Integrated navigation elements, designing elegant navigation systems,

Searching systems, Searching your web site, designing the search interface, Indexing the right

stuff, To search or not to search grouping content, conceptual design, High level Architecture

Blueprint. Architectural Page Mockups, Design Sketches.

Unit-2

Dynamic HTML and Web Designing: HTML Basic concepts, Good web design, process of

web publishing phases of web site development, STRUCTURE OF HTML documents, HTML

elements- Core attributes, Language attributes, Core events, Block level events, Text level

events, Linking basics, Linking in HTML, Images and Anchors, Anchor Attributes, Image maps,

Semantic linking meta information, image preliminaries, Image download issues, Images and

buttons, introduction to layout: Backgrounds, color and text, fonts, layout with tables. Advanced

layout: Frames and layers, HTML and other media types. Audio support in browsers, video

support, other binary formats. Style sheets, positioning with style sheets. Basic Interactivity and

HTML: FORMS, form control, new and emerging form elements.

Unit -3

CGI Using PERL: Introduction to CGI, Alternative technologies, The Hypertext Transport

protocol, URLs, HTTP, Browser requests, Server Responses, Proxies, Content Negotiation, The

common Gateway Interface, The CGI Environment, Environment variables, CGI Output, forms

and CGI, Sending Data to the server, form Tags, Decoding from input, Architectural Guidelines,

Coding Guidelines, Efficiency and optimization.

Unit -4

Java Server Pages: Basics, Integrating Scripts in JSPs, JSP Objects and Components,

configuring and troubleshooting, JSP: request and response objects, retrieving the contents of an

HTML format, retrieving a query string, Working with Beans, Cookies, creating and Reading

Cookies. Using Application Objects and Events.

XML: Relationship between HTML, SGML and XML, Basic XML, Valid documents, ways to

use XML, XML for data files, embedding XML into HTML HTML for Display, Displaying

XML using CSS and XSL, rewriting HTML as XML, the future of XML.



BOOKS 1. Thomas A Powell, HTML The Complete Reference, Tata McGraw Hill Publications.

2. SCSEt Guelich, Shishir Gundavaram, Gunther Birzneik; CGI Programming with PERL

2/e, O’ Reilly.

3. Doug Tidwell, James Snell, Pavel Kulchenko; Programming web services with SOAP, O’

Reilly

4. Pardi, XML in Action, Web Technology, PHI

5. Yong, XML step by step, PHI

6. Aaron, Weiss, Rebecca Taply, Kim Daniels, Stuven Mulder, Jeff Kaneshki, Web

Authoring Desk reference, Techmedia publications

UNIT LECTURE TOPIC

Unit-1

L1 The role of Information Architect

L1

Collaboration and communication

communication,

communication,

L2, L3 Organizing information

L4 organizational challenges

L5 Organizing web sites & Intranets

L6 Creating cohesive organization systems

L7,L8

types of navigation systems

navigation systems

L9 Integrated navigation elements

L9 designing elegant navigation systems

L10 Searching your web site

L10 designing the search interface

L11 Architectural Page Mockups

L11 Design Sketches

Unit -2

L12 HTML Basic concepts

L13 Good web design

L13 STRUCTURE OF HTML documents

L13

HTML elements- Core attributes

elements- Core attributes

elements- Core attributes

L14 Block level events

L14

Text level events

events

L15 Linking basics

L16 Linking in HTML

L17 Images and Anchors

L17 Anchor Attributes

L18 Image maps

L19

Images and buttons

buttons

L20 introduction to layout

L20 Advanced layout

L21 Style sheets

L22 Basic Interactivity and HTML

Unit - 3

L23 Introduction to CGI

L24 Alternative technologies

L24

The Hypertext Transport protocol

protocol

L24 URLs, HTTP, Browser requests

L25 Server Responses, Proxies, Content Negotiation

L26 The CGI Environment

L27 CGI Output

L28 Sending Data to the server

L29 Efficiency and optimization

Unit - 4

L30 Integrating Scripts in JSPs

L30 JSP Objects and Components

L31 JSP: request and response objects

L32 retrieving the contents of an HTML format

L32 retrieving a query string

L32 Working with Beans

L33 Cookies

L34 Relationship between HTML, SGML and XML

L35 Basic XML

L35 Valid documents

L35 ways to use XML

L35 XML for data files

L36 embedding XML into HTML documents

L37 Converting XML to HTML for Display

L37 Displaying XML using CSS and XSL

L38 rewriting HTML as XML

L39 future of XML

Web Engineering (CSE-403)

Unit – 1

Assignment Sheet – 1

Q1. What do you understand by search engine? What are the different components of a search

engine? Explain. BT-7/D11

Q2. What are meta tags? How does meta tag help search engines in cataloging the information?

Explain. BT-7/D11

Q3. What do you mean by web site navigation systems? Where should it occur on a web page

and why? What are the different types of navigation systems? Write a detailed note.

BT-7/D11

Q4. What are different web information searching techniques? Explain them. BT-7/M-11

Q5. What do you understand by about Host level architecture Blueprint? BT-7/M-11

Q6. Difference between Web engineering and software engineering. BT-7/M-11


Q1. What is the procedure of Hosting the website on the intranet? Explain.. BT-7/M-11

Q2. What do you understand about automatic web navigation systems. BT-7/M-11

Q3. Explain different types of navigation systems. BT-7/DX

Q4. What is WWW and explain how the web works? BT-7/DX

Q5. What is the procedure to setup the intranet in your college campus? Explain. BT-7/DX

Q6.Do you use max hits option when searching? BT-7/DX

Unit – 2


Q1. What are purpose and syntax of following HTML tags? Explain with examples:

i. Anchor Tag.

ii. Unordered Tag

iii. Semantic tag

iv. Image

v. Form tag BT-7/DX

Q2. What are differences between Transitional HTML and Non-transitional HTML document

types? BT-7/DX

Q3. What are different techniques to embedding CSS into HTML pages? Explain with examples.

BT-7/DX

Q4. What are important guidelines for creating a good website? BT-7/DX

Q5. What do you understand by image map? What is the use of it? Explain. BT-7/D11


Q1. Explain the procedure of creating a rectangular and circular hotspot in an image map using

suitable examples. BT-7/D11

Q2. How would you create a table and editing in it? BT-7/D11

Q3. What are important guidelines for creating a good website? BT-7/DX

Q4. Write a program using Colspan & Rowspan attributes in Table Tag in HTML. BT-7/M-11

Q5.What are different techniques to embedding CSS into HTML pages? Explain. BT-7/DX

Unit – 3


Q1. Explain CGI and steps to establish CGI environment over a Non-CGI compatible server.

BT-7/DX

Q2. Why ASP and JSP technology are better than CGI technology? BT-7/DX

Q3. How the forms are processed in PERL using CGI? BT-7/DX

Q4. What is the need of server side scripting on the web? BT-7/DX

Q5. Differentiate between Client side scripting and server side scripting. BT-7/DX


Q1. What is the role of URL, HTML and HTTP to send the multimedia pages over the web?

BT-7/M-11

Q2. What are drawbacks of CGI with respect to respect to latest server side technology?

BT-7/M-11

Q3. Why ASP and JSP technology are better than CGI technology? BT-7/M-11

Q4. How the forms are processed in PERL using CGI? BT-7/M-11

Q5. Explain CGI and steps to establish CGI environment over a Non-CGI compatible server.

BT-7/DX

Unit – 4


Q1. Explain with examples how to embed the scripts in JAVA. BT-7/M-11

Q2. Difference between HTML, DHTML and XML. BT-7/M-11

Q3. What are the different features of XML and how to display XML using CSS? BT-7/M-11

Q4. Compare ASP and JSP server side technology. BT-7/M-11

Q5. Compare CGI, ASP and JSP side technology. BT-7/DX


Q1. Define cookies and Hidden fields. BT-7/DX

Q2. Explain in detail the life cycle of JSP. BT-7/DX

Q3. What is XML and explain with example to embed XML into HTML documents?BT-7/DX

Q4. What is XSL? What are the steps to transform XML into HTML using XSL? Explain.

BT-7/D11

Q5. How is XSL different from CSS? Discuss. BT-7/DX

Statistical Models for Computer Science(CSE-405)

Unit-1

Probability Models, Sample Space, Events, their algebra, graphical methods of representing

events, Probability Axioms and their applications, Condition probability, Independence of

Events, Bayes' Rule and Bernoulli Trials.

Unit-2

Random variables, and their event spaces, Probability mass function, Distribution functions,

some discrete distributions (Bernoulli, Binomial, Geometric, Negative Binomial, poisson, Hyper

geometric and Uniform), Probability Generating Function, Discrete random vectors, Continuous

random variables: some continuous distributions (Exponential, HyperexponentiaI, Erlang,

Gamma, Normal), Functions of random variables, joint1y distributed random variables.

Expectation, Expectation of functions of more than one random variable, Brief introduction to

Conditional pmf: pdf and expectation, Moments and transforms of some distributions (Uniform,

Bernoulli, Binomial, Geometric, Poisson. Exponential, Gamma, Normal), Computation of mean

time to failure.

Unit-3

Stochastic Processes, Classification of stochastic processes, the Bernoulli process, The Poisson

process, renewal process, renewal model of program behavior.

Unit-4

Markov Chains, Computation of n-step transition probabilities, State classification and limiting

distributions, Distribution of times between state changes, Irreducible finite chains with

aperiodic states, M/G/l queuing system, Discrete parameter Birth-Death processes, Analysis of

program execution time. Continuous parameter Markov Chains, Birth-Death process with special

cases, Non-Birth-Death Processes.



BOOKS

1. K.S. Trivedi, Probability, Statistics with Reliability, Queuing and Computer Science

Applications, PHI, 2001.

2. J.F. Hayes, Modeling of Computer Communication Networks, Khanna Publishing, Delhi.

3. W. Feller, An Introduction to Probability Theory and its applications. 2vo1s. Wiley

Eastern, 1975.

4. L. Kleinroek, Queuing Systems, 2 vols, John Wiley, 1976.

Unit Lecture Topic

UNIT-

1

L-1 Probability Models, Sample ,

L-2 Space,Events, their algebra

L-3 graphical methods of representingevents,

L-4 Probability Axioms and their applications,

L-5 Condition probability L-6 Independence ofEvents

L-7 Bayes' Rule and Bernoulli Trials.

UNIT-

2

L-8 Random variables, and their event spaces

L-9 Probability mass function, Distribution functions

L-10 some discrete distributions

L-11 Probability Generating Function

L-12 Discrete random vectors, Continuous

L-13 Discrete random vectors, Continuousrandom variables

L-14 Functions of random variables

L-15 joint1y distributed random variables.Expectation

L-16 Expectation of functions of more than one random variable

L-17 Brief introduction to Conditional pmf: pdf and expectation,

L-18 Moments and transforms of some distributions

L-19 Computation of meantime to failure.

UNIT

3

L-20 Stochastic Processes

L-21 Classification of stochastic processes,

L-22 the Bernoulli process

L-23 The Poisson process

L-24 renewal process

L-25 renewal model of program behavior.

UNIT-

4

L-26 Markov Chains L-27 Computation of n-step transition probabilities L-28 State classification and limiting distributions

L-29 distributions, Distribution of times between state changes

L-30 Irreducible finite chains with aperiodic states

L-31 M/G/l queuing system, Discrete parameter Birth-Death processes

L-32 Analysis ofprogram execution time

L-33 Continuous parameter Markov Chains

L-34 Birth-Death process with specialcases

L-35 Non-Birth-Death Processes.

Statistical Models for Computer Science(CSE-405)

UNIT 1

Assignment 1

Q1: An experiment consistes of rolling a die until a 6 is obtained.

i) Find the sample space S, If we are interested in all the possibilities.

ii) Find the sample space S, If we are interested in the number of throws needed to get a

6. [BT-7/D11]

Q2: Let A and B be the arbitrary events. Show that A C B, if and only if A∩B = A.

[BT-7/D11]

Q3: Let P(A) = 0.9 and P(B) = 0.8. Show that P(A∩B) >=0.7 [BT-7/D11]

Q4: Given that P(A) = 0.9, P(B) = 0.8 and P(A∩B) =0.75, find P(AUB) [BT-7/D11]

Q5: Suppose that a laboratory test to detect a certain disease has the following statistics. Let

A= event that the tested person has the disease

B= event that the test result is positive

It is known that P(B/A) = 0.99 and P(B/ ¯A) = 0.005 and 0.1 percent of the population actually

has the disease. What is the probability that a person has the disease given that the result is

positive? [BT-7/D11]

Q6: Describe the sample space for each of the following events:

i) Three tosses of a coin

ii) Number of smokers in a group of 500 persons

iii) Tossing of a coin until a tail appears

iv) The number of incoming telephone calls to a telephone booth

v) Tossing of a coin and a die together

[BT-7/M-11]

Assignment 2

Q1: Consider a pool of 6 I/O buffers. Assume that each buffer is just as likely to be available or

occupied as any other buffer. Compute the probability associated with the following events:

A= At least two but no more than 5 buffers occupied.

B= At least three but no more than 5 buffers occupied.

C = All buffers available or even number of buffers [BT-7/M-11]

Q2: If P(AUB) = 5/6, P(A∩B) = 1/3 and P(-A) = ½, find P(A) and P(B). Also show that A and B

are independent. [BT-7/M-11]

Q3: Explain the Baye’s theorem. [BT-7/DX]

Q4: Give the axiomatic definition of Probability and show that if

A C B, then P(A) <= P(B) [BT-7/DX]

Q5: A student wants to break into a computer file, which is password protected. Assume that

there are n equally possible passwords and that the student chooses the passwords independently

and at random and tries them. Let Nn be the number of trials required for breaking the password.

Find the probability function of Nn.

i) If unsuccessful passwords are not eliminated from further selections

ii) If they are eliminated.

[BT-7/DX]

Q6: If the events A and B are such that P(A)!= 0 and A is independent of B then show that B is

also independent of A. [BT-7/DX]

UNIT 2

Assignment 1

Q1: For joint probability density function

F(x,y) = { 21x2y/4, if x2 <= y < 1

{ 0 , otherwise

i) Find marginal pdfs of x and y

ii) Are x and y independent

[BT-7/DX]

Q2: A random variable x may assume four values with probabilities:

(1+3x)/4 , (1-x)/4 , (1+2x)/4 and (1-4x)/4, for what values of x, is this a probability function?

[BT-7/DX]

Q3: The radius of a sphere, say x is assured to be continuous variable with pdf,

F(x) = { 6x(1-x) , 0<x<1

{ 0 , otherwise

Find the pdf of the volume V of the sphere. [BT-7/DX]

Q4: Explain Geometric distribution. Derive variance and expectation of Geometric distribution.

[BT-7/DX]

Q5: Define Markov property and prove it.

Assignment 2

Q1: Let the r.v. X denote the number of defective components in a random sample of n

components, chosen without replacement from a total of N Components, r of which are

defective. The r.v. X is known as the hypergeometric r.v. with parameters (N,r,n).

i) Find the pmf of X

ii) Find the mean and variance of X.

[BT-7/D11]

Q2: Suppose that X and Y are independent standard normal r.v.’s. Find the pdf of Z = X+Y.

` [BT-7/D11]

Q3: Consider the discrete r.v. X that has the pmf

px(xk) = (1/2)xk xk = 1,2,3………..

Let A = {£ : X (£) = 1,3,5,7…………}. Find P(A) [BT-7/D11]

Q4: If X is N(µ; σ2), then show that Z = (X-µ)/σ is a standard normal r.v. ; that is, N(0,1).

[BT-7/D11]

Q5: Explain and prove inverse of Markov property.

UNIT 3

Assignment 1

Q1: Consider the random process X(t)

X(t) = Ycos ώt t>=0

Where ώ is a constant and Y is a uniform r.v. over (0,1)

i) Find E[X(t)].

ii) Find the autocorrelation function R, (t,s) of X(t)

iii) Find the autocovariance function Kx(t,s) of X(t)

[BT-7/D11]

Q2: Show that if a normal process is WSS, then it is also strict sense stationary. [BT-7/D11]

Q3: If X is uniform in the interval (10,12) and Y = X3. Find E(y) and fY(y) [BT-7/D11]

Q4: For the random process x(t) = ACos (ώ0t) where A is a Guassian random variable with mean

mA and variance σ2, determine whether or not the random process is

i) Wide sense stationary

ii) Mean ergdic

[BT-7/D11]

Assignment 2

Q1: Assuming that the number of arrivals in the interval (0,t] is poisson distributed with the

parameters λt, compute the probability of an even number of arrivals. Also compute the

probability of odd number of arrivals. [BT-7/DX]

Q2: Explain Renewal Process. Give an example of renewal process and explain it. [BT-7/DX]

Q3: What do you mean by Stochastic process. Explain classification of stochastic processes.

[BT-7/DX]

Q4: Compute the average working set size and average page fault rate in renewal model of

program behavior. [BT-7/DX]

UNIT 4

Assignment 1

Q1: A group of telephone subscribers is observed continuously during a 80-minute busy hour

period. During this time, they make 30 calls, with the total conversation time being 4200

seconds. Compute the arrival rate and the traffic intensity. [BT-7/DX]

Q2: Assume that a computer system is in one of three states- busy, idle or undergoing repair,

respectively denoted by states 0, 1, 2. Observing its states at 2 P.M. each day, we believe that the

system approximately behaves like a homogeneous Markov chain with the transition matrix

P= [0.6 0.2 0.2]

[0.1 0.8 0.1]

[0.6 0.0 0.4]

Prove that the chain is irreducible, and determine the steady-state probabilities. [BT-7/DX]

Q3: What are the differences between Transitional HTML and Non-Transitional HTML

document types? [BT-7/DX]

Q4: What are four different techniques to embedding CSS in HTML pages? Explain with

examples. [BT-7/DX]

Assignment 2

Q1: Customers arrive at a watch repair shop according to a Poisson process at a rate of one per

every 10 minutes, and the services time is an exponential r.v. with mean 8 minutes.

i) Find the average number of customers L, the average time a customer spends in the

shop W, and the average time a customer spends in waiting for service Wq.

ii) Suppose that the arrival rate of the customers increases 10 percent. Find the

corresponding changes in L. W. and Wq.

[BT-7/D11]

Q2: Discuss M/M/m queuing system in detail and find the probability of queuing.

[BT-7/D11]

Q3: A drive-in banking is modeled as an M/M/1 queuing system with customer arrival rate of 2

per minute. It is desired to have fewer than 5 customers line up 99 percent of the time. How fast

should the service rate be? [BT-7/D11]

Q4: Find the average number of customer L in the M/M/1/K queuing system when λ=µ.

[BT-7/D11]

UNIX & Linux Programming (Pr) (CSE-407)

1. Familiarize with Unix/Linux logging/logout and simple commands.

2. Familiarize with vi editor.

3. Using Bash shell develop simple shell programs eg.

o Write a program to perform the basic arithmetic operation.

o Write a program to calculate the factorial of a number.

o Write a program to find greatest of three numbers.

o Write a program to perform the basic calculator operations.

o Write a program to find a number whether even or odd.

4. Develop advanced shell programs using grep, fgrep & egrep.

5. Compile and debug various C programs using different options.

6. Learning of installation and upgradation of Linux operating system.

7. Install, Linux on a PC having some other previously installed operating system. All OS should

be usable.

8. As supervisor create and maintain user accounts, learn package installation, taking backups,

creation of scripts for file and user management, creation of startup and shutdown scripts

using at, cron etc.

Web Engineering (Pr) (CSE-409)

1. Create page to demonstrate various basic html tags.

2. Create a HTML page to demonstrate various lists.

3. Create a HTML page to demonstrate tables.

4. Create a GUI using forms.

5. Chalk out the storyboard and design of Diary Food Limited. As the name reflects your site

dairy products and aims at opening an online store. Your storyboard should cover all the features

that you plan to have on the site.

6. Create your own page with your favorite hobbies.

7. Create a Menu or a table of content web page. Each menu item or section of the table of

content should load a different web page.

8. Create a frameset that is divided into three sections. The frameset should have three zones.

• The Topmost section of the frameset should take up about just 15% of the browser

window.

• The middle section should be 70% of the browser window.

• The lower section should be 15% of the browser window.

9. Use Style sheet to modify the following:

• Change background to modify the following.

• Change font type, face and color.

• Align Text.

• Remove underlines from hyperlinks.

10. Create a web site for your college.

Seminar (CSE-413)

Each student shall individually prepare and submit a seminar report on a topic of current

relevance on stipulated time. A panel consisting of two teachers (internal) should evaluate the

seminar report and the presentation. Marks should be distributed considering report writing,

presentation, technical content, depth of knowledge, brevity and references and their

participation in seminar. The time allotted for presentation is 30 minutes.

Training viva( CSE-415)

The students are required to undergo 6 to 8 weeks training in company/ organization of high

repute. The students must obtain prior approval of the Principal before going for his/ her training.

On completion each students will be required to submit training report not exceeding 60 to 70

pages which shall be evaluated in the seventh Semester. Training Report must be submitted 15

days before the start of the 7th Semester Examination.

department of computer science & … · ... kdc protocols, shared secret key, diffle-hellman...

Documents