Consider the following program: char *g(){ } char message [13] = {'H', 'i', return message; Why is this bad programming practice? A. Returns a pointer to address on the stack B. %rax is not big enough to hold the array C. Return type and returned value have different types D. We can't return a pointer to a value on the heap ','!', '\0'};

Consider the following program: char *g(){ } char message [13] = {'H', 'i', return message; Why is this bad programming practice? A. Returns a pointer to address on the stack B. %rax is not big enough to hold the array C. Return type and returned value have different types D. We can't return a pointer to a value on the heap ','!', '\0'};

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

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)
In C++, write a program that reads in an array of type int. You may assume that there are fewer than 20 entries in the array. The output must be a two-column list. The first column is a list of the distinct array elements and the second column is the count of the number of occurences of each element.
C++ PROGRAM Write a program that will get 10 numbers( including duplicate) between 20 and 100and store them in one dimensional array of type int. your program shall delete all ofthem duplicate values and print the final array list.
Declare and initiate a float type array of A[ ]. then create another float type array B[ ].find the unique elements of A and store them in B. Write a C program to solve the Above problem .Use pointers to traverse through these array. eg; suppose array A contains { 12.5,23.7,43.2,54.6,61.0,12.5.34.9,54.6,61.0} array B should contain {12.5,23.7,43.2,54.6,61.0,34.9} write pacchart and algorithm too
Write a function for given main functionint * return_an_array(int n)which takes an integer n and returns a pointer to an array (allocated off of the heap inthe function) containing the digits of n in the appropriate positions. If n = 0 return 0(which is the “null” pointer). Recall an array name is just a pointer to the first element ofthe array. Please use following main to test your function.int main() {int *a = return_an_array(23542); // array of size 5for(int i=0;i<5;i++)cout<<a[i]<<" "; // print 2 3 5 4 2cout<<endl;delete [] a;int *b = return_an_array(12345678); // array of size 8for(int i=0;i<8;i++)cout<<b[i]<<" "; // print 1 2 3 4 5 6 7 8cout<<endl;delete [] b;return 0;}
Given an integer array of positive single digit values such as:int a[] = {8,4,2,6,9};1) Write a recursive arrayToN function which returns the concatenation of all array values as an integer value.This function should accept all required data as parameters and return a long integer value.ExamplesIf the array is 8 4 2 6 9 the arrayToN function returns the integer 84269.If the array is 0 2 6 8 9 3 5 1 the arrayToN function returns the integer 2689351.
The standard library function calloc(n,size) returns a pointer to n objects of size size, with the storage initialized to zero. Write calloc, by calling malloc or by modifying it.
Write a C++ program that declares an array of 10 indexes. The program asks the user to choose one of the initialization methods given in the following 1. Initialize all array values to be zeroes {0, 0, 0, 0, …….}2. {0, 1, 2, 3,4 ,5, … }3. {1, 2, 3,4 ,5, … }4. {2, 4, 6, 8, 10, … }5. {10, 15, 20, 25, 30, 35, …….} Starting from 10 with 5 more than the previous value.6. {T*0, T*1, T*2, T*3, ………..} where T is entered by the user7. {T*1, T*2, T*3, T*4, ………..} where T is entered by the user8. {2, 3, 5, 7, 11, 13, 17, 19, …….} Save all the prime numbers
Suppose the following code: int a, b, c;char array[100];void f(int& val){char* arr = new char[100];for(int i = 0; i < val; ++i){arr[i] = i*i;}}int main(){int myValue = 123;f(myValue);return 0;} Think about which section of process memory each part of this program would occupy during execution. Then, match items on the left with their storage locations on the right.
•• R7.10Pointers are addresses and have a numerical value. You can print out the value of a pointer as cout << (unsigned)(p). Write a program to compare p, p + 1, q, and q + 1, where p is an int* and q is a double*. Explain the results.
Solve the following codes below and discuss how array, stack, and queues are used in each problem. Must have comments. 1. Write a python program that ask the user the size of an array. The program will askintegers from the user to fill-in the elements of an array of size N as specifiedpreviously. The input numbers must be printed in a right-triangle manner. 2. Given N-element array, write a python program to get the minimum element from thesaid array. 3. Write a python program to implement a stack using two queues.
This chapter describes the array implementation of queues that use a special array slot, called the reserved slot, to distinguish between an empty and a full queue. Write the definition of the class and the definitions of the function members of this queue design. Also, write a program (in main.cpp) to test various operations on a queue. //Header file QueueAsArray #ifndef H_QueueAsArray #define H_QueueAsArray #include <iostream> #include <cassert> using namespace std; template<class Type> class queueType { public: const queueType<Type>& operator=(const queueType<Type>&); // overload the assignment operator void initializeQueue(); int isEmptyQueue() const; int isFullQueue() const; Type front() const; Type back() const; void addQueue(Type queueElement); void deleteQueue(); queueType(int queueSize = 100); queueType(const queueType<Type>& otherQueue); // copy constructor…