Reference no: EM13347461
Task 01
1.1 Write down the pseudo code for merge sort algorithm and using bellow array values perform the merge sort algorithm. Provide all the steps and describe them.
1.2 Write down the pseudo code for selection sort algorithm and using bellow array values perform the selection sort algorithm. Provide all the steps and describe them.
|
28
|
28
|
75
|
93
|
12
|
8
|
55
|
71
|
34
|
47
|
83
|
1.3 Consider the values for the array L = {2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20} and Implement a binary search on an ordered array. Compare the number of key comparisons and write down all the necessary steps to search values 3, 18 and 1 using binary search.
1.4 A) Following data is inserted to a binary tree. Draw the binary tree after inserting data and explain the inserting methodology.
|
77
|
94
|
41
|
112
|
155
|
21
|
56
|
99
|
47
|
83
|
B) Print the data that you have inserted in part (A) in the following strategies.
I. Inorder
II. Preorder
III. Postorder
C) What are the facts you should take into consideration when deleting a node from a binary tree. Explain clearly for different situations with examples.
Task 02
You are required to write a menu driven program which will maintain a list of car models, their price, name of the manufacturer, engine capacity etc., as a doubly linked list. The menu should make provisions for inserting information pertaining to new car models, delete obsolete (outdated) models, and update data such as price besides answering queries such as listing all car models within a price range specified by the user and listing all details given a car model.
2.1 Design the algorithms that required in above scenario.
2.2 Implement the above programme with the required algorithms by using an executable programming language (Java/C++).
2.3 Provide evidence and solutions for error handling during software implementation
2.4 Carry out testing on implemented solution and provide evidence by including suitable screenshots.
Task 03
3.1 Identify a method to count and record the number of occurrences of each vowel in uppercase or lowercase in any given paragraph. Explain it.
3.2 Implement an algorithm to achieve above explained method using suitable programming language. Paragraph is given bellow.
A data structure is an arrangement of data in a computer's memory or even disk storage. An example of several common data structures are Arrays, Linked Lists, Queues, Stacks, Binary Trees, and Hash Tables. Algorithms, on the other hand, are used to manipulate the data contained in these data structures as in searching and sorting.
Output must print the following lines, inserting the number of appearances of the vowel in lowercases and uppercases, and the total appearances.
A: __ Lowercase , __ Uppercase , __ Total
E: __ Lowercase , __ Uppercase , __ Total
I : __ Lowercase , __ Uppercase , __ Total
O: __ Lowercase , __ Uppercase , __ Total
U: __ Lowercase , __ Uppercase , __ Total
3.3 Identify different methods to reverse a String. Explain all the identified methods.
3.4 Implement a method to reverse any String Value by using String operations and String manipulation.