is it possible to do this using java. Interface to be implemented:public interface TicTacToe{/** Starts a new game on a board of size x size.@return void. */public void reset(int size);/** Retrieves either'X' or 'O' from the position x and y on theboard.@return Char ' ', 'X' or 'O'.@throws TicTacToeException ("Invalid coordinates") if values x,yexceeds board size. */public Char boardValue (int x, int y);/** Simulates palyer A move. Player A plays 'X'.@return 1 if player A won. 0 if this was the last move and the boardis full, thus draw. -1 if the game is not finished.@throws TicTacToeException ("Invalid coordinates") if values x,yexceeds board size. TicTacToeException ("Cell is already used") ifthe cell at coordinates x,y was already used before */public int playerAMove (int x, int y);/** Simulates palyer B move. Player B plays 'O'.@return 1 if player B won. 0 if this was the last move and the boardis full, thus draw. -1 if the game is not finished.@throws TicTacToeException ("Invalid coordinates") if values x,yexceeds board size. TicTacToeException ("Cell is already used") ifthe cell at coordinates x,y was already used before */public int playerBMove (int x, int y);} // end TicTacToe 2. Implement an ADT that can used as a Tic-Tac-Toe game board. Your ADT will implement the interfacegiven below. In the main method also include a simple usage example.Here are the rules of N x N Tic-Tac-Toe game:Players take turns placing characters into empty squares (" ").The first player Aalways places "X" characters, while the second player Balways places "0" characters."X" and "O" characters are always placed into empty squares, never on filled ones.The game ends when there are N of the same (non-empty) character filling any row, column, or diagonal.Thegame also ends if all squares are non-empty.No more moves can be played if the game is over.Exception class to be used:public cla:TiсTaсТоеExceptionException {public TicTacToeException (String message) {super (message);}

Algorithm: Start the program. Read the size of the game. Create a array for the game. Read the…

Answered: is it possible to do this using java.

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

Implement an ADT that can used as a Tic-Tac-Toe game board. Your ADT will implement the interface given below. In the main method also include a simple usage example.Here are the rules of N x N Tic-Tac-Toe game:• Players take turns placing characters into empty squares (" ").• The first player A always places "X" characters, while the second player B always places "O" characters.• "X" and "O" characters are always placed into empty squares, never on filled ones.• The game ends when there are N of the same (non-empty) character filling any row, column, or diagonal.• The game also ends if all squares are non-empty.• No more moves can be played if the game is over
Implement the design of the Pizza class so that the following output is produced:[Your code should work for any number of parameters added in the set_toppings_info method]# Write your codes here.print("Pizza Count:", Pizza.pizza_count)print("=======================")p1 = Pizza("Chicken")p1.set_toppings_info(25, 1, 4, 0)p1.display()print("------------------------------------")p2 = Pizza("Olives")p2.set_toppings_info(15, 1.5, 0, 0)p2.display()print("------------------------------------")p3 = Pizza("Sausage")p3.set_toppings_info(50, 5, 2, 0)p3.display()print("=======================")print("Pizza Count:", Pizza.pizza_count)Output:Pizza Count: 0=======================Toppings: Chicken25 calories1 g fat4 g protein0 g carbs------------------------------------Toppings: Olives15 calories1.5 g fat0 g protein0 g carbs------------------------------------Toppings: Sausage50 calories5 g fat2 g protein0 g carbs=======================Pizza Count: 3
Write a simple card game called WAR in C++ that uses a Card class to build a Deck class of 52 cards.Then use the Deck class to play. Only two people can play, one card is dealt face up and the highest value card wins the game, unless they're the same in, which case it's a tie. Here are the methods you will need to build; Deck class- public Deck(), public void refreshDeck(), public Card Deal(), public void shuffle(), public int cardsLeft(), public void showDeck(). Card class- public Card(), public Card(char r, char s), public int getValue(), public void showCard(). Remember to create seperate interface and implementation files for the C++ program. Use arrays to store values and not pointers for the Deck and Cards. .
In Java, give an example of a method that requests Name input. Then show another method, in the same application, that searches an object array in an object class for duplicates and reports an error when there is one. How would you utilize the second method with the first one?
Give the names of the two methods that we have to have to implement interface Iterator as shown in RED below.
Please implement in Java implement a keyed bag in which the items to be stored are strings (perhaps people’s names) and the keys are numbers (perhaps Social Security or other identification numbers). So, the in- sertion method has this specification: public void insert(String entry, int key);// Precondition: size( ) < CAPACITY, and the // bag does not yet contain any item// with the given key.// Postcondition: A new copy of entry has// been added to the bag, with the given key. When the programmer wants to remove or retrieve an item from a keyed bag, the key of the item must be specified rather than the item itself. The keyed bag should also have a boolean method that can be used to determine whether the bag has an item with a specified key. In a keyed bag, the pro- grammer using the class specifies a particular key when an item is inserted. Here’s an implementation idea: A keyed bag can have two private arrays, one that holds the string data and one that holds the corresponding…
Can you implement the Student class using the concepts of encapsulation? A solution is placed in the "solution" section to help you, but we would suggest you try to solve it on your own first. You are given a Student class in the editor. Your task is to add two fields: ● String name ● String rollNumber and provide getter/setters for these fields: ● getName ● setName ● getRollNumber ● setRollNumber Implement this class according to the rules of encapsulation. Input # Checking all fields and getters/setters Output # Expecting perfectly defined fields and getter/setters. There is no need to add constructors in this class.
Can you implement an interface in your class? A solution is placed in the "solution" section to help you, but we would suggest you try to solve it on your own first. Problem Statement# You are given an interface Addition which contains a method signature int add(int num1, int num2). You need to write a class called Calculator which implements the Addition interface. The add(int, int) method takes two integers and returns their sum. Input# Calls the add(int, int) method by passing num1 and num2. Output# Returns the addition of num1 and num2.
You have a card on which the letter J is written on one side and K on the other. You want to see all of the possible ways the card will land if you drop it n times. Write a recursive method that prints each session of dropping the cardswith J's and K's in java?
Modify the GeometricObject class to implement the Comparable interface and define a static max method in the GeometricObject class for finding the larger of two GeometricObject objects. Draw the UML diagram and implement the new GeometricObject class. Write a test program that uses the max method to find the larger of two circles, the larger of two rectangles.using java programming
Write a program in C that simulates a checkout line at a supermarket. The line is a queue object. Customers (i.e.,customer objects) arrive in random integer intervals of 1–4 minutes. Also, each customer is served in randominteger intervals of 1–4 minutes. Obviously, the rates need to be balanced. If the average arrival rate is largerthan the average service rate, the queue will grow infinitely. Even with “balanced” rates, randomness can stillcause long lines. Run the supermarket simulation for a 12-hours a day (720 minutes) using the followingalgorithm:1. Choose a random integer from 1 to 4 to determine the minute at which the first customer arrives.2. At the first customer’s arrival time: Determine customer’s service time (random integer from 1 to 4);Begin servicing the customer. Schedule arrival time of next customer (random integer 1 to 4 added to the current time).3. For each minute of the day: If the next customer arrives, Say so, Enqueue the customer.Schedule the arrival time of…
Modify the GeometricObject classto implement the Comparable interface and define a static max method in theGeometricObject class for finding the larger of two GeometricObject objects.Draw the UML diagram and implement the new GeometricObject class. Writea test program that uses the max method to find the larger of two circles, the largerof two rectangles.

SEE MORE QUESTIONS

Recommended textbooks for you

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

Database System Concepts

Computer Science

ISBN:

9780078022159

Author:

Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:

McGraw-Hill Education

Starting Out with Python (4th Edition)

Computer Science

ISBN:

9780134444321

Author:

Tony Gaddis

Publisher:

PEARSON

Digital Fundamentals (11th Edition)

Computer Science

ISBN:

9780132737968

Author:

Thomas L. Floyd

Publisher:

PEARSON

C How to Program (8th Edition)

Computer Science

ISBN:

9780133976892

Author:

Paul J. Deitel, Harvey Deitel

Publisher:

PEARSON

Database Systems: Design, Implementation, & Manag…

Computer Science

ISBN:

9781337627900

Author:

Carlos Coronel, Steven Morris

Publisher:

Cengage Learning

Programmable Logic Controllers

Computer Science

ISBN:

9780073373843

Author:

Frank D. Petruzella

Publisher:

McGraw-Hill Education

SEE MORE TEXTBOOKS