scapu 0 Newbie Poster

1. Hand simiulate the sequential search algorithm on the data set given below and the search elements being 10, 05, 76, 85, 200 Data set:: 10, 80, 03, 09, 55, 32, 100, 07, 05, 02, 12, 65, 63, 22, 92, 81, 48, 76

2. Design a conventional iterative algorithm

3. Design a conventional iterative algorithm to traverse a binary tree represented in two dimensional array in preorder.

4. Design a conventional iterative algorithm to traverse a binary tree represented in two dimensional array in postorder.

I AM NOT ASKING ANYONE TO DO MY HOMEWORK. PLEASE ATLEAST SUGGEST ME SOME SITE WHERE I CAN UNDERSTAND THE CONCEPT RELATED TO ABOVE QUESTIONS AND FIND THE ANSWER. I TRIED IN NET BUT NOT GETTING RELEVANT MATERIAL.

MY email id is [email removed]