Write a C program to add two Complex numbers using functions illustrating-

Size: px

Start display at page:

Download "Write a C program to add two Complex numbers using functions illustrating-"

Dayna O’Connor’
5 years ago
Views:

1 Scheme of valuvation Date : 29/8/2017 Marks: 40 Subject & Code : Data Structures and Applications (15CS33) Class : III A&B Name of Faculty : Ms. Saritha Time : 8:30 am to 10 am NOTE: ANSWER All FIVE QUESTIONS 1 Write a C program to add two Complex numbers using functions illustrating Passing structure pointers as parameters. 2. Function returning structure pointer. Ans #include <stdio.h> typedef struct complex 4 float real; float imag; complex; complex add(complex n1,complex n2); int main() complex n1, n2, temp; 4 printf("for 1st complex number \n"); printf("enter real and imaginary part respectively:\n"); scanf("%f %f", &n1.real, &n1.imag); printf("\nfor 2nd complex number \n"); printf("enter real and imaginary part respectively:\n"); scanf("%f %f", &n2.real, &n2.imag); temp = add(n1, n2); printf("sum = %.1f + %.1fi", temp.real, temp.imag); complex add(complex n1, complex n2) complex temp; temp.real = n1.real + n2.real; temp.imag = n1.imag + n2.imag; 2 return(temp); OR What is a polynomial? A polynomial object is a homogeneous ordered list of pairs <exponent,coefficient>, where each coefficient is unique. Operations include returning the degree, extracting the coefficient for a given exponent, addition, multiplication, evaluation for a given input.write a function to add two polynomials using single array representation. A polynomial object is a homogeneous ordered list of pairs <exponent,coefficient>, where each coefficient is unique. Operations include returning the degree, extracting the coefficient for a given exponent, addition, multiplication, evaluation for a given input.

2 3 4 Write the fast transpose algorithm to transpose the given Sparse matrix.express the given sparse matrix as triplets and find its transpose Ans Ans List and explain with suitable examples, different Dynamic memory allocation functions used in C. Malloc Calloc Realloc free Explain the following functions with appropriate examples. (i)strchr The C library function char *strchr(const char *str, int c) searches for the first occurrence of the character c (an unsigned char) in the string pointed to by the argument str. (ii) strchr The C library function char *strrchr(const char *str, int c) searches for the last occurrence of the character c (an unsigned char) in the string pointed to, by the argument str. (iii) strpbrk The C library function char *strpbrk(const char *str1, const char *str2)finds the first character in the string str1 that matches any character specified in str2. This does not include the terminating nullcharacters. (iv) strspn The C library function size_t strspn(const char *str1, const char *str2)calculates the length of the initial segment of str1 which consists entirely of characters in str2. OR Write a program to search for a pattern string p in the text string t and replace it with replace string r. char str[100], pat[50], rep[50], ans[100]; int i, j, c, m, k, flag=0; void stringmatch() i = m = c = j = 0; while(str[c]! = '\0') 4*2 4*2

3 if(str[m] = = pat[i]) //... matching i++; m++; if(pat[i] = = '\0') //...found occurrences. flag = 1; //... copy replace string in ans string. for(k = 0; rep[k]!= '\0'; k++, j++) ans[j] = rep[k]; i = 0; c = m; // if ends. //... mismatch ans[j] = str[c]; j++; c++; m = c; i = 0; // ends //end of while ans[j] = '\0'; //end stringmatch() void main() clrscr(); printf("\nenter a main string \n"); gets(str); printf("\nenter a pattern string \n"); flushall(); gets(pat); printf("\nenter a replace string \n"); flushall(); gets(rep); stringmatch(); if(flag = = 1) printf("\nthe resultant string is\n %s", ans); printf("\npattern string NOT found\n"); getch(); // end of main 7 Ans Convert the infix expression ((a+ (b-c+d))*(e-a)*c) to postfix expression. Write a C function to evaluate that postfix expression and trace for the given data a=6, b=3, c=1, d=2, e=4. Ans-abc-d++ea-c** #include<stdio.h> int stack[20]; int top = -1; void push(int x) stack[++top] = x; int pop() return stack[top--];

4 int main() char exp[20]; char *e; int n1,n2,n3,num; printf("enter the expression :: "); scanf("%s",exp); e = exp; while(*e!= '\0') if(isdigit(*e)) num = *e - 48; push(num); n1 = pop(); n2 = pop(); switch(*e) case '+': n3 = n1 + n2; break; case '-': n3 = n2 - n1; break; case '*': n3 = n1 * n2; break; case '/': n3 = n2 / n1; break; push(n3); e++; printf("\nthe result of expression %s = %d\n\n",exp,pop()); Value after evaluvation is Ans OR Write a C-Program to Convert Infix Expression to Postfix Expression. #include<stdio.h> char stack[20];

5 int top = -1; void push(char x) stack[++top] = x; char pop() if(top == -1) return -1; return stack[top--]; int priority(char x) if(x == '(') if(x == '+' x == '-') return 1; if(x == '*' x == '/') return 2; main() char exp[20]; char *e, x; printf("enter the expression :: "); scanf("%s",exp); e = exp; while(*e!= '\0') if(isalnum(*e)) printf("%c",*e); if(*e == '(') push(*e); if(*e == ')') while((x = pop())!= '(') printf("%c", x); while(priority(stack[top]) >= priority(*e)) printf("%c",pop()); push(*e); e++; while(top!= -1) printf("%c",pop());

6 9 Ans What is a stack? Explain the various operations performed on the stack? Write a C-Program to check for palindrome using Stack. A Stack is a data structure which is used to store data in a particular order. Two operations that can be performed on a Stack are: Push operation which inserts an element into the stack. Pop operation which removes the last element that was added into the stack. It follows Last In First Out(LIFO) Order. Various operations :push,pop,display #include <stdio.h> #include <string.h> #define MAXSIZE 100 #define TRUE 1 #define FALSE 0 // Structure defining Stack data structure struct Stack int top; int array[maxsize]; st; /* Initializes the top index to -1 void initialize() st.top = -1; /* Checks if Stack is Full or not int isfull() if(st.top >= MAXSIZE-1) return TRUE; return FALSE; /* Checks if Stack is Empty or not int isempty() if(st.top == -1) return TRUE; return FALSE; /* Adds an element to stack and then increment top index void push(int num) if (isfull()) printf("stack is Full...\n"); st.array[st.top + 1] = num; st.top++; 8 8

7 /* Removes top element from stack and decrement top index int pop() if (isempty()) printf("stack is Empty...\n"); st.top = st.top - 1; return st.array[st.top+1]; int main() char inputstring[100], c; int i, length; initialize(); printf("enter a string\n"); gets(inputstring); length = strlen(inputstring); /* Push all characters of input String to Stack for(i = 0; i < length; i++) push(inputstring[i]); /* Poping characters from stack returs the characters of input string in reverse order. We will then compare it with corresponding characters of input string. If we found a mismatch the input string is not a palindrome string for(i = 0; i < length; i++) if(pop()!= inputstring[i]) printf("not a Palindrome String\n"); printf("palindrome String\n"); 10 Ans OR Write a Program in C to read a Sparse matrix of integer values and search this matrix for an element specified by the user. typedef struct int row; int col; int value; sparse; sparse sp[maxsize]; main() int m,n,a,i,key,f=0; printf("enter the order of matrix\n"); scanf("%d%d",&m,&n); printf("enter the non-zero terms in sparse\n"); scanf("%d",&a);

8 printf("enter the row coloumn value\n"); for(i=0;i<a;i++) scanf("%d%d%d",&sp[i].row,&sp[i].col,&sp[i].value); sp[0].row=m; sp[0].col=n; sp[0].value=a; printf("row\tcoloumn\tvalue\n"); printf("%d\t%d\t%d\n",m,n,a); for(i=0;i<a;i++) printf("%d\t%d\t%d\n",sp[i].row,sp[i].col,sp[i].value); printf("enter the key element\n"); scanf("%d",&key); for(i=1;i<=a;i++) if(sp[i].value==key) f=1; if(f==1) printf("search successful"); printf("search unsuccessful"); *******

UNIT 2: STACK & RECURSION Programs demonstrated in class. Tojo Mathew Asst. Professor CSE Dept., NIE Mysuru.

UNIT 2: STACK & RECURSION Programs demonstrated in class. Tojo Mathew Asst. Professor CSE Dept., NIE Mysuru. Table of Contents 1. C Program to Check for balanced parenthesis by using Stacks...3 2. Program