Want to know:

Show how the array below would be arranged in main memory whenstored in row major order.Figure 8.19 A procedure for printing a linked listprocedure PrintList (List)CurrentPointer head pointer of List.while (CurrentPointer is not NIL) do(Print the name in the entry pointed to by CurrentPointer;Observe the value in the pointer cell of the List entrypointed to by CurrentPointer, and reassign CurrentPointerto be that value.)5 3 74 2 81 9 62. Give a formula for finding the entry in the ith row and jth column of atwo-dimensional array if it is stored in column major order rather thanrow major order.3. In the C, C, Java, and C# programming languages, indices of arraysstart at 0 rather than at 1. Thus the entry in the first row, fourth column of an array named Array is referenced by Array[0][3]. In this case,what address polynomial is used by the translator to convert references ofthe form Array[i][j] into memory addresses?4. What condition indicates that a linked list is empty?5. Modify the procedure in Figure 8.19 so that it stops printing once a particular name has been printed.6. Based on the technique of this section for implementing a stack in a contiguous block of cells, what condition indicates that the stack is empty?7. Describe how a stack can be implemented in a high-level language interms of a one-dimensional array.8. When a queue is implemented in a circular fashion as described in thissection, what is the relationship between the head and tail pointers whenthe queue is empty? What about when the queue is full? How can onedetect whether a queue is full or empty?

Get a detailed, AI-powered explanation for this question and thousands more on StudyFetch.