Scribd
Upload
153 views

Assignment I

This document outlines a DSA module assignment with 4 exercises on string manipulation algorithms. Students have 2 weeks to complete and submit the assignment individually. Late or copied submissions will be penalized. The assignment is out of 16 total points and covers recursive and iterative algorithms for checking palindromes, alphabetic order, encryption with a Caesar cipher, and detecting doubled letters.

Uploaded by

Yassin Morango
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
153 views

Assignment I

This document outlines a DSA module assignment with 4 exercises on string manipulation algorithms. Students have 2 weeks to complete and submit the assignment individually. Late or copied submissions will be penalized. The assignment is out of 16 total points and covers recursive and iterative algorithms for checking palindromes, alphabetic order, encryption with a Caesar cipher, and detecting doubled letters.

Uploaded by

Yassin Morango
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as RTF, PDF, TXT or read online on Scribd
You are on page 1/ 4

DSA MODULE ASSIGNMENT I

Manipulating Strings using Algorithms


Objectives
Understand the String object
Use the string class methods
Use algorithms to process text
Duration
2 Weeks starting at October 07
Deadline at October 22 20:00
Rules
The assignment is individual.
Submission out of the time or no submission will be marked zero (0).
The mark of similar or d uplicated exercises will be divided by the number of the involved
students.
Students have to explain the exercise to the stuff members after submission.
Any copies of the internet, the mark will be divides by two (2 )
If the student answer the question that was not assigned, the mark will be divides by tree
(3)
Max points 16.

Exercise I
The usual definition of a palindrome is a word that reads the same both for ward and backward,
like “otto” and “palindromeemordnilap.” An alternative way to define a property like this is to
specify a way of testing for the property. For example, we might say, “a single letter is a
palindrome, and a two-letter word is a palindrome if the letters are the same, and an y other word
is a palindrome if the first letter is the same as the last and the middle is a palindrome.” Write a
recursive method named isPalindrome that takes a String and that returns a boolean indicating
whether the word is a palindrome or not.

Exercise II
A word is said to be “abecedarian” if the letters in the word appear in alphabetical order. For
example, the following are all 6-letter En glish abecedarian words. abd est,acknow, acorsy,
adempt, adipsy, agnosy, befist, behint, beknow, bijoux, biopsy, cestuy,chintz, deflux, dehors,
dehort, deinos, diluvy, dimpsy .
a) Describe an algo rithm for checking whether a given word (String) is abecedarian, assuming
that the word contains only lower-case letters. Yo ur algorithm can be iterative or recursive.
b) Implement your algorithm in a method called isAbecedarian .

Exercise III
The Captain Crunch decoder ring works by taking each letter in a string and adding 13 to it. For
example, ’a’ becomes ’n’ and ’b’ becomes ’o’. The letters “wrap around” at the end, so ’z’
becomes ’m’. Write a method that takes a String and that returns a new String containing the
encoded version. You should assume that the String contains upper and lower case letters, and
spaces, but no other punctuation. Lower case letters should be transformed into other lower case
letters; upper into upper.
You should not encode the spaces.

Exercise IV
A dupledrome is a word that contains only double letters, like “llaammaa” or “ssaabb ”. I
conjecture that there is no dupledromes in common English use. To test that conjecture, I would
like a program that reads words from the dictionary one at a time and checks them for
dupledromity. Write a method called isDupledrome that takes a Strin g and returns a boolean
indicating whether the word is a dupledrome.

Student Exercise Student Exercise


I IV
II III
III II
IV I
I IV
II III
III II
IV I
I IV
II III
III II
IV I
I IV

Exercise Exercise
I IV
II III
III II
IV I
I IV
II III
III II
IV I
I IV
II III
III IV
IV III
I II
II I
III

You might also like