1. Write step by step code to delete element from existing Doubly Linked List. Suppose that all declarations are done

Transcription

1 1. Write step by step code to delete element from existing Doubly Linked List. Suppose that all declarations are done. first NULL 42 A A 13 A A 6 NULL Write code here first NULL 42 A A 13 A A 6 NULL p q first NULL 42 A A 13 A A 6 NULL p q first NULL 6 A 2. Write step by step code to delete element from existing Doubly Linked List. Suppose that all declarations are done first NULL 76 A A 1 A A 63 NULL Write code here first NULL 76 A A 1 A A 63 NULL p first NULL 76 A A 1 A A 63 NULL p first NULL 76 A A 1 N

2 3. Draw step by step diagrams to insert a new node to a LL according to given code fragment. Suppose that all declarations are done and there are 4 elements in declared Linked List. LL *first, *newnode; newnode=new LL; newnode->info = 43; newnode->link=first->link->link first->link->link=newnode; 4. Draw step by step diagrams to insert a new node to a LL according to given code fragment. Suppose that all declarations are done and there are 4 elements in declared Linked List. LL *first, *newnode; newnode=new LL; newnode->info = 19; newnode->link=first->link first->link=newnode;

3 5. Write a function/code to delete element from the beginning of Doubly Linked List. suppose that first pointer will point to 1 st element of DLL from the left and last pointer will point to last element of DLL from the right 6. Write a function to insert an element to the end of Backward LL. suppose that first pointer will point to 1 st element of BLL (from the left) and there is no a pointer which is pointing to the last element. Last element has a NULL value in address part of the node. 7. Draw Binary Tree according to given number series. 4, 1, 3, 8, 5, 7, Write print-out of above given binary tree as left-root-right and root-left-right. 9. Find 4 errors on given code fragments and write corrections directly after the erroneous line. void pop() top1 = top; if (top1!= NULL) return; else top1->ptr = top1; delete top; top = top1; int remove() int x; if(front <= NULL) cout<<"empty\n"; else p = front; front->next = front; delete(p); 10. Write a pop function of stack using Backward LL 11. Write a push function of stack using Backward LL 12. Write a delete function of queue using Backward LL 13. Write an insert function of queue using Backward LL 14. Write the function to print the LL forward. 15. Write a function to search needed element (value) in LL. 16. Write a function to destroy LL. 17. Write a function to delete needed element (value) from backward LL. 18. Write the function to build LL Backward. 19. Write a function to print LL Backward. 20. Write a function to search needed element (value) in backward LL. 21. Write a function to delete needed element (value) from backward LL. 22. Write a function to destroy Backward LL. 23. Write a function to build Double LL. 24. Write a function to print Double LL backward. 25. Write a function to add a node to Double LL in anywhere middle. 26. Write a function to delete a node from Double LL in anywhere middle. 27. Write a function to search needed element in Double LL. 28. Write a function to Destroy Double LL. 29. Write a pseudo code of an algorithm to find repeated elements/values of an array. 30. Write a pseudo code of an algorithm to find max/min element of an array. 31. Write a pseudo code of an algorithm to needed element from an array. 32. Write a pseudo code of Bubble Sort algorithm. 33. Write a pseudo code of Selection Sort algorithm. 34. Write a pseudo code of Insertion Sort algorithm.

4 35. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[4]=4, 3, 2, 1. int out, in, min; for (out = 0; out < n - 1; out++) min = out; cout << "" << min << "\t"; for (in = out + 1; in < n; in++) if (arr[in] < arr[min]) min = in; cout << "" << min << "\n"; for (int i = 0; i < n; i++) cout << arr[i] << "\t"; cout << endl; swap(arr[min], arr[out]); 36. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[5]=1, 7, 3, 2. int out, in, min; for (out = 0; out < n - 1; out++) min = out; cout << "" << min << "\t"; for (in = out + 1; in < n; in++) if (arr[in] < arr[min]) min = in; cout<< "" << min << "\n"; swap(arr[min], arr[out]); for (int i = 0; i < n; i++) cout << arr[i] << "\t"; cout << endl;

5 37. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[5]=1, 7, 3, 7, 2. for(int j=0; j<n-1; j++) for(int i=0; i<n-1-j; i++) if(arr[i]<arr[i+1]) int temp=arr[i]; arr[i+1]; temp; cout<<arr[i]<<"\t"; cout<<endl; 38. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[4]=1, 2, 3, 4. for (int j = 0; j<n - 1; j++) for (int i = 0; i<n j; i++) if (arr[i]<arr[i + 1]) cout <<""<<arr[i]<<"\t" <<""<<arr[i+1]<<endl; int temp = arr[i]; arr[i] = arr[i + 1]; arr[i + 1] = temp; for (int i = 0; i<n; i++) cout << arr[i] << "\t"; cout << endl;

6 39. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[5]=3, 5, 4, 5, 1. int out, in, min; for (out = 0; out < n - 1; out++) min = out; cout << "out=" << out << "\t"; for (in = out + 1; in < n; in++) if (arr[in] < arr[min]) min = in; cout<< "" << min << "\n"; swap(arr[min], arr[out]); for (int i = 0; i < n; i++) cout << arr[i] << "\t"; cout << endl; out= out= out= out= 40. Write output of the following code fragment. Suppose that all declarations are done. Input is array arr[5]=1, 7, 3, 7, 2. for(int j=0; j<n-1; j++) cout<<"j="<<j; for(int i=0; i<n-1-j; i++) if(arr[i]<arr[i+1]) int temp=arr[i]; arr[i+1]; temp; cout<<"\t i="<<i<<endl; cout<<arr[i]<<"\t"; cout<<endl;

7 41. Write output of the following C++ code fragment. Suppose that all declarations are done. // Input array is arr[5]=8, 8, 7, 6, 1 int j; int temp; for (int i=1; i<n; i++) temp=arr[i]; cout<<"inserted element if not sorted: " <<arr[i]<<"\n"; for(j=i-1; (j>=0)&&(arr[j]>temp); j--) arr[j+1]=arr[j]; cout<<"shifted element: "<<arr[j+1]<<endl; arr[j+1]=temp; for (int i=0; i<n; i++) cout<<arr[i]<<"\t"; cout<<endl; Inserted element if not sorted: Shifted element: Inserted element if not sorted: Shifted element: Inserted element if not sorted: Shifted element: Inserted element if not sorted: Shifted element: 42. Write all iterations of sorting for Bubble Sort, Selection Sort and Insertion Sort algorithms. Input array is arr9, 8, 7, 6, 5 Bubble Sort iterations Insertion Sort iterations Selection Sort iterations 43. Write sorting steps of Merge and Quick Sort algorithms. Input is array arr[4]=4, 3, 2, 1. Merge Sort sorting steps Quick Sort sorting steps

8 44. Denote big-o notation of given code fragments [4 points] for (int i = 0; i < 3; i++) for (int j = 0; j < 2; j++) for (int k = 0; k < 1; k++) void examplebigo(int n) // part 1 dosomething(); // part 2 dosomething(); Part 1 Part 2 Part 3 // part 3 for(int j=0; j<n; j++) dosomething(); // part 4 return; Part 4 Bubble Sort Insertion Sort 45. Write a recursive program solution for below given statement. Find repeated digits of given integer by user. Integer > digits are not repeated Integer > digit 3 is repeated Integer > digits 2 and 4 are repeated 46. Write a recursive program solution for below given statement. Find odd digits of given integer by user. Integer > odd digit(s) is/are 1, 3, 5 Integer > odd digit(s) is/are 3 Integer > no odd digit(s) are found 47. Write a recursive program solution for below given statement. Find even digits of given integer by user. Integer > even digit(s) is/are 2, 4 Integer > no odd digit(s) are found Integer > odd digit(s) is/are Write a recursive program solution for below given statement. Count odd digits of given integer by user. Integer > There are 3 odd digit(s) Integer > There are 5 odd digit(s) Integer > There are no odd digit(s) 49. Write a recursive program solution for below given statement. Count even digits of given integer by user. Integer > There are 2 even digit(s) Integer > There are no even digit(s) Integer > There are 5 even digit(s)

9 50. Write output of the following C++ code fragment. Suppose that all declarations are done. // Input array is arr[5]=2, 5, 6, 1, 2 int i; int temp; for(int j=1; j<n; j++) temp=arr[j]; for(i=j-1; i>=0 && arr[i]>temp; i--) arr[i]; cout<<"" <<arr[i+1]<<"\n"; cout<<arr[i]<<"\t"; cout<<endl; temp; cout<<"" <<arr[i+1]<<endl;