Q-1 Place the following values on the memory given at right side A) Write the memory address of Dark Blue Boxes. a) b) [0] [1) [2] [3] [4] [5] [6] [7] [8] [0] B) Put the tick marks on [1) memory map...

Q-1 Place the following values on the memory given at right side<br>A) Write the memory address of<br>Dark Blue Boxes.<br>a)<br>b)<br>[0] [1) [2] [3] [4] [5] [6] [7] [8]<br>[0]<br>B) Put the tick marks<br>on<br>[1)<br>memory<br>map<br>with<br>the<br>[2]<br>following reference.<br>a) [98,2]<br>b) [2,2]<br>[3]<br>[97]<br>[98]<br>Q-2 Find the Complexity of the following Algorithm.<br>1. Initialize sum to 0.<br>2. Initialize index variable i to 0.<br>3. While i< n do the following:<br>4.<br>a. Add x[] to sum.<br>5.<br>b. Increment i by 1.<br>6.<br>c. if(sum%2)<br>7.<br>else continue;<br>8. Calculate and return mean = sum/ n.<br>Answer - T(n) =<br>

Extracted text: Q-1 Place the following values on the memory given at right side A) Write the memory address of Dark Blue Boxes. a) b) [0] [1) [2] [3] [4] [5] [6] [7] [8] [0] B) Put the tick marks on [1) memory map with the [2] following reference. a) [98,2] b) [2,2] [3] [97] [98] Q-2 Find the Complexity of the following Algorithm. 1. Initialize sum to 0. 2. Initialize index variable i to 0. 3. While i< n="" do="" the="" following:="" 4.="" a.="" add="" x[]="" to="" sum.="" 5.="" b.="" increment="" i="" by="" 1.="" 6.="" c.="" if(sum%2)="" 7.="" else="" continue;="" 8.="" calculate="" and="" return="" mean="sum/" n.="" answer="" -="" t(n)="">

Jun 04, 2022

SOLUTION.PDF

Q-1 Place the following values on the memory given at right side A) Write the memory address of Dark Blue Boxes. a) b) [0] [1) [2] [3] [4] [5] [6] [7] [8] [0] B) Put the tick marks on [1) memory map...

Get Answer To This Question

Related Questions & Answers

Submit New Assignment