can you explain this question , i just want basic experession for understandingit is c programming data structures 1)#include #include Mchar b[] = "COMPUTER";main()PU{char *fun(int);char **v;v = (char **) calloc(2, sizeof(char *));v[0] = fun(0);v[1] = fun(3);v[1][2] = '\0';printf("%c\n", *(v[0]+2));printf("%s\n", v[1]);}char *fun(int k){return b+k;}//=IIiiII%3Diiii!!

1. To call a function in C. in must have declaration before the call. that why fun was declare in…

Answered: can you explain this question , i just…

Engineering

Computer Science

can you explain this question , i just want basic experession for understanding it is c programming data structures

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

1. Write a C++ function named "extractDebugOption" that accepts arguments similar to argc (an integer for the array size) and argv (an array of pointers to C-string). It will determine whether it has the argument of "/debug yes" or "/debug no". It will return true if the debug option is yes. If "/debug no" or there is no debug option or "/debug" without "yes" or "no" followed, it will return false. Note: command line arguments are simply an array of pointers to C-string. Please test it with the following command line arguments These will return true"/debug yes""/compile /debug yes" These will return false"/debug no""/debug""debug""yes /debug""no /debug"
C. In permutations and combinations, the term “n C r” refers to n combinationstaken r at a time.??? =?!/?! (? − ?)!Write a recursive function to find the factorial of a number.Use the defined function to compute the term “nCr” for the following scenario:The values of ‘n’ and ‘r’ are stored in two parallel arrays of any user definedsize . You have to Read the arrays n and r at run time. Compute n C r for eachcorresponding terms in the array ‘n’ and ‘r’, and display it properly formatted.Also your program should print the current date and time using libraryfunctions
Look at the following C++ code and comment each line about how it works with pointer. int i = 33; double d = 12.88; int * iPtr = &i; double * dPtr = &d; // iPtr = &d; // dPtr = &i; // iPtr = i; // int j = 99; iPtr = &j; //
2) For each of the following, write C++ statements that perform the specified task.a) Declare a built-in array of type unsigned int called values with five elements, andinitialize the elements to the even integers from 2 to 10.b) Declare a pointer vPtr that points to a variable of type unsigned int.c) Write two separate statements that assign the starting address of array values to pointervariable vPtr.d) Use a for statement to print the elements of array values using pointer/offset notation.e) Refer to the fifth element of values using pointer subscript notation.f) Assume that unsigned integers are stored in two bytes and that the starting address of thearray is at location 1002500 in memory.• If vPtr points to the first element of array values, then what address is referenced byvPtr + 3? (manually calculate)• What value is stored at that location?
C++ help please my function: bool palindrome(const int a[], int start, int end){ bool flag = true; for (int i = start; i <= end / 2 && a[i]!= 0; i++) { if (a[i] != a[end - i - 1]) { flag = false; cout << "Array Is Not Palindrome\n"; return false; } } if (flag == true) cout << "Palindrome"; return true;} the main: int a[]= {1,2,1,2,1};cout << "Array = [1,2,1,2,1}\n";cout << "Testing array palindrome using 3 parameters:\n";palindrome(a, 2, 3); please help my function is not doing what it is supposed to :( it returns true when its not supposed to
C Programming-Plz fix this code We can return multiple values from functions using pointers. Let's see an example. # include <stdio.h> void add Gr.marks (int * m) { *m = * m + 10; } void main ( ) { int marks; clrscr ( ); printf("enter actual marks:"); scanf(" % d", & marks); add Gr.marks (& marks); printf(" \n the graced marks is :\t % d", marks); }
c++ : rewrite this code , to be unique . In which the output will stay same same. #include <iostream>#include <stdint.h>using namespace std; class arr{private: int size_arr; //To store the size of the array char *begin; //Pointer for dynamic allocation of memory int capacity; //To store the capacity of the elements in the arraypublic: arr(int n); //constructor (default) for creating an array int insert_arr(char x); //To insert an element x in the array int remov_arr(int i); //To remove an element from position i void display(); void displayAtPos(int i);//Function to display a character at position i}; arr::arr(int n){ size_arr = n; begin = new char[size_arr]; capacity = 0;} int arr::insert_arr(const char x){ if(capacity >= size_arr){ cout << "Array Full!" << endl; return -1; } begin[capacity++] = x; //One element is added, so increment the…
In C++ Please Write a program that accepts two integer values, called "arraySize" and "multiplier", as user input. Create an array of integers with arraySize elements. Set each array element to the value i*multiplier, where i is the element's index. Next create two functions, called PrintForward() and PrintBackward(), that each accept two parameters: (a) the array to print, (b) the size of the array. The PrintForward() function should print each integer in the array, beginning with index 0. The PrintBackward() function should print the array in reverse order, beginning with the last element in the array and concluding with the element at index 0. (Hint: for help passing an array as a function parameter, see zybooks section 6.23) As output, print the array once forward and once backward. Sample Input 3 2 Sample Output 0 2 4 4 2 0
"""3. Write a function validSolution/ValidateSolution/valid_solution()that accepts a 2D array representing a Sudoku board, and returns trueif it is a valid solution, or false otherwise. The cells of the sudokuboard may also contain 0's, which will represent empty cells.Boards containing one or more zeroes are considered to be invalid solutions.The board is always 9 cells by 9 cells, and every cell only contains integersfrom 0 to 9. (More info at: http://en.wikipedia.org/wiki/Sudoku)""" # Using dict/hash-tablefrom collections import defaultdict def valid_solution_hashtable(board): for i in range(len(board)): dict_row = defaultdict(int) dict_col = defaultdict(int) for j in range(len(board[0])): value_row = board[i][j] value_col = board[j][i] if not value_row or value_col == 0: return False if value_row in dict_row: return False else: dict_row[value_row] += 1.
In C++ The function below, zeroesToFives takes an array of integers and changes any zeroes in the array to fives and returns the count of array elements that were updated. Write at least ten test cases using assertions for zeroesToFives. You should test at least three boundary/edge cases.
Please explain the code below line by line in detail. The code is finished, I just need the explanation .Code in C++: #include <iostream> #include <stdlib.h> #include <time.h> using namespace std; void swap(int* a, int* b) { int t = *a; *a = *b; *b = t; } int partition(int arr[],int p,int r) { srand(time(0)); int pivot = rand()%(r-p); pivot += p; swap(arr[r],arr[pivot]); pivot = r; int temp = arr[r]; int i = p-1; for (int j = p; j < r ;j++) { if ( arr[j] < temp ) { i++; swap (arr[i],arr[j]); } } i++; swap (arr[r],arr[i]); return (i); } void quickSort(int arr[], int p, int r) { if (p < r) { int pivot = partition(arr, p, r); quickSort(arr, p, pivot - 1); quickSort(arr, pivot + 1, r); } } int main() { int arr[1000000]; int n; cin>>n; int i; for (i=0; i < n; i++) cin>>arr[i]; quickSort(arr, 0, n-1); for (i=0; i < n; i++) cout<<arr[i]<<";"; return 0; }
Write a function that takes as argument an array of integers and the size of the array and returns the average of the input values. Int = avrg(int * array, int size) write the code in c++ please