Vowel or Consonant

QUESTION:
Write a program to determine whether the input character is a vowel or consonant.

Input and Output Format:
Input consists of a single character.
Output consists of a string --- “Vowel” / “Consonant” / “Not an alphabet”
Refer sample input and output for formatting specifications.
All text in bold corresponds to input and the rest corresponds to output.

Sample Input and Output 1:
Enter a character
a
Vowel

Sample Input and Output 2:
Enter a character
Z
Consonant

Sample Input and Output 3:
Enter a character
#
Not an alphabet

SOLUTION:

#include<stdio.h>
int main()
{
    char in;
    char arr[11]={'a','e','i','o','u','A','E','I','O','U'};
    int i,flag=0,con=0;
    printf("Enter a character\n");
    scanf("%c",&in);
    if(((in>='a') && (in<='z')) || ((in>='A') && (in<='Z')))
    {
        for(i=0;i<10;i++)
        {
            if(in==arr[i])
            {
                flag++;
                break;
            }
            else
                con++;
        }
    }
    else
        printf("Not an alphabet\n");
    if(con)
        printf("Consonant");
    if(flag)
        printf("Vowel");
    return 0;
}

Comments

Post a Comment

Popular posts from this blog

Implementing a Dynamically sized stack using array

QUESTION: Consider implementing a dynamically sized stack using an array. Create a structure struct stack { int * a; int top; int maxSize; }; The structure stack has a pointer 'a' to a dynamically allocated array (used to hold the contents of the stack), an integer 'maxSize' that holds the size of this array (i.e the maximum number of data that can be held in this array) and an integer 'top' which stores the array index of the top element in the stack. Write a program to implement push and pop operation on stack and to display the contents of the stack. In the initstack function intialize the value of top to -1 and initialize the value of maxSize. Print the message “Stack is full” in the push function when an attempt is made to push a data into a full stack. Print the message “Stack is empty” in the pop function and return the value -1000 when an attempt is made to pop data from an empty stack. Refer function specificati...
Read more

Implementing a Fixed size Queue of maximum size 5 using an array

QUESTION: Consider implementing a fixed size queue of maximum size 5 using an array. Create a structure struct queue { int contents[5]; int front; int count; } ; Note that the array contents holds the contents of the queue and the integer front stores the index of the front element in the queue. Write a program to implement enQueue and deQueue operation on queue and to display the contents of the queue. In the initQueue function intialize the value of front and count to 0. Print the message “Queue is full” in the enQueue function when an attempt is made to insert a data into a full queue. Print the message “Queue is empty” in the deQueue function and return the value -1000 when an attempt is made to delete data from an empty queue. Refer function specifications for further details. Input and Output Format: Refer sample input and output for formatting specifications. Note that the statement “The contents of the queue are” is in the main ...
Read more

Decipher my Ciphertext

QUESTION: Description: In the language of cryptography,  ciphertext  refers to a message encoded with a particular  key .  Plaintext  refers to the original, unencoded text. In this problem, both the ciphertext and the key are simply strings of upper-case characters. The ciphertext is generated from the plaintext by “adding” corresponding characters of the plaintext and the key together. If the plaintext is shorter than the key, only some of the key will be used. Similarly, if the plaintext is shorter than the key, the key will be used multiple times. For example, to encode the plaintext “HELLO” with the key “CAT”: Plaintext:  HELLO Key:  CATCA Ciphertext:  KFFOP And to encode the plaintext “DOG” with the key “FIDO”: Plaintext:  DOG Key:  FID Ciphertext:  JXK To add two letters together, use the following convention: A=1, B=2, …, Z=26. If the sum of two letters is greater than 26, subtract 26 from the...
Read more