algorithm problems

Consider the 0-1 knapsack problem, in which we are given a set of n objects (w[i], b[i]), where w[i] and b[i] are the weight and prot of object i respectively, and knapsack limit W. Design a random walk local search algorithm and give the pseudo code description. For the Traveling Salesman Problem (TSP), define heuristic function, design a backtracking algorithm in which the search process is guided by the heuristic function, and give the pseudo code description. (b) one local search strategy is: start with any complete tour, perform pairwise ex- changes at each step. Give the pseudo code description of a hill climbing algorithm using this strategy.