Search & Filtering
Display the following Employee information using the variables.
Name
Age
Gender
Address
Contact No.
Monthly Salary
Create a program that takes in two words, check for equality ignoring the cases, if the words are equal the print the word in upper case with an appropriate message however if the words are different then print the two words in lower case with an appropriate message.
Word Count
Given a sentence S, write a program to print the frequency of each word in S. The output order should correspond with the word's input order of appearance.
Numbers in String - 2
Given a string, write a program to return the sum and average of the numbers that appear in the string, ignoring all other characters.
Secret Message - 2
Given a string, write a program to print a secret message that replaces characters with numbers 'a' with 1, 'b' with 2, ..., 'z' with 26 where characters are separated by '-'.
Note: You need to replace both uppercase and lowercase characters. You can ignore replacing all characters that are not letters.
a b c d e f g h i j
1 2 3 4 5 6 7 8 9 10
k l m n o p q r
11 12 13 14 15 16 17 18
s t u v w x y z
19 20 21 22 23 24 25 26
a program that asks for the number of tickets sold and computes the total cost of the purchase at Walt Disney World based on the following information:
Walt Disney World sells tickets for $109 per day. Discounts are given for purchasing multiple days of tickets at the same time. The discounts are given according to the following table:
a. Use Prim’s algorithm starting at node A to compute the Minimum Spanning Tree (MST) of the following graph. In particular, write down the edges of the MST in the order in which Prim’s algorithm adds them to the MST. Use the format (node1; node2) to denote an edge.[8 marks]
a. Describe the concept of a Binary heap and the heap order property. [10 marks]
b. Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]
a. Describe the concept of a Binary heap and the heap order property. [10 marks]
b. Explain the use of the binary heap as an effective implementation for a priority queue [10 MARKS]
Create a class to implement a queue using a circular array[20 marks]
a. The class should contain functions to
i. Insert a new value, [5 marks]
ii. Delete a value. [5 marks]
iii. Change a value equal to X to a value equal to Y.[5 marks]
iiii. Count all value equal to X in the queue. [5 marks]
b. For each function above perform an asymptotic analysis and state the worst case performance of the algorithm[5 marks]
