RTU Previous Exam Papers BE CS 3rd Sem Data Structure and Algorithms January 2013

RTU Previous Exam Papers BE CS 3rd Semester Data Structure and Algorithms January 2013 UNIT – I 1.(a) Explain time and space complexity of an algorithm and also explain big 0, omega and theta notation with graph. Define array as data structure and its operation. Write an algorithm to read a M x N matrix … Read more RTU Previous Exam Papers BE CS 3rd Sem Data Structure and Algorithms January 2013

RTU Previous Question Papers BE EC 3rd Sem Electronics Devices & Circuits January 2013

RTU Previous Question Papers BE EC 3rd Semester Electronics Devices & Circuits January 2013 UNIT – I 1. (a) State the mass-action law as an equation and in words. Explain why a contact difference of potential must develop across an open circuited p-n junction. (b) Explain the process of conductivity modulation. OR 1. (a) What … Read more RTU Previous Question Papers BE EC 3rd Sem Electronics Devices & Circuits January 2013

RTU Previous Question Papers BE 2nd Semester Physics July-2011

RTU Previous Question Papers BE 2nd Semester Physics July-2011 Unit-1 1. a) i) Describe the construction and working of Michelson inter Ferometer. How would you use it to measure the wavelength of monochromatic light? ii)  Show that the plane polarised and circularly polarised light are special case of elliptically polarised light. iii) The refractive indices of … Read more RTU Previous Question Papers BE 2nd Semester Physics July-2011

RTU Previous Question Papers BE ME 5th Semester Heat Transfer Dec-2011

RTU Previous Question Papers BE ME 5 th Semester Heat Transfer Dec-2011 (a) Develop general heat conduction equation in cartesian coordinates. Deduce the developed equation for the following cases : (i) Constant thermal conductivity (ii) no heat generation (iii) Steady state condition and (iv) Steady state conduction with no heat generation (b) Define and discuss … Read more RTU Previous Question Papers BE ME 5th Semester Heat Transfer Dec-2011

RTU Previous Question Papers BE EC 3rd Semester Data Structures and Algorithms Feb 2011

RTU Previous Question Papers BE EC 3rd Semester Data Structures and Algorithms Feb 2011   Unit-I 1.  a) Determine the frequency counts for all statements in the following program segments. i)    For (z =1 ;/<=»;i++) for (j = 1 ;j < = i ;j ++) for (k = l ;k< — j; k ++) x … Read more RTU Previous Question Papers BE EC 3rd Semester Data Structures and Algorithms Feb 2011

RTU Previous Exam Papers BE CSE 4th Semester Discrete Mathematical Structures July 2011

RTU Previous Exam Papers BE CSE 4th Semester Discrete Mathematical Structures July 2011   1.(a) Show that p->q = (~p)vq (b) Show that (pAq)—>(pvq) is a tautalogy. (c) Show that (p^q)-(pvq) is a contradiction. OR (a) Define the following (i)  Tautalogy (ii) Contradiction (iii) Contingency. (b) Check til® validity of following argument   2 (a) … Read more RTU Previous Exam Papers BE CSE 4th Semester Discrete Mathematical Structures July 2011