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
natta225 [31]
2 years ago
12

Which option helps you choose the design of a slide in a presentation?

Computers and Technology
2 answers:
LekaFEV [45]2 years ago
6 0

Answer:

Wut options??

Explanation:

stich3 [128]2 years ago
4 0

Answer:

What are the options?

Explanation:

You might be interested in
Suppose we compute a depth-first search tree rooted at u and obtain a tree t that includes all nodes of g.
Temka [501]

G is a tree, per node has a special path from the root. So, both BFS and DFS have the exact tree, and the tree is the exact as G.

<h3>What are DFS and BFS?</h3>

An algorithm for navigating or examining tree or graph data structures is called depth-first search. The algorithm moves as far as it can along each branch before turning around, starting at the root node.

The breadth-first search strategy can be used to look for a node in a tree data structure that has a specific property. Before moving on to the nodes at the next depth level, it begins at the root of the tree and investigates every node there.

First, we reveal that G exists a tree when both BFS-tree and DFS-tree are exact.

If G and T are not exact, then there should exist a border e(u, v) in G, that does not belong to T.

In such a case:

- in the DFS tree, one of u or v, should be a prototype of the other.

- in the BFS tree, u and v can differ by only one level.

Since, both DFS-tree and BFS-tree are the very tree T,

it follows that one of u and v should be a prototype of the other and they can discuss by only one party.

This means that the border joining them must be in T.

So, there can not be any limits in G which are not in T.

In the two-part of evidence:

Since G is a tree, per node has a special path from the root. So, both BFS and DFS have the exact tree, and the tree is the exact as G.

The complete question is:

We have a connected graph G = (V, E), and a specific vertex u ∈ V.

Suppose we compute a depth-first search tree rooted at u, and obtain a tree T that includes all nodes of G.

Suppose we then compute a breadth-first search tree rooted at u, and obtain the same tree T.

Prove that G = T. (In other words, if T is both a depth-first search tree and a breadth-first search tree rooted at u, then G cannot contain any edges that do not belong to T.)

To learn more about  DFS and BFS, refer to:

brainly.com/question/13014003

#SPJ4

5 0
1 year ago
Type a statement using srand() to seed random number generation using variable seedVal. Then type two statements using rand() to
Alik [6]

Answer:

#include<stdio.h>

#include<stdlib.h>

int main(void){

int seedval;

scanf ("%d", &seedval);

srand(seedval);

printf("%d\n", rand()%10);

printf("%d\n", rand()%10);

 return 0;

}

Explanation:

The given code is poorly formatted. So, I picked what is usable from the code to write the following lines of code:

#include<stdio.h>

#include<stdlib.h>

int main(void){

This line declares seedval as integer

int seedval;

This line gets user input for seedval

scanf ("%d", &seedval);

This line calls the srand function to generate random numbers

srand(seedval);

This prints a random number between 0 and 9

printf("%d\n", rand()%10);

This also prints a random number between 0 and 9

printf("%d\n", rand()%10);

 return 0;

}

8 0
2 years ago
Your boss it trying to console into an old switch that he found in storage and wants to configure it. he asks you to describe wh
nika2105 [10]
I believe that the correct answer is c. look for a male connector with 9 pins.
5 0
3 years ago
Read 2 more answers
Which table cannot have a trigger associated with it in mysql
timofeeve [1]

Answer:

MySQL triggers cannot:<u> Use SHOW , LOAD DATA , LOAD TABLE , BACKUP</u> DATABASE, RESTORE , FLUSH and RETURN statements. Use statements that commit or rollback implicitly or explicitly such as COMMIT , ROLLBACK , START TRANSACTION , LOCK/UNLOCK TABLES , ALTER , CREATE , DROP , RENAME.

Explanation:

hope it helps

mark me brainliest pls

3 0
2 years ago
Pamela is asked to use a data visualization tool and show the relative frequency of the 50​ most-used terms in survey responses.
bezimeni [28]

Answer:

a. tag clouds

Explanation:

Tag clouds or word cloud is a form of data visualization that shows the most occurring word or words in an edited text input.

Clustering is a technique in data analytics that categorizes data based on data types, separating them into clusters.

List  is a data types in data analysis programming languages

8 0
3 years ago
Other questions:
  • Which finger types the highlighted keys on a number keypad? A. Third B. First C. Pinky D. Thumb
    7·2 answers
  • A network engineer arrives at work and discovers that many users are having problems when attempting to connect to the company n
    9·2 answers
  • Which of the following types of servers can be used to cache requested Internet resources so that they can be more quickly deliv
    6·1 answer
  • Visual imagery encoding relates to _____ encoding, in that a person is connecting the new information to previously existing inf
    11·1 answer
  • You are testing a site and realize that when you click a graphic link you see an outline but no picture. What is wrong with the
    5·1 answer
  • Autumn suffers from nocturnal dyspnea. This term describes a breathing condition but using the prefixes to translate, it means:
    5·1 answer
  • Which statement describes how to insert the IF, COUNTIF, or SUM function into a cell?
    11·1 answer
  • Discuss any five positive and five Negative impact<br>of ICT on society​
    10·1 answer
  • Borrowing money affects both assests and owners equity. True or false?​
    13·1 answer
  • PLEASE HELP ME
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!