#1
April 9th, 2015, 03:43 PM
| |||
| |||
M.Tech CS Entrance Exam Paper of PU
Hello sir I want to take admission in PU . so can you please provide me the M.Tech CS Entrance Exam sample Paper?
|
#2
April 10th, 2015, 02:48 PM
| |||
| |||
Re: M.Tech CS Entrance Exam Paper of PU
As per your request I am providing you some sample questions papers which will helps you a lot in preparation. Admission to following existing ME/MTech Programs will be made on the basis of GATE score. Following are the branches; ME in Electronics and Communication Engineering ME in Computer Science and Engineering ME in Information Technology MTech in Microelectronics Some of the sample questions are: 1. The binary number 10011101 is equal to the hexadecimal number (a) 103 (b) 76 (c) 67 (d) . - 67 • 2. The probability that a le~p year has 53 •Sundays is• (a) 1/7 (b) 2/7 (c) 5/7 (d) 6/7 3. Consider the SOTS for the following AND operation : 1 E --7 Ell) AND M E(2 ) '1.. The missing term at [:=J must be (a) -E(l) .True (b) Ell). False (c) E( 2 ) .False (d) None of the above 4. Let a, b, .c be non.:.zero real numbers such that -( Then the qua dratic equation ax 2 +bx+ c = •O has (a) a double root in (0, 2) (b) at least one root in (0, 2) (c)" no root in .(0, •2) (d) two imaginary ront~ 1 (1 COSS x)(ax 2 +bx+ tj dx = f 2 .f (1 +COSS x)(ax 2 +bx+ tj dx 0 0 . 5. Consider the following two theorems involving a language Land [, (complement of L)': (i) T,he complement of a recursive language is recursive. (ii) If a language Land its complement L are both recursively enume.rable, then L (and Which one of the following does not logically follow from theorems (i) and (ii)? (a) Both l, •and l are recursive (b) One of L and l is recursive; the other is recursively enumerable (c) Neither L nor l is recursively enumerable (d) One of L and l is recursively enumerable but not recursive; the other is not hence l) is recursive. recursively enumerable 6 . Wnich one of the following is an optimal substructure property? (a) If Sis an optimal solution, then the components of Sare not necessarily optimal (b) If S is an optimal solution, then t})e components of S are not dependent to S (c) If S is an optimal solution, then the components of S are optirn~ solutions to (d) None of the above Below is the detailed attached file for complete syllabus: Below are the following attachments for more sample papers. All the best for exams!! |
|