Find the sum of the expression1/(√1 + √2) + 1/(√2 + √3) + 1/(√3 + √4) + .... + 1/(√80 + √81) Options: A . &nbsp7 B . &nbsp8 C . &nbsp9 D . &nbsp10

Find the sum of the expression1/(√1 + √2) + 1/(√2 + √3)

Question

Find the sum of the expression1/(√1 + √2) + 1/(√2 + √3) + 1/(√3 + √4) + .... + 1/(√80 + √81)

Options:

A . 7

B . 8

C . 9

D . 10

Answer: Option B

-NA-

Was this answer helpful ?

Next Question

Question 1. Out of all the 2-digit integers between 1 and 100, a 2-digit number has to be selected at random. What is the probabili....probability that the selected number is not divisible by 7?

Question 2. Which one of the following is the tightest upper bound that represents the number of swaps required to sort n numbers u....of swaps required to sort n numbers using selection sort?

Question 3. What is the maximum number of reduce moves that can be taken by a bottom-up parser for a grammar with no epsilon- and u....A â†’ a) to parse a string with n tokens?

Question 4. Consider the languages L1 = Ï† and L2 ={a}. Which one of the following represents L1L2* á´œ L3* ? ....

Question 5. Match the problem domains in GROUP I with the solution technologies in GROUP II.GROUP I �.... (4) XML

Question 6. A scheduling algorithm assigns priority proportional to the waiting time of a process. Every process starts with priori....have no I/O operations and all arrive at time zero?

Question 7. Which of the following statements is/are FALSE? 1. For every non-deterministic Turing machine, there exists an equival....complementation. 4. Turing recognizable languages are closed under union and intersection.

Question 8. Which of the following statements are TRUE? 1. The problem of determining whether there exists a cycle in an undirecte....there exists a non-deterministic polynomial time algorithm to solve A.

Question 9. In a k-way set associative cache, the cache is divided into v sets, each of which consists of k lines. The lines of a s....mapped to any one of the cache lines from

Question 10. What is the time complexity of Bellman-Ford single-source shortest path algorithm on a complete graph of n vertices? ....shortest path algorithm on a complete graph of n vertices?

Chapter 1 - GLOBAL STEEL SCENARIO & INDIAN STEEL INDUSTRY Part 1 : (13-04-2024) INDUSTRY AND COMPANY AWARENESS (ICA)

Direction Sense Test Part 1 Reasoning (Hindi)

Chapter 1 - RMHP / OHP / OB & BP Part 1 : (14-02-2024) GPOE

Cube & Cuboid Part 1 Reasoning (Hindi)

Data Interpretation (DI) Basic Concept Reasoning (Hindi)

Counting Figures Part 1 Counting Of Straight Lines Reasoning (Hindi)

Sail E0 free webinar Webinars

Real Numbers Part 7 Class 10 Maths

Real Numbers Part 1 Class 10 Maths

Polynomials Part 1 Class 10 Maths

DSP Combined 1 Free Revision Test SAIL JO E-0

GPOE / GPA Combined 1 Free Revision Test SAIL JO E-0

BSP Plant Specific Review Test SAIL JO E-0

BSL Combined 1 Free Revision Test SAIL JO E-0

GFM Combined 1 Free Revision Test SAIL JO E-0