Q.1. Determine the minimum weighted path length P for six weights 4, 15, 25, 5, 8, 16. Draw the huffman tree also for the given weights. Evaluate the huffman code for each weight.

Q.2. Determine the Inorder, preorder and postorder traversal for the given tree:

Q.3. Convert the subsequent expressions in binary expression tree.

A - (B*C) + D $ (E*F)

(b) (A-B) * (B-C) / (C-D)

(c) (3x+4y) - (5x/7y)2

After constructing the expression tree evaluate the inorder, preorder and postorder traversals.

Q.4. (a) Prepare a binary tree. Given,

Post Order: D H I E A J F N P G C B.

Inorder: D H A I E B F J C N G P

(b) Prepare a binary tree. Given,

Preorder: D B C A G E F H I J.

Inorder: B C D G E A H F I J

(c) Prepare a binary tree. Given,

Preorder: K A E F C D H L B

Inorder: E A C F K H D B L

Q.5. Perform the subsequent operations in BST:

Insert Z, A, C, D, B, E, F, N, M, P, T, U, R, O, Q.

Delete M and then D.

Q.6. Prepare an AVL tree by inserting the subsequent elements in order of their occurrences:

44, 10, 11, 96, 7, 14, 53, 47, 50, 101, 4, 1

Then Delete 7, Delete 47 and then delete 101.

Q.7. A 3 way search tree constructed out of an empty search tree with subsequent keys in order as given: D, K, P, V, A, G. Then Delete A and K.

## Determine the mean salary as well as the number of salariesDetermine the mean salary as well as the number of salaries. |

## Cloud computing assignmentWSDL service that receives a request for a stock market quote and returns the quote |

## Design of sample and hold amplifiers for 100 msps by using nThe report is divided into four main parts. The introduction about sample, hold amplifier and design, bootstrap switch design followed by simulation results. |

## C++ program to evaluate expressions combining set unionCreate a C++ program to evaluate expressions combining set union, set intersection and parentheses |

## How to access virtualised applications through unicoreHow to access virtualised applications through UNICORE |

## Write a c++ program to find the intersectionWrite a C++ program to find the intersection, A set is a collection of distinct entities regarded as a unit, being either individually specified or (more usually) satisfying specified conditions. |

## Survey of fault tolerance policy for load balancing scheme oThis paper investigates about fault-tolerance in load balancing schemes in distributed environment. There are some more parameters influencing QOS but our main focus is on fault tolerance and load balancing. |

## Recursive implementation of euclids algorithmWrite a recursive implementation of Euclid's algorithm for finding the greatest common divisor (GCD) of two integers |

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd