16. Consider the following code segment that dynamically allocates memory on the heap to create and use it as a matrix with 4 rows, and 3 columns: int **a new int* [4]; for (int i = 0; i <4; i++) { a[i] = new int [3]; for (int j 0; j < 3; j++) a[i] [j] = 0; Which one of the following statements is the proper way to de-allocate/remove the allocated memory from heap: for (int i = 0; i< 3; i++) a b с delete [] a [i]; delete [] a; delete [] a; for (int i = 0; i <4; i++) delete [] a[i]; for (int i delete [] a[i]; delete [] a; 0; i <4; i++) d delete [] a;

16. Consider the following code segment that dynamically allocates memory on the heap to create and use it as a matrix with 4 rows, and 3 columns: int **a new int* [4]; for (int i = 0; i <4; i++) { a[i] = new int [3]; for (int j 0; j < 3; j++) a[i] [j] = 0; Which one of the following statements is the proper way to de-allocate/remove the allocated memory from heap: for (int i = 0; i< 3; i++) a b с delete [] a [i]; delete [] a; delete [] a; for (int i = 0; i <4; i++) delete [] a[i]; for (int i delete [] a[i]; delete [] a; 0; i <4; i++) d delete [] a;

C++ Programming: From Problem Analysis to Program Design

8th Edition

ISBN:9781337102087

Author:D. S. Malik

Publisher:D. S. Malik

Chapter17: Linked Lists

Section: Chapter Questions

Problem 6PE

See similar textbooks

Similar questions

TRUE OR FALSE 1. One disadvantage of Boolean type is readability 2. When string length is specified at the declaration time then we call it Static Length 3. In stack-dynamic array subscript ranges are dynamically bound 4. Access to record elements is slower than access to array 5. It is possible to check type (type checking) when using free union
True or False For each statement below, indicate whether you think it is True or False. provide a description of your answer for partial credit in case you are incorrect. 1) Given a stack implemented as an array, and the following functions performed: Push(A), Push (B), Push(C), Pop(), Push(D), Push(E), Pop(), Push(F) a. The array will be [A][B][D][F] and the “top” of the stack will be at index 3 where [F] is b. The next element that will be removed when Pop is called will be A c. If we Push(G), [G] will be inserted at index 0
int n; int* f(void){ int *x = malloc(sizeof(int)); *x ? 3;return x; } int main (void){ int j; int *y· ;; f ( ) ; return 0;} Question: Which part of memory (code, data, heap, stack) are the follbwing entitfres stored in? please explain in short. a. n b. y c. *y d. f
Example function void f() { int array[10]; read(array, 10); reverse(array, 10); print(array, 10); } Stack Frame saved $ra = 4 bytes int array[10] (40 bytes) Figure 7.6: Example of a function f and its corresponding stack frame 5. Suppose we rewrite function f (Figures 7.6) to have an integer parameter n. The local array is now declared to have n integers (rather than 10). This means that the size of the stack frame size of function f will depend on n. Rewrite the function f in MIPS assembly language. Hint: you may use the $fp register (in addition to $sp) to implement the function f. void f(int n) { int array[n]; read(array, n); reverse(array, n); print(array, n); }
java program: If in the ArrayStack, the first element that we push to the stack, is stored in location capacity – 1 (capacity is the capacity of the array theData) in the array theData and the subsequent elements that we push, we keep on adding before the last element added in the array. That is, in the constructor of class ArrayStack, we initialize the topOfStack to capacity and we write the push method as follows: public E push(E obj) { if (topOfStack == 0) reallocate(); topOfStack--; theData[topOfStack] = obj; return obj; } This push method can work but the if statement should be: if (topOfStack == theData.length - 1) reallocate(); This push method will work provided we modify the reallocate method. This push method can work, but topOfStack-- ; should come after theData[topOfStack] = obj; This push method can work, but topOfStack-- ; should be topOfStack++;
Stacks are an important data structure in their own right and they may be implemented in several ways. Implement a stack as an array and i. Write functions to perform the following operations on it. With each operation explain the time complexity associated with it when performeda. Push() b. pop() c. size() d. peek()ii. Briefly explain any two problems when stacks are implemented as an array.
resizeToMatch main myCirc: Circle public Shape int y 250 int x 100 int int width int height 50 50 radius 25 Stack match: Shape int x int y 5 200 int width int height 60 60 Circle circPtr Circle public Shape int y 200 int x 5 int width int height 60 60 int radius 30 Heap The state of memory is shown just as we enter scope of the resizeToMatch function. The function's intent is to change the dimensions of the current Shape to match those of the parameter Shape. The function is a member function of the Shape class, and Circle is a subclass of Shape. The Circle subclass overrides the Shape resizeToMatch function to also update its radius attribute. Which of the following function calls is a valid way to call the resize ToMatch function. A. (*circptr).resizeToMatch (circptr) B. circPtr->resizeToMatch (circptr) C. myCirc. resizeToMatch (*circptr) D. myCirc->resize ToMatch (*circptr)
Java Implement Stack using Deque (doubly linked list) You must create an array and the user can insert elements into this array and can only access or remove the newly inserted element from the array. The array is executed using a doubly linked list. The following Project should have these classes: 1. Class Book: The main Node for the deque array where it should have the following attributes besides (next, prev nodes): a) Book Id b) Book Name c) Book Author 2. Class Booklists: Where all the main operations are done. You need to apply these following operations: 1) AddBook() [push(0) : The method Inserts the book object into deque Stack (form the last). 2) RemoveBook() [pop()] : This method extracts an object from the last of the Deque stack and it removes it. If such object does not exist, the method returns null.(from the last) 3) isEmpty() : Return True if deque stack is Empty else return False. 4) DisplayAlIBooks() : Print all the books in the deque stack. 5) getlistsize(): Return…
Write the following code in C 1. Create a struct with at least 3 fields - any struct you want but explain it in your comments in the code. Populate at least 10 elements in an array of elements of this struct type with a limit of 1000 elements. 2. Create an array on the heap to store the same number of populated elements from the stack array. 3. Copy the values from the stack array into the dynamic array. The program will output the contents from each array, one at a time. 4. Finally, create a BIN file to store the contents of the array on the heap.
26. In a pointer-based implementation of an linked list. a. increasing the size of the list can waste storage and time b. less memory is required to store an item than in an array-based implementation c. an item explicitly points to the next item d. items can be accessed directly with equal access time
Introduction For this assignment, you are to write a program which implements a Sorted List data structure using a circular array-based implementation and a driver program that will test this implementation. The Sorted List ADT is a linear collection of data in which all elements are stored in sorted order. Your implementation has to store a single int value as each element of the list and support the following operations: 1. add(x) – adds the integer x to the list. The resulting list should remain sorted in increasing order. The time complexity of this operation should be 0(N), where N is the size of the list. 2. removefirst() - deletes the first integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 3. removelast() – deletes the last integer from the list and returns its value. The remaining list should remain sorted. Time complexity of this operation should be 0(1). 4. exists(x) – returns true if the…
char ** doubleIt (char **arr, int *maxsize); The doubleIt function will increase the heap size by doubling the original space. The functions takes 2 arguments: 1. A double pointer of type char called arr. This is a 2D dynamic array that contains words (strings) from the respective category (noun, verb, adjective, preposition). This is the original heap. 2. A pointer of type int called maxsize. This pointer holds the address of an integer that keeps track of the maximum amount of strings the 2D dynamic array can store. When this function is invoked, the current size of the dynamic array is at capacity so the values should match. This value will need to be multiplied by 2. The function allocates a new heap that is twice the size of the original heap and copy the values from the original heap into the new heap. One important note about this is that you have to properly copy the values over in order to avoid segmentation fault. Think about how this can be avoided. That is part of the…