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
Rina8888 [55]
3 years ago
9

Pls help... : Slide layouts can be changed by _____.

Computers and Technology
1 answer:
Eddi Din [679]3 years ago
6 0

Answer:

Selecting a new layout from the task pane

Explanation:

You might be interested in
How do you change the color on the text in the email​
MrRissso [65]

Answer:

Explanation:

Click File > Options > Mail.

Under Compose messages, click Stationery and Fonts

On the Personal Stationery tab, under New mail messages, click Font.

If you want to change font styles for messages you reply to or forward, under Replying or forwarding messages, click Font

On the Font tab, under Font, click the font you want to use.

You can also select a font style and size.

If the font you choose isn't installed on the recipient's computer, the recipient's mail program substitutes an available font.

6 0
4 years ago
Which devices are most likely to communicate with the internet? Select 3 options.
Anon25 [30]
<h2>Answer:</h2>

<h3>smart phone </h3>

<h3>cars </h3>

<h3>delivery trucks</h3>
5 0
3 years ago
Write a removeDuplicates() method for the LinkedList class we saw in lecture. The method will remove all duplicate elements from
oksano4ka [1.4K]

Answer:

removeDuplicates() function:-

//removeDuplicates() function removes duplicate elements form linked list.

   void removeDuplicates() {

     

       //declare 3 ListNode pointers ptr1,ptr2 and duplicate.

       //initially, all points to null.

       ListNode ptr1 = null, ptr2 = null, duplicate = null;

       

       //make ptr1 equals to head.

       ptr1 = head;

        //run while loop till ptr1 points to second last node.

       //pick elements one by one..

       while (ptr1 != null && ptr1.next != null)

       {

               // make ptr2 equals to ptr1.

               //or make ptr2 points to same node as ptr1.

           ptr2 = ptr1;

           //run second while loop to compare all elements with above selected element(ptr1->val).

           while (ptr2.next != null)

           {

              //if element pointed by ptr1 is same as element pointed by ptr2.next.

               //Then, we have found duplicate element.

               //Now , we have to remove this duplicate element.

               if (ptr1.val == ptr2.next.val)

               {

                  //make duplicate pointer points to node where ptr2.next points(duplicate node).

                       duplicate = ptr2.next;

                       //change links to remove duplicate node from linked list.

                       //make ptr2.next points to duplicate.next.

                   ptr2.next = duplicate.next;

               }

               

             //if element pointed by ptr1 is different from element pointed by ptr2.next.

               //then it is not duplicate element.

               //So, move ptr2 = ptr2.next.

               else

               {

                   ptr2 = ptr2.next;

               }

           }

           

           //move ptr1 = ptr1.next, after check duplicate elements for first node.

           //Now, we check duplicacy for second node and so on.

           //so, move ptr1  by one node.

           ptr1 = ptr1.next;

       }

   }

Explanation:

Complete Code:-

//Create Linked List Class.

class LinkedList {

       //Create head pointer.

       static ListNode head;

       //define structure of ListNode.

       //it has int val(data) and pointer to ListNode i.e, next.

   static class ListNode {

       int val;

       ListNode next;

       //constructor to  create and initialize a node.

       ListNode(int d) {

               val = d;

           next = null;

       }

   }

//removeDuplicates() function removes duplicate elements form linked list.

   void removeDuplicates() {

       

       //declare 3 ListNode pointers ptr1,ptr2 and duplicate.

       //initially, all points to null.

       ListNode ptr1 = null, ptr2 = null, duplicate = null;

       

       //make ptr1 equals to head.

       ptr1 = head;

       

       

       //run while loop till ptr1 points to second last node.

       //pick elements one by one..

       while (ptr1 != null && ptr1.next != null)

       {

               // make ptr2 equals to ptr1.

               //or make ptr2 points to same node as ptr1.

           ptr2 = ptr1;

           //run second while loop to compare all elements with above selected element(ptr1->val).

           while (ptr2.next != null)

           {

              //if element pointed by ptr1 is same as element pointed by ptr2.next.

               //Then, we have found duplicate element.

               //Now , we have to remove this duplicate element.

               if (ptr1.val == ptr2.next.val)

               {

                  //make duplicate pointer points to node where ptr2.next points(duplicate node).

                       duplicate = ptr2.next;

                       

                       //change links to remove duplicate node from linked list.

                       //make ptr2.next points to duplicate.next.

                   ptr2.next = duplicate.next;

               }

               

             //if element pointed by ptr1 is different from element pointed by ptr2.next.

               //then it is not duplicate element.

               //So, move ptr2 = ptr2.next.

               else

               {

                   ptr2 = ptr2.next;

               }

           }

           

           //move ptr1 = ptr1.next, after check duplicate elements for first node.

           //Now, we check duplicacy for second node and so on.

           //so, move ptr1  by one node.

           ptr1 = ptr1.next;

       }

   }

   //display() function prints linked list.

   void display(ListNode node)

   {

       //run while loop till last node.

       while (node != null)

       {

               //print node value of current node.

           System.out.print(node.val + " ");

           

           //move node pointer by one node.

           node = node.next;

       }

   }

   public static void main(String[] args) {

       

       //Create object of Linked List class.

       LinkedList list = new LinkedList();

       

       //first we create nodes and connect them to form a linked list.

       //Create Linked List 1-> 2-> 3-> 2-> 4-> 2-> 5-> 2.

       

       //Create a Node having node data = 1 and assign head pointer to it.

       //As head is listNode of static type. so, we call head pointer using class Name instead of object name.

       LinkedList.head = new ListNode(1);

       

       //Create a Node having node data = 2 and assign head.next to it.

       LinkedList.head.next = new ListNode(2);

       LinkedList.head.next.next = new ListNode(3);

       LinkedList.head.next.next.next = new ListNode(2);

       LinkedList.head.next.next.next.next = new ListNode(4);

       LinkedList.head.next.next.next.next.next = new ListNode(2);

       LinkedList.head.next.next.next.next.next.next = new ListNode(5);

       LinkedList.head.next.next.next.next.next.next.next = new ListNode(2);

       //display linked list before Removing duplicates.

       System.out.println("Linked List before removing duplicates : ");

       list.display(head);

       //call removeDuplicates() function to remove duplicates from linked list.

       list.removeDuplicates();

       System.out.println("")

       //display linked list after Removing duplicates.

       System.out.println("Linked List after removing duplicates :  ");

       list.display(head);

   }

}

Output:-

6 0
3 years ago
How many bits are necessary for a binary representation (unsigned) of:
pshichka [43]

Answer:

Hi!

The answer to:

a. 6 bits.

b. 9 bits.

c. 26 bits.

Explanation:

a. For the states of the U.S.A, you need 50 or more combinations to represents each element.

<u>If you use 6 bits, the possible combinations are 2⁶ = 64.  </u>

b. For days in a year, you need 365 or more combinations to represents each element.

<u>If you use 9 bits, the possible combinations are 2⁹ = 512. </u>

c. For inhabitants of California, you need 36,457,549 or more combinations to represents each element.

<u>If you use 26 bits, the possible combinations are 2²⁶ = 67,108,864.</u> If you use 25 bits instead of 26, then you have 2²⁵ = 33,554,432 combinations. These possible combinations are not enough to represent each inhabitant.

4 0
3 years ago
What is the difference in the way computers store numeric data and non-numeric data?
Elan Coil [88]
Both numeric and non-numeric data have different ASCII codes, that will be the first difference. Second, numeric data are stored in float, double, and int variables while non-numeric data are stored in char. However, both can be stored in a String variable if and only if the desired data to be stored will not be used for computuation using mathematical operations such as addition.

To store a non-numeric data in an array, the array must first be declared as a String variable array while a numeric data can be stored in an array once the array which will store the numeric data is declared as an integer, double, or float variable.
3 0
3 years ago
Other questions:
  • After applying transitions to his presentation, Omar uses the Slide Show feature to view the them. He notices that the transitio
    9·2 answers
  • Write an application that encodes English-language phrases into pig Latin. Pig Latin is a form of coded language. There are many
    8·1 answer
  • 8.14 Consider a system in which bus cycles takes 500 ns. Transfer of bus control in either direction, from processor to I/O devi
    7·1 answer
  • What are two reasons for using layered protocols? what is one possible disadvantage of using layered protocols?
    13·1 answer
  • How do you represent the decimal integer 50 in binary?
    14·1 answer
  • Fallon is a new student on campus. Everywhere she goes, she is asked for her 12-digit student number. To memorize her new studen
    10·1 answer
  • It is a field that contains a unique identifier for each record in a primary table
    5·1 answer
  • Hamilton is the best
    12·1 answer
  • What are the fundamental activities that are common to all software processes?
    9·1 answer
  • Text to appear
    12·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!