data structure assignment1 practice program1

-

 1) Write a menu driven C program to perform the following operation on an integer array: 

a) Display the sum of elements at even subscript position of array .

b) Display the sum of elements at odd subscript position of array.

answer:

#include <stdio.h>

#include <conio.h>

int main()

{

    int a[10], i, n;

    int choice, sum = 0;

    printf("\n enter array limit:");

    scanf("%d", &n);

    printf("\n enter array elements:");

    for (i = 0; i < n; i++)

    {

        scanf("%d", &a[i]);

    }

    printf("\n 1.sum of all even index element of an array.\n");

    printf("\n 2.sum of all odd index element of an array.\n");

    printf("\n.................................................!");

    printf("\n enter your choice:");

    scanf("%d", &choice);

 

    switch (choice)

    {

    case 1:

        for (i = 0; i < n; i++)

        {

            if (i % 2 == 0)

            {

                sum = sum + a[i];

            }

        }

        printf("\n sum of all even index element is %d ", sum);

        sum = 0;

        break;

    case 2:

        for (i = 0; i < n; i++)

        {

            if (i % 2 != 0)

            {

                sum = sum + a[i];

            }

        }

        printf("\n sum of all odd index element is %d", sum);

        sum = 0;

        break;

 

    default:

        printf("\n wrong input....!");

        break;

    }

}


Comments

Post a Comment

Enter comment here!

Popular posts from this blog

PHP ALL ASSIGNMENT PDF

-
 Basics of php:                                 Open to basics of php.pdf Control structure and loops:            Open to control structure and loops.pdf Array and Strings:                           Open to array and strings.pdf Functions,class and objects:            Open to functions,class and objects.pdf Working with forms :                      Open to working with forms.pdf Database:                                         Open to database.pdf
Read more

DATA STRUCTURE ALL PDF(LAB ASSIGNMENTS)

-
 Array :                      Open to Array(one dimentional array).pdf     linked list link:          Open to linked list.pdf queue link:                Open to queue.pdf searching link:          Open to searching.pdf sorting link:               Open to sorting technique(non-recursive).pdf sorting link:               Open to sorting technique(recursive).pdf stack link:                  Open to stack.pdf tree link:                    Open to tree.pdf
Read more

DATA STRUCTURE :ASSIGNMENT NO.8:TREE

-
 PRACTICE PROGRAM: 1) Write a C program to find all the ancestors or descendent of a given node in a binary tree. ANS: #include <conio.h> #include <stdlib.h> #include <stdio.h> #define MAX 100 typedef struct tree {     int data;     struct tree *left, *right; } TREE; int isEmpty(TREE *t) {     return (t == NULL) ? 1 : 0; } typedef struct queue {     TREE *data[MAX];     int front, rear; } QUEUE; typedef struct stack {     TREE *data[MAX];     int top; } STACK; int isEmptyStack(STACK *s) {     return (s->top == -1) ? 1 : 0; } int isFullStack(STACK *s) {     return (s->top == MAX - 1) ? 1 : 0; } void push(STACK *s, TREE *t) {     if (isFullStack(s))     {         printf("\n Stack is Full!");     }     else     {         s->top++;         s->data[s->top] =...
Read more