#1
5th November 2014, 04:29 PM
| |||
| |||
JEST Question Paper
Hi I want the question paper of JEST exam so can you provide me?
|
#2
6th November 2014, 09:39 AM
| |||
| |||
Re: JEST Question Paper
As you want the question paper of JEST exam so here I am providing you JEST Question Paper Q 1. If a person has a meter scale and he has to measure a length of 50 m. Each time he measures the measurement lies from 99.8 to 100.2 cm. Estimate the net error, when takes measurement 50 times? (a) 0.2 cm (b) 0.4 cm (c) 0.82 cm (d) 10 cm. Q 2. If coherent source of light through A,B has wavelength λ such AB = 4λ . If the detector is moving along the loop of radius R such that R>> AB then if the radius is increased gradually what effect will it have on the no. of maxima detected by detector D? (a) increase (b) decrease (c) first increase than decrease (d) none Q 3. Slit separation = d Slit width = w A plane wavefront incident, when will the 3rd maxima will be missing (a) 3d = 2w (b) 2d = 3w (c) d = 2w Q 4. Find 0 lim z→ ( 2 ) ( 2 ) 2 Real z Img z z + (a) i (b) 1 (c)-1 (d) limit do not exist Q 5. If 2P −1 = Prime no. (a) P is a odd no. (b) P can composite no. (c) P is necessarily composite no. (d) P is Prime no. Q 6. Find the velocity of box (a) v cosθ (b) v sinθ (c) v tanθ Q 7. What is the volume of a sphere in 4-dimensional space of unit radius? (a) 2 16 π (b) 4 3 π (c) 4π i Q 8. A heard ball dropped from a 1 m height and rebounces to 95 cm. Calculate the total distance travelled by ball? (a) 1880 cm (b) 2160 cm Q 9. Evaluate 3 1 2 2 3 z π i z z i ⎫⎬ + − ⎭ ∫ (a) 0, (b) 2π i Q 10. If EM waveE is filed component along y in with magnitude Eo, travelling along x-axis with frequency w. represent this Ans. cos ( ) o E = E Kx − wt yλ Q 11. If an astronaut knows the maximum and min distance between the moon of a planet and the planet maximum orbital velocity of moon is know which quantity of the following can’t be calculated. A B A, B are known (a) mass of planet (b) mass of moon (c) Time of the orbit (d) semi major axis. Q 12. If P and q are two distinct prime numbers then how many divisors p2q3 have? Q 13. represent carnot cycle in T – S diagram Q 14. If proton and α − particle accelerated by same potential v, find the ratio of debroglie wavelength ? (a) 2 2:1 (b) 2:1 (c) 1 : 2 (d) none of these Q 15. The difference in arithmetic and geometric mean of two positive integer m and n is equal to 1. Then 2 m and 2 n are (a) perfect square (b) Q 16. Net capacitance (a) C1 +C2 +C3 (b) 1 2 3 1 1 1 C C C + + (c) 2 3 1 2 3 C C C C C + + Q 17. Two events are taking place at a distance 5 km with a time interval 5μ s. In an inertial frame. An observer observes two events as simultaneous. Determine the speed of observer. Q 18. Find the time taken for blue light λ = 400nm, to cover a distance of 80 km in optical fiber having refractive .Index = 1.6 Ans. 427 μ sec. Half question paper is in pdf file. |
#3
9th December 2014, 09:40 AM
| |||
| |||
JEST Question Paper
Can you provide me the question paper of JEST (Joint Entrance Screening Test) exam as I need it for my preparation for admission into the PhD courses?
|
#4
9th December 2014, 11:25 AM
| |||
| |||
Re: JEST Question Paper
Below I am providing you some questions of from question paper of JEST (Joint Entrance Screening Test) exam: JEST EXAMS [[(MEMORY BASED QUESTIONS) Q 1. If a person has a meter scale and he has to measure a length of 50 m. Each time he measures the measurement lies from 99.8 to 100.2 cm. Estimate the net error, when takes measurement 50 times? (a) 0.2 cm (b) 0.4 cm (c) 0.82 cm (d) 10 cm. Q 2. If coherent source of light through A,B has wavelength λ such AB = 4λ . If the detector is moving along the loop of radius R such that R>> AB then if the radius is increased gradually what effect will it have on the no. of maxima detected by detector D? (a) increase (b) decrease (c) first increase than decrease (d) none Q 3. Slit separation = d Slit width = w A plane wavefront incident, when will the 3rd maxima will be missing (a) 3d = 2w (b) 2d = 3w (c) d = 2w Q 4. Find 0 lim z→ ( 2 ) ( 2 ) 2 Real z Img z z + (a) i (b) 1 (c)-1 (d) limit do not exist Q 5. If 2P −1 = Prime no. (a) P is a odd no. (b) P can composite no. (c) P is necessarily composite no. (d) P is Prime no. Q 6. Find the velocity of box (a) v cosθ (b) v sinθ (c) v tanθ Q 7. What is the volume of a sphere in 4-dimensional space of unit radius? (a) 2 16 π (b) 4 3 π (c) 4π i Q 8. A heard ball dropped from a 1 m height and rebounces to 95 cm. Calculate the total distance travelled by ball? (a) 1880 cm (b) 2160 cm JEST Question Paper The syllabus for JEST M.Sc level Physics paper is the standard M.Sc Physics syllabus.In particular, it presumes that the candidates have taken basic courses in Mathematical Physics, Classical Mechanics, Electromagnetic Theory, Quantum Mechanics, Statistical Mechanics and some special subjects such as Condensed Matter Physics, Electronics, Nuclear Physics etc. The Physics question paper will be a multiple-choice question paper only. It will contain questions of two levels of difficulty. The first level will have 25 “easier” questions carrying 1 mark each. The second level will have 25 “difficult” questions carrying 3 marks each. Therefore, the test questions will have a total of 50 questions with 25 from each level, adding to a total maximum marks of 100. 40% questions will be from B. Sc. Level and 60% questions will be from M. Sc. Level. 1. Black-body radiation, at temperature Ti fills a volume V. The system expands adiabatically and reversibly to a volume 8V. The final temperature Tf = xTi, where the factor x is equal to (a) 0.5 (b) 2.8 (c) 0.25 (d) 1 2. A particle of mass m, constrained to move along the x-axis. The potential energy is given by, V(x)=a + bx +cx2, where a, b and c are positive constants. If the particle is disturbed slightly from its equilibrium position, then it follows that (a) it performs simple harmonic motion with period 2 (m/2c) (b) it performs simple harmonic motion with period 2 (ma/2b2) (c) it moves with constant velocity (d) it moves with constant acceleration 3. Consider a square ABCD, of side a, with charges +q, -q, +q, -q placed at the vertices, A, B, C, D respectively in a clockwise manner. The electrostatic potential at some point located at distances r (where r >> a) is proportional to (a) a constant (b) 1/r (c) 1/r2 (d) 1/r3 4. The general solution of dy/dx – y = 2ex is (C is an arbitrary constant) (a) e2x+Cex (b) 2xex+Cex (c) 2xex+C (d) ex2+C 5. As 0, lim _ _ _ __ _ sin ) sin 1 ln( is (a) (b) -(c) 1 (d) 0 6. If P^ is the momentum operator, and ^ are the three Pauli spin matrices, the eigenvalues of (^.P^) are (a) px and pz (b) px ipy (c) |p| (d) (px + py +pz) 7. Two parallel infinitely long wires separated by a distance D carry steady currents I1 and I2 (I1 > I2) flowing in the same direction. A positive point charge moves between the wires parallel to the currents with a speed v at a distance D/2 from either wire. The magnitude of an electric field that must be turned on to maintain the trajectory of the particle is proportional to (a) (I1-I2)v/D (b) (I1+I2)v/D (c) (I1-I2)v2/D2 (d) (I1+I2)v2/D2 8. An ideal gas of non-relativistic fermions in three dimensions is at a temperature of 0 K. When both the mass of the particles and the number density are doubled, the energy per particle is multiplied by a factor, (a) 2 (b) 1 (c) 21/3 (d) 1/21/3 9. The rotational part of the Hamiltonian of a diatomic molecule is (1/2 1)(Lx 2+Ly 2) + (1/2 2) Lz 2 where 1 and 2 are moments of inertia. If 1 = 22, the three lowest energy levels (in units of h2/4 2) are given by (a) 0, 2, 3 (b) 0, 1, 2 (c) 1, 2, 3 (d) 0, 2, 4 10. A particle of mass 1 gm starts from rest and moves under the action of a force of 30 Newtons defined in the rest frame. It will reach 99% the velocity of light in time (a) 9.9 x 103 sec (b) 7 x 104 sec (c) 0.999 sec (d) 0.7 sec Sample Questions – Theoretical Computer Science Unlike in Physics, there is only one paper. The test will focus on the following areas: Analytical Reasoning and Deduction, Combinatorics, Data Structures and Algorithms, Discrete Mathematics, Graph Theory, Principles of Programming In each of these areas, familiarity with the basics (including the necessary simple mathematics) is assumed and will be tested. There will be questions of both varieties – some requiring short answers as well as some involving detailed problem solving. Some text books which may help the candidate prepare for the test are listed below. The candidate is not expected to read all the books. There is no specified “portion” for the test; rather, the test is designed to check the applicant’s understanding of foundational aspects of computing. Suggested texts: 1. Elements of Discrete Mathematics - C.L. Liu 2. Discrete Mathematical Structures with Applications to Computer Science - Jean-Paul Tremblay and Ram P. Manohar 3. Compilers: Principles, Techniques and Tools - Alfred V. Aho, Ravi Sethi and Jefferey D. Ullman 4. Fundamentals of Data Structures - Ellis Horowitz and Sartaj Sahni 5. An Introduction to Data Structures with Applications - Jean-Paul Tremblay and P.G. Sorenson 6. Fundamentals of Computer Algorithms - Ellis Horowitz, Sartaj Sahni and S. Rajasekaran 7. The Design and Analysis of Computer Algorithms - Alfred V. Aho, John E. Hopcroft and Jefferey D. Ullman 8. Introduction to Algorithms - Thomas H. Cormen, Charles E. Leiserson and Ronald L. Rivest 9. How to Solve it by Computer - R.G. Dromey 10. Programming Languages - Concepts and Constructs, Ravi Sethi Sample Questions for JEST inTheoretical Computer Science: 1. Select the correct alternative in each of the following: (a) Let a and b be positive integers such that a > b and a2 - b2 is a prime number. Then a2 - b2 is equal to (A) a - b (B) a + b (C) a × b (D) none of the above (b) When is the following statement true? (A [ B) \ C = A \ C (A) If ¯ A \ B \ C = _ (B) If A \ B \ C = _ (C) always (D) never (c) If a fair die (with 6 faces) is cast twice, what is the probability that the two numbers obtained di_er by 2? (A) 1/12 (B) 1/6 (C) 2/9 (D) 1/2 (d) T(n) = T(n/2) + 2; T(1) = 1. When n is a power of 2, the correct expression for T(n) is: (A) 2(log n + 1) (B) 2 log n (C) log n + 1 (D) 2 log n + 1 2. Consider the following function, defined by a recursive program: function AP(x,y: integer) returns integer; if x = 0 then return y+1 else if y = 0 then return AP(x-1,1) else return AP(x-1, AP(x,y-1)) (a) Show that on all nonnegative arguments x and y, the function AP terminates. (b) Show that for any x, AP(x, y) > y. 3. How many subsets of even cardinality does an n-element set have ? Justify answer. 4. A tournament is a directed graph in which there is exactly one directed edge between every pair of vertices. Let Tn be a tournament on n vertices. (a) Use induction to prove the following statement: Tn has a directed hamiltonian path (a directed path that visits all vertices). (b) Describe an algorithm that finds a directed hamiltonian path in a given tournament. Do not write whole programs; pseudocode, or a simple description of the steps in the algorithm, will suffice. What is the worst case time complexity of your algorithm? 5. Describe two different data structures to represent a graph. For each such representation, specify a simple property about the graph that can be more efficiently checked in that representation than in the other representation. Indicate the worst case time required for verifying both of your properties in either representation. 6. Two gamblers have an argument. The first one claims that if a fair coin is tossed repeatedly, getting two consecutive heads is very unlikely. The second, naturally, is denying this. They decide to settle this by an actual trial; if, within n coin tosses, no two consecutive heads turn up, the first gambler wins. (a) What value of n should the second gambler insist on to have more than a 50% chance of winning? (b) In general, let P(n) denote the probability that two consecutive heads show up within n trials. Write a recurrence relation for P(n). (c) Implicit in the second gambler’s stand is the claim that for all sufficiently large n, there is a good chance of getting two consecutive heads in n trials; i.e. P(n) > 1/2. In the first part of this question, one such n has been demonstrated. What happens for larger values of n? Is it true that P(n) only increases with n? Justify your answer. 7. Consider the following program: function mu(a,b:integer) returns integer; var i,y: integer; begin ---------P---------- i = 0; y = 0; while (i < a) do begin --------Q------------ y := y + b ; i = i + 1 end return y end Write a condition P such that the program terminates, and a condition Q which is true whenever program execution reaches the place marked Q above. |
|