Secondary School Examination Board(Matric) 2011 - Annual Result

table width="350 Secondary School Examination Board(Matric) 2011 - Annual ResultRoll CodeRoll Number Note:- Please enter your five digit Roll Code & four digit Roll No in provided space above and press Enter Key to get your result. ...

Read More

Hall Ticket June-2011 Term End Examination (TEE)

Indira Gandhi National Open University (IGNOU) has issued the Hall Ticket for its June 2011 Term End Examination (TEE) for all the courses Enter Enrolment Number: Select Program: --Select-- ACFSACPDMACSMADACMADAOMASSOBAADMBACTBAFCBAFDBAFMPBBARBBARSBCABCOMAFBCOMCAABCOMFCABDPBEDBEDSEBLSBMITBMLTBMRHITBNSBPPBRTTBSCFMRMBSCFTBSCHOTBSCLGADBSCNBSWBTAEBTCLEVIBTCMBTCSVIBTECVIBTELVIBTMEBTMEVIBTSBTWRECAFECAHTCALCARHCBSCCDPCCEANMCCLBLCCPCCPDCCRCCSSCDCWCDMCELLCESCESECPCESEMRCETMCFECFLCFNCFSTYCGLCHBCPCHCWMCHRCIBCICCIFCIGCIHLCISCITCJLCLGMCMCHCCNCCCNGOMCNICCNMCOFCPABNCPATHACPECPFCPLTCRDCRFFCSICSMCSUSCSWCJSCTECTPMCTSCULCVAACVAPCVASCWHMDAFEDBPOFADCEDCLEDCLE(G)DCLEVIDCSVIDCYPDDTDECEDECVIDELVIDEMEDFSDFSTYMDHHMDIPPDIRDMCHDMEDMEVIDMISHEDMLTDMTDNADNHEDPEDPVCPODSMDTSDVAPFVDWEDEXMBAMADEMAEDUMAFRMMAHMAPCMAPDMAPYMARDMBAAVBMMBACNMBACTMBANIMMBARSMBATEXMMCAMCOMMCOMBPCGMCOMFTMCOMIDTMCOMMAFSMECMEDMEDSEHIMEDSEMRMEDSEVIMEGMHDMLSMPMPAMPSMSCCDMSCCFTMSCFMRMMSCFTMSCLGADMSCVMCDMSDFSMMSMACSMSOMSWMTMPGCAPPGCBHTPGCCLPGCEPGCEDSPGCMHTPGCOIPGCPPPGCSOPGDACPGDACPPGDAEPGDAPPPGDBPPGDCCPGDCJPGDDEPGDDHMPGDDMPGDEDSPGDENLWPGDESDPGDETPGDFCSPGDFMPPGDFSQMPGDFTPGDGBLPGDGMPGDHEPGDIBOPGDICGPGDIPRPGDLANPGDLPOPGDMDPGDMISHPGDMRRPGDPMPGDPSMPGDRDPGDRPPGDSLMPGDSOPGDSWPGDTPGDTRMPGJMCPGPCSEHIPGPCSEMRPGPCSEVIPGPDSEHIPGPDSEMRPGPDSEVI...

Read More

Hall Ticket for May-2011 TEE-BHM/MHA/BAIHA/FCED Program

IGNOU has issued hall ticket for may-2011 term end examination (TEE) for BA in International Hospitality Administration (BAIHA), Bachelor of Science (Hospitality and Hotel Administration) (BHM), National Centre for Disability Studies (NCDS) and Master of Science (Hospitality Administration) (MHA) programs. Enter Nine Digit Enrolment Number: Select Program: BAIHA BHM FCED MHA ...

Read More

Q. Create a tree from following traversing sequence of a tree.

Pre-order – 1 2 3 4 5 6 7In-order – 4 2 5 1 6 3 7Post-order – 4 5 2 6 7 3 1Answer: To create a tree form traversing sequence we compare pre-order and in-order or post-order and in-order.First take one item form pre-order (1), make it root (in in-order traverse 1st item is always is root)Choose 2nd item (2), check this item in in-order traverse where it is; left or right side, make child of root as its position in in-order.Now take next item (3), again check its position in in-order traverse, put in tree as its positi...

Read More

Q. Create a tree from following traversing sequence of a tree.

Pre-order – 1 2 3 4 5 6 7In-order – 4 2 5 1 6 3 7Post-order – 4 5 2 6 7 3 1Answer: To create a tree form traversing sequence we compare pre-order and in-order or post-order and in-order.First take one item form pre-order (1), make it root (in in-order traverse 1st item is always is root)Choose 2nd item (2), check this item in in-order traverse where it is; left or right side, make child of root as its position in in-order.Now take next item (3), again check its position in in-order traverse, put in tree as its positi...

Read More

Height Balanced Tree (AVL Tree)

Height balanced BST (AVL Tree):It is a special type of BST that remains balanced tree even if the input to the tree is sorted. Each node in an AVL tree maintain balance factor which is calculated as BAL = (height of left sub-tree) – (height of right sub-tree)A node is said balanced if its balanced factor is (0, -1, 1).BAL =   0-1   1  →balanced    Otherwise node is unbalanced.If a node is become unbalanced, it is made balanced by rotating the unbalanced node in opposite direction of unbalanced.NB - When the sign of balance factor is negative (-ve) then node...

Read More

Height Balanced Tree (AVL Tree)

Height balanced BST (AVL Tree):It is a special type of BST that remains balanced tree even if the input to the tree is sorted. Each node in an AVL tree maintain balance factor which is calculated as BAL = (height of left sub-tree) – (height of right sub-tree)A node is said balanced if its balanced factor is (0, -1, 1).BAL =   0-1   1  →balanced    Otherwise node is unbalanced.If a node is become unbalanced, it is made balanced by rotating the unbalanced node in opposite direction of unbalanced.NB - When the sign of balance factor is negative (-ve) then node...

Read More

Q. Write a program to count non leaf node in a tree?

/* Pass address of root in function argument   count_non_leaft(root);*/count_nonleaf(struct bintree *t){     int c1=0, c2=0;     if(t!=NULL)     {           if(t->left!=NULL||t->right!=NULL)              c1=1;          c2 = return(count_nonleaf(t->left)+c1);           return (count_nonleaf(t->right)+c2);     }     return ...

Read More

Q. Write a program to count non leaf node in a tree?

/* Pass address of root in function argument   count_non_leaft(root);*/count_nonleaf(struct bintree *t){     int c1=0, c2=0;     if(t!=NULL)     {           if(t->left!=NULL||t->right!=NULL)              c1=1;          c2 = return(count_nonleaf(t->left)+c1);           return (count_nonleaf(t->right)+c2);     }     return ...

Read More

Q. Write a program to count leaf node in a tree using recursive function.

/*Pass address of root node in function argument...count_leaf(root);*/count_leaf(struct bintree *t){     int c1 = 0, c2 = 0;     if(t!=NULL)     {           if(t->left == NULL && t->right == NULL)                      c1 = 1;           c2 = retun (count_leaf(t->left)+c1);           return (count_leaf(t->right)+c2);     }     return ...

Read More

Q. Write a program to count leaf node in a tree using recursive function.

/*Pass address of root node in function argument...count_leaf(root);*/count_leaf(struct bintree *t){     int c1 = 0, c2 = 0;     if(t!=NULL)     {           if(t->left == NULL && t->right == NULL)                      c1 = 1;           c2 = retun (count_leaf(t->left)+c1);           return (count_leaf(t->right)+c2);     }     return ...

Read More