Tech BCA

 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

 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

 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] =...