Subject Code: H0401/R13

M. Tech II Semester Regular Examinations, September, 2014

SIMULATION MODELING OF MANUFACTURING SYSTEMS
(Common to CAD/CAM and AMS)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1. (a) Define system. Explain its properties with appropriate block diagrams.
(b) Write short notes in Type I & II errors.
2. (a) State and explain the various techniques for increasing the model credibility.
(b). Describe about modeling and various techniques for verification.
3. (a). Define random number. Explain statistical properties of random numbers with
example.
(b) Explain the inverse transform method to generate random variates from a given
distribution.
4. (a) Explain the different techniques of simulation output analysis.
(b) How the simulation of output data analysis be done in practice?
5. (a). How the simple fixed period inventory system is simulated?
(b). What is queuing model? How it is useful for Simulation? Example the simulation of
single queuing system.
6. (a) Explain briefly about string law of large numbers.
(b). Explain the steps involved in Simulation of WMJI queue
7. A toll gate in a highway consists of 5 lanes. The inter-arrival time of the vehicles at the
toll gate follow uniform distribution with 12020 seconds. The service time also follows
uniform distribution with 30 10 seconds. Draw a GPSS diagram and prepare a program
to simulate the system for 5 hrs.
8.

Write short notes on following:

a) Advantages of simulation languages
b) Properties of parameter
estimation

c) Welch algorithm
*****

|'''|'|'|''||''''|||

Subject Code: H0502 /R13

M. Tech II Semester Regular Examinations, September, 2014
DESIGN & ANALYSIS OF ALGORITHMS
(Computer Science)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
Define analysis of algorithm. How to measure the efficiency of algorithm?
1.
a)
[6]
Write and measure the efficiency of various standard programming language
constructs.

2.

b)

Using recursion tree to determine a good asymptotic upper and lower

bounds on the recurrence relation T(n)=3T(n/2)+n, use the substitution
method to verify your answer.

[6]

a)

How to solve merge sort with divide and conquer? Suggest the
refinements to merge sort to make it in-place.
Explain the Greedy approach to store data on tapes so as to minimize the
Mean Retrieval Time and maximize the tape utilization ratio with
algorithm.

[6]

Explain the Knapsack Problem n=3, m=6, (w1, w2, w3)= (2,3,4), (p1,
p2, p3)= (1,2,5) find out the optimal solution.
What is spanning tree? Explain the application of it and also draw the
minimum cost spanning tree using prims algorithm.

[6]

b)

3.

a)
b)

4.

a)
b)

5.

6.

b)

7.

8.

[6]

What is travelling sales person problem? Show that the time complexity [6]
of it is O(n22n) and space complexity is O(n2n)
What is dynamic programming? Apply it to find the optimal order of [6]
multiplying n matrices.
Explain how dynamic programming is used to solve reliability design
problem for the given instance. N=3, (c1,c2,c3)= (30,15,20) C=105
(r1,r2,r3)= (0.9,0.8,0.5)

a)

[6]

[12]

Draw the portion of state space tree generated by FIFO branch and [8]
bound for the following instances.
N=5, m=12, (p1--- p5)=
(10,15,6,8,4) (w1---w5)=(4,6,3,4,2)
What is bounding? Explain how these bounds are used in branch and
[4]
bound methods.

a)

Write and explain the control abstraction for Backtracking.

[4]

b)

Let w={15,7,20,5,18,10,12} and m=35 .Find all possible subsets of w

that sum to m. Draw the portion of the state space tree that is
generated.

[8]

a)

Explain the satisfiability problem; Write the algorithm for the same.

[6]

b)

What is meant by Halting Problem? Explain with an example.

[6]

****

|'''|'|'|''||''''|||

Subject Code: H4301/R13

M. Tech II Semester Regular Examinations, September. 2014
SWITCHED MODE POWER CONVERSION
(Common to PE, P&ID, PE&ED, PE&D, EM&D and PE&PS)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1 a). A buck converter is having ideal components connected to a constant input voltage Vin.
The output voltage is V0 is ripple free and the converter switch is operated with a duty
ratio D for switching time period T. Derive the expression for D at boundary of
continuous and discontinuous conduction of currents iL ?
b).

Describe the operation of buck-boost converter and draw its steady state waveforms?

2 a). Draw the series and parallel resonant circuits and explain their gain characteristics under
resonance?
b).
3

Describe the ZCS and ZVS switching operations with the help of suitable circuits?
Draw the half wave and full wave quasi-resonant ZVS circuits of a boost converter and
explain their operations?

Compare push-pull, half bridge and full bridge isolated switch mode converters for
SMPS applications?

5 a) Describe current mode control scheme in the converter operation? How it is used in buck
converter?
b)

Briefly describe the design consideration of transformers used in switching converters?

6 a) Deduce the generalized expressions to obtain the average model of a converter in detail?
b)
7 a)

Briefly explain how a small signal model of a converter is developed?

Briefly explain how do you obtain different transfer functions of buck converter?
Express them?

b)
8

Briefly explain different large signal issues of the converter in voltage mode control?
Briefly explain
a) Switch mode converter realizations with non ideal components
b) Control scheme of resonant converters
****

|'''|'|'|''||''''|||

Subject Code: H5501/R13

M. Tech II Semester Regular Examinations, September, 2014
HARDWARE SOFTWARE CO-DESIGN
(Embedded Systems)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1. a. Discuss about Co-design models
b. Describe hardware-software partitioning distributed system co-synthesis
2. a. What is Prototyping ?What are the future developments in emulation and
prototyping architecture
b. Explain about system communication infrastructure
3. Discuss in detail about Compilation techniques
4. Write a short notes on
a. implementation verification
b. interface verification
5. Explain about
a. verification tools
b. interfacing components
6. Discuss about
a. Systemlevel specification(
b. design level representation for system level systhesis
7. Write a short notes on
a. Modern embedded architectures
b. practical consideration in a compiler development environment
8. Discuss about
a. Heterogeneous specifications
b. multirange co-simulation

*****

|'''|'|'|''||''''|||

Subject Code: H6809 /R13

M. Tech II Semester Regular Examinations, September, 2014
LOW POWER VLSI DESIGN
(Common to VLSI&ES, ES&VLSI, VLSID&ES, ES&VLSID, VLSI, VLSID,
VLSISD and VLSI&ME)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1. a) Write about the need of low power VLSI design.
b) What are Leakage Power Dissipation elements and explain.
2. a) Discuss about Pipelining and Parallel Processing.
b) What are the advantages and disadvantages of multi-threshold CMOS design?
3. a) Design and explain a full adder with minimum number of transistors.
b) Draw and explain Carry Select Adder.
4. What are the types of Multiplier Architectures and explain one in detail.
5. a) What is SRAM and what are the merits of it.
b) Write about Low-Power SRAM Technologies.
6. a) Discuss about dynamic power consumption
b) Draw and explain four bit Ripple Carry Adder.
7. a) Draw and explain Booth Multiplier.
b) Write the basic operation of DRAM cell
8. What are the sources of power dissipation in VLSI circuits and explain

****

|'''|'|'|''||''''|||

Subject Code: D0401/R09

M. Tech II Semester Supplementary Examinations, September, 2014
ADVANCED OPTIMIZATION TECHNIQUES
(Common to CAD/CAM and MD)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1. Solve the following L.P.P. by using its dual :
Maximize Z
Subject to:

= 5x1 - 2x2 + 3x3

2. (a ) What is degeneracy what are its applications?

(b) Using branch and bound model from the least cost route for a salesman who wants to
visit cities A, B, C, D and E without repeating any city before completing his tour of
all cities and wishes to return to the point of starting journey. Cost of going from one
city to another (in rupees) is given below

3. (a) Explain Lagrange multiplier procedure and write limitation of Lagrangian approach
(b) Explain about single variable optimization with constrains
4. (a) Explain about steepest descent method with suitable example
(b) what are the types of penalty method explain them in brief
5. (a) How do you perform (i) crossover and (ii) Mutation in GA? How do you set the
termination criteria?
(b) what are the draw backs of GA?
6.

what is the principle and purpose of Genetic Programming? Explain the steps.

7. what are the applications of multi objective problems? Explain in detail.

8. (a) Define Operation research? Discuss the need of operation research in industry
(b) Write down a general procedure for optimizing machining operations sequence
****

|'''|'|'|''||''''|||

Subject Code: D5501/R09

M. Tech II Semester Supplementary Examinations, September. 2014
ALGORITHMS FOR VLSI DESIGN AND AUTOMATION
(Common to ES, VLSI D&VLSID, VLSI&ES and ES&VLSID)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
*****
1. a. Discuss about design automation tools
b.Explain in detail about tractable and intractable problems
2. a. Explain about
(i) simulated Annealing with algorithms SA
(ii) simulated evolution with algorithm SE
3. What is meant by floorplanning .explain about integer programming based floor
planning
4. a.What is the difference between modelling and simulation
b. What is the difference between gate level modelling and switch level modelling
5. Write a short notes on
(i) binary decision diagram
(ii) two level logic synthesis
6. a. Explain about internal representation of the input algorithm
b. Differenciate the high level synthesis assignment and scheduling
7. Write the algorithms for the segmented model and staggered models with explanation
8. Explain the MCM routing algorithms
(i) Topological routing
(ii) Integrated pin distribution and routing
*****

|'''|'|'|''||''''|||

Subject Code: D5809/R09

M. Tech II Semester Supplementary Examinations, September, 2014
DATAWARE HOUSING AND DATA MINING
(Common to NN, SE, CS&E, CS and CST)
Time: 3 Hours
Max Marks: 60
Answer any FIVE questions
All questions carry EQUAL marks
****
1. a) Describe briefly various methods of Data preprocessing?
b) Explain Data mining functionalities and classification of Data mining systems?
2. a) What is a concept hierarchy? Describe online analytical processing operations in
Multidimensional data model?
b) With a neat sketch explain the three- tier data ware house architecture? Explain the
Indexing of OLAP data?
3. a) Explain data mining primitives? Explain data mining query languages?
b) Briefly explain the designing of graphical user interface based on DMQL?
4.

What is analytical characterization? What is the need to perform attribute relevance

Analysis? Briefly explain the available methods for attribute relevance analysis?

5.

a) Describe the mining multi dimensional association rules from Relational data bases
And data ware houses?
b) What are Bayesian classifiers? With an example describe how to predict a class label
Using NAVE Bayesian classifiers?

6. a) what is classification? Describe the decision tree induction and attribute selection
Measures?
b) Explain briefly the classification by back propagation?
7.

a) Explain briefly the classical partitioning methods K-MEANS and K-MEDOIDS?

b) What is Density- based methods? Describe anyone Density- based clustering
algorithm?

8.

a) What is multimedia data base? Explain briefly multimedia data mining?

b) Describe Text Mining and Mining World Wide Web?
****

|'''|'|'|''||''''|||