(Ex2 q1b)C-ProgrammingWhat is printed and Why? Part BcharFill in what is printed after the following C fragment executes?*foo(char *s, char *t){char *z = S;while (*t){==if (*tt++;else't' || *t*S++ = *t++;}*s = *t;return z;=='T')}char a[25];char b[] = "This cart tis there!";printf("%s\n",foo(a,b)); //only write exactly what is printed

Dear Student, The above program will remove the characters 't' or 'T' from the string and will…

Engineering

Computer Science

while (*t) { if (*t == 't t++; else } * *s++ = *t *+

while (t) { if (t == 't t++; else } * s++ = t *+

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

Please Help In JAVA Here is the skeleton of a code for insertion sorting in a functional language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++ (define (insert L M) (if (null? L) M (if (null? M) L (if (< (car L) (car M)) (cons (car L) (insert (cdr L) M)) (cons (car M) (insert (cdr M) L)))))) ;; Exp. (insertionsort '(4 2 10 3 -1 5)) ==> (-1 2 3 4 5 10)(define (insertionsort L) (if (null? L) '() (insert (list (car L)) (insertionsort (cdr L))))) (define (random-list n) (unless (exact-nonnegative-integer? n) (raise-argument-error 'make-list "exact-nonnegative-integer?" 0 n)) (let loop ([n n] [r '()]) (if (zero? n) r (loop (sub1 n) (cons (random 2147483647) r))))) Sample function call:(insertionsort (random-list 10000)) Hint: most languages have some function to determine the runtime of functions
Please Help In JAVA Here is the skeleton of a code for insertion sorting in an imperative language. You have to add right lines of codes for the language you choose (C, C++, C#, JAVA etc,). The following sample is for C++. #include <iostream>#include <array>#include <stdio.h>#include <stdlib.h>#include <ctime>using namespace std; void insertionSort(int A[], int n){for (int i = n-2; i >= 0; i--){ int j; int v = A[i]; for (j = i + 1; j <= n-1; j++) { if (A[j] > v) break; else A[j-1] = A[j]; } A[j-1] = v;}} int *randomArray(int n){srand((unsigned) time(0));int * A = new int [n];for (int i = 0; i < n; i++){ A[i] = rand();}return A;} Sample function calls (call these functions in main driver function):int n = 100000;int * A = randomArray(n);insertionSort(A, n);delete [] A; Note: delete memory of first array before sorting second array. After you modify the code: (1) Generate 100, 000 random numbers and sort them (2) Generate 300000…
Write Java code and a C++ Code for the problem given below as: Given an array of distinct integers. The task is to count all the triplets such that sum of two elements equals the third element.
Please comment on each line if possible on the code below for me to have a better understanding of what each line is doing. It is in C++. Please also give the space and time complexity and the reason why. O(N), O(n log n), O(N^2)...etc. There's a picture attached of the question description. #include <iostream> #include <algorithm> #include <vector> #include <cmath> using namespace std; #define F first #define S second bool cmp(pair<double, double> a, pair<double, double> b) { if (a.first == b.first) return a.second > b.second; else return a.first < b.first; } int main() { int n; // number of sprinklers double p, r; // position, radius double l, w, dx; //length, width of the grass while (cin >> n >> l >> w) { w /= 2.0; vector<pair<double, double> > v; for (int i=0; i<n; i++) { //This…
Computer Science Below is C code that runs successfully but now i want to rewrite this C code and convert it to MIPS Assembler Language Program . using MARS code environment Please include .data and .te #include<stdio. #include<stdlib. // add two matr void add(int m[2][2], int n[2][2], int sum[2][2 for(int i=0; i<2; i++ for(int j=0; <2; j+ sum[i][j] = m[i][j] + n[i][j // subtract two matri void subtract(int m[2][2], int n[2][2], int result[2][2 for(int i=0; i<2; i++ for(int j=0; j<2; j+ result[i][j] = m[i][j] - n[i][j // multiply two matri void multiply(int m[2][2], int n[2][2], int result[2][2 for(int i=0; i < 2; i++ for(int j=0; j < 2; j++ result[i][j] = 0; // assign // find produ for (int k = 0; k < 2; k+ result[i][j] += m[i][k] * n[k][j // find transpose matr void transpose(int matrix[2][2], int trans[2][2 for (int i = 0; i <…
Computer Science Is it possible to convert this to java? #include <stdio.h> void printBinary(int n, int i) { // Prints the binary representation // of a number n up to i-bits. int k; for (k = i - 1; k >= 0; k--) { if ((n >> k) & 1) printf("1"); else printf("0"); } } typedef union { float f; struct { // Order is important. // Here the members of the union data structure // use the same memory (32 bits). // The ordering is taken // from the LSB to the MSB. unsigned int mantissa : 23; unsigned int exponent : 8; unsigned int sign : 1; } raw; } myfloat; // Function to convert real value // to IEEE floating point representation void printIEEE(myfloat var) { // Prints the IEEE 754 representation // of a float value (32 bits) printf("%d | ", var.raw.sign);…
in c++, use parallel arrays , and srand(time(NULL)) to randomize the two cards dealt at the start Create a Blackjack (21) game. Your version of the game will imagine only a SINGLE suit of cards, so 13 unique cards, {2,3,4,5,6,7,8,9,10,J,Q,K,A}. Upon starting, you will be given two cards from the set, non-repeating. Your program MUST then tell you the odds of receiving a beneficial card (that would put your value at 21 or less), and the odds of receiving a detrimental card (that would put your value over 21). Recall that the J, Q, and K cards are worth ‘10’ points, the A card can be worth either ‘1’ or ‘11’ points, and the other cards are worth their numerical values.
Write program in C compatible with quincy please. Exercise 2: Write a program to store an input list of ten integers in an array; then display a table similar to the following, showing each data value and what percentage each value is of the total of all ten values. n % of total 4 2.00 12 6.00 18 9.00 25 12.00 24 12.00 30 15.00 28 14.00 22 11.00 23 11.00 10 5.00
You are to create a C program which fills an integer array with integers and then you are to cast it as a "char * and print it out the string relating the "char * The output of the string should be your first and last name with proper capitalization, spacing and punctuation. Your program should have structure similar to: main(){ int A[100]; char *S; A[0]=XXXX;A[1]=YYYY; ... A[n]=0; -- because C strings are terminated with NULL ... printf("My name is %s\n",S); }
in C PROGRAMMING LANGUAGE AND COMMENT EVERY LINE SO I CAN UNDERSTAND EVERY STEP PLEASE, A C program can represent a real polynomial p(X) of degree n as an array of the real coefficients al, al, ..., an (an ‡ 0). p(X) = a0 + a1X + a2 X2 + . . .+ anXn Write a program that inputs a polynomial of maximum degree 8 and then evaluates the polynomial at various values of x. Include a function get_poly that fills the array of coefficients and sets the degree of the polynomial, and a function eval_poly that evaluates a polynomial at a given value of x. Use these function prototypes: void get_poly ( double coeffIl, int* degreep); double eval_poly( const double coeffIl, int degree, double x);
IN C++, with pre an d post pseudocode please Write the simplest program that will demonstrate iteration vs recursion using the following guidelines - Write two primary helper functions - one iterative (IsArrayPrimeIter) and one recursive (IsArrayPrimeRecur) - each of which Takes an array of integers and its size as input params and returns a bool such that 'true' ==> all elements of the array are prime, so the array is prime, 'false' ==> at least one element in array is not prime, so array is not prime. Print out a message "Entering <function_name>" as the first executed statement of each function. Perform the code to test whether every element of the array is a Prime number. Print out a message "Leaving <function_name>" as the last executed statement before returning from the function. Remember - there will be nested loops for the iterative function and there can be no loops at all in the recursive function. For the recursive function - define one other helper…
Write a program in C to convert a binary number into a decimal number without using array, function and while loop. Test Data :Input a binary number :1010101Expected Output :The Binary Number : 1010101The equivalent Decimal Number : 85