Documente Academic
Documente Profesional
Documente Cultură
Date of Submission:
I hereby, declare that I know what plagiarism entails, namely to use another’s work and to present it
as my own without attributing the sources in the correct way. I further understand what it means to
copy another’s work.
A palindrome is a phrase that reads the same forwards as it does backwards. For example, “DAD”,”
MOM”,” madam” are examples for palindrome.
1.1. Write a program that figures out whether the given string is a palindrome. Use suitable
String operations to avoid white spaces and punctuation (LO3.2) (D3.4)
For example:
1.2. Create an Example Stack class for this problem. Use Array List or an array to implement
the Stack, use suitable stack operations. (LO 2.1)
1.3. Identify and implement opportunities for error handling and reporting. (LO 2.2)
1.4. Prepare a user manual for the developed solution to assist the users to work with it.
(M 3.1)
Task 2
‘Read-With-Us’ Library Systems provides book reservation facilities to their members. The reservation
system uses a waiting list or book or other reading material allocation. According to the library rules
and regulations, when possible match between reservation and the book is found the member is
contacted via email or SMS and informed. If member is not responding within the given time period,
she or she is places back of the waiting list and must wait again.
We will simulate this process using a queue, and simplify the rules. We will ignore the realistic
constraints of the members, and simply have each member store a reference number for the book (a
random number). We will also assume that each book, once accepted, will be occupied from a
member ID.
Insert book details through the keyboard. Each book should have Reference number (a random
number ex: 2552)
The book Assignment process should remove a member from the queue if the member “accepts” the
reservation. If the member accepts then delete the member node. If the member rejects the
reservation delete the member, insert him to the back of the queue and compare next member and
repeat. This process repeats until all members find their book
2.1. Write your own implementation of the queue by using a linked list for this problem with
all the queue operations. (LO 1.1)
2.2. Test the above application with a suitable test cases (LO 2.3)
3.1 Implement Linear/Binary search using recursive algorithm and non-recursive algorithm,
and compare the performance. (LO 1.3)
3.2. Sort the array given below with two different algorithms and compare the performance.
{12, 35, 30, 85, 69, 102, 99}
(LO 1.2)
3.3. Explain common string operations such as concatenation, substring, etc., also state their
practical applications by giving suitable examples. (LO 3.1) (M1.3)
Comments:
Assessor Name :
Date :
Signature :