Sunday, May 29, 2011
Popular Posts
-
/* program on Evaluation of prefix expression */ #include "stdio.h" #include "stdlib.h" #include "math.h" #def...
-
TREE It is a non-linear data structure that may contain several contents. In a tree the nodes are connected to each other a parent and child...
-
FEES Rs. 6800 /- per annum + Rs.600 /- for MTE-03 + Rs. 3 ,000 /- for CIC for non-Maths Students Admission fee : Rs.4800/- Per semester f...
-
/*Pass address of root node in function argument... count_leaf(root);*/ count_leaf(struct bintree *t) { int c1 = 0, c2 = 0; if(t!=...
-
/* program on conversion of infix to postfix expression */ #include"stdio.h" #include"stdlib.h" #define OPT 0 #define OP...
-
/* priority queue */ #include "conio.h" #include "stdio.h" #include "stdlib.h" struct q { int info; struct q...
-
/* Stack static implementation program by Sweta Mam */ #include"conio.h" #include"stdio.h" #include"stdlib.h" ...
-
/* Doubly link list by sweta mam */ #include"conio.h" #include"stdio.h" #include"stdlib.h" struct dlist { int ...
-
/* program on conversion of infix to prefix expression */ #include "stdio.h" #include "stdlib.h" #include "string.h...
-
There are five questions in this assignment. Answer all the questions. Question 1: (i) Find the complex conjugate of (3+5i)/(1+2i) Here z...
Share
0 comments:
Post a Comment