JAVA : Program to demonstrate concept of Polymorphism (Overriden).

 demonstrate concept of Polymorphism (Overriden).

Sourse Code:

class Funcover

{

public void calc(int x,int y)

{

int z;

z=x*y;

System.out.println("multiplication="+z);

}

}

class Override extends Funcover

{

public void calc(int x,int y)

{

int z;

z=x/y;

System.out.print("division="+z);

}

}

class Overrideex

{

public static void main(String arg[])

{

Funcover f1=new Funcover();

f1.calc(7,6);

Override f2=new Override();

f2.calc(14,2);

}

}

Output:

multiplication=42

division=7 

C : Program to Implement Queue Using Array

Code:

/*

 * C Program to Implement a Queue using an Array

 */

#include <stdio.h>

#define MAX 50

int queue_array[MAX];

int rear = - 1;

int front = - 1;

main()

{

    int choice;

    while (1)

    {

        printf("1.Insert element to queue \n");

        printf("2.Delete element from queue \n");

        printf("3.Display all elements of queue \n");

        printf("4.Quit \n");

        printf("Enter your choice : ");

        scanf("%d", &choice);

        switch (choice)

        {

            case 1:

            insert();

            break;

            case 2:

            delete();

            break;

            case 3:

            display();

            break;

            case 4:

            exit(1);

            default:

            printf("Wrong choice \n");

        } /*End of switch*/

    } /*End of while*/

} /*End of main()*/

insert()

{

    int add_item;

    if (rear == MAX - 1)

    printf("Queue Overflow \n");

    else

    {

        if (front == - 1)

        /*If queue is initially empty */

        front = 0;

        printf("Inset the element in queue : ");

        scanf("%d", &add_item);

        rear = rear + 1;

        queue_array[rear] = add_item;

    }

} /*End of insert()*/

delete()

{

    if (front == - 1 || front > rear)

    {

        printf("Queue Underflow \n");

        return ;

    }

    else

    {

        printf("Element deleted from queue is : %d\n", queue_array[front]);

        front = front + 1;

    }

} /*End of delete() */

display()

{

    int i;

    if (front == - 1)

        printf("Queue is empty \n");

    else

    {

        printf("Queue is : \n");

        for (i = front; i <= rear; i++)

            printf("%d ", queue_array[i]);

        printf("\n");

    }

} /*End of display() */

Output:

Related Links:

• http://www.sanfoundry.com/c-program-queue-using-array/

C : Find determinant of a matrix

Click here

http://www.cquestions.com/2011/09/c-program-to-find-determinant-of-matrix.html

Code Master Software

Download Soon Free !!! Free !!! Free !!!

Code Master  is a windows software, which is your one-step solution to learn all the top programming codes - anywhere, anytime!

 Created using research, Code Master offers a perfect path to learn programming. You will not only acquire new skills, but also enjoy it like a game. It's easy, it's fast and it's fun!

    With a huge collection of programs(code examples)  for practice, all your programming needs are bundled in a single app for your daily practice.

What all programming languages you can learn?

•  C Programming: C programming is a powerful general-purpose language.If you are new to programming then C Programming is the best language to start your programming journey.In practical C programming is used in Embedded stuff, Systems programming.
•  C++: C++ is used nearly everywhere for everything from systems programming,numerical and scientific computing,web development,writing compilers, console games, desktop applications and so on.
•  Visual Basic 6.0:
•  Shell Programming: Coming soon...
• Java:

 What features do we have?

• EXAMPLES: over 3300+ programs in 4 languages and counting, Code Master has one of the largest collection of pre-compiled programs with output for practice and learning. We update the program repository regularly based on user's feedback. 
• COURSES: We provide online course. To make your learning more interesting and less boring, our experts have created bite-sized and interactive courses which will help you learn programming in a better way. It's the best place to understand concepts and start coding using the compiler.

Other Features to improve your learning experience includes:

1. Concept based illustrations.
2.  Interactive learning experience.
3. Quick Search for programs.
4. Categorized View for programs.
5. No Harmful Permissions required.
6. Periodic Updates with new programming examples and course content.
7. Feedback and support. 

You can contact us at mgcodemaster@gmail.com

To know more about us visit www.programtube01.blogspot.com

Additional Informations: 

Updated : 01-01-2018

Current Version : v3.00.01.9

Required OS : Windows
Size : 5.12mb

Founder :Mr. Maheswar Sahoo

Devloper :Maheswar Sahoo And Mr. Gobind Prasad Tripathy
Price : Free!!!

Screenshots:

It also provide a browser for online study

Program Tube Android Application

 

PTubeBlog For Android

Download now Free and Secure !!!

 

    

 

 

Publisher's Description

  PTubeBlog, a very popular Browser of Program Tube Website, has been upgraded with all new Programs, Knowledges, Treicks, Great user experiences, etc with related videos. We also provides Youtube channel named as Program Tube.

Screenshots 

Full Specification 

Version: v1.2.00

Publisher: ProgramTube

Publisher Website:  www.programtube01.blogspot.in

Release Date: 10-12-2017

Category: Education

Subcategory: Bowser of Program Tube Website

Operating System: Android 4.0 and more

File Size: 6.8 MB

File Name:

Total Downloads: 10

Limitations: Not available

Price: Free

C Program To Find Factorial of a Number Using Recursion

Example to find factorial of a non-negative integer (entered by the user) using recursion.

To understand this example, you should have the knowledge of following C programming topics:

• C Programming Functions
• C Programming User-defined functions
• C Programming Recursion

The factorial of a positive number n is given by:

factorial of n (n!) = 1*2*3*4....n

The factorial of a negative number doesn't exist. And the factorial of 0 is 1.

You will learn to find the factorial of a number using recursion in this example. Visit this page to learn, how you can find the factorial of a number using loop.

Example: Factorial of a Number Using Recursion

#include <stdio.h>
long int multiplyNumbers(int n);

int main()
{
    int n;
    printf("Enter a positive integer: ");
    scanf("%d", &n);
    printf("Factorial of %d = %ld", n, multiplyNumbers(n));
    return 0;
}
long int multiplyNumbers(int n)
{
    if (n >= 1)
        return n*multiplyNumbers(n-1);
    else
        return 1;
}

Output
Enter a positive integer: 6
Factorial of 6 = 720

Suppose the user entered 6.

Initially, the multiplyNumbers() is called from the main() function with 6 passed as an argument.

Then, 5 is passed to themultiplyNumbers() function from the same function (recursive call). In each recursive call, the value of argumentn is decreased by 1.

When the value of n is less than 1, there is no recursive call.















Check out these related examples:





Find Factorial of a Number


Find Factorial of a Number


Check Whether a Number is Positive or Negative


Find the Sum of Natural Numbers using Recursion


Check Prime or Armstrong Number Using User-defined Function


Count Number of Digits in an Integer


Find G.C.D Using Recursion


Find Largest Number Using Dynamic Memory Allocation