In the case of parallelization, Amdahl'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 processors is: (A) 1/((1-P)+N.P) (B) 1/((N-1)P+P) (C) 1/((1-P)+P/N) (D) 1/(P+(1-P)/N)

In the case of parallelization, Amdahl'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 processors is:

(A) 1/((1-P)+N.P)

(B) 1/((N-1)P+P)

(C) 1/((1-P)+P/N)

(D) 1/(P+(1-P)/N)
by

1 Answer

Answer :

(C) 1/((1-P)+P/N)
by

Related questions

A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Description : A set of processors P1, P2, ......, Pk can execute in parallel if Bernstein's conditions are satisfied on a pair wise basis; that is  P1 || P2 || P3 || ..... || Pk if and only if: (A) Pi || Pj for all i ≠ j (B) Pi || Pj for all i = j+1 (C) Pi || Pj for all i ≤ j (D) Pi || Pj for all i ≥ j

Last Answer : (A) Pi || Pj for all i ≠ j Explanation: Bernstein's Condition: 1. If process Pi writes to a memory cell Mi, then no process Pj can read the cell Mi. 2. If process Pi read from a memory ... Mi. 3. If process Pi writes to a memory cell Mi, then no process Pj can write to the cell Mi.

The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly coupled software and disk sharing, respectively. (B) Tightly coupled hardware on loosely coupled software and shared memory, respectively. (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Description : The distributed system is a collection of (P) and communication is achieved in distributed system by (Q) , where (P) and (Q) are : (A) Loosely coupled hardware on tightly ... message passing ,respectively. (D) Loosely coupled software on tightly coupled hardware and file sharing, respectively.

Last Answer : (C) Tightly coupled software on loosely coupled hardware and message passing ,respectively. 

What is the maximum clock speed of P III processors a. 1.0 GHz b. 1.1 GHz c. 1.2 GHz d. 1.3 GHz

Description : What is the maximum clock speed of P III processors a. 1.0 GHz b. 1.1 GHz c. 1.2 GHz d. 1.3 GHz

Last Answer : b. 1.1 GHz

Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1/50000, and that the proportion of people having stiff neck is 1/20. Then the percentage of people who had meningitis and complain about stiff neck is: (A) 0.01% (B) 0.02% (C) 0.04% (D) 0.05%

Description : Suppose that from given statistics, it is known that meningitis causes stiff neck 50% of the time, that the proportion of persons having meningitis is 1/50000, and that the proportion of people having stiff neck is 1/20. Then ... complain about stiff neck is: (A) 0.01% (B) 0.02% (C) 0.04% (D) 0.05%

Last Answer : Answer: B

................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n-2 (B) n + floor(lg n) - 2 (C) floor(3n/2) - 2 (D) 2 lg n – 2

Description : ................... comparisons are necessary in the worst case to find both the maximum and minimum of n numbers. (A) 2n-2 (B) n + floor(lg n) - 2 (C) floor(3n/2) - 2 (D) 2 lg n – 2

Last Answer : (C) floor(3n/2) - 2

Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Description : Consider the fractional knapsack instance n = 4, (p1, p2, p3, p4) = (10, 10, 12, 18), (w1, w2, w3, w4) = (2, 4, 6, 9) and M = 15. The maximum profit is given by (Assume p and w denotes profit and weight of objects respectively) (A) 40 (B) 38 (C) 32 (D) 30

Last Answer : (B) 38

Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Description : Using data p=3, q=11, n=pq, d=7 in RSA algorithm find the cipher text of the given plain text SUZANNE (A) BUTAEEZ (B) SUZANNE (C) XYZABCD (D) ABCDXYZ

Last Answer : (A) BUTAEEZ

If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Description : If n and r are non-negative integers and n≥r, then p(n + 1, r) equals to (A) P(n,r)(n+1) / (n+1-r) (B) P(n,r)(n+1) / (n-1+r) (C) p(n,r)(n-1) / (n+1-r) (D) p(n,r)(n+1) / (n+1+r)

Last Answer : (A) P(n,r)(n+1) / (n+1-r)  Explanation: p(n, r) = n!/(n-r)! p( n+1, r) = (n+1)!/(n+1-r)! = (n+1) n! /(n+1-r) (n-r)! = P(n, r)(n+1)/(n+1-r)

State True or False. i) In spooling high speed device like a disk is interposed between running program and low-speed device in Input/output. ii) By using spooling for example instead of writing directly to a printer, outputs are written to the disk. A) i-True, ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Description : State True or False. i) In spooling high speed device like a disk is interposed between running program and low-speed device in Input/output. ii) By using spooling for example instead of writing directly to a printer, ... ii-False B) i-True, ii-True C) i-False, ii-True D) i-False, ii-False

Last Answer : B) i-True, ii-True

n the DNA molecule, (a) the proportion of adenine in relation to thymine varies with the organism (b) there are two strands which run anti- parallel-one in 5′ → 3′ direction and other in 3′ → 5′ (c) the total amount of purine nucleotides and pyrimidine nucleotides is not always equal (d) there are two strands which run parallel in the 5′ → 3′ direction.

Description : n the DNA molecule, (a) the proportion of adenine in relation to thymine varies with the organism (b) there are two strands which run anti- parallel-one in 5′ → 3′ direction and other in 3′ → ... is not always equal (d) there are two strands which run parallel in the 5′ → 3′ direction.

Last Answer : (b) there are two strands which run anti- parallel-one in 5′ → 3′ direction and other in 3′ → 5′

The output of executing string.ascii_letters can also be achieved by: a) string.ascii_lowercase_string.digits b) string.ascii_lowercase+string.ascii_upercase c) string.letters d) string.lowercase_string.upercase

Description : The output of executing string.ascii_letters can also be achieved by: a) string.ascii_lowercase_string.digits b) string.ascii_lowercase+string.ascii_upercase c) string.letters d) string.lowercase_string.upercase

Last Answer : d) string.lowercase_string.upercase

Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Description : Synchronization is achieved by a timing device called a ................. which generates a periodic train of .................. (A) clock generator, clock pulse (B) master generator, clock pulse (C) generator, clock (D) master clock generator, clock pulse

Last Answer : Answer: A and D

Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg(w) ≥ n for every v and w not connected by an edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Description : Consider a Hamiltonian Graph (G) with no loops and parallel edges. Which of the following is true with respect to this Graph (G) ? (a) deg(v) ≥ n/2 for each vertex of G (b) |E(G)| ≥ 1/2 (n-1)(n-2)+2 edges (c) deg(v) + deg( ... edge (A) (a) and (b) (B) (b) and (c) (C) (a) and (c) (D) (a), (b) and (c)

Last Answer : (D) (a), (b) and (c)

Choking in case of pipe flow means that a (A) Specified mass flow rate cannot be achieved (B) Valve is closed in the line (C) Restriction in flow cross-section area occurs (D) None of these

Description : Choking in case of pipe flow means that a (A) Specified mass flow rate cannot be achieved (B) Valve is closed in the line (C) Restriction in flow cross-section area occurs (D) None of these

Last Answer : (B) Valve is closed in the line

Which one of the following is correct? (A) Java applets cannot be written in any programming language (B) An applet is not a small program. (C) An applet can be run on its own. (D) Applets are embedded in another applications.

Description : Which one of the following is correct? (A) Java applets cannot be written in any programming language (B) An applet is not a small program. (C) An applet can be run on its own. (D) Applets are embedded in another applications. 

Last Answer : (D) Applets are embedded in another applications.

What can you say about the following statements? I. XML tags are case-insensitive. II. In JavaScript, identifier names are case-sensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All well-formed XML documents must contain a document type definition. (1) only I and II are false. (2) only III and IV are false. (3) only I and III are false. (4) only II and IV are false.

Description : What can you say about the following statements? I. XML tags are case-insensitive. II. In JavaScript, identifier names are case-sensitive. III. Cascading Style Sheets (CSS) cannot be used with XML. IV. All well-formed ... IV are false. (3) only I and III are false. (4) only II and IV are false. 

Last Answer : Answer: Marks to all

Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Description : Using the RSA public key crypto system, if p=13, q=31 and d=7, then the value of e is (A) 101 (B) 105 (C) 103 (D) 107

Last Answer : (C) 103 Explanation: Basic RSA Algorithm: 1. Choose two primes, p & q. 2. Compute n=p*q and z=(p-1)*(q-1). 3. Choose a number relatively prime to z and call it d. 4. Find e such that e*d= ... each of these in turn by 7 to see which is divisible by 7, we find that 721/7 = 103, hence e = 103. 

Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and ............. respectively. (A) ↔~˄pq˅ ~~pq, pq˄~p~q~˅↔ (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Description : Let us assume that you construct ordered tree to represent the compound proposition (~(p˄q))↔(~p˅~q). Then, the prefix expression and post-fix expression determined using this ordered tree are given as ........... and .......... ... ~p~q~˅↔ (C) ↔~˄pq˅ ~~pq, pq˄~p~ ~q˅↔ (D) ↔~˄pq˅ ~p~q, pq˄~p~~q˅↔

Last Answer : (B) ↔~˄pq˅ ~p~q, pq˄~p~q~˅↔

If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Description : If there are N people in the world and are using secret key encryption/decryption for privacy purpose, then number of secret keys required will be: (A) N (B) (N-1) (C) N(N-1)/2 (D) N(N+1)/2

Last Answer : (C) N(N-1)/2 

Which one of the following describes the syntax of prolog program ? I. Rules and facts are terminated by full stop (.) II. Rules and facts are terminated by semicolon (;) III. Variables names must start with upper case alphabets. IV. Variables names must start with lower case alphabets. Codes : (A) I, II (B) III, IV (C) I, III (D) II, IV

Description : Which one of the following describes the syntax of prolog program ? I. Rules and facts are terminated by full stop (.) II. Rules and facts are terminated by semicolon (;) III. Variables names must start with upper case alphabets. ... alphabets. Codes : (A) I, II (B) III, IV (C) I, III (D) II, IV

Last Answer : (C) I, III

How many times the word 'print' shall be printed by the following program segment? for(i=1, i≤2, i++) for(j=1, j≤2, j++) for(k=1, k≤2, k++) printf("print/n") (A) 1 (B) 3 (C) 6 (D) 8

Description : How many times the word 'print' shall be printed by the following program segment? for(i=1, i≤2, i++) for(j=1, j≤2, j++) for(k=1, k≤2, k++) printf("print/n") (A) 1 (B) 3 (C) 6 (D) 8

Last Answer : (D) 8

Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Description : Given two sorted list of size 'm' and 'n' respectively. The number of comparison needed in the worst case by the merge sort algorithm will be (A) m x n (B) max (m, n) (C) min (m, n) (D) m + n – 1

Last Answer :  (D) m + n – 1

Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Description : Red-black trees are one of many Search tree schemes that are "balanced” in order to guarantee that basic dynamic-set operations take ............. time in the worst case. (1) O(1) (2) O(log n) (3) O(n) (4) O(n log n)

Last Answer : (2) O(log n) 

Consider the following ER diagram: Image The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Description : Consider the following ER diagram:  The minimum number of tables required to represent M, N, P, R1, R2 is (A) 2 (B) 3 (C) 4 (D) 5

Last Answer : (A) 2 

Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions – 1 (B) E – N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) P – 1, where P is the number of predicate nodes in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Description : Which one of the following is used to compute cyclomatic complexity ? (A) The number of regions - 1 (B) E - N + 1, where E is the number of flow graph edges and N is the number of flow graph nodes. (C) ... in the flow graph G. (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Last Answer : (D) P + 1, where P is the number of predicate nodes in the flow graph G.

Let P(m,n) be the statement “m divides n” where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) (c) ∀m ∀n P(m,n) (A) (a)-True; (b)-True; (c)-False (B) (a)-True; (b)-False; (c)-False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Description : Let P(m,n) be the statement m divides n where the Universe of discourse for both the variables is the set of positive integers. Determine the truth values of the following propositions. (a) ∃m ∀n P(m,n) (b) ∀n P(1,n) ( ... -False (C) (a)-False; (b)-False; (c)-False (D) (a)-True; (b)-True; (c)-True

Last Answer : Answer: A

Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Description : Suppose there are n stations in a slotted LAN. Each station attempts to transmit with a probability P in each time slot. The probability that only one station transmits in a given slot is .................. (1) nP(1-P)n-1 (2) nP (3) P(1-P)n-1 (4) nP(1-P)n-1

Last Answer :  nP(1-P)n-1

If all the dimensions of a bar are increased in the proportion n : 1, the proportion with which the maximum stress produced in the prismatic bar by its own weight, will increase in the ratio (A) 1 : n (B) n : 1 (C) 1 : (1/n) (D) 1 : n

Description : If all the dimensions of a bar are increased in the proportion n : 1, the proportion with which the maximum stress produced in the prismatic bar by its own weight, will increase in the ratio (A) 1 : n (B) n : 1 (C) 1 : (1/n) (D) 1 : n

Last Answer : (B) n : 1

Which law states that with constant taste and preferences, the proportion of income spend on food stuff diminishes as income increases? (1) Say's Law (2) Griffin's Law (3) Gresham's Law (4) Engel's Law

Description : Which law states that with constant taste and preferences, the proportion of income spend on food stuff diminishes as income increases? (1) Say's Law (2) Griffin's Law (3) Gresham's Law (4) Engel's Law

Last Answer : (4) Engel's Law Explanation: According to Engel's Law, as disposable income of a consumer increases, the percentage of income spent for food decreases if all other factors remain constant. This ... demand of food is less than 1. A lower Engel coefficient indicates a higher standard of living.

Which law states that with constant taste and preferences, the proportion of income spend on food stuff diminishes as income increases? (1) Say’s Law (2) Griffin’s Law (3) Gresham’s Law (4) Engel’s Law

Description : Which law states that with constant taste and preferences, the proportion of income spend on food stuff diminishes as income increases? (1) Say’s Law (2) Griffin’s Law (3) Gresham’s Law (4) Engel’s Law

Last Answer : Engel’s Law

Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below Image The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Description : Given a Non-deterministic Finite Automation (NFA) with states p and r as initial and final states respectively transition table as given below  The minimum number of states required in Deterministic Finite Automation (DFA) equivalent to NFA is (A) 5 (B) 4 (C) 3 (D) 2

Last Answer : (C) 3 

A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec

Description : A client-server system uses a satellite network, with the satellite at a height of 40,000 kms. What is the best-case delay in response to a request? (Note that the speed of light in air is 3,00,000 km/second). (A) 133.33 m sec (B) 266.67 m sec (C) 400.00 m sec (D) 533.33 m sec

Last Answer : (D) 533.33 m sec Explanation: The request has to go up and down, and the response has to go up and down. The total path length traversed is thus 160.000 km. The speed of light in air and vacuum is 300,000 km/sec, so the propagation delay alone is 160,000/300,000 sec or about 533 msec. 

Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover is one in which the channel in the source cell is released and only then the channel in the target cell is engaged. (A) S1 is true and S2 is not true. (B) S1 is not true and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true.

Description : Consider the following statements S1 and S2 : S1 : A hard handover is one in which the channel in the source cell is retained and used for a while in parallel with the channel in the target cell. S2 : A soft handover ... and S2 is true. (C) Both S1 and S2 are true. (D) Both S1 and S2 are not true.

Last Answer : (D) Both S1 and S2 are not true.

Truly effective communication: 1. Depends on using multiple channels 2. Depends on selecting the right method for each message and avoiding duplication, since everyone is overloaded with information 3. Cannot depend solely on non-verbal signals which might be misunderstood 4. Can only be achieved by communication professional 5. a, b and c

Description : Truly effective communication: 1. Depends on using multiple channels  2. Depends on selecting the right method for each message and avoiding duplication, since  everyone is overloaded with information  3. ... misunderstood  4. Can only be achieved by communication professional  5. a, b and c

Last Answer : 5. a, b and c

A bus run at 100 km/hr top speed. It can carry a maximum of 6 persons. If speed of bus decreases in fixed proportion with increase in number of person, find speed when three person are traveling in bus.

Description : A bus run at 100 km/hr top speed. It can carry a maximum of 6 persons. If speed of bus decreases in fixed proportion with increase in number of person, find speed when three person are traveling in bus.

Last Answer : 100 Km/hr because that is the top speed of the bus.

A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

Description : A byte addressable computer has a memory capacity of 2 m Kbytes and can perform 2 n operations. An instruction involving 3 operands and one operator needs a maximum of (A) 3m bits (B) m + n bits (C) 3m + n bits (D) 3m + n + 30 bits

Last Answer : (D) 3m + n + 30 bits

Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Description : Suppose you are given a binary tree with n nodes, such that each node has exactly either zero or two children. The maximum height of the tree will be (A) n/2 - 1 (B) n/2 + 1 (C) (n-1)/2 (D) (n+1)/2

Last Answer : (C) (n-1)/2

Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), Deletion-O(1), Maximum-O(n), Minimum-O(n) (3) Insertion-O(n), Deletion-O(n), Maximum-O(1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Description : Which of the following is true for computation time in insertion, deletion and finding maximum and minimum element in a sorted array? (1) Insertion-O(1), Deletion-O(1), Maximum-O(1), Minimum-O(1) (2) Insertion-O(1), ... (1), Minimum-O(1) (4) Insertion-O(n), Deletion-O(n), Maximum-O(n), Minimum-O(n)

Last Answer : Answer: 3

State true of false. i) We cannot make the function inline by defining a function outside the class. ii) A member function can be called by using its name inside another member function of the same class, this is known as nesting of member function. A) True, True B) True, False C) False, True D) False, False

Description : State true of false. i) We cannot make the function inline by defining a function outside the class. ii) A member function can be called by using its name inside another member function of the same class, this ... of member function. A) True, True B) True, False C) False, True D) False, False

Last Answer : C) False, True

Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) Given the prefix and postfix walks of a binary tree, the tree cannot be reconstructed uniquely. (D) Depth-first-search can be used to find the components of a graph. (1) A (2) B (3) C (4) D

Description : Which of the following statements is false? (A) Optimal binary search tree construction can be performed efficiently using dynamic programming. (B) Breadth-first search cannot be used to find connected components of a graph. (C) ... used to find the components of a graph. (1) A (2) B (3) C (4) D 

Last Answer : Answer: 2

If P and ` Q^(2) ` are in direct proportion. If Q doubles then P becomes _______ .

Description : If P and ` Q^(2) ` are in direct proportion. If Q doubles then P becomes _______ .

Last Answer : If P and ` Q^(2) ` are in direct proportion. If Q doubles then P becomes _______ .

Maximum endurance: a. Can be achieved in level unaccelerated flight with minimum fuel consumption b. Can be achieved by flying at the best rate of climb speed in straight and level flight c. Can be achieved in a steady climb d. Can be achieved by flying at the absolute ceiling

Description : Maximum endurance: a. Can be achieved in level unaccelerated flight with minimum fuel consumption b. Can be achieved by flying at the best rate of climb speed in straight and level flight c. Can be achieved in a steady climb d. Can be achieved by flying at the absolute ceiling

Last Answer : a. Can be achieved in level unaccelerated flight with minimum fuel consumption

Maximum endurance: a. Can be achieved in level unaccelerated flight with minimum fuel consumption b. Can be achieved by flying at the best rate of climb speed in straight and level flight c. Can be achieved in a steady climb d. Can be achieved by flying at the absolute ceiling

Description : Maximum endurance: a. Can be achieved in level unaccelerated flight with minimum fuel consumption b. Can be achieved by flying at the best rate of climb speed in straight and level flight c. Can be achieved in a steady climb d. Can be achieved by flying at the absolute ceiling

Last Answer : a. Can be achieved in level unaccelerated flight with minimum fuel consumption

Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers

Description : Special programs that assist programmers are called ____________ a) heuristic processors b) symbolic programmers c) intelligent programming tools d) program recognizers

Last Answer : c) intelligent programming tools

Is Apple returning to PowerPc processors after buying P.A. Semi?

Description : Is Apple returning to PowerPc processors after buying P.A. Semi?

Last Answer : Maybe for use on non-PC devices. I doubt they'd move back to PowerPC since they spent so much time and money moving over to x86. I remember reading Jobs quoting someone else saying If you ... gives some insight into why they may have purchased P.A. Semi. Hopefully it means more powerful handhelds.