Write an algorithm which counts the number of connected components in a graph.
Write a short note on hashing.
State the properties of a binary tree. Draw the binary search tree with keys given as in order J R D G T E M H P A F Q and then write its inorder traversal
What are the factors to be considered while choosing a sorting technique? Write the average and best case analysis of insertion sort.
Consider circular Queue Q with 6 spaces where front=2, rear=4.
Q=_ LMN_ _.
Add O,
Add P,
Delete two letters,
Add Q,
Delete one letter.
Describe queue after above each operation.
Translate the following infix expression into its equivalent postfix notation and also evaluate it
15+(2*9-(6/3-69ì3)*1)*2
(where ì is upside arrow)
Show all the intermidate steps for translation and evaluation.
