Bissoy.com
Doctors Medicines MCQs Q&A

A frame buffer array is addressed in row-major order for a monitor with pixel locations starting from (0, 0) and ending with (100, 100). What is address of the pixel (6, 10) ? Assume one bit storage per pixel and starting pixel location is at 0.

A frame buffer array is addressed in row-major order for a monitor with pixel locations starting from (0, 0) and ending with (100, 100). What is address of the pixel (6, 10) ? Assume one bit storage per pixel and starting pixel location is at 0. Correct Answer 616

The correct answer is “option 4”.

CONCEPT:

A special area of memory dedicated to graphics in raster scan display is known as a frame buffer.

It is also known as a Refresh buffer.

This memory area holds a set of intensity values for all screen points.

Each screen point is known as a “pixel”.

These stored intensity values are retrieved from the frame buffer & displayed one row or scan line at a time on screen.

CALCULATION:

The frame buffer array is addressed in row-major order with pixel location from: (0, 0) to (100, 100).

Formula for Row-major order to find element is: B + w × (N × (i - start_row) + (j - start_column))

B – Base address of the array → 0

w – size of each element in arra y → 1

N –total number of columns → {0 to 100 i.e. 101 columns}

Therefore, to find :

= 0 + (1 ×  (101 × (6 - 0)) + (10-0))        {i = 6, j = 10}

= 606 + 10

= 616

Hence, the correct answer is “option 4”.

Related Questions

A teacher asked the class to subtract 5 from 75.70% of the class said: 25. Their work was shown as: \(\begin{array}{*{20}{c}} {\begin{array}{*{20}{c}} 7&5 \end{array}}\\ {\underline {\begin{array}{*{20}{c}}\ { - 5} \ \ \ &{} \end{array}} }\\ {\underline {\begin{array}{*{20}{c}} 2&5 \end{array}} } \end{array}\) Which of the following describes the most appropriate remedial action that the teacher should take to clarify this misconception?
Consider the following two C code segment. Y and X are one- and two-dimensional arrays of size n and n × n respectively, where 2 ≤ n ≤ 10. Assume that in both code segments, elements of y are initialized to 0 and each element X[i] [j] of array X is initialized to i + j. Further assume that when stored in main memory all elements of x are in same main memory page frame. Code segment 1:                 //initialize elements of y to 0                 //initialize elements X[i] [j] of X to i+j                       for (i = 0; i < n; i++)                                 Y[i] += X[0] [i]; Code Segment 2:                 //initialize elements of Y to 0                 //initialize elements X[i] [j] of X to i+j                        for (i = 0; i < n; i++)                                 Y[i] += X[i] [0]; Which of the following statements is/are correct? S1: Final contents of array Y will be same in both code segments S2: Elements of array X accessed inside the for loop shown in code segment 1 are contiguous in main memory S3: Elements of array X accessed inside the for loop shown in code segment 2 are contiguous in main memory
You have just configured two Windows NT Servers, Monitor 1 and Monitor 2 with no other software installed. You have an application server that needs to be monitored for performance to figure out what it's problem is, or to get some kind of baseline. You install Network Monitor on Monitor 2. What would you do to monitor Application server?
Consider the following solution to the producer-consumer synchronization problem. The shared buffer size is ?. Three semaphores empty, full and mutex are defined with respective initial values of 0, ? and 1. Semaphore empty denotes the number of available slots in the buffer, for the consumer to read from. Semaphore denotes the number of available slots in the buffer, for the producer to write to. The placeholder variables, denoted by P, Q, R, and S, in the code below can be assigned either empty or full. The valid semaphore operations are: wait ( ) and signal ( ). Producer: Consumer: do {         wait (P) ;         wait (mutex) ;         //Add item to buffer         signal (mutex) ;         signal (Q) ; } while (1) ; do {          wait (R) ;          wait (mutex) ;          //Consume item from buffer          signal (mutex) ;          signal (S) ; } while (1) ;   Which one of the following assignments to P, Q, R and S will yield the correct solution?
Consider a 2-dimensional array x with 10 rows and 4 columns, with each element storing a value equivalent to the product of row number and column number. The array is stored in row-major format. If the first element x[0][0] occupies the memory location with address 1000 and each element occupies only one memory location, which all locations (in decimal) will be holding a value of 10?
A lady wants to buy the following items in the given price range- 1. Tomato between Rs. 40 and Rs. 45 per kg. 2. Grapes in the price range of Rs. 80 and Rs. 90 per kg. 3. Milk packets at Rs. 23 per liter. In which shop from the following will she definitely get all her items/ A. Shop S sells tomato at Rs. 22.5 per half kg, Grapes at Rs. 82 per kg and milk at Rs. 24 per liter. B. Shop H sells grapes at Rs. 21 per quarter kg, milk at 12.5 per half litre and tomato at Rs. 22 per half kg. C. Shop O sells milk at Rs. 11.5 per half litre, tomato at 21 per half kg and grapes at Rs. 43 per half kg. D. Shop P sells tomato at Rs. 23.5 per half kg, grapes at Rs. 85 per kg and milk at Rs. 23 per litre.
A class III mathematics teacher gave the following questions to her students:  \(\begin{equation} \frac{ \begin{array}[b]{r} 256 \\ + 173 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 28 \\ + 32 \end{array} }{ } \end{equation}\) \(\begin{equation} \frac{ \begin{array}[b]{r} 129 \\ + 76 \end{array} }{ } \end{equation}\) Later she asks the students to solve a worksheet that has similar questions. Which of the following statements is appropriate for the given situation?
A material is loaded elastically under plane stress condition given by the following tensor:
\[\left[ {\begin{array}{*{20}{c}} 1 \\ 0 \end{array}\begin{array}{*{20}{c}} 2 \\ 1 \end{array}\begin{array}{*{20}{c}} 0 \\ 0 \end{array}} \right
Processes P1 and P2 have a producer-consumer relationship, communicating by the use of a set of shared buffers. P1: repeat                 Obtain a full buffer                 Empty it                 Return an empty buffer forever P2 P2P2: repeat             Obtain a full buffer             Empty it             Return an empty buffer          forever Increasing the number of buffers is likely to do which of the following? I. Increase the rate at which requests are satisfied (throughput) II. Decrease the likelihood of deadlock III. Increase the ease of achieving a correct implementation 
Which of the following is commonly known as frame buffer on a black and white system with one bit per pixel?