Question: java programming language . this is the full question and pg 167 of algorithms book have the same question. this one is extended version of


java programming language . this is the full question and pg 167 of algorithms book have the same question. this one is extended version of that question. so there is nothing to do with pg.167. this is the actual question. please can some one help me with this.
Exercise Variation on Ex. 1.3.33 . The purpose of this exercise is to write a doubly-linked list implementation of a Deque data structure and use it in a client program that reads a sequence of characters from the DNA alphabet A, C, T, G) to determines if it is a Watson-Crick Complemented Palindrome (details below!) To this end you should create a project WCPalindrome, within which you will create a file Deque.java implementing the deque data structure and complete the class WCPalindrome which uses this class. 1. Design and implement a class which provides a double-ended quue, o deque. A deque (pronounced "deck" s like a stack or queue which supports the addition and removal of items at both ends. Create a generic data type, Deque, which implements the following AFI which is an expanded version of what appears on page 167 public class DequeItem> isplements IterablecItem> public Deque) public boolean isEmpty) public int size) public void puchLeft (Item item) // insert the item at the "front" public void pushRight (Item ite // insert the item at the "rear" public Item popLeft public Item popRightO public Iterator
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
