Posts

The Perks of Transitioning Into a Developer

-
Image
Having studied in a convent school my syllabus was pretty much bound to a serious, stern and a prescribed format. I was supposed to know whatever was there in the books, and further scavenge more books to obtain as much information as I could in order to amalgamate marks in my papers. I was introduced to coding from my fifth standard itself. My childhood was pretty filled with BASIC, JAVA core and a rudimentary amount of C++. I never knew there existed a world that is larger, a world beyond coding, a world that is so real. Having a knack for technical knowledge, and also being a girl child, I always used to feel a tinge of difference, a bit of unnatural segregation. When all my friends were busy drafting scripts for plays, interning in organizations as journalists, or maybe scripting articles, I was here buried inside a laptop, coding. After I finished my 12 th boards and competed in a rat race of engineering exams, I had to repeat a year. Why? People say because I could
2 comments
Read more

The K-ary Tree Concept

-
The k-ary Tree ·               The K-ary tree is theory derived from Graph theories.         Also sometimes referred as a k-way tree , an N-ary tree, or an M-ary tree. Program Implementation of K-ary Tree where k=3 Using structure As Pointers has been given (implemented in C): #include<stdio.h> #include<conio.h> struct NODE {     char* word;     int depth, children;     struct node **child }; typedef struct NODE node; node *createTree(); node *createNode(char* w, int d); int main() {     node *root, *pos;     root=createNode("root",0);  //Height of the Root node is initially set as Zero     pos=root;   //Current navigation position of the tree is at the root.     printf("root has been created with word: %s \n",pos->word);     char *array[]={"String1","String2","String3"};     int i;     pos->child = malloc(3 * sizeof(node *));     for (i=1;i<=3;i++)   
Post a Comment
Read more