C Answers

Write a C Program for recognizing only Keyword from a large string.

Write a C Program for recognizing identifiers and delimiters from a large string.

Write a C Program for recognizing all tokens from a large string.

You are requested to write an application which ask the user to input 3 alphabets of their choice.

After that continuously ask the user for new alphabet, if all three alphabets of choice are entered

either in a forward sequence or backward, the application ends with telling them how many times

the user has entered each alphabet of the choice.

Description

You have to explain these instructions below with respect to the Type Systems and Type Expressions:

int number=5, d;

float m=25.5;

d=m/number;

if(number %d==0)

printf(“Divisible”);

else if(m%d)

printf(“Non-Divisible”);

else

printf(“Wrong program!”);

Write a C program for Bubble Sort Algorithm for the descending order in

CodeBlocks using a user defined function.

Create a C program that will generate a table of chosen mathematical operations. The user has to be prompted first for the math operation and then enter a value that will be used to add, subtract, multiply or divide from 1 to 10 to complete the table. A sample run is provided below to illustrate the output.

M A T H O P E R A T I O N S:

[M] – Multiplication

[D] – Division

[A] – Addition

[S] - Subtraction

Enter your choice: M

Enter your desired value to be multiplied: 10

1*10=10

2*10=20

3*10=30

4*10=40

5*10=50

6*10=60

7*10=70

8*10=80

9*10=90

10*10=100

Continue [Y/N]? Y

M A T H O P E R A T I O N S:

[M] – Multiplication

[D] – Division

[A] – Addition

[S] - Subtraction

Enter your choice: A

Enter your desired value to be added:5

1+5=6

2+5=7

3+5=8

4+5=9

5+5=10

6+5=11

7+5=12

8+5=13

9+5=14

10+5=15

Continue [Y/N]? N

Thank you for choosing my program

Good character

You are given a tree with N nodes and N-l edges and two nodes x and y where x! = y. Each node is assigned with a character from 'a' to 'z'. Let us define function F (c) as the total number of pairs of nodes (u,v) such that the shortest path from node u to node v includes nodes x and y and characters present at nodes u and v are equal to c. You are given a string S where S[i]denotes the character assigned to node I where1≤ i ≤ N

Task

Determine the value of F(c) for all characters c from 'a' to 'z:

Notes

•   Pair (u, v) and pair (v, u) are considered the same.

•   Assume I-based indexing of string S.

Hint: In Trees, there is only one unique path between two nodes.

5. Write a C Program to calculate the Average of an array elements where the elements are

received as input.

4. Write a C program to input number from user and check number is palindrome or not using while loop.