Description
- to program a few elementary data structures so we can experiment with them later
- Develop a singly linked [20 points]
- Using your linked list, develop a You must implement it yourself; [20 points] you may not use any built-in features of the language or its libraries.
- Using your linked list, develop a You must implement it yourself; [20 points] you may not use any built-in features of the language or its libraries.
- Download the the text Jile txt from our web site. [30 points]
- Read it line by line into
- Check each element of the array to see if it’s a (Ignore spaces and capitalization.) Print it if so.
‣ To check whether or not a given string is a palindrome, take it character by character and push each on a stack and enqueue each on a queue. When every character is on a stack and in a queue, pop the stack and dequeue the queue one character at a time. If they always match, then the string is a palindrome. (There are other ways to check for palindromes. I don’t care. Do it this way.)
- Create a LaTeX document that includes code listings (with line [10 points] numbers) for your stack, queue, and main Explain how each works, referencing line numbers in the listings to be really clear.
Your code must …
- separate structure from
- be professionally formatted yet uniquely yours (show some personality)
- use and demonstrate best
- make me proud to be your
- Linked lists are described in our text in chapter 2, starting on page EC.
- Stacks and queues are described in our text in the beginning of chapter 10, starting on page 1110
