Computer Science: An Overview (12th Edition)
12th Edition
ISBN: 9780133760064
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Videos
Textbook Question
Chapter 8, Problem 3CRP
(Asterisked problems are associated with optional sections.)
3. Rework Problem 2 assuming column major order rather than row major order 2 Suppose an array with six rows and eight columns is stored in row major order starting at address 20 (base ten). If each entry in the array requires only one memory cell, what is the address of the entry in the third row and fourth column? What it each entry requires two memory cells?
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solution
Students have asked these similar questions
What are the disadvantages of arrays?a) Data structure like queue or stack cannot be implementedb) There are chances of wastage of memory space if elements inserted in an array are lesser than the allocated sizec) Index value of an array can be negatived) Elements are sequentially accessed
C Program
Assume that the following lists of numbers represents the physical view of a twodimensional array in memory. If the array has 3 columns and 3 rows, show the row majorordering and the column major ordering for each list.a) 4, 0, 1, 3, 5, 1, 7, 4, 4b) 7, 7, 7, 3, 3, 3, 1, 1, 1c) 1, 2, 3, 4, 5, 6, 7, 8, 9
Given a two dimensional array, with 20 rows and 30 columns, allocated in ANNA-- List[20][30]. Assume row-major ordering is used to store the array in memory and the address of the first array element (List[0][0]) is 0x1234. Assuming each array element occupies one word, what would be the memory address of the element List[10][21]. (Express the address in Hexadecimal.) Refer to slides 84, 85 inLecture4.pdf (“Multidimensional Array Addresses”).
Answer:
Address = Starting address + [(row_num)*NUM_OF_COLUMNS + col_num]*Element_Size= 0x1234 + [10*30 + 21]*1 = 4660 + 321 = 4981 = 0x1375
I am not understanding how 4660 is calculated and the final answer
Chapter 8 Solutions
Computer Science: An Overview (12th Edition)
Ch. 8.1 - Give examples (outside of computer science) of...Ch. 8.1 - Prob. 2QECh. 8.1 - Prob. 3QECh. 8.1 - Prob. 4QECh. 8.1 - Prob. 5QECh. 8.2 - In what sense are data structures such as arrays,...Ch. 8.2 - Prob. 2QECh. 8.2 - Prob. 3QECh. 8.3 - Prob. 1QECh. 8.3 - Prob. 2QE
Ch. 8.3 - Prob. 3QECh. 8.3 - Prob. 4QECh. 8.3 - Modify the function in Figure 8.19 so that it...Ch. 8.3 - Prob. 7QECh. 8.3 - Prob. 8QECh. 8.3 - Draw a diagram representing how the tree below...Ch. 8.4 - Prob. 1QECh. 8.4 - Prob. 2QECh. 8.4 - Prob. 3QECh. 8.4 - Prob. 4QECh. 8.5 - Prob. 1QECh. 8.5 - Prob. 3QECh. 8.5 - Prob. 4QECh. 8.6 - In what ways are abstract data types and classes...Ch. 8.6 - What is the difference between a class and an...Ch. 8.6 - Prob. 3QECh. 8.7 - Suppose the Vole machine language (Appendix C) has...Ch. 8.7 - Prob. 2QECh. 8.7 - Using the extensions described at the end of this...Ch. 8.7 - In the chapter, we introduced a machine...Ch. 8 - Prob. 1CRPCh. 8 - Prob. 2CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 4CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 6CRPCh. 8 - Prob. 7CRPCh. 8 - Prob. 8CRPCh. 8 - Prob. 9CRPCh. 8 - Prob. 10CRPCh. 8 - Prob. 11CRPCh. 8 - Prob. 12CRPCh. 8 - Prob. 13CRPCh. 8 - Prob. 14CRPCh. 8 - Prob. 15CRPCh. 8 - Prob. 16CRPCh. 8 - Prob. 17CRPCh. 8 - Prob. 18CRPCh. 8 - Design a function to compare the contents of two...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 22CRPCh. 8 - Prob. 23CRPCh. 8 - Prob. 24CRPCh. 8 - (Asterisked problems are associated with optional...Ch. 8 - Prob. 26CRPCh. 8 - Prob. 27CRPCh. 8 - Prob. 28CRPCh. 8 - Prob. 29CRPCh. 8 - Prob. 30CRPCh. 8 - Design a nonrecursive algorithm to replace the...Ch. 8 - Prob. 32CRPCh. 8 - Prob. 33CRPCh. 8 - Prob. 34CRPCh. 8 - Draw a diagram showing how the binary tree below...Ch. 8 - Prob. 36CRPCh. 8 - Prob. 37CRPCh. 8 - Prob. 38CRPCh. 8 - Prob. 39CRPCh. 8 - Prob. 40CRPCh. 8 - Modify the function in Figure 8.24 print the list...Ch. 8 - Prob. 42CRPCh. 8 - Prob. 43CRPCh. 8 - Prob. 44CRPCh. 8 - Prob. 45CRPCh. 8 - Prob. 46CRPCh. 8 - Using pseudocode similar to the Java class syntax...Ch. 8 - Prob. 48CRPCh. 8 - Identify the data structures and procedures that...Ch. 8 - Prob. 51CRPCh. 8 - In what way is a class more general than a...Ch. 8 - Prob. 53CRPCh. 8 - Prob. 54CRPCh. 8 - Prob. 55CRPCh. 8 - Prob. 1SICh. 8 - Prob. 2SICh. 8 - In many application programs, the size to which a...Ch. 8 - Prob. 4SICh. 8 - Prob. 5SICh. 8 - Prob. 6SICh. 8 - Prob. 7SICh. 8 - Prob. 8SI
Additional Engineering Textbook Solutions
Find more solutions based on key concepts
Write a loop equivalent to the for loop above without using .
C Programming Language
Private Sub Handles btnOutput.Click
End Sub
Introduction To Programming Using Visual Basic (11th Edition)
What is the purpose of the let constructs in functional languages?
Concepts of Programming Languages (11th Edition)
Suppose that we want to compute the geometric mean of a list of positive values. To compute the geometric mean ...
Java: An Introduction to Problem Solving and Programming (8th Edition)
The ____________ is always transparent.
Web Development and Design Foundations with HTML5 (8th Edition)
Sales Analysis If you have downloaded the books source code from www.pearsonhighered.com/gaddis, you will find ...
Starting Out with Java: Early Objects (6th Edition)
Knowledge Booster
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.Similar questions
- How is an array stored in main memory? How is a linked list stored in main memory? What are their comparative advantages and disadvantages? Give examples of data that would be best stored as an array and as a linked list.arrow_forwardExplain the meaning of a pointer variable. For what reason is it being done? If you could explain what a dynamic array is and how it operates, would you? So, how do pointers relate to a dynamic array?arrow_forwardLet's assume that we have an array with 6 members. The members are 10H,20,17H,77H,30H,77 in sequantial order.The offset address of the array is loaded into BX register.In sequencial order, MOV AL,[BX+3], MOV AH,23H , ADD AL,AH commands are executed. What are numbers in AL and AH registers? Select one: a. AL=100h, AH=33H b. AL=100, AH=23H c. AL=9AH, AH=23 d. AL=9AH, AH=23H e. AL=A9H, AH=23arrow_forward
- Consider the following list: L = 387, 690, 234, 435, 567, 123, 441. The number of components n = 7, the number of numbers l = 3, and the radix r = 10 are used here. This indicates that radix sort would require 10 bins and would arrange in three passes. demonstrates the radix sort passes over the array. It is believed that each key is tossed face down into the bin. When the keys are gathered in order from each bin at the conclusion of each run, the list of keys in each bin is flipped upside down and added to the output list.arrow_forwardAssume that a two-dimensional array of doublewords has three logical rows and four logical columns. If ESI is used as the row index, what value is added to ESI to go from one row to the next?arrow_forwardThis is a brief summary of the concept of dynamic memory allocation.arrow_forward
- What are the inherent benefits and drawbacks of this (array-based) backing representation? Discuss with respect to implementation, efficiency, and memory usage. (PI 1.2/ABET[1], PI 6.1/ABET[6])arrow_forwardFor the following loop, assume the array arr2[][] has never been referenced before in the code. Also assume that a cache line is 32 Bytes, and an int is 4 Bytes. 1. How many memory references are there?2. How many cache misses are there?arrow_forwardAnswer the following as completely as possible in your own words:1. Explain how an array is sent to a function as a parameter.2. State which parameters should almost always be sent to any function which modifies an array. Explain why.3. Explain the similarity between index notation and pointer arithmetic.arrow_forward
- Since transistors are the primary component of the structure of both cache memory and RAM (Random Access Memory), the question naturally arises as to why we need cache memory when we already have RAM (Random Access Memory) as a volatile memory. This is because cache memory and RAM both use transistors as their primary structural component. This is as a result of the fact that both cache memory and RAM make use of transistors as their major component for constructing their respective structures. Is it feasible to use a single sort of memory for all of the many diverse functions that the computer serves, or is it necessary to make use of a variety of distinct memories?arrow_forward1. Write an ALGORITHM to calculate the address of any element A [I, J] of a two-dimensional array A [1: M, 1: N]. Assume the array is stored in column-major order, B is the base address of the array and w is the size of each element in the array. 2. A two-dimensional array A with n rows time and m columns can be represented in either row-major or column-major form. Establish the address translation functions to locate any element from the one-dimensional array. The element is specified by two-dimensional parameters along with the data type. 3. Write an ALGORITHM to find the transpose of a sparse matrix.arrow_forwardTo start, create your own set of 10 numbers in an array that are not sorted. Using your array, do the following exercises: Show how the Mergesort algorithm sorts your array by: 1) Showing which sub parts of the array are being examined with each recursive call to Mergesort 2) Showing the results of the array each time the Merge function is used Your demonstration should be similar to slides 19-33 in the Mergesort presentation. You do not have to show the details of the function calls in the stack (unless it helps you), but do explain what is happening at each step to show understanding of the algorithm. Using your same original array, show how the Quicksort algorithm sorts this array by: 3) Showing the results of the array each time the Partition function is used 4) Showing which sub parts of the array are being examined with each recursive call to Quicksort Your demonstration should be similar to slides 35-64 in the Quicksort presentation. Again, you do not have to show all the…arrow_forward
arrow_back_ios
arrow_forward_ios
Recommended textbooks for you
Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
C++ for Engineers and ScientistsComputer ScienceISBN:9781133187844Author:Bronson, Gary J.Publisher:Course Technology Ptr
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning
C++ for Engineers and Scientists
Computer Science
ISBN:9781133187844
Author:Bronson, Gary J.
Publisher:Course Technology Ptr
Computer Fundamentals - Basics for Beginners; Author: Geek's Lesson;https://www.youtube.com/watch?v=eEo_aacpwCw;License: Standard YouTube License, CC-BY