I'm a beginner learner to Java (currently taking an introduction course) and I have a really tough professor. He's moving way too fast. I've been staying after school to get help for hours, but its all so time consuming.
Today he gave us 2 assignments:
1. A string is a palindrome if you obtain the same string when reading it backward. For example, "DAD", "ada", etc. are palindrome. But "abc" and "english" are not. Please use stack and queue to write a program which will check an inputted sting if it is a palindrome.
2. Describe a good algorithm for concatenating two singly linked list L and M, with header sentinels, into a single list L' (L prime) that contains all the nodes of L followed by all the nodes of M.
HINT: This concatenation operation need not search all of L and M.
I have to write a program for both of these assignments. Can someone help me get started?
Last edited by emasha; 04-24-2006 at 06:13 PM.
Last Post: 06-14-2006, 03:16 PM
Last Post: 05-13-2005, 06:46 AM
By Rob Abbe in forum Talk to the Editors
Last Post: 01-13-2003, 02:57 PM
By Mike Tsakiris in forum .NET
Last Post: 10-04-2002, 05:32 PM
By JJ in forum Enterprise
Last Post: 07-06-2000, 04:50 AM
Top DevX Stories
Easy Web Services with SQL Server 2005 HTTP Endpoints
JavaOne 2005: Java Platform Roadmap Focuses on Ease of Development, Sun Focuses on the "Free" in F.O.S.S.
Wed Yourself to UML with the Power of Associations
Microsoft to Add AJAX Capabilities to ASP.NET
IBM's Cloudscape Versus MySQL