Cs Besem7 QP 2019 December Cbcs

B B 26 4 0D 49 6 96 AD 8C
BC CBC C26C C4F F0D 549 36B B96 AD 18C 67E

0 5 3 A 1 6
CB BC2 26C4 4F0 D54 493 6B9 96A D18 8C6 7E4 4166
C 6C F0 D5 93 6B 6A D1 C6 7E 16 FB
BC 26 4F D 49 6B 96 D 8C 7E 41 6F C
C 5 3 A 1 6 B B
C2 26C 4F0 0D5 493 6B9 96A D18 8C6 67E4 4166 6FB CB C26
6C 4F0 D5 493 6B 6A D1 C6 7E 16 FB CB C2 C4
26 4F D 49 6B 96 D 8C 7 41 6F C C 6C F
C 0 5 3 9 A 1 6 E4 6 B B 2 4 0D
C4 4F0DD54 4936 6B9 6ADD18 8C67 7E4 166 6FB CBC C26 6C4F F0D 549
Q 4.
Q.3.
Q.2.
Q.1.
F0 54 93 B9 6A 18 C6 E4 166 FB CB 26 C4 0D 54 36
4F D5 9 6B 6A D1 C 7E 16 F C C2 C F0 5 93 B
3 B B 4 9
F0 0D54 493 6B9 96A D18 8C6 67E4 4166 6FB CB C26 6C4 4F0DD54 936 6B9 6AD
a)
a)
a)
e)
c)
a)
b)
b)
b)
d)
b)
D5 93 6B 6A D1 C 7E 16 FB CB C2 C F0 5 93 B9 6A 18
75871
D5 493 6B 96A D1 8C 67E 416 6FB CB C2 6C 4F0 D5 493 6B9 6A D18 C6
4 9 8 6 4 6 6 4 D 4 6 6 D 7
54 936 6B96 6ADD18 C67 7E4 166 FBC CBC C26 C4F F0D 549 936B B96 AD 18C C67 E41
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
6B 6A D1 8C 7E 16 6F C C2 6C F0 5 93 B9 6A 1 C6 E 16 FB
96 D 8C 67 41 6F BC BC 6C 4F D5 493 6B 6A D1 8C 7E 416 6F CB
(i)
(i)
AD 18 67 E4 66 B BC 26 4F 0D 49 6B 96 D 8C 67 41 6F BC C
(v)
(ii)
(ii)
(iv)
(iii)
18 C67 E4 166 FBC CBC 26 C4F 0D 549 36B 96 AD 18C 67 E41 66F BC BC 26C
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
7E 16 6FB CB C2 6C F0 5 93 B9 6A 18 C6 E4 16 FB CB 26 C4 0D
41 6F C C 6C 4F D5 493 6B 6A D1 C 7E 16 6FB CB C2 C F0 54
66 BC BC 26 4F 0D 49 6B 96 D 8C 67 41 6F C C 6C 4F D5 93
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B
CB C2 6C4 F0 54 93 B9 6A 18 C6 E4 166 FB CB 26 C4 0D 54 36 96
x(n) = {2,2,3,1}
2x(n)
C2 6C F0 D5 93 6B9 6A D18 C6 7E4 166 FB CB C26 C4 F0D 54 936 B9 AD
x(-n-1)
x (n+2)
6C 4F0 D5 493 6B 6A D1 C6 7E 16 FB CB C2 C4 F0 54 93 B9 6A 18
4F D5 49 6B 96A D1 8C 7E 416 6F C C2 6C F0 D5 93 6B 6A D1 C6
Justify or Contradict
0D 49 36 96 D 8C 67 41 6F BC BC 6C 4F D 49 6B 96A D1 8C 7E
x(n).u(n-2)
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
x(n-1).  (n-3)
N.B. 1) Question No. 1 is compulsory.
y(n) = 4x(n)+ 2
Explain Image segmentation.

Find DTFT of x(n) = {1,2,3,4}
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
3) Figures to the right indicate full marks.
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B Write a note on distance measures.
(3 Hours)
(ii) Find the IDFT of X(k) = {1,0,1,0}

Determine radix 2 DIT-FFT Flow graph for

Write a note on dynamic range compression.
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
(i) Find the 4 point DFT of x(n) = {1,-1,2,-2}

2) Attempt any three out of remaining five questions.
Page 1 of 2
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
x(n) = {1,4,7,8} and y(n) ={2,0,1,3}

Explain energy and power signal with examples.
(i) Find the cross correlation of the causal sequences

C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
Explain any 5 properties of Discrete Fourier Transform
E4166FBCBC26C4F0D54936B96AD18C67
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B
4) Make suitable assumptions wherever necessary and justify them
For x(n) = {1,3,-1,2,0,4}, plot the following discrete time signals
(ii) Determine whether the following system is linear or non linear

54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
Paper / Subject Code: 42151 / Digital Signal & Image Processing
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
7E 16 6FB CB C2 6C F0 5 93 B9 6A 18 C6 E4 16 FB CB 26 C4
[Total Marks: 80]
41 6F C C 6C 4F D5 493 6B 6A D1 C 7E 16 6FB CB C2 C F0
Point processing techniques are called as Zero memory operations

66 BC BC 26 4F 0D 49 6B 96 D 8C 67 41 6F C C 6C 4F
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D
CB C2 6C4 F0 54 93 B9 6A 18 C6 E4 166 FB CB 26 C4 0D
C2 6C F0 D5 93 6B9 6A D18 C6 7E4 166 FB CB C26 C4 F0D 54
6C 4F0 D5 493 6B 6A D1 C6 7E 16 FB CB C2 C4 F0 54
To remove salt and pepper noise median filter is better than low pass filter
4F D5 49 6B 96A D1 8C 7E 416 6F C C2 6C F0 D5 9
0D 49 36 96 D 8C 67 41 6F BC BC 6C 4F D 49
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 3
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36
6B 6A D1 8C 7E 16 6F C C2 6C F0 5 93 B
96 D 8C 67 41 6F BC BC 6C 4F D5 493 6B
4
4
4
4
4
AD 18 67 E4 66 B BC 26 4F 0D 49 6B 9
10
10
10
10
10
10
18 C67 E4 166 FBC CBC 26 C4F 0D 549 36B 96

C6 E4 16 FB B 2 C4 0D 54 36 9
7E 16 6FB CB C2 6C F0 5 93 B9 6A
41 6F C C 6C 4F D5 493 6B 6A
6 B B 2 4 0D 4 6 9 D
B B 26 4 0D 49 6 96 AD 8C
BC CBC C26C C4F F0D 549 36B B96 AD 18C 67E
0 5 3 A 1 6
CB BC2 26C4 4F0 D54 493 6B9 96A D18 8C6 7E4 4166
C 6C F0 D5 93 6B 6A D1 C6 7E 16 FB
BC 26 4F D 49 6B 96 D 8C 7E 41 6F C
C 5 3 A 1 6 B B
C2 26C 4F0 0D5 493 6B9 96A D18 8C6 67E4 4166 6FB CB C26
6C 4F0 D5 493 6B 6A D1 C6 7E 16 FB CB C2 C4
26 4F D 49 6B 96 D 8C 7 41 6F C C 6C F
C 0 5 3 9 A 1 6 E4 6 B B 2 4 0D
C4 4F0DD54 4936 6B9 6ADD18 8C67 7E4 166 6FB CBC C26 6C4F F0D 549
Q 6.
Q 5.
F0 54 93 B9 6A 18 C6 E4 166 FB CB 26 C4 0D 54 36
4F D5 9 6B 6A D1 C 7E 16 F C C2 C F0 5 93 B
3 B B 4 9
F0 0D54 493 6B9 96A D18 8C6 67E4 4166 6FB CB C26 6C4 4F0DD54 936 6B9 6AD
a)
b)
b)
(a)
D5 93 6B 6A D1 C 7E 16 FB CB C2 C F0 5 93 B9 6A 18
75871
D5 493 6B 96A D1 8C 67E 416 6FB CB C2 6C 4F0 D5 493 6B9 6A D18 C6
4 9 8 6 4 6 6 4 D 4 6 6 D 7
54 936 6B96 6ADD18 C67 7E4 166 FBC CBC C26 C4F F0D 549 936B B96 AD 18C C67 E41
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
8
5
7
7
images
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
9
7
8
8
3
7
4
7
5
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B
F=
7
8
5
12
2
4
3
5
0
4 BPP IMAGE
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
7
2
1
15
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
5
10
200
5
4
6
6
7
r1=4, r2= 9, s1= 2, s2 = 13
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
repeating border pixel values.
20
15
200
1
1
2
2
7
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B
10
10
1
6
7
5
1
200
---------------
Write Short note on edge detection in detail
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
Page 2 of 2
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
1
4
3
3
4
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
1
3
2
4
5
E4166FBCBC26C4F0D54936B96AD18C67
original and new histogram and show the new image.
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D 49 6B
5
7
4
3
2
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66
4
7
3
2
0
Paper / Subject Code: 42151 / Digital Signal & Image Processing
C6 E4 16 FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F
7E 16 6FB CB C2 6C F0 5 93 B9 6A 18 C6 E4 16 FB CB 26 C4
0
4
5
5
1
41 6F C C 6C 4F D5 493 6B 6A D1 C 7E 16 6FB CB C2 C F0
66 BC BC 26 4F 0D 49 6B 96 D 8C 67 41 6F C C 6C 4F
FB B 2 C4 0D 54 36 9 AD 18 67 E4 66 B BC 26 4F 0D
CB C2 6C4 F0 54 93 B9 6A 18 C6 E4 166 FB CB 26 C4 0D
C2 6C F0 D5 93 6B9 6A D18 C6 7E4 166 FB CB C26 C4 F0D 54
6C 4F0 D5 493 6B 6A D1 C6 7E 16 FB CB C2 C4 F0 54
Explain Contrast stretching. Perform Contrast stretching on the following 4 bpp
4F D5 49 6B 96A D1 8C 7E 416 6F C C2 6C F0 D5 9
0D 49 36 96 D 8C 67 41 6F BC BC 6C 4F D 49
54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 3
93 B9 A 1 C6 E4 16 FB B 2 C4 0D 54 36
image F. Use appropriate threshold value. Assume virtual rows and Column by
Equalization on the following 3 bpp image. Calculate the new histogram. Plot the
6B 6A D1 8C 7E 16 6F C C2 6C F0 5 93 B
96 D 8C 67 41 6F BC BC 6C 4F D5 493 6B
AD 18 67 E4 66 B BC 26 4F 0D 49 6B 9
What is a Histogram and what is histogram equalization. Perform Histogram 10
10
10
Apply Horizontal and vertical line detection mask on the following 8 bits per pixel 10
18 C67 E4 166 FBC CBC 26 C4F 0D 549 36B 96

C6 E4 16 FB B 2 C4 0D 54 36 9
7E 16 6FB CB C2 6C F0 5 93 B9 6A
41 6F C C 6C 4F D5 493 6B 6A
6 B B 2 4 0D 4 6 9 D
6 A 1 7 4 A D 8 3
16 3A 461 347 74 25A 40D 68 933 844
16 3A4 461 347 742 25A 40D 689 9338 844 262
16 3A4 61 347 742 5A 40D 689 338 44 262 427
3 3 7 4 2 4
63 A46 613 477 425 5A4 0D6 6893 3384 442 624 271 163A
A4 13 47 42 A4 0D 89 38 42 62 27 63 4
3A 61 4 74 5A 0 68 33 44 6 42 16 A 61
46 3 77 25 4 D6 93 84 2 24 71 3A 46 34
46 134 4774 425AA40 0D6 893 384 426 6242 2716 63A 461 1347 774
1 8 3 4 2
61 347 7742 25A 40DD68 933 844 262 2427 7163 3A4 4613 3477 742 5A4
34 74 5A 40 68 93 84 26 42 16 A 61 47 42 5A 0D
13 77 25 4 D6 9 38 42 24 71 3A 46 34 74 5 40 6
47 4 A 0D 8 33 44 62 2 6 4 1 7 2 A D 89
N. B:
Q. 6
47 742 25A 40D 689 933 844 262 427 7163 3A4 613 3477 7425 5A4 40D 689 338
4 8
76013
7 2 4 6 6 3
c)
d)
77 425 5A4 0D6 6893 338 442 624 271 163AA46 134 4774 425AA40 0D6 893 384 4426
b)
b)
b)
b)
b)
Q. 5 a)
Q. 4 a)
Q. 3 a)
Q. 2 a)
Q. 1 a)
42 A4 0D 89 38 44 62 27 63 4 13 77 25 4 D6 89 38 42 24
74 5A 0 68 33 4 26 42 16 A 61 47 42 A 0D 8 33 44 62 27
25 40 D6 93 84 42 24 71 3A 46 34 74 5A 40 68 93 84 26 42 16
A4 D 89 38 42 62 27 63 46 13 77 25 4 D6 93 38 42 24 71 3A
0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442 624 271 63 46
68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44 62 27 63 A4 13
93 84 26 42 16 3A 61 47 74 5A 0D 68 33 44 26 42 16 A4 61 47
38 42 24 71 3A 46 34 74 25 40 6 93 84 26 24 71 3A 61 34 74
44 62 27 63 4 13 77 25 A4 D 89 38 42 24 27 63 46 34 77 25
26 42 16 A 61 47 42 A 0D 68 33 44 62 27 16 A4 13 77 42 A4
24 71 3A 46 34 74 5A 40 68 93 84 26 42 16 3A 61 47 42 5A 0D
27 63 4 13 77 25 4 D6 93 38 42 24 71 3A 46 34 74 5A 40 6
16 A4 61 47 42 A 0D 89 38 44 62 27 63 4 13 77 25 4 D 89
3A 61 34 74 5A 40 68 33 44 26 42 16 A 61 47 42 A 0D 68 33
46 34 774 25A 40 D6 93 84 26 242 716 3A 461 347 74 5A 40D 68 933 844
13 77 25 4 D6 89 38 42 24 71 3A 46 34 74 25 40 6 93 84 26
47 42 A 0D 89 33 44 62 27 63 4 13 77 25 A4 D 89 38 42 24
74 5A 40 68 33 84 26 42 16 A 61 47 42 A 0D 68 33 44 62 27
Write short note on:

25 40 D6 93 84 42 24 71 3A 46 34 74 5A 40 68 93 84 26 42 16
A4 D 89 38 42 62 27 63 46 13 77 25 4 D6 93 38 42 24 71 3A
0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442 624 271 63 46
68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44 62 27 63 A4 13
93 84 26 42 16 3A 61 47 74 5A 0D 68 33 44 26 42 16 A4 61 47
38 42 24 71 3A 46 34 74 25 40 6 93 84 26 24 71 3A 61 34 74
4. Forensic duplication
1. Question No. 1 is Compulsory.
44 62 27 63 4 13 77 25 A4 D 89 38 42 24 27 63 46 34 77 25
26 42 16 A 61 47 42 A 0D 68 33 44 62 27 16 A4 13 77 42 A4
24 71 3A 46 34 74 5A 40 68 93 84 26 42 16 3A 61 47 42 5A 0D
27 63 4 13 77 25 4 D6 93 38 42 24 71 3A 46 34 74 5A 40 6
1. Windows vulnerabilities
16 A4 61 47 42 A 0D 89 38 44 62 27 63 4 13 77 25 4 D 89
2. Operating system security

Explain the cybercrimes in detail.
3A 61 34 74 5A 40 68 33 44 26 42 16 A 61 47 42 A 0D 68 33
46 34 774 25A 40 D6 93 84 26 242 716 3A 461 347 74 5A 40D 68 933 844
Describe session hijacking in detail.

13 77 25 4 D6 89 38 42 24 71 3A 46 34 74 25 40 6 93 84 26
47 42 A 0D 89 33 44 62 27 63 4 13 77 25 A4 D 89 38 42 24
74 5A 40 68 33 84 26 42 16 A 61 47 42 A 0D 68 33 44 62 27
3. Federated Identity Management

Explain access control policies in detail.
25 40 D6 93 84 42 24 71 3A 46 34 74 5A 40 68 93 84 26 42 16
(3 Hours)
2. Solve any THREE from Question No. 2 to 6.
**********
A4 D 89 38 42 62 27 63 46 13 77 25 4 D6 93 38 42 24 71 3A
0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442 624 271 63 46
68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44 62 27 63 A4 13
93 84 26 42 16 3A 61 47 74 5A 0D 68 33 44 26 42 16 A4 61 47
Explain salami attack and linearization attack.

38 42 24 71 3A 46 34 74 25 40 6 93 84 26 24 71 3A 61 34 74
3. Draw neat well labeled diagram wherever necessary
44 62 27 63 4 13 77 25 A4 D 89 38 42 24 27 63 46 34 77 25
Explain bell-La Padula model with neat diagram.

Describe the concepts of covert channel in detail.
26 42 16 A 61 47 42 A 0D 68 33 44 62 27 16 A4 13 77 42 A4
24 71 3A 46 34 74 5A 40 68 93 84 26 42 16 3A 61 47 42 5A 0D
Explain possible attacks on wireless LAN in detail.

27 63 4 13 77 25 4 D6 93 38 42 24 71 3A 46 34 74 5A 40 6
163A4613477425A40D68933844262427
16 A4 61 47 42 A 0D 89 38 44 62 27 63 4 13 77 25 4 D 89
3A 61 34 74 5A 40 68 33 44 26 42 16 A 61 47 42 A 0D 68 33
Describe incident response methodology with diagram.

Describe copyrights and intellectual property in details.
46 34 774 25A 40 D6 93 84 26 242 716 3A 461 347 74 5A 40D 68 933 844
13 77 25 4 D6 89 38 42 24 71 3A 46 34 74 25 40 6 93 84 26
What is phishing and pharming? Explain it with example.
47 42 A 0D 89 33 44 62 27 63 4 13 77 25 A4 D 89 38 42 24
74 5A 40 68 33 84 26 42 16 A 61 47 42 A 0D 68 33 44 62 27
25 40 D6 93 84 42 24 71 3A 46 34 74 5A 40 68 93 84 26 42 16
A4 D 89 38 42 62 27 63 46 13 77 25 4 D6 93 38 42 24 71 3A
0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442 624 271 63 46
68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44 62 27 63 A4 13
93 84 26 42 16 3A 61 47 74 5A 0D 68 33 44 26 42 16 A4 61 47
What is the concept of cross site scripting? Describe with example.
38 42 24 71 3A 46 34 74 25 40 6 93 84 26 24 71 3A 61 34 74
44 62 27 63 4 13 77 25 A4 D 89 38 42 24 27 63 46 34 77 25
26 42 16 A 61 47 42 A 0D 68 33 44 62 27 16 A4 13 77 42 A4
24 71 3A 46 34 74 5A 40 68 93 84 26 42 16 3A 61 47 42 5A 0D
27 63 4 13 77 25 4 D6 93 38 42 24 71 3A 46 34 74 5A 40 6
Explain in details wireless security offered by 802.11 with neat diagram.

16 A4 61 47 42 A 0D 89 38 44 62 27 63 4 13 77 25 4 D 89
3A 61 34 74 5A 40 68 33 44 26 42 16 A 61 47 42 A 0D 68
46 34 774 25A 40 D6 93 84 26 242 716 3A 461 347 74 5A 40D 68 933
13 77 25 4 D6 89 38 42 24 71 3A 46 34 74 25 40 6 93
47 42 A 0D 89 33 44 62 27 63 4 13 77 25 A4 D 89 38
74 5A 40 68 33 84 26 42 16 A 61 47 42 A 0D 68 33
25 40 D6 93 84 42 24 71 3A 46 34 74 5A 40 68 93 84
A4 D 89 38 42 62 27 63 46 13 77 25 4 D6 93 38
[Total Marks 80]
Paper / Subject Code: 42154 / Advance System Security & Digtal Forensics (DLOC - III)
0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442
(20)
(10)
(10)
(10)
(10)
(10)
(10)
(10)
(10)
(05)
(05)
(05)
(05)
68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44

93 84 26 42 16 3A 61 47 74 5A 0D 68 33 44 26
38 42 24 71 3A 46 34 74 25 40 6 93 84 26
44 62 27 63 4 13 77 25 A4 D 89 38 42 24
26 42 16 A 61 47 42 A 0D 68 33 44 62
24 71 3A 46 34 74 5A 40 68 93 84 26 42
27 63 4 13 77 25 4 D6 93 38 42 24
16 A4 61 47 42 A 0D 89 38 44 62 27
3A 61 34 74 5A 40 68 33 44 26 42
46 34 774 25A 40 D6 93 84 26 242 7
13 77 25 4 D6 89 38 42 24 7
47 4 A 0D 8 33 44 62 2
6 A 1 7 A D 8 3
16 3A 461 347 74 25A 40D 68 933 844
16 3A4 461 347 742 25A 40D 689 9338 844 281
16 3A4 61 347 742 5A 40D 689 338 44 281 902
3 3 7 4 2 9
63 A46 613 477 425 5A4 0D6 6893 3384 442 819 021 163A
A4 13 47 42 A4 0D 89 38 42 81 02 63 4
3A 61 4 74 5A 0 68 33 44 8 90 16 A 61
46 3 77 25 4 D6 93 84 2 19 21 3A 46 34
i.
46 134 4774 425AA40 0D6 893 384 428 8190 0216 63A 461 1347 7742
ii.
1 8 3 4
iii.
61 347 7742 25A 40DD68 933 844 281 1902 2163 3A4 4613 3477 7425 5A4
34 74 5A 40 68 93 84 28 90 16 A 61 47 42 A 0D
Q.6
Q.5
Q.4
Q.3
Q.2
Q.1
13 77 25 4 D6 9 38 42 19 21 3A 46 34 74 5A 40 6
47 4 A 0D 8 33 44 81 0 6 4 1 7 2 D 89
47 742 25A 40D 689 933 844 281 902 2163 3A4 613 3477 7425 5A4 40D 689 338
7 4 8 2 9 6 6 3
76084
77 425 5A4 0D6 6893 338 442 819 021 163AA46 134 4774 425AA40 0D6 893 384 4428
(a)
(a)
(a)
(a)
(a)
(c)
(a)
(b)
(b)
(b)
(b)
(d)
(b)
(b)
42 A4 0D 89 38 44 81 02 63 4 13 77 25 4 D6 89 38 42 19
74 5A 0 68 33 4 28 90 16 A 61 47 42 A 0D 8 33 44 81 02
25 40 D6 93 84 42 19 21 3A 46 34 74 5A 40 68 93 84 28 90 16
A4 D 89 38 42 81 02 63 46 13 77 25 4 D6 93 38 42 19 21 3A
0D 689 33 44 81 902 163 A4 13 477 425 A4 0D 89 38 442 819 021 63 46
68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13
93 84 28 90 16 3A 61 47 74 5A 0D 68 33 44 81 90 16 A4 61 47
38 42 19 21 3A 46 34 74 25 40 6 93 84 28 90 21 3A 61 34 74
(3 Hours)
44 81 02 63 4 13 77 25 A4 D 89 38 42 19 21 63 46 34 77 25
Q.1 is compulsory
28 90 16 A 61 47 42 A 0D 68 33 44 81 02 63 A4 13 77 42 A4
19 21 3A 46 34 74 5A 40 68 93 84 28 90 16 A 61 47 42 5A 0D
02 63 4 13 77 25 4 D6 93 38 42 19 21 3A 46 34 74 5A 40 6
Assume suitable data
16 A4 61 47 42 A 0D 89 38 44 81 02 63 4 13 77 25 4 D6 89
3A 61 34 74 5A 40 68 33 44 28 90 16 A 61 47 42 A 0D 89 33
46 34 774 25A 40 D6 93 84 28 190 216 3A 461 347 742 5A 40D 68 33 844
distinct elements.
13 77 25 4 D6 89 38 42 19 21 3A 46 34 74 5A 40 6 93 84 28
A
47 42 A 0D 89 33 44 81 02 63 4 13 77 25 4 D 89 38 42 19
C
74 5A 40 68 33 84 28 90 16 A 61 47 42 A 0D 68 33 44 81 02
D
A
25 40 D6 93 84 42 19 21 3A 46 34 74 5A 40 68 93 84 28 90 16
2) Structure of the Web

A4 D 89 38 42 81 02 63 46 13 77 25 4 D6 93 38 42 19 21 3A
1) Hubs and Authorities

0D 689 33 44 81 902 163 A4 13 477 425 A4 0D 89 38 442 819 021 63 46
Versus Big data Approach
68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13
in recommendation system.
93 84 28 90 16 3A 61 47 74 5A 0D 68 33 44 81 90 16 A4 61 47
38 42 19 21 3A 46 34 74 25 40 6 93 84 28 90 21 3A 61 34 74
44 81 02 63 4 13 77 25 A4 D 89 38 42 19 21 63 46 34 77 25
Attempt any three from the remaining
28 90 16 A 61 47 42 A 0D 68 33 44 81 02 63 A4 13 77 42 A4
clustering algorithm in detail.

19 21 3A 46 34 74 5A 40 68 93 84 28 90 16 A 61 47 42 5A 0D
02 63 4 13 77 25 4 D6 93 38 42 19 21 3A 46 34 74 5A 40 6
16 A4 61 47 42 A 0D 89 38 44 81 02 63 4 13 77 25 4 D6 89
3A 61 34 74 5A 40 68 33 44 28 90 16 A 61 47 42 A 0D 89 33
46 34 774 25A 40 D6 93 84 28 190 216 3A 461 347 742 5A 40D 68 33 844
B
B
E
13 77 25 4 D6 89 38 42 19 21 3A 46 34 74 5A 40 6 93 84 28
47 42 A 0D 89 33 44 81 02 63 4 13 77 25 4 D 89 38 42 19 Explain the following terms with diagram
74 5A 40 68 33 84 28 90 16 A 61 47 42 A 0D 68 33 44 81 02
25 40 D6 93 84 42 19 21 3A 46 34 74 5A 40 68 93 84 28 90 16
Give Applications of Social Network Mining
A4 D 89 38 42 81 02 63 46 13 77 25 4 D6 93 38 42 19 21 3A
0D 689 33 44 81 902 163 A4 13 477 425 A4 0D 89 38 442 819 021 63 46
Explain Edit distance measure with an example.
68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13

93 84 28 90 16 3A 61 47 74 5A 0D 68 33 44 81 90 16 A4 61 47
38 42 19 21 3A 46 34 74 25 40 6 93 84 28 90 21 3A 61 34 74
44 81 02 63 4 13 77 25 A4 D 89 38 42 19 21 63 46 34 77 25
Reduce execution pipeline with Word count example.

28 90 16 A 61 47 42 A 0D 68 33 44 81 02 63 A4 13 77 42 A4
19 21 3A 46 34 74 5A 40 68 93 84 28 90 16 A 61 47 42 5A 0D
C
02 63 4 13 77 25 4 D6 93 38 42 19 21 3A 46 34 74 5A 40 6
____________________
163A4613477425A40D68933844281902
16 A4 61 47 42 A 0D 89 38 44 81 02 63 4 13 77 25 4 D6 89
F
3A 61 34 74 5A 40 68 33 44 28 90 16 A 61 47 42 A 0D 89 33
Girvan Newman algorithm finds the different communities.
E
two iterations with teleportation factor Beta ( β)value = 0.8
F
46 34 774 25A 40 D6 93 84 28 190 216 3A 461 347 742 5A 40D 68 33 844
When it comes to big data how NoSQL scores over RDBMS.
What is Hadoop? Describe HDFS architechure with diagram.
13 77 25 4 D6 89 38 42 19 21 3A 46 34 74 5A 40 6 93 84 28
47 42 A 0D 89 33 44 81 02 63 4 13 77 25 4 D 89 38 42 19
[Total Marks 80]
74 5A 40 68 33 84 28 90 16 A 61 47 42 A 0D 68 33 44 81 02
25 40 D6 93 84 42 19 21 3A 46 34 74 5A 40 68 93 84 28 90 16
A4 D 89 38 42 81 02 63 46 13 77 25 4 D6 93 38 42 19 21 3A
0D 689 33 44 81 902 163 A4 13 477 425 A4 0D 89 38 442 819 021 63 46
68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13
93 84 28 90 16 3A 61 47 74 5A 0D 68 33 44 81 90 16 A4 61 47
38 42 19 21 3A 46 34 74 25 40 6 93 84 28 90 21 3A 61 34 74
44 81 02 63 4 13 77 25 A4 D 89 38 42 19 21 63 46 34 77 25
Explain different ways by which big data problems are handled by NoSQL.
28 90 16 A 61 47 42 A 0D 68 33 44 81 02 63 A4 13 77 42 A4
Paper / Subject Code: 42155 / Big Data & Analytics (DLOC - III)
example working of an Flajolet – Martin Algorithm used to count number of
What are the challenges in clustering of Data streams. Explain stream

19 21 3A 46 34 74 5A 40 68 93 84 28 90 16 A 61 47 42 5A 0D
Give difference between Traditional data management and analytics approach
What is the role of JobTracker and TaskTracker in MapReduce.Illustrate Map

02 63 4 13 77 25 4 D6 93 38 42 19 21 3A 46 34 74 5A 40 6
Compute the page rank of each page after running the PageRank algorithm for
Explain with block diagram architechure of Data stream Management System.
Describe Girwan – Newman Algorithm. For the following graph show how the
What is the use of Recommender System. How is classification algorithm used
16 A4 61 47 42 A 0D 89 38 44 81 02 63 4 13 77 25 4 D6 89
3A 61 34 74 5A 40 68 33 44 28 90 16 A 61 47 42 A 0D 89
46 34 774 25A 40 D6 93 84 28 190 216 3A 461 347 742 5A 40D 68 33
13 77 25 4 D6 89 38 42 19 21 3A 46 34 74 5A 40 6 93
(5)
(5)
(5)
(5)
47 42 A 0D 89 33 44 81 02 63 4 13 77 25 4 D 89 38
(10)
(10)
(10)
(10)
What do you mean by Counting Distinct Elements in a stream. Illustrate with an (10)
(10)
(10)
(10)
(10)
74 5A 40 68 33 84 28 90 16 A 61 47 42 A 0D 68 33
(10)
25 40 D6 93 84 42 19 21 3A 46 34 74 5A 40 68 93 84
A4 D 89 38 42 81 02 63 46 13 77 25 4 D6 93 38
0D 689 33 44 81 902 163 A4 13 477 425 A4 0D 89 38 442
68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442
93 84 28 90 16 3A 61 47 74 5A 0D 68 33 44 8
38 42 19 21 3A 46 34 74 25 40 6 93 84 28
44 81 02 63 4 13 77 25 A4 D 89 38 42 19
28 90 16 A 61 47 42 A 0D 68 33 44 81
19 21 3A 46 34 74 5A 40 68 93 84 28 90
02 63 4 13 77 25 4 D6 93 38 42 19
16 A4 61 47 42 A 0D 89 38 44 81 02
3A 61 34 74 5A 40 68 33 44 28 90
46 34 774 25A 40 D6 93 84 28 190 2
13 77 25 4 D6 89 38 42 19 2
47 4 A 0D 8 33 44 81 0
57 8 61 D D6 3 3 6D A5 99
57 58DD61 7D7 7D6 534 4836 66D A52 299 6E6
58 6 7D D 53 8 6 A 9 6E 8
58 D61 17D 7D 653 483 366DDA5 5299 96E 689 9A2
D 6 4 6 5
8D 617 7D7 7D6 534 836 66D A52 2996 6E6 89AA25 758
61 D7 D6 534 836 6D A5 99 E6 89A 25 758 D6
61 7D7 D6 534 836 6D A5 299 6E6 89A 25 758 D6 17D
7 2 6 1
17 D7DD65 5348 8366 6DAA52 996 E68 89A 257 758DD61 7D7 7D6
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53
7D D 53 83 6D A5 9 6E 89 2 75 D 17 7D 65 48
6 9 5 6 D
Q4
Q3
Q2
Q1
D7 7D6 534 4836 66D A52 299 6E6 689AA25 758 8D6 17D 7D 653 3483 366D
76439
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A
7D 53 8 66 A 29 6E 8 A2 75 D 17 7 65 48 6 DA 52
65 4 36 DA 52 96 6 9A 57 8 61 D D6 3 3 6D 5 99
(a)
(a)
(a)
(e)
(c)
(a)
65 348 8366 6DA 529 996 E68 89A 257 58DD617 7D7 7D6 534 4836 66D A52 2996 6E6
E 2 5 A
3.
2.
Note: 1.
3 5 8
53 483 366DDA5 5299 96E 689 9A2 575 8D6 617DD7DD65 348 8366 6DA 529 996E E68 9A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
targets.
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
Attempt any four.
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
h(5)=10, h(6)=10, h(S)=15.

A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
Question 1 is compulsory.
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7

96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
Attempt any 3 from Q2 to Q6.
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34

( 3 Hours )
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
Page 1 of 2
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
Design a Mc-Culloh Pitts model for XOR Gate.

(b) Differentiate between Soft and Hard computing.
State PEAS Description for online English tutor.
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617

29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
(d) Give different membership functions of fuzzy logic.
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
A25758D617D7D65348366DA52996E689
sets. A={(1,0.2), (2,0.5), (3, 0.8), (4,1), (5, 0.7), (6,0.3)}
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D

58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
its missiles were sold to it by Colonel West, who is American.

Prove that Col. West is a criminal using resolutfion technique.
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
Indicate your answer with various sketches whenever necessary.
food quality rated between 0 and 10. use this to leave a tip of 25%.
Give Local and Global heuristic function for block world problem.
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
Paper / Subject Code: 42153 / Artificial Intelligence & Soft Computing
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 8
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36
nations. The country Nono, an enemy of America, has some missiles, and all of
and the goal state is 7. Find a path from the initial state to the goal state using
A* Search. Also report the solution cost. The straight line distance heuristic
(b) Explain fuzzy controller system for a tipping example.Consider service and
(b) Construct kohonen Self-organizing map to cluster the four given vectors,
Implement AND function using perceptron networks for bipolar inputs and
estimates for the nodes are as follows: h(1)=14, h(2)=10, h(3)=8, h(4)=12,
Consider the graph given in Figure 1 below. Assume that the-initial state is S
(b) The law says that it is a crime for an American to sell weapons to hostile
Determine (alfa) α-level sets and strong α-level sets for the following fuzzy
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836

D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 D
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA
( Total Marks : 80)
[10]
[10]
[10]
[10]
[10]
[10]
[20]
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 52
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52
96 68 A 57 8D 61 D7 D6 34 36 D 5 99
E6 9A 25 58 6 7D D 53 83 6D A5 29
89 25 75 D6 17D 7D 65 48 66 A 29 96
A2 75 8D 17 7 65 34 36 DA 52 96
57 8D 61 D7 D6 34 836 6D 52 99 E
58 61 7D D 53 83 6D A5 99 6E
D 6 4 6
57 8 61 D D6 3 3 6D A5 99
57 58DD61 7D7 7D6 534 4836 66D A52 299 6E6
58 6 7D D 53 8 6 A 9 6E 8
58 D61 17D 7D 653 483 366DDA5 5299 96E 689 9A2
D 6 4 6 5
8D 617 7D7 7D6 534 836 66D A52 2996 6E6 89AA25 758
61 D7 D6 534 836 6D A5 99 E6 89A 25 758 D6
61 7D7 D6 534 836 6D A5 299 6E6 89A 25 758 D6 17D
7 2 6 1
17 D7DD65 5348 8366 6DAA52 996 E68 89A 257 758DD61 7D7 7D6
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53
7D D 53 83 6D A5 9 6E 89 2 75 D 17 7D 65 48
6 9 5 6 D
Q6
Q5
D7 7D6 534 4836 66D A52 299 6E6 689AA25 758 8D6 17D 7D 653 3483 366D
76439
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A
7D 53 8 66 A 29 6E 8 A2 75 D 17 7 65 48 6 DA 52
65 4 36 DA 52 96 6 9A 57 8 61 D D6 3 3 6D 5 99
(e)
(c)
(a)
(a)
65 348 8366 6DA 529 996 E68 89A 257 58DD617 7D7 7D6 534 4836 66D A52 2996 6E6
3 E 2 5 5 A 8
53 483 366DDA5 5299 96E 689 9A2 575 8D6 617DD7DD65 348 8366 6DA 529 996E E68 9A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
(b) ANFIS
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
Genetic algorithm
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
Hill Climbing algorithm

36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
(d) Wumpus world knowledge base

89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
Different types of Neural Networks

57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
Assume an initial learning rate of 0.5.
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
Write Short notes on following (Any Four)

17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
Gravity (CoG) method on the following:
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
Page 2 of 2
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 83
_____________________________
A25758D617D7D65348366DA52996E689
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D
58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48 66 A
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 D 52
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836 6D A5 99
D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6D A5 29 6E
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66 A 29 96E 689
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 DA 529 96E 68 A2
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA 52 96 6 9A 57
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5 99 E 89 25 58
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A 29 6E 68 A2 75 D
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7
96 68 A 57 8D 61 D7 D6 34 36 D 5 99 E6 9A 25 58 6 7D D
E6 9A 25 58 6 7D D 53 83 6D A5 29 6E 89 2 75 D 17 7D 65
89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34
Paper / Subject Code: 42153 / Artificial Intelligence & Soft Computing
A2 75 8D 17 7 65 34 36 DA 52 96 6 9A 57 8D 61 D D6 53 8
mounted on to the car’s axle, where the initial state has a flat tire on the axle
and a good spare tire in the trunk. Give the ADL description for the problem.
problem of changing a flat tire. The goal is to have a good spare tire properly
57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483

58 61 7D D 53 83 6D A5 99 6E 89 2 75 D6 7D 7D 65 48
D6 7D 7D 65 48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36
Explain defuzzification techniques. Apply defuzzification by using Center of
[0 0 11], [1 0 0 0], [0 11 0] and [0 0 0 1]. The number of cluster formed is two.
(b) Explain planning problem in AI. What are different types of planning? Consider
17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836

D7 6 34 36 D 52 99 E6 9A 25 58 6 7D D 53 83 6
D6 534 83 6D A5 99 6E6 89 25 758 D6 17D 7D 653 483 66
53 83 66D A5 299 6E 89 A2 75 D6 17D 7D 65 48 66 D
48 66 A 29 6E 68 A2 57 8D 17 7 6 34 36 DA
[20]
[10]
[10]
36 DA 52 96 6 9A 57 58 61 D D6 53 83 6D 5
6D 5 99 E6 89 25 58 D6 7D 7D 53 48 66 A
A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 52
29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52
96 68 A 57 8D 61 D7 D6 34 36 D 5 99
E6 9A 25 58 6 7D D 53 83 6D A5 29
89 25 75 D6 17D 7D 65 48 66 A 29 96
A2 75 8D 17 7 65 34 36 DA 52 96
57 8D 61 D7 D6 34 836 6D 52 99 E
58 61 7D D 53 83 6D A5 99 6E
D 6 4 6
F D 22 14 C 4B E C 99 96
F5 53D3 322 314 4C7 74B CE 2CC C99 096 9D2
3D 2 31 4C 4 C 2C 9 09 9D 9
3D 322 231 44C 74B BCE E2C C99 9096 69D 298 8B9
4 C F
D3 3223 314 4C7 74B CE2 2CC 990 0969 9D2 298B B9F 53D
22 14 4C7 4B CE CC 99 96 D2 98 9F 53D 32
32 31 4C 4 CE 2C 9 09 9D 9 B9 53 3 23
23 4 7 B 2 C 90 69 2 8B F D 2 1
23 144 4C74 4BC CE2 CC 990 969 D29 98B 9F5 53D 322 2314 44C
14 C7 B E CC 99 96 D2 8B 9F 3D 32 31 4C 74
31 4C 4B CE 2C 9 09 9D 98 9 53 3 23 44 7 BC
4 9 6 4
14 4C7 74B CE 2CC C99 096 9D2 298B B9F F53DD32 2231 144C C74 BC E2C
76543
4C 4B CE 2C 99 09 9D 98 9 53 3 23 44 7 BC E2 C
4C 74B CE 2C C99 09 69D 298 B9 F53 D3 223 144 C7 4BC E2 CC 990
C 6 F 2 4 C 9 9
C7 74B CE2 2CC 990 096 9D2 298B B9F 53DD32 231 144C C74 BCE E2C C9 909 69D
4B CE CC 99 96 9D 98 9F 53 32 231 44 74 BC 2C C9 909 69D 29
74 C 2C 9 09 9D 29 B9 5 D3 23 4 C7 B E2 C 90 69 2 8B
BC E2 C 90 69 2 8B F5 3D 22 14 4C 4B CE C 99 96 D 98 9
E2 CC 990 969 D2 98B 9F 3D 322 31 4C 74B CE 2C C99 096 9D 298 B9 F53
CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C C9 09 9D 29 B9 F5 D3
Q1] Solve any four

99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9 909 69D 29 8B F5 3D3 22
09 9D 29 B9 53 D3 23 44 7 BC E2 C 90 69 2 8B 9F 3D 22 31
69 29 8B F5 D 22 14 C 4B E CC 99 96 D 98 9F 53 32 31 44
D2 8B 9F 3D 32 31 4C 74 CE 2C 9 09 9D 29 B9 53 D3 23 44 C7
98 9F 53 32 231 44 74 BC 2C C9 909 69D 29 8B F5 D3 22 14 C7 4B
Note:- Q 1 is compulsory
B9 53 D3 23 44 C7 BC E2 C 90 69 2 8B 9F 3D 22 31 4C 4B CE
F5 D3 22 14 C7 4B E CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C
3D 22 31 4C 4B CE 2C 99 096 9D 98 B9 53 3 23 44 7 BC E2 C
32 31 44C 74 CE 2C C9 09 9D 29 B9 F53 D3 223 144 C7 4BC E2 CC 990
C] Explain IP mobility.
23 44 74 BC 2 C 90 69 29 8B F5 D 22 14 C 4B E CC 99 96
14 C7 B E CC 99 96 D2 8B 9F 3D 32 31 4C 74 C 2C 9 09 9D
4C 4B CE 2C 99 09 9D 98 9 53 3 23 44 7 BC E2 C 90 69 2
74 C 2C C9 09 69D 29 B9 F5 D3 223 14 C7 4B E2 CC 990 969 D2 98B
BC E2 C 90 69 2 8B F5 3D 22 14 4C 4B CE C 99 96 D 98 9
Each question carries 20 marks
Solve any three from remaining
CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C C9 09 9D 29 B9 F5 D3
99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9 909 69D 29 8B F5 3D3 22
09 9D 29 B9 53 D3 23 44 7 BC E2 C 90 69 2 8B 9F 3D 22 31
Q 2] a] Explain in detail GSM architecture.

E] Explain in short voice over LTE.
69 29 8B F5 D 22 14 C 4B E CC 99 96 D 98 9F 53 32 31 44
D2 8B 9F 3D 32 31 4C 74 CE 2C 9 09 9D 29 B9 53 D3 23 44 C7
Time: 3 Hours
98 9F 53 32 231 44 74 BC 2C C9 909 69D 29 8B F5 D3 22 14 C7 4B

B9 53 D3 23 44 C7 BC E2 C 90 69 2 8B 9F 3D 22 31 4C 4B CE
F5 D3 22 14 C7 4B E CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C
Q 5] a] Explain Bluetooth protocol stack in detail.

3D 22 31 4C 4B CE 2C 99 096 9D 98 B9 53 3 23 44 7 BC E2 C
32 31 44C 74 CE 2C C9 09 9D 29 B9 F53 D3 223 144 C7 4BC E2 CC 990 D] Explain characteristics of GSM standards.
23 44 74 BC 2 C 90 69 29 8B F5 D 22 14 C 4B E CC 99 96
Page 1 of 1
B] Explain protocol architecture of IEEE 802.11.
14 C7 B E CC 99 96 D2 8B 9F 3D 32 31 4C 74 C 2C 9 09 9D
4C 4B CE 2C 99 09 9D 98 9 53 3 23 44 7 BC E2 C 90 69 2
74 C 2C C9 09 69D 29 B9 F5 D3 223 14 C7 4B E2 CC 990 969 D2 98B
BC E2 C 90 69 2 8B F5 3D 22 14 4C 4B CE C 99 96 D 98 9
*************
CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C C9 09 9D 29 B9 F5 D3
A] Explain different application of mobile computing.
B] Explain concept of frequency reuse with clustering.
99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9 909 69D 29 8B F5 3D3 22

09 9D 29 B9 53 D3 23 44 7 BC E2 C 90 69 2 8B 9F 3D 22 31
Q 4] a] Explain DSDV routing protocol used in ad-hoc network.

69 29 8B F5 D 22 14 C 4B E CC 99 96 D 98 9F 53 32 31 44
B] Explain various nodes present in E-UTRAN architecture.

D2 8B 9F 3D 32 31 4C 74 CE 2C 9 09 9D 29 B9 53 D3 23 44 C7
B] How is packet delivery achieved to and from mobile node?

98 9F 53 32 231 44 74 BC 2C C9 909 69D 29 8B F5 D3 22 14 C7 4B
B9 53 D3 23 44 C7 BC E2 C 90 69 2 8B 9F 3D 22 31 4C 4B CE
8B9F53D3223144C74BCE2CC990969D29
F5 D3 22 14 C7 4B E CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C
3D 22 31 4C 4B CE 2C 99 096 9D 98 B9 53 3 23 44 7 BC E2 C
32 31 44C 74 CE 2C C9 09 9D 29 B9 F53 D3 223 144 C7 4BC E2 CC 990
23 44 74 BC 2 C 90 69 29 8B F5 D 22 14 C 4B E CC 99 96
14 C7 B E CC 99 96 D2 8B 9F 3D 32 31 4C 74 C 2C 9 09 9D
4C 4B CE 2C 99 09 9D 98 9 53 3 23 44 7 BC E2 C 90 69 2
Q 6] A] Explain different components used in LTE architecture with diagram.

74 C 2C C9 09 69D 29 B9 F5 D3 223 14 C7 4B E2 CC 990 969 D2 98B
BC E2 C 90 69 2 8B F5 3D 22 14 4C 4B CE C 99 96 D 98 9
CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C C9 09 9D 29 B9 F5 D3
99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9 909 69D 29 8B F5 3D3 22 Q3] a] Explain hidden station and exposed station problem with solution in WLAN.
09 9D 29 B9 53 D3 23 44 7 BC E2 C 90 69 2 8B 9F 3D 22 31
69 29 8B F5 D 22 14 C 4B E CC 99 96 D 98 9F 53 32 31 44
B] Explain different security threats in WLAN and discuss the available solutions.
D2 8B 9F 3D 32 31 4C 74 CE 2C 9 09 9D 29 B9 53 D3 23 44 C7
Paper / Subject Code: 42152 / Mobile Communication and Computing
B] Explain in short different algorithm used for authentication and privacy in GSM.
98 9F 53 32 231 44 74 BC 2C C9 909 69D 29 8B F5 D3 22 14 C7 4

B9 53 D3 23 44 C7 BC E2 C 90 69 2 8B 9F 3D 22 31 4C 4B
F5 D3 22 14 C7 4B E CC 99 96 D2 98 9F 53D 32 31 44C 74
3D 22 31 4C 4B CE 2C 99 096 9D 98 B9 53 3 23 44 7 BC
Marks: 80
32 31 44C 74 CE 2C C9 09 9D 29 B9 F53 D3 223 144 C7 4BC

23 44 74 BC 2 C 90 69 29 8B F5 D 22 14 C 4B E
14 C7 B E CC 99 96 D2 8B 9F 3D 32 31 4C 74 C 2
4C 4B CE 2C 99 09 9D 98 9 53 3 23 44 7 BC E2
74 C 2C C9 09 69D 29 B9 F5 D3 223 14 C7 4B E2 C
BC E2 C 90 69 2 8B F5 3D 22 14 4C 4B CE C
E2 CC 990 969 D2 98B 9F 3D 322 31 4C 74B CE 2C C
CC 99 96 D2 98 9F 53D 32 31 44C 74 C 2C C9
99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9
09 9D 29 B9 53 D3 23 44 7 BC E2 C 90
69 29 8B F5 D 22 14 C 4B E CC 99
D2 8B 9F 3D 32 31 4C 74 CE 2C 9 09
98 9F 53 32 231 44 74 BC 2C C9 909
B9 53 D3 23 44 C7 BC E2 C 90 69
F5 D3 22 14 C7 4B E CC 99 96
3 3 4 C 2 0 9
C7 40 A B3 5 C 1 1 4 57
2 5 D 3 8 4 2
72 405 5A5 B37 75D C31 1189 914 742 57F F145
40 A5 B3 5D C3 18 14 74 57 14 4B
24 5A B 75 C 11 91 7 25 F1 54 C
05 5 3 D 3 8 4 42 7F 4 B 7
05 A5B B37 75D C31 1189 9147 742 57F 145 54BC C72 2405
A C 5 1
5A 5B 375 5DC 311 1891 1474 425 7F1 454 4BC 724 405AA5B
5 3 D 3 8 4 2 7 4 7
A5 B3 75D C3 118 914 742 57 F14 54B BC7 240 05A 5B3 375D
B3 75D C3 118 91 74 57 F14 54B C7 240 5A 5B3 75 C
5B 75 C 11 9 47 25 F1 54 C 24 5 5B 7 DC 31
37 D 3 8 14 42 7F 45 B 7 0 A5 3 5D 3 18
N.B:
37 5DC C31 1189 9147 7425 57F 145 4BC C72 2405 5A5 B37 75D C31 1189 914
5 1 4 B C 7
77181
75 DC 311 1891 1474 4257 7F1 454 BC 724 405AA5B 375 5DC 311 1891 147 425
DC 31 89 47 25 F 45 BC 72 05 5B 37 D 31 89 47 42 7F
3)
2)
1)
5D 3 18 14 42 7F 14 4B 7 40 A5 3 5D C3 18 14 4 57 14
C 11 91 74 57 1 54 C 24 5A B 75 C 11 91 7 25 F1 54
C3 3118 8914 474 257 F14 454B BC7 7240 05A 5B3 375 DC3 311 891 474 4257 7F14 454 BC7
11 91 74 257 F1 54 C 24 5A 5B 75 DC 11 891 47 25 F1 54 BC 24
89 47 25 F1 45 BC 72 05 5B 37 DC 31 89 47 42 7F 45 BC 72 05
14 42 7F 45 4B 72 40 A5 3 5D 3 18 14 42 57 14 4B 7 40 A
74 57 14 4B C7 40 5A B 75 C 11 91 74 57 F1 54 C 24 5A 5B
25 F1 54 C 24 5A 5B 37 DC 31 89 47 25 F1 45 BC 72 05 5B 37
7F 45 B 72 05 5 37 5D 31 18 14 42 7F 45 4B 72 40 A5 3 5D
14 4B C7 40 A B3 5D C3 18 91 74 57 14 4B C7 40 5A B3 75 C
Q.1 Attempt any four :
54 C 24 5A 5B 75 C 11 91 47 25 F1 54 C 24 5A 5B 75 DC 31
wireless devices.
BC 72 05 5B 37 D 31 89 47 42 7F 45 BC 72 05 5 37 D 31 18
suitable examples.
72 405 A5 37 5D C31 189 14 42 57F 145 4B 72 405 A5 B37 5D C3 18 914
intellectual Property.
40 A5 B3 5D C3 18 14 74 57 14 4B C7 40 A B3 5D C3 11 91 74
5A B 75 C 11 91 74 25 F1 54 C 24 5A 5B 75 C 11 89 47 25
1) Q.1 is compulsory.
5B 375 DC 311 89 47 25 7F1 454 BC 724 05 5B 37 DC 31 89 147 425 7F

37 DC 31 89 147 425 7F 45 BC 72 05 A5 37 5D 31 189 14 42 7F 145
Q.6 Write short note on (Any 2) :

5D 3 18 14 42 7F 14 4B 7 40 A5 B3 5D C3 18 14 74 57 14 4B
C3 118 914 74 57 14 54B C7 240 5A B3 75 C3 11 91 74 257 F14 54 C7
Computer Sabotage.
11 91 74 257 F1 54 C 24 5A 5B 75 DC 11 891 47 25 F1 54 BC 24
89 47 25 F1 45 BC 72 05 5B 37 DC 31 89 47 42 7F 45 BC 72 05
14 42 7F 45 4B 72 40 A5 3 5D 3 18 14 42 57 14 4B 7 40 A
74 57 14 4B C7 40 5A B 75 C 11 91 74 57 F1 54 C 24 5A 5B
25 F1 54 C 24 5A 5B 37 DC 31 89 47 25 F1 45 BC 72 05 5B 37
7F 45 B 72 05 5 37 5D 31 18 14 42 7F 45 4B 72 40 A5 3 5D
14 4B C7 40 A B3 5D C3 18 91 74 57 14 4B C7 40 5A B3 75 C
54 C 24 5A 5B 75 C 11 91 47 25 F1 54 C 24 5A 5B 75 DC 31
e) Write brief note on : Cyber-terrorism.
( 3 Hours )
3) Assume suitable data if necessary.
BC 72 05 5B 37 D 31 89 47 42 7F 45 BC 72 05 5 37 D 31 18
72 405 A5 37 5D C31 189 14 42 57F 145 4B 72 405 A5 B37 5D C3 18 914
40 A5 B3 5D C3 18 14 74 57 14 4B C7 40 A B3 5D C3 11 91 74
a) Compare active attacks vs Passive attacks.
5A B 75 C 11 91 74 25 F1 54 C 24 5A 5B 75 C 11 89 47 25
5B 375 DC 311 89 47 25 7F1 454 BC 724 05 5B 37 DC 31 89 147 425 7F
37 DC 31 89 147 425 7F 45 BC 72 05 A5 37 5D 31 189 14 42 7F 145
b) Explain various types of key-loggers in brief.
Page 1 of 1
5D 3 18 14 42 7F 14 4B 7 40 A5 B3 5D C3 18 14 74 57 14 4B
C3 118 914 74 57 14 54B C7 240 5A B3 75 C3 11 91 74 257 F14 54 C7
Indian Information Technology Act 2000

b) What is E-contract? Discuss E-contract Act 1872.
11 91 74 257 F1 54 C 24 5A 5B 75 DC 11 891 47 25 F1 54 BC 24
89 47 25 F1 45 BC 72 05 5B 37 DC 31 89 47 42 7F 45 BC 72 05
14 42 7F 45 4B 72 40 A5 3 5D 3 18 14 42 57 14 4B 7 40 A
74 57 14 4B C7 40 5A B 75 C 11 91 74 57 F1 54 C 24 5A 5B
c) Classify the cybercrimes and explain any one briefly.
25 F1 54 C 24 5A 5B 37 DC 31 89 47 25 F1 45 BC 72 05 5B 37
______________________
7F 45 B 72 05 5 37 5D 31 18 14 42 7F 45 4B 72 40 A5 3 5D
Write key IT requirements for SOX and HIPAA.

14 4B C7 40 A B3 5D C3 18 91 74 57 14 4B C7 40 5A B3 75 C
54 C 24 5A 5B 75 C 11 91 47 25 F1 54 C 24 5A 5B 75 DC 31
Q.3 a) Compare Vishing, Phishing and Smishing in cyber security.
BC 72 05 5B 37 D 31 89 47 42 7F 45 BC 72 05 5 37 D 31 18
b) How the Indian penal code IPC 1860 addresses cybercrime?
C72405A5B375DC311891474257F1454B
72 405 A5 37 5D C31 189 14 42 57F 145 4B 72 405 A5 B37 5D C3 18 914
Q.2 a) How criminals plan the attack? Discuss various steps involved
40 A5 B3 5D C3 18 14 74 57 14 4B C7 40 A B3 5D C3 11 91 74
5A B 75 C 11 91 74 25 F1 54 C 24 5A 5B 75 C 11 89 47 25
d) Explain how the appeals can be made under The IT ACT 2000.
5B 375 DC 311 89 47 25 7F1 454 BC 724 05 5B 37 DC 31 89 147 425 7F

2) Attempt any THREE questions from the remaining questions.
37 DC 31 89 147 425 7F 45 BC 72 05 A5 37 5D 31 189 14 42 7F 145 b) What is E-commerce? Explain different types of e-commerce with
5D 3 18 14 42 7F 14 4B 7 40 A5 B3 5D C3 18 14 74 57 14 4B
Q.4 a) What is Bluetooth hacking? Explain Bluetooth hacking tools in brief.

C3 118 914 74 57 14 54B C7 240 5A B3 75 C3 11 91 74 257 F14 54 C7
Paper / Subject Code: 42162 / Cyber Security Laws
11 91 74 257 F1 54 C 24 5A 5B 75 DC 11 891 47 25 F1 54 BC 24
Q.5 a) Discuss basic security precautions to be taken to safeguard Laptops and

89 47 25 F1 45 BC 72 05 5B 37 DC 31 89 47 42 7F 45 BC 72 05
14 42 7F 45 4B 72 40 A5 3 5D 3 18 14 42 57 14 4B 7 40 A
74 57 14 4B C7 40 5A B 75 C 11 91 74 57 F1 54 C 24 5A 5B
25 F1 54 C 24 5A 5B 37 DC 31 89 47 25 F1 45 BC 72 05 5B 37
b) Explain how Intellectual property laws protect the rights of the owner of the
7F 45 B 72 05 5 37 5D 31 18 14 42 7F 45 4B 72 40 A5 3 5D
14 4B C7 40 A B3 5D C3 18 91 74 57 14 4B C7 40 5A B3 75 C
54 C 24 5A 5B 75 C 11 91 47 25 F1 54 C 24 5A 5B 75 DC 31
BC 72 05 5B 37 D 31 89 47 42 7F 45 BC 72 05 5 37 D 31 18
72 405 A5 37 5D C31 189 14 42 57F 145 4B 72 405 A5 B37 5D C3 18 9
40 A5 B3 5D C3 18 14 74 57 14 4B C7 40 A B3 5D C3 11 91
5A B 75 C 11 91 74 25 F1 54 C 24 5A 5B 75 C 11 89
5B 375 DC 311 89 47 25 7F1 454 BC 724 05 5B 37 DC 31 89 14
37 DC 31 89 147 425 7F 45 BC 72 05 A5 37 5D 31 189 14
5D 3 18 14 42 7F 14 4B 7 40 A5 B3 5D C3 18 14 74
C3 118 914 74 57 14 54B C7 240 5A B3 75 C3 11 91 74
[20]
[10]
[10]
[10]
[10]
[10]
[10]
[10]
[5]
[5]
[10]
[5]
[5]
[5]
11 91 74 257 F1 54 C 24 5A 5B 75 DC 11 891 47 2
89 47 25 F1 45 BC 72 05 5B 37 DC 31 89 47 42
( Total Marks : 80 )
14 42 7F 45 4B 72 40 A5 3 5D 3 18 14 42 57
74 57 14 4B C7 40 5A B 75 C 11 91 74 57
25 F1 54 C 24 5A 5B 37 DC 31 89 47 25 F
7F 45 B 72 05 5 37 5D 31 18 14 42 7F
14 4B C7 40 A B3 5D C3 18 91 74 57 1
54 C 24 5A 5B 75 C 11 91 47 25 F1
BC 72 05 5B 37 D 31 89 47 42 7F 45
72 405 A5 37 5D C31 189 14 42 57F 145
40 A5 B3 5D C3 18 14 74 57 14 4
5A B 75 C 11 91 74 25 F1 54
3 D 3 7 4 B
C7 40 A B3 5 C 1 91 74 57
2 5 D 3 8 4 2
72 405 5A5 B37 75D C31 1189 914 742 57E EF01
40 A5 B3 5D C3 18 14 74 57 F0 30
24 5A B 75 C 11 91 7 25 EF 13 C
0 4 7
40 5A5 5B3 375DDC3 3118 8914 474 257 EF0 0130 0C7 7240
5A B 75 C 11 91 74 25 EF 13 C 24 5A
5A 5B 375 DC 311 891 474 25 7EF 013 0C 724 05A 5B
3 3 7 7
A5 5B3 75DDC3 118 8914 4742 257 EF0 0130 0C7 240 05A5 5B3 375D
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C
5B 75 C 11 9 47 25 EF 1 0C 24 5A 5B 7 DC 31
1 4 3 5 1
B3 375DDC3 3118 891 474 257 7EF0 013 0C7 7240 05A 5B3 375 DC 311 891
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47
N.B:
Q.3
Q.2
Q.1
75 DC 311 891 474 257 EF 013 0C 724 05A 5B 375 DC 311 891 47 425
78259
D 3 7 0 4 7
5D C3 118 8914 4742 257E EF0 0130 0C7 240 5A5 5B3 375DDC3 3118 8914 474 257 EF0
2
3 Hours
1 9 1 2 5 7 E
DC C31 189 147 7425 57E F01 30C C72 405 A5B B37 5DC C31 1189 9147 742 57E F01 130C
1 1 4 7 F 3 4 A 5 1
31 89 47 25 E 01 0C 72 05 5B 37 D 31 89 47 42 7E 01 30C 72 1 5 F
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
S3
S2
S1
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
Subject to
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
Subject to ,
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
Demand
𝑥1 − 𝑥2 ≤ 2
𝑥1 + 𝑥2 ≤ 4,
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
𝑥1 − 𝑥2 ≤ 10
𝑥1 + 2𝑥2 = 8
𝑥1 − 2𝑥2 ≥ 2
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
Where 𝑥1 , 𝑥2 ≥ 0
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
transportation plan.
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
5
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
40
70
19
D1
Maximize Z=3𝑥1 + 2𝑥2
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A Maximise Z= 𝟒𝒙𝟏 + 𝟐𝒙𝟐
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
1) Average queue length

a) Solve by Simplex Method:
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
(1) Question no 1 is compulsory
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
(5) Notations carry usual meaning
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31

30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
(4) Assume Suitable data if necessary
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47

a)Write the dual of the following LPP
8
8
30
30
D2
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
Where𝑥1 ≥ 0,𝑥2 is unrestricted in sign.
4) Mean waiting time of an arrival

A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
(3) Figures to the right indicate full marks
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
2) Average length of non empty queue

DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
Page 1 of 3
Answer any four of the following questions:
d) Enlist assumptions in sequencing problem.
3) Average number of workers in system

31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72 b)What are assumptions made in game theory
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
7
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
70
40
50
D3
(2) Attempt any three out of remaining five questions
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31

30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
C72405A5B375DC311891474257EF0130
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
5) Average waiting time of an arrival (worker) who waits.

75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
e) Briefly explain Monte Carlo simulation with suitable example.
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
Paper / Subject Code: 42161 / Operations Research
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
14
20
60
10
D4
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
c) Write short note on special cases in Linear Programming Problem.
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
average service time (of tool room attendant) is 40 seconds. Determine

42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 9
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 1
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 7
9
7
18
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 4
Supply
Total: 80 marks
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42

18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42
(10)
(10)
(05)
(05)
(05)
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57
(05)
(10)
(05)
b) Workers come to tool store room to receive special tools (required by them) for
a) Solve the following by Vogel’s Approximation Method (VAM) and find optimal
accomplishing a particular project assigned to them. The average time between two
arrivals is 60 seconds and the arrivals are assumed to be in Poisson distribution. The
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E
57 F0 30 C7 40 A B3 5D C3 11 91 74 57
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF
01 0C 724 05 5B 37 DC 31 89 147 425 7E
30 72 05 A5 3 5D 3 18 14 42 7E F0
C7 40 A B3 75 C 11 91 74 57 F 1
24 5A 5B 75 DC 311 891 47 25 EF 013
05 5B 37 D 31 89 47 42 7E 01
A5 3 5D C3 18 14 4 57 F0 30
C7 40 A B3 5 C 1 91 74 57
2 5 D 3 8 4 2
72 405 5A5 B37 75D C31 1189 914 742 57E EF01
40 A5 B3 5D C3 18 14 74 57 F0 30
24 5A B 75 C 11 91 7 25 EF 13 C
0 4 7
40 5A5 5B3 375DDC3 3118 8914 474 257 EF0 0130 0C7 7240
5A B 75 C 11 91 74 25 EF 13 C 24 5A
5A 5B 375 DC 311 891 474 25 7EF 013 0C 724 05A 5B
3 3 7 7
A5 5B3 75DDC3 118 8914 4742 257 EF0 0130 0C7 240 05A5 5B3 375D
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C
5B 75 C 11 9 47 25 EF 1 0C 24 5A 5B 7 DC 31
1 4 3 5 1
B3 375DDC3 3118 891 474 257 7EF0 013 0C7 7240 05A 5B3 375 DC 311 891
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47
Q.4
75 DC 311 891 474 257 EF 013 0C 724 05A 5B 375 DC 311 891 47 425
78259
D 3 7 0 4 7
5D C3 118 8914 4742 257E EF0 0130 0C7 240 5A5 5B3 375DDC3 3118 8914 474 257 EF0
1 9 1 2 5 7 2 E
1 1 4 7 F 3 4 A 5 1
31 89 47 25 E 01 0C 72 05 5B 37 D 31 89 47 42 7E 01 30C 72 1 5 F
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
Daily
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
Demand
C5
C4
C3
C2
C1
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
4-7
3-7
3-6
3-5
2-5
1-4
1-3
1-2
Arc
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
Contractors
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
0
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47

05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
Probability 0.01
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF

75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
corresponding distance are:

9
9
9
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
10
10
R1
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
10
48,78,19,51,56,77,15,14,68,09
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
the daily demand as given here:
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
0.20
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
8
2
9
5
1
7
8
10
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
Distance
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
20
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
a) Solve the following Assignment Problem.
0.15
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
15
12
18
17
14
R2
Rs.50 Lakhs is total cost of repair.
Page 2 of 3
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
Consider the following sequence of random numbers:
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31

30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
30
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
C72405A5B375DC311891474257EF0130
7-9
6-9
5-9
5-8
0.50
Arc
9-11
8-11
7-10
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
10-11
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
average demand for this cake on the basis of simulated data.
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
21
18
21
20
19
R3
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
3) Which of the 5 contractors will be unsuccessful in his bid?

31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
(10)
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
0.12
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
Cost of Repairs (Rs.in Lakhs) of Roads
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31

30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 9
2
4
6
9
7
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89
15
13
12
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 1
50
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14
1) Find the best way of assigning the repair work to the contractors and cost.
16
19
18
19
15
R4
0.02
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 7
Distance
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 4
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42
2) If it is necessary to seek supplementary grants, then what should be the amount?
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42
(10)
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57
(10)
b) Iyengar Bakery keeps stock of a popular brand of cake. Previous experience indicates
Using this sequence simulate the demand for the next 10 days. Find out the stock situation
if the owner of the bakery decided to make 30 cakes every day. Also estimate the daily
table. Find the shortest path from node 1 to node 11 using dynamic programming. The
b) A distance network consists of eleven nodes which are distributed as shown in following
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E
57 F0 30 C7 40 A B3 5D C3 11 91 74 57
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF
01 0C 724 05 5B 37 DC 31 89 147 425 7E
30 72 05 A5 3 5D 3 18 14 42 7E F0
C7 40 A B3 75 C 11 91 74 57 F 1
24 5A 5B 75 DC 311 891 47 25 EF 013
05 5B 37 D 31 89 47 42 7E 01
A5 3 5D C3 18 14 4 57 F0 30
C7 40 A B3 5 C 1 91 74 57
2 5 D 3 8 4 2
72 405 5A5 B37 75D C31 1189 914 742 57E EF01
40 A5 B3 5D C3 18 14 74 57 F0 30
24 5A B 75 C 11 91 7 25 EF 13 C
0 4 7
40 5A5 5B3 375DDC3 3118 8914 474 257 EF0 0130 0C7 7240
5A B 75 C 11 91 74 25 EF 13 C 24 5A
5A 5B 375 DC 311 891 474 25 7EF 013 0C 724 05A 5B
3 3 7 7
A5 5B3 75DDC3 118 8914 4742 257 EF0 0130 0C7 240 05A5 5B3 375D
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C
5B 75 C 11 9 47 25 EF 1 0C 24 5A 5B 7 DC 31
1 4 3 5 1
B3 375DDC3 3118 891 474 257 7EF0 013 0C7 7240 05A 5B3 375 DC 311 891
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47
Q.6
Q.5
75 DC 311 891 474 257 EF 013 0C 724 05A 5B 375 DC 311 891 47 425
78259
D 3 7 0 4 7
5D C3 118 8914 4742 257E EF0 0130 0C7 240 5A5 5B3 375DDC3 3118 8914 474 257 EF0
1 9 1 2 5 7 2 E
1 1 4 7 F 3 4 A 5 1 1 5 F
(10)
31 89 47 25 E 01 0C 72 05 5B 37 D 31 89 47 42 7E 01 30C 72
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
Books
Binding
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
Printing
time (hr)
time (hr)
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
Where 𝑥1 , 𝑥2 ≥ 0
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
of binding machine.
1
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
80
30
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
Subject to 3x1 + x2 = 3
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
Maximize Z=𝟒𝒙𝟏 + 𝒙𝟐
4𝑥1 + 3𝑥2 ≥ 6
𝑥1 + 2𝑥2 ≤ 4
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
Lot size
150-499
Upto 149
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
500 or More
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
2
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
100
120
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
each player and the value of the game.
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
3
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
90
50
Page 3 of 3
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
b)Solve by Big-M or Charne’s Penalty Method
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 91
C72405A5B375DC311891474257EF0130
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89 47
4
60
20
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 14 42
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14 74 57
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 74 257 EF
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47 25 EF 013
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 42 7E 01 0C
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42 57E F01 30C 72
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42 57 F0 30 7 40
Price
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57 EF 13 C 24 5A
Rs.38
Rs.39
Rs.40
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25 E 01 0C 72 05 5B
5
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E F0 30 72 40 A5 3
30
90
57 F0 30 C7 40 A B3 5D C3 11 91 74 57 F 13 C7 40 5A B 75
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF 01 0C 24 5A 5B 37 DC
01 0C 724 05 5B 37 DC 31 89 147 425 7E 01 30C 72 05 5 37 5D 31
(10)
30 72 05 A5 3 5D 3 18 14 42 7E F0 30 7 40 A5 B3 5D C3 18
C7 40 A B3 75 C 11 91 74 57 F 13 C7 24 5A B 75 C 11 9
24 5A 5B 75 DC 311 891 47 25 EF 013 0C 24 05A 5B 375 DC 311 89
05 5B 37 D 31 89 47 42 7E 01 0C 72 05 5 37 D 31 89 1
A5 3 5D C3 18 14 42 57 F0 30 7 40 A5 B3 5D C3 18 14
B3 75D C3 118 91 74 57 EF0 13 C7 240 5A B3 75 C 11 91 7
6
75 C 11 91 474 257 EF 13 0C 24 5A 5B 75 DC 311 891 47

10
110
DC 31 89 47 25 E 01 0C 72 05 5B 37 DC 31 89 47 4
31 189 147 425 7E F01 30C 72 405 A5B 37 5D 31 189 147 42
18 14 42 7E F0 30 72 40 A5 3 5D C3 18 14 42
-----------------------------------------The End--------------------------------------------------------
(10)
91 74 57 F 13 C7 40 5A B 75 C 11 91 74 57
(10)
a) A book binder has one printing press, one binding machine and the manuscript of
selects a coin without the knowledge of the others choice. If the sum of the coin is an odd
a) A and B play a game in which each has three coins a 5p,a 10p and 20p.Each player
b) Mini Computer Company purchases a component of which it has a steady usage of 1000
the component supplier agrees to offer price discounts of minimum lot supplies as per
for each book are given below. Determine the order in which book should be processed,
units per year. The ordering cost is Rs.50 per order. The estimated cost of money invested
number of different books. The time required to perform the printing and binding operation
in order to minimise the total time required to turn out all the books. Also find the idle time
policy and total cost of inventory system, including purchase cost of the components. If
amount, A wins B’s coin; if the sum is even, B wins A’s coin. Find the best strategy for
schedule given below, reassess the decision on optimal ordering policy and total cost.
is 25% per year. The unit cost of the component is Rs.40.Calculate the optimal ordering
47 25 EF 01 0C 24 5A 5B 37 DC 31 89 47 25
42 7E 01 30 72 05 5 37 5D 3 18 14 42 7E
57 F0 30 C7 40 A B3 5D C3 11 91 74 57
EF 13 C 24 5A 5B 75 C 11 89 47 25 EF
01 0C 724 05 5B 37 DC 31 89 147 425 7E
30 72 05 A5 3 5D 3 18 14 42 7E F0
C7 40 A B3 75 C 11 91 74 57 F 1
24 5A 5B 75 DC 311 891 47 25 EF 013
05 5B 37 D 31 89 47 42 7E 01
A5 3 5D C3 18 14 4 57 F0 30
5 5B 37 D 3 18 1 74 57 EA
5A A5B 375 5DC C31 1189 914 4742 257 EA E07
5 37 D 3 18 1 74 5 EA E0 9
5B B37 5DC C31 118 914 4742 257 7EA E0 79C C72
5 9 7 4
B3 375 DC 311 189 147 7425 57E EAE E07 9C7 724 05A
7 5 D C 3 1 8 1 4 4 2 7 A 0 7 9 C 2 0
9
37 D 31 18 14 74 57 EA E0 9C 72 405 5A5 5B3
5 C 1 9 7 25 E E 7 7 4 A B 7
5D DC3 3118 891 1474 425 7EA AE0 079 9C7 240 05A 5B 375 5DC
C 1 9 4 2 7 7 C 2 3
DC 31 189 14 742 57 EA E07 9C 72 405 5A5 5B3 75D DC3 311
3 1 1 7 4 5 E A E 9 7 4 0 A B 7 1 8
C3 11 891 474 25 7EA E 079 C7 240 5A 5B 375 5DC C31 189 914
8 4 7 0 C 2 5 5 3 D 1 7
N:B
31 1189 914 742 257 EA E07 79C 724 405 A5 B37 75D C3 3118 891 1474 425
78262
18 14 74 57 EA E0 9C 72 05 A5 B3 5D C 11 91 47 25 7E
E
B
Q.1
D
C
A
18 914 74 257 EA E0 79C 72 405 A5 B3 75D C 311 891 47 425 7E AE
9 7 25 E E 79 7 4 A B 7 31 8 4 4 7 A 0
91 1474 425 7EA AE0 079 C7 240 05A 5B 375 5DC C31 189 9147 742 257E EAE E07 79C
47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72
42 7E AE 07 C 24 05 5B 37 5D 3 18 91 74 57 EA E0 79 72 40
57 A 0 9C 72 05 A5 3 5D C3 11 91 47 25 E E 79 C7 40 5A
EA E0 79 72 40 A B3 75 C 11 89 47 42 7E AE 07 C7 24 5A 5B
E0 79C C72 40 5A 5B3 75 DC 311 89 147 42 57E AE 07 9C7 24 05A 5B 37
business?
79 7 40 5A 5B 75 DC 31 89 147 42 57E AE 07 9C 24 05 5B 37 5D
C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72 05 A5 3 5D C3
24 05A 5B 37 5D 31 18 914 74 57 EA E0 79C 72 405 A5 B3 75D C 11
05 5 37 5D C3 18 91 74 25 EA E0 79 7 40 A B 75 C 31 89
A5 B3 5D C 11 91 47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14
B3 75 C 311 89 47 425 7E AE 07 C7 24 05A 5B 37 5D 31 18 914 74
Attempt any four
75 DC 311 89 147 42 7E AE 07 9C 24 05A 5B 37 5D C3 18 914 74 257

DC 31 89 14 42 57 A 07 9C 72 05 5 3 5D C3 11 91 74 25 EA
31 189 14 742 57 EA E07 9C 724 405 A5 B37 75D C3 118 891 474 25 7EA E0
18 14 74 57 EA E0 9C 72 05 A5 B3 5D C 11 91 47 25 7E E 79
91 74 25 EA E0 79 7 40 A B 75 C 31 89 47 42 7E AE 07 C
47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72
42 7E AE 07 C 24 05 5B 37 5D 3 18 91 74 57 EA E0 79 72 40
57 A 0 9C 72 05 A5 3 5D C3 11 91 47 25 E E 79 C7 40 5A
EA E0 79 72 40 A B3 75 C 11 89 47 42 7E AE 07 C7 24 5A 5B
(1) Question 1 is Compulsory.
E0 79C C72 40 5A 5B3 75 DC 311 89 147 42 57E AE 07 9C7 24 05A 5B 37

79 7 40 5A 5B 75 DC 31 89 147 42 57E AE 07 9C 24 05 5B 37 5D
C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72 05 A5 3 5D C3
24 05A 5B 37 5D 31 18 914 74 57 EA E0 79C 72 405 A5 B3 75D C 11
05 5 37 5D C3 18 91 74 25 EA E0 79 7 40 A B 75 C 31 89
A5 B3 5D C 11 91 47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14
taken to control information security.

B3 75 C 311 89 47 425 7E AE 07 C7 24 05A 5B 37 5D 31 18 914 74
B Design MIS for the Educational System

75 DC 311 89 147 42 7E AE 07 9C 24 05A 5B 37 5D C3 18 914 74 257
DC 31 89 14 42 57 A 07 9C 72 05 5 3 5D C3 11 91 74 25 EA
Time: 3 Hours
(3) Figures to the right indicate full marks.
31 189 14 742 57 EA E07 9C 724 405 A5 B37 75D C3 118 891 474 25 7EA E0
18 14 74 57 EA E0 9C 72 05 A5 B3 5D C 11 91 47 25 7E E 79
91 74 25 EA E0 79 7 40 A B 75 C 31 89 47 42 7E AE 07 C
B Discuss the Impact of BI on Decision Making.

47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72
****************
42 7E AE 07 C 24 05 5B 37 5D 3 18 91 74 57 EA E0 79 72 40
57 A 0 9C 72 05 A5 3 5D C3 11 91 47 25 E E 79 C7 40 5A
Q.6 A Define CRM. Describe the different types of CRM

EA E0 79 72 40 A B3 75 C 11 89 47 42 7E AE 07 C7 24 5A 5B
(2) Attempt any three from the remaining questions.
E0 79C C72 40 5A 5B3 75 DC 311 89 147 42 57E AE 07 9C7 24 05A 5B 37

Q.2 A List the types of Information system? Explain in brief
Define Big Data and discuss its basic characteristics?
79 7 40 5A 5B 75 DC 31 89 147 42 57E AE 07 9C 24 05 5B 37 5D
C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72 05 A5 3 5D C3
C72405A5B375DC311891474257EAE079
24 05A 5B 37 5D 31 18 914 74 57 EA E0 79C 72 405 A5 B3 75D C 11
Describe how social computing inspires customer service
05 5 37 5D C3 18 91 74 25 EA E0 79 7 40 A B 75 C 31 89
A5 B3 5D C 11 91 47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14
B3 75 C 311 89 47 425 7E AE 07 C7 24 05A 5B 37 5D 31 18 914 74
Explain the Ethical issues and threats of information security?
75 DC 311 89 147 42 7E AE 07 9C 24 05A 5B 37 5D C3 18 914 74 257

B Discuss competitive advantage achieved in Information System
DC 31 89 14 42 57 A 07 9C 72 05 5 3 5D C3 11 91 74 25 EA
31 189 14 742 57 EA E07 9C 724 405 A5 B37 75D C3 118 891 474 25 7EA E0
18 14 74 57 EA E0 9C 72 05 A5 B3 5D C 11 91 47 25 7E E 79
Q.5 A Discuss the significance of social computing in marketing in detail

91 74 25 EA E0 79 7 40 A B 75 C 31 89 47 42 7E AE 07 C
47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72
B What are the functional areas of Information system. Explain in detail

42 7E AE 07 C 24 05 5B 37 5D 3 18 91 74 57 EA E0 79 72 40
57 A 0 9C 72 05 A5 3 5D C3 11 91 47 25 E E 79 C7 40 5A
Differentiate between computer network wired and wireless technology
Paper / Subject Code: 42159 / Management Information Systems
EA E0 79 72 40 A B3 75 C 11 89 47 42 7E AE 07 C7 24 5A 5B
E0 79C C72 40 5A 5B3 75 DC 311 89 147 42 57E AE 07 9C7 24 05A 5B 37
79 7 40 5A 5B 75 DC 31 89 147 42 57E AE 07 9C 24 05 5B 37 5D
Q.3 A Explain the architecture of Data mart and Data warehouse in an organization
C7 24 5A 5B 37 DC 31 18 14 42 57 A 0 9C 72 05 A5 3 5D
Q.4 A What are the potential benefit of social commerce to the customers and to the
What is information system? Explain the necessary element with neat diagram
24 05A 5B 37 5D 31 18 914 74 57 EA E0 79C 72 405 A5 B3 75D C

05 5 37 5D C3 18 91 74 25 EA E0 79 7 40 A B 75 C 3
B What are major security threats to the information system? Discuss the measures
A5 B3 5D C 11 91 47 25 7E E 79 C7 24 5A 5B 37 DC 31
B3 75 C 311 89 47 425 7E AE 07 C7 24 05A 5B 37 5D 31 1
75 DC 311 89 147 42 7E AE 07 9C 24 05A 5B 37 5D C3 18
DC 31 89 14 42 57 A 07 9C 72 05 5 3 5D C3 11
Marks: 80
31 189 14 742 57 EA E07 9C 724 405 A5 B37 75D C3 118 891

18 14 74 57 EA E0 9C 72 05 A5 B3 5D C 11 91
91 74 25 EA E0 79 7 40 A B 75 C 31 89 4
47 25 7E E 79 C7 24 5A 5B 37 DC 31 18 14
10M
10M
10M
10M
10M
10M
10M
10M
10M
10 M
10 M
42 7E AE 07 C 24 05 5B 37 5D 3 18 91 74
57 A 0 9C 72 05 A5 3 5D C3 11 91 47
EA E0 79 72 40 A B3 75 C 11 89 47 42
E0 79C C72 40 5A 5B3 75 DC 311 89 147 42
5*4=20M
79 7 40 5A 5B 75 DC 31 89 147 42 57
C7 24 5A 5B 37 DC 31 18 14 42 57
24 05A 5B 37 5D 31 18 914 74 57 E
05 5 37 5D C3 1 91 74 25 EA

Cs Besem7 QP 2019 December Cbcs

Uploaded by

Copyright:

Available Formats

Cs Besem7 QP 2019 December Cbcs

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Cs Besem7 QP 2019 December Cbcs

Uploaded by

Copyright:

Available Formats

B B 26 4 0D 49 6 96 AD 8C

BC CBC C26C C4F F0D 549 36B B96 AD 18C 67E

Explain Image segmentation.

(ii) Find the IDFT of X(k) = {1,0,1,0}

Determine radix 2 DIT-FFT Flow graph for

54 36 B96 AD 18 67 E4 66 BC BC 26 4F 0D 549 36B 96 D 8C 67 41

(i) Find the 4 point DFT of x(n) = {1,-1,2,-2}

x(n) = {1,4,7,8} and y(n) ={2,0,1,3}

(i) Find the cross correlation of the causal sequences

(ii) Determine whether the following system is linear or non linear

Point processing techniques are called as Zero memory operations

18 C67 E4 166 FBC CBC 26 C4F 0D 549 36B 96

18 C67 E4 166 FBC CBC 26 C4F 0D 549 36B 96

Write short note on:

2. Operating system security

Describe session hijacking in detail.

3. Federated Identity Management

2. Solve any THREE from Question No. 2 to 6.

Explain salami attack and linearization attack.

Explain bell-La Padula model with neat diagram.

Explain possible attacks on wireless LAN in detail.

Describe incident response methodology with diagram.

Explain in details wireless security offered by 802.11 with neat diagram.

0D 689 33 44 62 427 163 A4 13 477 425 A4 0D 89 38 442

68 33 844 262 427 16 A4 613 47 42 A4 0D 689 338 44

2) Structure of the Web

1) Hubs and Authorities

68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13

clustering algorithm in detail.

68 33 844 281 902 16 A4 613 47 42 A4 0D 689 338 442 81 02 63 A4 13

Reduce execution pipeline with Word count example.

Girvan Newman algorithm finds the different communities.

What is Hadoop? Describe HDFS architechure with diagram.

example working of an Flajolet – Martin Algorithm used to count number of

What are the challenges in clustering of Data streams. Explain stream

What is the role of JobTracker and TaskTracker in MapReduce.Illustrate Map

h(5)=10, h(6)=10, h(S)=15.

29 6E 689 A2 575 8D 17 D7 65 348 366 DA 52 96 68 9A 257 58D 61 D7

89 25 75 D6 17D 7D 65 48 66 A 29 96E 68 A2 575 8D 617 D7 6 34

Design a Mc-Culloh Pitts model for XOR Gate.

A5 299 6E 89 A2 75 D6 17 7D 65 48 366 DA 529 96E 68 9A 57 8D 617

57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483 66D

its missiles were sold to it by Colonel West, who is American.

17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836

Hill Climbing algorithm

(d) Wumpus world knowledge base

Different types of Neural Networks

Write Short notes on following (Any Four)

57 8D 61 D7 D6 34 836 6D 52 99 E6 89A 25 58 61 7D 7D 53 483

17 7D 65 348 366 DA 52 96 68 9A 57 58D 61 D7 D6 534 836

Q1] Solve any four

Q 2] a] Explain in detail GSM architecture.

98 9F 53 32 231 44 74 BC 2C C9 909 69D 29 8B F5 D3 22 14 C7 4B

Q 5] a] Explain Bluetooth protocol stack in detail.

B] Explain concept of frequency reuse with clustering.

99 096 9D 98 B9F 53 32 231 44C 74 BC E2C C9 909 69D 29 8B F5 3D3 22

Q 4] a] Explain DSDV routing protocol used in ad-hoc network.

B] Explain various nodes present in E-UTRAN architecture.

B] How is packet delivery achieved to and from mobile node?