Concept of Programming and OOPS (Utu previous year question paper)

Utu previous year question paper

sub:- Concept of Programming and OOPS

b.tech 2013-14 (sem-5)

uttarakhand technical university

time: 2hrs

max marks: 50

Q1:- Attempt any four of the following:

1. What is editor? Explain the main functions of vi editor.
2. What is looping mechanism? Differentiate between while and do-while loop with a suitable example.
3. Explain UNIX shell and its type in brief.
4. Explain recursive function. Write a C program to find the factorial of a given integer by using recursion.
5. What is array? Write a C program for addition of two arrays
6. Differentiate if and if-else statement by using a C program.

Q2:- Attempt any four of the following:

1. What do you understand by testing and debugging process? write a program in C to check the given number is even or odd.
2. What are the variable and keyword in C language? Explain with proper example.
3. Explain the phases of software development life cycle (SDLC) model. Draw a spiral model of a software development.
4. Describe the various processes involved in user interface design.
5. What is code review? Write an algorithm to check whether the given year is leap or not.
6. "C is known as structured programming language". Why? Justify the statement.

DESIGN ANALYSIS OF ALGORITHMS B. TECH SEM V (2012 -13) (utu previous year question paper)

DESIGN ANALYSIS OF ALGORITHMS B. TECH

 SEM V (2012 -13)

UTTARKHAND TECHNICAL UNIVERSITY

Time : 3 Hours 

Total Marks : 100

SECTION - 1

Attempt any four

1. Is         =O(2n) ? Is 2     O(2 ) ?
2. Arrange the following in order of best to worst efficiency : O(n log n ), O(n ), O(n ), O(n log   ).
3. Give an analysis of worst case running time of quicksort . When does it occur ?
4. Give an array of 8 element which is the worst case for Insertion Sort .
5. Define the asymptotic notations used for best case average case and worst case analysis of algorithms.
6. Show that the solution T(n) = T(           ) + 1 is O( lg n ) .

 SECTION - 2

Attempt any two 

1. (A) Insert the following values one at a time into an initially empty red-black tree 41, 38, 31, 12, 19, 8 (B) Show that, for arbitrarily large values of n , there are red - black tree with n nodes that have height 2 logn - O(1) .
2. Suppose that a node x is inserted into a red-black tree with RB-INSERT and then immediately deleted with RB-DELETED . Is the resulting red-black tree the same as the initial red -black tree ?
3. Insert the following nodes into an empty AVL tree . Show each step and what rotations are needed . Nodes to insert : 10, 40, 35, 25, 60, 30, 80, 50, 27, 28, 38

SECTION - 3 

Attempt any two    

 

1. (A) What is the difference between a pure recursive solution and a dynamic programming solution to a problem ?                                                                                                                                      (B) What do we understand by the "optimal substructure property" in a dynamic programming problem? 
2. Explain N-queens problem with an algorithm. Explain why backtracking is defined as a default procedure of last resort for solving problems .
3. (A) State if backtracking always produces optimal solution.                                                            (B) Describe how to implement a queue using two stacks and O(1) additional memory , so that the amortized time for any enqueue or dequeue operation is O(1) . The only access you have to the stacks is through the standard subroutines PUSH and POP .

SECTION - 4

Attempt any two 

1. Solve the following instance of the single - source shortage paths problem with vertex "v3" as the source .
2. Draw a (simple) directed weighted graph G with 10 vertices and 18 edges ,such that G contains a minimum-weight cycle with at least 4 edges . Show that the Bellman - Ford algorithm will find this cycle .
3. Show how to modify Dijkstra's algorithm for the case when the graph is directed and we want to compute shortage directed paths from the source vertex to all the other vertices . 

SECTION - 5

Attempt any two 

1. (A) How do we establish that a problem is NP-Complete ?                                                            (B)  Given a graph G and vertices s and t, does G contain a walk from s to t such each vertex of G is visited at a once and at most 100 times .
2. What happens when we use the Goemans-Williamson algorithm for MAX-CUT an a triangle ? Square ? Pentagon? Specifically , what can be inferred on the algorithm's ratio and on the integrality ratio of the relaxation ?
3. Show that the Next-Fit algorithm for BP (BIN-PACKING) achieves an asymptotic ratio of 2. Show that FF(1) < NF(1) .

.................................

DIGITAL SIGNAL PROCESSING

DIGITAL SIGNAL PROCESSING
SEM-V,2012-13
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 3 Hours 

Total Marks: 100

SECTION - A

Attempt any four parts of the following:

1. If two discrete - time LTI systems are cascaded, then prove or disprove that interchanging their order does not change the total system.
2. Test the following systems are stable or not:
   (i) y(n) = cos[x(n)]
   (ii) 
3. Derive the condition for impulse response of causality and stability properties in LTI systems.
4. Differentiate between DTFT and DFT.
5. Differentiate between FFT and DCT.
6. Discuss about the application of adaptive filtering in echo cancellation.

AUTOMATIC CONTROL SYSTEMS

AUTOMATIC CONTROL SYSTEMS
SEM-V, 2012-13
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
utu previous year question paper

Time : 3 Hours

Total Marks:100

Attempt any four parts of the following:

1. What is effect of adding pole to a system? Discuss.
2. What is feed forward compensation? Clearly show block diagram.
3. What is Mason's Gain formula?
4. For the above system find the integral square error given by
   
   and comment on the same. The input r(t) is unit-step input
   and u = unit step input, find x(t).
5. Find the damping factor ζ, natural frequency ω_n peak time T_p and percentage overshoot for the system
   .
   Draw its pole zero location.
6. Derive the close loop transfer C(S)/R(S) = M (S) for the system shown below and find its sensitivity with respect to G and H.
   

VLSI CIRCUIT DESIGN (utu previous year question papers)

VLSI CIRCUIT DESIGN
SEM-VI, 2012
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(utu previous year question paper)

Time: 3 hours

Total Marks:100

Note: Attempt ALL question. Assume suitable data if necessary.

Attempt any four parts of the following:

1. Consider an N-channel MOSFET with N_A= 3 x 10¹⁶/cm³ and t_ox = 450^o A. Let L = 1.25μm and assume that r_j = 0.5μm. Calculate the threshold voltage shift due to short channel effect.
2. Explain the term "self aligned gate". What is the requirement of self aligned gate? How it is achieved.
3. A MOS transistor has threshold voltage of 0.85 V. The body effect coefficient γ = 0.64. Calculate the threshold voltage for V_SB = 4V and 2φF = -0.58 V.
4. What do you understand by strong inversion in MOSFET?
5. Explain the electrical properties of the MOSFET, CMOS and BCMOS.
6. What is pass transistor? Explain with suitable example.

CONCEPTS OF PROGRAMMING & OOPS

CONCEPTS OF PROGRAMMING & OOPS
SEM V, 2012-13
B.TECH
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 2 Hours                                  

Total Marks: 50  

SECTION - A

Attempt any two of the following:

1. What is the difference between Abstract class and methods?
2.  What is the difference between Generalization and Multiple Inheritance?
3. What do you mean by aggregation? How many types of aggregation? 

ADVANCE MICROPROCESSOR / MICROPROCESSOR & CONTROLLERS

ADVANCE MICROPROCESSOR / MICROPROCESSOR & CONTROLLERS
SEM-V, 2012-13
B.TECH
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

  Time - 3 Hours

Total Marks : 100

SECTION A

Attempt any four questions:

1. List the three major components of microprocessor and explain in detail.
2. Explain the purpose of instruction decoder and program counter with suitable examples.
3. Explain the addressing mode of 8085 with suitable example.
4.  Draw and explain the pin diagram of 8086.
5. Explain the importance of HOLD and HLDA pin data transfer through DMA.
6. Draw the block diagram of 8081 and how it's differ from microprocessor, explain.

CONCEPTS OF PROGRAMMING &OOPS

concepts of programming &oops
B.TECH EXAMINATION
SEM v, 2011-12
UTTARAKHAND TECHNICAL UNIVERSITY(UTU)

Time: 2 hours

Total Marks : 50

Attempt any four of the following:

1. What is UNIX? Draw the structure of UNIX and explain its various components.
2. Write a shell  program that return "Good Morning", "Good Noon", "Good Evening" or "Good Night" depending on the time at which it is returning.
3. Explain the different shell of UNIX in detail.
4. Explain the various types of array with a suitable example.
5. Describe the various control statement with example.
6. Differentiate between function and procedure. Describe the  various numerical methods also.

DIGITAL SIGNAL PROCESSING (utu previous year question paper)

DIGITAL SIGNAL PROCESSING
SEM-V, 2011,12
B.TECH EXAMINATION
UTTARAKHAND TECHNICAL UNIVERSITY
(UTU)

Time: 3 hours

Total marks:100

Section A

Answer any four parts of the following:

1. What do you understand by digital signal processing? Explain the advantage and application of digital signal processing.
2. Find the response of an FIR with impulse response h[n] = [1,2,4] to the input sequence x[n] = [1,2] using Linear transformation method.
3. State and prove the following properties of DFT.
   (a) Circular time reversal
   (b) Circular time shift
4. Compute circular periodic convolution of the two sequences x₁[n] = [1,1,2,2] and x₂[n] = [1,2,3,4] using DFT & IDFT method.
5. State and prove "circular convolution" property of DFT.
6. Compute N point DFT of
   x(n) = {1,1,2,2,3,3} and compute the corresponding amplitude and phase spectrum.