#1
1st June 2016, 05:30 PM
| |||
| |||
Nagarjuna University Phd Entrance Model Papers
Can you please give here Model Question paper for PHD in CSE entrance test of Acharya Nagarjuna University (ANU)?
|
#2
2nd June 2016, 08:43 AM
| |||
| |||
Re: Nagarjuna University Phd Entrance Model Papers
As you requires i am here giving you Model Question paper for PHD in CSE entrance test of Acharya Nagarjuna University (ANU). PHD in CSE Entrance Test Paper : 1. One way of showing that one string is equal to another string is to compare and match them character by character. What happens if we allow both the strings to be of i,nfinite length? A. The method fails because we can only show that the two strings are not equoJ. B. The method tails because we can only show that the two strings are equal. C. The method works correctly and tells if the strings are equal or not. D. The method works only if the strings are nurneric. 2. In the C Programming Language, arrays can be defined in two ways. The first is static: int a[4000] [3000]; the second is dynamic: declare as int *{rdi and then allocate memory using malloc O . Which of the following is then TRUE? A. In the first case, memory is cont'iguous while in the second ca.se, memory is not contiguous. B. In the first case, elements may be aceessed as a[i] [j], while in the second, they cannot be accessed so. C. Irr the first case, the array elernents are stored in rour-major order, while in the second t-h"y are stored in column-major order. D. None of the above. 3. If. fl,edbility rs defined a.s having ma>cirnum choice in cache placement, which of the following is correctly ordered in ascending order of flexibility? A. Direct Mapping, Set-Associative Mapping, Associative Mapping B. Set-Associative Mapping, Direct Mapping, Associative Mapping C. Associative Mapping, Set-Associative Mapping, Direct Mapping D. None of the above. 4. Heap sort may be considered as A. Insertion sort done on a heap data structure instead of a list. B. Selection sort done on a heap data structure instead of a list. C. Bubble sort done on a heap data structure instead of a list. D. None of the above. 5. Which of the following is NOT a feature of the Von Neumann architecture? A. Storage space for prograrns. B. Storage space for data C. Unique next instruction for execution. D. Separating intructions from data. 6. The correct result of. Iedcograph'ically sorting 109, 20, LLg, 2,207, 27, t9 in ascending order is: A. 19, 109, Llg, 2, 20, 27, 207 B. 109, 119, 19, 2,2A,27,207 c. 109, 119, 19, 2,20,207,27 D. 2, 19, 20, 27, 109, 119 , 207 7. All IP addresses in the range 186.220.64.0 to 186.220.71.254 are kept in a VLAN. The correct netmask so that messages are broadcast only within this VLAN is A. 186.22A.255.255 B. 186.220.248.0 c. 186.220.248.255 D. 196.220.8.0 8. Which sentence can be generated by: S + aS I bA, A -> d I ccA A. aadb B. bccddd C. aabccd D. None of the above 9. Which sort uses features of the key to operate in I'inear time relative to the number of elements in the array? A. Quick Sort B. Merge Sort C. Radix Sort D. Bubble Sort 10. Convert EAEAEA in hexadecimal into octal. A. 76767676 B. 76737672 c. 76727672 D. 76575372 11. Which of the following decision procedures does NOT have exponential time complexity? A. Graph-colouringProblem B. Tbavelling Salesperson Problem C. Hamiltonian Circuit Problem D. Linear Programming Problem 12. Simplify the following boolean expressi on: 2ryz' + xy'z' + r'yz'? A. fry + A'z' + r'A B. fry + frz' + fi'zt C. (y + z')n D. (r + U)z' 13. Which of the following problems is solvable? A. Determining if a universal Thring machine and some input will halt B. Writing a universal Ttrring machine C. Determining if a universal Thring machine can be written in fewer than /c instructions for some /c D. Determining if an arbitrary T[ring machine is a universal Ttrring machine How many possible bytes have exactly three bits on (i.e., bit : true)? A. 8*7 B. 8*.7*6 C. 8x3 D. None of the above What is the value of ^F'( ) using the following procedure? function F(k: integer) : integer; begin if (t< else F := F(k-l) * f(k-2) + F(k-3); end; A.5 El.6 c.7 D.8 Address: Acharya Nagarjuna University Nagarjuna Nagar Guntur, Andhra Pradesh 522510 |
#3
28th June 2018, 01:19 PM
| |||
| |||
Re: Nagarjuna University Phd Entrance Model Papers
Sir Please send answer Key of PHD entrance Exam
|