The function 'CountWords' is given below to find the number of words in a sentence. Which of the following is the missing code line? int CountWords(char *P) { int count3D0,words3D0,i; while(P[count]!='\0') count++;for (i=0;i<=count;i++) { a. if ((P[i=" "&&P[I]I="')||P[i]=="\0') b. if ((P[i+1]==' '&&P[i+1]!=' ')||P[i)=='\0') E. if ((P[i+1]==' '&&P[i]!=' ')||P[i+1]=="\0') words++; } return words; } d. if ((P[i]==' '&&P[i+1]1=' ')||P[]=D%='\0')

The function 'CountWords' is given below to find the number of words in a sentence. Which of the following is the missing code line? int CountWords(char *P) { int count3D0,words3D0,i; while(P[count]!='\0') count++;for (i=0;i<=count;i++) { a. if ((P[i=" "&&P[I]I="')||P[i]=="\0') b. if ((P[i+1]==' '&&P[i+1]!=' ')||P[i)=='\0') E. if ((P[i+1]==' '&&P[i]!=' ')||P[i+1]=="\0') words++; } return words; } d. if ((P[i]==' '&&P[i+1]1=' ')||P[]=D%='\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

Write a program that gets a list of integers from input, and outputs the integers in ascending order (lowest to highest). The first integer indicates how many numbers are in the list. Assume that the list will always contain less than 20 integers. Ex: If the input is: 5 10 4 39 12 2 the output is: 2 4 10 12 39 For coding simplicity, follow every output value by a space, including the last one. Your program must define and call the following function. When the SortVector function is complete, the vector passed in as the parameter should be sorted.void SortVector(vector<int>& myVec) Hint: There are many ways to sort a vector. You are welcome to look up and use any existing algorithm. Some believe the simplest to code is bubble sort: https://en.wikipedia.org/wiki/Bubble_sort. But you are welcome to try others: https://en.wikipedia.org/wiki/Sorting_algorithm. #include <iostream>#include <vector>using namespace std; /* Define your function here */ int main() { /*…
The function “reverse” reverses a given string and returns a pointer to the resulting string. Complete the missing parts. char* reverse( char* str ) { int n, h, j, k; char _________________; n = strlen( _____________); h = (n / 2); for ( j=0, k=(n - 1); (j < h); j++, _____________________ ) { tmp = ___________; str[k] = str[j]; str[j] = _______________________________; } return ________________________;} int main( int argc, char** argv ) { char s[512]; strcpy( s, argv[1] ); printf( "Reverse: %s\n", reverse( s ) ); return 0;}
Make a C-Language code of the problem: Modify the code such that the program will be able to generate a list of the first N perfect square numbers and give out its sum. Perfect squares are the squares of whole numbers: 1, 4, 9, 16, 25, 36, ... etc. See the sample output in the picture #include <stdio.h> bool isPerfectSquare(int x){ //insert code for isPerfectSquare() function here } int getSum(int *arr, int size){ //insert code for getSum() function here } void printArray(int *arr, int size){ //insert code for printArray() function here } int main(){ //insert code for main() function here return 0;} Note: Do not change the initial function definitions. You are free to use more functions and variables as you see fit.
Transform this exercise of sorting into functions: #include<iostream>#include<ctime>#include<cstdlib>using namespace std;int main(){ srand(time(0)); const int size=5; int grades[size]={0}; int temp=0; for(int i=0; i<size;i++) grades[i]= rand()%101; for(int i=0; i<size; i++) cout<<grades[i]<<" "; cout<<endl; //sorting at most you need n-1 iterations to sort the array. for(int iteration=1; iteration<=size-1;iteration++) // external loop for(int i=0; i<size-1; i++) { if(grades[i]>grades[i+1]) { temp = grades[i]; grades[i] = grades[i+1]; grades[i+1] = temp; } } for(int i=0; i<size; i++) cout<<grades[i]<<" "; cout<<endl; return 0;}
Assume that L is a list of Boolean values, True and False. Write a program in python with a function longestFalse(L) which returns a tuple (start, end) representing the start and end indices of the longest run of False values in L. If there is a tie, then return the first such run. For example, if L is False False True False False False False True True False False 0 1 2 3 4 5 6 7 8 9 10 then the function would return (3, 6), since the longest run of False is from 3 to 6.
Using the function provided, write a function that decides whether two lists are "identical". That is, if cycling by any number N makes the lists identical, the function should return True, otherwise, it should return False. for example identical([1,2,3,4,5], [5,4,1,2,3,]) should give True and identical([1,2,3,4,5], [1,2,3,5,4]) should give False.
PLEASE DO THIS IN PYTHON Part 4 - Performance of binary_search Modify your binary_search function to count the number of comparisons (==, <, <=, >, or >=). The function will now return both the number of comparisons made and the True or False result. The code below calls your function, and creates a simple ASCII bar chart of the number of comparisons (divided by 10, to account for small differences). Test Code max_elements = 100000 for length in range(1, max_elements, 10000): values = list(range(1, (2 * length) + 1, 2)) num_comparisons, found = binary_search(values, length + 1, 0, len(values) - 1) num_comparison_string = format(num_comparisons, '03d') print(num_comparison_string, '*' * (num_comparisons // 10))
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);
Below is a recursive version of binary search:int binarySearch(int nums[], int low, int high, int target){ if (low > high) return -1; int mid = (low + high)/2; if (target == nums[mid]) return mid; else if (target < nums[mid]) return binarySearch(nums, low, mid - 1, target); else return binarySearch(nums, mid + 1, high, target);} Code Analysis ()If we change the first line of code in the function to be “if (low >= high) return -1;”, and we have an array defined as “int nums[] = {2, 3, 5, 7, 8, 10};”, answer the questions below if we called this function with “int index = binarySearch(nums, 0, nums.length - 1, 3);”For each iteration of binary search:1) What are the values of low, high, mid, and target variables?2) Will a base case be true? If so, what value is being returned3) If the base case(s) are false, which recursive function call will be made?After answering all the questions for each iteration, is the final value returned correct?
Improve the given code below, make sure that the code will require input from the user. Problem: Write a JavaScript function that would accept a string and returns its letters in alphabetical order. function alpha(str){let res;var arr = str.split(""); //splits the strres = arr.sort().join(""); //sorts arr && forms to a strreturn res;}console.log("Num5");console.log(alpha("CSIT201"));
Please answer it in Python write a function word_vers_dictionary(word), which takes a word (string) and returns the corresponding dictionary. For example: >>>word_vers_dictionary("tasses ") #return => {'a': 1, 's': 3, 'e': 1, 't': 1} Using the mot_vers_dictionnaire function, write a function is_anagramme(letters, word) that sends True if the string letters is an anagram of the word word, False otherwise. . For example : >>> is_anagramme("tusla", "hi") True >>> is_anagramme("salus", "salut") False
Write a program , that allows the user to enter an array of elements (integers) then sort these elements in ascending. Hint: first define the array, then loop to enter the elements of the array, and finally use the usual sorting code.