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

01. ""Implementation of the Misra-Gries algorithm.Given a list of items and a value k, it returns the every item in the listthat appears at least n/k times, where n is the length of the array By default, k is set to 2, solving the majority problem. For the majority problem, this algorithm only guarantees that if there isan element that appears more than n/2 times, it will be outputed. If thereis no such element, any arbitrary element is returned by the algorithm.Therefore, we need to iterate through again at the end. But since we have filtredout the suspects, the memory complexity is significantly lower thanit would be to create counter for every element in the list. For example:Input misras_gries([1,4,4,4,5,4,4])Output {'4':5}Input misras_gries([0,0,0,1,1,1,1])Output {'1':4}Input misras_gries([0,0,0,0,1,1,1,2,2],3)Output {'0':4,'1':3}Input misras_gries([0,0,0,1,1,1]Output None. """
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
please use python
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)
Question: Observe the following code: A0 = dict(zip(('a','b','c','d','e'),(1,2,3,4,5))) A1 = range(10)A2 = sorted([i for i in A1 if i in A0]) A3 = sorted([A0[s] for s in A0]) A4 = [i for i in A1 if i in A3] A5 = A6 = [[i,i*i] for i in A1] print(A0,A1,A2,A3,A4,A5,A6) Write down the output of the code.
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.
Select the appropriate code that performs selection sort. a) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length-1; k++) { if(arr[k] < arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } b) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length; k++) { if(arr[k] < arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } c) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length-1; k++) { if(arr[k] > arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; } d) int min; for(int j=0; j<arr.length-1; j++) { min = j; for(int k=j+1; k<=arr.length; k++) { if(arr[k] > arr[min]) min = k; } int temp = arr[min]; arr[min] = arr[j]; arr[j] = temp; }
Recursive Max! Write a recursive function rc_max(L:List[int]) -> int that takes a list L and returns an element with highest value in the list. For example, rc_max([1,2,3]) returns 3. Note that L is not necessarily sorted. You may assume that the input L is not empty. You cannot use the built-in max() Your Answer: 1 # Put your answer here 2 Submit
P Y T H O N: Singly Linked ListIMPORTANT NOTE: Make sure that the time complexity of the program is O(n)