Panjab University OCET ME Computer Science Model Question Paper : www.exams.puchd.ac.in

[hemalathaijt]

Panjab University
OCET 2011
Subject : M. E. (Computer Science and Engineering)
Time : 90 minutes Number of Questions : 75 Maximum Marks : 75

Model Question List : http://exams.puchd.ac.in/show-noticeboard.php
Model Question Paper : http://exams.puchd.ac.in/includes/no...125-13-MEC.pdf

1. Which of the following approach is used by the Merge sort algorithm ?
(A) Divide and conquer (B) Backtracking
(C) Heuristic Search (D) Greedy approach

2. In a set of n elements, for a relation to be reflexive, how many number of relations should be there ?
(A) 2n2 (B) 2n(n–1)
(C) 2(n)(n+1)/2 (D) 2n–3n(n–1)/2

3. Preprocessing is a phase of translation, which occurs :
(A) After Compilation and Linking (B) After Compilation but before linking
(C) Dynamically at Runtime only (D) Before Compilation

4. What will be the output of the following program ?
void main ()
{ int i, j;
i = 12;
j = ++i + i++;
printf (“\n % d % d”, i, j);
}
(A) 13 26 (B) 14 28
(C) 14 26 (D) 13 28

5. If integer needs two bytes of storage, then maximum value of an unsigned integer is :
(A) 216 – 1 (B) 215 – 1
(C) 216 + 1 (D) 2*216 – 1

6. a<<1 is equivalent to :
(A) Multiplying a by 2 (B) Dividing a by 2
(C) Adding 2 to a (D) Subtracting 2 to a

7. Which of the following algorithms has running time O(n2) in the worst case but O(nlogn) on average ?
(A) Bubble Sort (B) Tornament Sort
(C) Merge Sort (D) Quick Sort

8. The upper bound on T(n) = 3T(n/2) +n is :
(A) O(nlgn) (B) O(nlg3)
(C) O(n2) (D) O(nlgn+n)

9. Which one of the following statements is false ?
(A) Optimal binary search tree construction can be performed efficiently using dynamic programming
(B) Breadth-first search cannot be used to find converted components of a graph
(C) Given the prefix and postfix walks over a binary tree, the binary tree cannot be uniquely constructed
(D) Depth-first search can be used to find connected components of a graph

10. An error detecting code in which code is the remainder resulting from dividing the bits to be checked by a predetermined binary number, is known as :
(A) Cyclic redundancy check (B) Checksum
(C) Error detecting code (D) Error rate

11. Which address is the loopback address ?
(A) 0.0.0.1 (B) 127.0.0.0
(C) 127.0.0.1 (D) 255.255.255.255

12. As a frame travels through a routed network the MAC address will always :
(A) Change to reflect the current source and destination
(B) The source address will remain the same but the destination address will change
(C) The source address will change and the destination address will change
(D) Nothing changes

13. Which two of the following four regular expressions are equivalent ? (e is the empty
string.)
(i) (00) * (e + 0)
(ii) (00)*
(iii) 0*
(iv) 0 (00)*
(A) (i) and (ii) (B) (ii) and (iii)
(C) (i) and (iii) (D) (iii) and (iv)
14. What will be the output of the following Program ?
main ()
{
Int a = 10, b, c;
b = !a;
c = ~a;
printf(“%d%d”, b,c);
}
(A) 10 - 10 (B) 0 - 11
(C) -10 -10 (D) 0 0

15. Suppose that the set A contains 5 elements and the set B contains 2 elements. How many different functions f : A ? B can one define ?
(A) 10 (B) 25
(C) 16 (D) 32