exams.puchd.ac.in M.E IT OCET Other Common Entrance Test Question Paper : Panjab University
University : Panjab University
Exam : OCET M.E IT Other Common Entrance Test
Document Type : Question Booklet
Website :exams.puchd.ac.in
Download Model/Sample Question Paper :https://www.pdfquestion.in/uploads/exams.puchd.ac.in/5533-20110620192847-12-MEI.pdf
Panjab IT OCET Question Paper
Question Booklet Series : A
Important : Please consult your Admit Card / Roll No. Slip before filling your Roll Number on the Test Booklet and Answer Sheet.
Related : Panjab University M.C.A OCET Other Common Entrance Test Question Paper : www.pdfquestion.in/5536.html
Subject : M. E. (Information Technology)
Time : 90 minutes
Number of Questions : 75
Maximum Marks : 75
DO NOT OPEN THE SEAL ON THE BOOKLET UNTIL ASKED TO DO SO
Instructions
1. Write your Roll No. on the Question Booklet and also on the OMR Answer Sheet in the space provided and nowhere else.
2. Enter the Subject and Series Code of Question Booklet on the OMR Answer Sheet. Darken the corresponding bubbles with Black Ball Point / Black Gel pen.
3. Do not make any identification mark on the Answer Sheet or Question Booklet.
4. To open the Question Booklet remove the paper seal (s) gently when asked to do so.
5. Please check that this Question Booklet contains 75 questions. In case of any discrepancy, inform the Assistant Superintendent within 10 minutes of the start of test.
Model Questions
1. A compiler which allows only the modified section of the source code to be recompiled is called :
(A) Incremental Compiler (B) Reconfigurable Compiler
(C) Dynamic Compiler (D) Selective Compiler
2. Storage mapping is done by :
(A) Loader (B) Linker
(C) Operating System (D) Compiler
3. Which of the following is loop optimizing technique ?
(A) Jamming (B) Unrolling
(C) Induction Variable Elimination (D) All of above
4. Which of the following is the most powerful parsing method ?
(A) LL(1) (B) Canonical LR
(C) SLR (D) LALR
5. A grammar that is both left and right recursive for a non-terminal is :
(A) Ambiguous
(B) Unambiguous
(C) Information is not sufficient to decide whether it is ambiguous or unambiguous
(D) Such a grammar does not exist
6. The disadvantage of dynamic RAM over static RAM is :
(A) Need to refresh the capacitor charge every once in two milliseconds
(B) Variable speed
(C) Higher power consumption
(D) Higher bit density
7. The number of instructions needed to add n numbers and store the result in memory using only one address instructions is :
(A) n (B) n+1
(C) n–1 (D) independent of n
8. Property of locality of reference may fail if a program has :
(A) Many conditional jumps (B) Many unconditional jumps
(C) Too many operands (D) All of the above
9. The XOR operator is not :
(A) Commutative (B) Associative
(C) Distributive over AND operator (D) None of the above
10. Any given truth table can be represented by a :
(A) Karnaugh Map (B) Sum of product of Boolean expressions
(C) Product of sum of Boolean expressions (D) All of the above
11. Dirty bit is used to show the :
(A) Page with corrupted data
(B) Wrong page in the memory
(C) Page that is modified after being loaded into cache memory
(D) Page that is less frequently accessed
12. The page replacement policy that leads to more page faults when the size of the memory is increased is :
(A) Optimal algorithm (B) LRU algorithm
(C) LRU approximation algorithm (D) FIFO
13. Size of virtual memory depends upon :
(A) Data bus (B) Address bus
(C) Size of secondary memory (D) Memory buffer register
14. Aging is technique used to :
(A) Increase the priority of processes that are waiting for long time
(B) Decrease the priority of processes that are waiting for long time
(C) Increase the priority of processes that are currently running
(D) Decrease the priority of processes that are currently running
15. Fence register is used for :
(A) CPU protection (B) File protection
(C) Memory protection (D) Deadlock avoidance
16. Set of regular languages over a given alphabet set is not closed under :
(A) Union (B) Complementation
(C) Intersection (D) None of the above
17. The basic limitation of an FSM is that :
(A) It can’t remember arbitrary large amount of information
(B) It sometimes recognizes grammars that are not regular
(C) It sometimes fails to recognize grammars that are regular
(D) All of the above
18. The recognizing capability of Non Deterministic Finite State Machine and Deterministic Finite State Machine :
(A) May be different (B) Must be different
(C) Must be the same (D) None of the above
19. Context Sensitive Grammars can be recognized by :
(A) FSM (B) DPDM
(C) NDPDM (D) Linearly bounded memory machine
20. The statement – “A Turing Machine can’t solve halting problem” is :
(A) True (B) False
(C) Still an open question (D) None of these