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

The function 'countPrimes' is given below to find the count of prime numbers enclosed within double quotes in an array with 12. Which of the following is the missing code line? int countPrimes( char *a[]) { int i,j,num,nump 0,flag; for (j = 0; j< 12; ++j) { for(i=2; i
Implement the following function: Code should be written in python.
The function count_contains_og in python takes a list of strings and returns how many strings in the list contain 'og' / 'OG' / 'oG' / 'Og' (check for 'og', ignoring case). Hint: Use the sequence membership operator in to help you check for 'og' in the individual strings. Create a lower-cased version of the string (lower), then use the in operator. For example: Test Result str_list = ['cat', 'dog', 'FROG', 'monkey'] print(count_contains_og(str_list)) 2 strlist = ["X", "x"] print(count_contains_og(strlist)) 0 list_of_one_og = ["Doggie"] print(count_contains_og(list_of_one_og)) 1
Programming language is latest version of python
Create a list L containing at least 10 values ranging from j to k. Using a for loop, code a function that will compute and display the following list: L_out[0] = L[0] L_out[i] = L[i] + L[i-1] if i is odd and i is not equal to 0 L_out[i] = L[i] * 3 if i is even and i is not equal to 0 where L[i] represents the value stored in L at the position i. Example: L ‘(2 3 4 5) L_out ‘(2 5 12 9)
Write a function that verifies if a given number exists in an array of floats. The function is supposed to return the first position in where the number is encountered. If the given number does not exist, the function returns –1. Then write a complete program that asks the user to enter an array of 8 floats and calls the function. The prototype of the function should be like: int Search (floats a[ ], int n, float number); Example: Consider the following array of floats int x[8]={2.1, 5.0, 9.8, 4.4, 6.8, 12.88, 9.87, 4.56}; If the number to be searched is 5.4, the function returns –1 If the number to be searched is 9.8,the function returns 2 C++ language only.
# Initialize sets A and BA = { 'a', 'b', 'c', 'd', 'e', 'f' }B = { 'c', 'd', 'f', 'h', 'j', 'k' } print('A = ', sorted(A))print('B = ',sorted(B))print(' ') AsymdiffB = set()# put your code here to compute the symmetric difference of A and B# first add all the elements that are in A but not B# then add all the elements that are in B but not A print('Symmetric Difference of A and B = ', sorted(AsymdiffB))