madOld73/Compete
Public repository.
Public GitHub Catalog
Discovered Oct 5, 2026
madOld73 / Palindromes
-- Name: Madison Tilden -- Date: TBA -- Course: ITEC 320 Principles of Procedural Programming -- Purpose: When reading from standard input, -- the input to your client will be a sequence of phrases, -- with any amount of white space allowed around any of the phrases. -- The phrases themselves will not contain white space, -- although they can contain non-letters. --String: b --Status: Palindrome as is --String: madamimadam --Status: Palindrome as is --String: Madam-I-madaM --Status: Palindrome as is --String: madamImAdam --Status: Palindrome when converted to upper case --PalStr: MADAMIMADAM --String: maDamI'maDam! --Status: Palindrome when non-letters are removed --PalStr: maDamImaDam --String: !madam.I'm.Adam? --Status: Palindrome when converted to upper case and non-letters are removed --PalStr: MADAMIMADAM --String: randomstring --Status: Never a palindrome
About this discovery
This repository is cataloged as part of our automated global GitHub synchronization. Full telemetry, velocity snapshots, and code summaries are scheduled for continuous enrichment.
#29841166GitHub System ID
madOld73Organization / User
PublicVisibility
ActiveCatalog Status
More from madOld73
madOld73/Packaged-Fruit
Public repository.
madOld73/Fruits
-- Name: Madison Tilden -- Date: October XX, 2014 -- Course: ITEC 320 Principles of Procedural Programming -- Purpose: This program is to help a fruit breeder analyze a set of -- data describing fruit trees and sample pieces of fruit found on those trees. -- You can enter your data from the command line or from a file -- The input file will contain data on between one and one thousand trees, -- inclusive, and on between 0 and 20 samples per tree, also inclusive. -- The information for each tree will be a sequence of items as follows: -- The keyword "TREE". -- A tree identification string of exactly 7 letters or digits. -- After a tree identification string come a possibly empty sequence of -- data on fruit samples. Each piece of fruit will be introduced by the -- keyword "FRUIT", followed by three words to describe the following -- characteristics, in this order: -- Size: small, midsize, large -- Firmness: soft, firm, hard -- Taste: bland, sweet, sour -- A tree with a given ID number can appear more than once in the data. -- Standard input will contain a sequence of commands that will direct -- the program's output. These commands determine program output and operation, as follows: -- "Trees": Output only Tree id number and number of fruit samples -- "Averages": Output as in Trees, plus the average and standard deviation of each category for each tree. -- "Fruits": Output as in Trees, plus each fruit and average and standard deviation as in Averages -- "Quit": Halt the program
madOld73/Seven-segment-display
-- Name: Madison Tilden MWF 2PM -- Date: Oct 2, 2014 -- Course: ITEC 320 Procedural Analysis and Design -- Purpose: Your program will read, from standard input and until eof, -- pairs of 7-character strings. Each string represents the segments -- of a seven segment display, and each character will be '1' or '0', -- representing that the segment is on or off, respectively. Each pair -- is supposed to represent sequential digits; however, there might be -- errors in the bit strings and the pair of strings might not represent -- a valid pair of sequential digits. The task of the assignment is to -- determine which pair(s) of sequential digits is closest to the pair -- of input strings. We define closest to mean have the smallest -- Hamming Distance (HD). -- SAMPLE INPUT -- 1100111 0000011 -- 0000011 0111110 -- 0011111 1011101 -- 1001011 0010011 -- creates this output: -- 1100111 0000011 : Original Pair -- 1110111 0000011 : Closest Pair = 0 1. Distances: 1 0. Total: 1 -- 0000011 0111110 : Original Pair -- 0000011 0111110 : Closest Pair = 1 2. Distances: 0 0. Total: 0 -- 0011111 1011101 : Original Pair -- 0011111 1001011 : Closest Pair = 3 4. Distances: 0 3. Total: 3 -- 1001011 1011101 : Closest Pair = 4 5. Distances: 3 0. Total: 3 -- 1011101 1111101 : Closest Pair = 5 6. Distances: 2 1. Total: 3 -- 1001011 0010011 : Original Pair -- 1001011 1011101 : Closest Pair = 4 5. Distances: 0 4. Total: 4 -- 1111101 0010011 : Closest Pair = 6 7. Distances: 4 0. Total: 4 -- 1011011 1110111 : Closest Pair = 9 0. Distances: 1 3. Total: 4