Study Timetable (April 20 - May 12)

April 20 - April 25 (6 Days Focus on Distributed Computing)

Distributed Computing

 Day 1 (April 20): Introduction to Distributed Systems

o Components, Challenges, and Types

 Day 2 (April 21): Parallel Computing and Architectures

o Client-Server, Peer-to-Peer, Parallelism Types

 Day 3 (April 22): Communication in Distributed Systems

o MPI, RPC, Consistency Models

 Day 4 (April 23): Synchronization and Fault Tolerance

o Locks, Semaphores, Deadlock, Replication, Redundancy

 Day 5 (April 24): MapReduce and Big Data

o Hadoop, Data Processing, Efficiency

 Day 6 (April 25): Distributed Databases and Cloud Computing

o NoSQL, CAP Theorem, Virtualization

April 26 - April 29 (4 Days Focus on Deep Learning)

Deep Learning

 Day 7 (April 26): Neural Networks and Optimization

o Perceptron, Backpropagation, Activation Functions

 Day 8 (April 27): Types of Neural Networks

o CNN, RNN, LSTM

 Day 9 (April 28): Regularization and Transfer Learning

o Dropout, Fine-tuning, Pre-trained Models

 Day 10 (April 29): Evaluation Metrics and Final Review

o Accuracy, Precision, Recall, F1 Score

April 30 - May 3 (4 Days Focus on Social Media Analytics)

Social Media Analytics

 Day 11 (April 30): Introduction to Social Media Analytics

o Metrics, Importance, and Tools

 Day 12 (May 1): Paid vs Organic Analytics

o Campaigns, Engagement, Reach Metrics

 Day 13 (May 2): Influencer Marketing and Social Listening

o Sentiment Analysis, Evaluating Campaigns

 Day 14 (May 3): Content Performance and Real-Time Analytics

o Analyzing Viral Content, Trend Monitoring

May 4 - May 7 (4 Days Focus on Project Management)

Project Management

 Day 15 (May 4): Project Basics and Scope

o Stakeholders, Project Lifecycle

 Day 16 (May 5): Scheduling and Work Breakdown Structure (WBS)

o Gantt Charts, PERT, Critical Path

 Day 17 (May 6): Resource Allocation and Risk Management

o Risk Identification, Mitigation Strategies

 Day 18 (May 7): Agile Methodology and Final Review

o Scrum, Kanban, Sprints

May 8 - May 12 (Revision Phase)

May 8 (Day 19): Distributed Computing

 Review key topics, algorithms, synchronization, and fault tolerance.

May 9 (Day 20): Deep Learning

 Review neural networks, optimization, evaluation metrics, and regularization.

May 10 (Day 21): Social Media Analytics

 Review content performance analysis, influencer marketing, and tools.

May 11 (Day 22): Project Management

 Review WBS, scheduling, risk management, and Agile methodology.

May 12 (Day 23): General Revision for all subjects

 Go over any difficult areas or concepts and practice last-minute key points.
 40

A0
5C
0

5
73

5C
Paper / Subject Code: 52756 / Institute Level Optional Course-II - Project Management

61

2F

E1
75

01
07

40

5C

C5
5B

1A
73

61

2F

15
DC

75

CE
07

40

A0
5B
78

73

5
61

2F

E1
C
7D

5
(3 Hours) (80 marks)

7
7
8D

40

5C
0
B
D6

73

61
5
7

F
C
7D

75
C5

CE
02
07
N.B.: (1) Q. No. 1 is compulsory

14
6
15

78

F5
D

C5
(2) Answer any THREE questions from the remaining questions.

76
A0

75
5

02
8D
C
(3) Figures to the right indicate full marks.

30
5B
E1

4
D6
15

61
D7

7
(4) Illustrate answers with neat sketches where ever required.

DC
A0
5C

5
C5

07
7
7

B
2F

E1

D6
5

73

1
C5
01

7
1. Write short note on. (Any Four) 20

40

6
C

75
5

7
A

D
5C
5

67
61

30
(a) Triple constraints

5B
2F

E1

78
D
1
07

57
40

DC
0
(b) Work Breakdown structure (WBS)

5C

7D
C5
1A
73

B7
61

6
(c) Scope creep

15

78
75

CE
02

5D

C5
07

7D
(d) GANTT chart
5B

14

1A
3

8D
5C
F5
7

B
D6
76
(e) Goldratt's critical chain
DC

E
2

C5
1

D7
7

A0
5C
0

5
5B

(f) Lessons learned analysis

4
78

73

8D
5C

67
1

2F

E1
6
C
7D

5D
1

D7
07
7
D

40

A0
5C
B
D6

78

2. (a) Describe PM knowledge areas as per Project Management Institute (PMI) 10

3

5C

67
61
C5

57

2F

E1
7D
C5

5D
in brief.

01
7

.in
7
8D

40

C
30
B
6
15

1A

5C
F5
(b) Explain process for Project portfolio and Project Charter. 10

61
5D

5
7

7
DC
A0

CE
02

01
07
B7
5C

7
E1

4
D6

1A
8

73

F5
3. (a) The time estimates in weeks for the activities of a PERT network are given 10

61
C5
01

7
5C

7D

5
C5

CE
02
es
07
1A

7
8D

in Table below: 5B
2F

14
D6
5

73

F5
CE

01

D7

Activity Optimistic time Most likely time Pessimistic time

40

6
DC

75
5

02
7
A

C
F5

67

(to) (tm) (tp)

61

30
5B
E1

14
5

78
02

5D
1
07

57

76
DC
ot
0

A-B 1 1 7
5C

D
14

1A
73

B7
5C

30
2F

D6

78
76

A-C 2 5 8
75

CE

5
01

57
40

DC
7D
30

C5
5B

1A

B7
5

A-D 2 2 8
61
57

2F

6
un
15

78
DC

5D

C5
07
B7

0
C

C-E 3 6 15
4

A
78

73

8D
C
5

67
61
C5

2F

E1

5
7D

75

D-E 1 4 7
5D
1

D7
07
8D

40

0
C
5B
D6

1A
73

5C
F5

67
61

E-F 2 5 14
D7

m
DC

75

E
2

5D
01
7

40
67

5C
30
5B

B-F 2 5 8
1A
78

5C
61
D

2F
DC
7D

5
C5

CE

01

(i) Draw the network diagram.

07
B7

0
14
D6
15

1A
78

F5

(ii) Calculate the earliest start (ES) and latest start (LS) for all the
C5

57

6
A0

7D
C5

CE
2
7

activities.
7
8D

40
30
5B
D6
15

F5
61

(iii) Determine the project completion time.

D7

7
DC
A0

75
C5

02
07

(iv) Calculate the standard deviation and variance of the project.

67

B
1

14
15

73
CE

5D

C5
D7

(b) Explicate the Top down and bottoms up budgeting approach for a large 10
76
A0

5
B7
8D
5C
F5

67

project.
30
1
CE
02

5D

5
01

D7

57
DC
A

B7
5C
F5

67
E1

78
02

5D

C5
01
5C

7D
14

8D
5C
2F

E1

D6
76

01

D7
40

5C
30

C5
A

67
61
57

2F

E1

15

5D
07

40

A0
5C
73

5C
61

2F

E1
75

01
07

40

5C
5B

1A
73

61

14381 Page 1 of 2
2F
DC

75

CE
07

40
5B
78

73

F5
61
DC

75

02
07
5B

7D78DC5B75730761402F5CE1A015C5D6
14
78

73
 40

A0
5C
0

5
73

5C
Paper / Subject Code: 52756 / Institute Level Optional Course-II - Project Management

61

2F

E1
75

01
07

40

5C

C5
5B

1A
73

61

2F

15
DC

75

CE
07

40

A0
5B
78

73

5
61

2F

E1
C
7D

5
4. (a) Tabulate with example, the Risk response strategies for positive and 10

7
7
8D

40

5C
0
B
D6

73
negative risks in project management.

61
5
7

F
C
7D

75
C5

CE
02
07
(b) The total normal direct cost of a project is Rs 450 and its indirect cost is 10

14
6
15

78

F5
D

C5
Rs 400. By crashing the activities, the indirect cost decreases by Rs 50 per

76
A0

75
5

02
8D
C
day. The normal and crash costs with time are given in Table and the

30
5B
E1

4
D6
15

61
D7

7
network diagram in Figure given below. Find the optimum project

DC
A0
5C

5
C5

07
7
7
duration.

B
2F

E1

D6
5

73

1
C5
01

7
40

6
C

75
5

7
A

D
5C
5

67
61

30
5B
2F

E1

78
D
1
07

57
40

DC
0
5C

7D
C5
1A
73

B7
61

6
15

78
75

CE
02

5D

C5
07

7D
5B

14

1A
3

8D
5C
F5
7

B
D6
76
DC

E
2

C5
1

D7
7

A0
5C
0

5
5B

4
78

73

8D
5C

67
1

2F

E1
6
C
7D

5D
1

D7
07
7
D

40

A0
5C
B
D6

78

5C

67
61
C5

57

2F

E1
7D
C5

5D
01
7

.in
7
8D

40

C
30
Activity Normal Crash
B
6
15

1A

5C
F5
61
5D

5
7

7
Time Cost Time Cost
DC
A0

CE
02

01
07
B7
5C

A 3 50 2 70
E1

4
D6

1A
8

73

F5
61
C5
01

7
5C

7D

5
C5

B 6 80 4 160

CE
02
es
07
1A

7
8D

5B
2F

14
D6
5

73
C 10 60 9 90

F5
CE

01

D7
40

6
DC

75
5

02
7
D 11 50 7 150
A

C
F5

67
61

30
5B
E1

14
5

78

E 8 100 6 160
02

5D
1
07

57

76
DC
ot
0
5C

D
14

1A
73

B7
5C

F 5 40 4 70
7

30
2F

D6

78
76
75

CE

5
01

57
G 6 70 6 70
40

DC
7D
30

C5
5B

1A

B7
5
61
57

2F

6
un
15

78
DC

5D

C5
07
B7

0
C

D
4

A
78

73

8D
C
5

67
61
C5

2F

E1

5
7D

75

5. (a) Explicate Earned Value Management techniques for measuring value of 10

5D
1

D7
07
8D

40

0
C
5B
D6

1A

work completed in the concerned project.

73

5C
F5

67
61
D7

m
DC

How ethics in projects are looked upon for successful government’s

75

E
2

5D

(b) 10
01
7

40
67

5C
30
5B

1A
78

5C

project completion? Illustrate with suitable example.

61
D

2F
DC
7D

5
C5

CE

01
07

6. (a) What are the four stages for team development and growth? Enlist the 10
B7

0
14
D6
15

1A
78

F5

barriers for effective team management.

C5

57

6
A0

7D
C5

CE
2
7
7
8D

(b) Discuss the reasons of project termination. Describe Process of project 10

40
30
5B
D6
15

F5
61
D7

termination.
7
DC
A0

75
C5

02
07
67

B
1

14
15

73
CE

5D

C5
D7

-----------------------------
76
A0

5
B7
8D
5C
F5

67

30
1
CE
02

5D

5
01

D7

57
DC
A

B7
5C
F5

67
E1

78
02

5D

C5
01
5C

7D
14

8D
5C
2F

E1

D6
76

01

D7
40

5C
30

C5
A

67
61
57

2F

E1

15

5D
07

40

A0
5C
73

5C
61

2F

E1
75

01
07

40

5C
5B

1A
73

61

14381 Page 2 of 2
2F
DC

75

CE
07

40
5B
78

73

F5
61
DC

75

02
07
5B

7D78DC5B75730761402F5CE1A015C5D6
14
78

73
 7
E

3A
0

95

2
29
Paper / Subject Code: 52752 / Distributed Computing

A7
F6

79
17

E5

3A
90

95
85

2
2

A7
72

F6

79
41

E5
51

3A
90

95
DC

2
(3 Hours) [Total Marks: 80]

18

72

F6

79
E5
F3
Instructions:

51

90

95
DC

2
0C

18

72

F6

1
E5
F3
3D

51

90

95
N.B. : (1) Question No 1 is Compulsory.

DC

2
0C
2

18

72

F6

1
A7
(2) Attempt any three questions out of the remaining five.

E5
F3
3D

51

90
DC
3A

2
0C
(3) All questions carry equal marks.

18

72

F6
A7

F3
79

3D

4
(4) Assume suitable data, if required and state it clearly.

51

90
DC
3A
95

0C
2

18

72
A7
51

F3
79

3D

51
DC
2E

3A
Attempt any 4 questions out of 6. Each question carries 5 marks.

9
95
Q1.

0C
2

18

72
A7
F6

51

F3
79

3D

51
a) Compare between DOS, NOS and Middleware.

DC
2E

3A
90

95

0C
2

18
A7
72

F6

51
b) Explain with the diagram Dispatcher-Worker thread model.

F3
79

3D

4
DC
51

2E

3A
90

95

0C
2
c) Explain happens before relation with its features.
18

A7
72

F6

51

F3
79

3D
d) Explain naming in a distributed system.
4

DC
51

2E

3A
90

95

0C
DC

2
18

A7
e) Compare caching and replication. 72

F6

51

F3
79

3D
F3

51

2E

3A
90

95

0C
DC

f) Explain stream - oriented communication.

2
0C

18

A7
72

F6

51

79

3D
F3
3D

51

2E

3A
90

95
DC

2
0C
72

18

A7
72

F6

51

79
Q2. Each question carries 10 marks.
F3
3D

.in
AA

51

2E

3A
90

95
DC
0C
2

18

72

F6

51
93

79
A7

i. Explain in detail Raymond’s Tree-Based algorithm (Token-based algorithm).

F3
3D

51

2E
90
57

95
DC
3A

0C
2

18

72
19

F6

51
A7

ii. Write a note on the Network File System (NFS) .

F3
79

3D

4
es
51
E5

2E
90
DC
3A
95

0C
2

18

72
62

F6
A7
51

F3
79

3D

51
0F

90
DC
2E

3A
95

0C
72

18
Each question carries 10 marks.
29

72
Q3.
F6

51

F3
79

3D
ot
AA

4
17

51
DC
2E
90

95

0C

i.
85

72

Write note on Andrew File System (AFS) .

18
93
72

F6

51

F3
3D
41

AA

C4
57
51

2E
90

0C

ii.
DC

Explain steps involved in the RMI execution process in detail.

2

3D
un 19

93
18

A7
72

F6

3D
E5
F3

CF
57
C4

51

3A
90

72
62
C

19

D0
18
3D

72

79
D0

AA
0F

E5

Each question carries 10 marks.

C4

Q4.
51

23
CF

95
23

29

62

93
18

A7
m
3D

51
D0

17

i.
0F

57

What is Remote Procedure Call?Explain the working of RPC in detail.

C4

2E

3A
CF
23

85

29

19
3D

F6

79
D0
A7

41

ii.
17

E5

Explain different types of distributed systems with diagrams.

90
CF

95
DC
23

85
3A

62
72

1
D0
A7

41

0F

E5
F3
79

51
DC
23
3A

29
95

62
0C

18

Q5. Each question carries 10 marks.

A7

17

0F
F3
79

3D

C4

85
3A

29
95

0C

i.
72

3D

Explain with diagrams various client-centric consistency models.

41

17
51

79

3D
AA

CF

DC

85
2E

95

ii.
72

Compare static and dynamic load balancing algorithms.

93

D0

41
F6

51

F3
AA
57

DC
23
2E
90

0C
19

93

A7
F6

F3
3D
E5

57

Q6. Each question carries 10 marks.

3A
90

0C
72
62

19
72

79

3D
AA
0F

E5

i. Explain with an example load sharing approach.

51

95

72
29

62

93
18

51

AA
17

0F

ii.
57

Explain any one election algorithm in detail with suitable example.

C4

2E
85

29

19

93
F6
41

________________________
17

E5

57
90
DC

85

62

19
72
41

0F

E5
F3

51
DC

29

62
0C

18

17

0F

12391 Page 1 of 1
F3
3D

C4

85

29
0C

3D

41

17
3D

CF

3D0CF3DC418517290F62E5195793AA72
DC

85
 B
FC C1F 13F F4B 2A 267 7CB B6C C11 E91 133
1F 13F 4B 2A 26 CB 6C 11 E91 33 27F
1
1F 3F 4B 2A 26 7CB 6C 11 E91 33 27F 39
7 E 2 8
F1 13F 4B2 2A2 267 CB 6C1 11E 913 332 7F3 398 EFC
3 4 B A 6 C 6 C 1 9 3 7 9 E
13 F4B 2A 26 7C B6C 11 E9 133 27 F39 8E FC 1F1
F 2 2 7 B 1 E 1 2 F3 8 F 1F 3
F4 4B2 A2 67C CB6 6C1 1E9 913 3327 7F3 98E EFC C1F 13F F4B
B A 6 C 1 3 9 1
4B 2A 267 7CB B6C 11 E91 133 27F F39 8EF FC1 1F1 3F4 4B2 2A2
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C
2A 26 7CB 6C 11 E9 133 27F 39 8E FC1 F1 3F4 B2 A2 67C B
7 1 F 6
A2 267 CB 6C 11E E91 332 27F 398 8EF C1F F13 3F4B B2A A26 67C B6 C11
6 C 6 C 1 1 9 3 3 7 F 3 9 E C 1 1 F 2 2 7 B C
26 7C B6C 11 E9 133 27 39 8E FC F1 3F 4B2 A2 67 CB 6C1 11E E91
7 B 1 E 13 2 F3 8 F 1F 3 4B A 6 C 6C 1 9 33
7C CB6 6C1 1E9 913 327 7F3 98E EFC C1F 13F F4B 2A 267 7CB B6C 11E E91 133 27F

7.
6.
2.

5.
4.
3.
1.
Q1.
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E

Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC
91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F Option A:
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67

mean?
C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1

Deliverable
Time: 2 hour 30 minutes

4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E

Work package
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913 m
26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32

two sets of flows.

7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F
Scope, Cost, Time

Bottoms up budget

laddering approach
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E

Responsibility matrix
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC

is likely to be following
Concurrent Engineering

Goldratt's Critical Chain

91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
Cost, Human Resource, Time

98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2
un
Scope, Human Resource, Time

EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67

The payback period for a project

Quality, Scope, Human Resource

C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB

Research and Development Project

They consume maximum resources
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1
4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913
compulsory and carry equal marks

26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32
Which is an example of Triple Constraint?

ot
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F

These are most complex activities on project

They cannot tolerate any delay in completion
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39

discounting them by the required rate of return

The project is behind schedule and over budget

C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E
The project is behind schedule but under budget
The project is ahead of schedule but over budget

1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC

A risk is known as Positive risk or opportunity if-

The project is ahead of schedule and under budget

They represent maximum project completion time

91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F

Impact is positive which you may want to actualize

Impact is negative which you may want to actualize
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
es
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
University of Mumbai
Examinations Summer 2022

Impact is positive which you want to lessen its impact

Impact is negative which you want to lessen its impact
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2

F398EFC1F13F4B2A267CB6C11E913327
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67
C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1
.in
The lowest element in the hierarchical breakdown of the WBS is
4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913
26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
Why does activities on critical path of a CPM network are called critical

C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC
91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4
98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B
C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 2

When many activities are planned to start at the same time in project schedule, the project

is the initial fixed investment in the project divided by the estimated annual net cash
your sponsor has asked for performance reports on a monthly basis. At the end of the first
Choose the correct option for following questions. All the Questions are

is the discounted cash flow method determines the net present value of all cash flows by
You are responsible for a project with high risks particularly during the early phases -

is the internal rate of return that is the discount rate that equates the present values of the
month you report a CPI greater than 1 and also the SPI greater than 1. What would this
Max. Marks: 80

4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2
=====================================================================

1|Page
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67
26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 C
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6
91 32 7F 98 EF C1 13 F4 2A 26 7C B6
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1
27 39 8E C F1 3F B A 67 B C
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11
98 F 1F 13 4B 2A 26 7C 6C 11
EF C1 13 F4 2 2 7C B6 1 E9
C F F B A 6 B C 1
 B
FC C1F 13F F4B 2A 267 7CB B6C C11 E91 133
1F 13F 4B 2A 26 CB 6C 11 E91 33 27F
1
1F 3F 4B 2A 26 7CB 6C 11 E91 33 27F 39
7 E 2 8
F1 13F 4B2 2A2 267 CB 6C1 11E 913 332 7F3 398 EFC
3 4 B A 6 C 6 C 1 9 3 7 9 E
13 F4B 2A 26 7C B6C 11 E9 133 27 F39 8E FC 1F1
F 2 2 7 B 1 E 1 2 F3 8 F 1F 3
F4 4B2 A2 67C CB6 6C1 1E9 913 3327 7F3 98E EFC C1F 13F F4B
B A 6 C 1 3 9 1
4B 2A 267 7CB B6C 11 E91 133 27F F39 8EF FC1 1F1 3F4 4B2 2A2
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C
2A 26 7CB 6C 11 E9 133 27F 39 8E FC1 F1 3F4 B2 A2 67C B
7 1 F 6
A2 267 CB 6C 11E E91 332 27F 398 8EF C1F F13 3F4B B2A A26 67C B6 C11
6 C 6 C 1 1 9 3 3 7 F 3 9 E C 1 1 F 2 2 7 B C
26 7C B6C 11 E9 133 27 39 8E FC F1 3F 4B2 A2 67 CB 6C1 11E E91
7 B 1 E 13 2 F3 8 F 1F 3 4B A 6 C 6C 1 9 33

C
B
C
B
C
B

A
A
A
7C CB6 6C1 1E9 913 327 7F3 98E EFC C1F 13F F4B 2A 267 7CB B6C 11E E91 133 27F

9.
8.

10.

Q4
Q3
Q2
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E

Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option D:
Option A:
Option D:
Option A:
Option D:
Option A:
Option D:

1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC

91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67
SPI > 1
CPI > 1

C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB

F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1
4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913

Failed projects
CPI less than 1

Normal closure
m
CPI and SPI > 1

26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F

Abnormal closure
Premature closure

team effectiveness?
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC
91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
inflows from the project.

33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
A project is over budget when

98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2
un
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67
C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1
is also known as the benefit–cost ratio

4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913

technical reasons for project termination?

26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32
ot

Solve any Two Questions out of Three

Solve any Two Questions out of Three
Solve any Two Questions out of Three
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39

risks (threats) and positive risks(opportunities)?

adopted in project management for negotiations

Select the correct statement from the following

C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC
91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
es
There is always only one critical path in the network

27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2
Slack or float of dummy activity is always equal to zero
Crashing cost linearly increases with no of days crashed

98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B A2

F398EFC1F13F4B2A267CB6C11E913327
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B 2A 67

this project in 11 days after carrying out resource levelling?

Project closure when the project is completed as planned is

the status of the project based on your earned value analysis.

C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2A 26 CB
F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A 26 7C 6C
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 26 7C B6 1
.in
4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67C B C1 1E 913
26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67 B 6C1 1E 91 32

project? What are types of project audits based on the depth of audit?
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 CB 6C 1E 91 33 7F
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB 6C 11 91 33 27F 39
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB 6C 11 E9 33 27F 39 8E
A path is called a critical path if it is the longest path in a project network

1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6C 11 E9 133 27 39 8E FC

Differentiate between the Functional, Pure Project and Matrix organizations.

91 32 7F 98 EF C1 13 F4 2A 26 7C B6 1 E9 13 27 F3 8E FC 1F
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1 1E 13 32 F3 98 FC 1F 13
27 39 8E C F1 3F B A 67 B C 1E 91 32 7F 98 EF 1 13 F4
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11 91 33 7F 39 EF C1 F1 F4
List and briefly describe the ways projects may be terminated. What are some non-

98 F 1F 13 4B 2A 26 7C 6C 11 E9 33 27 39 8E C F1 3F B
EF C1 13 F4 2 2 7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B
What is crashing of the project? Explain with a small example the process of crashing

C1 F1 F4 B2 A2 67C B6 C1 1E 13 32 F3 98E FC 1F 13F 4B 2

F1 3F B2 A2 67 B C1 1E 913 32 7F3 98 FC 1F 13 4B 2A
Explain Probability and impact matrix. What are the risk response strategies for negative

What does project audit tries to find out? How do project audit recommendations help the
3F 4B A 67 CB 6C 1E 91 32 7F 98 EF 1 13 F4 2A 2

10 marks each
10 marks each
10 marks each

cost and schedule variances for the project? What is the SPI, CPI and CSI? Comment on
Draw resource loading diagram for the following project. Adjusting the activity floats, and

spent Rs.260,000/-. For the work performed the budgeted value is Rs. 272,000/-. What are
level the resources to the best possible loading. How many men are required to complete

Why negotiations are important in Project Management? Why Win-Win strategy is

Explain stages of team development and growth? What are advantages of and barriers to

A project in its 26th week has an actual cost of Rs.270,000/-. It was scheduled to have
4B 2A 267 CB 6C 11 91 33 7F 39 EF C1 F1 F4 B2 2

2|Page
2A 26 CB 6C 11 E9 33 27F 39 8E C1 F1 3F4 B2 A2 67
26 7C 6C 11 E9 133 27 39 8E FC F1 3F B2 A2 67
7C B6 1 E9 13 27 F3 8E FC 1F 3F 4B A 67 C
B6 C1 1E 13 327 F3 98E FC 1F 13F 4B 2A 267 CB
C1 1E 913 32 F3 98 FC 1F 13 4B 2A 26 CB
1E 913 32 7F3 98 EF 1F 13 F4B 2A 26 7C 6
91 32 7F 98 EF C1 13 F4 2A 26 7C B6
33 7F 39 EF C1 F1 F4 B2 2 7C B6 C1
27 39 8E C F1 3F B A 67 B C
F3 8E FC 1F 3F 4B 2A 26 CB 6C 11
98 F 1F 13 4B 2A 26 7C 6C 11
EF C1 13 F4 2 2 7C B6 1 E9
C F F B A 6 B C 1
A6 AB 640 3A 4A 6CB 48 000 E13 379 812
A 6 4 6 0 E 3
6A B6 403 3A4 A6C CB4 4800 00E 133 798 8128 8264
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6
B6 403 A4 A6 CB4 80 00E 133 798 128 26 4A6 AB
4 A C 0 1 7 4 6
64 03AA4A 6C B48 8000 0E1 337 981 1282 264AA6AAB6 403
03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A4
40 A4 6 B 80 0E 3 79 12 26 A AB 64 3A A
3 4 3 8 6 0
03 A4AA6C CB4 800 00E1 133 798 128 8264 4A6 AB 640 3A4 4A6 6CB
A4 6 B 80 0E 33 79 12 26 A AB 64 3A A CB 48
A4 A6 CB 480 00E 133 79 812 826 4A 6AB 64 03A 4A 6CB 48 000
A C 4 0 1 8 8 4 6 0 4 6 0 E
4A 6C B48 8000 0E1 337 7981 1282 264AA6AAB6 6403 3A4 A6C CB4 4800 00E 133
6 B 0 E 3 9 2 6 4 A A 8

6.
5.
4.
3.
2.
1.
A6 CB 480 00E 13 379 812 826 4A 6A B64 03A 4A 6C B48 000 0E1 1337 7981
C 4 0 3 8 8 6 B 0 6 B 0 3 9 2

Q1.
6C B4 800 0E1 1337 798 128 264 4A6AAB6 640 3A4 4A6 CB 480 00E E133 379 812 826

Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option D:
Option D:
Option D:
Option D:
Option D:
Option D:

Option A:
Option A:
Option A:
Option A:
Option A:
Option A:
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4

Naming
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80

Migration
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
Time: 2 hour 30 minutes
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13

immediately
immediately
immediately

Transparency
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37

Server crashes
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 m
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128

Client interfacing
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26

Lamport Algorithm
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A

Mobility transparency

Maekawa‘s Algorithm
In Data centric model-
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40

Replication transparency
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A

Performance transparency
Concurrency transparency
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB

Ricart–Agrawala‘s Algorithm
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
un
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80

Client Cannot Locate the Server

6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E

What is task assignment approach?

B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128

Suzuki-Kasami‘s Broadcast Algorithms

compulsory and carry equal marks

6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
ot

The server crashes after receiving a request

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
es
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
University of Mumbai

26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4

in which each process is viewed as an individual task.

4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80
Curriculum Scheme: Rev 2016
Examinations - Summer 2022

64A6AB6403A4A6CB48000E1337981282
Examination: BE Semester VIII
Program: Computer Engineering

6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E

B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
.in
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128

in which each process is viewed as a collection of related tasks

in which each process is viewed as a collection of distinct tasks
in which each process is viewed as a coordinator of other's tasks
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26 results of read and write operations can be replicated to all stores
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A Following is a type of failure that usually can occur in RPC systems-
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
Course Code: CSC802 and Course Name: Distributed Computing

28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C

In a distributed file system, mapping between logical and physical objects is-
The server crashes after receiving a request and client cannot locate the server
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 4
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 0

Which of the following algorithm is Token Based Algorithm for Mutual Exclusion
Resources and clients transparency that allows movement within a system is called-

3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00
Choose the correct option for following questions. All the Questions are

results of only write operations can be replicated to various stores located nearby
results of only read operations can be replicated to various stores located nearby

results of read and write operations can be replicated to various stores located nearby

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E1
Max. Marks: 80
=====================================================================

00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1

1 | Page
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 3
33 98 28 264 A6 B 40 A A6 CB 80 00E 13
79 12 26 A AB 64 3A 4A C 48 00 1 3
81 82 4A 6A 6 03 4A 6C B4 00 E1 33
28 64 6 B 40 A4 6 B 80 0E 33 79
26 A6 AB 64 3A A CB 48 00 13 79
4A A 64 03 4A 6C 4 00 E1 37 8
6A B6 03 A4 6C B4 800 0E 33 98
B6 403 A4 A6 B4 80 0E 133 798 12
C 0
A6 AB 640 3A 4A 6CB 48 000 E13 379 812
A 6 4 6 0 E 3
6A B6 403 3A4 A6C CB4 4800 00E 133 798 8128 8264
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6
B6 403 A4 A6 CB4 80 00E 133 798 128 26 4A6 AB
4 A C 0 1 7 4 6
64 03AA4A 6C B48 8000 0E1 337 981 1282 264AA6AAB6 403
03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A4
40 A4 6 B 80 0E 3 79 12 26 A AB 64 3A A
3 4 3 8 6 0
03 A4AA6C CB4 800 00E1 133 798 128 8264 4A6 AB 640 3A4 4A6 6CB
A4 6 B 80 0E 33 79 12 26 A AB 64 3A A CB 48
A4 A6 CB 480 00E 133 79 812 826 4A 6AB 64 03A 4A 6CB 48 000
A C 4 0 1 8 8 4 6 0 4 6 0 E
4A 6C B48 8000 0E1 337 7981 1282 264AA6AAB6 6403 3A4 A6C CB4 4800 00E 133
6 B 0 E 3 9 2 6 4 A A 8

9.
8.
7.

A6 CB 480 00E 13 379 812 826 4A 6A B64 03A 4A 6C B48 000 0E1 1337 7981

10.
C 4 0 3 8 8 6 B 0 6 B 0 3 9 2

iii.

i.
ii.
i.

i.
6C B4 800 0E1 1337 798 128 264 4A6AAB6 640 3A4 4A6 CB 480 00E E133 379 812 826

ii.

A
A
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:
Option C:
Option B:

Option D:
Option D:
Option D:
Option D:

Option A:
Option A:
Option A:
Option A:

B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A

Q3.
Q2.
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 m

Bully Algorithm
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26

algorithm.
Lowest process ID

Highest process ID
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A

Berkley's Algorithm

coordinator.
Cristian’s Algorithm
Lamport's Algorithm
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40

Highest timestamp value

33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A Lowest Timestamp value
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
file name need to be changed

28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
un
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80
file name need not to be changed

6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E

B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
file’s host name need to be changed
file’s local name need to be changed

40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
Hides that the resource has multiple copies

ot
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
es
Which of the following is concurrency transparency

28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB

Write short note on File caching schemes.

26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80

64A6AB6403A4A6CB48000E1337981282
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
.in
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
Hide that a resource may be shared by several competitive users

6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26

Solve any Two 5 marks each

B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A

Solve any Two (5 marks each)

Solve any One (10 marks each)

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
Hide that a resource may be moved to another location while in use

00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
Hide differences in data representation and how a resource is accessed

33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A

Explain desirable features of Global Scheduling Algorithm

79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6

resource and Resource to Machine binding in Code Migration.

28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 4
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48

What is the need for Code Migration? Explain the role of Process to
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 0
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800
In the Bully algorithm, process which is elected as the coordinator is the one having –

Discuss the different issues and steps involved in a good Load Balancing
Discuss in brief the different architectural models in Distributed System?

6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0 What is coordinator process? Explain algorithms used for the selection of
Which of the following is the Passive Server Physical Clock Synchronization algorithm

B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00

In a distributed file system, when a file’s physical storage location changes ___________

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E1
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1

2 | Page
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 3
33 98 28 264 A6 B 40 A A6 CB 80 00E 13
79 12 26 A AB 64 3A 4A C 48 00 1 3
81 82 4A 6A 6 03 4A 6C B4 00 E1 33
28 64 6 B 40 A4 6 B 80 0E 33 79
26 A6 AB 64 3A A CB 48 00 13 79
4A A 64 03 4A 6C 4 00 E1 37 8
6A B6 03 A4 6C B4 800 0E 33 98
B6 403 A4 A6 B4 80 0E 133 798 12
C 0
A6 AB 640 3A 4A 6CB 48 000 E13 379 812
A 6 4 6 0 E 3
6A B6 403 3A4 A6C CB4 4800 00E 133 798 8128 8264
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6
B6 403 A4 A6 CB4 80 00E 133 798 128 26 4A6 AB
4 A C 0 1 7 4 6
64 03AA4A 6C B48 8000 0E1 337 981 1282 264AA6AAB6 403
03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A4
40 A4 6 B 80 0E 3 79 12 26 A AB 64 3A A
3 4 3 8 6 0
03 A4AA6C CB4 800 00E1 133 798 128 8264 4A6 AB 640 3A4 4A6 6CB
A4 6 B 80 0E 33 79 12 26 A AB 64 3A A CB 48
A4 A6 CB 480 00E 133 79 812 826 4A 6AB 64 03A 4A 6CB 48 000
A C 4 0 1 8 8 4 6 0 4 6 0 E
4A 6C B48 8000 0E1 337 7981 1282 264AA6AAB6 6403 3A4 A6C CB4 4800 00E 133
6 B 0 E 3 9 2 6 4 A A 8
A6 CB 480 00E 13 379 812 826 4A 6A B64 03A 4A 6C B48 000 0E1 1337 7981
C 4 0 3 8 8 6 B 0 6 B 0 3 9 2
iii.
ii.

i.
i.
6C B4 800 0E1 1337 798 128 264 4A6AAB6 640 3A4 4A6 CB 480 00E E133 379 812 826

i.
B
B

ii.
ii.
ii.

iii.
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A

Q4.
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37

detail.
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
m
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26
Algorithm.

B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6

distributed systems?
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
un
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
Explain Transparency in detail.

6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
ot
80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
Explain Hadoop distributed file system.

81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
es
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
Describe different types of failure models.

26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C 4
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B 80

64A6AB6403A4A6CB48000E1337981282
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 480 00E
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48 00 13
40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 000 E1 37
3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98
.in
4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800 0E 33 798 128
6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0E 133 79 12 26
B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00 13 79 812 826 4A
Solve any Two (5 marks each)
What are different Data Consistency Models? (Any 5)

Solve any One (10 marks each)

Solve any One (10 marks each)

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E13 37 81 82 4A 6A
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1 37 98 28 64 6 B6
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 33 98 12 26 A6 AB 40
33 98 28 264 A6 B 40 A A6 CB 80 00E 13 79 12 826 4A A 64 3A
79 12 26 A AB 64 3A 4A C 48 00 1 37 81 82 4A 6A B6 03 4
81 82 4A 6A 6 03 4A 6C B4 00 E1 33 98 28 64 6 B 40 A A6
28 64 6 B 40 A4 6 B 80 0E 33 79 12 26 A AB 64 3A 4A CB
algorithm. Explain in detail Raymond’s Tree-Based algorithm.
26 A6 AB 64 3A A CB 48 00 13 79 81 82 4A 6A 6 03 4A 6C
4A A 64 03 4A 6C 4 00 E1 37 81 28 64 6A B6 40 A4 6 B
6A B6 03 A4 6C B4 800 0E 33 98 28 264 A6 B 40 3A A6 CB 4
B6 403 A4 A6 B4 80 0E 133 798 128 26 A6 AB 640 3A 4A CB 48
Differentiate between NOS, DOS and Middleware in the design of a

Differentiate between Token-based algorithm and Non-Token-based

40 A4 A6 CB 80 00E 13 79 12 26 4A AB 64 3A 4A 6C 48 0
Define remote procedure call (RPC)? Describe the working of RPC in

3A A CB 48 00 13 37 81 82 4A 6A 6 03 4A 6C B4 00
Explain how Monotonic Read consistency model is different from Read

4A 6C 48 000 E1 37 981 282 64A 6A B6 403 A4 6C B4 800

6C B4 00 E1 337 98 28 64 6A B6 40 A4 A6 B 80 0
Explain Different issues and goals related to design of Distributed System.

B4 800 0E 33 98 128 264 A6 B 40 3A A6 CB 480 00

your Write consistency model. Support your answer with suitable example.
What are physical clocks? Explain any one Physical Clock Synchronization

80 0E 133 79 12 26 A6 AB 64 3A 4A CB 48 00 E1
00 13 79 81 82 4A A 64 03 4A 6C 4 00 E1

3 | Page
E1 37 81 28 64 6A B6 03 A4 6 B4 80 0E 3
33 98 28 264 A6 B 40 A A6 CB 80 00E 13
79 12 26 A AB 64 3A 4A C 48 00 1 3
81 82 4A 6A 6 03 4A 6C B4 00 E1 33
28 64 6 B 40 A4 6 B 80 0E 33 79
26 A6 AB 64 3A A CB 48 00 13 79
4A A 64 03 4A 6C 4 00 E1 37 8
6A B6 03 A4 6C B4 800 0E 33 98
B6 403 A4 A6 B4 80 0E 133 798 12
C 0
 ,5
* tI € r-l r: f-l -fJ
Be{co.p) lrumslnt:/ C Se^t"gfr".o- |
i
\t__

,t .> t)*iZ
Duration: - 3 Hours Marks: 80 Marks

N.B. : (1) Question No 1 is Compulsory.

(2) Attempt any three questions out of the remaining five.
(3) All questions carry equal marks.
(4) Assume suitable data, if required and state it clearly.

Q.1 Solve any four 20 (4xs)

...s,
a. Explain hyperlink Analytics?
b. Specitz the significance of Social Media KPI
c. Differentiate static dvnamic social media text.

10

10

10

10

10

10

10

10

20 (2x10)

d. Intention analysis in social media.

. ,tl

43043 Page 1 of 1

2B A64C21 853AADDE45A7 7'7 3 49 5422BEt

 5
Y

2
9X

7Y
9X
63
37
Paper / Subject Code: 52777 / Social Media Analytics

34

Y5

23
X2

34
63

7Y
9X
63
37
49
Y5

Y5

23
X2

34
33
37

X
3
56

7
9

56
3

49
X2

4
Duration: - 3 Hours Marks: 80 Marks

2
3

7Y
9X

33
63
7
49

6
5

3
X2

4
33

5
N.B. : (1) Question No 1 is Compulsory.

2
3

7Y
9X
63
56

7
9

63
(2) Attempt any three questions out of the remaining five.

3
4

3
7Y

4
3

Y5
7Y

X2
X

33
63
(3) All questions carry equal marks.

23

49

7
5

9
5

3
(4) Assume suitable data, if required and state it clearly.

34
9X

X2
X
3
7

63
6

37
3

49
34

49
2

5
7Y

2
9X

3
63

Y
Q.1 20

3
3

63
6

37
Y5

49
4
What is predictive analytics?

Y5
a. 5

49
2
3

5
2
X

3
3
37

7Y
9X

33
63
56

7
What is text analytics, and why it is useful?

49
b. 5

23
X2

6
5

3
Y

4
3

5
Y
What is search engine analytics?

2
9X

3
c. 5

3
7
49

7Y
9X
3
6

7
3

56
Y5

23
2

34
d. Explain the steps needed to formulate a social media strategy. 5
33

23
34
9X

Y
X
63
56

37

9X
3
7
9
4

6
5

23
7Y

4
3

Y5

23
Q.2 a. Differentiate among social media, Web 2.0, and social network sites. 10

34
X

33
63

X
37
23

9X
63
6

37
Y5

How degree distribution is plotted for the graph? Show degree distribution of the

49
34

Y5
X2
9X

Y5
2

34
3
3

following graph.
7

X
3
6

37
3

49
34

63
6

37
5

49
X2

5
Y

2
33
63

Y5
Y

X2
X

3
37
49

3
56

7
Y5

49

37
3

49
2
33

5
Y

X2
X

3
37

X2
33
3
56

7
49

56

7
3

49
X2

56
23

49
7Y

2
33

7Y
X

33
49

Y
X

33
6
23

56

7
5

23

b. 9 10
4
33

56
23
7Y

34
9X

Y
X
3
56

7Y
9X
3
56

7
23

9
34

6
23
7Y

34

23
Y

34
9X
63

7Y
X
3
7
23

9X
3
6
Y5

23

9
34

6
Y5

3
34
9X

Y5
X2

34
X
63
37

63
7
9
34

63
37
Y5

49
X2

5
2
3
63

Y5
Y

X2
X

3
3
37
49

3
56

7
Y5

49

37
3

49
X2
33

Y5
7Y

X2
3

X2
3
3
6

Q.3 a. Explain Social Media Action Analytics, Common Social Media Actions and
49

63
6

7
Y5

23

10
5

49
4
3

Actions Analytics Tools.

5
Y

2
9X

33
63
7

7Y
9X

33
7
23

b. Explain tools of Hyperlink Analytics.

Y5

10
34

56
5

23
2

34
9X

Y
X
3
7

7Y
9X
3
56

7
23

49
4

6
23
33

23

Q.4 a. List all the location analytics tools and also explain working of every tool.
7Y

10
9X

7Y
9X

33
63

9X
3

b. What is social media risk? Explain the four steps in social media risk management
4

10
6
Y5

23
X2

34
33

Y5

34
9X
3
56

7
49

63
6

37
23

Y5
Y

Q.5 a.
34

Discuss various privacy attributes of Social Media Sites.

3

10
Y5
X2
9X
63
37

63
7

37

b. What is Location analytics? Explain its significance in context of social media

Y5

23

49
X2

Y5

10
33

X2
9X

analytics?
7

63
56

37
23

49
4

5
Y

X2
9X

33

7Y

33

Q.6
37

Write short notes on any two 20

56

49
4

56
23
X2
33

a. Centralization in social media analytics with example.

Y

33

7Y
9X
6

37
49

b. Challenges of social media analytics.

56
Y5

23
X2

4
3

c. Automated, Traditional and Social recommender systems.

33
63
37

9X
37
49

6
Y5

d. Social Media Risks Management Framework.

Y5
X2

34
3
63
7

************************************************
63
37
23

49
Y5

Y5
X2
9X

3
63
7

37
23

49
4

56537 Page 1 of 1
Y5
33

X2
9X

3
63
56

37

49
4

Y5
X2
33

33
56

7
49

X237Y563349X237Y563349X237Y563349X237Y563349
56
23
 9C
6

6
CB
FB

B9

FA
Paper / Subject Code: 52778 / Institute Optional Course-2: Project Management

AD
F8

3C
61

BD

C
A6
4F

FB

B9

D9
CC

DF
E3

F8

61

6A
93
1C

4F

CB
B

FA
1B
F
12

3C
Time: 3-hour Marks: 80

BD
F

6
8B

1C

4F

FB

CC
1B
83

12

E3

D
F

6
9C
N.B. : (1) Question No 1 is Compulsory.

93
8B

B
B
21

34

CC
1B
F
AD

3
(2) Attempt any three questions out of the remaining five.

F8
8

B6
C

93
8B
A6

C
(3) All questions carry equal marks.

4F
D9

B
8F
3

3
F
(4) Assume suitable data, if required and state it clearly.

61
C8
6A

B1

CE
BD

F
4F

FB
9
(5) Notations carry usual meaning.

FA

38

21
C

1B
D

F8
3C

C8
6A

E
BD

B6
8B

4F
B9

D9
A

21
Q1. Answer the following (Any FOUR.) [20M]

8F
83

E3
F
3C
61

6A

B1
BD

FF
C

1C
FB

B9

D9
FA

34
CC

83

2
a) What are the contents of project charter? who prepares and authorizes the project charter?
F8

61

6A

B1

CE
D

9C
3

4F
F

CB
FB

FA

38

21
b) Compare the top-down budgeting and bottom-up budgeting.
34

AD

E3
F8

8
61

B1
CE

BD

9C
3

A6

1C
c) What is Goldratt’s critical chain method?
4F

FB

B9

38
21

CC

AD

12
F
E3

F8

C8
61
B1

BD
d) Explain the significance of IRR method in project selection.

8B
93

A6
1C

4F

FB

D9
38

CC
1B

83
12

DF
E3

8
e) Briefly describe the purchasing cycle.
C8

6A
FF

9C
B6

3
8B

1C

CB
B9
D9

FA
4

AD
f) Explain the risk breakdown structure. F
83

12

3C
61
6A

CE

BD
F
9C

8B

A6
F

FB

B9
FA

21

34

CC
AD

83

DF
F8

61
Q2. (a) A consulting project has an actual cost of Rs. 35000, Scheduled cost Rs. 27000, and [5M]
B1

CE
BD

9C

93
A6

4F

CB
FB
38

1
CC

1B
AD

12

completed work is Rs. 31000. Find the Scheduled and Cost Variance. Also find SPI and CPI.
E3
DF

3C
C8

FF

B6
8B
93

A6

C
CB

B9
D9

34

(b) What is a contract? Explain different types of contracts in brief. [5M]

1B

8F
83

2
DF
3C

61
6A

CE

FF
9C
B6

8B
CB

FB
(c) Consider a project having following cash flow stream. The cost of capital (r) for the firm is
B9

FA

21

34
AD
8F

83

F8
3C
61

B1

CE
BD
FF

10% . Calculate NPV of project and decide whether to accept or reject the project. [10M]
A6

4F
FB

B9

1
34

CC

AD

83

12

E3
DF
F8

61
CE

8B
93

A6

1C
4F

CB
FB

D9

Year 0 1 2 3 4 5
21

1B

83

12
DF
E3

F8

3C

9C
B6

8B
A6
1C

4F

CB
B9

CASH 10,00,000 2,00,000 2,00,000 3,00,000 3,00,000 3,50,000

D
F

83
12

F
E3

F8

3C
61

Flow in
D

9C
8B

A6
1C

4F

CB
FB

B9

Rs.
AD
83

F
E3

F8

3C
61
B1

BD
9C

A6
1C

4F

FB

B9
38

CC
2

DF
E3

Q3. (a) What is project life cycle? how does cost of change, risk and influence of stakeholders are
F8

61
C8

B1

93
1C

4F

CB
FB
D9

38

1B

affected with Project time during the life cycle of project? [10M]
12

E3

F8

3C
C8
6A

6
8B

1C

4F

FB

B9
D9
A

83

12

E3
DF

F8

61
6A

Q3. (b) Explain probability and impact matrix. What are the risk response strategies foe negative risks
9C

8B

1C

4F

FB
A

AD

83

12

E3
DF

F8

(threats) and positive risks(opportunities). [10M]

9C

8B
6

1C

4F
CB

FA

AD

83

E3
3C

B1
BD

9C
6

1C
B9

FA

38
CC

AD

2
C8

B1
BD
93

A6

D9

38
CC
1B

DF

C8
6A
B6

93

CB

29975
D9

Page 1 of 2
FA
1B
8F

3C

6A
BD
FF

B6

B9

FA
CC
F
F8

61

BD
93

21CE34FF8FB61B93CCBDFA6AD9C838B1
4F

FB
 9C
6

6
CB
FB

B9

FA
Paper / Subject Code: 52778 / Institute Optional Course-2: Project Management

AD
F8

3C
61

BD

C
A6
4F

FB

B9

D9
CC

DF
E3

F8

61

6A
93
1C

4F

CB
B

FA
1B
F
12

3C
Q4. (a) A small project is composed of 8 activities, whose time estimates are listed below.

BD
F

6
8B

1C

4F

FB

CC
1B
83

12

E3
Activity Predecessor to tm tp

D
F

6
9C

93
8B

B
B
21

34

CC
1B
F
AD

F8
8

E
A - 3 6 9

B6
C

93
8B
A6

4F
D9

B
8F
B - 5 7 8

3
F

61
C8
6A

B1

CE
BD

F
C A 6 9 12

4F

FB
9
FA

38

21
C

1B
D

F8
D A 6 12 15

3C

C8
6A

E
BD

B6
8B

4F
B9

D9
A
E B 9 12 18

21
C

8F
83

E3
F
3C
61

6A

B1
BD
F B 12 18 24

FF
C

1C
FB

B9

D9
FA

34
CC
G C, D, E 6 9 12

83

2
F8

61

6A

B1

CE
D

9C
3
H C 3 6 9

4F
F

CB
FB

FA

38

21
34

AD

E3
i) Draw the project network diagram. Find the critical path and expected project duration.
F8

8
61

B1
CE

BD

9C
3

A6

1C
4F

FB

B9

38
21

CC

AD
ii) If the due date is 30 days. What is the probability that the project will be completed

12
F
E3

F8

C8
61
B1

BD

8B
93

A6
1C

4F

FB

D9
38

within the due date?

CC
1B

83
12

DF
E3

8
C8

6A
FF

9C
B6

3
8B

1C

CB
iii) Find the probability of completing project between 26 to 31 days. [10M]

B9
D9

FA
4

AD
F
83

12

3C
61
6A

CE

BD
F
9C

8B

A6
F

FB

B9
FA

21

34

CC
AD

83

Q4. (b) What are the non-numeric models of project selection? Expalin in brief. [5M]

DF
F8

61
B1

CE
BD

9C

93
A6

4F

CB
FB
38

Q4. (c) Explain importance of ethics in projects. [5M]

CC

1B
AD

12

E3
DF

3C
C8

FF

B6
8B
93

A6

C
CB

B9
D9

34
1B

8F
83

2
DF
3C

61
6A

CE

FF
9C
B6

8B

Q5. (a) How communication is planned and managed in project management ? [10M]
CB

FB
B9

FA

21

34
AD
8F

83

F8
3C
61

B1

CE
BD
FF

Q5. (b) What is life cycle of a project audit ? what are responsibilities of project auditor ?
C
A6

4F
FB

B9

1
34

CC

AD

83

12

E3
DF
F8

61

What is essential for successful project audit? [10M]

CE

8B
93

A6

1C
4F

CB
FB

D9
21

1B

83

12
DF
E3

F8

3C

9C
B6

8B
A6
1C

4F

CB
B9

Q6. (a) What are four stages of team development and growth? What are the barriers to team
D
F

83
12

F
E3

F8

3C
61

A
D

9C
8B

A6
1C

4F

CB
FB

B9

effectiveness? [10M]
AD
83

F
E3

F8

3C
61
B1

BD
9C

A6
1C

Q6. (b) List and briefly describe the ways project may be terminated. What are some non-technical
4F

FB

B9
38

CC
2

DF
E3

F8

61
C8

B1

reasons for project termination? [10M]

93
1C

4F

CB
FB
D9

38

1B
12

E3

F8

3C
C8
6A

6
8B

1C

4F

FB

B9
D9
A

83

12

E3
DF

----------------
F8

61
6A

9C

8B

1C

4F

FB
A

AD

83

12

E3
DF

F8
9C

8B
6

1C

4F
CB

FA

AD

83

E3
3C

B1
BD

9C
6

1C
B9

FA

38
CC

AD

2
C8

B1
BD
93

A6

D9

38
CC
1B

DF

C8
6A
B6

93

CB

29975
D9

Page 2 of 2
FA
1B
8F

3C

6A
BD
FF

B6

B9

FA
CC
F
F8

61

BD
93

21CE34FF8FB61B93CCBDFA6AD9C838B1
4F

FB
 Paper / subject code: 52684/
Institute optionar course-2: project
Management
$e ,*- ..,, ,', ,i_i,,_rz- rlj"_ ',
_-i,rr i ,r,,
f._/ ,, i,7l
:,r_ i ,,._, i! i= j_r.-:,_r,
r

,i
Time: 3-hour
Max. Marks: go
N'B : (l) Question No, I is compulsory. /)) ujtr
(2) Attempt any three qu.riion, - * *: |o t-rj
.t,,'-1,:".
'*-'-)--

(3)
out of
All questions carry equal ,u.t r."- the
..." remaining five.
(4) Assume suitable Ou,r,
iir.qrlr.O, una
-- state it clearly.
(5) Notations carry the
usual *.*irg.
Q 1. Alswer the folloiving

a) What are the

them in
b) Why
c) Explain
d) What i
e,)

0 are the

Q2. (,a

project be

Cash
Flows Project A Project B Projecr C
_(Year) tD

2 10,00.000 I 3 00
-:,
J, 5
i. 6.
T - 000
5 4 000
a,

I _l 1,00,000-
6% 9Yo,, 1 <O/
i"
;.;.
L J /O 110,/
1L /O
t...
*.r
i,
't

risk, and influence of

of the project? tl0MI

Q3' tt'"Il"':e the responsibilities of

the proje* audiror? what is
essentiar for a successfi:l
project Audit?
IlOlvu
Q3 (b) Expliin probability
and impact matrix. what
are the risk response
strategies for
negarive risks (threats)
and positive risks (opporrunities)?
yvr rur'rusrr r
[l0M]

43022 page I of2

6 528D9 4227 4985 85 ECD-56 I

86454 I 462F
Q4. <.
Normal Man ower Requrred
ActivitY l:,."
_t-.,
4
0-1 t:,.1-'

J ,,,'"
t-z i{
',.. ]

-it'':'
1-3 .'1.-,
-
...i- '
.A
L-+
3
3-5
4
3-6
3
4-7

6-8
2
7 t" 9
8,9

:t. '

t.

,,
4302 Page 2 ofl

6528D9 4227 4985 8 5ECD56 1 864.5A 1 462F

 D
8

30
A9
BD

95

23
Paper / Subject Code: 52771 / Distributed Computing

FB
F7

D3
86
35

A9
BD

95

23
9C

3
FB
F7

D3
86
35
4F
Time:(3 Hours) marks:80

A9
BD

95

23
9C
7
C0

F7

3
86
35
4F

D
N.B: 1) Question number 1 is compulsory.

A0

BD

95

23
9C
7
C0

F7
99

6
35
4F
2) Attempt any three out of the remaining.

8
A0

BD
03

95

23
9C
7
C0
3

F7
99

6
3) Assume suitable data if necessary and justify the assumptions.

35
4F
FB

8
A0

BD
03

95
9C
7
A9

C0
4) Figures to the right indicate full marks.

F7
99

35
4F
FB
D3

A0

BD
03

9C
7
A9

C0
23

99

35
4F
FB
Q1

D3
86

A0

BD
03

9C
7
A9
95
A Explain how Monotonic read consistency model is different than Read your Write [5]

C0
23

99

35
4F
FB
F7

D3
86

A0
03
consistency model

9C
7
A9
BD

95

C0
23

99

4F
B What is 1:M and M:1 group communication? [5]

FB
F7

D3
86

A0
35

03

7
A9
BD

95

C0
23
9C

99
C Differentiate between NOS DOS and Middleware in the design of distributed systems [5]

FB
F7

D3
86

A0
35

03
4F

7
A9
BD

95
D What is fault tolerance? Explain failure models. [5]

C0
23
9C

3
07

99
FB
F7

D3
86

A0
C

35

03
4F

A9
A0

BD

95

23
9C

3
07

99
FB
F7

D3
99

86
C

35

03
4F

Q2

A9
A0

BD
03

95

23
9C

3
07

FB
A Explain code migration and its techniques. [10]
B3

F7

D3
99

86
C

35
4F

A9
A0

BD
03
F

95
B Explain Bully election algorithm with suitable example. [10]

23
9C
07
A9

B3

F7

D3
99

86
C

35
4F
D3

A0

BD
03
F

95

23
9C
07
A9

Q3
23

B3

F7
99

86
C

35
4F
D3
86

A Explain Raymond’s algorithm for mutual exclusion.

A0

BD
03
F

95
9C [10]
07
A9
95

23

B3

F7
99

35
4F
B What are different data centric consistency models [10]
F7

D3
86

A0

BD
03
F

9C
07
A9
BD

95

23

B3

99

35
4F
F7

D3
86

A0
35

03
F

Q4

9C
07
A9
BD

95

23
9C

B3

99

0C

A Explain different load estimation and process transfer policies used by load balancing [10] 4F
7

D3
86
35

03
4F

F
DF

07
9A
A9

algorithms.
95

23
9C

B3
07

C
5B

39
F7

D3
86

A0

B What are physical clocks? Explain any one physical clock synchronization algorithm. [10]
0C

4F

F
C3

30
A9
BD

95

23
07

99
A

FB
F9

F7

D3
99

86
0C

35

3
30
74

A9
BD
03

95

23
9C
9A

FB

Q5
C0

F7

D3
86
35
4F
39

A9
A0

BD

95

23

A What are different issues and goals related to distributed systems? [10]
9C
07
30

F7

D3
99

86
0C

5
4F
FB

B Explain file caching schemes [10]

C3

BD
03

95

23
07
A
A9

F9
B3

F7
99

86
0C

5
D3

C3
74

BD
03
9F

95
A

Q6
C0

F9
B3

F7
3A

99

5
C3
74

A Write a short note on Replication and the types of it. [10]

A0

BD
03
9F
3D

C0

F9
B3
3A

99

B What is RPC? Explain working of RPC in detail [10]

5
2

C3
86

74
A0
03
9F
3D

___________________
95

C0

F9
B3
3A

99
62
F7

74
A0
03
9F
3D
58

C0
B3
3A

99
79

62

A0
03
9F
DF

3D
58

B3
3A

99
79

2
5B

86

03
9F
DF

3D
C3

95

B3
3A
2
5B
F9

F7

86

9F
3D
C3

BD

95

3A
2
F9

F7

86
35

3D
74

BD

95
9C

2
C0

F7

86
35
4F
A0

BD

95
9C
07

38785 Page 1 of 1
F7
99

0C

35
4F

BD
9C
07
9A

0C

35
4F

399A0C074F9C35BDF7958623D3A9FB30
39
 A0

F4
8B
EF

E
Paper / Subject Code: 52771 / Distributed Computing

E9

DA
44
08
4C

A0
8B
EF
A7

9E

F
DA
44
08
4C

0E
FB

8B
EF
A7

9E
A
86

44
8
C

0E
FB
8D

0
4

8B
F
A7

4A
86

E
AB

08
4C
Duration: 3hrs [Max Marks:80]

B
D

B4
94

EF
8

A7

A
86

88
B
43

44
C
A

FB
D

F0
N.B. : (1) Question No 1 is Compulsory.

4
AF

8B
B8

A7
9

86

E
43
ED
(2) Attempt any three questions out of the remaining five.

8
4C
A

B
D

F0
AF

F
B8

7
E9
(3) All questions carry equal marks.

E
BA
43

8
D

C
A
A0

D
(4) Assume suitable data, if required and state it clearly.

4
F

F
B8

7
E9

DA

39
44

86

E
A

4C
A
A0

FB
8B

D
9E

AF

B8

A7
1 Attempt any FOUR [20]

39
4
08

6
0E
4

D8
D

4A
4

FB
8B
EF
a Explain issues in designing Distributed system

E
4A

AF

8
9

39
8

86
4C

AB
0E
b Compare NOS and DOS

4
0

ED

F4
B
EF

8D
A7

4
88
c Explain desirable features of global scheduling algorithm

E9

DA

39
4

6
C

AB
FB

4
0

D8
4

A0

4
8B
d Explain the need of election algorithm. EF
A7

AF

94
86

B8
E9
44
8
4C

e Justify how Ricart-Agrawala’s algorithm optimized the Message overhead in

B

43
8D

F0

ED

4A
0
8B
F

4A

AF
86

E
AB

achieving mutual exclusion

E9

39
08
C
B
8D

B4

D
4

A0

F4
94

F
7

E
86

8
AB

E9
3

DA
44
08
4C
2 a What is Remote procedure call? Explain how transparency is achieved in RPC [10]
F4

B
D

0
94

B
6F

F
8

9E
DA

4A
CE

88
B

b Explain various forms of message oriented communication with suitable [10]

A
3

8
A

0E
F4

FB
D

B4
F0
9E

4
4

example
B8

7
DA

4A
39

86

CE

8
BA
0E

08
A
F4

B4
9E

74
4A

EF
8
DA

39

3 a What is logical clock? Why are logical clocks required in distributed systems? [10]

88
AB

BA
0E
B4

4C
F4

F0
9E
4A

How Lamport does synchronizes logical clock? Which events are said to be
4

6F
88

B8

A7
A

39

CE
0E
B4
F0

D8
ED

concurrent in Lamports timestamp

4A
4

FB

74
4A

AF
CE

88

8
9

39

b Explain Chandy -Misra_Hass Algorithm for distributed deadlock detection. [10]

86
B

BA
0E
B4
F0

D
74

4A
F4

8D
E
4A
CE

6F
88
A

E9

DA

39

AB
FB

B4
F0

D8

4 a Explain different load estimation and process transfer policies used by load [10]
74

A0

4
E

AF

94
6

CE

88
A

B8
E9

balancing algorithms.
D8

44
FB

43
F0

ED
74

4A
0
B
B8

b Describe code migration issues in details [10]

4A

AF
86

CE

88
A

39
E
FB
8D

B4
F0

ED
74

A0

F4
86

CE

8
B

E9

5 a Discuss and differentiate various client consistency models. [10]

DA
44
08
4A

FB
8D

74

0
B
F

b Explain Absolute ordering and Casual ordering process with the help of example [10]
9E
4A
39

86

88
AB

0E
F4

FB
8D

for many to many communication.

4
F0
74
94

8B
DA

4A
86

CE
AB

BA
43

08
8D

B4
74
AF

94

EF

6 a List desirable features of distributed File system. How are modifications [10]
86

88
AB

BA
43
ED

4C

propagated in file caching schemes?

8D

F0
AF

94

6F

A7
E9

CE
AB

b Discuss Raymonds tree based algorithm of token based in distributed mutual [10]
43

8
ED
A0

FB
D

74
AF

94

exclusion
8
E9
44

86
AB

BA
43
ED
A0

8D
AF

94

6F
E9
4

AB

*********
43
B4

D8
ED
A0

AF

94
8

B8
E9
4
08

43
B4

ED

4A
A0
EF

AF
8

E9

39
4
08
4C

B4

ED
A0

F4
EF

E9

DA
4
08
4C

B4

A0
EF
A7

9E
8

4
08
4C

0E
B

B4

27234 Page 1 of 1
6F

EF
A7

4A
8
D8

08
4C
FB

B4
F
A7
86

CE

88
FB

AB8D86FBA74CEF088B44A0E9EDAF4394
8D

F0
74
Study Timetable (April 20 - May 12)

April 20 - April 25 (6 Days Focus on Distributed Computing)

Distributed Computing

 Day 1 (April 20): Introduction to Distributed Systems

o Components, Challenges, and Types

 Day 2 (April 21): Parallel Computing and Architectures

o Client-Server, Peer-to-Peer, Parallelism Types

 Day 3 (April 22): Communication in Distributed Systems

o MPI, RPC, Consistency Models

 Day 4 (April 23): Synchronization and Fault Tolerance

o Locks, Semaphores, Deadlock, Replication, Redundancy

 Day 5 (April 24): MapReduce and Big Data

o Hadoop, Data Processing, Efficiency

 Day 6 (April 25): Distributed Databases and Cloud Computing

o NoSQL, CAP Theorem, Virtualization

April 26 - April 29 (4 Days Focus on Deep Learning)

Deep Learning

 Day 7 (April 26): Neural Networks and Optimization

o Perceptron, Backpropagation, Activation Functions

 Day 8 (April 27): Types of Neural Networks

o CNN, RNN, LSTM

 Day 9 (April 28): Regularization and Transfer Learning

o Dropout, Fine-tuning, Pre-trained Models

 Day 10 (April 29): Evaluation Metrics and Final Review

o Accuracy, Precision, Recall, F1 Score

April 30 - May 3 (4 Days Focus on Social Media Analytics)

Social Media Analytics

 Day 11 (April 30): Introduction to Social Media Analytics

o Metrics, Importance, and Tools

 Day 12 (May 1): Paid vs Organic Analytics

o Campaigns, Engagement, Reach Metrics

 Day 13 (May 2): Influencer Marketing and Social Listening

o Sentiment Analysis, Evaluating Campaigns

 Day 14 (May 3): Content Performance and Real-Time Analytics

o Analyzing Viral Content, Trend Monitoring

May 4 - May 7 (4 Days Focus on Project Management)

Project Management

 Day 15 (May 4): Project Basics and Scope

o Stakeholders, Project Lifecycle

 Day 16 (May 5): Scheduling and Work Breakdown Structure (WBS)

o Gantt Charts, PERT, Critical Path

 Day 17 (May 6): Resource Allocation and Risk Management

o Risk Identification, Mitigation Strategies

 Day 18 (May 7): Agile Methodology and Final Review

o Scrum, Kanban, Sprints

May 8 - May 12 (Revision Phase)

May 8 (Day 19): Distributed Computing

 Review key topics, algorithms, synchronization, and fault tolerance.

May 9 (Day 20): Deep Learning

 Review neural networks, optimization, evaluation metrics, and regularization.

May 10 (Day 21): Social Media Analytics

 Review content performance analysis, influencer marketing, and tools.

May 11 (Day 22): Project Management

 Review WBS, scheduling, risk management, and Agile methodology.

May 12 (Day 23): General Revision for all subjects

 Go over any difficult areas or concepts and practice last-minute key points.
BE CMPN Sem 8 – Repeated/Important
Questions
🔁 Distributed Computing (Subject Code: 52771)
 RPC (Remote Procedure Call): Define RPC and explain its working in detail.
 Load Balancing: Compare static and dynamic load balancing algorithms.
 Mutual Exclusion: Raymond’s Tree-Based Algorithm, Ricart–Agrawala’s algorithm.
 Consistency Models: Client-centric consistency models; Monotonic read vs Read-your-
write.
 Clock Synchronization: Explain Lamport’s logical clock or physical synchronization
algorithm.
 Distributed Systems Concepts: Compare NOS, DOS, and Middleware; Types of
distributed systems with diagrams.
 Election Algorithms: Bully election algorithm, General election algorithm.

🔁 Project Management (Subject Code: 52756 / 52778)

 Project Life Cycle: Explain the phases and influence of cost, risk, and stakeholders.
 Budgeting & Financial Analysis: Top-down vs bottom-up budgeting; NPV, SPI, CPI
calculations.
 Risk Management: Risk response strategies; Probability and impact matrix.
 Project Audit: Life cycle and responsibilities of project auditor.
 PERT/CPM & Network Diagrams: ES/LS calculation, variance, probability of
completion.
 Team Development: Four stages of team development; barriers to team effectiveness.
 Ethics in Projects: Role of ethics in project execution, especially government projects.

🔁 Social Media Analytics (Subject Code: 52777)

 Core Concepts: Predictive analytics, Text analytics, Action analytics, Social
recommender systems.
 Tools: Hyperlink analytics tools, Location analytics tools, Degree distribution graph.
 Risk & Privacy: Social media risk management framework; Privacy attributes.
 Short Note Topics: Centralization in social media; Challenges of analytics.
📘 Most Important Theory Questions from Textbooks

🔹 Distributed Computing

 Explain architectural models in distributed systems.

 Describe the desirable features of a global scheduling algorithm.
 Compare NOS, DOS, and Middleware.
 What is the need for code migration? Explain different binding strategies.
 Explain the concept and working of Remote Procedure Call (RPC).
 Describe any one physical clock synchronization algorithm.
 Discuss different types of failure models.
 Differentiate between Token-based and Non-token-based mutual exclusion algorithms.
 Describe Raymond’s Tree-Based Algorithm.
 Compare Client-Centric Consistency Models with examples.
 Explain Chandy–Misra–Haas deadlock detection algorithm.
 Write a note on Andrew File System (AFS).
 Explain Monotonic Read vs. Read Your Write consistency with example.
 Explain message-oriented communication with suitable examples.

🔹 Project Management

 Explain the triple constraint in project management.

 Describe stages of team development. What are the barriers to effective team work?
 What are the responsibilities of the project auditor?
 Describe project audit types and their benefits.
 Explain the significance of probability and impact matrix in risk management.
 Define project crashing with a real-world example.
 Describe top-down and bottom-up budgeting.
 Explain EVM (Earned Value Management) with SPI, CPI, CV, SV.
 What are project closure types? Define normal and abnormal closures.
 What are reasons and process of project termination?
 Define GANTT chart and Goldratt’s critical chain.
🔹 Social Media Analytics

 Define and explain Hyperlink analytics with example.

 Describe the significance of social media KPIs.
 Explain text analytics and intention analysis in social media.
 Differentiate static and dynamic social media text analysis.
 Explain centrality and influence in social networks.
 What are the ethical challenges in social media analytics?
 Explain the role of recommender systems in social media.
 Describe location analytics tools and their applications.

list of the most important algorithms and formulas for numerical-

based questions:

📘 Distributed Computing
 Lamport’s Logical Clock Algorithm
 Vector Clock Algorithm
 Bully Election Algorithm
 Raymond’s Tree-Based Mutual Exclusion Algorithm
 Ricart–Agrawala Algorithm
 Chandy–Misra–Haas Deadlock Detection Algorithm

📋 Project Management
 PERT Formula (TE = (O + 4M + P)/6)
 Variance and Standard Deviation
 Critical Path Method (CPM)
 Crashing (Time-Cost Trade-Off Analysis)
 Earned Value Management (CPI, SPI, CV, SV)
 Probability of Project Completion
 Resource Allocation and Leveling Techniques
potential exam questions based on Deep Learning, Distributed
Computing, Project Management, and Social Media Analytics for
the 8th semester of Computer Engineering:

1. Deep Learning Exam Questions

Sample Questions:
1. Explain the architecture of a Feedforward Neural Network (FNN) and discuss
the working of the backpropagation algorithm.
2. Explain the concept of Convolutional Neural Networks (CNN). How are they
applied to image classification problems?
3. What is the role of activation functions in deep learning? Explain with
examples.
4. Describe the concept of Gradient Descent. How does it help in training a deep
neural network? Discuss different types of Gradient Descent techniques.
5. What is the Vanishing Gradient Problem? How does it affect the training of
deep neural networks?
6. Describe the architecture and applications of Recurrent Neural Networks
(RNN). How does an LSTM (Long Short-Term Memory) network solve the
vanishing gradient problem in RNNs?
7. Compare the performance of different optimization algorithms like Stochastic
Gradient Descent (SGD), Adam, and RMSProp in deep learning.
8. What are Generative Adversarial Networks (GANs)? Explain how they work
with examples.
9. Explain the concept of Transfer Learning in deep learning. How can pre-trained
models be used in new applications?
10. Given a dataset for a classification problem, describe the steps you would take
to design and train a deep learning model.
 2. Distributed Computing Exam Questions

 Sample Questions:
1. Explain the concept of distributed mutual exclusion and describe any algorithm
to implement it.
2. What is the MapReduce model? Explain its working with an example.
3. Describe the different types of fault tolerance mechanisms in distributed
computing systems.
4. Explain the concept of consistency models (strong consistency, eventual
consistency, etc.) in distributed databases.
5. What is the Paxos algorithm? How is it used for achieving consensus in
distributed systems?
6. Compare replication and sharding in distributed databases. What are their
advantages and disadvantages?
7. Describe the CAP theorem and explain the trade-offs between consistency,
availability, and partition tolerance.
8. What is the 2-Phase Commit protocol? Explain how it ensures atomicity in
distributed transactions.
9. Discuss the role of Distributed Hash Tables (DHT) in distributed file systems or
decentralized networks.
10. Explain the concept of distributed file systems. How does HDFS (Hadoop
Distributed File System) work?

3. Project Management Exam Questions

 Sample Questions:
1. Explain the Project Life Cycle. Discuss the different phases and their significance.
2. What is Work Breakdown Structure (WBS)? How does it help in project
planning?
3. Describe the Critical Path Method (CPM) and its role in project scheduling.
 4. What is Risk Management in project management? Explain the steps involved in
identifying, assessing, and managing project risks.
5. What is the difference between Agile methodology and Waterfall methodology
in project management?
6. Explain the concept of earned value management (EVM). How is it used to
monitor project performance?
7. What is resource leveling in project management? Discuss its importance in
managing project schedules.
8. Describe the cost estimation techniques in project management. How are they
applied during the planning phase?
9. What is the role of a project manager? Discuss the skills required for effective
project management.
10. How would you handle scope creep in a project? Discuss the strategies for
controlling scope changes.

4. Social Media Analytics Exam Questions

 Sample Questions:
1. Explain the importance of sentiment analysis in social media marketing. How
can it help in brand monitoring?
2. Discuss the different types of social media metrics that organizations track.
How do they help measure the success of a campaign?
3. What is the concept of social listening? Discuss the tools that can be used for
social listening and sentiment analysis.
4. Describe the process of social media engagement analysis. What metrics would
you consider when evaluating engagement levels?
5. Explain how A/B testing can be used in social media analytics to measure the
success of different content types.
6. How do you measure the impact of influencer marketing on social media
platforms? Discuss relevant metrics.
7. What is social network analysis? Explain its application in identifying key
influencers and communities.
8. Describe the concept of earned, owned, and paid media in social media. How do
they relate to analytics?
9. Discuss how predictive analytics can be applied in social media to forecast
trends and behaviors.
10. What tools are commonly used in social media analytics? Discuss their features
and use cases.
1. Deep Learning (Algorithm-Based Questions)

1. Implement the backpropagation algorithm for a simple 3-layer neural network.

o Given an input, weights, and a target, calculate the error and update the
weights using backpropagation.
2. Write the algorithm for gradient descent optimization.
o Show the steps of updating the weights in a neural network using gradient
descent and explain how the learning rate affects the process.
3. Implement a simple feedforward neural network (FNN) using a single hidden
layer.
o Provide an algorithm for forward propagation and the formula for updating
weights.
4. Write the algorithm for convolution in a Convolutional Neural Network (CNN).
o Explain the convolution process and implement it for a 2D image input.
5. Algorithm for forward and backward propagation in a Recurrent Neural
Network (RNN).
o Describe the steps for forward propagation and backpropagation through
time in an RNN.

2. Distributed Computing (Algorithm-Based Questions)

1. Implement an algorithm for distributed mutual exclusion using a token-based

approach.
o Describe how processes can request and release access to a shared resource in
a distributed system.
2. Write the algorithm for MapReduce in a distributed system.
o Implement the map and reduce functions, and explain how data is distributed
and processed across nodes.
3. Design an algorithm for fault tolerance in a distributed system using
replication.
o Write the steps to maintain consistency and availability in the presence of
node failures.
4. Implement an algorithm for leader election in a distributed system.
o Describe the steps for electing a leader among multiple processes in a
distributed environment.
 5. Write the algorithm for consensus in a distributed system using the Paxos
algorithm.
o Explain the steps in Paxos and how it ensures consensus despite failures.

3. Project Management (Algorithm-Based Questions)

1. Write the algorithm for Critical Path Method (CPM) to determine the project
schedule.
o Implement steps to find the longest path in a project network and determine
the project completion time.
2. Design an algorithm for Resource Leveling in project management.
o Create an algorithm to adjust project schedules so that resource usage is
balanced across time periods.
3. Implement the Program Evaluation and Review Technique (PERT) to calculate
project completion times with uncertainty.
o Develop steps to estimate project duration based on optimistic, pessimistic,
and most likely time estimates.
4. Write an algorithm to perform project scheduling using the Gantt Chart
technique.
o Explain how tasks are scheduled and dependencies are managed using a Gantt
chart.

4. Social Media Analytics (Algorithm-Based Questions)

1. Design an algorithm for sentiment analysis using Natural Language Processing

(NLP).
o Create steps for tokenization, stopword removal, and sentiment classification
of social media posts.
2. Write the algorithm for clustering social media users based on their behavior
(using K-means clustering).
o Implement the steps to divide users into clusters based on metrics like posts,
likes, and comments.
3. Implement an algorithm for predicting social media trends using historical
engagement data.
o Design a time-series forecasting algorithm for predicting the future trends of
hashtags or keywords.
4. Write an algorithm for user recommendation based on social media activity
(Collaborative Filtering).
o Explain how the system can recommend new content to users based on their
past interactions and the interactions of similar users.
5. Design an algorithm to calculate social media engagement metrics (likes,
shares, comments) and derive insights.
o Implement the steps to calculate engagement scores and derive trends or
patterns based on these metrics.
 Distributed Computing - 4 Day Study Tracker (Filled-In)

Day 1: April 20 - Fundamentals & Communication

[x] Introduction to Distributed Systems

[x] Characteristics & Goals

[x] Types: Client-Server, P2P, Clustered

[x] Advantages & Challenges

[x] Centralized vs Distributed

[x] Communication Models

[x] Message Passing

[x] Remote Procedure Call (RPC)

[x] Remote Method Invocation (RMI)

[x] Socket Communication (TCP/UDP)

[x] Group Communication

Day 2: April 21 - Synchronization & Naming

[ ] Clock Synchronization (Cristian, Berkeley, NTP)

[ ] Lamport & Vector Clocks

[ ] Mutual Exclusion Algorithms

[ ] Election Algorithms (Bully, Ring)

[ ] Deadlock Handling in DC

[ ] Flat & Structured Naming

[ ] Name Resolution & Directory Services

[ ] DNS & Naming in DFS

Day 3: April 22 - Consistency, Replication & Fault Tolerance

[ ] Data-Centric Consistency Models

[ ] Client-Centric Consistency Models

[ ] Replication Protocols

[ ] Caching & Update Techniques

[ ] Failure Models (Crash, Omission, Byzantine)

[ ] Redundancy & Recovery (Checkpoint, Logging)

[ ] Reliable Communication Protocols

 Distributed Computing - 4 Day Study Tracker (Filled-In)

Day 4: April 23 - DFS, Case Studies & Final Revision

[ ] Distributed File System Concepts

[ ] Stateless vs Stateful Servers

[ ] NFS & AFS File Systems

[ ] Google File System (GFS)

[ ] HDFS & MapReduce

[ ] Final Revision of Diagrams & Definitions

[ ] Real-Life Examples Recap