data structure course

1- What is the eleventh Fibonacci number (1 Mark) 2- What is the minimum number of moves (from one tower to another) In the tower of Hanoi with 11 disks (1 Mark) 3- What is the maximum number of swap operations needed by adding a new node to the heap tree with 39 nodes 4- Give the state of a stack after Push A, Pop, Push B, Push C, Push D, Pop, Pop, Push E, Push F, Push G, Pop operations are executed. Assume that each stack is empty to begin. 5- What is the total number of edges in MST for a graph with 17 nodes? (1 Mark) (1 Mark) (1 Marks) 6- What is the total number of edges in complete graph with 19 nodes (1 Mark) 7- Suppose that we have numbers between 1 and 500 stored in a binary search tree and we want to search for the number 150. Which of the following sequences could not be the sequence of keys examined? (1 Mark) a. 420, 200, 410, 120, 280, 150 b. 400, 200,187, 185, 170, 150 c. 490, 70, 402, 140, 311, 150 d. 480, 120, 400, 230, 300, 150 (1 Mark) 8- What is the output of the following program? public class Myjava { static int fun( int x) { if( x >= 14) return (3*x+2); else return fun( x +3 ) -2; } public static void main(String args[]) { System.out.printl" the result of fun(3) =" +fun(3); }}