Pages: 1 2 3 4 5 11. Consider the following program: #include<stdio.h> main() { int i, inp; float x, term=1, sum=0; scanf(“%d %f”,&inp, &x); for(i=1;i<=inp;i++) { term=term*x/i; sum=sum+term; } printf(“Result=%f\n”,sum); } The program computes the sum of which of the following series? (A) x+x2/2+x3/3+x4/4+… (B) x+x2/2!+x3/3!+x4/4!+… (C) 1+x2/2+x3/3+x4/4+… (D) 1+x2/2!+x3/3!+x4/4!+… […]
How many committees of five people can be chosen from 20 men and 12 women such that each committee contains at least three women? (A) 75240 (B) 52492 (C) 41800 (D) 9900 Answer: B Explanation: We must choose at least 3 women, so we calculate the case of 3 women, […]
PAGES: 1 2 3 4 5 61. 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|SS1 (D) S→0S|1S|0|1 Answer: C 62. Given the following two statements: S1: If L1 and L2 are recursively enumerable languages over ∑, then L1⋃L2 and L1⋂L2 are also recursively […]
PAGES: 1 2 3 4 5 45. Requirements prioritization and negotiation belongs to: (A) Requirements validation (B) Requirements elicitation (C) Feasibility Study (D) Requirement reviews Answer: B 46. Adaptive maintenance is a maintenance which …………. (A) Correct errors that were not discovered till testing phase. (B) is carried out to […]
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 16. Which of the following is not a basic primitive of the Graphics Kernel System(GKS) ? (A) POLYLINE (B) POLYDRAW (C) FILL AREA (D) POLYMARKER Answer: B Explanation. Basic primitive of GKS are Polyline,polymarker, fillarea,text. 17. Which of the following statements is/are incorrect ? […]
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 […]