Q50,P2,J!5. Which of the following is not valid with reference to message passing interface MPI?

A) MPI can run on any hardware platform.
B)The programming model is a distributed memory model.
C) All parallelism is implicit.
D) MPI - Comm-Size returns the total number of MPI processes  in specified communication.
Answer C.

Q49,P2,J15. Which of the following is false about weak entity set?

A) weak entities can be deleted automatically when their strong entity is deleted.
B) Weak entity set avoids the data duplication and consequent possible inconsistencies caused by the duplicating  the key of strong entity.
C)A weak entity set has no primary keys unless attributes of the strong entity set on which it depends are included.
D)Tuples in a weak entity set are not partitioned according to their relationship with tuples in a strong entity set.
Answer D.

Q48,P2,J15. Which of the following algorithms sort n integers, having the range 0 to n^2 -1 ,In ascending order in O(n) time?

A) Selection Sort           B)Bubble sort               C) Radix Sort           D) Insertion sort

Answer C.

Q47,p2,J15.Which of the following statement is incorrect for the parallel virtual machine(PVM)?

A)The PVM communication model provides asynchronous blocking send,asynchronous blocking receive and non blocking receive function.
B)Message buffers are allocated dynamically.
C)The PVM Communication model assumes that any task can send a message to any other PVM task and that there is no limit to the size or number of such messages.
D) In PVM model, The message order is not preserved.

Answer D.

Q46,P2,j15. In the case of parallelization ,Amadhl's law states that if P is the proportion of a program that can be made parallel and (1-p) is the proportion that cannot be parallelized , Then the Maximum speed up that can be achieved by using N process is:

A) 1/((1-p)+Np)         B.) 1/((N-1)p+p)            C.)1/((1-p)+P/N)         D.) 1/(P+(1-P)/N)
Answer D.

Q45.P2.J15 Which one from the following is highly associated activity of project planning?

a) Keep track of the project progress.
b)Compare actual and planned progress and costs.
c)Identify the activities, milestones and deliverables product by a project.
d) both b & C.

Answer D

Q44,P2,J15 Cohesion is an extension of:

A) abstraction concept         B) Refinement concept.            C) Information Hiding concept  D) Modularity.
Answer D

Q43,P2,J15. Which process model is also called as classic life cycle model?

A) Water fall model         B)RAD model                 C)Prototyping model                       D)Incremental model.

Answer A.

Q42. In which testing strategy requirements established during requirements analysis are validated against developed software.

A) Validation testing.            B)Integration testing               C)Regression testing          D)System testing

Answer A.

Q41,P2,J15 . Match the following

List i.	List ii.
A.      Size oriented metrics	1.       Uses number of external interfaces as one of the surest parameter.
B.      Function oriented metrics information.	2.       Originally designed to be applied to business systems.
C.      Extended function point metrics	3.       Derived by normalizing quality and/ or productivity.
D.      Function point	4.       Uses algorithm characteristics as one of the measurement parameter.

Codes.

                A             B             C             D.

A)           iii.            Iv.           i.              ii.

B)            ii.             i.              iv.           Iii.

C)            iv.           Ii.            Iii.           i.

D)           iii.            i.              iv.           Ii.

Answer D.

Q40,P2J15. The Unix Kernel maintains two key data structure related to processes, The process table and the user data structure. Which of the following information is not the the part of user structure.

A) File description table.             B) System call state.            C) Scheduling parameters      D ) Kernel stack.
Answer D.

Q39,p2,j15. What does the following command do?

grep  -vn "abc" x.
a) It will print all of the lines in the file x that match the search string "abc".
b) It will print all of the lines in the file x that do not match the search string "abc"
C) It will print the total number of lines in the file x that match the string "abc".
D)It will print the specific line number of file x in which there is a match for string "abc".

Answer B.

Q38,P2j15 A LRU page replacement is used with four page frames and eight pages. How many page faults will occur with the reference string 0172327103. if the four frames are initially empty.

A) 6               B) 7                       C) 5                     D) 8.
Answer B.

Explanation.
LRU-
Whenever a page is used it is stamped with a counter value. When a page is to be replaced page with lowest stamp value is selected as the victim.

0172    3  2  7 1  0  3.
0(1 page fault,Counter=1),1(2 page fault,Counter=2),7(3 page fault,Counter=3),2 (4 page fault,Counter=4).
0 is selected as the victim .and replaced by.3. now frame is.

3(5 page fault,counter=5),1(2 page fault,Counter=2),7(3 page fault,Counter=3),2 (4 page fault,Counter=4)
 2 is already in the  frame  so counter is increased.
3(5 page fault,counter=5),1(2 page fault,Counter=2),7(3 page fault,Counter=3),2 (4 page fault,Counter=6)
7 is already in the frame so counter  is increased.
3(5 page fault,counter=5),1(2 page fault,Counter=2),7(3 page fault,Counter=7),2 (4 page fault,Counter=6)
1 is already in the frame so counter is increased.
3(5 page fault,counter=5),1(2 page fault,Counter=8),7(3 page fault,Counter=7),2 (4 page fault,Counter=6)
0 is not in the frame  so counter 5 is the least so 3 is replaced by 0.and page fault is increased.
0(6 page fault,counter=9),1(2 page fault,Counter=8),7(3 page fault,Counter=7),2 (4 page fault,Counter=6)
3 replaces 2
0(6 page fault,counter=9),1(2 page fault,Counter=8),7(3 page fault,Counter=7),3 (7 page fault,Counter=10)

Q37,P2,J15. let P1 and P2 be two processes. R be the set of variables read from memory and W be the set of variables written to memory. For the concurrent execution of two process Pi and Pj which of the following condition is not true?

A) R(pi)^ W(Pj)=φ             B)W(pi)^ R(Pj)=φ             C) R(Pi)^R(Pj)=φ            D) W(Pi)^W(PJ)=φ

Answer  C.
Explanation.
Two process can read the data simultaneously.

Q36,P2,J15.A disk drive has 100 cylinders,numbered 0 to 99. Disk request come to the disk driver for cylinders 12,26,24,4,42,8,50 in that order. The driver is currently serving a request at cylinder 24. A seek takes 6msec per cylinder moved. How much seek time is needed for the shortest seek time first (sstf) algorithm?

A)0.984 sec          B)0.396 sec          C)0.738 sec                 d).42sec.

Answer D.

Explanation.

current position of head is at cylinder 24.
24->26->12->8->4->42->50.
total cylinders traversed are.(2+14+4+4+38+8)=70 cylinders.
1 cylinders is traversed in 6 ms.
70 cylinders are traveresed in 420ms.= 420s/1000=.42sec

Q35,p2,J15. Which phase of atom generates stream of atoms?

a) syntax analysis.         b) lexical analysis            c)code generator                 d) code optimization.

Answer B.

Q34,P2,J15. Which one of the following is false?

a) LALR parser is bottom up parser.
b)A parsing algorithm which performs a left to right scanning and a right most derivation is RL(1).
c) LR parser is bottom up parser.
d)In LL(1), The 1 indicates that there is a one symbol look ahead

Answer b.

Q33,p2,j15.If all the production rules have single non terminal symbol on the left side , the grammar defined is:

a) Context free grammar             b) Context sensitive grammar      c)unrestricted grammar     d) phrase grammar.

Answer A.

Q32. p2,J15. The translator which performs macro calls expansion is called:

a) macro processor         b)micro preprocessor           c) macro preprocessor          d) dynamic linker.

Answer c.

Q31,P2,J15. Match the following.

List i.	List ii.
A.Forward reference table	i.                     Assembler directive.
B.Mnemonic table	ii.                   Uses array data structure.
C. Segment register table.	iii.                  Contains machine OP code.
D.EQU	iv.                 Uses linked list data structure.

Codes

                A             B             C             D

a.            ii.             Iii.           Iv.           i.

b.            iii.            Iv.           Ii.            i.

C.            iv.            i.              iii.            Ii.

D.            iv.            Iii.           Ii.            i.

Answer A.