Computer Science: An Overview (13th Edition) (What's New in Computer Science)
13th Edition
ISBN: 9780134875460
Author: Glenn Brookshear, Dennis Brylow
Publisher: PEARSON
expand_more
expand_more
format_list_bulleted
Concept explainers
Expert Solution & Answer
Chapter 8, Problem 4SI
Explanation of Solution
Issues resulted to persistence of deleted data:
Linked list is a linear data structure. It is different from array data structure; the elements are linked by using pointers. The deletion of any entry usually changes the pointer rather than erases the memory cells.
When an entry is deleted from the linked list, the pointer will change but the entry will still persist until new entry overwrites it...
Expert Solution & Answer
Want to see the full answer?
Check out a sample textbook solutionStudents have asked these similar questions
Using c language
Implement M.A.S.H. Game Database (main.c)Use an array of DataNode pointers to store the game data, with an ENUM for the indexes as follows:
database[HOME_LIST] ---->>>>> DataNode* listHead for list of homes
database[FEMALE_SPOUSE_LIST] ---->>>>> DataNode* listHead for list of female spouses
database[MALE_SPOUSE_LIST] ---->>>>> DataNode* listHead for list of male spouses
database[OCCUPATION_LIST] ---->>>>> DataNode* listHead for list of occupations
database[TRANSPORTATION_LIST] ---->>>>> DataNode* listHead for list of transportion - - methods
database[HOMETOWN_LIST] ---->>>>> DataNode* listHead for list of hometowns
The data values should be specified in an char array of strings by using an initializer list. This array will be passed to the BuildDataList function as a parameter which will in turn construct the list, allocating memory as required, and return a pointer to the…
Explain how "garbage collection" can be impacted by serialized objects in memory-intensive applications.
Define the meaning of a pointer variable. For what reason is it being done? Specifically, what is the definition of a dynamic array, and how does it function? In what way are dynamic arrays related to pointers?
Chapter 8 Solutions
Computer Science: An Overview (13th Edition) (What's New in Computer Science)
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
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_forwardA "composite data type" differs from a "atomic data type" in how it is defined.arrow_forwardIn terms of the design, what kind of issues do these points present? In almost all programming languages, a single pointer can only ever store a single kind of variable.arrow_forward
- Given the following memory snapshot where START and AV_SP store the start pointers of the linked list and the available space, respectively: i) identify the linked list; ii) show how the linked list and the available space list are affected when the following operations are carried out: a) insert 116 at the end of the list, b) delete 243, c) obtain the memory snapshot after the execution of operations listed in (a) and (b). 1 2 3 4 5 6 7 8 9 10 DATA LINK 114 176 243 94 346 879 344 465 191 564 0 6 9 5 7 8 1 3 10 0 START: 2 AV_SP: 4arrow_forwardIn what ways do these concerns arise from the design? In most programming languages, a pointer can only store values of a single type.arrow_forward6. Identify the data structures and procedures that might appear in an abstract data typerepresenting an address book.arrow_forward
- What are smart pointers? What purpose do they serve?arrow_forwardIn c programming, with examples, when, where, and why you might use an array defined at compile time instead of a pointer to a block of memory allocated at run-time to manage a collection of double items?arrow_forwardAnalyze the given linked list figure, use the following pointers (head, p1, p2, p3, p4) and choose the correct answer describing the state of your data structure. head 10 20 30 p1 data p2 tmp next p3- 20 p4 NULL O p1 is equal to 5 O p1.data is equal to 5 O p1->data is equal to 5 O p1->next is equal to 5arrow_forward
- Explain the difference between an array and a linked list data structure. Discuss their advantages and disadvantages in terms of insertion, deletion, and access operations.arrow_forwardAnalyze the given linked list figure, use the following pointers (head, p1, p2, p3, p4) and choose the correct answer describing the state of your data structure. head • 10 20 30 p1 data p2 tmp next p3. 20 p4 NULL O tmp is equal to p2->next O tmp->next is equal to p2->next O tmp->next is equal to 30 O tmp is equal to 30arrow_forwardA linked list is a data structure made of a chain of objects called nodes. Each node contains at least two variables: a value and pointer. The value is the actual data within the Node as if it were an array element. The pointer, on the other hand, points to the next node in the chain. Unlike arrays, linked lists do not need to have a contiguous block of memory upon creation. This makes linked lists a lot more dynamic in size and in ease of insertion and deletion properties. Create an implementation of singly linked list using classes with minimum 5 nodes in Python with the following capabilities/functions: Traverse - print out all data from the linked list Insert - generate a node and attach to an existing linked list Search - find an item (data) from the linked list and return the node Remove - remove a node from the linked listarrow_forward
arrow_back_ios
SEE MORE QUESTIONS
arrow_forward_ios
Recommended textbooks for you
- Systems ArchitectureComputer ScienceISBN:9781305080195Author:Stephen D. BurdPublisher:Cengage Learning
Systems Architecture
Computer Science
ISBN:9781305080195
Author:Stephen D. Burd
Publisher:Cengage Learning