Showing posts with label B.E. (CS). Show all posts
Showing posts with label B.E. (CS). Show all posts

Wednesday, July 30, 2014

COMPUTER COMMUNICATION NETWORKS (CCN), B.E. Electronics & Telecommunication, Semester 7, May 2008.

COMPUTER COMMUNICATION NETWORKS (CCN),

B.E. Electronics & Telecommunication,

Semester 7, May 2008.
Con. 2976-08
CO- 4225
(REVISED COURSE)
(3 Hours)
[Total Mark: 100]
N.B. (1) Question No 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.

1. (a) Compare OSI model and TCP/IP model. ----- (5 Marks)

(b) Explain HDLC data link control. ----- (5 Marks)

(c) What is the difference between Network layer delivery and transport layer delivery? ---- (5 Marks)

(d) Explain packet switching in brief. ---- (5 Marks)

2. (a) Explain performance issues in ARQ.--- (10 Marks)

(b) Draw the layered OSI Network architecture. Explain the functions of each layer and show the path of actual and vertual communication between the layers. ---- (10 Marks)

3. (a) Explain the SONET multiplexing and SONET frame structure. ---- (10 Marks)

(b) What is the mechanism of sliding window flow control? ----- (10 Marks)

4. (a) Differentiate UDP and TCP. ---- (10 Marks)

(b) Show that the maximum through put of pure ALOHA is 1/2e. ---- (10 Marks)

5. (a) Explain the various transmission media in detail. ---- (10 Marks)

(b) Explain the spanning tree algorithm with reference to frame forwarding, address learning and loop resolution. ---- (10 Marks)

6. (a) Explain Dijkstra's shortest path algorithm using graph. --- (10 Marks)

(b) With the help of block diagram explain ATM protocol architecture. ----- (10 Marks)

7. Write short notes on:- ----- (20 Marks)

(a) IPv4 and IPv6

(b) Hubs, Bridges and Switches

(c) FDDI

(d) ATM traffic management.

Monday, July 28, 2014

COMPUTER COMMUNICATION NETWORKS (CCN), B.E. Electronics & Telecommunication, Semester 7, May 2012.

COMPUTER COMMUNICATION NETWORKS (CCN),

B.E. Electronics & Telecommunication,

Semester 7, May 2012.
Con. 4504-12
GN- 8501
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of remaining six questions.

(3) Marks are indicated by figures on right.

1. (a) Discuss the various network topologies along with the advantages and disadvantages of each. ---- (8 Marks)

(b) Explain the ISO- OSI network model and discus the functions of each layer. ---- (12 Marks)

2. (a) Explain the Go – back – n and selective reject techniques of sliding window ARQ. ---- (10 Marks)

(b) List the various networking and internetworking devices and explain their working in detail. ---- (10 Marks)

3. (a) Discuss the various configurations, modes and frame types of HDLC in detail. ----(10 Marks)

(b) Compare circuit switching, packet switching and message switching. --- (10 Marks)

4. (a) Explain distance vector routing in detail. --- (10 Marks)

(b) Draw an IP datagram header and explain the function of every field. ---- (10 Marks)

5. (a) What IP fragmentation? Why is it needed? Explain with an example. ----(10 Marks)

(b) Compare TCP and UDP.---- (10 Marks)

6. (a) Explain the M/M/I model of queuing theory. --- (10 Marks)

(b) Explain the ARP and RARP protocols in detail. ---- (10 Marks)

7. Write short notes on any two: --- (20 Marks)

(a) IEEE standards

(b) Dijkstra’s algorithm

(c) Classful addressing

COMPUTER COMMUNICATION NETWORKS (CCN), B.E. Electronics & Telecommunication, Semester 7, December 2011.

COMPUTER COMMUNICATION NETWORKS (CCN),

B.E. Electronics & Telecommunication,

Semester 7, December 2011.
Con. 6644-11
MP- 5680
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of remaining six questions.

(3) Figure to the right indicates full marks.

1. (a) Why does UDP exist? Would it not have been enough to just let user processes send raw IP packets? ---- (5 Marks)

(b) It was shown that flooding can be used to determine the minimum hop route. Can it be used to determine the minimum delay route? ----- (5 Marks)

(c) What do we mean we say that a bridge can filter traffic? Why is filtering Important? ---- (5 Marks)

(D) Why does the internet use a connection less network service? --- (5 Marks)

2. (a) What is ALOHA? Derive the expression for the slotted and pure ALOHA. ---- (10 Marks)

(b) What is collision and collision domain? How collision and collision domain can be reduced?
How collision can be detected? Explain CSMA/CD. ---- (10 Marks)

3. (a) What is ARQ? What are types of ARQs? Explain Go Back N ARQ In detail. ---- (10 Marks)

(b) What is HDLC? What are HDLC fame types and mode of operation? Explain in detail one mode. ---- (10 Marks)

4. (a) Write Dljkstra's Algorithm. Find shortest path (Fig 4A) to destination node 6. Will Bell Man Ford algorithms yield same solution? Why or why not? ---- (10 Marks)

(b) What is QoS? Explain various techniques to improve QoS. ----- (10 Marks)

5. (a) Explain TCP Header in details. ---- (10 Marks)

(b) What is classful lP addressing? Find maximum addresses provided by each class. --- (10 Marks)

6. (a) What is open system? Explain OSI model by drawing sender, receiver, intermediate node and Various communication between them.--- (10 Marks)

(b) Compare various switching techniques. ---- (10 Marks)

7. (a) Write a note on delay model . ---- (7 Marks)

(b) Write detail note on Leaky Bucket algorithm. ---- (7 Marks)

(c) Transmission Impairment cause and solution. ---- (6 Marks)

Saturday, July 26, 2014

COMPUTER COMMUNICATION NETWORKS (CCN), B.E. Electronics & Telecommunication, Semester 7, May 2010.

COMPUTER COMMUNICATION NETWORKS (CCN),

B.E. Electronics & Telecommunication,

Semester 7, May 2010.
Con. 3187-10
AN- 3235
(REVISED COURSE)

(3 Hours)
[Total Mark: 100]
N.B. (1) Question No 1 is compulsory.

(2) Attempt any four questions out of remaining six questions.

1. (a) What is data transparency ? Explain bit stuffing and destuffing. ---- (5 Marks)

(b) What tasks are performed by the transport layer? ---- (5 Marks)

(c) Explain different network components. ---- (5 Marks)

(d) What is fixed routing? What are the advantages and disadvantages of adaptive routing? ---- (5 Marks)

2. (a) What is flow control? Explain stop and wait ARQ protocol. --- (10 Marks)

(b) With suitable sketches explain the working of sliding window flowcontrol mechanism. ---- (10 Marks)

3. (a) Describe station types, configuration and modes of communication (response modes) supported by HDLC protocol. ---- (10 Marks)

(b) Explain HDLC frame format. --- (10 Marks)

4. (a) Explain the meaning of various fields in the TCP header frame format. ---- (10 Marks)

(b) Explain following medium sharing scheduling techniques: --- (10 Marks)

(i) Reservation

(ii) Polling

(iii) Token passing

5. (a) Compare circuit switching, datagram packet switching and virtual packet switching techniques with the help of timing diagram. ---- (10 Marks)

(b) Explain the meaning of various fields in the IP header frame format. ---- (10 Marks)

6. (a) How does ATM differ from frame relay? What are the relative advantages and disadvantages of ATM compare to frame relay? ----- (10 Marks)

(b) What is the essential difference between Dijkstra algorithm and Bellman – Ford algorithm? Explain these algorithms in brief. ---- (10 Marks)

7. Write short notes on any two of the following: ---- (20 Marks)

(a) IEEE project 802

(b) SONET and SDH

(c) CSMA/CA procedure.

Friday, July 25, 2014

COMPUTER VISION (CV) [ELECTIVE], Semester 8, B.E. Computer Science (CS), May 2013.

COMPUTER VISION (CV) [ELECTIVE], Semester 8,

B.E. Computer Science (CS), May 2013.
Con. 8527-13
GS-3577
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of remaining six questions.

(3) Assume suitable data whenever necessary and justify the same.

(4) Figures to the right indicate full marks.

1. (a) Give all the steps involved in recognition methodology and briefly explain each. ---- (10 Marks)

(b) Explain ‘opening’ and ‘closing’ with example. ---- (10 Marks)

2. (a) Explain Hough transform with example. Mention all its merits and demerits. ---- (10 Marks)

(b) What is knowledge based vision? Explain different of knowledge representation used in computer vision. ---- (10 Marks)

3. (a) Explain Border tracking algorithm with suitable example. ---- (10 Marks)

(b) Explain inverse perspective projection. ---- (10 Marks)

4. (a) Explain intensity matching of 1 dimensional signals. ---- (10 Marks)

(b) Explain back – tracking algorithm with suitable example. ---- (10 Marks)

5. (a) Apply ‘iterative’ and ‘classical’ connected component labelling algorithms on following image: ---- (10 Marks)

0 0 0 0 0 0 0 1 1 0
0 1 1 0 0 0 1 1 1 0
0 1 1 1 0 1 1 1 1 0
0 0 1 1 0 0 0 1 1 0

(b)
Explain boundary descriptors. --- (10 Marks)

6. (a) Explain ‘thinning’ and ‘thickening’ with the help of examples. ---- (10 Marks)

(b) Explain mixed spatial gray – level moments. ---- (10 Marks)

7. Write short note on: ---

(a) External points. ---- (5 Marks)

(b) Principal component analysis. --- (5 Marks)

(c) View class matching. ---- (5 Marks)

(d) Global V/S local features. --- (5 Marks)

Thursday, July 24, 2014

COMPUTER VISION (CV) [ELECTIVE], Semester 8, B.E. Computer Science (CS), May 2011.

COMPUTER VISION (CV) [ELECTIVE], Semester 8,

B.E. Computer Science (CS), May 2011.

(3 Hours)
[Total Mark: 100]

1. (a) Define Vanishing point and Vanishing line. ----- (5 Marks)

(b) What is significance of shape no. in region analysis? ---- (5 Marks)

(c) What is zero crossing edge detectors. ----- (5 Marks)

(d) Explain Least square method of curve fitting algorithm. ---- (5 Marks)

2. (a) Give all the steps involved in recognition methodology and briefly explain each. ---- (10 Marks)

(b) Explain Run length implementation of algorithm with suitable example. ---- (10 Marks)

3. (a) Consider elongated region whose external points are given by ----- (10 Marks)

(r1, c1) = (24, 137)
(r2, c2) = (24, 163)
(r3, c3) = (30, 181)
(r4, c4) = (32, 181)
(r5, c5) = (39, 155)
(r6, c6) = (39,145)
(r7, c7) = (32, 119)
(r8, c8) = (30, 119)

Determine M1, M2, M3, M4, ϕ1, ϕ2, ϕ3, ϕ4. If this region is considered to be rectangle, what would be Computed orientation, length and width of rectangle?

(b) Develop the algorithm for automatically calculating threshold value by minimizing within group variance. --- (10 Marks)

4. (a) Explain the following region growing algorithm with suitable example. ---- (10 Marks)

(i) Centroid linkage

(ii) Hybrid linkage

(iii) Single linkage

(b) What is signature segmentation? Obtain the horizontal, vertical and diagonal signature of the binary image segment shown below: ---- (10 Marks)

1 1 1 1 1
1 1 1
1 1 1
1 1 1 1 1
1 1 1
1 1 1 1
1
1 1 1 1
1 1 1 1

5. (a) Explain border tracking algorithm with suitable example. ---- (10 Marks)

(b) Using Hough transform show that the points (0,1), (1,4) and (-1,-2) are collinear and hence find the equation of line. ---- (10 Marks)

6. (a) What is knowledge based vision? Explain different forms of knowledge representation used in Computer vision. ---- (10 Marks)

(b) What are control strategies? Discuss the two major form of control Hierarchical and Hierarchical. ---- (10 Marks)

7. (a) Explain Information Integration ----- (5 Marks)

(b) What is facet model recognition ------ (5 Marks)

(c) Explain view class matching. ----- (5 Marks)

(d) Explain Intensity matching for one dimensional signal. ---- (5 Marks)

Tuesday, July 22, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), December 2013.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), December 2013.
Con.7749-13
(REVISED COURSE)
LJ- 13927
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining questions.

(3) Figures to the right indicate full marks.

1. (a) Model the following as a fuzzy set using suitable membership function – “Numbers close to 6”. ------ (8 Marks)

(b) Explain standard fuzzy membership functions. ---- (6 Marks)

(c) Determine all α – level sets as and strong α – level sets for the following fuzzy set. ---- (6 Marks)

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

2. Design a fuzzy Controller to determine the wash time of a domestic washing machine. Assume that the inputs are dirt and grease on the clothes. Use three descriptors for each input variable and five descriptors for out put variable. Derive a set of rules for control action and defuzzification. The design should be supported by figures wherever possible. Clearly indicate that if the clothes are soiled to a larger degree the wash time required will be more. --- (20 Marks)

3. (a) Determine the weights after four steps of training for Perceptron learning rule of a single neuron network starting with initial weights: --- (10 Marks)

W = [0 0]t , inputs as X1= [2 2]t ,
X2 = [1 - 2]t , X3 = [-2 2]t , X4 = [-1 1]t ,
d1 = 0, d2 = 1, d3 = 0, d4 = 1, and c = 1.

(b) Explain Mamdani type of Fuzzy Inference system in detail. ---- (10 Marks)

4. (a) Prove the following identities : - --- (10 Marks)

(i) For unipolar continuous activation function: -
f1 (net) = 0 (1- 0)

(ii) For bipolar continuous activation function: -
f1 (net) = 1/2(1- 01)

(b) Explain error back propagation training algorithm with the help of a flowchart. --- (10 Marks)

5. (a) Explain RBF network and give the comparison between RBF and MLP. --- (10 Marks)

(b) Explain with examples linearly and non – linearly separable pattern classification. --- (10 Marks)

6. (a) What is learning in neural network ? Differentiate between Supervised and Unsupervised Learning. ---- (10 Marks)

(b) Explain Travelling salesperson problem using simulated annealing. ---- (10 Marks)

7. Write notes on any two of the following: ---- (20 Marks)

(a) Learning Vector Quantization.

(b) Derivative Free Optimization.

(c) Winner takes all learning rule.

Friday, July 18, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), May 2013.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), May 2013.
Con.9787-13
(REVISED COURSE)
GS- 6157
(3 Hours)
[Total Mark: 100]
N. B.: (1) Question no 1 is compulsory.

(2) Attempt any four questions out of the remaining questions.

(3) Figures to the right indicate full marks.

1. (a) Explain cylindrical extension and projection operations on fuzzy relation with example. ---- (5 Marks)

(b) A neuron with 3 inputs has the weight vector w = [0.1 0.3 -0.2]. The activation function is binary sigmoidal activation function. If input vector is [0.8 0.6 0.4] then find the output of neuron. --- (5 Marks)

(c) What are the various types of Mutation techniques? ---- (5 Marks)

(d) Model the following as fuzzy set using trapezoidal membership function. --- (5 Marks)
“Middle age”

2.(a) What is supervised and unsupervised learning ? Compare different learning rules. ---- (10 Marks)

(b) Explain the Radial Basis function neural network for the solution of XOR. --- (10 Marks)

3. (a) Explain Kohonen’s self organizing neural network. --- (10 Marks)

(b) For the given membership function as shown in figure below, determine the defuzzified output value by 2 methods.---- (10 Marks)
4. (a) Explain the operations of genetic programming with help of flowchart . ---- (10 Marks)

(b) Compare Mamdani and Sugeno Fuzzy models. ---- (10 Marks)

5. Design fuzzy logic controller for water purification plant. Assume the grade of water and temperature of waters as the inputs and the required amount of purifier as the output. Use three descriptor for input and output variables. Derive set of rules for control the action and defuzzification. The design should be supported by figures. Clearly indicate that if water temperature is low and grade of water is low, then amount of purifier required is large. ---- (20 Marks)

6. (a) Explain Travelling salesperson problem using simulated Annealing. --- (10 Marks)

(b) Explain Error back propagation training Algorithm (EBPTA). ---- (10 Marks)

7. Write short notes on any two: --- (20 Marks)

(a) Character recognition using neural network

(b) Learning vector quantization

(c) Derivative based optimization.

Thursday, July 17, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), December 2012.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), December 2012.
Con.10900-12
(REVISED COURSE)
KR- 1899
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining questions.

1. (a) Model the following as Fuzzy set using suitable membership function “number close to 6”. ---- (5 Marks)

(b) Draw CANFIS architecture for Sugeno Fuzzy Model. ---- (5 Marks)

(c) Explain the different Fuzzy membership function. ---- (5 Marks)

(d) Explain Single Continues perceptron training Algorithm (SCPTA). ---- (5 Marks)

2. Design a Fuzzy controller to determine the wash time of domestic washing. Assume that input is dirt and grease on clothes. Use three descriptor for input variables. Derive set of rules for control the action and defuzzification. The design should be supported by the figures. Show that if the clothes are soiled to a larger degree the wash time will be more and vice- versa. ---- (20 Marks)

3. (a) Prove the following identities: ---- (10 Marks)

(i) For unipolar continuous activation function f ‘ (net) = O(1 - O)

(ii) For bipolar continuous activation function f ‘ (net) = O(1- O2) / 2
Where O is out.

(b) Explain Genetic Algorithm with the help of example. --- (10 Marks)

4. (a) Explain Error back propagation training algorithm with the help of a flowchart. ---- (10 Marks)

(b) Explain any four defuzzification methods with suitable Example. ---- (10 Marks)

5. (a) Explain with an example McCulloch – pitts neuron model. --- (6 Marks)

(b) Explain with neat diagram supervised and unsupervised learning. --- (6 Marks)

(c) State the different properties of Fuzzy set. ---- (8 Marks)

6. (a) Describe the basic Hopfield model and give the theory of energy Minimization in auto- associative Hopfield network. ---- (10 Marks)

(b) Explain the architecture of Bidirectional associative memory. Hoe is stored and retrieval performed in BAM? ---- (10 Marks)

7. Write short notes on any two of the following: ----- (20 Marks)

(a) TSP using simulated Annealing

(b) RBF network

(c) Multicategory perception training algorithm. (MCTPA).

Wednesday, July 16, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), May 2012.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), May 2012.
Con.4679-12
GN- 9047
(3 Hours)
[Total Mark: 100]

N.B. 1. Question No. 1 is compulsory.

2. Attempt any Four questions out of the remaining.

3. Figures to the right indicate full marks

1. (a) Explain fuzzy extension principle with the help of an example. --- (6 Marks)

(b) Explain Mc Culloch Pitts Neuron Model with help of an example. --- (6 Marks)

(c) Explain standard fuzzy membership functions. --- (8 Marks)

2. Design a Fuzzy logic controller for a domestic washing machine with two Inputs dirtiness of the load and weight of the laundry and output as amount of detergent used. Use five descriptors for each linguistic variable. Generate a set of rules for control action and defuzzification. ---- (20 Marks)

3. (a) What is learning in Neural Networks? Compare different learning rules. ---- (10 Marks)

(b) Explain error back propagation training algorithm with the help of a flowchart. ---- (10 Marks)

4. (a) Determine the weights after one iteration for hebbian learning of a single neuron network starting with initial weights W = [1, -1], inputs as ----- (12 Marks)

X1 = [1, -2], X2 = [2, 3], X3 = [1, -1] and c=1.

Use (i) Bipolar binary activation function

(ii) Bipolar continuous activation function

(b) Explain perceptron Learning with the help of an example. --- (8 Marks)

5. (a) Explain with examples linearly separable and non – linearly separable pattern classification. --- (10 Marks)

(b) Explain the three types of fuzzy Interface Systems in detail. --- (10 Marks)

6. (a) Explain Travelling Salesperson Problem using Simulated Annealing. ---- (10 Marks)

(b) Explain RBF network and give the comparison between RBF and MLP. --- (10 Marks)

7. Write notes on any two of the following ----- (20 Marks)

(a) Derivative based Optimization method of steepest descent.

(b) Learning Vector Quantization

(c) ANFIS Application – Printed Character Recognition

(d) Kohonen’s Self Organizing Network.

Tuesday, July 15, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), December 2011.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), December 2011.
Con.6873-11
MP- 5602
(3 Hours)
[Total Mark: 100]

N.B. 1. Question No. 1 is compulsory

2. Attempt any Four out of remaining

3. Assume suitable data if necessary and justify the assumptions

4. Figures to the right indicate full marks

1. (a) Explain Mc cul loch Pitts Neuron Model with help of an example. --- (5 Marks)

(b) Define support, Core, Normality, Crossover point and α – cut for fuzzy set. --- (5 Marks)

(c) A neuron with 4 inputs has the weight vector w = [1 2 3 4]t. The activation function is linear, that is, the activation function is given by f (net) = 2* net. If the input vector is X == [5 6 7 8]t, then find the output of the neuron. ---- (5 Marks)

(d) Explain Fuzzy Extension principle with example. --- (5 Marks)

2. (a) High speed rail monitoring devices sometimes make use of sensitive sensors to measure the deflection of the earth when a rail car passes. These deflections are measured with respect to some distance from the rail car and, hence are actually very small angles measured in micro radians. Let a universe of deflection be A = [1, 2, 3, 4] where A is the angle in mieroradians, and let a universe of distances be D == [1, 2, 5, 7] where D is distance in feet, suppose a relation between these two parameters has been determined as follows: --- (10 Marks)

Now let a universe of rail car weights be W = [1, 2], where W is the weight in units of 100,000 pounds. Suppose the fuzzy relation of W to A is given by

Using these two relations, tind the relation R To S = T
  1. Using max-min composition
  2. Using max-product composition
(b) What is learning? Compare different learning rules. ---- (10 Marks)

3. (a) Explain Error back propagation training algorithm with the help of a flowchart. --- (10 Marks)

(b) Explain Genetic algorithm with the help of example. ---- (10 Marks)

4. (a) Explain Random Search method with example. ---- (10 Marks)

(b) A single neuron network using f(net) = sgn(net) has been trained using the pairs of (Xi, di) as given below : --- (10 Marks)

X1 = [1 -2 3 -1] t, d1 = -1
X2 = [0 -1 2 -1] t, d2 = 1
X3 = [-2 0 -3 -1] t, d3 = -1
The final weights obtained using the perception rule are
W4 = [3 2 6 1] t
Knowing that correction has been performed in each step for c=1, determine the following weights :

(a) W3,W2, W1 by backtracking the training.

(b) W5, W6, W7, obtained for steps 4,5,6 of training by reusing the sequence
(X1. d1), (X2, d2), (X3, d3)

5. (a) Explain with example perceptron learning rule. ---- (10 Marks)

(b) Explain with example gradient based optimization technique. ---- (10 Marks)

6. Design a fuzzy logic controller for a train approaching or leaving a station. The inputs are the distance from the station and speed of the train. The output is the amount of break power used. Use four descriptors for each variable use Mamdani Fuzzy model. ---- (20 Marks)

7. Write short notes on any two of the following: --- (20 Marks)

(a) TSP using simulated Annealing

(b) Kohonen's self organizing network

(c) Character Recognition using neural network

(d) RBF network

Saturday, July 12, 2014

SOFT COMPUTING (SC) [ELECTIVE], Semester 7, B.E. Computer Science (CS), December 2010.

SOFT COMPUTING (SC) [ELECTIVE], Semester 7,

B.E. Computer Science (CS), December 2010.
Con.6652-10
GT- 8850
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining questions.

1. (a) Explain support and core of fuzzy set with examples. --- (5 Marks)

(b) Explain linearly separable and non-linearly separable patterns with examples. --- (5 Marks)

(c) Draw CANFIS architecture for Sugeno fuzzy model. --- (5 Marks)

(d) Model the following as fuzzy set using trapezoidal membership function : --- (5 Marks)
“Number close to 10”

2. (a) Explain Errorback Propogation Algorithm with the help of flowchart. --- (12 Marks)

(b) Explain ADALINE (Adaptive Linear Element). --- (8 Marks)

3. Using Mamdani fuzzy model, Design a fuzzy logic controller to determine the wash time of domestic washing machine. Assume that the inputs are dirt and grease on cloths. Use three descriptors for each input variable and five descriptors for the output variable. Derive a set of rules for control action and defuzzification. The design should be supported by figures wherever possible. --- (20 Marks)

4. (a) Give the basic steps involved in simulated Annealing method. Explain how ‘Travelling Salesperson Problem(TSP)’ can be solved using simulated Annealing method. --- (12 Marks)

(b) Determine the weights after one iteration for Hebbian learning of single neuron network starting with initial weight vector. --- (8 Marks)

inputs as

and C = 1. Use signum (bipolar binary activation function.

5. (a) Explain the major components of genetic algorithm. Give a simple genetic algorithm for maximization problem. --- (10 Marks)

(b) Let A = { a1, a2 }, B = { b1, b2, b3 }, C = { c1, c2 } ----- (10 Marks)

Let R be a relation from A to B defined by matrix: -

Let S be a relation from B to C defined by matrix: -

Find (i) Max – min composition of R and S.

(ii) Max product composition of R and S.

6. (a) Explain ANFIS architecture with neat diagram. ---- (10 Marks)

(b) Explain perception convergence theorem for single layer perception. ---- (10 Marks)

7. Write short notes on any four of the following: --- (20 Marks)

(a) Radial basis function network

(b) Printed character recognition

(c) Inverse kinematics problem

(d) Gradient descent method

(e) Kohonen self organizing network.

Tuesday, July 8, 2014

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2013.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2013.
Con.8692-13
LJ- 14050
(3 Hours)
[Total Mark: 100]

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

(2) Answer any four questions out of the remaining six questions.

(3) Assume suitable data wherever necessary.

1. (a) What do you mean robot configuration? What is work space? --- (5 Marks)

(b) Explain, in brief, reactive system. --- (5 Marks)

(c) Describe unsupervised learning with suitable example. --- (5 Marks)

(d) Explain screw motion. Hence describe how screw motion involves linear and rotation transformation. --- (5 Marks)

2. (a) Describe different types of environments applicable to A1 agents. --- (10 Marks)

(b) Define blind search and informed search. Hence discuss the merits and demerits of each. --- (10 Marks)

3. Using DH algorithm, derive homogeneous transformation matrix for following robot. --- (20 Marks)

4. (a) What is decision tree? How decision tree can be used for interface? Give suitable example. --- (10 Marks)

(b) What is planning? How it defers from searching?--- (10 Marks)

5. (a) Explain the structure of learning agent. What is role of critic in learning? --- (10 Marks)

(b) Discuss various learning methods. --- (10 Marks)

6. (a) Describe A* algorithm with merits and demerits. --- (10 Marks)

(b) What is heuristic function? How will you find suitable heuristic function? Give suitable example. --- (10 Marks)

7. Write short notes on : --- (20 Marks)

(a)Forward and inverse kinematics.

(b) Sensors used in robotic systems.

(c) Belief network.

(d) Hill climbing algorithm.

Monday, July 7, 2014

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, May 2013.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, May 2013.
Con.8341-13
GS- 5419
(3 Hours)
[Total Mark: 100]

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

(2) Answer any four questions out of the remaining six questions.

(3) Assume suitable data wherever necessary.

1. (a) Find the inverse kinematic solution of 4-axis SCARA Robot. --- (10 Marks)

(b) Explain utility based agent with the help of neat diagram. --- (10 Marks)

2. (a) Write a note on Reactive Behavioural System. ---- (10 Marks)

(b) Describe the following sensors---- (10 Marks)

(i) Sonar

(ii) Infrared

3. (a) Compare different uninformed search strategies. --- (10 Marks)

(b) Explain A* Algorithm. What is the drawback of A* ? Also shows that A* is optimally efficient. --- (10 Marks)

4. (a) Describe Hill Climbling Algorithm. What are it’s limitations? ---- (10 Marks)

(b) Explain various method of knowledge representation with example. ---- (10 Marks)

5. (a) Define Reach and stroke, Degree of Freedom and Accuracy. --- (10 Marks)

(b) Define partial order planner. Explain STRIPS representation of planning problem. --- (10 Marks)

6. (a) Explain the learning Agent with the help of suitable diagram. --- (10 Marks)

(b) What are PEAS descriptors? Give PEAS descriptor for ---- (10 Marks)

(i) part-picking robot.

(ii) WUMPUS WORLD.

7. Write short note on following: --- (20 Marks)

(a) Belietf Network

(b) PROLOG

(c) Crypt Arithmetic

(d) GPS

Saturday, July 5, 2014

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2012.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2012.
Con.8367-12
KR- 1161
(3 Hours)
[Total Mark: 100]
N. B.: (1) Question no 1 is compulsory.

(2) Attempt any four questions out of the remaining questions.

(3) Assume suitable data if necessary.

1. Answer the following question in brief: - ---- (20 Marks)

(a) Briefly explain the role of Robotics in Industries.

(b) Explain in brief the forward and inverse Kinematics.

(c) Explain Heuristic function with example.

(d) List sensors used for reactive robot.

2. (a) Describe DH parameters with suitable sketch. --- (6 Marks)

(b) Find the Kinematic transformation matrix using DH Method for following robot. --- (14 Marks)
3. (a) Explain how you will formulate search problem. Formulate 8-puzzle problem. --- (6 Marks)

(b) Describe Depth – first search using suitable example. --- (4 Marks)

(c) What do you mean an admissible hearistics function? Discuss with suitable example. --- (5 Marks)

(d) Describe IDA* search algorithm giving suitable example. --- (5 Marks)

4. (a) Describe backward – chaining algorithm for propositional logic. --- (6 Marks)

(b) Represent the following sentences in first – order logic, using a consistent vocabulary. --- (4 Marks)

(i) Every person buys a policy is smart.

(ii) No person buys an expensive policy.

(iii) There is an agent who sells policies only to people who are not insured.

(iv) There is a barber who shaves all men in town who do shave themselves.

(c) Describe backward chaining algorithm with example. --- (10 Marks)

5. (a) You have two neighbours, John and Mary who have promised to call you at work when they hear the alarm. John always calls when he hear the alarm, but sometimes confuses the telephone ringing with the alarm and calls then, too. Mary on the other hand, likes rather loud music and sometimes misses the alarm altogether. Given the evidence of who has or has not called, we would like to estimate the probability of a burglary. Draw a Bayesian network for this domain with suitable probability tables. --- (10 Marks)

(b) Give steps in designing the Reactive Behavioral System. ---- (10 Marks)

6. (a) What is planning problem? How it differs from search problem? --- (5 Marks)

(b) Explain screw Transformation. --- (5 Marks)

(c) Explain supervised, unsupervised and reinforcement learning with example. --- (10 Marks)

7. (a) Describe following electrical actuators, DC motor, Sunchronous motor, Stepper motor. --- (10 Marks)

(b) Explain following sensors used in robotics application, Potentiometer, Inductor, Capacitor, LVDT. --- (10 Marks)

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2011. Robotics.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2011.

Robotics.
Con.6299-11
MP- 5596
(3 Hours)
[Total Mark: 100]

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

(2) Solve any four questions.

1. (a) Define Reach & stroke, Degree of Freedom and Accuracy. ---- (5 Marks)

(b) Given that coordinate transformation matrix is a rotation matrix and represents fundamental rotation, what is the axis of rotation (1, 2, or 3) and what is the angle of rotation? i.e. and θ ---- (5 Marks)
(c) What is proximity sensor? Explain SONAR sensor. --- (5 Marks)

(d) Explain Heuristic function with example. ---- (5 Marks)

2 (a) Yaw 90°, Pitch - 90, roll 90°. Rotations are performed about the fixed axes of Fframe.
Find coordinates of q w. r. t. fixed axis. i.e. [p]F . ,[P]M={0,0,0.8}T . ---- (4 Marks)

(b) Explain Goal based agent and Utility based Agent with diagram. State difference between them. ---- (8 Marks)

(c) Explain steps in problem formulation with example. --- (8 Marks)

3. (a) Explain steps to convert Logical statements into Causal Normal Form. --- (4 Marks)

(b) Explain Learning Agent with diagram. Also explain inductive learning. --- (8 Marks)

(c) What is Uncertainty? Explain Bayesian network with example. ---- (8 Marks)

4. (a) Explain Direct Kinematics of 4-axis SCARA Robot. --- (10 Marks)

(b) What is Configuration Space? Draw the Configuration space induced by the translation of the concave mobile part A on the fixed obstacle B. ---- (10 Marks)
5. (a) Explain Screw Transformation. --- (4 Marks)

(b) Define rational agent. Explain task set properties of environment. --- (8 Marks)

(c) Explain steps in designing reactive behavioural system. --- (8 Marks)

6. (a) Draw and explain WUMPUS WORLD Environment with their Performance measure, Environment, Actuator and sensor. --- (10 Marks)

(b) Explain A* search with example. ---- (10 Marks)

7. (a) Derive the General lion-Co-ordinate transformation matrix Tk k-l. ---- (10 Marks)

[b) Consider following facts: - ---- (10 Marks)

1.If maid stole the jewellery then butler was not guilty.

2. Either maid stole jewellery or she milk the cow

3. If maid milked the cow then butler got the cream.

4. Therefore if butler was guilty then he got the cream.

Prove that the conclusion (step 4) is valid using resolution.

Friday, July 4, 2014

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2011. Intelligent System.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2011.

Intelligent System.
Con.6457-11
MP - 4687
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining six questions.

1. (a) Define Automation. Differentiate between soft and hard automation. --- (5 Marks)

(b) List and define Kinematic parameters. ---- (5 Marks)

(c) Explain in brief various types of work envelopes. ---- (5 Marks)

(d) Explain fundamental rotation. Develop fundamental rotation matrices. --- (5 Marks)

2. (a) Define Direct Kinematics. Develop arm equation for 5-axis RHINO XR3 robot with the help of D-H Algorithm. --- (10 Marks)

(b) Explain PnP operation with sketches. ---- (10 Marks)

3. (a) Obtain Inverse Kinematic Solution for 4 axis SCARA robot. ---- (10 Marks)

(b) Explain various template matching algorithms and compare them. ---- (10 Marks)

4. (a) Classify robot as per workspace and explain in brief. --- (10 Marks)

(b) Explain Bounded Deviation Algorithm (BDA) to obtain straight line motion. --- (10 Marks)

5. (a) List various workspace fixtures and explain them in brief. --- (10 Marks)

(b) State the role of shrink and swell operators in robot vision. Differentiate between these operators with suitable examples. --- (10 Marks)

6. (a) List various specifications of robot and explain at least 6 significant specifications with sketches wherever required. --- (10 Marks)

(b) Explain configuration space and also the role of G. V. D. in task planning. --- (10 Marks)

7. Write short notes on the following:- --- (20 Marks)

(a) NC VS CNC machines

(b) Interpolated motion

(c) Perspective transformations

(d) Tool Configuration Vector (TCV).

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2009. Robotics.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2009.

Robotics.
Con.5817-09
SP- 6800
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining six questions.

(3) Assume suitable data wherever required.

1. (a) Compare the five basic robot configuration according to the work envelope and applications. --- (5 Marks)

(b) Explain Reach and Stroke of a robot. --- (5 Marks)

(c) Discuss Total Work Envelope (TWE) and Dexterous Work Envelope (OWE) of two axis articulated planar robot. --- (5 Marks)

(d) Compare area descriptor and line descriptor. --- (5 Marks)

2. (a) Explain the significance of TCV vector in the solution of Inverse Kinematic. --- (5 Marks)

(b) Discuss the general properties of the solutions of the Inverse Kinematic. --- (5 Marks)

(c) Develop IK analysis of 2-axis planar articulated robot. --- (10 Marks)

3. (a) Explain D-H algorithm. Develop the D.K. analysis of 4 axis SCARA robot. --- (15 Marks)

(b) Explain screw Transformations. --- (5 Marks)

4. (a) Define Joint space work envelope (JSWE) and Tool Trajectory. --- (5 Marks)

(b) Explain work space fixtures required in the robotic work cell. --- (5 Marks)

(c) Discuss work envelope of a four axis SCARA robot. --- (10 Marks)

5. (a) Explain how straight line motion can be obtained using an articulated robot. --- (10 Marks)

(b) Explain linear interpolation with parabolic blends. Discuss its advantages over piecewise linear interpolation. --- (10 Marks)

6. (a) Discuss edge detection technique. Explain the significance of edge threshold ϵ.--- (10 Marks)

(b)
0 0 1 1 0 0
1 1 1 1 1 1
0 0 1 1 0 0

For the above image shown calculate area, centroid, first order moments, second order moments, central moments and principal angle. --- (10 Marks)

7. Write short notes on the following:- --- (20 Marks)

(a) Region growing and region labelling

(b) Shrink and swell operator

(c) Task planning problem

(d) NC and CNC machines.

Thursday, July 3, 2014

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, December 2009. Intelligent System.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, December 2009.

Intelligent System.
Con.5621-09
SP- 6563
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining six questions.

1. (a) What is AI ? Explain various applications of AI. ---- (10 Marks)

(b) Convert following statements into first order predicate logic:- --- (10 Marks)

(i) Every gardener likes sun

(ii) All purple mushrooms are poisonous

(iii) Everyone is loyal to someone

(iv) Everyone loves everyone except himself

(v) There is a barber who shaves all men in the town who do not shave themselves.

2. (a) What do you mean by Intelligent Agent ? Explain various types of intelligent agents. State limitations of each and how it is overcome in another type agent. --- (10 Marks)

(b) You are given two jugs of capacities 4 litre and 3 litres each. Neither of the jugs have any measuring markers on them. There is a pump that can be used to fill the jugs with water. How can you get exactly two litre of water in 4 litre jug? Formulate the problem in state space and draw complete diagram. --- (10 Marks)

3. (a) Assume the following facts :- --- (10 Marks)

(i) Steve only likes easy courses

(ii) Science course are hard

(iii) All the course in the basket-weaving department are easy

(iv) BK301 is a basket-weaving course.

Use resolution to answer the question "What course would steve like ?"

(b) Explain Breadth first search and Depth first search algorithm and state their advantages and disadvantages. --- (10 Marks)

4. (a) Explain partial order planning with the help of example "spare tyre problem". Changing the flat tyre with spare one. --- (10 Marks)

(b) What is expert system? Explain rule based expert system and frame based expert system. --- (10 Marks)

5. (a) Explain supervised, unsupervised and reinforcement learning with examples. --- (10 Marks)

(b) Explain knowledge engineering process. --- (10 Marks)

6. (a) What is inductive learning? Explain decision tree with example.--- (10 Marks)

(b) Explain general ontology with respect to categories, mental object and beliefs, events and processes and measures. --- (10 Marks)

7. Write short notes on any two of the following:- --- (20 Marks)

(a) Game Playing

(b) Robot and its Components

(c) Baye's Belief Networks

(d) Multilayer Feed Forward Neural Network.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI), B.E. Computer Science (CS), Semester 7, May 2009. Robotics.

ROBOTICS AND ARTIFICIAL INTELLIGENCE (RAI),

B.E. Computer Science (CS), Semester 7, May 2009.

Robotics.
Con.3357-09
VR- 4125
(3 Hours)
[Total Mark: 100]

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

(2) Attempt any four questions out of the remaining six questions.

1. (a) Discuss the differences between fixed and flexible automation. --- (5 Marks)

(b) What is linear interpolation with parabolic blends? What are the advantages? --- (5 Marks)

(c) Define the following terms: Tool Path, Tool Trajectory, OOF, Precision, Accuracy. --- (5 Marks)

(d) Define Kinematic Parameters. --- (5 Marks)

2. (a) Explain the edge detection algorithm. --- (10 Marks)

(b) Explain Bounded Deviation Algorithm. --- (10 Marks)

3. (a) What is image smoothening? Explain how it is done on a binary image. --- (10 Marks)

(b) Construct the arm matrix using homogeneous transformation matrices for a 2-DOF articulated robot. Draw neat diagram. --- (10 Marks)

4. (a) Determine the tool configuration vector of SCARA robot, when - --- (10 Marks)


(b)
Explain guarded and constrained motion. --- (10 Marks)

5. (a) Explain the effect of moment of inertia on the dynamic performance of a robot.--- (10 Marks)

(b) What is an Inverse Kinematics problem? What are the methods of solving it? Compare numerical approaches over analytical approaches. ---- (10 Marks)

6. (a) Explain the PNP motion trajectory in details.--- (10 Marks)

(b) Explain position uncertainty and velocity uncertainty. --- (5 Marks)

(c) Define Total work envelope, Joint space work envelope and Dexterous work Envelope with their relevant formulae and explain each term in them. --- (5 Marks)

7. Write short notes on :- --- (20 Marks)

(a) NC and CNC machines

(b) Perspective transformation

(c) Robot programming

(d) Linear interpolation with parabolic blends.