Posts

Showing posts from September, 2022

Best 5 android phones to buy under 10000. Buy before sale ends. Best smart phones.

Image
Here we bring you a list of  10 android phones that are best for you. 1.Tecno Spark 9 (Sky Mirror, 6GB RAM, 128GB Storage)| Upto 11GB Expandable RAM | 90Hz Refresh Rate | 6.6" HD+Display | 13MP Dual Camera | 5000mAh Battery | Helio G37 Gaming Processor Techno Spark 9T is currently providing amazing specifications of   6GB RAM and 128GB Storage at just the price of  ₹9,499.00. Such an amazing deal, go check it out by clicking here . About this item Up to 11GB larger RAM (6GB LPDDR4x + 5GB Virtual RAM) with the help of memory fusion technology | 37% improvement in app switching | 128GB eMCP ROM | No support for Africa's frequency bands 90Hz Refresh Rate | 180Hz Touch Sampling Rate | 6.6" HD+ Dot Notch display | 269PPI Pixel Density for richer colors 13MP rear Dual Camera and Dual Flashlight | 8MP Selfie camera with front flash| Multiple AI modes like Portrait, HDR, Smile Shot, AI Scene Detection | Shoot Clear 1080P Time-lapse, Slow Motion, Video Bokeh videos MediaTek H...

In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute.

Image
Q1 (12 points) In the following table, there are 12 entries in the form nij, where i = 1, 2, 3 and j 1,2,3,4. Each of these entries denotes the largest integer n such that f(n) milliseconds = does not exceed t, where f(n) is the function corresponding to the row of the entry and t is the time corresponding to the column of the entry. For example, for entry n32, we have f(n) = 2^n and t = 1 minute. Hence n32 should be the largest integer n such that 2^n milliseconds is no more than 1 minute. On the answer sheet, enter the values for nij, i = 1, 2, 3, j = 1, 2, 3, 4. Q1. Solution: Aim: Each entry denotes the largest integer n such that f(n) milliseconds do not exceed t. FIRST ROW........................................... i) Solving n11 :   Here , f(n) = 100n + 200 And t = 1 second. so,    where n is an integer   : [t = 1second = 1000ms]  Ans:  ii) Solving n12 Here , f(n) = 100n + 200 And t = 1minute = 60sec = 60000ms Ans :  iii) Solving n13 Here , ...