1answer.
Ask question
Login Signup
Ask question
All categories
  • English
  • Mathematics
  • Social Studies
  • Business
  • History
  • Health
  • Geography
  • Biology
  • Physics
  • Chemistry
  • Computers and Technology
  • Arts
  • World Languages
  • Spanish
  • French
  • German
  • Advanced Placement (AP)
  • SAT
  • Medicine
  • Law
  • Engineering
polet [3.4K]
4 years ago
12

What's a good drawing tablet?

Computers and Technology
2 answers:
marshall27 [118]4 years ago
8 0

Answer:

My recommended one is

Xp-Pen Artist 12 Drawing tablet

Explanation:

A good drawing tablet is a tablet where you can draw high quality drawings If you are an artist.

DENIUS [597]4 years ago
4 0

Answer:

Wacom Intuos S

Explanation:

If you're looking for a good tablet that isn't too expensive the Wacom Intuos S is a great starter, I personally use it and really enjoy it. It doesn't have a graphic screen. If you're looking for one with a graphic screen get the Wacom Cintiq 22, It's expensive but great quality. Most tablets with a graphic screen are this expensive though. But if you REALLY want one with a graphic screen that isn't TOO expensive I recommend the HUION Kamvas pro 12.

Hope I could help!

You might be interested in
Design a class named largeIntegers such that an object of this class can store an integer of any number of digits. Add operation
SpyIntel [72]

Answer:

Here the code is given as follows,

Explanation:

Code:

import java.util.Scanner;

//created class named largeintegers

class largeintegers{

   //class can hold a long number

   long number;

   //constructor to set number

  largeintegers(long number){

      this.number=number;

  }

  //getNumber method to get number

  long getNumber(){

      return number;

  }

  //below are some basic operations

  long addition(long num1,long num2){

       return num1+num2;

   }

   long subtract(long num1,long num2){

       return num1-num2;

   }

   long multiply(long num1,long num2){

       return num1*num2;

   }

   boolean compare(long num1,long num2)

   {

       return num1>num2;

   }

  public static void main(String[] args) {

      //declared to long numbers

      long number1,number2;

      //scanner class to take user input

      Scanner sc= new Scanner(System.in);

      //taking input numbers

      System.out.println("Enter a Number ");

      number1=sc.nextLong();

      System.out.println("Enter 2nd Number :");

      number2=sc.nextLong();

      //created two objects

      largeintegers object=new largeintegers(number1);

      largeintegers object2=new largeintegers(number2);

      //displaying two numbers

      System.out.println("Entered Numbers ");

      System.out.println(object.getNumber());

      System.out.println(object2.getNumber());

      //calling basic methods using created objects

      System.out.println("Some Operations on Given two Numbers ");

      System.out.println("Addition:"+object.addition(object.getNumber(), object2.getNumber()));

      System.out.println("Subtraction:"+object.subtract(object.getNumber(), object2.getNumber()));

      System.out.println("Multiplication:"+object.multiply(object.getNumber(), object2.getNumber()));

      System.out.println("Comparison:");

      if(object.compare(object.getNumber(), object2.getNumber())==true)

      {

          System.out.println("First Number is Greater than Second Number ");

      }

      else

      {

          System.out.println("Second Number is Greater than First Number ");

      }

      sc.close();

  }

}

Output:-

6 0
3 years ago
Implement a method called bubbleSort, that takes an ArrayList, sorts it using bubble sort algorithm, and returns a sorted list;
boyakko [2]

Answer:

Java algorithm is given below

Explanation:

import java.util.ArrayList;

import java.util.Arrays;

import java.util.Random;

public class Temp {

   static void bubbleSort(ArrayList<Integer> list) {

       int n = list.size();

       for (int p = 0; p < n - 1; p++)

           for (int q = 0; q < n - p - 1; q++)

               if (list.get(q) > list.get(q + 1)) {

                   int temp = list.get(q);

                   list.set(q, list.get(q + 1));

                   list.set(q + 1, temp);

               }

   }

   static void selectionSort(ArrayList<Integer> list) {

       int n = list.size();

       for (int p = 0; p < n - 1; p++) {

           int minimumIndex = p;

           for (int q = p + 1; q < n; q++)

               if (list.get(q) < list.get(minimumIndex))

                   minimumIndex = q;

           int temp = list.get(p);

           list.set(p, list.get(minimumIndex));

           list.set(minimumIndex, temp);

       }

   }

   static void insertionSort(ArrayList<Integer> list) {

       int size = list.size();

       int p, val, q;

       for (p = 1; p < size; p++) {

           val = list.get(p);

           q = p - 1;

           while (q >= 0 && list.get(q) > val) {

               list.set(q + 1, list.get(q));

               q = q - 1;

           }

           list.set(q + 1, val);

       }

   }

   static void mergeSort(ArrayList<Integer> list, int low, int high) {

       if (low < high && (high - low) >= 1) {

           int mid = (high + low) / 2;

           mergeSort(list, low, mid);

           mergeSort(list, mid + 1, high);

           merger(list, low, mid, high);

       }

   }

   static void merger(ArrayList<Integer> list, int low, int mid, int high) {

       ArrayList<Integer> mergedArray = new ArrayList<Integer>();

       int left = low;

       int right = mid + 1;

       while (left <= mid && right <= high) {

           if (list.get(left) <= list.get(right)) {

               mergedArray.add(list.get(left));

               left++;

           } else {

               mergedArray.add(list.get(right));

               right++;

           }

       }

       while (left <= mid) {

           mergedArray.add(list.get(left));

           left++;

       }

       while (right <= high) {

           mergedArray.add(list.get(right));

           right++;

       }

       int i = 0;

       int j = low;

       while (i < mergedArray.size()) {

           list.set(j, mergedArray.get(i++));

           j++;

       }

   }

   public static void main(String[] args) throws Exception {

       ArrayList<Integer> list = new ArrayList<>();

       Random rand = new Random(System.currentTimeMillis());

       for (int i = 0; i < 10000; i++) {

           list.add(rand.nextInt(256));

       }

       long start = System.currentTimeMillis();

       selectionSort(list);

       int sel = (int) (System.currentTimeMillis() - start);

       System.out.println("Selection Sort time (in ms): " + sel);

       list.clear();

       // ------------------------

       rand = new Random(System.currentTimeMillis());

       for (int i = 0; i < 10000; i++) {

           list.add(rand.nextInt(256));

       }

       start = System.currentTimeMillis();

       insertionSort(list);

       int ins = (int) (System.currentTimeMillis() - start);

       System.out.println("Insertion Sort time (in ms): " + ins);

       list.clear();

       // ------------------------

       rand = new Random(System.currentTimeMillis());

       for (int i = 0; i < 10000; i++) {

           list.add(rand.nextInt(256));

       }

       start = System.currentTimeMillis();

       bubbleSort(list);

       int bub = (int) (System.currentTimeMillis() - start);

       System.out.println("Bubble Sort time (in ms): " + bub);

       list.clear();

       // ---------------------------

       rand = new Random(System.currentTimeMillis());

       for (int i = 0; i < 10000; i++) {

           list.add(rand.nextInt(256));

       }

       start = System.currentTimeMillis();

       mergeSort(list, 0, list.size() - 1);

       int mer = (int) (System.currentTimeMillis() - start);

       System.out.println("Merge Sort time (in ms): " + mer);

       long m = Math.min(Math.min(sel, ins), Math.min(bub, mer));

       if (m == sel)

           System.out.println("Selection Sort is fastest");

       else if (m == ins)

           System.out.println("insertion Sort is fastest");

       else if (mer == m)

           System.out.println("Merge Sort is fastest");

       else if (m == bub)

           System.out.println("Bubble Sort is fastest");

   }

}

6 0
3 years ago
How to check iready minutes when i cannot log into iready
Alekssandra [29.7K]

Answer:

If you are the host of the iready like a teacher then you should be able to see how much time you have left. If not you should probably ask them.

Explanation:

3 0
3 years ago
Split the worksheet into panes at cell G1.
nikdorinn [45]

Answer:

1. Select below the row where you want the split, or the column to the right of where you want the split.

2. On the View tab, in the Window group, click Split.

Explanation:

3 0
3 years ago
You have been hired to develop the website for a popular speaker. He has asked that you include the PowerPoint slides from his l
amid [387]

The method would you suggest for including the slides on the website are:

  • First one need to Download WOWSlider and then register for it.
  • Then one can make your slider. You need to have some images ready to add to the slideshow that you want to make.
  • Then Export your slider.
  • You also need to add the slider to your own webpage.

<h3>What are the different ways of creating slides?</h3>

PowerPoint are known to be one that gives about different ways to create a presentation.

One can use Blank presentation, one can also used  other Design Template and also From AutoContent Wizard.

Note that in the case above, The method would you suggest for including the slides on the website are:

  • First one need to Download WOWSlider and then register for it.
  • Then one can make your slider. You need to have some images ready to add to the slideshow that you want to make.
  • Then Export your slider.
  • You also need to add the slider to your own webpage.

Learn more about slides from

brainly.com/question/24653274

#SPJ1

6 0
2 years ago
Other questions:
  • In setting up a small office network, the network administrator decides to assign private IP addresses dynamically to workstatio
    12·1 answer
  • The advanced boot options screen can be displayed by pressing what key during the boot sequence?
    6·1 answer
  • What type of mitigation provision is utilized when redundant communications links are installed?
    8·1 answer
  • How long did it take Linkedln to reach 1 million users?
    5·2 answers
  • For window 7 explain the steps you will use to find the available program you will list.
    13·1 answer
  • IDPSs can also help the organization protect its assets when its networks and systems are still exposed to ____________________
    9·1 answer
  • Disk drives have been getting larger. Their capacity is now often given in terabytes (TB) where 1 TBequals1000 gigabytes, or abo
    14·1 answer
  • Low-end CRM systems are designed for companies like Boeing because they only have a few, large customers.
    11·1 answer
  • Decision support systems (or DSSs) model information using OLAP, which provides assistance in evaluating and choosing among diff
    7·1 answer
  • Why the car floated before it started to sink? Explain.​
    8·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!