Total No. of Questions : 8] SEAT No.

:
PA-912 [Total No. of Pages : 3
[5927]-342
B.E. (Computer Engineering)
DESIGN AND ANALYSIS OF ALGORITHMS
(2019 Pattern) (Semester - VII) (410241)

Time : 2½ Hours] [Max. Marks : 70

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.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right side indicate marks.
4) Assume suitable data, if necessary.

Q1) a) Solve the matrix chain multiplication for the following 6 matrix problem
using Dynamic programming. [10]
Matrix A1 A2 A3 A4 A5 A6
Dimensions 10×20 20×5 5×15 15×50 50×10 10×15
b) Explain Greedy strategy: Principle, control abstraction, time analysis of
control abstraction with suitable example. [8]
OR
Q2) a) Explain the ‘dynamic programming’ approach for solving problems. Write
a dynamic programming algorithm for creating an optimal binary search
tree for a set of ‘n’ keys. Use the same algorithm to construct the optimal
binary search tree for the following 4 keys. [10]
Key A B C D
Probability 0.1 0.2 0.4 0.3
b) Explain Dynamic programming: Principle, control abstraction, time
analysis of control abstraction with suitable example. [8]
Q3) a) Explain the ‘branch and bound’ approach for solving problems. Write
a branch and bound algorithm for solving the 0/1 Knapsack problem.
Use the same algorithm to solve the following 0/1 Knapsack problem.
The capacity of the Knapsack is 15 kg. [9]
Item A B C D
Profit (Rs.) 18 10 12 10
Weight (kg.) 9 4 6 2
b) Explain with suitable example Backtracking: Principle, control abstraction,
time analysis of control abstraction. [8]
OR
P.T.O.
Q4) a) What is Branch and Bound method? Write control abstraction for Least
Cost search? [9]

b) Explain the backtracking with graph coloring problem. Find solution for
following graph [8]
C1 C2 C3 C4 C5
C1 0 1 0 1 0
C2 1 0 1 0 0
C3 0 1 0 1 1
C4 1 0 1 0 1
C5 0 0 1 0 0

Adjacency matrix for graph G

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

i) Aggregate Analysis
ii) Accounting Method
iii) Potential Function method
iv) Tractable and Non-tractable Problems
b) Write short notes on with suitable example of each [8]
i) Randomized algorithm
ii) Approximation algorithm
OR
Q6) a) What is Potential function method of amortized analysis? To illustrate
Potential method, find amortized cost of PUSH, POP and MULTIPOP
stack operations. [9]

b) What is embedded algorithm? Explain Embedded system scheduling

using power optimized scheduling algorithm. [9]
[5927]-342 2
Q7) a) Write short notes on the following. [10]
i) Multithreaded matrix multiplication.
ii) Multithreaded merge sort
iii) Distributed breadth first search
iv) The Rabin-Karp algorithm
b) With respect to Multithreaded Algorithms explain Analyzing multithreaded
algorithms, Parallel loops, Race conditions. [7]
OR
Q8) a) Write and explain pseudo code for Multi-threaded merge sort algorithm.
How parallel merging gives a significant parallelism advantage over Merge
Sort? [9]

b) Write a pseudo code for naïve string matching algorithm and Rabin-
Karp algorithm for string matching and analyze the same. [8]



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

PA-913 [Total No. of Pages : 3

[5927]-343
B.E. (Computer)
MACHINE LEARNING
(2019 Pattern) (Semester - VII) (410242)

Time : 2½ Hours] [Max. Marks : 70

Instructions to the candidates:
1) Solve Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q6, Q.7 or Q.8.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Make suitable assumption whenever necessary.

Q1) a) Explain in brief techniques to reduce under fitting and over fitting. [6]
b) Find the Equation of linear Regression line using following data : [6]
X Y
1 3
2 4
3 5
4 7
c) Write short note on : [6]
i) MAE
ii) RMSE
iii) R 2
OR
Q2) a) Explain in brief lasso and Ridge Regression. [6]
b) What is Bias and variance trade off for machine learning model? [6]
c) Write short note on Evaluation metrics. [6]

P.T.O.
Q3) a) Explain in brief methods used for Evaluating classification models.
[5]
b) Consider the following data to predict the student pass or fail using the
K-Nearest Neighbor Algorithm (KNN) for the values physics = 6 marks,
Chemistry = 8 marks with number of Neighbors K = 3. [6]
Physics (marks) Chemistry (marks) Results
4 3 Fail
6 7 Pass
7 8 Pass
5 5 Fail
8 8 Pass
c) Write short note on Ensemble learing methods : [6]
i) Simple
ii) Advanced
OR
Q4) a) Explain Random forest Algorithm with example. [5]
b) Write short note on importance of confusion matrix. [6]
c) Define following terms with reference to SVM. [6]
i) Separating hyperplane
ii) Margin

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

and DENCLUE. [6]
b) What is K mean clustering? Explain with example. [6]
c) Write short note on following Hierarchical clustering method : [6]
i) Agglomerative
ii) Dendogram
OR

[5927]-343 2
Q6) a) What is LOF? Explain it with it's advantages and disadvantages. [6]
b) Explain Graph Based clustering. [6]
c) Define following terms : [6]
i) Elbow method
ii) Extrinsic and Intrinsic method

Q7) a) Explain ANN with it's Architecture. [5]

b) Obtain the output of Neuron Y for the Network shown in following
fig. Using activation function as : [6]
i) Binary sigmoidal
ii) Bipolar sigmoidal

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

OR
Q8) a) Explain in brief types of ANN based on layers. [5]
b) What is Recurrent Neural Network? Explain with suitable example.
[6]
c) Write short note on with refernce with CNN. [6]
i) Convolution layer
ii) Hidden layer



[5927]-343 3
Total No. of Questions : 8] SEAT No. :
PA-914 [Total No. of Pages : 2

[5927]-344
B.E. (Computer Engineering)
BLOCKCHAIN TECHNOLOGY
(2019 Pattern) (Semester - VII) (410243)

Time : 2½ Hours ] [Max. Marks : 70

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.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.
4) Assume suitable data, if necessary.

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

i) Public
ii) Private
iii) Consortium
iv) IoTA

b) Discuss following consensus algorithms used in blockchain technology.

[6]
i) Proof of work
ii) Proof of activity
c) Explain proof of stake (POS)? [4]

OR

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

b) Explain in detail [6]
i) Bitcoin
ii) Ethereum
iii) Hyperledger
c) Discuss Byzantine General problem. [4]

OR

P.T.O.
Q3) a) List & explain types of crypto currency. [6]
b) What is Metamask? Illustrate in detail. [6]
c) Differentiate between coinbase & Binance. [5]

OR

Q4) a) What is cryptocurrency? Explain in detail. [6]

b) Explain in detail crypto wallets. [6]
c) Explain in detail Bitcoin. [5]

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

b) Explain solidity in detail. [6]
c) Discuss swarm Decentralized storage platform. [4]

OR

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

b) Discuss whisper Decentralized Messaging platform. [6]
c) Explain Ethereum Virtual Machine in detail. [4]

Q7) a) Explain Block chain applications in retail & banking services. [6]
b) Explain role of blockchain in IoT. [6]
c) Explain role of blockchain in Healthcare. [5]

OR

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

b) Explain blockchain applications in financial services. [6]
c) Explain application of blockchain government sector. [5]

 

[5927]-344 2
Total No. of Questions : 8] SEAT No. :
PA-1662 [Total No. of Pages : 2
[5927]-345
B.E. (Computer Engg.)
PERVASIVE COMPUTING
(2019 Pattern) (Elective-III) (Semester-VII) (410244(A))
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Answer Q1 or Q2, Q3. orQ4, Q5 or Q6, and Q7 or Q8.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.

Q1) a) Explain context aware computing and types of contexts with examples.[9]
b) Describe how to determine the location in mobile networks. [8]

OR

Q2) a) Describe the different challenges in context awareness. [9]

b) Explain the architecture of a context aware system. [8]

Q3) a) Explain reactive type intelligent system model in detail. [9]

b) Explain hybrid intelligent system based upon horizontal and vertical lay-
ering. [9]

OR

Q4) a) Explain different intelligent system operations. [9]

b) Describe the use of an agent interaction protocol suite in the interaction of

multiple ISs designed as MAS. [9]

Q5) a) Describe Wearable Computing Architecture. [9]

b) Define HCI. Explain explicit and implicit HCI [8]

OR

[5927]-345 1 P.T.O.
Q6) a) What is HCI? What is the importance of HCI? What are different advan-
tages and disadvantages of HCI? [9]

b) What is the difference between interaction design and UX design? [8]

Q7) a) Explain different open issues in pervasive computing. [9]

b) What are the security challenges in pervasive computing? [9]

OR

Q8) a) Explain secure resource discovery in detail. [9]

b) What are the solutions for pervasive computing challenges? [9]



[5927]-345 2
Total No. of Questions : 8] SEAT No. :
PA-915 [Total No. of Pages : 2
[5927]-346
B.E. (Computer Engineering)
MULTIMEDIA TECHNIQUES
(2019 Pattern) (Semester - VII) (Elective - III) (410244 B)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Neat diagrams must be drawn wherever necessary.
2) Figures to the right indicate full marks.
3) Use of Calculator is allowed.
4) Assume suitable data, if necessary.

Q1) a) How would you differentiate between conventional TV and HDTV. [5]
b) Explain the Ultra High Definition TV. [6]
c) What are three different interfaces for analog video signal transmission?
Explain anyone in detail. [6]
OR
Q2) a) Draw and explain a typical electronic signal for one scan line of NTSC
composite video. [5]
b) Based on color coding and lines per frame rate identify the similarities
between the PAL video and SECAM video. Explain in a brief NTSC
video. [6]
c) Explain the advantages of digital representation for video. [6]

Q3) a) What are three most used numerical distortion measures in image
compression? Explain in detail. [5]
b) Explain any two types of wavelet transforms. [6]
c) What is JPEG Standard? Draw and explain block diagram for JPEG
encoder. [6]
OR
Q4) a) How would you demonstrate coding tree for HELLO using
Shannon-Fano algorithm. [5]
b) Using the information, you have learned about Dictionary-Based coding,
construct LZW compression for string ABABBABCABABBA. [6]
c) Identify the advantages and disadvantages of Arithmetic coding as
compared to Huffman coding? [6]

[5927]-346 1 P.T.O.
Q5) a) Explain functional requirements for augmented reality ecosystem. [6]
b) Enlist types of head-mounted displays? Explain Mobile VR with suitable
example. [6]
c) Compose Applications, Challenges & Future potential of AR display.[6]
OR
Q6) a) Explain about AR, VR and MR. [6]
b) Explain at least two future applications of Immersive Technologies. [6]
c) Enlist the input devices that are popularly used in immersive experience
systems. Explain any input device in detail. [6]

Q7) a) Decide the major functions of AI-Based software? Explain how AI

achieves incredible accuracy. [6]
b) Explain the use of Big Data and AI technology in medical field. [6]
c) What alternative services would you suggest using M-IoT for road safety
system. [6]
OR
Q8) a) What can be possible challenges to implementing AR Technology? Explain
how AR can be used for the employee training. [6]
b) Judge the importance of immersive experiences for designing academic
applications which serve communication between educators, researchers,
and students. [6]
c) Draw and explain each layer from the architecture of the Internet of
Things (IoT). [6]

  

[5927]-346 2
Total No. of Questions : 8] SEAT No. :
PA-1663 [Total No. of Pages : 2
[5927]-347
B.E. (Computer Engg.)
CYBER SECURITY AND DIGITAL FORENSICS
(2019 Pattern) (Elective-III) (Semester-VII) (410244(C))
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
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.
4) Assume suitable data if necessary.
5) Use of scientific calculator is permitted.

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

Law Enforcement? What are different computer forensics schemes? [9]
b) Explain in detail different Computer Forensics Services. [9]
OR
Q2) a) Explain in details Computer Forensics Assistance to Human Resources.[9]
b) What are the benefits of professional forensics methodology? What are
steps taken by computer forensics specialist? [9]

Q3) a) What are evidences? What are the simple reasons to collect evidences?
What are different options for collecting evidences? [8]
b) What is chain of custody? Explain the process of chain of custody. [9]
OR
Q4) a) What is the general procedure for evidence collection? [8]
b) What are general computer evidence processing steps? Explain in detail.[9]

Q5) a) Explain how to perform remote and live acquisitions with an appropriate
example. [9]
b) What are the different approaches for validating forensic data? [9]
OR

[5927]-347 1 P.T.O.
Q6) a) Brief about the approaches for seizing digital evidence at the crime scene.[9]
b) Give in detail the different techniques to hide data in digital forensics.[9]

Q7) a) Explain types of digital forensics tools. Also explain the task performed
by these tools. [8]
b) State the features of any five computer forensics software tools. [9]
OR
Q8) a) Explain the role of client and server in email and some of the tools for
email forensics. [8]
b) Explain the process for validating and testing forensics software. [9]



[5927]-347 2
Total No. of Questions : 8] SEAT No. :
PA-916 [Total No. of Pages : 2
[5927]-348
B.E. (Computer Engineering)
OBJECT ORIENTED MODELING AND DESIGN
(2019 Pattern) (Semester - VII) (410244 D) (Elective - III)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Attempt Q.No.1 or 2, Q.No.3 or 4, Q.No. 5 or 6, Q.No. 7 or 8.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
4) Assume suitable data, if necessary.

Q1) a) What is Interaction Diagram? Explain Different Components of Sequence

diagram. [6]
b) Compare Sequence diagram and Activity diagram. [6]
c) Design use case diagram for online reservation system. [6]
OR
Q2) a) What are Composite states? Explain Categories of Composite states.[6]
b) Explain following terms with respect to use case. [6]
i) Use Case.
ii) Actor.
iii) System Boundary.
c) Draw Activity Diagram for ATM Machine. [6]

Q3) a) Discuss the steps involved in constructing Application class model.

Explain with suitable example. [6]
b) What is meant by sub system in system design? Explain breaking of
system into subsystems and allocation of subsystems. [6]
c) What are categories of External Control? Explain in Detail. [5]
OR
Q4) a) Explain in detail components of a component diagram. [6]
b) Explain following with respect to deployment diagram. [6]
i) Node.
ii) Association.
iii) Dependency
c) Draw Deployment diagram for ATM System. [5]
[5927]-348 1 P.T.O.
Q5) a) Prepare a data dictionary for a ATM system scenario. Explain each
element in a brief. [6]
b) What is abstraction? Explain different categories of abstraction. [6]
c) What do you mean by System Design? Explain with suitable example.[6]
OR
Q6) a) Give detailed guidelines for finding and defining classes involved in
software system scenario. [6]
b) List and Explain different types of dependencies in package. [6]
c) Discuss how you identify use cases and actors with respect to use case
diagrams? [6]

Q7) a) Explain. [6]

i) Creational Patterns.
ii) Structural Patterns.
iii) Behavioral Pattern.
b) Discuss Adapter Design Pattern. [6]
c) Discuss Observer Design Pattern. [5]
OR
Q8) a) What is Design Pattern? Explain different types of design Patterns. [6]
b) State and explain entities involved in design pattern. [6]
c) Explain Strategy Design patterns. [5]

  

[5927]-348 2
Total No. of Questions : 10] SEAT No. :
PA-917 [Total No. of Pages : 2
[5927]-349
B.E. (Computer Engineering)
DIGITAL SIGNAL PROCESSING
(2019 Pattern) (Semester - VII) (410244E) (Elective - III)
Time : 2½ Hours] [Max. Marks : 70
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, Q.9 or Q.10.
2) Neat diagrams must be drawn wherever necessary.
3) Figure to the right indicate full marks.
4) Your answer will be valued as a whole.
5) Use of logarithmic tables slide rule, Mollier charts, electronic pocket calculator
and steam tables is allowed.
6) Assume suitable data, if necessary.
Q1) a) Find the Z - transform of the following discrete time signal and find the
ROC. [8]
n −n
 1 1
i) x ( n ) =  −  u ( n ) +   u ( − n − 1) .
 5 2
n
1
ii) x ( n ) = ( n + 0.5 )   u ( n ) .
5
b) State and prove the convolution property of Z - transform. [6]
OR
Q2) a) An LTI system is described by equation y (n) = x (n) + 0.8 x (n – 1) +
0.8 x(n – 2) – 0.49 y(n – 2). Determine the transfer function of the
system. Sketch the poles and zeros on the z – plane. [8]
b) Find the impulse response of the system described by the difference
equation, y (n) – 3y (n – 1) –4y (n – 2) = x (n) + 2x (n – 1). [6]

1 1
Q3) a) The transfer function of a system is given by, H ( z ) = −1
+
1 − 0.5 z 1 − 2 z −1
Determine the stability and causality of the system for [8]
i) ROC : |z| > 2;
ii) ROC : |z| < 0.5
b) State and prove the following properties of DFT: [6]
i) Time reversal property.
ii) Complex conjugate property.
OR
[5927]-349 1 P.T.O.
Q4) a) If x1(n) = {1, 2, 1, –2} and x2(n) = {3, –2, 1, –3} compute the circular
convolution using DFT-IDFT method. [8]
b) Explain Gibbs phenomenon in detail. [6]

Q5) a) Find 8-point DFT using radix-2 DIF FFT algorithm for the given sequence:
x(n) = {–1, 0, 2, 0, –4, 0, 2, 0}. [8]
b) Show and compare computational complexity is reduced if 16-point
DFT is computed using radix-2 DIT FFT algorithm. [6]
OR
Q6) a) Compute the DFT of following sequences using DIT FFT algorithm.[8]
i) x (0) = {1, 2, 3, 4}
ii) x (n) = {1, 2, 3, 1}
b) Explain in detail DIFFFT algorithm. [6]

Q7) a) Realize the following FIR system with minimum number of multipliers.
h (n) = {–0.5, 0.8, –0.5} [8]
b) Compare FIR and IIR filters. [6]
OR
Q8) a) Design a Butterworth filter using impulse invariant method transformation
to satisfy the following specifications.
0.707 < | H (e) jω | < 1; for 0 < ω < 0.2π
| H (e) jω | < 0.2; for 0.6 π < ω < π. [8]
b) What is bilinear transformation? Explain the properties of BLT. [6]

Q9) a) Write a short note on: SHARC DSP processor. [6]

b) What are the desirable features of DSP processors? [4]
c) What is prewarping? [4]
OR
Q10)a) Realize the cascade and parallel structure of the system governed by the
3 1 1
difference equation, y ( n ) −
y ( n − 1) − y ( n − 2 ) = x ( n ) + x ( n − 1) .
10 10 9
[6]
b) Explain following window functions:
i) Hammimng window [4]
ii) Hanning window [4]

  

[5927]-349 2
Total No. of Questions : 8] SEAT No. :
PA-918 [Total No. of Pages : 2

[5927]-350
B.E. (Computer Engineering)
INFORMATION RETRIEVAL
(2019 Pattern) (Semester - VII) (410245 A) (Elective - IV)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates :
1) Solve 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 indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
4) Assume sitable data, if necessary.

Q1) a) Explain Data Compression with Huffman Coding. [9]

b) What are the Context-Aware Compression Methods? Explain it in detail.[9]
OR
Q2) a) Write a short note on : [9]
i) Decoding Performance
ii) Document Reordering
iii) Arithmetic Coding
b) Explain in detail Invalidation List, Garbage Collection, Document
Modifications in document deletion. [9]

Q3) a) Explain Categorization and Filtering with any two detailed Examples. [9]
b) Explain the Information-Theoretic Model in detail. [8]
OR
Q4) a) Explain Probabilistic Classifiers & Generalized Linear Models. [9]
b) Describe Language Models and Smoothing. [8]

P.T.O.
Q5) a) Explain Traditional effectiveness measure and The Text Retrieval
Conference (TREC) with suitable examples. [9]
b) Write a short note on : [9]
i) Nontraditional effectiveness measures
ii) Measuring efficiency
OR
Q6) a) What is Scheduling and Caching in Measuring Efficiency?. Explain in
detail. [9]
b) Write a short note on : [9]
i) Using statistics in evaluation
ii) Minimizing adjudication Effort

Q7) a) Describe Parallel Query Processing with suitable examples. [8]

b) Write a short note on : [9]
i) The structure of the web
ii) Quires and Users
iii) Static ranking
OR
Q8) a) Describe MapReduce with suitable examples. [9]
b) Write a short note on : [8]
i) Evaluation web search
ii) Web Crawlers
iii) Web crawler libraries
iv) Dynamic ranking



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

PA-919 [Total No. of Pages : 2

[5927]-351
B.E (Computer Engineering)
GPU PROGRAMMING AND ARCHITECTURE
(2019 Pattern) (Semester - VII) (410245B) (Elective - IV)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Answer Q1 or Q2, Q3 or Q4, Q5 or Q6 and Q7 or Q8.
2) Figures to the right indicate full marks.
3) Neat diagrams must be drawn wherever necessary.
4) Make suitable assumptions wherever necessary.

Q1) a) Describe CUDA error handling APIs and explain how they can be used
for error checking. [9]
b) Describe parallel programming issues. [9]
OR
Q2) a) Explain synchronization problems along with possible solutions. [9]
b) What are tools and techniques that you should employ for finding and
solving CUDA errors? [9]

Q3) a) What are various OpenCL components? [9]

b) In brief explain OpenCL memory hierarchy. [8]
OR
Q4) a) Explain OpenCL architecture. [8]
b) Explain kernel programming model. [9]

Q5) a) Explain MPI communication on GPU. [9]

b) In brief discuss CSR format for sparse matrix. [9]
OR

P.T.O.
Q6) a) Explain convolution parallel algorithm. [9]
b) What is task parallelism and data parallelism? [9]

Q7) a) Explain how OpenCL can be used for Heterogeneous Computing? [9]
b) Enlist and explain few OpenCL applications. [8]
OR
Q8) a) Write short note on - Efficient Neural Network Training/ Inferencing.[9]
b) Explain OpenCL application design process. [8]



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

PA-920 [Total No. of Pages : 2

[5927]-352
B.E. (Computer Engineering)
MOBILE COMPUTING (Theory)
(2019 Pattern) (Semester-VII) (410245C) (Elective - IV)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates:
1) Solve Q1 or Q2, Q3 or Q4, Q5 or Q6, Q7 or Q8.
2) Figures to the right indicate full marks.
3) Assume suitable data, if necessary.
4) Neat diagrams must be drawn wherever necessary.

Q1) a) Write a short note on GSM. [6]

b) Write a short note on UMTS. [6]
c) Explain the protocol architecture of IEEE 802.11. [6]
OR

Q2) a) Write a short note on: Authentication and privacy in GSM. [6]
b) Explain the relationship between the Base Station and Mobile Switching
Centre? Discuss the role of the EIR entity of GSM network. [6]
c) What are the characteristics of SIM? [6]

Q3) a) Explain the process of call origination and call termination in GSM. [6]
b) Write a short note on the GSM MAP service framework. [6]
c) Write a short note on VLR identification algorithm O-I. [5]
OR

Q4) a) Discuss the GSM interface and GSM protocol architecture. [6]
b) Write a short note on VLR failure restoration. [6]
c) Difference between the Soft Hand-off and Hard Hand-off. [5]

P.T.O.
Q5) a) What is the goal of mobile MP? [6]
b) Describe DSDV and DSR routing algorithms for ad hoc networks. [6]
c) Discuss how tunneling works for Mobile IP using IP-in-IP encapsulation.
[6]
OR
Q6) a) Write a short note on IPv6. [6]
b) Write a short note on Macro mobility. [4]
c) Write a short note on [8]
i) MANET
ii) VANET

Q7) a) Define the role of 5G in IoT. [6]

b) Explain block diagram for UMTS in detail. [6]
c) State and explain the features of W-CDMA. [5]
OR

Q8) a) Write a short note on Quality of service in the 3G network. [6]

b) Explain Forward W-CDMA channel and reverse W-CDMA channel. [6]
c) Write a short note on Long Term Evolution (LTE) in 4G. [5]



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

PA-921 [Total No. of Pages : 2

[5927] - 353
B.E. (Computer) (Semester - VII)
SOFTWARE TESTING & QUALITY ASSURANCE
(2019 Pattern) (Elective - IV) (410245 D)
Time : 2½ Hours] [Max. Marks : 70
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.
2) Neat diagrams must be drawn wherever necessary.
3) Figures to the right indicate full marks.

Q1) a) What do you think about static techniques? [6]

b) State in your own words Error guessing and exploratory testing. [6]

c) How would you explain System Testing and Acceptance Testing? [6]

OR

Q2) a) Can you explain path coverage testing & conditional coverage testing.
[6]

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

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

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

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

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

OR

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

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

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

Q5) a) How would you explain selenium IDE explain in detail? [6]

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

c) Construct different automated testing process. [6]

OR

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

b) Identify different benefits of Automation testing. [6]

c) How would you explain selenium Web Driver? Explain it. [6]

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

b) Explain in detail six sigma characteristics in details. [6]

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

OR

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

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

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



[5927]-353 2
Total No. of Questions : 8] SEAT No. :
PA-922 [Total No. of Pages : 2

[5927]-354
B.E. (Computer)
COMPILERS (Elective - IV)
(2019 Pattern) (Semester - VII) (410245-E)
Time : 2½ Hours] [Max. Marks : 70
Instructions to the candidates :
1) Solve 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.
4) Assume suitable data if necessary.

Q1) a) What is Three Address Code? Explain Quadraples & Triples. [10]
b) Explain about Syntax Directed Translation Scheme. [8]
OR
Q2) a) Explain the terms : [7]
i) S - attributed Grammar
ii) L - attributed Grammar
b) Generate Annotated Parse Tree– a*b–c|e+f. [6]
c) Explain Syntax Tree. [5]

Q3) a) Explain Static & Dynamic Scope. [9]

b) Explain any 2 Storage Allocation methods. [8]

OR

Q4) a) Explain the Dangling Pointer. [6]

b) What is activation Record. [6]
c) Explain about Heap Allocation. [5]

P.T.O.