Total No. of Questions : 8] SEAT No.

8
23
PA-912 [Total No. of Pages : 3

ic-
[5927]-342

tat
B.E. (Computer Engineering)

6s
DESIGN AND ANALYSIS OF ALGORITHMS

6:0
(2019 Pattern) (Semester - VII) (410241)

02 91
3:3
0
31
Time : 2½ Hours] [Max. Marks : 70
5/0 13
Instructions to the candidates:
0
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
1/2
.23 GP

2) Neat diagrams must be drawn wherever necessary.

3) Figures to the right side indicate marks.
E

4) Assume suitable data, if necessary.

80

8
C

23
ic-
Q1) a) Solve the matrix chain multiplication for the following 6 matrix problem
16

tat
using Dynamic programming. [10]
8.2

6s
Matrix A1 A2 A3 A4 A5 A6
.24

6:0
Dimensions 10×20 20×5 5×15 15×50 50×10 10×15
91
49

3:3
b) Explain Greedy strategy: Principle, control abstraction, time analysis of
30
31

control abstraction with suitable example. [8]

01
02

OR
1/2

Q2) a) Explain the ‘dynamic programming’ approach for solving problems. Write
GP
5/0

a dynamic programming algorithm for creating an optimal binary search

CE

tree for a set of ‘n’ keys. Use the same algorithm to construct the optimal
80

8
23
binary search tree for the following 4 keys. [10]
.23

Key A B C D
ic-
16

tat
Probability 0.1 0.2 0.4 0.3
8.2

6s

b) Explain Dynamic programming: Principle, control abstraction, time

.24

6:0

analysis of control abstraction with suitable example. [8]

91
49

3:3

Q3) a) Explain the ‘branch and bound’ approach for solving problems. Write
30
31

a branch and bound algorithm for solving the 0/1 Knapsack problem.
01
02

Use the same algorithm to solve the following 0/1 Knapsack problem.
1/2

The capacity of the Knapsack is 15 kg. [9]

GP

Item A B C D
5/0
CE

Profit (Rs.) 18 10 12 10
80

Weight (kg.) 9 4 6 2
.23

b) Explain with suitable example Backtracking: Principle, control abstraction,

16

time analysis of control abstraction. [8]

8.2

OR
.24

P.T.O.
49
Q4) a) What is Branch and Bound method? Write control abstraction for Least

8
23
Cost search? [9]

ic-
tat
b) Explain the backtracking with graph coloring problem. Find solution for

6s
following graph [8]

6:0
02 91
3:3
C1 C2 C3 C4 C5

0
31
C1 0 5/0 13
1 0 1 0
0
C2 1 0 1 0 0
1/2
.23 GP

C3 0 1 0 1 1
E
80

8
C4 1 0 1 0 1
C

23
ic-
C5 0 0 1 0 0
16

tat
8.2

6s
.24

6:0
Adjacency matrix for graph G
91
49

3:3
30
31
01
02

Q5) a) Write short notes on the following. [10]

1/2
GP

i) Aggregate Analysis
5/0
CE

ii) Accounting Method

80

8
23
.23

iii) Potential Function method

ic-
16

tat
iv) Tractable and Non-tractable Problems
8.2

6s

b) Write short notes on with suitable example of each [8]

.24

6:0
91
49

3:3

i) Randomized algorithm
30
31

ii) Approximation algorithm

01
02

OR
1/2
GP
5/0

Q6) a) What is Potential function method of amortized analysis? To illustrate

CE
80

Potential method, find amortized cost of PUSH, POP and MULTIPOP

stack operations. [9]
.23
16
8.2

b) What is embedded algorithm? Explain Embedded system scheduling

using power optimized scheduling algorithm. [9]
.24

[5927]-342
49

2
Q7) a) Write short notes on the following. [10]

8
23
i) Multithreaded matrix multiplication.

ic-
tat
ii) Multithreaded merge sort

6s
iii) Distributed breadth first search

6:0
02 91
iv) The Rabin-Karp algorithm

3:3
0
31
b) With respect to Multithreaded Algorithms explain Analyzing multithreaded
5/0 13
algorithms, Parallel loops, Race conditions. [7]
0
1/2
.23 GP

OR
Q8) a) Write and explain pseudo code for Multi-threaded merge sort algorithm.
E
80

8
How parallel merging gives a significant parallelism advantage over Merge
C

23
Sort? [9]

ic-
16

tat
8.2

6s
b) Write a pseudo code for naïve string matching algorithm and Rabin-
.24

6:0
Karp algorithm for string matching and analyze the same. [8]
91
49

3:3
30
31


01
02
1/2
GP
5/0
CE
80

8
23
.23

ic-
16

tat
8.2

6s
.24

6:0
91
49

3:3
30
31
01
02
1/2
GP
5/0
CE
80
.23
16
8.2
.24

[5927]-342
49

3
Total No. of Questions : 8] SEAT No. :

8
23
P-6551 [Total No. of Pages : 3

ic-
tat
[6181]-101

1s
B.E. (Computer Engineering)

6:0
02 91
DESIGN AND ANALYSIS OF ALGORITHM

3:3
0
(2019 Pattern) (Semester-I) (410241)

31
Time : 2½ Hours] 0/1 13 [Max. Marks : 70
0
Instructions to the candidates :
1/2
.23 GP

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
E
83

8
4) Assume suitable data, if necessary.
C

23
ic-
Q1) a) Write High-level description of job sequencing algorithm. Let number of
16

tat
8.2

jobs (n)=5; Profit vector P={20, 15, 10, 5, 1); Deadline vector D={2, 2,

1s
1, 3, 3) Find the feasible solutions. What is the optimal solution and
.24

6:0
91
maximum profit? [9]
49

3:3
b) Consider the following instance of the knapsack problem. Find the optimal
30
31

solution by using dynamic programming approach. [9]

01
02

Item Weight Profit

1/2
GP

1 2 $12
0/1

2 1 $10
CE
83

8
3 3 $20

23
.23

4 2 $15
ic-
16

tat
Capacity of the knapsack = 5.
8.2

1s

OR
.24

6:0

Q2) a) What is Job scheduling algorithm? How job scheduling algorithm can be
91
49

3:3

solved using Greedy algorithmic approach? Explain your answer with

30

respect to Principle, control abstraction, time analysis of control

31

abstraction, of greedy approach for the following instance of Knapsack

01
02

problem. [12]
1/2
GP

Each job is associated with a deadline and profit.

0/1

Job J1 J2 J3 J4 J5
CE
83

Deadline 2 1 3 2 1
.23

Profit 60 100 20 40 20
16

b) Write steps for Greedy approach for Job sequencing. [6]

8.2

P.T.O.
.24
49
Q3) a) What is branch and bound algorithmic strategy? Apply branch n bound

8
23
algorithmic strategy to solve traveling salesman problem for [9]

ic-
tat
1s
6:0
02 91
3:3
0
31
0/1 13
0
1/2
.23 GP
E
83

8
C

23
b) Explain with suitable example Backtracking: Principle, control abstraction,

ic-
time analysis of control abstraction. [8]
16

tat
8.2

OR

1s
.24

6:0
Q4) a) Explain the ‘branch and bound’ approach for solving problems. Write a
91
49

branch and bound algorithm for solving the 0/1 Knapsack problem. Use
3:3
30

the same algorithm to solve the following 0/1 Knapsack problem. The
31

capacity of the knapsack is 15 kg. [9]

01
02

Item A B C D
1/2
GP

Profit(Rs.) 18 10 12 10
0/1

Weight (Kg.) 9 4 6 2
CE
83

8
23
b) What is sum of subset problem? Solve sum of subset problem for following
.23

ic-
instance using backtracking approach [8]
16

tat
Input: set[ ] = {2, 3, 5, 6, 8, 10}, sum = 10
8.2

1s
.24

6:0

Q5) a) What is amortized analysis? Explain the aggregate method with example.[9]
91
49

3:3
30

b) What is Potential function method of amortized analysis? To illustrate

31

Potential method, find amortized cost of PUSH, POP and MULTIPOP

01
02

stack operations. [9]

1/2
GP

OR
0/1
CE
83

Q6) a) What are special needs of embedded algorithm? Which sorting algorithm
.23

is best for embedded systems? Why? [6]

16

b) Explain Randomized and Approximate algorithms. [4]

8.2
.24

[6181]-101 2
49
 c) What is randomized algorithm? Give any example of randomized algorithm?

8
23
Also explain Random variable, Binomial random variable and-Mathematics

ic-
for Randomized algorithm. [8]

tat
1s
6:0
Q7) a) i) Explain an algorithm for Distributed Minimum Spanning Tree.

02 91
3:3
ii) Write and explain Rabin-Karp algorithm for string matching. [10]

0
31
b)
0/1 13
With respect to Multithreaded Algorithms explain Analyzing multithreaded
0
1/2
algorithms, Parallel loops, Race conditions. [7]
.23 GP

OR
E
83

8
C

23
Q8) a) Write and explain pseudo code for Multi-threaded merge sort algorithm.

ic-
How parallel merging gives a significant parallelism advantage over Merge
16

tat
Sort? [9]
8.2

1s
b) For string matching, working module q = 11, how many spurious hits
.24

6:0
91
does the Rabin- Karp matcher encounters in Text T = 31415926535.....[8]
49

3:3
30
31

i) T = 31415926535
01
02

ii) P=26
1/2
GP

iii) Here [Link] = 11 so Q = 11

0/1
CE
83

8
iv) And P mod Q = 26 mod 11 = 4

23
.23

v) Now find the exact match of P mod Q...

ic-
16

tat
8.2

1s


.24

6:0
91
49

3:3
30
31
01
02
1/2
GP
0/1
CE
83
.23
16
8.2
.24

[6181]-101 3
49
Total No. of Questions : 8] SEAT No. :

8
23
P3147 [Total No. of Pages : 3

ic-
[6004]-480A

tat
B.E. (Computer Engineering)

6s
3:3
DESIGN ANALYSIS OF ALGORITHMS

02 91
4:4
(2019 Pattern) (Semester - VII) (410241)

0
31
Time : 2½ Hours]
1/0 13 [Max. Marks : 70
0
6/2
Instructions to the candidates:
.23 GP

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

E

2) Neat diagrams must be drawn wherever necessary.

82

8
C

23
3) Figures to the right indicate full marks.

ic-
4) Assume suitable data, if necessary.
16

tat
8.2

6s
Q1) a) Consider the following instance of the knapsack problem. Find the
.24

3:3
optimal solution by using dynamic programming approach. [10]
91
49

4:4
Item Weight Profit
30
31

1 2 $12
01
02

2 1 $10
6/2
GP

3 3 $20
1/0
CE

4 2 $15
82

8
23
Capacity of the knapsack = 5.
.23

ic-
16

b) What is job scheduling algorithm? How job scheduling algorithm can be

tat
8.2

solved using Greedy algorithmic approach? Explain your answer with

6s

respect to Principle, control abstraction, time analysis of control

.24

3:3
91

abstraction, of greedy approach for the following instance of knapsack

49

4:4

problem. [8]
30
31

Each job is associated with a deadline and profit.

01
02

Job J1 J2 J3 J4 J5
6/2
GP

Deadline 2 1 3 2 1
1/0
CE

Profit 60 100 20 40 20
82
.23

OR
16

Q2) a) What is greedy approach? Explain Job scheduling algorithm using Greedy
8.2

approach for following examples. Give the sequence of job scheduling.

.24

[8]
P.T.O.
49
 Input: Four jobs with following deadlines and profits

8
23
Job1D deadline Profit

ic-
a 4 20

tat
b 1 10

6s
c 1 40

3:3
02 91
d 1 30

4:4
Input: Five Jobs with following deadlines and profits

0
31
Job1D 1/0 13
Deadline Profit
0
a 2 100
6/2
.23 GP

b 1 19
c 2 27
E
82

8
C

23
d 1 25

ic-
e 3 15
16

tat
8.2

6s
b) What is optimal binary search tree? How dynamic programming approach
.24

3:3
is used to build OBST for following tale. [10]
91
49

4:4
1 2 3 4
30
31

Keys→ 10 20 30 40
01
02

Frequency→ 4 2 6 3
6/2
GP
1/0

Q3) a) Explain with suitable example Backtracking: Principle, control

CE
82

8
abstraction, time analysis of control abstraction. [8]

23
.23

b) Compare between greedy method and dynamic programming with

ic-
16

respect to. [9]

tat
8.2

i) Feasibility.
6s
.24

3:3

ii) Optimality.
91
49

iii) Recursion.
4:4
30

iv) Memorization.
31
01

v) Time complexity.
02
6/2

OR
GP
1/0

Q4) a) What is sum of subset problem? Solve sum of subset problem for
CE

following instance using backtracking approach. [8]

82

Input : set [] = {2, 3, 5, 6, 8, 10}, sum = 10

.23

b) What is Branch and Bound method? Write control abstraction for Least
16

cost search? [9]

8.2
.24

[6004]-480A 2
49
Q5) a) What is amortized analysis? Explain aggregate and potential function

8
23
methods used for amortized analysis with respect to stack operations?[9]

ic-
b) What is potential function method, of amortized analysis? To illustrate

tat
potential method, find amortized cost of PUSH, POP and MULTIPOP

6s
stack operations. [9]

3:3
02 91
OR

4:4
0
Q6) a) Write short notes on the following. [10]

31
1/0 13
i) Aggregate analysis.
0
6/2
.23 GP

ii) Accounting Analysis.

iii) Potential function method.
E
82

8
iv) Tractable and Non-tractable problems.
C

23
ic-
b) Write short notes on with suitable example of each. [8]
16

tat
i) Randomized algorithm.
8.2

6s
.24

ii) Approximation algorithm.

3:3
91
49

4:4
30
31

Q7) a) Write and explain pseudo code for multi-threaded merge sort algorithm.
01

How parallel merging gives a significant parallelism advantage over merge

02

Sort? [9]
6/2
GP
1/0

b) i) Explain an algorithm for Distributed Minimum Spanning Tree. [8]

CE
82

ii) Write and explain Rabin-Karp algorithm for string matching.

8
23
.23

OR
ic-
16

tat
Q8) a) Write short notes on the following. [10]
8.2

6s

i) Multithreaded matrix multiplication.

.24

3:3
91

ii) Multithreaded merge sort.

49

4:4
30

iii) Distributed breadth first search.

31

iv) The Rabin-Karp algorithm.

01
02
6/2

b) With respect to Multithreaded Algorithms explain Analyzing

GP

multithreaded algorithms, Parallel loops, Race conditions. [7]

1/0
CE
82
.23

  
16
8.2
.24

[6004]-480A 3
49
Total No. of Questions : 8] SEAT No. :

7
23
PC-2368 [Total No. of Pages : 4

ic-
tat
[6354]-485

9s
B.E. (Computer Engineering)

4:3
02 91
DESIGN AND ANALYSIS OF ALGORITHMS

3:4
0
(2019 Pattern) (Semester - VII) (410241)

41
Time : 2½ Hours]
1/1 13 [Max. Marks : 70
0
Instructions to the candidates :
2/2
.23 GP

1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

2) Neat diagrams must be drawn wherever necessary.
E
71

3) Assume suitable data if necessary.

7
C

23
4) Figures to the right indicate full marks.

ic-
16

tat
Q1) a) You are given a set of tasks, each with a deadline and a penalty for
8.2

9s
missing the deadline. The objective is to schedule these tasks in a way
.24

4:3
that minimizes the total penalty incurred. However, you can only work on
91
49

3:4
one task at a time, and once a task is started, it must be completed before
30
41

moving on to the next task. Additionally, you can't start a task after its
deadline has passed. Design a greedy algorithm to efficiently schedule
01
02

these tasks to minimize the total penalty and prove its correctness. [8]
2/2
GP

b) Suppose we have a knapsack with a maximum weight capacity of 15 units,

1/1

and we have the following items with their respective weights (Wi) and
CE
71

7
values (Vi) :

23
.23

Objects Weight Value

ic-
16

tat
O1 8 10
8.2

9s
.24

O2 6 8
4:3
91
49

3:4

O3 4 3
30
41

O4 2 4
01
02

Use greedy approach to maximize the total value of items we can put into
2/2

the knapsack without exceeding its weight capacity. [8]

GP
1/1

c) With respect to dynamic programming, what do you understand by optimal

CE
71

substructure? [2]
.23

OR
16
8.2

P.T.O.
.24
49
Q2) a) We are given the sequence {4, 10,3, 12,20, and 7}. We are given with five

7
23
matrices of the size 4 × 10, 10 × 3,3 × 12, 12 × 20,20 × 7 respectively.

ic-
Use dynamic programming to solve chain matrix multiplication. [10]

tat
b) Under what situation do you think the dynamic programming approach

9s
for solving a knapsack problem might struggle to find the optimal solution?

4:3
Briefly explain. [4]

02 91
3:4
0
c) Enlist the uses of writing control abstraction for any algorithmic strategies.[4]

41
1/1 13
0
2/2
.23 GP

Q3) a) Consider a graph represented by the adjacency matrix given below :

E

A B C D E F G
71

7
C

23
A 0 1 1 0 0 0 0

ic-
16

tat
B 1 0 0 1 1 0 0
8.2

9s
C 1 0 0 0 0 1 1
.24

4:3
91
49

3:4
D 0 1 0 0 0 0 0
30
41

E 0 1 0 0 0 0 0
01
02

F 0 0 1 0 0 0 0
2/2
GP
1/1

G 0 0 1 0 0 0 0
CE
71

7
Use a recursive backtracking algorithm to colour this graph with three

23
.23

colours R,G,B [8]

ic-
16

tat
b) Consider three items along with respective weights and value as
8.2

9s
.24

4:3

Weight Value
91
49

3:4

O1 10 12
30
41

O2 8 10
01
02
2/2

O3 6 8
GP
1/1

Assume the Knapsack capacity m = 14. Solve this 0/1 Knapsack problem
CE
71

using LC branch and bound method. [9]

.23

OR
16
8.2
.24

[6354]-485 2
49
Q4) a) We have a salesman who needs to visit four cities (A, B, C, D) and return to

7
23
the starting city. The distances between these cities are as follows :

ic-
Distance from A to B: 10 units

tat
9s
Distance from A to C: 15 units

4:3
02 91
Distance from A to D: 20 units

3:4
0
41
Distance from B to C: 35 units
1/1 13
0
Distance from B to D: 25 units
2/2
.23 GP

Distance from C to D: 30 units

E
71

7
Find the shortest possible route that visits each city exactly once and returns
C

23
to the starting city. Use branch and bound method to find the optimum route

ic-
16

for traveling salesman, assume A as a starting point of the tour. [8]

tat
8.2

9s
b) Write a short note on LC branch and bound method. [5]
.24

4:3
91
49

c) What are the drawbacks of branch and bound method? [4]

3:4
30
41
01
02

Q5) a) What are the advantages and disadvantages of : [8]

2/2
GP
1/1

i) Aggregate Analysis
CE
71

7
23
ii) Accounting Method
.23

b) What are approximation algorithms? Based on the approximation ratio, ic-

16

tat
8.2

classify the approximation algorithms. [9]

9s
.24

4:3

OR
91
49

3:4

Q6) a) Why potential function method cannot be used for analysing binary
30
41

counter? Explain [8]

01
02
2/2

b) Comment on the following statements : [9]

GP

i) “The knapsack problem is NP-hard”

1/1
CE
71

ii) “Boolean Satisfiability Problem (SAT) is NP-complete”

.23

iii) “Minimum spanning tree is tractable problem”

16
8.2
.24

[6354]-485 3
49
Q7) a) Write a Rabin-Karp string matching algorithm. Let input to the algorithm

7
23
be Original text “t” of length n and pattern text being matched is “p” of

ic-
length m. What is the expected runtime and worst–case runtime of this

tat
algorithm? [10]

9s
b) Briefly explain performance measures – speedup, efficiency, throughput,

4:3
contention, and latency of rnultithreaded algorithms. [8]

02 91
3:4
OR

0
41
Q8) a) Consider the graph represented by an adjacency matrix : [10]
1/1 13
A B C D E F G
0
2/2
.23 GP

A 0 1 1 0 0 0 0
E

B 1 0 0 1 1 0 0
71

7
C

23
C 1 0 0 0 0 1 1

ic-
16

tat
D 0 1 0 0 0 0 0
8.2

9s
.24

E 0 1 0 0 0 0 0
4:3
91
49

3:4
F 0 0 1 0 0 0 0
30
41

G 0 0 1 0 0 0 0
01
02
2/2

Show stepwise process how the distributed breadth first search algorithm
GP

works on the above graph.

1/1
CE
71

b) If we have two matrices of the order m x n and n x p then what will be the

7
23
time complexity of multiplying these matrices in conventional approach
.23

and in multithreaded approach. Discuss. ic-

[8]
16

tat
8.2

9s
.24

4:3

♦♦♦
91
49

3:4
30
41
01
02
2/2
GP
1/1
CE
71
.23
16
8.2
.24

[6354]-485 4
49
Total No. of Questions : 8] SEAT No. :

8
23
PB2243 [6263]-81 [Total No. of Pages :3

ic-
tat
B.E. (Computer Engineering)

9s
DESIGN AND ANALYSIS OF ALGORITHMS

7:3
02 91
(2019 Pattern) (Semester- VII) (410241)

3:4
0
41
Time : 2½ Hours ] 9/0 13 [Max. Marks : 70
0
Instructions to the candidates:
5/2
.23 GP

1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
80

8
3) Assume suitable data if necessary.
C

23
ic-
4) Figures to the right indicate maximum marks.
16

tat
8.2

9s
Q1) a) Write a control abstraction for greedy method. Comment on the time
.24

7:3
complexity of this abstraction? [6]
91
b) Find an optimal solution for the following knapsack instance using greedy
49

3:4
method. Number of objects n = 5. Capacity of knapsack m = 100. [8]
30
41

Objects Weight Profit

01
02

01 20 10
5/2
GP

02 30 20
9/0

03 66 30
CE

04 40 40
80

8
23
05 60 50
.23

ic-
c) Comment on the statement “Problem which does not satisfy the principle
16

tat
of optimality cannot be solved by dynamic programming”. [4]
8.2

9s

OR
.24

7:3
91

Q2) a) Write a control abstraction for dynamic programming strategy. Comment

49

3:4

on the time complexity of this abstraction? [8]

30
41

b) Consider 4 matrices A1, A2, A3 and A4. The orders of these matrices
01
02

are given below: [10]

5/2

Matrix Order
GP

A1 3×5
9/0

A2 5×4
CE
80

A3 4×2
.23

A4 2×4
16

Find the optimal sequence of chain matrix multiplication of these matrices

8.2

using dynamic programming approach. Clearly give the final sequence

and total number of multiplications involved.
.24

P.T.O.
49
Q3) a) Assume that a graph with n vertices is represented by an adjacency

8
23
matrix G. Let there be “m” number of colours available. Write a recursive

ic-
backtracking algorithm to colour all the vertices of the graph. What is the

tat
time complexity of this algorithm? [8]

9s
b) Consider three items along with respective weights and value as [9]

7:3
02 91
Weight Value Value/Weight

3:4
0
41
O1 5 6 6/5 = 1.2
9/0 13
O2 4 5 5/4 = 1.25
0
5/2
.23 GP

O3 3 4 4/3 = 1.3
Assume the Knapsack capacity m = 7. Solve this 0/1 Knapsack problem
E
80

8
C

using LC branch and bound method.

23
ic-
16

tat
OR
8.2

9s
.24

7:3
Q4) a) Compare backtracking with branch and bound method with respect to:
91
49

search technique, exploration of state space tree and king of problems

3:4
30

that can be solved. [8]

41
01

b) Consider set A of five numbers {5,10,15,20.25}. We wish to find the

02

subset of A such that sum of the numbers in this subject is equal to 30.
5/2
GP

Solve this problem to find the first solution using backtracking approach.
9/0

Show space tree being created. [9]

CE
80

8
23
Q5) a) What are randomized algorithms? Enlist and explain in brief the primary
.23

reasons for using randomized algorithms. [8]

ic-
16

tat
b) What are approximation algorithms? Based on the approximation ratio,
8.2

9s

classify the approximation algorithms. [9]

.24

7:3
91
49

3:4

OR
30
41
01
02

Q6) a) Explain the methods of amortized analysis. Give suitable example. [8]
5/2
GP

b) Suppose you are working on an embedded system for a medical device

9/0

that monitors patient vital signs. The device continuously collects data
CE
80

from various sensors and needs to process and display this information
.23

in real-time. The data includes timestamps, temperature readings, heart

rate, and blood pressure measurements. Suggest suitable sorting algorithm
16

for this scenario. Clearly justify your answer with respect to key factors.
8.2

[9]
.24
49

[6263]-81 2
Q7) a) Write a Rabin-Karp string matching algorithm. Input to the algorithm be:

8
23
Original text “t” of length n and pattern text being matched is “p” of

ic-
length m. What is the expected runtime and worst-case runtime of this

tat
algorithm? [10]

9s
b) Write multi-threaded merge sort algorithm. Briefly discuss how does it

7:3
differ from conventional merge sort. [8]

02 91
3:4
0
41
9/0 13
0 OR
5/2
.23 GP

Q8) a) Consider the graph represented by an adjacency matrix: [10]

A B C D E F G
E
80

8
C

23
A 0 1 1 0 0 0 0

ic-
16

B 1 0 0 1 1 0 0

tat
8.2

9s
C 1 0 0 0 0 1 1
.24

7:3
91
D 0 1 0 0 0 0 0
49

3:4
30

E 0 1 0 0 0 0 0
41
01
02

F 0 0 1 0 0 0 0
5/2
GP

G 0 0 1 0 0 0 0
9/0

Show stepwise process how the distributed breadth first search algorithm
CE
80

8
works on the above graph.

23
.23

b) What do you understand by spawn and sync keywords used in ic-

16

tat
multithreaded programming? Explain with the help of suitable example.
8.2

9s

[8]
.24

7:3
91
49

3:4
30
41
01
02


5/2
GP
9/0
CE
80
.23
16
8.2
.24
49

[6263]-81 3
Total No. of Questions : 8] SEAT No. :

7
23
PD4576 [Total No. of Pages : 3

ic-
tat
[6404]-81

7s
B.E.(Computer Engineering)

1:4
02 91
DESIGN AND ANALYSIS OF ALGORITHMS

3:4
(2019 Pattern) (Semester - VII) (410241)

0
51
3/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
71

7
C

3) Assume suitable data, if necessary.

23
4) Figures to the right indicate full marks.

ic-
16

tat
8.2

7s
Q1) a) Give a mathematical formulation for: [8]
.24

1:4
91
i) Fractional Knapsack problem
49

3:4
30

ii) 0/1 Knapsack problem.

51
01
02

b) Consider a set of seven activities. The start and finish time of these
activities are given in the following table. [9]
5/2
GP
3/0

Activity Start time Finish time

CE
71

7
A 1 3

23
.23

B 3 4
ic-
16

tat
8.2

C 2 5
7s
.24

1:4

D 0 7
91
49

3:4

E 5 9
30
51

F 8 10
01
02
5/2

G 11 12
GP
3/0

Use the greedy algorithmic strategy to compute an execution schedule

CE

having maximum number of non-conflicting activities.

71
.23
16

OR
8.2
.24

P.T.O.
49
Q2) a) With respect to dynamic programming, what is the principle of optimality?

7
23
Give a mathematical representation for the same. [7]

ic-
b) Consider the 0/1 Knapsack problem with the total weight capacity of 7.

tat
The weights and associated values (profits) of 4 items are given below.

7s
Use dynamic programming approach to find the optimal solution to this
problem. [10]

1:4
02 91
Item Weight Value(Profit)

3:4
0
A 1 1

51
B 3/0 13
3 4
0
5/2
C 4 5
.23 GP

D 5 7
E
71

Q3) a) Consider a graph, which is represented by the adjacency matrix given

7
C

23
below: [10]

ic-
A B C D
16

tat
A 0 1 1 0
8.2

7s
.24

B 1 0 0 1
1:4
91
49

C 1 0 0 1
3:4
30

D 0 1 1 0
51
01

We wish to colour this graph using Red and Black colours using a
02

backtracking algorithm. Show the process of colouring it in stepwise manner

5/2
GP

using state space diagram.

3/0
CE
71

7
b) Prove that the full state space tree of finding sum of subset of n elements

23
using backtracking will have (excluding the leaf nodes)2n-1 nodes. [4]
.23

c) What are the major drawbacks of branch and bound method? ic-
[4]
16

tat
8.2

OR
7s
.24

1:4

Q4) a) State the sum of subsets problem. Write an algorithm to solve this
91

problem using backtracking method. Comment on the time complexity

49

3:4

of this algorithm. [8]

30
51

b) Consider the three objects. The weights and associated values are given
01
02

below.
5/2
GP

weight value
3/0

O1 5 6
CE
71

O2 4 5
.23

O3 3 4
16

Assume the Knapsack capacity m = 7. Solve this 0/1 Knapsack problem

8.2

using LC branch and bound method. [10]

.24
49

[6404]-81 2
Q5) a) Give an amortized analysis of a k bit binary counter using aggregate

7
23
method. [6]

ic-
b) What are tractable and non-tractable problems? Give examples. [7]

tat
7s
c) Does randomized algorithm for quick sort, improves the average case

1:4
time complexity? [4]

02 91
3:4
OR

0
51
Q6) a)
3/0 13
Explain with the help of example the methods of amortized analysis. [6]
0
5/2
.23 GP

b) What is an approximation algorithm? How does performance ratios

useful in approximation algorithms? [7]
E
71

7
C

c) What are randomized algorithms? Enlist few reasons to use randomized

23
algorithms. [4]

ic-
16

tat
8.2

7s
.24

1:4
Q7) a) Write a simple multithreaded matrix multiplication algorithm based on
91
parallelizing relevant loops of the conventional procedure. [8]
49

3:4
30
51

b) Explain in brief race condition in multithreaded algorithms. [4]

01
02

c) What do you understand by spawn and sync keywords used in

5/2
GP

multithreaded programming? [6]

3/0

OR
CE
71

7
23
.23

Q8) a) Write distributed breadth search algorithm. What is its advantage over
the conventional approach? [8]ic-
16

tat
8.2

7s

b) Write a Rabin-Karp string matching algorithm. Input to the algorithm be:

.24

Original text “t” of length n and pattern text being matched is “p” of
1:4
91

length m. What is the expected runtime and worst-case runtime of this

49

3:4

algorithm? [10]
30
51
01
02
5/2
GP
3/0

… … …
CE
71
.23
16
8.2
.24
49

[6404]-81 3
Total No. of Questions : 8] SEAT No. :

8
23
PA-913 [Total No. of Pages : 3

ic-
[5927]-343

tat
1s
B.E. (Computer)

5:1
02 91
MACHINE LEARNING

3:4
0
(2019 Pattern) (Semester - VII) (410242)

31
2/0 13
0
1/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:

E

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q6, Q.7 or Q.8.

81

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
8.2

4) Make suitable assumption whenever necessary.

1s
.24

5:1
91
49

3:4
Q1) a) Explain in brief techniques to reduce under fitting and over fitting. [6]
30
31

b) Find the Equation of linear Regression line using following data : [6]
01
02

X Y
1/2
GP
2/0

1 3
CE
81

8
2 4

23
.23

3 5
ic-
16

tat
4 7
8.2

1s
.24

5:1

c) Write short note on : [6]

91
49

3:4

i) MAE
30
31

ii) RMSE
01
02

iii) R 2
1/2
GP
2/0

OR
CE
81

Q2) a) Explain in brief lasso and Ridge Regression. [6]

.23

b) What is Bias and variance trade off for machine learning model? [6]
16
8.2

c) Write short note on Evaluation metrics. [6]

.24
49

P.T.O.
Q3) a) Explain in brief methods used for Evaluating classification models.

8
[5]

23
ic-
b) Consider the following data to predict the student pass or fail using the

tat
K-Nearest Neighbor Algorithm (KNN) for the values physics = 6 marks,

1s
Chemistry = 8 marks with number of Neighbors K = 3. [6]

5:1
02 91
Physics (marks) Chemistry (marks) Results

3:4
0
4 3 Fail

31
2/0 13
6 7 Pass
0
1/2
.23 GP

7 8 Pass
5 5 Fail
E
81

8
C

23
8 8 Pass

ic-
16

tat
c) Write short note on Ensemble learing methods : [6]
8.2

1s
i) Simple
.24

5:1
91
ii) Advanced
49

3:4
30
31

OR
01
02

Q4) a) Explain Random forest Algorithm with example. [5]

1/2
GP

b) Write short note on importance of confusion matrix. [6]

2/0
CE

c) Define following terms with reference to SVM. [6]

81

8
23
.23

i) Separating hyperplane
ic-
16

tat
ii) Margin
8.2

1s
.24

5:1
91
49

Q5) a) Explain Density Based clustering with refence to DBSCAN, OPTICS

3:4
30

and DENCLUE. [6]

31
01

b) What is K mean clustering? Explain with example. [6]

02
1/2
GP

c) Write short note on following Hierarchical clustering method : [6]

2/0

i) Agglomerative
CE
81

ii) Dendogram
.23
16

OR
8.2
.24
49

[5927]-343 2
Q6) a) What is LOF? Explain it with it's advantages and disadvantages. [6]

8
23
b) Explain Graph Based clustering. [6]

ic-
c) Define following terms : [6]

tat
1s
i) Elbow method

5:1
02 91
ii) Extrinsic and Intrinsic method

3:4
0
31
2/0 13
Q7) a) Explain ANN with it's Architecture. [5]
0
1/2
.23 GP

b) Obtain the output of Neuron Y for the Network shown in following

fig. Using activation function as : [6]
E
81

8
C

23
i) Binary sigmoidal

ic-
ii) Bipolar sigmoidal
16

tat
8.2

1s
.24

5:1
91
49

3:4
30
31
01
02
1/2
GP
2/0
CE
81

8
23
c) Write short note on Back propagation network. [6]
.23

OR ic-
16

tat
8.2

1s

Q8) a) Explain in brief types of ANN based on layers. [5]

.24

5:1

b) What is Recurrent Neural Network? Explain with suitable example.

91
49

3:4

[6]
30
31

c) Write short note on with refernce with CNN. [6]

01
02

i) Convolution layer
1/2
GP
2/0

ii) Hidden layer

CE
81
.23


16
8.2
.24
49

[5927]-343 3
Total No. of Questions : 8] SEAT No. :

8
23
P-6552 [Total No. of Pages : 2

ic-
[6181]-102

tat
5s
B.E. (Computer Engineering)

7:5
02 91
MACHINE LEARNING

3:3
0
(2019 Pattern) (Semester - VII) (410242)

31
2/1 13
0
Time : 2½ Hours] [Max. Marks : 70
2/2
.23 GP

Instructions to the candidates:

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
E
80

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right side indicate full marks.
16

tat
4) Assume suitable data if necessary.
8.2

5s
.24

7:5
Q1) a) Differentiate between overfitting and underfitting. [6]
91
49

3:3
b) The table below shows the number of grams of carbohydrates, X and
30
31

the number of Calories, Y of six different foods. Find linear regression

equation for this dataset. [8]
01
02
2/2

Carbohydrates (X) 8 9.5 10 6 7 4

GP
2/1

Calories (Y) 12 138 147 88 108 62

CE

Also find the value of Y for X = 12

80

8
23
c) Explain Bias Variance Trade off. [4]
.23

OR ic-
16

tat
8.2

Q2) a) What is Linear Regression? Explain the concept of Ridge regression.

5s

[9]
.24

7:5
91

b) Explain the following Evaluation Metrics : [9]

49

3:3
30

i) MAE
31

ii) RMSE
01
02

iii) R2
2/2
GP
2/1
CE

Q3) a) Differentiate between bagging and boosting. [4]

80

b) What is ensemble learning? Explain the concept of Random Forest

.23

ensemble learning. [9]

16

c) What is the relation between precision and recall? Explain with an

8.2

example. [4]
.24
49

P.T.O.
 OR

8
23
Q4) a) What is K-fold cross-validation? In K-fold cross-validation, comment

ic-
on the following situations [9]

tat
i) When the value of K is too large

5s
7:5
ii) When the value of K is too small.

02 91
3:3
How do you decide the value of k in k-fold cross-validation?

0
31
b) 2/1 13
Explain i) Accuracy, ii) Precision, iii) Recall, and iv) F-Score [8]
0
2/2
.23 GP

Q5) a) Explain K-Means clustering in detail with a suitable example. [8]

E
80

8
C

23
b) What is outlier analysis? How is Local Outlier Factor detected? [5]

ic-
c) Explain Spectral Cluster in galgorithm. [5]
16

tat
8.2

5s
OR
.24

7:5
Q6) a) Explain Hierarchical and Density-based Clustering approaches. [9]
91
49

3:3
b) Write short note on : [9]
30
31

i) Optimization of clusters
01
02
2/2

ii) K-Medoids
GP
2/1

iii) Evaluation metrics

CE
80

8
23
.23

Q7) a) Write a note on Single Layer Neural Network. ic-[4]

16

tat
8.2

5s

b) Explain Radial Basis Function networks in detail. [8]

.24

7:5

c) Explain Recurrent Neural Networks and its applications in brief. [5]

91
49

3:3
30

OR
31
01

Q8) a) Explain the concept of Back Propagation in ANN with example. [8]
02
2/2
GP

b) What is Functional Link Artificial Neural Network (FLANN)? Explain

2/1

its merits over other ANNs. [5]

CE
80

c) What is Activation Function? Explain with a suitable example. [4]

.23
16
8.2


.24
49

[6181]-102 2
Total No. of Questions : 8] SEAT No. :

8
23
P546 [Total No. of Pages : 2
[6004]-481

ic-
tat
B.E. (Computer Engineering)

5s
MACHINE LEARNING

7:2
(2019 Pattern) (Semester - VII) (410242)

02 91
4:3
Time : 2½ Hours] [Max. Marks : 70

0
31
Instructions to the candidates:
2/0 13
1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6 and Q.7 or Q.8.
0
2) Figures to the right indicate full marks.
6/2
.23 GP

3) Neat diagrams must be drawn wherever necessary.

4) Assume suitable data, if necessary.
E
82

8
C

23
ic-
Q1) a) Explain the following terms with suitable examples. [6]
16

tat
i) Bias
8.2

5s
ii) Variance
.24

7:2
91
iii) Under fitting and Over fitting
49

4:3
30

b) Differentiate between Lasso Regression and Ridge Regression. [6]

31
01

c) Explain gradient descent algorithm with example. [6]

02
6/2
GP

OR
2/0

Q2) a) What do you mean by regression? Explain with suitable example. [6]
CE
82

38
b) Write a short note on : [6]

c-2
.23

i) MAE
i
16

tat
ii) RMSE
8.2

5s

iii) R2
.24

7:2
91
49

c) What is gradient descent? Compare batch gradient and stochastic gradient

4:3
30

descent. [6]
31
01
02
6/2

Q3) a) Explain with example the variant of SVM, the support vector regression.
GP

[5]
2/0

b) What do you mean by ensemble learning?Differentiate between bagging

CE
82

& boosting. [6]

.23

c) What are different variants of multi-class classification? Explain them

16

with suitable example. [6]

8.2

OR
.24

P.T.O.
49
Q4) a) Calculate macro average precision, macro average recall and macro

8
23
average F-score for the following given confusion matrix of multi-class

ic-
classification. [6]

tat
Predictions 

5s
A B C D

7:2
A 100 80 10 10

02 91
4:3
B 0 9 0 1

0
Actual values 

31
2/0 13 C 0 1 8 1
D 0 1 0 9
0
6/2
.23 GP

b) Write a short note on : [6]

i) Random forest.
E
82

8
ii) Adaboost.
C

23
c) Discuss K-nearest neighbour algorithm with suitable example. [5]

ic-
16

tat
8.2

5s
Q5) a) With reference to Clustering explain the issue of “Optimization of Clusters”.
.24

7:2
[6]
91
49

b) Compare Hierarchical clustering and K-means clustering. [6]

4:3
30

c) Explain how a cluster is formed in the density based clustering algorithm.

31

[6]
01
02

OR
6/2
GP

Q6) a) How would you choose the number of clusters when designing a K-
2/0

Medoid clustering algorithm? [6]

CE
82

38
b) Write a short note on out lier analysis with respect to clustering. [6]

c-2
.23

c) Differentiate between K-means and Spectral clustering. [6]

i
16

tat
8.2

5s

Q7) a) What are building blocks of neural network, elaborate? [5]

.24

7:2

b) Describe characteristics of back propagation algorithm. [6]

91
49

4:3

c) Write a short note on Recurrent neural n/w & convolutional neural n/w.
30

[6]
31

OR
01
02

Q8) a) Explain artificial neural n/w based on perception concept with diagram.
6/2
GP

[6]
2/0

b) Describe multi-layer neural n/w. Explain why back propagation algorithm

CE
82

is required. [6]
.23

c) Discuss any two activation functions with example. [5]

16


8.2
.24

[6004]-481 2
49
Total No. of Questions : 8] SEAT No. :

7
23
PC-2369 [Total No. of Pages : 2

ic-
[6354]-486

tat
3s
B.E. (Computer Engineering)

7:1
MACHINE LEARNING

02 91
3:3
(2019 Pattern) (Semester - VII) (410242)

0
41
3/1 13
0
2/2
Time : 2 ½Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates:

E
71

1) Answer Q.1 OR Q.2, Q.3 OR Q.4, Q.5 OR Q.6, Q.7 OR Q.8.

7
C

23
2) Figures to the right side indicate full marks.

ic-
3) Draw neat diagram wherever necessary.
16

tat
8.2

4) Assume suitable data, if necessary.

3s
.24

7:1
91
49

3:3
Q1) a) Explain Lasso Regression. Explain how Lasso Regression is used for
30
41

feature selection. [6]

01
02

b) Define different regression models. [6]

2/2
GP
3/1

c) Describe the bias-variance trade-off and its relationship to under fitting

CE
71

7
and overfitting. [6]

23
.23

OR
ic-
16

tat
8.2

3s

Q2) a) Explain the advantages of RMSE over MSE as an evaluation metric. [6]
.24

7:1
91

b) What do you mean by least square method? Explain least square method
49

3:3

in the context of linear regression. [6]

30
41

c) Write a short note on Stochastic gradient descendent algorithms. [6]

01
02
2/2
GP
3/1
CE

Q3) a) Explain kernel methods which are suitable for SVM. [6]
71
.23

b) What are advantages and disadvantages of K-NN? [6]

16

c) What are different distance metrics are used in K-NN? [5]

8.2
.24
49

P.T.O.
 OR

7
23
Q4) a) What is Multi Class Classification? Explain the variants of Multi Class

ic-
Classification. [5]

tat
b) What are different techniques used for outlier handing? [6]

3s
7:1
c) With suitable diagram, Explain Random forest Algorithm with example.[6]

02 91
3:3
0
41
Q5) a) Why K-medoid is used? Explain K-medoid algorithm. [5]
3/1 13
b) Why density based clustering is used? Explain any one. [6]
0
2/2
.23 GP

c) Cluster the following eight points (with (x, y) representing locations) into
three clusters: [6]
E
71

7
P1(1, 3), P2(2, 2), P3(5, 8), P4(8, 5), P5(3, 9), P6(10, 7), P7(3, 3),
C

23
P8(9, 4), P9(3, 7)

ic-
16

tat
Use K-Means Algorithm to find the three cluster
8.2

3s
OR
.24

7:1
91
Q6) a) What is isolation factor model? [5]
49

3:3
30

b) Explain Hierarchical Clustering with an example. [6]

41

c) Micro-Average Precision and Recall, Micro-Average F-score, [6]

01
02
2/2
GP
3/1

Q7) a) Explain Recurrent Neural Networks with an example. [6]

CE
71

7
b) What are different activation function used in NN? [6]

23
.23

ic-
c) What is multilayer perceptron? Describe with diagram. [6]
16

tat
OR
8.2

3s

Q8) a) Explain building blocks of RBF networks. [6]

.24

7:1
91

b) What is personalized recommendation? What is content based

49

3:3

recommendation? [6]
30
41

c) Explain the Convolution Neural Network (CNN) with suitable example.[6]

01
02
2/2
GP
3/1
CE
71

JJJ
.23
16
8.2
.24
49

[6354]-486 2
Total No. of Questions : 8] SEAT No. :

8
23
PB-2244 [Total No. of Pages : 2

ic-
tat
[6263]-82

1s
1:5
B.E. (Computer Engineering)

02 91
3:3
MACHINE LEARNING

0
41
4/0 13
(2019 Pattern) (Semester - VII) (410242)
0
5/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :

E
81

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

8
C

23
2) Figures to the right side indicate full marks.

ic-
3) Draw neat diagram wherever necessary.
16

tat
4) Assume suitable data, if necessary.
8.2

1s
.24

1:5
91
Q1) a) Define different regression models. [6]
49

3:3
30

b) What are different techniques to reduce under fitting? [6]

41
01
02

c) With following data of shows company expenditure. [6]

5/2
GP

x(month) 1 2 3 4 5
4/0

y(expenditure) 12 19 29 37 45
CE
81

8
23
using regression model predict expenditure of 6th month.
.23

OR ic-
16

tat
8.2

1s

Q2) a) What is R2 measure of evaluation? [6]

.24

1:5

b) What do you mean by least square method? Explain least square method
91
49

3:3

in the context of linear regression. [6]

30
41

c) Write a short note on stochastic qradient descent algorithms. [6]

01
02
5/2
GP

Q3) a) Why ensemble learning is used for ML? [5]

4/0
CE

b) What are advantages and disadvantages of K-NN? [6]

81
.23

c) What are different distance metrics used in k-NN? [6]

16

OR
8.2

P.T.O.
.24
49
Q4) a) What is multiclass classification? Explain the variants of multiclass

8
23
classification. [5]

ic-
b) Explain kernel methods which are suitable for SVM. [6]

tat
1s
c) What are different techniques used for outlier handling? [6]

1:5
02 91
3:3
Q5) a) Why K-medoid is used? Explain k-medoid algorithm. [5]

0
41
b) 4/0 13
Why density based clustering is used? Explain any one. [6]
0
5/2
c) What is outlier analysis? [6]
.23 GP

OR
E
81

8
Q6) a) What is isolation factor model? [5]
C

23
ic-
b) Explain k means algorithm. [6]
16

tat
c) Explain Hierarchical clustering with example [6]
8.2

1s
.24

1:5
91
49

3:3
Q7) a) What is Multilayer perceptron? Describe with diagram. [6]
30
41

b) What are different activation function used is NN? [6]

01
02

c) Explain Convolution Neural Network. (CNN) with suitable example. [6]

5/2
GP

OR
4/0
CE

Q8) a) Explain building blocks of RBF networks. [6]

81

8
23
.23

b) What is Personalized recommendation? What is content based

recommendation? [6] ic-
16

tat
8.2

1s

c) Explain Recurrent Neural Networks with as example. [6]

.24

1:5
91
49

3:3


30
41
01
02
5/2
GP
4/0
CE
81
.23
16
8.2
.24

[6263]-82 2
49
Total No. of Questions : 8] SEAT No. :

7
23
PD4577 [Total No. of Pages : 2

ic-
[6404]-82

tat
B.E. (Computer Engineering)

6s
MACHINE LEARNING

2:4
(2019 Pattern) (Semester - VII) (410242)

02 91
3:3
0
51
Time : 2½ Hours] [Max. Marks : 70
5/0 13
Instructions to the candidates:
0
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
5/2
.23 GP

2) Figures to the right indicate full marks.

3) Neat diagrams must be drawn wherever necesssary.
E

4) Make suitable assumption whenever necessary.

71

7
C

23
ic-
Q1) a) Explain Linear Regression in brief. [6]
16

tat
b) Differentiate overfitting and under fitting with example. [6]
8.2

6s
c) Write short note on Training error and Generalization error in machine
.24

2:4
91
learning. [6]
49

3:3
OR
30
51

Q2) a) Explain in brief importance of Evalution matrix. [6]

01
02

b) Write short note on Lasso and Ridge Regression. [6]

5/2
GP

c) Memory (Capacity) and cost of RAM as shown in below table. [6]

5/0

X (Memory Capacity) 2 4 8 16
CE
71

7
23
in GB
.23

Y (Cost in $) 12 16 28 62 ic-
16

tat
i) Find Regression line Y = aX + b using least square method.
8.2

6s

ii) Estimate the cost of 32 GB RAM using line as equation.

.24

2:4
91
49

3:3
30

Q3) a) Differentiate Binary classification with multiclass classification with

51

example. [5]
01
02

b) Explain with example ensemble learning in ML. [6]

5/2
GP

c) Write short note on metrics for Evaluating classifier performance. [6]

5/0

OR
CE
71

Q4) a) Explain KNN with example. [5]

.23

b) Write short note on handling imbalance data in multiclass classification.[6]

16

c) Explain Bagging and Boosting used in ensemble learning. [6]

8.2
.24
49

P.T.O.
Q5) a) Explain Hierarchical clustering with example. [6]

7
23
b) What is outlier Analysis? Explain it with importance, advantages &

ic-
disadvantages. [6]

tat
c) Write short note on Elbow method used in K-mean clustering. [6]

6s
OR

2:4
02 91
3:3
Q6) a) Compare Intrinsic motivation with extrinsic motivation. [6]

0
51
b) Explain K mean clustering with essential steps used in it.
5/0 13 [6]
c) Write short note on. [6]
0
5/2
.23 GP

i) Graph Based clustering

E

ii) Density Based clustering

71

7
C

23
ic-
16

tat
Q7) a) Write short note on importance of Activation function used in Neural
8.2

6s
Network. [5]
.24

2:4
b) Explain Recurrent Neural Network with Example. Compare it simple
91
49

3:3
CNN. [6]
30
51

c) Draw & Explain CNN architecture. [6]

01
02

OR
5/2
GP

Q8) a) Compare Back propagation Network with feed forward Network. [5]
5/0
CE

b) What are different types of padding used in CNN? [6]

71

7
23
.23

c) Write short note on layers used in CNN. [6]

ic-
16

tat
i) Convolutional layer
8.2

6s

ii) Pooling layer

.24

2:4
91
49

3:3
30
51


01
02
5/2
GP
5/0
CE
71
.23
16
8.2
.24

[6404]-82
49

2
Total No. of Questions : 8] SEAT No. :

8
23
PA-914 [Total No. of Pages : 2

ic-
[5927]-344

tat
9s
B.E. (Computer Engineering)

8:3
BLOCKCHAIN TECHNOLOGY

02 91
(2019 Pattern) (Semester - VII) (410243)

3:3
0
31
Time : 2½ Hours ]
7/0 13 [Max. Marks : 70
0
Instructions to the candidates:
1/2
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
80

3) Figures to the right indicate full marks.

8
C

23
4) Assume suitable data, if necessary.

ic-
16

tat
Q1) a) Explain in detail following blockchain platforms. [8]
8.2

9s
i) Public
.24

ii) Private
8:3
91
49

3:3
iii) Consortium
30
31

iv) IoTA
01
02
1/2
GP

b) Discuss following consensus algorithms used in blockchain technology.

7/0

[6]
CE
80

8
i) Proof of work

23
.23

ii) Proof of activity

c) Explain proof of stake (POS)? [4] ic-
16

tat
8.2

9s

OR
.24

8:3
91
49

3:3

Q2) a) Explain consensus in blockchain in details. [8]

30
31

b) Explain in detail [6]

01
02

i) Bitcoin
1/2
GP

ii) Ethereum
7/0

iii) Hyperledger
CE
80

c) Discuss Byzantine General problem. [4]

.23
16

OR
8.2
.24

P.T.O.
49
Q3) a) List & explain types of crypto currency. [6]

8
23
b) What is Metamask? Illustrate in detail. [6]

ic-
c) Differentiate between coinbase & Binance. [5]

tat
9s
8:3
OR

02 91
3:3
0
Q4) a) What is cryptocurrency? Explain in detail. [6]

31
7/0 13
b) Explain in detail crypto wallets. [6]
0
1/2
c) Explain in detail Bitcoin. [5]
.23 GP
E

Q5) a) What is Ethereum? Explain. [8]

80

8
C

23
b) Explain solidity in detail. [6]

ic-
16

c) Discuss swarm Decentralized storage platform. [4]

tat
8.2

9s
.24

8:3
OR
91
49

3:3
30
31

Q6) a) What is smart contract? Explain types of smart contracts. [8]

01
02

b) Discuss whisper Decentralized Messaging platform. [6]

1/2
GP

c) Explain Ethereum Virtual Machine in detail. [4]

7/0
CE
80

8
23
Q7) a) Explain Block chain applications in retail & banking services. [6]
.23

ic-
16

b) Explain role of blockchain in IoT. [6]

tat
8.2

9s

c) Explain role of blockchain in Healthcare. [5]

.24

8:3
91
49

3:3

OR
30
31

Q8) a) Discuss integration of blockchain with other domains. [6]

01
02
1/2
GP

b) Explain blockchain applications in financial services. [6]

7/0

c) Explain application of blockchain government sector. [5]

CE
80
.23
16

 
8.2
.24

[5927]-344 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P6553 [Total No. of Pages : 2

ic-
[6181]-103

tat
B.E. (Computer Engineering)

5s
3:2
BLOCKCHAIN TECHNOLOGY

02 91
3:3
(2019 Pattern) (Semester - VII) (End Semester) (Elective) (410243)

0
31
5/1 13
Time : 2½ Hours] [Max. Marks : 70
0
2/2
.23 GP

Instructions to the candidates:

1) Attempt Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
E
80

8
2) Figures to the right side indicate full marks.
C

23
3) Neat diagram must be drawn wherever necessary

ic-
16

4) Assume suitable data if necessary

tat
8.2

5s
.24

3:2
Q1) a) Explain any two [6]
91
49

3:3
i) R3
30
31

ii) Ethereum
01
02

iii) Hyperledger
2/2
GP

iv) Corda
5/1

b) Explain Proof of work with example. [6]

CE
80

8
c) What is Byzantine General Problem? Explain its significance. [6]

23
.23

ic-
OR
16

tat
Q2) a) Explain any two Blockchain platforms. [6]
8.2

5s

i) Public
.24

3:2
91

ii) Private
49

3:3

iii) Consortium
30
31

b) Explain proof of stake with example. [6]

01
02

c) What is consensus in Blockchain? [6]

2/2
GP
5/1

Q3) a) Discuss the concept of Cryptowallets? [6]

CE
80

b) Discuss types of cryptocurrency? [6]

.23

c) What is Metamask? [5]

16

OR
8.2
.24

P.T.O.
49
Q4) a) Compare Coinbase and Binanace. [6]

8
23
b) What is the relevance of Crypto Usage. Discuss with example. [6]

ic-
c) What is bitcoin? Explain in detail. [5]

tat
5s
Q5) a) What is ethereum? What are the types of ethereum? [6]

3:2
02 91
b) Explain SWARM (Decentralized storage platform) in detail. [6]

3:3
0
c) What is the concept of smart contact? Discuss its types. [6]

31
5/1 13 OR
0
2/2
Q6) a) What is the significance of EVM( Ethereum Virtual Machine) [6]
.23 GP

b) Explain Whisper( Decentralized Messaging platform) [6]

E
80

c) Discuss how smart contracts are implemented using solidity. [6]

8
C

23
ic-
16

Q7) a) Discuss any use case of Blockchain integration with any other domain

tat
8.2

like cloud. [6]

5s
.24

b) Explain use of Blockchain in Energy and utilities. [6]

3:2
91
49

c) Explain use of Blockchain in health sector. [5]

3:3
30

OR
31
01

Q8) a) Discuss any use case of Blockchain integration with any other domain
02

like Internet of things etc. [6]

2/2
GP

b) What is the significance of adaption of Blockchain in banking and financial

5/1

services. [6]
CE
80

8
23
c) Explain any one application of Blockchain in Government sector. [5]
.23

ic-
16

tat
8.2


5s
.24

3:2
91
49

3:3
30
31
01
02
2/2
GP
5/1
CE
80
.23
16
8.2
.24

[6181]-103 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P547 [Total No. of Pages : 2

ic-
[6004]-482

tat
B.E. (Computer Engineering)

2s
BLOCKCHAIN TECHNOLOGY

9:1
02 91
(2019 Pattern) (Semester-VII) (410243)

4:3
0
31
Time : 2½ Hours] 3/0 13 [Max. Marks : 70
Instructions to the candidates:
0
6/2
.23 GP

1) Attempt Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Figures to the right side indicate full marks.
E
82

8
3) Neat diagrams must be drawn wherever necessary.
C

23
4) Assume Suitable data if necessary.

ic-
16

tat
8.2

2s
Q1) a) Explain in details [8]
.24

i) Bitcoin
9:1
91
49

4:3
ii) Hyperledger
30
31

b) Explain types of Blockchain in details? [6]

01
02

c) Explain in details any one algorithm. [4]

6/2
GP

OR
3/0
CE
82

Q2) a) List different consensus algorithms used in Blockchain Technology. Explain

8
23
any two algorithms in detail. [8]
.23

ic-
16

b) Write a note on Corda and R3. [6]

tat
8.2

2s

c) Explain Byzantine General problem. [4]

.24

9:1
91
49

4:3
30

Q3) a) Write a note on Bitcoin. [6]

31
01

b) Describe Token in details with example? [6]

02
6/2
GP

c) Define types of crypto currencies. [5]

3/0

OR
CE
82

Q4) a) Different between Coinbase and Binance. [6]

.23

b) Explain in details crypto wallets. [6]

16
8.2

c) Write a note on Coinbase. [5]

.24
49

P.T.O.
Q5) a) Discuss what is Ethereum. [8]

8
23
b) Explain In Details Whisper? [6]

ic-
tat
c) Define the purpose and types of Smart Contracts. [4]

2s
OR

9:1
02 91
Q6) a) Write a note on Ethereum Virtual Machine. [8]

4:3
0
b) Write a note on Swarm. [6]

31
c)
3/0 13
What is a smart contract? Explain with an example. [4]
0
6/2
.23 GP

Q7) a) Explain use of Blockchain in retail. [6]

E
82

8
b) List and explain benefits of using Blockchain in Government sector. [6]
C

23
ic-
c) List and explain any two Blockchain applications. [5]
16

tat
OR
8.2

2s
.24

9:1
Q8) a) Discuss use of Blockchain in Healthcare. [6]
91
49

4:3
b) List and explain any two applications of Blockchain in retail. [6]
30
31

c) Explain how Blockchain can be used in Financial services. [5]

01
02
6/2
GP
3/0


CE
82

8
23
.23

ic-
16

tat
8.2

2s
.24

9:1
91
49

4:3
30
31
01
02
6/2
GP
3/0
CE
82
.23
16
8.2
.24

[6004]-482
49

2
Total No. of Questions : 8] SEAT No. :

8
23
PB2245 [Total No. of Pages : 2

ic-
[6263]-83

tat
3s
B.E. (Computer Engineering)

6:0
02 91
BLOCKCHAIN TECHNOLOGY

3:4
0
(2019 Pattern) (Semester - VII) (410243)

41
6/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Solve questions Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
E

2) Neat diagrams must be drawn wherever necessary.

81

8
C

23
3) Figures to the right indicate full marks.

ic-
4) Assume suitable data if necessary.
16

tat
8.2

3s
Q1) a) Discuss following consensus algorithms used in blockchain technology.[8]
.24

6:0
91
49

i) Proof of work
3:4
30
41

ii) Proof of activity

01
02

iii) Proof of Burn

5/2
GP

iv) Proof of Stake

6/0
CE

b) Explain in detail [6]

81

8
23
.23

i) Bitcoin
ic-
16

tat
ii) Ethereum
8.2

3s

iii) Hyperledger
.24

6:0
91
49

c) Explain the concept of Bitcoin in Blockchain Technology. [4]

3:4
30
41

OR
01
02

Q2) a) Discuss the difference between Bitcoin and Ethereum. [4]

5/2
GP

b) Explain the difference between a permissioned and permissionless

6/0

consensus approach. [4]

CE
81

c) Explain the Byzantine General Problem in the context of blockchain

.23

consensus. [4]
16
8.2

d) Explain the role of IOTA in the context of the Internet of Things (loT).[6]
.24
49

P.T.O.
Q3) a) What is Metamask, Illustrate in details. [9]

8
23
b) List and explain types of cryptocurrencies. [8]

ic-
tat
OR

3s
6:0
Q4) a) Compare and Contrast Coinbase and Binance. [8]

02 91
3:4
b) Differentiate between metmask and coinbase wallet. [9]

0
41
6/0 13
0
Q5) a) What is Ethereum? Explain in detail it differs from traditional
5/2
.23 GP

cryptocurrencies. [8]
E
81

8
b) Identify two types of Ethereum networks and briefly explain the purpose
C

23
of each. [9]

ic-
16

tat
OR
8.2

3s
.24

Q6) a) Explain the concept of a smart contract with an example. [8]

6:0
91
49

3:4
b) How does Swarm contribute to decentralized storage in the Ethereum
30
41

ecosystem? [9]
01
02
5/2
GP

Q7) a) Describe the role of blockchain in financial sector. [9]

6/0
CE
81

b) Describe the role of blockchain in Government. sector. [9]

8
23
.23

ic-
OR
16

tat
Q8) a) Explain role of blockchain in healthcare. [9]
8.2

3s
.24

6:0

b) Discuss potential challenges and benefits of implementing blockchain in

91
49

3:4

Voting system. [9]

30
41
01
02
5/2
GP


6/0
CE
81
.23
16
8.2
.24

[6263]-83
49

2
Total No. of Questions : 8] SEAT No. :

7
23
PC-2370 [Total No. of Pages : 2

ic-
tat
[6354]-487

4s
6:4
B.E. (Computer Engineering)

02 91
3:3
BLOCKCHAIN TECHNOLOGY

0
41
6/1 13
(2019 Pattern) (Semester - VII) (410243)
0
2/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :

E
71

1) Solve questions Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.

7
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

4s
.24

6:4
91
49

3:3
Q1) a) Discuss in brief Bitcoin and Ethereum cryptocurrencies. [8]
30
41

b) Explain following : [9]

01
02

i) Proof of work
2/2
GP

ii) Proof of stake and

6/1
CE

iii) Proof of activity

71

7
23
.23

OR
ic-
16

tat
Q2) a) List and explain types of Blockchain. [8]
8.2

4s

b) Explain Byzantine general problem scenario. Explain the problem and its
.24

6:4

probable consequences. [9]

91
49

3:3
30
41

Q3) a) Differentiate between Coinbase and Binance. [9]

01
02
2/2

b) What is Metamask? Discuss any one application of Metamask. [8]

GP
6/1

OR
CE
71

Q4) a) List and explain types of crypto wallet. [8]

.23

b) Write a note on Bitcoin. [9]

16
8.2

P.T.O.
.24
49
Q5) a) What is Swarm, and how does it address the need for decentralized

7
23
storage in the Ethereum network? [9]

ic-
b) What is Ethereum? Define smart contracts and give an example of a real-

tat
world scenario where a smart contract could be beneficial. [9]

4s
OR

6:4
02 91
Q6) a) State and explain the various components of Ethereum. Explain the

3:3
various types of Ethereum Networks. [9]

0
41
b) 6/1 13
Explain Decentralized Messaging Platform - Whisper and its purpose in
the Ethereum ecosystem. [9]
0
2/2
.23 GP

Q7) a) With the help of neat diagram explain how blockchain can be used for
E
71

7
any supply chain application. [9]
C

23
b) Explain the use of blockchain technology in the government sector. ‘Which

ic-
16

are the different blockehain based applications proposed for it? [9]

tat
8.2

4s
OR
.24

6:4
Q8) a) Explain how blockchain and IOT can work together. [9]
91
49

3:3
b) List out the applications of blockchain Technology in different areas.
30
41

Explain any 2 in detail. [9]

01
02
2/2


GP
6/1
CE
71

7
23
.23

ic-
16

tat
8.2

4s
.24

6:4
91
49

3:3
30
41
01
02
2/2
GP
6/1
CE
71
.23
16
8.2
.24

[6354]-487 2
49
Total No. of Questions : 8] SEAT No. :

7
23
PD4578 [Total No. of Pages : 2

ic-
[6404]-83

tat
B.E. (Computer Engineering)

0s
BLOCK CHAIN TECHNOLOGY

8:5
02 91
3:3
(2019 Pattern) (Semester-VII) (410243)

0
51
Time : 2½ Hours]
7/0 13 [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6 and Q.7 or Q.8.
E

2) Neat diagram must be drawn whenever necessary.

71

7
C

23
3) Figure to the right indicate full marks.

ic-
4) Assume suitable data, if nessacary.
16

tat
8.2

0s
Q1) a) State and discuss bitcoin mining? Elaborate the functionality of miners.
.24

8:5
91
49

3:3
[8]
30
51

b) Describe the features of Corda Block chain? Justify how makes it so

01
02

different? Elaborate CorDapps? [9]

5/2
GP

OR
7/0
CE
71

Q2) a) Give the different types of block chain. State their advantages and

7
23
disadvantages. [8]
.23

ic-
16

b) Illustrate 5 different types of consensus algorithm with example. [9]

tat
8.2

0s
.24

8:5
91

Q3) a) Enlist and discuss types of cryptocurrency “Is cryptocurrency is safe”.

49

3:3

Justify according to your opinion. [9]

30
51
01

b) Describe Zero coin and its successor Zero cash in details. [8]
02
5/2
GP

OR
7/0

Q4) a) Compare Custodial and non-custodial cryptowallets. [8]

CE
71
.23

b) Define the term Hot wallet storage and Cold Wallet storage. Discuss
Meta mask and its importance along with its various benefits and
16

drawbacks. [9]
8.2
.24

P.T.O.
49
Q5) a) Enlist features of Ethereum. Compare Ethereum Mainnet, Testnet, and

7
Private Networks. [9]

23
ic-
b) Define smart contracts with an example of a real-world scenario which

tat
will evaluate its benefits. Discuss the role of gas in the Ethereum network

0s
and its significance in smart contract execution. [9]

8:5
02 91
OR

3:3
0
51
Q6) a) 7/0 13
List Decentralized Messaging Platform. Discuss Whisper and its purpose
in the Ethereum ecosystem. [9]
0
5/2
.23 GP

b) Discuss in brief two types of smart contracts commonly used on the

Ethereum platform. Elaborate the basic steps involved in deploying a
E
71

7
smart contract on the Ethereum block chain. [9]
C

23
ic-
16

tat
8.2

0s
Q7) a) List the prominent block chain application. Explain in detail any one with
.24

the architecture. [9]

8:5
91
49

3:3
b) Discuss in brief how cyber hack can be reduced for Digital identity using
30
51

block chain. [9]

01
02

OR
5/2
GP
7/0

Q8) a) Elaborate the use of block chain technology in the government sector.
CE

Which are the different block chain based applications available/proposed

71

7
23
for it? [9]
.23

ic-
16

b) Discuss the impact made by block chain with IOT and Block chain in
tat
8.2

banking. [9]
0s
.24

8:5
91
49

3:3
30

eeee
51
01
02
5/2
GP
7/0
CE
71
.23
16
8.2
.24

[6404]-83 2
49
Total No. of Questions : 8] SEAT No. :

8
23
PA-1663 [Total No. of Pages : 2

ic-
[5927]-347

tat
B.E. (Computer Engg.)

6s
CYBER SECURITY AND DIGITAL FORENSICS

5:3
(2019 Pattern) (Elective-III) (Semester-VII) (410244(C))

02 91
3:5
0
Time : 2½ Hours] [Max. Marks : 70

31
9/0 13
Instructions to the candidates:
1) Answer Q1 or Q2, Q3, or Q4, Q5 or Q6, Q7 or Q8.
0
1/2
2) Neat diagrams must be drawn wherever necessary.
.23 GP

3) Figures to the right indicate full marks.

4) Assume suitable data if necessary.
E
80

8
5) Use of scientific calculator is permitted.
C

23
ic-
16

tat
Q1) a) What is computer forensics? What is the use of Computer Forensics in
8.2

6s
Law Enforcement? What are different computer forensics schemes? [9]
.24

5:3
91
b) Explain in detail different Computer Forensics Services. [9]
49

3:5
30
31

OR
01
02

Q2) a) Explain in details Computer Forensics Assistance to Human Resources.[9]

1/2
GP

b) What are the benefits of professional forensics methodology? What are

9/0

steps taken by computer forensics specialist? [9]

CE
80

8
23
.23

Q3) a) What are evidences? What are the simple reasons to collect evidences? ic-
16

tat
8.2

What are different options for collecting evidences? [8]

6s
.24

5:3

b) What is chain of custody? Explain the process of chain of custody. [9]

91
49

3:5

OR
30
31

Q4) a) What is the general procedure for evidence collection? [8]

01
02

b) What are general computer evidence processing steps? Explain in detail.[9]

1/2
GP
9/0
CE
80

Q5) a) Explain how to perform remote and live acquisitions with an appropriate
.23

example. [9]
16

b) What are the different approaches for validating forensic data? [9]
8.2

OR
.24

P.T.O.
49

[5927]-347 1
Q6) a) Brief about the approaches for seizing digital evidence at the crime scene.[9]

8
23
b) Give in detail the different techniques to hide data in digital forensics.[9]

ic-
tat
6s
Q7) a) Explain types of digital forensics tools. Also explain the task performed

5:3
02 91
by these tools. [8]

3:5
0
b) State the features of any five computer forensics software tools. [9]

31
9/0 13 OR
0
1/2
.23 GP

Q8) a) Explain the role of client and server in email and some of the tools for
email forensics. [8]
E
80

8
b) Explain the process for validating and testing forensics software. [9]
C

23
ic-
16

tat
8.2

6s
.24

 5:3
91
49

3:5
30
31
01
02
1/2
GP
9/0
CE
80

8
23
.23

ic-
16

tat
8.2

6s
.24

5:3
91
49

3:5
30
31
01
02
1/2
GP
9/0
CE
80
.23
16
8.2
.24
49

[5927]-347 2
Total No. of Questions : 8] SEAT No. :

8
23
P-6556 [Total No. of Pages : 2

ic-
tat
[6181]-106

0s
5:3
B.E. (Computer Engineering)

02 91
3:4
CYBER SECURITY AND DIGITAL FORENSICS

0
31
7/1 13
(2019 Pattern) (Semester - VII) (410244 C) (Elective - III)
0
2/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :

E
80

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

0s
.24

5:3
91
49

Q1) a) What are the typical steps followed by computer forensics specialists in
3:4
30

an investigation? Explain any 2 in detail. [9]

31

b) In what ways can business benefit from computer forensics technology?

01
02

Explain in detail. [9]

2/2
GP

OR
7/1
CE

Q2) a) What kind of digital evidences can be collected in computer forensics?

80

8
23
Explain in detail. [9]
.23

b) Why is data backup & recovery important in computer forensics? [9] ic-
16

tat
8.2

0s
.24

Q3) a) What is the primary purpose of collecting evidence in digital forensics?

5:3
91

Explain in detail. [9]

49

3:4
30

b) What are the typical steps involved in the collection of digital evidences?
31

[8]
01
02

OR
2/2
GP

Q4) a) Explain the different types of digital evidence that can be collected in
7/1
CE

computer forensics? [8]

80

b) What method & techniques are commonly used to verify & authenticate
.23

computer images. explain any two in detail? [9]

16
8.2

P.T.O.
.24
49
Q5) a) How do investigators determine which data is relevant to collect & analyze

8
23
in digital forensics investigation? [8]

ic-
b) What is the honeynet project, how does it contribute to network

tat
forensics? [9]

0s
OR

5:3
Q6) a) Why is data validation crucial in digital forensics & what methods are

02 91
3:4
commelily used for data validation? [8]

0
31
b) 7/1 13
Describe the process of seizing digital evidence at a crime or incident
scene? [9]
0
2/2
.23 GP
E

Q7) a) How does email play a significant role in digital investigations? What
80

8
C

23
types of information can be obtain from email Header that may be relevant

ic-
in investigations? [9]
16

tat
b) What factors should be considered when evaluating computer forensics
8.2

0s
tool needs for an investigations. Explain any two in detail? [9]
.24

5:3
91
49

OR
3:4
30
31

Q8) a) What is function e-mail server, how does it store & manage e-mail data?
01

[9]
02
2/2
GP

b) Write short note (any one) : [9]

7/1

i) e-mail forensics tools.

CE
80

8
23
ii) Computer forensics hardware tools
.23

ic-
16

tat

8.2

0s
.24

5:3
91
49

3:4
30
31
01
02
2/2
GP
7/1
CE
80
.23
16
8.2
.24

[6181]-106 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P550 [Total No. of Pages : 2

ic-
[6004]-485

tat
B.E. (Computer Engineering)

8s
CYBER SECURITY AND DIGITAL FORENSICS

2:4
02 91
(2019 Pattern) (Semester - VII) (Elective - III) (410244C)

4:4
0
31
4/0 13
Time : 2½ Hours] [Max. Marks : 70
0
6/2
Instructions to the candidates:
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
82

8
C

3) Figures to the right indicate full marks.

23
ic-
4) Use of Calculator is allowed.
16

tat
5) Assume suitable data if necessary.
8.2

8s
.24

2:4
Q1) a) Explain in brief computer forensic services. Write the applications of
91
49

4:4
digital forensics in military. [8]
30
31

b) What is the significance of data recovery and backup? Explain various

01

data recovery solutions.

02

[9]
6/2

OR
GP
4/0

Q2) a) What are the various business oriented digital forensic techniques? [8]
CE
82

8
b) How does computer forensics help in law enforcement? [9]

23
.23

ic-
16

tat
Q3) a) Discuss the various legal aspects of collecting and storing digital evidence.[9]
8.2

8s

b) What are different computer evidence processing steps? [9]

.24

2:4
91

OR
49

4:4
30

Q4) a) What is chain custody? How we can control the contamination of digital
31

evidence? [9]
01
02

b) What are various methods of collecting digital evidence ?Enlist the various
6/2
GP

digital collection steps. [9]

4/0
CE
82

Q5) a) Explain different approaches for validating forensic data. [9]

.23

b) Explain the approaches for seizing digital evidence at the crime scene.[8]
16
8.2

OR
.24
49

P.T.O.
Q6) a) Explain the process of identifying digital evidence in computer forensics.[9]

8
23
b) Explain Network forensics and order of volatility for computer system.[8]

ic-
tat
8s
Q7) a) State the features of any five computer forensic software tools. [9]

2:4
b) Write short notes on [9]

02 91
4:4
i) Task performed by digital forensic tool

0
31
ii)
4/0 13
Tools for email forensics
0
6/2
iii) Techniques for email forensic investigation
.23 GP

OR
E
82

8
C

Q8) a) State the features of any five computer forensic hardware tools. [9]

23
ic-
b) Write short notes on [9]
16

tat
8.2

i) Role of client and server in email

8s
.24

2:4
ii) Investigating Email crimes and investigations
91
49

4:4
iii) NIST standards for forensic technologies
30
31
01
02
6/2
GP


4/0
CE
82

8
23
.23

ic-
16

tat
8.2

8s
.24

2:4
91
49

4:4
30
31
01
02
6/2
GP
4/0
CE
82
.23
16
8.2
.24

[6004]-485 2
49
Total No. of Questions : 8] SEAT No. :

7
23
PC2373 [6354]-490
[Total No. of Pages : 2

ic-
B.E. (Computer Engineering)

tat
CYBER SECURITY AND DIGITAL FORENSICS

1s
4:2
(Elective -III) (2019 Pattern) (Semester-VII) (410244 C)

02 91
3:4
Time : 2½ Hours] [Max. Marks : 70

0
41
Instructions to the candidates:
8/1 13
1) Answer Q.1 or Q.2, Q.3 or Q.4,Q.5 or Q.6, Q.7, or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
2/2
.23 GP

3) Figures to the right indicate full marks.

4) Assume suitable data, if necessary.
E
71

7
C

23
ic-
Q1) a) What are the typical steps followed by computer forensics specialists in
16

tat
an investigation? Explain any 2 in detail. [8]
8.2

1s
b) In what ways can business benefit from computer forensics technology
.24

4:2
explain in details? [9]
91
49

3:4
OR
30
41

Q2) a) Explain in details different computer forensics services. [9]

01
02
2/2

b) Why is data backup & recovery important in computer forensics? [8]

GP
8/1
CE
71

7
23
Q3) a) What are the typical steps involved in the collection of digital evidence?[9]
.23

b) What are the different approaches for validating forensic data? ic-
[9]
16

tat
8.2

1s

OR
.24

4:2

Q4) a) Why collect evidence? collection options in digital evidence. explain in

91
49

3:4

details? [9]
30
41

b) Discuss the various legal aspects of collecting and storing digital evidence.
01
02

[9]
2/2
GP
8/1
CE

Q5) a) What are same common network tools, used in network forensics. [9]
71
.23

b) Describe the process of seizing digital evidence at a crime or incident

16

scene? [8]
8.2

OR
.24

[6354]-490 1
49

P.T.O.
Q6) a) What is the honeynet project, how does it contribute to network forensics?

7
[9]

23
ic-
b) Give in detail the different techniques to hide data in digital forensics?[8]

tat
1s
4:2
Q7) a) Write short note on. [9]

02 91
3:4
i) Tools for email forensics

0
41
ii) 8/1 13
Computer forensics hardware tools
0
b) Explain the process for validating and testing forensics software. [9]
2/2
.23 GP

OR
E
71

7
Q8) a) What is function email server show does it store of mange e-mail data?[9]
C

23
ic-
b) Write short note on. [9]
16

tat
8.2

i) Computer forensics software tools

1s
.24

4:2
ii) E-mail Investigations
91
49

3:4
30
41
01
02


2/2
GP
8/1
CE
71

7
23
.23

ic-
16

tat
8.2

1s
.24

4:2
91
49

3:4
30
41
01
02
2/2
GP
8/1
CE
71
.23
16
8.2
.24

[6354]-490 2
49
Total No. of Questions : 8] SEAT No. :

8
23
PB2248 [Total No. of Pages : 2

ic-
[6263]-86

tat
B.E. (Computer Engineering)

6s
CYBER SECURITY AND DIGITAL FORENSICS

9:2
(2019 Pattern) (Semester - VII) (410244 C) (Elective - III)

02 91
3:5
Time : 2½ Hours] [Max. Marks : 70

0
41
8/0 13
Instructions to the candidates:
1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
0
2) Neat diagrams must be drawn wherever necessary.
5/2
.23 GP

3) Figures to the right side indicate full marks.

4) Assume suitable data if necessary.
E
81

8
C

23
ic-
Q1) a) What are the typical services offered by computer forensics
16

tat
professionals? (explain any two) [9]
8.2

6s
b) What specific technologies are utilized in the field of business computer
.24

9:2
forensics? (Describe any two) [9]
91
49

3:5
OR
30
41

Q2) a) How does computer forensics technology vary cross different sectors
01
02

like miltary law enforcement & business? [9]

5/2

b) What are the key components of a data recovery solutions in computer

GP

forensics? Explain in detail. [9]

8/0
CE
81

8
23
Q3) a) What are various options available for collecting digital evidences? Explain
.23

in detail?
ic-
[8]
16

tat
b) Explain the essential steps in processing digital evidence from the crime
8.2

6s

scene? [9]
.24

9:2

OR
91
49

3:5

Q4) a) What is the volatile evidence in the context of computer forensics, and
30
41

why is it important to collect in quickly? [8]

01
02

b) What are the hypical steps involve in the collection of digital evidence?[9]
5/2
GP
8/0

Q5) a) What are some common data hiding techniques? Explain any one in
CE
81

detail? [8]
.23

b) What is the honey net project, and how does it contribute to network
forensics? [9]
16
8.2

OR
.24

P.T.O.
49

[6263]-86 1
Q6) a) What precautions should investigators take to prevent data alteration or

8
23
loss during the seicure process? Explain any one in detail? [8]

ic-
b) What are the challenges and best practices associated with performing

tat
remove acqisitions? [9]

6s
9:2
Q7) a) Whar are the common examples of email crime & violations that may

02 91
3:5
necessitate investigation? Explain any one in detail? [9]

0
41
b) 8/0 13
Explain any software tool using in computer forensics investigation and
its respective purpose? [9]
0
5/2
.23 GP

OR
E

Q8) Write short note (any two) [18]

81

8
C

23
a) Computer forensics hardware tools

ic-
16

tat
b) Validating & testing forensics software
8.2

6s
c) e-mail investigation
.24

9:2
91
49

3:5
30
41

  
01
02
5/2
GP
8/0
CE
81

8
23
.23

ic-
16

tat
8.2

6s
.24

9:2
91
49

3:5
30
41
01
02
5/2
GP
8/0
CE
81
.23
16
8.2
.24
49

[6263]-86 2
Total No. of Questions : 8] SEAT No. :

7
23
PD4581 [Total No. of Pages : 2

ic-
tat
[6404]-86

2s
B.E. (Computer Engineering)

2:5
02 91
CYBER SECURITY AND DIGITAL FORENSICS

3:5
(2019 Pattern) (Semester - VII) (Elective - III) (410244 C)

0
51
0/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Answers Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

2) Neat diagrams must be drawn wherever necessary.
E
72

7
C

3) Figures to the right indicate full marks.

23
4) Assume suitable data, if necessary.

ic-
16

tat
8.2

2s
Q1) a) What is primary purpose of computer forensics & how does computer
.24

2:5
forensic differ from other forensic disciplines? [9]
91
49

3:5
b) How do law enforcement computer forensic technolgies aid in criminal
30
51

investigation? [9]
01
02

OR
5/2
GP

Q2) a) What are some examples of technologies used in computer forensic

0/0

investigation? Explain any two. [9]

CE
72

7
23
b) What startegies can individuals & organizations use to ensure effective
.23

data backup for recovery purposes? Describe any two in detail. [9]
ic-
16

tat
8.2

2s
.24

2:5

Q3) a) What are some common obsracles faced when collecting digital evidence.
91
49

3:5

Explain in detail. [8]

30
51

b) What method & techniques are commonly used to verify & authenticate
01
02

computer images? Explain any two? [9]

5/2
GP
0/0

OR
CE
72

Q4) a) Describe the general procedure for collecting and archiving digital
.23

evidence in computer forensics? [9]

16

b) Explain duplication & Preservation of digital evidence? [8]

8.2
.24

P.T.O.
49
Q5) a) What steps should be taken to secure computer incident or crime scene

7
23
before begining the search for digital evidence? [8]

ic-
b) What is the honeyenet project, and how does it contribute to network

tat
forensics? [9]

2s
2:5
OR

02 91
3:5
Q6) a) Why is obtaining a digital has important while storing digital evidence,

0
51
and how is it generated? Explain in detail. [9]
0/0 13
b) What are some common network tool used in network forensics, Explain
0
5/2
.23 GP

any one detail? [8]

E
72

7
Q7) a) What factor should be considered when evaluating the computer
C

23
forensics tool need for an investigation? Explain any two in detail? [9]

ic-
16

tat
b) What is role of hardware tool in computer forensics, and howduthey
8.2

2s
differ form software tools? [9]
.24

2:5
OR
91
49

3:5
30

Q8) Write short note on (any 2) [18]

51
01

a) Validating & testing forensics software

02
5/2
GP

b) e-mail investigation
0/0

c) Computer forensics software tool

CE
72

7
23
.23

ic-
16

tat
… … …
8.2

2s
.24

2:5
91
49

3:5
30
51
01
02
5/2
GP
0/0
CE
72
.23
16
8.2
.24
49

[6404]-86 2
Total No. of Questions : 8] SEAT No. :

8
23
PA-921 [Total No. of Pages : 2

ic-
[5927] - 353

tat
5s
B.E. (Computer) (Semester - VII)

3:2
SOFTWARE TESTING & QUALITY ASSURANCE

02 91
3:4
(2019 Pattern) (Elective - IV) (410245 D)

0
31
0/0 13
Time : 2½ Hours] [Max. Marks : 70
0
1/2
Instructions to the candidates :
.23 GP

1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

E

2) Neat diagrams must be drawn wherever necessary.

81

8
C

23
3) Figures to the right indicate full marks.

ic-
16

tat
8.2

5s
Q1) a) What do you think about static techniques? [6]
.24

3:2
91
49

3:4
b) State in your own words Error guessing and exploratory testing. [6]
30
31

c) How would you explain System Testing and Acceptance Testing? [6]
01
02
1/2
GP

OR
0/0
CE
81

8
Q2) a) Can you explain path coverage testing & conditional coverage testing.

23
.23

[6]
ic-
16

tat
b) Identify the importance of Regression Testing & explain it. [6]
8.2

5s
.24

3:2

c) Explain in detail performance testing with example. [6]

91
49

3:4
30
31
01
02

Q3) a) Differentiate between Quality Assurance and Quality Control. [6]

1/2
GP
0/0

b) Can you Clarify Quality Management system. [6]

CE
81

c) Why software has Defects? Explain in detail. [5]

.23
16

OR
8.2
.24

P.T.O.
49
Q4) a) Explain why ISO-9001 standard and it’s importants in software testing?

8
23
[6]

ic-
tat
b) Illustrate selenium’s IDE and explain in detail. [6]

5s
c) Can you clarify different levels of CMM. [5]

3:2
02 91
3:4
0
31
Q5) a)
0/0 13
How would you explain selenium IDE explain in detail? [6]
0
1/2
.23 GP

b) Explain Robotic Process Automation in detail. [6]

E
81

8
c) Construct different automated testing process. [6]
C

23
ic-
OR
16

tat
8.2

5s
Q6) a) Illustrate selenium tool suite in detail. [6]
.24

3:2
91
49

3:4
b) Identify different benefits of Automation testing. [6]
30
31

c) How would you explain selenium Web Driver? Explain it. [6]
01
02
1/2
GP
0/0
CE
81

Q7) a) Compare the Ishikawa’s Flow chart and Histogram tool. [6]

8
23
.23

b) Explain in detail six sigma characteristics in details.

ic-[6]
16

tat
8.2

5s

c) Can you explain How to maintain SQA? [5]

.24

3:2
91
49

OR
3:4
30
31

Q8) a) Explain the six sigma characteristics in details. [6]

01
02
1/2

b) Explain in detail Total Quality Management. [6]

GP
0/0
CE

c) Compare Run charts and Control chart in detail. [5]

81
.23


16
8.2
.24

[5927]-353 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P556 [Total No. of Pages : 2

ic-
[6004]-491

tat
B.E. (Computer)

3s
SOFTWARE TESTING AND QUALITY ASSURANCE

2:1
02 91
(2019 Pattern) (Semester - VII) (Elective - IV) (410245D)

4:4
0
31
6/0 13
Time : 2½ Hours] [Max. Marks : 70
0
6/2
Instructions to the candidates:
.23 GP

1) Attempt [Link].1 or [Link].2, [Link].3 or [Link].4, [Link].5 or [Link].6, [Link].7 or [Link].8.

2) Figures to the right indicate full marks.
E
82

8
C

3) Assume suitable data, if necessary.

23
ic-
4) Neat diagrams must be drawn wherever necessary.
16

tat
8.2

3s
Q1) a) Differentiate between black box and white box testing. [6]
.24

2:1
91
b) What do you mean by unit and integration testing what are the approaches
49

4:4
used in integration testing? [6]
30
31

c) Illustrate Non - functional testing? Explain performance testing with

01
02

example? [6]
6/2
GP

OR
6/0

Q2) a) Write a brief outline Experienced based techniques. [6]

CE
82

8
23
b) Can you explain statment coveragetesting & branch coverage testing?[6]
.23

ic-
16

tat
c) How would you explain system testing & acceptance testing. [6]
8.2

3s
.24

2:1
91

Q3) a) What is impact of defect in different phase of software development?[6]

49

4:4
30

b) Can you explain quality plan in details? [6]

31
01
02

c) Explain why ISO - 9001 standard and it’s importants in software testing.[5]
6/2
GP

OR
6/0

Q4) a) With respect to quality management system explain important aspects of

CE
82

quality management. [6]

.23

b) What do you understand regarding quality control & Explain two methods
of quality control. [6]
16
8.2

c) Why do you need to measure customer satisfaction? [5]

.24
49

P.T.O.
Q5) a) What is automation testing in software testing? Explain in brief? [6]

8
23
b) Illustrate Selenium’s IQE explain in details. [6]

ic-
c) How would you explain selenium’s web driver explain. [6]

tat
OR

3s
Q6) a) Identify different benefits of Automation testing. [6]

2:1
02 91
b) Explain different automated testing process. [6]

4:4
0
c) How would you explain R.P.A. [6]

31
6/0 13
0
6/2
.23 GP

Q7) a) Explain the six sigma characteristics in details. [6]

b) Compare the Ishikawa’s flowchart and Histogram tools. [6]
E
82

8
c) What parameter required for achieving good software quality. [5]
C

23
ic-
OR
16

tat
Q8) a) Can you explain how to maintain SQA. [6]
8.2

3s
b) Illustrate different task goal and metric in SQA. [6]
.24

2:1
91
c) What do you think about deffect removal effectiveness explain it. [5]
49

4:4
30
31


01
02
6/2
GP
6/0
CE
82

8
23
.23

ic-
16

tat
8.2

3s
.24

2:1
91
49

4:4
30
31
01
02
6/2
GP
6/0
CE
82
.23
16
8.2
.24

[6004]-491 2
49
Total No. of Questions : 8] SEAT No. :

8
23
P-6562 [Total No. of Pages : 2

ic-
[6181]-112

tat
4s
B.E. (Computer)

0:2
02 91
SOFTWARE TESTING AND QUALITY ASSURANCE

3:5
0
(2019 Pattern) (Semester - VII) (410245D) (Elective - IV)

31
1/1 13
0
Time : 2½ Hours] [Max. Marks : 70
2/2
.23 GP

Instructions to the candidates:

1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
E
81

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right side indicate full marks.
16

tat
4) Assume suitable data if necessary.
8.2

4s
.24

0:2
Q1) a) Identify how the different Static Test Case Design Techniques are useful
91
49

3:5
for Software Testing? [6]
30
31

b) Interpret the different Dynamic Test Design Techniques. [6]

01
02

c) What do you think about static techniques. [6]

2/2
GP

OR
1/1
CE
81

8
Q2) a) Can you illustrate Adhoc Testing with example. [6]

23
.23

ic-
b) How would you explain unit Testing and Integration Testing? [6]
16

tat
c) State in your own words why Regression Testing in important? [6]
8.2

4s
.24

0:2
91
49

3:5

Q3) a) Illustrate different characteristics of software in detail. [6]

30
31

b) Identify different steps involved in Software Development Process.

01
02

[6]
2/2
GP

c) Can you clarify different levels of CMM. [5]

1/1
CE

OR
81
.23

Q4) a) Why Software has Defects? Explain in details. [6]

16

b) Can you distinguish between Q.A. and Q.C. [6]

8.2

c) Explain in detail Pillars of Quality Management System. [5]

.24
49

P.T.O.
Q5) a) How to choose an Automation tool? Explain in briefly. [6]

8
23
b) Illustrate selenium Tool suite in detail. [6]

ic-
tat
c) How would you explain Robotic Process Automation (RPA). [6]

4s
OR

0:2
02 91
3:5
Q6) a) Construct different automated testing process. [6]

0
31
b) 1/1 13
What is selenium RC? Explain in detail. [6]
0
2/2
c) What do you understand selenium grid? Explain it. [6]
.23 GP
E
81

8
C

23
Q7) a) Can you illustrate Total Quality Management. Explain in detail. [6]

ic-
16

tat
b) Illustrate Ishikawals 7 basic Tools in detail. [6]
8.2

4s
c) What do you understand by software maintenance? Explain in detail.
.24

0:2
91
[5]
49

3:5
30

OR
31
01
02

Q8) a) Can you Clarify Flow Chart. Run charts, control charts. [6]
2/2
GP

b) What are the facts to achieving the software quality. Explain in detail.
1/1

[6]
CE
81

8
23
.23

c) What are the different task goal and metric in SQA? [5]
ic-
16

tat
8.2

4s


.24

0:2
91
49

3:5
30
31
01
02
2/2
GP
1/1
CE
81
.23
16
8.2
.24
49

[6181]-112 2
Total No. of Questions : 8] SEAT No. :

7
23
PC2379 [Total No. of Pages : 2

ic-
tat
[6354]-496

7s
B.E. (Computer Engineering)

0:2
SOFTWARE TESTING & QUALITY ASSURANCE

02 91
3:4
(2019 Pattern) (Semester - VII) (Elective - IV) (410245 D)

0
41
Time : 2½ Hours] 0/1 13 [Max. Marks : 70
Instructions to the candidates:
0
2/2
1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
.23 GP

2) Figures to the right side indicate full marks.

3) Assume suitable data if necessary.
E
72

7
4) Neat diagrams must be drawn wherever necessary.
C

23
ic-
16

tat
Q1) a) Identify the importance of Regression testing & explain it. [6]
8.2

7s
.24

0:2
b) Explain any two non functional testing. [6]
91
49

3:4
c) Can you explain statement coverage & Branch coverage testing? [6]
30
41

OR
01
02
2/2
GP

Q2) a) Explain any two functional testing. [6]

0/1
CE

b) Explain in detail performance testing with example. [6]

72

7
23
.23

c) What do you think about dynamic techniques? [6]

ic-
16

tat
8.2

7s
.24

0:2

Q3) a) Differentiate between quality assurance & qualits contorl. [6]

91
49

3:4

b) Can you clarify different levels of cmm. [6]

30
41
01

c) Illustrate selenium’s IDE and explain indetail. [5]

02
2/2
GP

OR
0/1
CE

Q4) a) Why software has defects? explain in detail. [6]

72
.23

b) Explain in detail reliability of quality Process. [6]

16
8.2

c) Explain Important Aspects of quality management. [5]

.24

P.T.O.
49

[6354]-496 1
Q5) a) Illustrate selenium tool suite in detail. [6]

7
23
b) Construct different automated festing process. [6]

ic-
tat
c) Explain Robotic process Automation in details. [6]

7s
OR

0:2
02 91
3:4
Q6) a) What is performance testing. What is use of it. [6]

0
41
b) 0/1 13
How would you explain selenium web driver? Explain it [6]
0
2/2
.23 GP

c) Construct different automated testing process. [6]

E
72

7
C

23
Q7) a) Can you explain how to maintain SQA. [6]

ic-
16

b) Compare Run charts and control chart in detail. [6]

tat
8.2

7s
c) Explain six sigma characteristics in details. [5]
.24

0:2
91
OR
49

3:4
30
41

Q8) a) Compare flow charts and control chart in detail. [6]

01
02
2/2

b) Explain in detail total quality management. [6]

GP
0/1

c) Compare the Ishikawa’s flow chart and histogram tool. [5]

CE
72

7
23
.23

ic-
16

tat
8.2

7s

… … …
.24

0:2
91
49

3:4
30
41
01
02
2/2
GP
0/1
CE
72
.23
16
8.2
.24
49

[6354]-496 2
Total No. of Questions : 8] SEAT No. :

8
23
PB-2254 [Total No. of Pages : 2

ic-
tat
[6263]-92

6s
4:5
B.E. (Computer Engineering)

02 91
4:0
SOFTWARE TESTING AND QUALITY ASSURANCE

0
41
2/0 13
(2019 Pattern) (Semester - VII) (Elective - IV) (410245D)
0
5/2
Time : 2½ Hours] [Max. Marks : 70
.23 GP

Instructions to the candidates :

E
82

1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.

8
C

23
2) Neat diagrams must be drawn wherever necessary.

ic-
3) Figures to the right indicate full marks.
16

tat
4) Assume suitable data, if necessary.
8.2

6s
.24

4:5
91
49

Q1) a) Explain White box testing and Grey box testing in detail. [6]
4:0
30

b) Discuss Boundary Value Analysis and Equivalence Class Partition. [6]

41
01

c) Differentiate between Functional testing and Non-functional testing. [6]

02
5/2

OR
GP
2/0

Q2) a) Explain the following test case design techniques : [6]

CE
82

8
i) Informal Reviews

23
.23

ii) Walkthroughs
ic-
16

tat
iii) Inspection
8.2

6s

b) What is Cookies testing? Explain Cookies testing with an example. [6]

.24

4:5

c) Discuss Loop coverage testing and types of it in detail. [6]

91
49

4:0
30
41

Q3) a) Explain the following requirements of a product : [4]

01
02

i) Stated / Implied requirements

5/2
GP

ii) Present / Future requirements

2/0

b) With neat diagram discuss waterfall model of software development.

CE
82

Also explain its limitations. [8]

.23

c) Write a note on Customer Satisfaction. [5]

16

OR
8.2

P.T.O.
.24
49
Q4) a) Give types of products based on the basis of criticality to the user.

8
23
Explain each type with proper example. [8]

ic-
b) Discuss problematic areas in software development life cycle. [6]

tat
c) List and explain limitations of Capability Maturity Models [CMM]. [3]

6s
4:5
02 91
Q5) a) Differentiate between Manual Testing and Automation Testing. [6]

4:0
0
b) List and explain benefits of Automation testing. [6]

41
c) 2/0 13
What is Performance testing? Explain the uses of it as well. [6]
0
5/2
OR
.23 GP

Q6) a) What is Automation testing? Explain it with an example. [6]

E
82

b) With neat diagram explain Automated testing process. [6]

8
C

23
c) Describe Apache Jmeter based on : [6]

ic-
16

i) Aim / Purpose

tat
8.2

6s
ii) Working
.24

4:5
iii) Advantages
91
49

4:0
30
41

Q7) a) Explain the activities to achieve high software quality in detail. [8]
01
02

b) Write a note on Six Sigma strategy of software quality assurance. [6]

5/2
GP

c) Explain in brief : Histogram, Flowchart and Control chart. [3]

2/0

OR
CE
82

8
23
Q8) a) Explain ISO 9000 Standard in detail. [6]
.23

b) Write a note on Software Quality Assurance [SQA] plan.

ic-[5]
16

tat
c) Explain Ishikawa’s basic tools for quality control. [6]
8.2

6s
.24

4:5
91


49

4:0
30
41
01
02
5/2
GP
2/0
CE
82
.23
16
8.2
.24

[6263]-92 2
49
Total No. of Questions : 8] SEAT No. :

7
23
PD4587 [Total No. of Pages : 2
[6404]-92

ic-
tat
B.E. (Computer Engineering)

3s
SOFTWARE TESTING & QUALITY ASSURANCE

2:2
02 91
3:4
(2019 Pattern) (Semester - VII) (410245D) (Elective - IV)

0
51
2/0 13
Time : 2½ Hours] [Max. Marks : 70
0
5/2
Instructions to the candidates:
.23 GP

1) Solve Q1 or Q2, Q3 or Q4, Q5 or Q6, and Q7 or Q8.

E
72

2) Figures to the right indicate full marks.

7
C

23
3) Assume suitable data, if necessary.

ic-
16

4) Neat diagrams must be drawn wherever necessary.

tat
8.2

3s
.24

2:2
91
Q1) a) State in your own words White Box Testing. [6]
49

3:4
30
51

b) How would you explain performance & security testing? [6]

01
02
5/2

c) Explain Risk Based Testing in detail. [6]

GP
2/0
CE

OR
72

7
23
.23

Q2) a) State in your own words Black Box Testing.

ic-
[6]
16

tat
8.2

3s

b) Can you explain compatibility testing & security testing? [6]

.24

2:2
91
49

3:4

c) What do you think about Exploratory testing. [6]

30
51
01
02
5/2
GP

Q3) a) Can you clarify quality management system. [6]

2/0
CE
72

b) Illustrate selenium’s IDE and explain in detail. [6]

.23

c) Can you clarify different levels of CMM. [5]

16
8.2

OR
.24
49

P.T.O.
Q4) a) Explain why ISO-9001 standard and it’s importance in software testing.[6]

7
23
b) Can you clarify Quality Assurance. [6]

ic-
tat
c) Why software has defects? Explain in detail. [5]

3s
2:2
02 91
3:4
0
51
Q5) a) 2/0 13
What is performance testing. What is use of it? [6]
0
5/2
b) Illustrate selenium tool suite in detail. [6]
.23 GP
E

c) How would you explain Selenium Web Driver? Explain it. [6]
72

7
C

23
ic-
OR
16

tat
8.2

3s
Q6) a) Explain Robotic process Automation in detail. [6]
.24

2:2
91
b) How to choose automation testing tools. Explain it. [6]
49

3:4
30
51

c) Can you explain Selenium Grid in detail. [6]

01
02
5/2
GP
2/0
CE

Q7) a) Explain in detail six sigma characteristics in details. [6]

72

7
23
.23

b) Can you explain how to maintain SQA? ic-[6]

16

tat
8.2

3s

c) Explain Detect Removal Effectiveness in detail. [5]

.24

2:2
91
49

OR
3:4
30
51

Q8) a) Compare Ishikawa’s flow chart and Histogram tool. [6]

01
02
5/2
GP

b) Explain in detail Total Quality Management. [6]

2/0
CE
72

c) Compare Run Chart’s and Control Chart in details. [5]

.23
16
8.2


.24

[6404]-92 2
49