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.

Q29,p2,J15. What is the size of the 'total length field in IPv4 data gram?

a) 4 bits            b) 8 bits           c) 16- bits                         d) 32- bits.
Answer C

Q30,P2,J15. Which of the following are restriction in classless addressing?

A) The number of addresses needs to be a power of 2.
B)The mask  needs to be included in the address to define the block.
C) The starting address must be divisible by the number of addresses in block.
D) all of the above.
Answer D.

Q28,P2,J15.Which of the following is not associated with the session layer?

A) Dialog control.
B)Token management.
C)Semantics of the information transmitted.
D)Synchronization.

Answer C.

Q27,P2,J15. Match the following port numbers with their uses.

List i.	List ii.
A. 23	1. world wide web
B. 25	ii. Remote login
C. 80	iii. Usenet News.
D.119	Iv Email.

                A             B             C             D

a)            iv             I               ii              iii

b)            ii              I               iv             iii

c)            ii              iv             iii             i

d)            ii              iv             I               iii.

Answer  d.

Q 26,p2,J15 .Which of the following protocols is an layer protocol that establishes,manages and terminates multimedia sessions?

A) Session maintenance protocol.
B) Real time streaming protocol.
C) Real time transport control protocol.
D) Session initiation protocol.
Answer D.

Q25,P2,J15. To determine the efficiency of an algorithm the time factor is measured by:

A) Counting micro seconds.
B)Counting number of key operations.
C)Counting number of statements.
D)Counting kilobytes of algorithm.

Answer B

Q24,P2,J15. .The average case occurs in the linear search algorithm when.

A) The item is searched is in some where middle of array.
B) The item to be searched is not in array.
C) The item is to be searched is in the last of array.
D) The item to be searched is either in the last or not in the array.

Answer A.
Explanation.
 let there are n elements to be searched linearly.
1st element will take 1 search.
2nd element will take 2 search.
--
--
n th element will take n search.

Average search will take. (1+2+3-----n)/n
= n(n+1)/2n  hence approximately  n/2.
when  item is not there it will search whole list.
last element will take n search  time.
Hence option A is the correct

Q23, P2,J15. Level order traversal of a rooted tree can be done by starting from root and performin

A) Bradth first search. B) Depth first search     C) root search                       D) Deep serach.

Answer A.

Q22,p2,j15. The inorder and preorder traversal of a binary tree are dbcafeg and abdecfg the post order traversal is--------------------.

A) dbefacg                B)debfagc                      C)dbefcga                            D)debfgca.
Answer D.

Explanation.

Q21,P2,J15. Consider the given graph.

1-2-> 28
2-3->16
3-4->12
4-5->22
5-6->25
6-1->10
2-7->14
7-4->18
7-5->24.

its minimum cost spanning tree is---------------------.

Answer B.
Explanation.

Kruskal algo arrange weights in ascending order.

6-1->10
3-4->12
2-7->14
2-3->16
7-4->18
4-5->22
7-5->24
5-6->25
1-2->28.
put all the nodes in ascending order so that it does not form a circuit.untill all the nodes are traversed.
so nodes are.
6-1,3-4,2-7,2-3,4-5,5-6,1-2. it avoids 7-4 and 7-5  to avoid the circuit.

Q20,p2,J15. For a weak entity set to be meaningful,it must be associated with another entity set in combination with some of their attributes values ,is called as

A) NEIGHBOURING SET         B) STRONG ENTITY SET    C)OWNER ENTITY SET D)WEAK SET
Answer  C.

Q19,p2,j15. Data base applications were built directly on top of file system to overcome the drawbacks of using file systems.

1. Data redundancy and inconsistency.
2. Difficulty in accessing data.
3. Data isolation.
4. Integrity problem.
Options.
A) 1.    B). 1,4               C). 1,2,3                D ) 1,2,3,4

Answer D.

Q18,p2,j15. Drop table cannot be used to drop a table referenced by foreign key constraints.

1) Primary key.   (2) Sub key           (3) super key               (4)   Foreign key.
Option.
A)1     B)1 and 4.             C)4        D) 1 and 4.
Answer C.

Q17,P2,J15 Which of the following concurrency protocol ensures both conflict serializability and freedom from deadlock?

A) 2 Phase locking       B)Time stamp ordering                    
C) Both A and B         D) neither A nor B.
Answer B.

Q16,p2,J15. An expression is a predicate expressing a condition, we wish database to always satisfy. The correct syntax for assertion is

A) CREATE ASSERTION 'ASSERTION NAME'  CHECK 'PREDICATE'

B)  CREATE ASSERTION 'ASSERTION NAME'
C)CREATE ASSERTION   CHECK 'PREDICATE'
D)SELECT ASSERTION.

Answer A.
Explanation.

1. An assertion is a predicate expressing a condition we wish the database to always satisfy.
2. Domain constraints, functional dependency and referential integrity are special forms of assertion.
3. Where a constraint cannot be expressed in these forms, we use an assertion, e.g.
   • Ensuring the sum of loan amounts for each branch is less than the sum of all account balances at the branch.
   • Ensuring every loan customer keeps a minimum of $1000 in an account.
4. An assertion in DQL-92 takes the form,
   

    create assertion  assertion-name check predicate

Q15. p2,J15. When inheritance is private , private methods in base class are-------------------------in the derived class(in c++)

A) Inaccessible             B)Accessible             C)Protected                 D)Public

Answer A

Q14. Which of the following is incorrect in C.

A) when we write the overloaded function , we must code the function for each usage.
B) when we write function template, we code the function only once.
C) It is difficult to debug macros.
D) Template are more efficient than macros.

Answer A.

Q13,p2,J15. Given that x=7.5. j=-1.0,n=1.0 m=2.0 the value of --x+j==x>n>=m is:

A)0                        B)1                                           C)2                                      D)3.
Explanation.

--(x)+-1.0==7.5>1>=2.
5.5==7.5>0 (as 1>=2 is false).
6.5==1.(as 7.5>0).
6.5==1 is false.

Q12,P2,J15. Which of the following C++ is inherited in a derived class from base class?

A) Constructor           B) Destructor                   C)Data memebers                 D) Virtual methods.

Answer C

Q11.p2,j15. What is the output of the following program?

main()
{char S[]="ABCDEFGH";
printf("%c",*(&S[3]));
printf("%s",S+4);
printf("%u",S);
/* base address of S is 1000.*/
}
A) ABCDEFGH1000       B)CDEFGH1000             C)DDEFGHH1000           D)DEFGH1000.

Answer D.

Explanation.
S[0]=A  at address 1000.
S[1]=B at address 1001.
S[2]=C at address 1002.
S[3]=D. at address 1003.
S[4]=E. at address 1004.
S[5]=F
S[6]=G
S[7]=H.

printf("%c",*(&S[3])); prints character at subscript S[3].
printf("%s",S+4); prints from base address 1000+4.
printf("%u",S); prints base address.

Q10,p2,J15.Consider a proposition given as:

x>=6 if x²>=25 and its proof as :

if x>=6 then x.x=36>=25.

Which of the following is correct  wrt to given proposition and its proof.?

1.       The proof shows the converse of what is to be proved.

2.       Proof starts by assuming what is to be shown.

3.       Proof is correct and there is nothing wrong.

Options

A)     1 only    B)3 only                C) 1 and 2.           D)2 only.

Answer .B.

Explanation.

Proof says any number greater than or equal to 6, its  square is greater than or equal to 25.

6x6>25. 7x7>25-------.

Proposition 1 Fails because it does not prove that  number (6,7,8---) square is not greater than 25.

Proposition 2 fails because there is no requirement of assumption as numbers are already given.

Proposition 3 is correct.

Q9,p2,j15. Match the following.

List I	List II.
(P->q)<->(~q->~p)	1.       Contra Positive.
[(p^q)->r]<->[p->(q->r)]	2.       Exportation law.
(p->q)<->[(p^~q)->0	3.       Reduction ad absurdum
(p<->q)<->[p->q)^(q^p)]	4.       Equivalence.

Codes.

                A             B             C             D

A)           1.            11.          111.        Iv.

B)            ii.             Iii.           I               iv.

C).          iii.            Ii.            Iv.           i.

D)           iv             ii.             Iii.           i.

Answer  D.

Q7,p2,j15. Consider a full adder with the following input values:

1) x=1,y=0 and c1(input carry)=0
2) x=0,y=1 and c1=1.
Compute the value of S(sum) and c (carry out) for the above input values.

A) S=1 , C=0  and S=0 ,C=1.
B)S=0, C=0 and S=1 ,C=1.
C)S=1,C=1 and S=0 ,C=0
D)S=0,C=1 and S=1 ,C=0.

Answer. A.

Explanation.
Assume it, that it is written like (Carry,Sum.) in binary that is weighted.
X          Y  Carry(in)   C Sum
0+         0+0= 0           0   0.
0+         0+1=   1         0   1.
0+          1+0=  1          0   1.
0+           1+1=(2)        1    0.
1+           0+0=1=        0    1
1+           0+1=(2)       1    0.
1+           1+0=(2)       1    0.
1+           1+1=(3)       1     1.

Q6. p2,J15. Consider the following statements.

1. Boolean expressions and logic networks corresponds to labelled  a cyclic diagraphs
2. Optimal Boolean expressions may not  corresponds to simplest network.
3. Choosing essential block first in a Karnaugh map and then Greedily choosing the largest remaining blocks to cover may not give an optimal expression.
Which of the statement(s) is /are correct ?
A) 1 only            B) 2 only        C) 1 and 2     D) 1,2& 3.

Answer D

Q5,p2,j15. Consider a Hamiltonian graph(G) with no loops and parallel edges . Which of the following is true with respect to Graph G?

1). Deg(v)>=n/2  for each vertex of G.

2).|E(G)>=1/2(n-1)(n-2)+2 edges.

3.)Deg(v)+deg(w)>=n for every v and w not connected by an edge.

Options.

A)     1and 2.                 B)2 and 3             C)1 and 3             D)1,2, 3

Answer D.

Q4,P2,J15. Consider the following statements:

1. depth  first search is used to traverse a rooted tree.
2. Pre order.post order and inorder are used to list the vertices of an ordered rooted tree.
3. Huffman algorithm is used to find an optimal binary tree with given weights.
4. Topological sorting provides a labelling such that the parents have larger labels than their children.
Which of the above statements are true?
A) 1,2        B)3,4              C)1,2,3        D)1,2,3,4.
Answer C.

Q3,P2,J15. In how many ways can 15 indistinguishable fish be placed into 5 ponds,so that each pond contains at least one fish.

A) 1001      B)3876        C)775            D)200.
Answer. A.
Explanation.

¹⁵C₁x¹⁴C₄/15

Q2,P2,J15. Consider an experiment of tossing two fair dice, one black and one red. What is the probability that the number on the black die divides the number on red die?

A)22/36        B)12/36        C)14/36        D)6/36.

Answer C.

Explanation.

Black die can have no  from 1-6 , total 6ways arrangement and red die can be arranged 6 ways.

Total cases= 6x6=36.

If black dice wins 1. Then it divides  all cases of  winning numbers of red dice. (1,2,3,4,5,6 numbers) so total 6 options.

If black dice wins 2. Then it divides    winning numbers of red dice. (2,4,6 numbers) so total 3.

If black dice wins 3. Then it divides  cases of  wining numbers of red dice. (3,6 numbers) so total 2.

If black dice wins 4. Then it divides  cases of  wining numbers of red dice. (4number) so total 1.

If black dice wins 5. Then it divides   cases of  wining numbers of red dice. (5 number) so total 1.

If black dice wins 6. Then it divides   cases of  wining numbers of red dice. (6 number) so total 1.

Total possible cases are (6+3+2+1+1+1)=14

Probability=14/36.

Q1,P2,J15. How many strings of 5 digits have the property that the sum of digits is is 7.

A)     66           B)330     C)495     D)99.

Answer B.

Explanation.

Let 5 digits ABCDE then their sum is 7.

Let n=7 and r=5.

^n+r-1C_r-1=330.

Q75,p3,j15. The unix command:

$vi file1 file2
A) edits file1 and stores the contents of file1 in file 2.
B)Both  files can be edited using ex command to travel between the files.
C) Both files can be edited using mv command to move between the files.
D)Edits file1 first, saves it and then edits file 2.

Answer B.

Q74,p3,j15. WOW32 is a:

A) win 32 API library for creating process and threads.
B)Special kind of file system to the NT name space.
C)Kernel mode objects accessible through win 32API.
D)Special execution environment used to run 16 bit windows application on 32 bit machines.

Answer D. 

Q73,p3,J15. Match the following for unix system calls:

List I	List II
A. Exec	I. Creates a new process.
B. Brk	ii. invokes another program  overlaying memory space  with a copy of executable file.
C. Wait	Iii.To increase or decrease the size of data region.
D. fork	Iv. A process synchronize with termination of child.

Codes

                A             B             C             D

A)           ii              iii             iv             I

B)            iii             ii              iv             I

C)            iv             iii             ii              I

D)                        iv             iii             I               ii.

Answer A

Q71, P3,J15.Let A and B be two fuzzy integers defined as:

A={(1,0.3),(2,.6)(3,1),(4,.7),(5,.2)}

B={(10,.5),(11,1),(12,.5)}.

f(A+B) is [N= max.

Min.]

Options

A) {(11,.08),(13,1),(15,1)}

B){(11,0.3),(12,0.5),(13,1),(14,1),(15,1),(16,0.5),(17,0.2)}

C){(11,0.3),(12,0.5),(13,0.6)(14,1),(15,1)(16,.5),(17,0.2).

D){(11,0.3),(12,0.5),(13,0.6),(14,1),(15,0.7),(16,0.5),(17,0.2).

Answer D.

f(A+B)= ((1+10,min(.3,.5)),((1+11),min(.3,1)),(1+12)min(.3,.5).

((2+10, min(.6,.5)),((2+11),min(.6,1)),((2+12)min(.6,.5)),

((3+10, .5),(14,1),(15,.5).

(4+10,.5),(4+11,.7),16(.5)

(5+10,.2),(16,.2),(17,.2)}.

after finding the minimum of A+B, find the max of duplicates.

{(11,.3),(12,max(.3,.5)),(13,max(.3,.6,.5)),(14,max(.5,1,.5)),(15,max(.5,.7,.2)),(16,max(.5,.2)),(17,.2).

so

{(11..3),(12,.5),(13,.6),(14,1),(15,.7),(16..5),(17,.2).

Q70,P3,J15.Consider the two class classification task that consist of following points.

Class c1=[1,1.5][1,-1.5].

Class C2=[-2,2.5][-2,-2.5].

The direction boundary between the two classes using single perceptron is given by.

Options

1. X1+X2+1.5=0
2. X1+X2-1.5=0
3. X1+1.5=0
4. X1-1.5=0

Answer C.

Explanation.

Q65,p3,j15 . Redundancy in images stem from :

A)Pixel de  Correlation.                  B)Pixel correlation.             C)Pixel quantization.    D)Image  size. Answer B.

Q64,P3,J15. Given the symbols ABCDEFGH with probabilities 1/30,1/30,1/30,2/30,3/30,5/30,5/30,12/30. respectively. The average Huffman code size in bits per symbol is:

options.
A) 67/30        B)70/30           C) 76/30                       D) 78/30.
Answer C.
Explanation.

Q63,p3,j15. Given the following grammar.

A->aA|ε.
B->bB/ε.
G1: S->AB|aaB.
G2:S->A|B.
A->aAb|ab.
B->abB|ε.
Which is correct.
options.
A) G1 is ambigious and G2 is unambigious.
B)G1 is unambigious and G2 is ambigious.
C) Both are ambigious.
D) Both are unambigious.

Answer C.

Explanation.
Let the string is aab.
it can be derived by.
S->AB->aAB->aaAB->aaεB->aaεbB->aaεbε.
and
we can derive in this way also.
S->aaB->aabB->aabε.
G1 is ambigious because we have two different tree structure.

Similarly G2.
let w=ab.
then S->A->ab.
and
S->B->abB->abε.
so we get two tree for a same string. so G2 is also ambigious.

Q62,p3,j15. Given the following statements.

S1.: If L1 and L2 are recursively enumerable language over ∑,then L1U L2 and L1^ L2 are also recursively enumerable.
S2: The set of recursively enumerable language is countable.
Which of the following is correct

Options
A) S1 is correct and S2 is not correct.
B)S1 is not correct and S2 is correct.
C)Both are not correct.
D)Both S1 and S2 are correct.

Answer D.

Q 61,p3,j15. A context free grammar for L={w|n0(w)>n1(w)} is given by:

A) S->0|0S|1SS.
B) S->0S|1S|0SS|1SS|0|1.
C)S->0|0S|1SS|S1S|SSI.
D)S->0S|1S|0|1

Answer C.

Q59.P3,j15. Match the following with respect to heuristic search techniques.

List i	List ii.
A.      Steepest Ascent hill climbing.	1.       Keeps track of all partial paths, which can be candidate for further exploration.
B.      Branch and bound	2.       Discover problem state that satisfy a set of constraints.
C.      Constraint satisfaction	3.       Detect difference between current state and goal state.
D.      Means end analysis	4.       Consider all moves from the current state and selects best moves.

Codes.

 A             B             C             D

a)      I               iv             iii             ii

b)      Iv            I               ii              iii

c)       I               iv             ii              iii

d)      Iv            ii              I               iii.

Answer B.

Q58,P3,j15Which of the follwing statement is true for branch and bound search?

A)Underestimates of remaining distance may cause deviation from optimal path.
B)Overestimates can't cause right path to be overlooked.
C) Dynami programming principle can be used to discard  redundant partial paths.
D) All of the above.
Answer D.

Q57,P3 ,J15. In propositional logic p<-->Q is equivalent to ( Where ~ is Not):

A)~(pvq)^~(qvp).

B)(~pvq)^(~qvp).

C)(pvq)^(qvp).

D)~(p->q)->~(q->p).

Answer B.

Explanation.

P<->Q= (P->Q)^(Q->P).

We know A->B is ~AvB.

Q56 p3,j15. Match the following.

List  i	List ii
A.      frames	1.       record like structure for grouping closely related knowledge.
B.      Conceptual dependencies	2.       Structure and primitive to represent sentences.
C.      Associative Networks	3.       Pictorial representation  of objects ,their attributes.
D.      Scripts	4.       To describe real world  stereo type events.

Answer A1, B2 c3,D4

Q55,p3,J15

List 1	List ii
A.      Intelligence.	1.       Contextual,tacit,transfer needs learning.
B.      Knowledge	2.       Scattered facts,easily transferable.
C.      information	3.       Judgemental.
D.      Data	4.       Codifiable,relevant and purpose.

Options.

A             B             C             D.

a)            iii.            i.              ii.             iv.

b)            iii.            i.              iv.           Ii.

C)            iv             iii.            Ii.            i.

D.            ii              iii.            Iv.           I

Answer B

Q54,p3,J15. A unix file may be of type.

A) Regular file             B) directory File.             C) Device file                D) Any one of them.

Answer D.

Q53,p3,j15. In ________________ allocation method for disk block allocation in a file system ,insertion and deletion of block in a file is easy.

A. Index    B. Linked  C. Contigous  D. Bitmap.
Answer A.

Q52,P3,J15. Dining Philospher problem is a.

A) Producer consumer problem.
B)Classical IPC problem.
C) Starvation Problem.
D)Synchronization primitive.

Answer B.

Q51,P3,J15. What is the most appropriate function of memory management unit.?

A. it is an associated memory to store TLB.
B. It is a technique of supporting multiprogramming by creating dynamic partitions.
C. It is a chip to map virtual address to physical address.
D. It is an algorithm to allocate and deallocate main memory to a process.

Answer B.

Q50,P3,J15. Which of the following statements is not true for multi level feedback queue processor scheduling algorithm?

A) Queues have different priorities.
B) Each queue may have different scheduling algorithms.
C)Processes are permanently assigned to  a queue.
D.)This algorithm can be configured to match a specific system under design.
Answer C.

Q 49,p3,j15. Match the following

List 1	List ii
A.      Spooling	1.       Allows several jobs in memory to improve cpu utilization.
B.      Multiprogramming	2.       Access to shared resources among geographically dispersed  computers in a transparent way.
C.      Time sharing	3.       Overlapping I/o and computation.
D.      Distributed computing	4.       Allows many users to share a computer simultaneously by switching  proessors frequently.

Options.

A             B             C             D.

a)            iii.            i.              ii.             iv.

b)            iii.            i.              iv.           Ii.

C)            iv             iii.            Ii.            i.

D.            ii              iii.            Iv.           I

Answer B

Q48,p3,j15. A software design is highly modular if:

A) Cohesion is functional and coupling is data type.
 B)Cohesion is coincidental and coupling is data type.

c) Cohesion is sequental  and coupling is content type.
D) Cohesion is functional and coupling is stamp type.
Answer A.

Q47,p3,j15. A design concept refinement is a.

A) Top down Approach.
B) Complimentary of abstraction concept.
C)Process of elaboration.
D)All of the above.
Answer D

Q46,p3,j15.Adaptive maintenance is a maintenance which---------------------------------------

A)correct errors that were not discovered till testing phase.
B) is carried out to port the existing software to new environment.
C)improves system performance.
D)both b.c
Answer D.

Q45,p3,j15, Requirement prioritisation and negotiation belongs to.

A) requirement validation.
B) Requirement elicitation.
C)Feasibility study.
D)Requirement reviews.

Answer B.

Q44,P3,J15 Which design metric is used to measure the compactness of the program in terms of line of code.?

A) Consistency.
B) Conciseness.
C) Efficiency.
D) Accuracy.

Answer B.

Q43,p3,j15. Verification.

A) Refers to the set of activities that ensure that software correctly implements a specific function.
B)Give answers to questions- Are we building the product right.
C)requires execution of software.
D) Both A,B
Answer D

Q42,p3,j15.Module design is used to maximize cohesion and minimize coupling. which one of the follwing is the key to implement this rule.

A) Inheritance.
B)Polymorphism .
C)Encapsulation.
D) Abstraction.
Answer C.

Explanation.

The basic idea underlying modular design is to organize a complex system (such as a large program, an electronic circuit, or a mechanical device) as a set of distinct components that can be developed independently and then plugged together. Although this may appear a simple idea, experience shows that the effectiveness of the technique depends critically on the manner in which systems are divided into components and the mechanisms used to plug components together. The following design principles are particularly relevant to parallel programming.  Ensure that modules hide information.

• related functions that can benefit from a common implementation or that are used in many parts of a system,

• functionality that is likely to change during later design or deployment,

• aspects of a problem that are particularly complex, and/or

• code that is expected to be reused in other programs.

The benefits of modularity do not follow automatically from the act of subdividing a program. The way in which a program is decomposed can make an enormous difference to how easily the program can be implemented and modified. Experience shows that each module should encapsulate information that is not available to the rest of a   program. This information hiding reduces the cost of subsequent design changes. 

Q41,p3,j15. In XML, DOCTYPE declaration specifies to include a reference to --------------------- file.

A) Document type definition.
B) Document type declaration.
C) Document transfer definition.
D)Document type language.

Answer A.

Q40,P3,J15. in XML we can specify the frequency of an element by using symbols

A) +*!
B)#*!
C)+*?
D)-*?
Answer C.
explanation.

+ symbol for one or more time.
* for 0 or more time.
? for zero or more time.

Q39,p3,j15.Which one of the follwing is correct?

A)Java applet canot be written in any programming language.
B)An applet is not a small program.
C)An applet can be run on its own.
D)Applet are embedded in another application.
Answer D

Q38,p3,J15.The servelet response interface enables a servelet to formulate a response for a client using method-------------------

a) void log(Exception e,String S).
b) void destroy()
c)int get server port()
d) void set context type(string type)

Q37,p3,j15. In Java, when we implement an interface method, it must be declared as

A) Private
B)protected.
C)Public.
D)Friend
Answer C.

Q36,p3,J15. The number of nodes of height h in any n element heap is--------

A) h
B)2^h
C) ceil(n/2^h)
D)ceil(n/(2^(h+1)).
Answer D.

let f(n) and g(n) be asypotically non negative functions . Which of the follwing is correct.

A) ϴ(f(n)*g(n)=min(f(n),g(n).
B)ϴ(f(n)*g(n))=max(f(n),g(n).
C)ϴ(f(n)+g(n))=min(f(n),g(n). 
D)ϴ(f(n)+g(n))=max(f(n),g(n).
Answer D.