SETSQUARE ACADEMY

Degree Engineering (MU)

COMPUTER ENGINEERING
B.E. SEMESTER VII
Question Paper Set
(December 2015 - May 2017)
CONTENTS

Sr. No. Subject Page No.

1. Digital Signal Processing 14
2. Cryptography And System Security 57
3. Artificial Intelligence 8 13
4. Advance Algorithms (Elective) 14 18
5. Image Processing (Elective) 19 22
6. Soft Computing (Elective) 23 25
7. ERP & Supply Chain Management (Elective) 26 29
As per the Revised Syllabus effective from Academic Year 201516
To Download Subjectwise Question Paper Set Visit:
www.setsquareacademy.com
Visit our centre to get printed question set just @ Rs 0.30/Side.
Diploma & Degree Engineering Classes
Got ZEAL for Teaching/Education Industry?
Internship/Job Opportunities for Freshers
Full/Part Time/Contract Basis Requirements for:
Home/Private Tutors for SSC/HSC/Engg/GATE.
Content Development for SSC/HSC/Engg/GATE.
Digital/Social Media/Field Marketing and Sales.
Content Typing/Editing/DTP Operator.
Eligibility, Selection Criteria and Benets
B.E/M.E appearing/passouts & College Faculties.
Get Experience/Recommendation Certicate.
All necessary Training/Grooming will be provided.
Selection based on Merit/Interview/Demo Lecture.
Salary/Royalty/Stipend is subjected to Expertise.
To Register as a Home/Private Tutor CLICK HERE
For other positions send your resume to us at
[email protected]
For Syllabus, QP & Solutions :
www.setsquareacademy.com
Address : Setsquare Academy Pvt. Ltd., 2nd oor, Govind
Smruti, Near Jagdish Book Depot, Lohar Ali, Thane (W).
For further details please Call or Whatsapp : 9920848746
 B.E. SEM VII - DSP 1

DIGITAL SIGNAL PROCESSING

Y
DECEMBER 2015

EM

Y
MD-Con.7987-15 (REVISED COURSE) QP Code : 5863
(3 Hours) [Total Marks : 80]
N.B.: (1) Question No 1 is compulsory

AD

EM
(2) Attempt any three Questions out of remaining five questions.
(3) Assume suitable data wherever required and clearly specify it,
(4) Figures to the right indicate full marks.
AC
1. (a) State the condition for stability of LTI system, determine the range of values of a and b for which the
impulse time invariant system with following given impulse response is stable. 5
RE

D
a n n 0
h[n] = n
b n 0
UA

CA
(b) Find the Energy of the signal x (n) = 0.5n u (n) +8n u ( n l) 5
(c) Find the value of x(n) = cos(0.25n) for n= 0, 1, 2,3 Compute the DFT of x(n) using FFT flow graph. 5
SQ

(d) Find the cross correlation of the sequences x(n) = {1, 2,3, 4} and h(n) = {2, 4, 6} 5

T

EA
SE

2. (a) Determine whether or not the following signals are periodic If periodic specify its fundamental period. 10
(i) x1 (n) = cos(0.5 n + 0.3)
(ii) x2 (n) = cos ( 0.3 n) + 10 sin (0.25 n)
(b) Compute Linear convolution of causal x(n) and h(n) using overlap add method in time domain 10
x(n) = { l , 2 , 3 , 4 , 5,6,7,8 }, h (n) = {1, 1, 1}

Y
AR

EM
3. (a) Check whether the given system y(n) = x(2n) x(n1) is : 10
(i) Static or Dynamic (ii) Linear or non -linear (iii) Shift invariant or variant (iv) Causal or non causal
(v) Stable or unstable.
AD
(b) State the following DFT properties : 10
(i) Linearity property (ii) Periodicity (iii) Time shift (iv) Convolution (v) Time Reversal
QU

AC

4. (a) For the causal LTI digital filter with impulse response given by h(n) = 0.3 (n) (n 1) + 0.38 (n3)
sketch the magnitude spectrum of the filter Using DFT. 10
(b) Let X (K) = { 20, 0, 4+ 4j, 0, 4} is the 8 point DFT of a real valued sequence x(n) 10
RE

(i) Find X(K) for K = 5,6,7.

(ii) Find the 8 point DFT P(K) such that p(n) = ( l)n x(n). Using DFT property.
TS

UA

5. (a) Find circular convolution and linear convolution using circular convolution for the, following sequences 10
x1[n] = { 1, 2, 3, 4} and x2 [n] = { 1, 2, 1, 2}. Using Time Domain formula method.
(b) Derive radix 2 DIT FFT flow graph and find the DFT of the sequence x (n) = { 0,1,2,3} 10
SQ
SE

6. (a) Write a detailed note on DSP Processor. 10

T

(b) Write a detailed note on Carls Correlation Coefficient Algorithm. Justify the necessary of Algorithm by
SE

given suitable example. 10

 SETSQUARE ACADEMY 2

MAY 2016
FW-Con.9945-16 (REVISED COURSE) QP Code : 31256

Y
(3 Hours) [Total Marks : 80]

EM

Y
N.B.: (1) Question No. 1 is compulsory.
(2) Attempt any three questions out of remaining.
(3) Assume suitable data if necessary and justify the assumptions.

EM
AD
(4) Figures to the right indicate full marks.

1. (a) For the given causal sequences x(n) = {8, 9,2, 3} and h(n) = {4, 3, 6} find the cross correlation. 5
AC
(b) State the condition for stability of LTI system and determine for the given discrete time system 5
h(n) = (0.3)n u (n) + 5(n), is stable or not.
(c) Differentiate IIR and FIR systems. 5

D
RE

(d) For the causal signal x(n) = {2, 2, 4, 4} compute four point DFT using DIT-FFT. 5

2. (a) Check whether following system y(n) = 2x(n 1) + x(2n) is: 10

UA

CA
(i) Linear or non Linear (ii) Causal or non-causal (iii) Time variant or Time invariant (iv) Static or Dynamic
(b) Draw the radix 2 DIT flow graph and find the DFT of the sequence x(n) = {10, 11, 8, 5} using FFT
flow graph. 10
SQ

3. (a) For x(n) = {2 3 4 5 1 3} , plot the following Discrete Time signals: 10

T

EA

SE

(i) x (nl) (ii) x(n)u(n) (iii) x(nl)u(n1) (iv) x(n)u(n) (v) x(2n)
(b) Determine whether or not the following signals are periodic If periodic specify its fundamental period. 10
1. x(n) = sin(0.25 n + 0.4) 2. x(n) = cos(0.5 ) + sin (0.25 n)

Y
4. (a) For the FIR digital filter with impulse response given by h(n) = 2(n) + 3(nl) + 4(n3) + (n4) sketch
AR

the magnitude response of the filter? 10

(b) State any five DFT properties. EM 10

5. (a) Find circular convolution of x1(n) = {5,6,2,1} and x2 (n) = {3,2,1,4} by computing DFT of x1(n) and
AD
x2(n) 10
QU

(b) Compute Linear Convolution of casual sequence x(n) = {7,6,4,5,2,4,5,2,3} and h(n) = {1,2,3,1} 10
using fast overlap save method.
AC

6. (a) Write a detailed note Carls Correlation Coefficient Algorithm. 10

(b) Write a detailed note DSP Processor and Architecture. 10
RE
TS

DECEMBER 2016
UA

(REVISED COURSE) QP Code : 622700

(3 Hours) [Total Marks : 80]
N.B.: (1) Question No. 1 is compulsory
SQ

(2) Attempt any three out of remaining

SE

(3) Assume suitable data if necessary and justify the assumptions

(4) Figures to the right indicate full marks
T
SE

1. (a) Perform linear convolution operation between given function in time domain if 5
x1(n) = (3)n for n = 0, 1, 2, 3
= 0 otherwise and
x2(n) = u(n) u(n 4)
 B.E. SEM VII - DSP 3

(b) Find whether the given signal is energy signal or not x(n) = u(n) u(n 6) 5
(c) State the stability criteria of discrete time system and determine the given IIR system is stable or not

Y
y(n) = 5x(n) + 12. 5

EM

Y
(d) Find IDFT of X(k) = {2, 1 j, 0, l + j}. 5

2. (a) Consider the following analog signal 10

AD

EM
x(t)=2sin( 100 * * t)
The signal x(t) is sampled with a sampling rate Fs = 50Hz. Determine the discrete time signal. Plot the
discrete time signal. And also calculate total number of samples.
AC
(b) If x1(n) = {1, 2,3, 6} find X1(K) and p(n) = {1, 6,3, 2} Find P(K) using X1(K). 10

RE

D
3. (a) Check whether following systems are : 10
(i)Static or Dynamic (ii)Linear or Non-linear (iii) Shift invariant or variant (iv)Causal or Non-causal.
UA

CA
(a) y(n) = 2n u(n) (b) y(n) = 4x(n) + x(n2)
(b) For x(n) = {8,5, 2, 4, 2,1} , plot the following Discrete Time signals: 10
SQ

(i) x(n+2) (ii) x(n)u(n) (iii) x(nl )u(n2) (iv) x(n l)u(n) (v) x(2n 1)
T

EA
4. (a) State any five DFT properties. 10
SE

(b) Draw the radix 2 DIT FFT and find the DFT of the sequence 10
x(n) = {2, 3, 4, 1, 0, 0, 0, 0} using FFT flow graph.

5. (a) Compute Linear Convolution of causal sequence x(n) = {5, 6, 2, 4, 1, 4, 5, 2, 3} and h(n)={ 2, l, 3, 1}

Y
using fast overlap add method. 10
AR

(b) For the FIR digital filter with impulse response given by h(n) = (n) + 2(n2) + 3(n3) sketch the

EM
magnitude response of the filter. 10

6. (a) Write a detailed note on TMS 320. 10

AD
(b) Write a detailed note on Carls Correlation Coefficient Algorithm. 10
QU

MAY 2017
AC

(REVISED COURSE) QP Code : 622701

(3 Hours) [Total Marks : 80]
N.B.: (1) Question No. 1 is compulsory
RE

(2) Attempt any three out of remaining

TS

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

UA

(4) Figures to the right indicate full marks.

1. (a) Compare IIR systems with FIR systems. 5

SQ

(b) State whether x[n] = sin (n/3) is an energy or power signal with proper justification. 5
SE

(c) If x[n] = {1, 2, 2, 1, 3, 1} is a periodic signal. Plot it in circular representation for 5

(i) x [ n ] (ii) x[n 2] (iii) x [n + 2] (iv) x [ (n 2] (v) x [ ( n + 2) ]
T

(d) State BIBO stability criterion for LTI systems. Determine the range of values of 'p' and ' q ' for the 5
SE

stability of LTI system with impulse response:

h[n] = pn ,n0
n
=q ,n0
 SETSQUARE ACADEMY 4

2. (a) Check whether the system y[n] = an u[n] is 10

(i) Static or Dynamic (ii) Linear or Non linear (iii) Causal or Non casual (iv) Shift variant or Shift Invariant

Y
(b) Check the periodicity of the following signals and if periodic, find their fundamental period 10

EM

Y
(i) cos(n/6).cos(n /6) (ii) sin (2 n/3) + cos(2 n/5)

3. (a) Determine the output response of the LTI system using time domain method whose input is 10

EM
AD
x[n] = 3 [n+1] 2 [n] + [n 1] + 4[n 2] and h[n] = 2[n 1] + 5 [n 2]+ 3 [n 3]
(b) If a continuous time signal x(t) = sin (2 2000t) + 2sin (2 1000t) is sampled at 8000 10
samples/sec. Find out the 4-point DFT of it. Sketch the phase and magnitude spectrum.
AC
4. (a) Explain any five properties of DFT 10
(b) Compute linear convolution of the casual sequences x[n] = {2, 3, 1, 4, 3, 2, 4, 1} and 10

D
RE

h[n] = {2, 1} using overlap save method.

5. (a) Compute circular convolution of the casual sequences x[n] = {1, 1, 1, 1} and h[n] = {1, 2, 3, 4} 10
UA

CA
using radix - 2 DIT FFT method.
(b) If the DFT of x[n] is X(k) = {2, j3, 0, j3} using DFT properties , find : 10
(i) DFT of x[n 2] (ii) Signal energy (iii) DFT of x*[n] (iv) DFT of x2 [n] (v) DFT of x[ n]
SQ

6. (a) Explain the significance of Carls Correlation Coefficient Algorithm in digital signal processing. Evaluate 10
T

Carls Coefficient for two casual sequences. x[n] = {2, 4, 4, 8} and y[n] = {1, 1, 2, 2}
EA
(b) (i) Calculate the percentage saving in calculations in a 64 point radix - 2FFT systems with respect to 5
SE

the number of complex additions and multiplications required, when compared to direct DFT system.
(ii) Write a detailed note on DSP processor. 5

Y
AR

EM
AD
QU

AC
RE
TS

UA
SQ
SE

T
SE
 B.E.SEM VII - CSS 5

CRYPTOGRAPHY AND SYSTEM SECURITY

Y
DECEMBER 2015

EM

Y
MD-Con.8764-15 (REVISED COURSE) QP Code : 5904
(3 Hours) [Total Marks : 80]
N.B: (1) Question No 1 is compulsory.

AD

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

1. (a) Define the following with examples:

AC
(i) Substitution cipher (ii) Poly-alphabetic cipher (iii) Salami attack (iv) Session Hijacking 10
(b) With the help of examples explain non-malicious programming errors. 5
(c) Define the goals of security and specify mechanisms to achieve each goal. 5
RE

D
2. (a) In an RSA system the public key (e, n) of user A is defined as (7,119). 10
UA

Calculate n and private key d. What is the cipher text when you encrypt message m =10, using the public key?

CA
(b) Give the format of X 509 digital certificate and explain the use of digital signature in it. 5
(c) Encrypt "The key is hidden under the door" using Playfair cipher with keyword "domestic". 5
SQ

3. (a) Explain how a key is shared between two parties using Diffie Hellman key exchange algorithm. What is the
drawback of this algorithm? 10
T

EA
(b) Differentiate between (i) MD-5 and SHA (ii) Firewall and IDS 10
SE

4. (a) Explain working of DES detailing the Fiestel structure 10

(b) What is a Denial of service attack. What are the different ways in which an attacker can mount a DOS
attack on a system? . 10

Y
AR

5. (a) List the functions of the different protocols of SSL. Explain the handshake protocol. 5

EM
(b) How does PGP achieve confidentiality and authentication in emails? 5
(c) Differentiate between the transport mode and tunnel mode of IPSec and explain how authentication and
confidentiality are achieved using IPSec. 10
AD
6. Write in brief about (any four): 20
QU

(i) Operating System Security. (ii) Buffer overflow attack. (iii) IP spoofing (iv) Viruses and their types.
AC

(v) Key generation in IDEA.

MAY 2016
RE

FW-Con.10600-16 (REVISED COURSE) QP Code : 31296

(3 Hours) [Total Marks : 80]
TS

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

UA

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

1. (a) Explain software flaws with examples. 5

SQ
SE

(b) List with examples the different mechanisms to achieve security 5

(c) Explain with examples, keyed and keyless transposition ciphers 5
T

(d) Elaborate the steps of key generation using RSA algorithm 5

SE

2. (a) A and B decide to use Diffie Hellman algorithm to share a key. They chose p = 23 and g = 5 as the public
parameters. Their secret keys are 6 and 15 respectively. Compute the secret key that they share. 10
(b) Explain working of DES; 10
 SETSQUARE ACADEMY 6

3. (a) What is access control? How does the Bell La Padula model achieve access control. 10
(b) What is a digital signature. Explain any digital signature algorithm in detail. 10

Y
EM

Y
4. (a) Compare packet sniffing and packet spoofing. Explain session hijacking attack. 10
(b) Explain working of Kerberos. 10

EM
AD
5. (a) What is a firewall? What are the firewall design principles? 5
(b) What are the various ways for memory and address protection. 5
(c) Explain the significance of an Intrusion Detection System for securing a network. Compare signature based
AC
and anomaly based IDS. 10

6. Write in brief about (any four): 20

D
RE

(i) Email Security. (ii) SSL handshake protocol (iii) IPSec protocols for security
(iv) Denial of service attacks (v) IDEA
UA

CA
DECEMBER 2016
(REVISED COURSE) QP Code : 811502
(3 Hours) [Total Marks : 80]
SQ

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

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

EA
SE

1. (a) What are block ciphers? Explain with examples the CBC and ECB modes of block ciphers. 5
(b) Encrypt the string This is an easy task using a playfair cipher with key monarchy. 5
(c) Define authentication and non-repudiation and show with examples how each one can be achieved. 5
(d) Describe triple DES with two DES keys. Is man in the middle attack possible on triple DES? 5

Y
2. (a) A and B decide to use Diffie Hellman algorithm to share a key. They choose p = 23 and g = 5 as the
AR

(b) EM
public parameters. Their secret keys are 6 and 15 respectively. Compute the secret key that they share. 10
Compare DES and IDEA. Explain the round key generation scheme in both these algorithms. 10
AD
3. (a) What are the different types of viruses and worms? How do they propagate? 10
(b) What are the various ways for memory and address protection in Operating systems? How is
QU

authentication achieved in O.S? 10

AC

4. (a) Explain briefly with examples, how the following attacks occur: 10
(i) Salami attack (ii) Denial of Service attack (iii) Session hijacking attack (iv) Cross-cite scripting attack
(b) How is security achieved in the transport and tunnel modes of IPSec? Describe the role of AH and ESP. 10
RE
TS

5. (a) How is confidentiality achieved in emails using either S/MIME or PGP? 5

UA

(b) A and B wish to use RSA to communicate securely. A chooses public key (e, n) as (7,247) and B chooses
public key (e, n) as (5,221). Calculate their private keys. What will he the cipher text sent by A to B if A
wishes to send message m = 5 securely to B? 10
SQ

(c) What is a digital signature? Explain any digital signature algorithm. 5

SE

6. (a) Compare and contrast (any two): 10

T

(i) Block and stream ciphers (ii) MD-5 versus SHA (iii) KDC versus CA
SE

(b) What are firewalls. Explain the different types of firewalls and mention the layer in which they operate. 10
 B.E.SEM VII - CSS 7

MAY 2017

Y
(REVISED COURSE) QP Code : 811500
(3 Hours) [Total Marks : 80]

EM

Y
N.B: (1) Question 1 is compulsory.
(2) Attempt any 3 questions out of the rest.
(3) Make suitable assumptions whenever necessary and justify them

AD

EM
(4) Each question carries equal marks.

1. (a) Use the Play fair cipher with the keyword : "MEDICINE" to encipher the message "The greatest wealth 5
AC
is health".
(b) Explain key rings in PGP. 5
(c) Briefly define idea behind RSA and also explain 10
RE

D
(i) What is the one way function in this system? (ii) What is the trap door in this?
(iii) Give Public key and Private Key. (iv) Describe security in this system.
UA

CA
2. (a) Explain DES, detailing the Feistel structure and S-block design 10
(b) Consider a Voter data management system in E-voting system with sensitive and non-sensitive attributes.10
(i) Show with sample queries how attacks (Direct, Inference) are possible on such data sets
SQ

(ii) Suggest 2 different ways to mitigate the problem.

T

3. (a) Explain Diffie-Hellman Key exchange algorithm with suitable example. Also explain the problem of 10
EA
SE

MIM attack in it
(b) What are Denial of Service attacks? Explain any three types of DOS attacks in detail 10

4. (a) IPSec offers security at n/w layer. What is the need of SSL? Explain the services of SSL protocol? 10
(b) What are the types of firewalls? How are firewalls different from IDS 10

Y
AR

EM
5. (a) What are the various ways in which public key distribution is implemented. Explain the working of 10
public key certificates clearly detailing the role of certificate authority.
(b) Why are Digital Signatures & Digital certificates required? What is the significance of Dual Signature. 10
AD
6. Attempt any 4 20
QU

(a) SHA-1 (b) Timing and Storage Covert Channel (c) Session Hijacking and Spoofing (d) Blowfish
AC

(f) S/MIME
RE
TS

UA
SQ
SE

T
SE

LEARN & EARN WITH our Unique FACTBUDDY PROGRAM

E-mail: [email protected] www.factcareerplan.com
 SETSQUARE ACADEMY 8

ARTIFICIAL INTELLIGENCE

Y
DECEMBER 2015

EM

Y
MD-Con.9979-15 (REVISED COURSE) QP Code : 5942
(3 Hours) [Total Marks : 80]
N.B: (1) Each question carry 20 marks

EM
(2)
(3)
(4)
AD
Question 1 is compulsory
Attempt any three (3) from the remaining questions
Assume suitable data wherever required
AC
l. Attempt any four (4) questions from the following 20
(a) Define heuristic function. Give an example heuristics function for Blocks World Problem.

D
RE

(b) Find the heuristics value for a particular state of the Blocks World Problem.
(c) Define Rationality and Rational Agent. Give an example of rational action performed by any intelligent agent
UA

(d) Compare and Contrast problem solving agent and planning agent

CA
(e) Represent the following statement into FOPL.
(i) Anyone who kills an animal is loved by no one
SQ

(ii) A square is breezy if and only if there is a pit in a neighboring square (Assume the wumpus world
environment).
(iii) Give the PEAS description for an internet shopping agent. Characterize its environment
T

EA
SE

2. (a) Consider the graph given in Figure. Assume 4 4 10

1 2 3
that the initial state is S and the goal state is 7. 3
Find a path from initial state to the goal state using
A* Search. Also report the solution cost. The 5 5
S
7
straight line distance heuristic estimates for the

Y
4 3
AR

nodes are as follows: 2 4

(b)
h(1) = 14, h(2) = 10, h(3) = 8, h(4) = 12,
h(5) = 10, h(6) = 10, h(S) = 15.
Draw and describe the architecture of expert system.
4 5
EM 6

6
AD
(c) Convert the following propositional logic statement into CNF: A (B C) 4
QU

3. (a) Consider the following axioms:

AC

All people who are graduating are happy.

All happy people smile.
Someone is graduating.
RE

(i) Represent these axioms in first order predicate logic. 4

(ii) Convert each formula to clause form 4
TS

(iii) Prove that "Is someone smiling?" using resolution technique. Draw the resolution tree. 4
UA

(b) What are the basic building blocks of Learning Agent? Explain each of them with a neat block diagram 8
SQ
SE

T
SE
 B.E.SEM VII - AI 9

4. (a) Construct a decision tree for the following set of samples. Write any two decision rules obtained from the
tree. Classify a new sample with (gender = Female, height = 1.92m) 10

Y
Person ID Gender Height Class

EM

Y
1 Female 1.6m Short
2 Male 2m Tall

AD

EM
3 Female 1.9m Medium
4 Female 2.1m Tall
5 Female 1.7m Short
AC
6 Male 1.85m Medium
7 Female 1.6m Short
RE

D
8 Male 1.7m Short
9 Male 2.2m Tall
UA

(b) What are the problems/frustrations that occur in hill climbing technique? Illustrate with an example. 6

CA
(c) Draw a game tree for a Tic-Tac-Toe problem. 4
SQ

5. (a) Write a short note on genetic algorithm. 8

(b) It is known whether or not a person has cancer is directly influenced by whether she is exposed
to second-hand smoke and whether she smokes. Both of these things are affected by whether her parents
T

EA
smoke. Cancer reduces a persons life expectancy. 6
SE

(i) Draw the Bayesian Belief Network for the above situation
(ii) Associate a conditional probability table for each node
(c) Explain a partial order planner with an example. 6

6. (a) Write a PROLOG program to find Fibonacci series 10

Y
(b) What are the levels of knowledge used in language understanding? Also write down the techniques used in
AR

EM
NLP. 10

MAY 2016
AD
FW-Con.11269-16 (REVISED COURSE) QP Code : 31334
(3 Hours) [Total Marks : 80]
QU

N.B.: (1) Each question carry 20 marks.

AC

(2) Question 1 is compulsory.

(3) Attempt any three (3) from the remaining questions.
(4) Assume suitable data wherever required.
RE

1. Attempt any four (4) questions from the following: 20

TS

(a) Draw and explain architecture of Expert System.

UA

(b) Explain Hill-climbing algorithm with an example.

(c) Give PEAS description for a Robot Soccer player. Characterize its environment
(d) Explain Turing test designed for satisfactory operational definition of intelligence.
SQ

(e) Prove that A* is admissible if it uses a monotone heuristic.

SE

(f) Compare and Contrast problem solving agent and planning agent.
T

2. (a) Explain decision tree learning with an example. What are decision rules? How to use it for classifying new
SE

samples? 10
 SETSQUARE ACADEMY 10

(b) Write first order logic statements for following statements: 10

(i) If a perfect square is divisible by a prime p then it is also divisible by square of p.

Y
(ii) Every perfect square is divisible by some prime.

EM

Y
(iii) Alice does not like Chemistry and History.
(iv) If it is Saturday and warm, then Sam is in the park.
(v) Anything anyone eats and is not killed by is food.

EM
3. (a)
AD
Design a planning agent for a Blocks World problem. Assume suitable initial state and final state for the
problem. 10
AC
(b) Find the probabilistic inference by enumeration of entries in a full joint distribution table shown in figure. 10
(i) No cavity when toothache is there (ii) p (Cavity! toothache or catch)
toothache toothache

D
RE

catch catch catch catch

cavity .108 .012 .072 .008
UA

CA
cavity .016 .064 .144 .576
SQ

4. (a) Compare following informed searching algorithms based on performance measure with justification:
Complete, Optimal, Time complexity and space complexity. 10
(a) Greedy best first (b) A* (c) Recursive best-first (RBFS)
T

EA
(b) Apply alpha-Beta 10
SE

pruning on example
given in Figure
considering first node
as max.

Y
AR

EM
AD
10 5 7 11 12 8 9 8 5 12 11 12 9 8 7 10
QU

5. (a) Explain how genetic algorithm can be used to solve a problem by taking a suitable example. 10
AC

(b) Consider the graph given in Figure below. 10

E
Assume that the initial state is A and the goal B
state is G. Find a path from the initial state to
RE

the goal state using DFS. Also report which A D H

F
TS

node is being expanded at each step.

C
UA

G
SQ

6. (a) Explain the steps involved in converting the propositional logic statement into CNF with a suitable example 10
SE

(b) What are the basic building blocks of Learning Agent? Explain each of them with a neat block diagram. 10
T
SE
 B.E.SEM VII - AI 11

DECEMBER 2016
(REVISED COURSE) QP Code : 811602

Y
(3 Hours) [Total Marks : 80]

EM

Y
N.B.: (1) Question No. 1 is compulsory
(2) Attempt any three (3) out of remaining five (5)
(3) Assume suitable data if necessary and justify the assumptions

AD

EM
(4) Figures to the right indicate full marks

1. Attempt an four (4)

AC
(a) What are PEAS descriptors? Give PEAS descriptors for a robot meant for cleaning the house. 5
(b) Define heuristic function. Give an example heuristics function for 8- puzzle problem. Find the heuristics
value for a particular state of the Blocks World Problem. 5
RE

D
(c) Compare and Contrast problem solving agent and planning agent 5
(d) What are the problems/frustrations that occur in hill climbing technique? Illustrate with an example 5
(e) Represent the following statement into FOPL. 5
UA

CA
(i) Every tree in which any aquatic bird sleeps is beside some lake.
(ii) People try to assassinate rulers they are not loyal to.
SQ

2. (a) Consider the given instance of 8-puzzle. 10

1 2 3 1 2 3
T

EA
4 5 6 4 6
SE

7 8 7 5 8
Goal State Initial State
Compare and contrast uninformed search strategies with respect to solving 8-puzzle problem.
(b) Draw and describe the architecture of goal based agent. 6

Y
(c) Convert the following propositional logic statement into CNF : (A B) C 4
AR

EM
3. (a) The law says that it is a crime for an American to sell weapons to hostile nation. The country Nono, an
enemy of America, has some missiles, and all of its missiles were sold to it by Colonel West, who is
AD
an American.
(i) Represent the above sentences in first order predicate logic (FOPL). 4
QU

(ii) Convert them to clause form 4

AC

(iii) Prove that West is Criminal using resolution technique 4

(b) What are the basic building blocks of Learning Agent? Explain each of them with a neat block diagram. 8

4. (a) Apply alpha-Beta pruning on following example considering first node as MAX. 10
RE
TS

UA
SQ
SE

T
SE

4 3 5 2 1 4 2 3 5 4 7 3 2 1 4 0 5 3 0 2 7 4 3 6 5 3 1
(b) Draw general architectural diagram of Expert system. Explain every component in detail of this block with
an example. 10
 SETSQUARE ACADEMY 12

5. (a) Give the initial state, goal test, successor function and cost function for the travelling salesperson problem
(TSP). There is a map involving N cities some of which are connected by road. The aim is to find the

Y
shortest tour that starts from a city, visits all the cities exactly once and comes back to the starting city. 6

EM

Y
(b) Prove the admissibility of A* 6
(c) Explain a partial order planner with an example. 8

EM
AD
6. (a) Given a full 4-gallon jug and an empty 3- gallon jug, the goal is to fill the 4-gallon jug with exactly 2- gallons
of water. Give state space representation. 10
(b) The gauge reading at a nuclear power station shows high values if the temperature of the core goes 10
AC
very high. The gauge also shows high value if the gauge is faulty. A high reading in the gauge sets an alarm
off. The alarm can also go off if it is faulty. The probability of faulty instruments is low in a nuclear power
plant.

D
RE

(i) Draw the Bayesian Belief Network for the above situation
(ii) Associate a conditional probability table for each node
UA

CA
MAY 2017
(REVISED COURSE) QP Code : 811600
(3 Hours) [Total Marks : 80]
SQ

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

(2) Attempt any three (3) out of remaining five (5) questions
T

(3) Assume suitable data if necessary and justify the assumptions

EA
(4) Figures to the right indicate full marks
SE

1. Attempt an four (4) from the following

(a) Define AI. What are applications of AI? 5
(b) Define heuristic function. Give an example heuristics function for 8- puzzle problem. Find the heuristics 5

Y
value for a particular state of the Blocks World Problem.
AR

(c) Compare Model based Agent with Utility based Agent. 5

(d)
(e) What is supervised learning and unsupervised learning? Give example of each.
EM
What are the problems/frustrations that occur in hill climbing technique? Illustrate with an example 5
5
AD
2. (a) Consider the search problem h=8 10
QU

below with start state S and A

goal state G. The transition
AC

20
6 3
costs are next to the edges
h=6 h=4 h=1
and the heuristic values are 5
2 2 1
next to the states. What is the B D F G
RE

S
final cost using A * search. 6
h=6 4 h=0
TS

1 3 2
UA

6 E
C
h=5 h=2
SQ
SE

(b) Explain the architecture of Expert System. What are advantages and limitations of Expert System? 10
T

3. (a) Explain with example various uninformed search techniques. 10

SE

(b) Illustrate Forward chaining and backward chaining in propositional logic with example 10
 B.E.SEM VII - AI 13

4. (a) Apply alpha-Beta 10

pruning on

Y
following example

EM

Y
considering first
node as MAX

AD

EM
4 3 5 2 1 4 2 3 5 4 7 3 2 1 4 0 5 3 0 2 7 4 3 6 5 3 1
AC
(b) Explain a partial order planner with an example. 10
RE

D
5. (a) Consider the following facts about dolphins: 10
Whoever can read is literate. Dolphins are not literate. Some dolphins are intelligent.
(i) Represent the above sentences in first order predicate logic (FOPL).
UA

CA
(ii) Convert them to clause form
(iii) Prove that "Some who are Intelligent cannot read" using resolution technique
(b) What is Uncertainty? Explain Bayesian Network with example 10
SQ

6. Write short note on any two of the following: 20

T

(i) Steps in Natural Language Processing (ii) Decision Tree Algorithm with an example (iii) Genetic Algorithms
EA
SE

India's First GRE 340/340 & Highest GMAT 750/800

Y
AR

EM
FREE Group Discount s
NAM ES OF Available
AD
4 UNIVERSITIES
for score reporting
QU

Customized study plan

& SAVE 108 US $ Your Gat eway t o Int ernat ional Educat ion
AC

Small batches sizes

Faculty with specialization in test prep
Unlimited doubt solving sessions
Personal counselor for each student
RE

BANDRA: 9167991738 ANDHERI: 9167255435 GHATKOPAR: 9167993428 KANDIVALI: 9167889031

TS

UA
SQ
SE

T
SE
 SETSQUARE ACADEMY 14

ADVANCED ALGORITHMS

Y
DECEMBER 2015

EM

Y
MD-Con.10764-15 (REVISED COURSE) QP Code : 5988
(3 Hours) [Total Marks : 80]
N.B.: (1) Question no.1 is compulsory

EM
AD
(2) Attempt any 3 from the remaining questions
(3) Assume suitable data if necessary,
(4) Figures to right indicate full marks.
AC
1. (a) Explain all cases of Master method giving examples. 5
(b) Explain O, , , o, notations with examples. 5

D
RE

(c) Explain Line segment properties. 5

(d) Write a recurrence for the running time T(n) of fun(n), and solve that recurrence. Assume that addition 5
UA

can be done in constant time.

CA
fun(n)
{
SQ

if (n == 1)
return 1;
else
T

EA
return f (n-1) + f ( n 1)
SE

2. (a) Explain push-relabel algorithm. 4 12

u v
Find max flow
2 5
using the same algo.

Y
AR

s 6 5
EM
1 t
AD
4
3
x y
QU

2
AC

(b) Explain Grahams algorithm to find convex hull. 8

3. (a) Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions is 12

RE

<10,15, 5,10,20>
(b) Explain insertion in red-block tree with example. 8
TS

UA

4. (a) Find the shortest path from the node A(source) to all other nodes for the following weight matrix. 10
A B C D E
SQ

A 0 5 8 3
SE

B 0 2 6
T

C 2 4 0 1
D 2 4 0
SE

E 1 2 3 0
 B.E. SEM VII - AA 15

(b) Let A = (7,2,4,17,1,11,6,8,15,10,20) 10

(i) Draw a binomial heap whose keys are elements of A

Y
(ii) To a binomial Heap obtained this way, apply the operation remove_min Clearly show the resultant

EM

Y
heap.

5. (a) Explain with example maximum bipartite matching using ford-flukerson method 10

AD

EM
(b) Explain Cutting Rod problem. Given a table of prices pi determine the maximum revenue rn obtained by 10
cutting the rod.
Len 1 2 3 4 5 6 7 8 9 10
AC
Price 1 5 8 9 10 17 17 20 24 30

6. (a) Solve the following linear program using simplex method 12

RE

D
Maximize 18x1 + 12.5x2
Subject to x1 + x2 20
UA

x1 12

CA
x2 16
x1, x2 0
SQ

(b) Explain Closest Pair of Points using divide and conquer. 8

MAY 2016
T

EA
FW-Con.11655-16 (REVISED COURSE) QP Code : 31380
SE

(3 Hours) [Total Marks : 80]

N.B.: (1) Question no. 1 is compulsory.
(2) Attempt any 3 from the remaining questions.
(3) Assume suitable data if necessary.

Y
(4) Figures to right indicate full marks.
AR

1.
EM
(a) Explain all cases of Master method. Method. Solve following Recurrences using Master Method
(i) T (n) 4T (n/2)+ n/log n (ii) T (n) = 3T (n/3)+ n/2 (iii) T (n) = 6T (n/3) + n2 log n
(b) With a suitable example, explain the significance of the order of growth in analyzing the algorithm
5

5
AD
efficiency.
(c) If f(n) denotes the number of moves in tower of Hanoi puzzle when n disks are involved, give a 5
QU

recurrence relation for f(n) and solved this recurrence relation.

AC

(d) Explain bipartite matching. 5

2. (a) Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions 12

RE

is <5,10,3,12,5,50,6>
TS

(b) Explain Graham's algorithm to find convex hull. 8

UA

3. (a) What is red-black tree? Show the red-black tree that results from the successive insertion of the 10
following keys 41,38,31,12,19,8 and the successive deletion of the following keys 8,12,19,31
3
SQ

(b) Find maximum flow following A D 10

SE

flow network. 9 9
8 2 3
T

7 6 5
SE

S B E T
4
5 7 4 8

C F
2
 SETSQUARE ACADEMY 16

4. (a) Explain Cutting Rod problem. Given a table of prices pi determine the maximum revenue rn obtainable 10
by cutting the rod.

Y
Len 1 2 3 4 5 6 7 8 9 10

EM

Y
Price 3 4 6 9 16 20 22 24 26 30

EM
AD
(b) What is binomial heap? Explain it's properties. Explain the operations that can be carried out on 10
binomial heap with example.
AC
5. (a) Use Simplex method to maximize following objective function 12
z = 2x1 x2 + 2x3
Subject to the constraints

D
RE

2x1 + x2 10
2x1 + 2x2 2x3 20
x2 + 2x3 5
UA

CA
where x1 0, x2 0, and x3 0
(b) Explain Closest Pair of Points using divide and conquer. 8
SQ

6. (a) Find all pair shortest path using Johnson's algorithm for the 2 12
following graph 3
T

EA
1 3
SE

2 6

4 5
1
5 4
6

Y
(b) Explain Graham's algorithm to find convex hull. 8
AR

DECEMBER 2016
(REVISED COURSE)
EM
QP Code : 811702
AD
(3 Hours) [Total Marks : 80]
N.B.: (1) Question no.1 is compulsory.
QU

(2) Attempt any 3 from the remaining questions.

AC

(3) Assume suitable data if necessary.

(4) Figures to right indicate full marks.
RE

1. (a) Explain different Asymptotic notations and all cases of Master method. Solve following Recurrences 10
using Master Method.
TS

(i) T(n) = 2T(n/2) + n3 (ii) T(n) = 3T(n/4)+ nlog2n (iii) T(n) = 2T(n/2)+n/log n
UA

(iv) T(n) = 16T(n/4) + n! (v) T(n) = 0.5T(n/2) + 1/n

(b) Explain Johnson's all pair shortest path algorithm with example. 10
SQ

2. (a) What is binomial heap? Explain it's properties. Explain the operations that can be carried out on binomial 12
SE

heap with example

T
SE
 B.E. SEM VII - AA 17

(b) Explain Graham's algorithm to find convex hull. 8

3. (a) What is red-black tree? Show the red-black tree that results from the successive insertion of the 10

Y
following keys 9,8,7,3,5,2 and the successive deletion of the following keys 2,5,3,7,8,9

EM

Y
(b) Find the maximum flow using 10
Ford Flukerson Algorithm. 2

5
AD

EM
2
AC
0 4
source sink

7
2
RE

D
3
5
3
UA

4.
CA
(a) Explain Cutting Rod problem. Given a table of prices pi determine the maximum revenue rn obtainable 8
SQ

by cutting the rod.

Len 1 2 3 4 5 6 7 8
T

EA
Price 1 5 8 9 10 17 17 20
SE

(b) Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions 12

is < 30,35,15,5,10,20,25 >

5. (a) Solve the following linear program using simplex method 12

Y
Maximize 5x1 + 3x2
AR

EM
Subject to the condition
X1 +X2 2
5X1 + 2X2 10
AD
3X1 + 8X2 12
X1 , X2 0
QU

(b) Explain Closest Pair of Points using divide and conquer. 8

AC

6. (a) Explain maximum bipartite matching with an example 10

(b) Explain insertion and deletion in B- tree with an example. 10
RE

MAY 2017
TS

(REVISED COURSE) QP Code : 811700

UA

(3 Hours) [Total Marks : 80]

N.B. : (1) Question no.1 is compulsory.
(2) Attempt any 3 from the remaining questions.
SQ

(3) Assume suitable data if necessary.

SE

(4) Figures to right indicate full marks.

T

1. (a) Explain various asymptotic notations used to represent the rate of growth of running time of algorithms. 5
SE

(b) Solve following Recurrences using Master Method. 5

3
(i) T(n) = 2T(n/2) + n (ii)T(n) = 3T(n/4) + n log2n
(iii) T(n) = 2T(n/2) + n/logn (iv)T(n) = 16T(n/4) + n
(v) T(n) = 0.5T(n/2) + 1/n
 SETSQUARE ACADEMY 18

(c) What is Binary Heap, Binomial tree, Binomial Heap? List properties of Binomial Heap. 5
(d) Compare Dynamic Programming and Divide and Conquer. Suggest the solution using both approaches 5

Y
for generating Fibonacci series.

EM

Y
2. (a) Explain Johnson's algorithm to find all pair shortest path with an example 10
(b) Explain maximum bipartite matching with an example. 10

EM
3.
AD
(a) Explain Cutting Rod problem. Given a table of prices pi determine the maximum revenue rn obtainable 8
by cutting the rod.
AC
Length 0 1 2 3 4 5
Price 0 3 5 10 12 14

D
RE

(b) Explain red black tree. Show the red-black tree that results after each of the integer keys 21, 32, 64,75, 12
and 15 are inserted, in that order, into an initially empty red-black tree. Delete keys 75 and 32 from the
created tree. Clearly show the tree that results after each insertion and deletion (indicating the color of each
UA

CA
node), and make clear any rotations that must be performed.

4. (a) Find a minimum cut in the 10

SQ

following flow network. 2

5
T

EA
SE

0 4
source sink

7
2

Y
AR
3

3
5
EM 1
AD
(b) Find max flow using push-reliable algorithm. 2 10
2 5
QU

3 2
AC

1
3 2
s 4 t
5
RE

2
3
TS

UA

5. (a) Find an optimal parenthesization of a matrix-chain product whose sequence of dimensions 12

is <30,35,15,5,10,20,25>
(b) Explain Graham's algorithm to find convex hull. 8
SQ
SE

6. (a) Use Simplex method to maximize following objective function 12

T

Z = 2X1 X2 + 2X subject to the constraints

2X1 +X2 10
SE

X1 + 2X2 2X3 20
X2 + 2X3 5
where X1 ,X2 , X30
(b) Explain Closest Pair of Points using divide and conquer. 8
 B.E. SEM VII - IP 19

IMAGE PROCESSING

Y
DECEMBER 2015

EM

Y
MD-Con.10765-15 (REVISED COURSE) QP Code : 5994
(3 Hours) [Total Marks : 80]
N.B.: (1) Question No.1 is compulsory

AD

EM
(2) Attempt any Three questions out of remaining.
(3) Assume suitable data wherever necessary and state them clearly.
AC
1. Answer the following :- 20
(a) What do you understand by zero memory operation.
(b) Discuss different discontinuties in image.
RE

AD
(c) What is an Unitary matrix
(d) Define Morphological operations Erosion and Dilation
UA

2. (a) Discuss color models for a digital image. 10

(b) For the given 3 bits per pixel, 4 4 size image perform following operations 10
SQ

(i) Intensity level slicing with background, r1 = 3 and r2 = 5

(ii) Bit plane slicing
AC
6 2 3 2
T
SE

1 5 0 7
4 3 2 1
2 5 7 6
RE

Y
3. (a) Explain The first difference makes the chain code invariant to rotation 10

EM
(b) Explain Homomorphic filtering with the help of block diagram 10
UA

4. (a) Write 8 8 Hadamard transform matrix and its signal flow graph, for fast Hadamard transform 10
AD
Using this butterfly diagram. (Signal flow graph) compute Hadamard transform for
x(n)) = {1,2,1,1,3,2,1,2}
(b) Find the DCT of the given Image using matrix multiplication method. 10
AC

2 4 4 2
Q

4 6 8 3
f (x, y)
RE

2 8 10 4

TS

3 8 6 2
UA

5. (a) Discuss the different types of redundancies in images with examples. 10

(b) Construct Improved Gray Scale (IGS) quantization code for given gray scale data, 10
SQ

{100, 110, 124,130,200,210}. Also Compute erms (root mean square error).
SE

6. Write detail note on (any Two) 20

T

(a) Edge Linking using Hough transform (b) Thinning with example.
SE

(c) Differential Pulse Code Modulation (DPCM)

(d) Segmentation techniques: Region growing and split and merge.
 SETSQUARE ACADEMY 20

MAY 2016
(REVISED COURSE) QP Code : 31386

Y
(3 Hours) [Total Marks : 80]

EM

Y
N.B.: (1) Question No.1 is compulsory.
(2) Attempt any Three questions out of remaining Five questions.
(3) Figures to the right indicate full marks.

EM
AD
(4) Assume any suitable data wherever required but justify the same.

1. (a) What is Unitary transform matrix? Explain with example. 5

AC
(b) Explain in short sampling and quantization method for digital image. 5
(c) Explain in short morphological operations Dilation and Erosion 5
(d) Justify /contradict: All Image compression techniques are invertible. 5

D
RE

2. (a) Explain in detail any two types of Image File Formats. 8

(b) For the 3 bit 4 4 size image perform following operations. 12
UA

CA
(i) Thresholding T = 3 (ii) Intensity level slicing with background, r1 = 3 and r2 = 5
(iii) Bit plane slicing for MSB and LSB planes
SQ

3 3 1 2
1 4 0 7
3 4 2 6
T

EA
2 4 6 4
SE

3. (a) Perform histogram equalisation and draw new equalized histogram of the following image data 10
Gray Level 0 1 2 3 4 5 6 7
No.of pixe 400 700 1350 2400 3000 1500 650 0

Y
AR

(b) Find Huffman code for the symbols given below. Which kind of redundancy is removed by Huffman 10

EM
code? Explain the term Compression Ratio.
Symbol Probability
AD
a1 0.1
a2 0.3
QU

AC

a3 0.2
a4 0.25
a5 0.07
RE

a6 0.08
TS

UA

4. (a) Using matrix multiplication method calculate 2-D DFT of 10

1 0 3 1
SQ

1 1 2 2
SE

f (x, y)
2 0 1 3
T

1 2 2 4
SE

(b) Using the Butterfly diagram, compute Hadamard transform for x(n)= {1,2,3,4,1,2,1,2} 10
 B.E. SEM VII - IP 21

5. (a) What are the different types of redundancies in digital image? Explain in detail giving example of each. 10
(b) What is image segmentation? Explain the following methods of image segmentation. 10

Y
(i) Region growing (ii) Split and Merge

EM

Y
6. Write detail notes on (any two) 20
(i) Hough Transform (ii) Homomorphic filter (iii) Hit or Miss Transform (iv) Chain code.

AD

EM
DECEMBER 2016
(REVISED COURSE) QP Code : 811902
AC
(3 Hours) [Total Marks : 80]
N.B.: (1) Question No. 1 is Compulsory.
(2) Attempt any THREE questions out of remaining questions.
RE

AD
(3) Assume any suitable data if required with justification.

1. (a) Explain any five zero memory operations. 10

UA

(b) Perform histogram equalization and draw new equalized histogram of the following image data. 10
Gray level 0 1 2 3 4 5 6 7
SQ

Number of pixels 800 1000 850

AC
650 300 250 100 150
T

2. (a) Find the DFT of the given image: 0 3 3 1 10

SE

3 1 2 1
3 2 4 2
1 1 2 1
RE

(b) What is segmentation? Explain (i) Region Growing (ii) Region Splitting (Hi) Thresholding. 10

Y
EM
3. (a) Explain with an example that the first difference of a chain code normalizes it to rotation. 10
(b) Explain the following morphological operations: 10
UA

(i) Opening (ii) Closing

AD
4. (a) Classify Image Compression methods in detail along with the different redundancies that can be present 10
in digital images.
AC

(b) What are various file formats? Explain each in brief. 10

Q

5. (a) Given 10
RE

F= 10 44 15
10 14 48
TS

11 10 22
UA

(i) Find 3-bit IGS coded image and calculate compression factor and BPP.
(ii) Find the decode image and calculate MSE and PSNR.
SQ

(b) Write 8 8 HADAMARD transform matrix and its signal flow graph. Using Butterfly diagram, 10
SE

compute HADAMARD transform for x(n) = {1,2,1,2,1,2,3,4}

T

6. Write short notes 20

SE

(a) Discrete Cosine Transform. (b) Hough transform. (c) HSI color model. (d) 4, 8 and m-connectivity
 SETSQUARE ACADEMY 22

MAY 2017
(REVISED COURSE) QP Code : 811901

Y
(3 Hours) [Total Marks : 80]

EM

Y
N.B.: (1) Question No. 1 is Compulsory.
(2) Attempt any THREE questions out of remaining questions.
(3) Assume any suitable data if required with justification.

EM
AD
1. Answer the followings: 20
(a) Explain any one color model.
AC
(b) Discuss unitary matrix with example.
(c) Explain lowpass spatial filtering.
(d) Explain basic morphological operations.

D
RE

2. (a) Explain any five zero memory point operations. 10

(b) Perform histogram equalization and draw new equalized histogram of the following image data. 10
UA

CA
Gray level 0 1 2 3 4 5 6 7
Number of pixels 550 900 650 150 300 200 110 90
SQ

3. (a) Find the DCT of the given image using matrix multiplication method: 10
T

EA
0 3 3 1
SE

3 1 2 1
3 2 4 2
1 1 2 1

Y
(b) What is segmentation? Explain (i) Region Growing (ii) Region Splitting (iii) Thresholding. 10
AR

4. (a) Explain : The first difference makes the chain code invariant to rotation.
EM
(b) Write 8 8 HADAMARD transform matrix and its signal flow graph. Using Butterfly diagram,
10
10
AD
compute HADAMARD transform for x(n) = {1,2,1,2,1,2,3,4}
QU

5. (a) Classify Image Compression methods in detail along with the different redundancies that can be present 10
AC

in digital images.
(b) Given 10
10 44 16
RE

F= 10 14 48
11 10 22
TS

UA

Find 3-bit IGS coded image and calculate compression factor, BPP and MSE.

6. Write notes on (Any two) 20

SQ

(a) Moments with examples (b) Edge linking using Hough transform (c) Fidelity criteria.
SE

(d) Homomorphic filter

T
SE
 B.E. SEM VII - SC 23

SOFT COMPUTING

Y
DECEMBER 2015

EM

Y
MD-Con.10767-16 (REVISED COURSE) QP Code : 6000
(3 Hours) [Total Marks : 80]
N.B.: (1) Question No.1. is compulsory

AD

EM
(2) Attempt any three questions out of remaining 5 questions
(3) Draw neat labeled diagram wherever necessary.
AC
1. Solve any four : 20
(a) Define soft computing? Distinguish between soft computing and hard computing.
(b) Determine (alfa) - level sets and strong -level sets for the following fuzzy set.
RE

D
A = {(1,0.2), (2,0.5), (3,0,8), (4,1), (5,0.7),(6,0.3);
(c) Prove that the first order derivative of a unipolar continuous activation function f(net) = 0(1 0)
UA

(d) Draw the five layer architecture of ANFIS and explain each layer in brief.

CA
(e) What are the differences between derivative free and derivative based optimization.
(f) Distinguish between Supervised and Un-supervised learning
SQ

2. Design a fuzzy controller for a train approaching station. Inputs are speed and Distance and output is 20
Break power. Use triangular membership function. Consider two descriptor for Input and three descriptors
T

EA
for output, Derive a set of rules for control action and defuzzification. The design should be supported by
SE

figures wherever possible. Design a fuzzy controller for a train with high speed and small distance.

3. (a) Apply Backpropogation Algorithm Vo1

10
to find the final weights for the 0.1 Wo1
following net. Inputs: x ={0.0,1.0},

Y
0.0 0.4
AR

Weights between Hidden and x1 2 z1

EM
0.4
Output Layers: w = {0.4 ,0.2},
1
Bias on the Output Node O is 1 Y
0.2
Wo = {0,4}, Weights between
AD
input and Hidden Layer: x2 z2
1.0 2
v = {2,1 ;1,2}, Bias on Hidden
QU

Unit nodes are Vo = {0.1 0.3}, 0.3

AC

Desired output : d = 1.0 Vo2

(b) What is self-organizing map? Draw and explain architecture of Kohonen Self organization Feature 10
Map KSOFM.
RE

4. (a) What are the different types of encoding, selection, crossover, mutations of GA. Explain each type 10
TS

with suitable examples

UA

(b) Explain with suitable examples Linearly and Non-linearly separable pattern classification 10

5. (a) Explain Learning Vector Quantization Algorithm? 10

SQ
SE

(b) The formation of algal solutions in surface water is strongly dependent on pH of water, temperature and 10
oxygen content. T is a set of water temperatures from a lake given by
T

T= (50, 55, 60) and 0 is oxygen content values in water given by 0 = (1, 2, 6) The fuzzy set of T is given by
SE

{0.7/50+0.8/55+0.9/60} and fuzzy set of 0 is given by {0.1/1+0.6/2+0.8/6)

(i) Find R = T O for Given I ={0.5/50 + 1/55+ 0.7/60}
(ii) Find S = 10 R using max-product composition
(iii) Find S = I o R using max-min composition
 SETSQUARE ACADEMY 24

6. Write short notes on any two: 20

(a) Steepest Descent algorithm (b) Newton Method (c) Fuzzy inference system

Y
EM

Y
MAY 2016
FW-Con.11659-16 (REVISED COURSE) QP Code : 31392
(3 Hours) [Total Marks : 80]

EM
AD
N.B.: (1) Question no.1 is compulsory.
(2) Solve any THREE out of FIVE remaining questions.
AC
1. (a) Define soft computing? Distinguish between soft computing and hard computing. 5
(b) Explain Mc Culloch Pitts neuron model with the help of an example. 5
(c) Determine (alfa) -level sets and strong -level sets for the following fuzzy set. 5

D
RE

A= {(1,0.2), (2,0.5), (3,0.8), (4,1), (5,0.7), (6,0.3)}

(d) Explain linear separable and non-linearly separable pattern with example. 5
UA

CA
2. (a) What is learning in neural networks? Differentiate between supervised and unsupervised learning. 10
(b) Explain any four defuzzification methods with suitable example. 10
SQ

3. (a) Explain error back propagation training algorithm with the help of a flowchart. 10
(b) Explain genetic algorithm with the help of an example. 10
T

EA
SE

4. (a) Prove the following identities: 10

(i) For unipolar continuous activation function f '(net)= o(1-o).
(ii) For bipolar continuous activation function f '(net)= o(1-o2) /2.
(b) Explain perceptron learning with the help of an example. 10

Y
5. (a) Explain ANFIS architecture with neat diagram. 10
AR

EM
(b) Explain Mamdani type of fuzzy inference systems in detail. 10

6. Write note on any two of the following. 20

AD
(a) Winner take all learning rule. (b) Learning vector quantization.
(c) Character recognition using neural network.
QU

AC

DECEMBER 2016
(REVISED COURSE) QP Code :790702
(3 Hours) [Total Marks : 80]
RE

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

(2) Solve any three out of five remaining questions.
TS

UA

1. (a) Define Support, Core, Crossover points, Normality and Convex Fuzzy sets. 5
(b) What are the types of neural processing? 5
(c) State differences between derivative based and derivative free optimization techniques? 5
SQ

(d) What are the features of hybrid system? Why is it required? 5

SE

2. Design a fuzzy controller for a train approaching or leaving a station. The inputs are the distance from 20
the station and speed of the train. The output is the amount of brake power used. Use four descriptors
SE

each for inputs and output and design using mamdani fuzzy model. Derive set of rules for control action
and defuzzification. The design should be supported by figures. Prove that if the train is at a short distance
with great speed the brake power required would be very high and vice versa.
 B.E. SEM VII - SC 25

3. (a) Four steps of Hebbian learning of a single neuron network is implemented starting with w1 = [1 1] at 10
the rate = 1, using the inputs given below :

Y
X1 = [ 1,2 ] X2 = [0,1] X1 = [2,3] X1 = [1, 1]

EM

Y
Find final weights for binary continuous activation function,
(b) Explain Error Back Propagation training algorithm with flow chart. 10

AD

EM
4. (a) How is LVQ working as a classifier? With a neat flow explain the working of LVQ ? 10
(b) What are the steps in Genetic Algorithm? Explain examples the uniform crossover, tournament selection 10
and mutation.
AC
5. (a) What are the types of Fuzzy Inference Systems? Explain each with appropriate diagrams, 10
(b) Explain ANFIS architecture with a neat diagram. 10
RE

D
6. Write short notes on any four : 20
(a) Fuzzy extension principle (b) Flowchart of Single Discrete Perceptron Algorithm (SDPTA)
UA

CA
(c) Kohonen Learning Algorithm (d) Newton's Method in derivative based optimization
(e) CANFIS
SQ

MAY 2017
(REVISED COURSE) QP Code : 790700
T

(3 Hours) [Total Marks : 80]

EA
SE

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

(2) Solve any three out of five remaining

1. (a) Explain hard limit and soft limit activation function 5

(b) Explain Mc Culloch Pitts neuron model with the help of an example. 5

Y
(c) Explain fuzzy extension principle with the help of an example. 5
AR

EM
(d) Explain linear separable and non-linearly separable pattern with example. 5

2. (a) What is learning in neural networks? Differentiate between supervised and unsupervised learning 10
AD
(b) What are the different types of encoding, selection, crossover, mutations of GA. Explain each type with 10
suitable examples.
QU

AC

3. (a) Explain error back propagation training algorithm with the help of a flowchart. 10
(b) Explain any four defuzzification methods with suitable example. 10
RE

4. Design a fuzzy controller to determine the wash time of domestic washing machine. Assume that input is 20
dirt and grease on clothes. Use three descriptors for input variables and five descriptors for out variables.
TS

Derive set of rules for control the action and defuzzification. The design should be supported by figures. Show
UA

if the clothes are soiled to larger degree the wash time will be more and vice versa.

5. (a) Prove the following identities : 10

SQ

(i) For unipolar continuous activation f (net) = 0(1 0).

SE

(ii) For bipolar continuous activation function f (net) = 0(1 02)/2

(b) Explain learning vector quantization Algorithm. 10
T
SE

6. Write short note on any two : 20

(a) Kohonen self organizing feature maps. (b) ANFIS architecture (c) Newton Method
 SETSQUARE ACADEMY 26

ERP AND SUPPLY CHAIN MANAGEMENT

Y
DECEMBER 2015

EM

Y
MD-Con.10768-15 (REVISED COURSE) QP Code : 6003
(3 Hours) [Total Marks : 80]
N.B.: (1) Question No. 1 is compulsory.

EM
AD
(2) Solve any three questions from the remaining
(3) Assume suitable data wherever necessary.
AC
1. (a) Explain ERP in detail 5
(b) How is the risk versus gain represented in an ERP system 5
(c) Explain the major drivers of supply chain . 5

D
RE

(d) Explain the different IT solutions that can be provided in SCM 5

UA

2. (a) Explain the various technologies utilized for developing an ERP module. 10

CA
(b) Draw and explain the implementation life cycle of an ERP system. 10
SQ

3. (a) What is meant by EDI? Draw and explain EDI architecture and mention its advantages 10
(b) Explain Bill of Material and formula management in a manufacturing module of ERP 10
T

EA
4. (a) Explain the different types of supply chain, its characteristics and the consequences of supply chain 10
SE

integration
(b) Differentiate between a web portal and a website. Draw and explain the KDD process along with the 10
various data warehousing schemes.

5. (a) Explain the various mathematical models used in supply chain 10

Y
AR

(b) You are a part of event management company and are given the responsibility of developing an online 10

EM
system for organizing an event. Design the steps that you would undertake to develop the same and justify the
modules of ERP that you would include
AD
6. Write short notes on ( any two):- 20
(a) Enterprise Application Integration (EAI)
QU

(b) Agile supply chain

AC

(c) Newspaper supply chain

MAY 2016
RE

FW-Con.11660-16 (REVISED COURSE) QP Code : 31395

(3 Hours) [Total Marks : 80]
TS

N.B.: (1) Question 1(one) is compulsory.

UA

(2) Figures to the right indicate full marks

SQ

1. Solve any 4 20
SE

(a) List various benefits of ERP system.

(b) How ERP and E-commerce related.
T

(c) Explain generic type of SCM.

SE

(d) Explain Electronic Data Interchange (EDI)

(e) What is operational mathematical model of SCM?
(f) What is Business Intelligence (BI)
 B.E. SEM VII - ERP 27

2. Attempt any two

(a) Discuss the importance of post implementation phase of ERP implementation. 10

Y
(b) How is BPR connected with ERP explain 10

EM

Y
(c) What is pre-evaluation screening ? Why it is required 10

3. Attempt any two

AD

EM
(a) List and explain various ERP technologies, also state where it is used 10
(b) Explain the sales distribution business module of ERP with suitable example. 10
(c) Discuss the reason of growth in the due to ERP business modules. 10
AC
4. Attempt any two
(a) Explain SCOR model 10
RE

D
(b) Explain E-Procurement model with example. 10
(c) Explain various types of IT solution used in scm with example 10
UA

CA
5. (a) Explain vehicle routing with suitable online current example such as OLA cabs etc by focusing on its 10
scenario.
(b) Explain make versus buy model with example. 10
SQ

(c) Explain business strategy and its types such as SRM and CRM. 10
T

6. Attempt any two

EA
(a) Explain the strategy used by these Mumbai dabbawalas, and also what can larger organizations with 10
SE

many more resources learn from this simplistic system?

(b) A family owned chemical manufacturer needed to replace old information inadequate system and solve 10
some important business problems. The company was growing and management needed to understand
customer profitability. A number of years ago the company implemented a tier III accounting and manufacturing

Y
This existing system had become inadequate was heavily modified and the consulting firm that had made the
AR

modifications was out of business. There was no viable path to improve the existing system. The family owned

EM
business was growing and looking at acquisitions. At the same time management believed they had a critical
problem: some customers were unprofitable, but the information available provided no insight into the problem.
Now consider yourself as the company manager and advise the suitable solution for the same.
AD
(c) Explain the revenue model used by Flipkart system and the chain strategy used by them to deliver the 10
QU

product on time?
AC

DECEMBER 2016
(REVISED COURSE) QP Code : 793102
RE

(3 Hours) [Total Marks : 80]

N.B.: (1) Question 1 (one) is compulsory.
TS

(2) Attempt any three questions out of remaining.

UA

(3) Figures to the right indicate full marks.

1. (a) Explain the structure of ERR 5

SQ

(b) Explain the various business modules of an ERP system. 5

SE

(c) Explain the various types of supply chain. 5

T

(d) Differentiate between data warehouse and data mart with an example. 5
SE

2. (a) Explain business process engineering in detail. 10

(b) Explain do you mean by bill of material with an example. 10
 SETSQUARE ACADEMY 28

3. (a) Explain CRM in detail. 10

(b) What are benefits of ERP? Discuss how ERP helps in better decision making? 10

Y
EM

Y
4. (a) Explain Electronic Data Interchange along with its benefits. 10
(b) Explain e-procurement mechanism in details. 10

EM
AD
5. (a) Specify the characteristics of Agile Supply chain and explain how agility in supply chain can be achieved.10
(b) Explain SCOR model in detail. 10
AC
6. Write a short note on any two of the following :- 20
(a) News paper supply chain
(b) Considerations in modeling system with example ( if any)

D
RE

(c) Enterprise application Integration (EAI)

(d) ERP business module (any one)
UA

CA
MAY 2017
(REVISED COURSE) QP Code : 793101
(3 Hours) [Total Marks : 80]
SQ

N.B.: (1) Question 1 (one) is compulsory.

(2) Attempt any three questions out of remaining
T

(3) Figures to the right indicate full marks.

EA
SE

1. (a) Explain Electronic Data Interchange and bring out its benefits. 5
(b) How will you achieve agility in SCM? 5
(c) How can we improve the power of ERP using business intelligence? 5
(d) Explain how BPR adds value to an organization? 5

Y
AR

EM
2. (a) Describe configure-to-order concept. 10
(b) What do you mean by bill of material? Explain with an example. 10
AD
3. (a) Explain distribution requirement planning. 10
(b) What is data warehousing? Explain how data warehousing and data mining are an integrated part of a 10
QU

successful ERP package?

AC

4. (a) Explain material management system (in brief). 10

(b) What are the uses of ERP? Discuss how ERP helps in better decision-making? 10
RE

5. (a) What is the impact of internet and www on the ERP products? 10
TS

(b) What is customer retention? Explain briefly why it is necessary. How to evaluate a retention analysis? 10
UA
SQ
SE

T
SE
 B.E. SEM VII - ERP 29

6. CASE STUDY : Select Comfort finds Comfort in ERP

Select comfort is the bed that invented the "sleep number" system, which provides a range of mattress firmness

Y
setting to accommodate sleeping preferences. Founded in 1987, the Minneapolis, Minnesota-based company

EM

Y
delivered net sales of $691 million in 2005. The company has 32U.S.-issued or pending patents and was
ranked by Furniture/Today as the top bedding retailer in the nation for the sixth consecutive year. Needless to
say, a company of this size depends on enterprise-wide software systems to provide access to valuable

AD

EM
information throughout the organization. A few years ago, Select Comfort began moving away from its hard-
to-maintain legacy systems to integrated enterprise resource planning (ERP) software. The e-Business Suite
from Oracle provides ERP services through a convenient Web-based interface. The suite helps Select Comfort
AC
coordinate its sophisticated made-to-order manufacturing operations in South Carolina and Utah, and keep
mattress orders flowing smoothly from the store to the factory to the consumer's home. Select Comfort
adopted several e-Business Suite modules to assist in varying parts of its business: an order management
RE

D
module to fulfill the hundreds of mattress orders it receives daily, a customer relationship management (CRM)
module for keeping track of customer interaction and modules that handle typical business needs such as
assets management, general ledger, payables, purchasing and receivables. The ERP system ensures that all
UA

CA
these modules and services are synchronized and centralized so they can provide up-to-date information.
Seeking to make use of the latest technologies, Select Comfort adopted business intelligence (BI) software
from Siebel Systems, Inc. BI software allows a business to combine its databases and extract useful
SQ

information to apply to business strategies. The BI software from Siebel caught the interest of Select Comfort
because of its power and ease of use. Select Comfort plans to deploy Siebel Business Analytics to 2,500
T

users company-wide by 2008. The software will deliver alerts and dashboard capabilities to show how
EA
the company's 400 stores are performing in real time. Select comfort had concerns about using enterprise-
SE

wide software from two vendors, Oracle and Siebel. When companies adopt new software, the software, the
software must be able to integrate with existing systems. Select Comfort resigned itself to the fact that it would
have to work with Siebel on integration issues. Shortly after Select Comfort purchased the Siebel software,
Oracle announced that it was purchasing Siebel. The partnership means that the Siebel BI software will

Y
eventually be integrated with oracle's database and ERP software. David Dobrin, an analyst at B2B Analysts,
AR

Inc., in Cambridge, Massachusetts, said Select Comfort will likely have to wait for a strong link between the

systems," he said.
Questions
EM
products. Integration "will take years and years, and probably Oracle will have to do a major revision to data
AD
(a) What benefits does Select Comfort's ERP system provide that individual software solutions from a 10
variety of vendors could not?
QU

(b) What risk did Select Comfort assume when it chose software from a different vendor? 10
AC
RE
TS

UA
SQ
SE

T
SE
Dear Students,

Hope you are finding these semesterwise question paper sets very useful for your examination.
We have tried our level best to avoid and rectify the typing mistakes and any other errors. But still there are
chances of some minor errors on account of errors or corrections in original university question papers itself.
So if you come across errors like spelling mistakes or insufficient/missing/wrong data then we kindly
request you to convey such errors to us by e mail or whatsapp. This will help us to make these question
paper sets error-free which will be helpful for your juniors.
Also we have managed to get almost all questions papers except few which are mostly elective subjects for
final year. We are providing the list of those missing question papers in the table given below. The question
papers highlighted in yellow colour are missing.

Computer Engineering Missing Question Papers

Sr. No. Se me ster Subject May-15 De c-15 May-16 De c-16 May-17
1 VI Ele ctive-I
i VI Operation Research
ii VI Project Management
iii VI Foreigh Language German
iv VI Foreigh Language French
2 VII Ele ctive-I
i VII Computer Simulation and Modeling
ii VII Software Architecture
3 VIII Ele ctive-II
i VIII Embedded Systems
ii VIII Adhoc wireless networks

So if you have or can get these missing question papers from resources like your college library or text
books then we kindly request you to provide us the soft copy (JPEG/PDF) of the same by email or
whatsapp. We will be more grateful if you can also provide us your current semester December 2017
question papers after your examination. This will help us to update and share the question paper sets well in
advance before your next semester examination.
Also we request you to download these question papers sets from our website links or from whatsapp
message links and not to download or circulate the direct PDF file received from someone else because we
are constantly updating these PDFs correcting the possible errors so you may end up downloading or
circulating old PDF version which may contain errors.
Any other suggestions for improvement are most welcome.
Thanking you! Best of luck for your Examination!
Regards,
Managing Director, Setsquare Academy Private Limited.

Address : 2nd Floor, Govind Smruti, Near Jagdish Book Depot, Lohar Ali, Thane (West), 400602.
Website : www.setsquareacademy.com, Contact : 9920848746, E mail : [email protected].