PAGES: 1 2 3 4 5 31. An all-pairs shortest-paths problem is efficiently solved using: (A) Dijkstra’ algorithm (B) Bellman-Ford algorithm (C) Kruskal Algorithm (D) Floyd-Warshall algorithm Answer: D 32. The travelling salesman problem can be solved in: (A) Polynomial time using dynamic programming algorithm (B) Polynomial time using branch-and-bound […]
PAGES: 1 2 3 4 5 For the 8-bit word 00111001, the check bits stored with it would be 0111. Suppose when the word is read from memory, the check bits are calculated to be 1101. What is the data word that was read from memory? (A) 10011001 (B) 00011001 […]
Pages: 1 2 3 4 5 Match the following: List – I List – II (a) Size-oriented metrics (i) uses number of external interfaces as one of the measurement parameter. (b) Function-oriented metrics (ii) originally designed to be applied to business information systems. (c) Extended Function Point Metrics (iii) derived […]
Pages: 1 2 3 4 5 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) […]
Pages: 1 2 3 4 5 Consider the given graph: 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 […]
Pages: 1 2 3 4 5 What is the output of the following program ? (Assume that the appropriate pre-processor directives are included and there is no syntax error) main() { char S[ ] = “ABCDEFGH”; printf (“%C”,* (& S[3])); printf (“%s”, S+4); printf (“%u”, S); /* Base address of […]
Pages: 1 2 3 4 5 How many strings of 5 digits have the property that the sum of their digits is 7 ? (A) 66 (B) 330 (C) 495 (D) 99 Answer: B EXPLANATION : Let n=7 and r=5. n+r-1Cr-1=330. Consider an experiment of tossing two fair dice, one […]
PAGES: 1 2 3 4 Given the recursively enumerable language (LRE), the context sensitive language (LCS), the recursive language (LREC), the context free language (LCF) and deterministic context free language (LDCF). The relationship between these families is given by (A) LCF Í LDCF Í LCS Í LRE Í LREC (B) […]
PAGES: 1 2 3 4 What is true about UML stereotypes ? (A) Stereotype is used for extending the UML language. (B) Stereotyped class must be abstract (C) The stereotype indicates that the UML element cannot be changed (D) UML profiles can be stereotyped for backward compatibility Answer: A Which […]
PAGES: 1 2 3 4 Consider a triangle represented by A(0, 0), B(1, 1), C(5, 2). The triangle is rotated by 45 degrees about a point P(–1, –1). The co-ordinates of the new triangle obtained after rotation shall be ……………… (A) A'(-1,√2 – 1), B'(-1,2√2 – 1), C'(3/2√2 – 1, […]