Code No.

: 64041N

FACULTY OF ENGINEERING

D.E. IVIIV (CSE) I SEMESTER (New) (Main) Examination, NovJ{)ec., 2009 IMAGE PROCESSING (ELECTIVE - I)

Time: 3 Hours]

[ Max. Marks : 75

PART - A (25 Marks)

1. . Explain about "Electromagnetic Spectrum". (3)

2~:c;What is "Aliasing" ? (2)

-. 3.. EXPiain the terms: (i) . Radiance (ii) Luminance (iii) Brightness (3)

4::,< .~~th~ block diagrarnfor filtering i~Frequency Domain. ' .. ' . (3)

>i';5~~~ii}/eXplain about One-dimensionsl Fou~rier Transform (I-OFT) and its

'..~:: inverse. (3)

: ,6.~.;~;~qllustrate the "Image Subtraction". (2)

7. Write a short note on 'White Noise". (2)

8. What is the need of "compression" in Image Processing ? (2)

9. What is meant by "Interpixel redundancy" ? (3)

10. Explain the "periodic nose" in image. (2)

Note:

11. (a)
(b)
1~. (a)
(b)
13. (a)
(b)
14. (a)
(b)
15. (a)
(b)
16. (a)
(b)
17. (a)
(til Answer all questions from Part - A. Answer any five questions from Part- B.

PART - B (50 Marks)

Explain the basic relationships between pixels in images. . (5)

Illustrate the "Representation of Digital Images" in Image Processing. (5)

Discuss in detail about any two smoothing filters in :-'''.::juellcy

Domain. (5)

Write any five properties of 2-DFT. (5)

Describe the image segmentation by "Adaptive thresholding"

method. (4)

PlC!"lain in detail about region splitting and merging. (6)

How the Huffman coding is used in Image compression ? (7)

Distinguish Lossy compression and Error Free Compression. (3)

Illustrate the Image Degradation and Restoration Process. (4)

Discuss any three types of Noses. (6)

Explain about Image Averaging. (3)

Describe the different types of filters used to reduce the periodic

noise. (7)

Exp.lainabout Minimum Mean'Square "Error (Wiener) Filtering. (5)

Describe the Zooming and Shrinking in Digital Images. (5)'

(fhis paper contains I page) 500

14. Explain in detail about DES and triple DES algorithms.

Code No. : 6402IN (10 M)

15. (a) Explain chosen plain text attack and a known-plain text attack. (4 M)

(b) How many exclusiVe '.,0;.. or operations are used in DES cipher? Why

does DES function need an expansion permutation? (6 M)

16. Explain about MD-5 in detail.

(10 M)

17. (a) What is a digital signature?

(b) Explain a blind digital signature scheme.

(5 M) (5 M)

600

,.!,', ,

f" (/~ '.

'~""''''''''''i.·"""q,.~';:'':''''·FACULTY OF ENGINEERING I SEMESTER (New) (Main) Examination, NovJDec., 2009

ARTIFICIAL INTELLIGENCE

PART-B

(50Uarks)

o

,

j·4?'·'eXPB.nrecursive and forWard search pIanIling using STRIPS methods.

, ,,". " _- •• _. -.- - .' > - • - ~ ,

Code No. : 6402IN

FACULTY OF ENGINEERING

fSEMEsTER (New) (Main) Examination, NovJDec., 2009 ~A.'-n~'TION SECURITY (ELECTIVE - I)

a' cryptographic hash function and an iterated cryptographic. "

'. (3, M)

services provided by SSL.

(2 M)

(2M)

between passive and active security attacks with (3 M)

is Data Confidentiality ?

(2M)

is Traffic analysis? State with an example.

(3M)

pART-B

[50 Marks]

the need for security and write about security investigation (10 M)

(6M) (4M)

(6 M) (4 M)

" P.T.O.

Code Noo 6398/ N

FACULTY OF ENGINEERING

B.E. 4/4 (CSE) I-Semester (New) (Main) Examination, November/December, 2009

Subject : DISTRIBUTED SYSTEMS

Time : 3 Hours )

[ Max. Marks : 75

Note:

AJ.'ll),lVer all questions from Part - A. Answer any five questions from Part - B.

•

PART- A

;~, ',,: :·".:;,;;(~:-·.:,,_~.,r·,:, .. u ,~:;fli.~~:;·',:;--,::,·:

1. State 3..charaeteristics of a distributed system.

2

2. Write a note on multi computers.

2

3. What are middle ware services? Explain.

3

4.

What is a 3-tired client server architecture?

3

5.

Discuss DNS.

3

6. Write a note on reference counting.

2

7. Describe two-phase commit in distributed model.

3

8. Write about security in Sun Network File System.

2

9. Discuss pull verses push protocols in update propagation.

2

- _

__ ------. _-

~ note~ on reliable multicasting in group communication.

3

Contd ... 2

100174

2 PART - B

('od~· No. 61YKj N (SO M.uks)

II. Explain the steps in RPC.

10

12. (a) (b)

What is a name space? Discuss its Implementation.

'." ;' .,' ," -., ._, -', - ,_,

4

Discuss the implementation of Name Resolution.

6

13.

(a) Discuss Election Algorithms to select a co-ordinator.

(b) Explain how,writ~ah~d.A~gi!iLd~~8~'t~4:¥~~~~Ctiof\scan be used to recover

ITo:f~:::;.·c~,~~;lt~~~!?~lW0~~· ..• ~ .. ~..... .

14., ",' : (a)S')Write,~~ geilera1()rga~~~~;?f"~},,,~~ ,.~~;!ing dismbuted transactions.

(b) . Does using time stamping f6r cO'i';:cU~eri~y control ensure serializabilily? Discuss.

6 4

•

4 6

'. 15. (a)
~ (b)
16. (a)
(b) Explain Release consistency.

4 6

Discuss primary based protocols used to maintain conSistency,

Which kind of cache coherence protocol does NFS implement? Explain. Explain the NFS architecture for UNIX systems.

5 5

I 7. Write short notes on :

(a) Quorum based protocols

(b) Fault Tolerant Distributed Systems (c) Digital Signatures

(d) LDAP

10

-000-

Code No. 6400jN

FACULTY OF ENGINEERING

B.E. 4/4 (CSE) I-Semester (New) \Main) Examination, November/December, 2009

Subject COMPILER CONSTRUCTION

Time : 3 Hours 1

[ Max. Marks 75

Note:

Answer all questions from Part - A. Answer any five questions from Part - B.

PART-A

(25 Marks)

•

1.

Compilers are often written in the language they are implemented. Identify advantages and disadvantages of this technique.

2. What is the left recursion? Explain with an example.

3. What is the role of parser in compiler?

4. Explain synthesized attribute and inherited attribute with an example.

5. What is the difference between syntax tree and DAG? Explain with example.

6. Write and explain "Heap Allocation",

, 7. Show that following grammar :

S ~ Aa Ab/BbBa B ~ E (Epsilon) B ~ E (Epsilon)

is LL (1) but not SLR (1).

8. Write and explain basic blocks and flow graphs.

9. What is linking?

'f

10. What is loader?

Con~ 100954

,.

2

Code No. 6400jN (50 Marks)

PART - B

11. Write subset construction algorithm and algorithm for computation of E - closure.

Explain how these algorithms are useful in lexical analysis phase and parsing phase.

12. Construct LR (0), SLR (1), LR (1) and LALR (1) automata for the grammar S ~ xSxjx.

13. (a) Write and explain LL(I) parsing algorithm.

(b) A ~ BCD

B ~ bBI E (Epsilon) C ~ Cg/g/ch/i

D ~ AB/ E (Epsilon)' " . <:'i~~i i:u.t;Jt!\t~~ .'

, t ~ ~ ~ ~ f..... ;. '). ; , ...

Calculate FIRST and FOLLOW sets for the above'grammar;

•

14. Explain the issues in the design of code generation.

15. (a) (b)

What is syntax tree? Construct syntax tree for a - u + c.

Translate the arithmetic expression a*(b + c) into post fix notation and three address-code.

16. Explain the working principle of dynamic linking loader with the help of diagram.

17. Write short notes on allY tuio :

(a) Show that no LL(1) grammar can be ambiguous. (b) Absolute loader.

(c) Relocation.

-000-

Code- No. : 6-101 IN

FACUL TV OF ENGINEERING

B.E. Ivnv (CSE) I SEMESTER ew) (l\lain) Examination, NovJDec. 2009 PRINCIPLES & APPLICATIONS OF El\ffiEDDED SYSTEl\1S

Time : 3 Hours]

Note:

I Max.. Marks: 75

Answer an questions from Part - A, Answer any flv,e questions from Part- B ..

PART-A

(25 Marks)

1. Briefly explain sample requirement form.

(2)

2. Explain the importance of bit addressable memory in embedded system.. (2)

3. Calculate t'heexecutiori time of single cycle instruction tor 6 mHz crystaL (2)

(3) (2) (3) (2) (3) (3) (3)

4. Write about signed and unsigned arithmetic.

5. Differentiate bet ......... een bit jump and byte jump.

6. Wilat is key bouncing? How do you avoid it ?

7. Discuss briefly the task states.

8. Discuss the methods of saving memory in embedded systems ..

9. Differentiate between Von Neumann and Harvard architecture.

10. Exp.lain basic ARM programming model.

11- (a)
(b)
12. (a)
(b)
13. (a)
(b) PART- B

(5 x 10 = 50 Marks)

Explain about Data Address Generator (DAG) registers In SHARe

proces-sor. (6)

Explain CAN data f.orm format. (4)

Explain how cross-compiler translates the high leve I language to

machine language using segmentation concept (6)

Explain underground tank monitoring embedded system. (4)

Discuss shared data problems and methods to protect. them. (6)

Describe the control registers of intelligent LCD display. (4)

(Tllis paper contains 1. pages)

I

P.T.O.

Code 0.: 640lIN

14. (a) Explain different addressing modes of 8051. (4)

(b) Write an ALP to swap the nibbles of RO and R1 registers, so that the

lower nibble of RO swaps the high-nibble of R1 and vice-versa. (6)

15. (a) With neat sketch explain B051archlteoture. (6)

(b) Explain the necessity of Unified Modelling Language (UML) in

embedded system. (4)

16. (a) Explain the Hardware and Software architecture for GPS moving

map, (5)

(b) Compare and contrast top-down and bottom-up design approach. (5)

17. Write short notes on: (10)

(a) Memory organization in SHARe processor

(b) 12C bus system

(c) Cross-compilerand Assembler (d) NO and D/A converters

(e) Serial data transmission modes in 8051

.2 1,000