$/$0/2013/03 COMPUTER APPLICATION Candidate should write his her RollNo. inthe boxabove. T ime : 2 Hours} Ne Roll No. BOOKLET NO. 3101 Total No. of Questions : 40 [Total Marks : 300 of Printed Pages 1 INSTRUCTIONS FOR CANDIDATES All questions are compulsory. Alf questions carry equal marks. The question paper contains 150 questions. The examinee should verify that the requisite number of questions are printed in the question paper, otherwise he should ask for another question paper. The cover page indicates the number of printed pages in the question paper. The examinee should verify that the requisite number of pages are attached in the question paper otherwise he should ask for another question paper. Read carefully the instructions given on the answer-sheet supplied and indicate your answers accordingly. Kindly make necessary entries on the answer-sheet only at the places indicated and nowhere else. Examinees should specially pay attention that 2 marks will be awarded for correct answer. Examinees should do all rough work on the space meant for rough work on the last page of the question paper and nowhere else, not even on the answer-sheet. $/S0/2013/032 Which of the following statements is true ? (A) ROM is a Read/Write memory (B) PC points to the last instruction that was executed (C) Stack works on the principle of LIFO (D) All instructions affect the flags Merge sort uses : (A) Divide and conquer strategy (B) Backtracking approach (C) Heuristic search (D) Greedy approach The principle of locality justifies the use of : (A) _ Interrupts (B) DMA (C) Polling (D) Cache memory Which of the following page replacement algorithms suffers from Belady’s anomaly ? (A) Optimal replacement (B) FIFO (Cc) LRU (D) Both (A) and (C) What is the distance of the following code ? 000000, 010101, 000111, 011001, 111111 (A) 2 ®B) 3 «c) 4 @M) 1 $/SO/2018/0310. 3 Which scheduling policy is most suitable for a time shared operating system ? (A) Shortest job first (B) Round Robin (C) FCFS (D) Elevator For merging two sorted lists of sizes m and n into a sorted list of size m + n, we requires comparisons of : (A) O(m)} (B) Of) iC) Otm +n) (D) Odogm + logn) The minimum number of edges in a connected cyclic graph on n vertices (A) a-l (B) on (C) ni () None of these The number of elements in the power set P(S) of the set S = {9, 1, (2, 3)} is: (A) 2 (B) 4 ©) 8 (D) None of these The capacity of a memory unit is defined by the number of words multiplied by the number of bits/word. How many address and data lines are needed for a memory of 4K x 16 : (A) 12 Address, 16 Data lines (B) 10 Address, 16 Data lines (C) 11 Address, 8 Data lines (D) 12 Address, 12 Data lines $/SO/2013/03 P.T.O.