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
natali 33 [55]
3 years ago
11

For some reason i cant see brainly answers

Computers and Technology
1 answer:
denis23 [38]3 years ago
4 0

Answer:

Same thing happening to me and several other people. At this point I wonder if there site is having troubles. I tried to email them but even that is not working.

Explanation:.

You might be interested in
A walk-through of the project deliverable is conducted by<br> __
prisoha [69]
A walk through of the project deliverable is conducted by: the sellers agent
5 0
3 years ago
Write a regular expression of the language havingstrings that either start or end with "00" and have nomore zeroes. Where the al
Brut [27]

Answer:

001*|1*00

Explanation:

The language consists of strings in {0,1} that either start with 00 or end with 00 and have no more zeros.

The requirement can be divided into two parts:

1) Strings that start with 00 and have no more zeros

2) Strings that end with 00 and have no more zeros

Generating regular expressions for these parts:

1) 001*  - starts with two zeros and can have zero or more 1s later

2)1*00  - starts with zero or more 1s and ends with two zeros

So on combining with the or operator(|), the overall regular expression for the strings in the language becomes:

001*|1*00

3 0
3 years ago
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
Write a macro to change a decimal degrees (e.g. 245.678) to degrees, minutes, seconds (e.g. 245° 40' 40.8"). Input and output us
Brut [27]

Answer:

All the procedure is explained below step-by-step

  1. Press alt+F11 to open VBA in excel.
  2. Create a module and start entering the subroutine.
  3. The coding of subroutine is attached in the image.

For adding "RUN" button:

  1. Select a shape on the sheet for the button.(Insert > Shapes > Rectangle).
  2. Double click on the shape to add text and write "RUN".
  3. The button can be styled by adding colors and shadows.
  4. Now Assign macro to the button (Right click  > Assign macro).
  5. A window pane will appear, select the macro from This workbook list so that it may work properly when shared with others.
  6. Press OK.
  7. "RUN" button has been created and by pressing it the subroutine will work as required.

4 0
2 years ago
I REALLY NEED HELP WITH THIS ASSIGNMENT. IT WOULD BE GREATLY APPRECIATED IF SOMEONE HELPED ME. I'M NOT GOOD AT COMPUTER SCIENCE
melomori [17]

Answer:

Explanation:

i cant view it

8 0
3 years ago
Read 2 more answers
Other questions:
  • Which key removes all data from an active cell with one click
    7·2 answers
  • To hide gridline when you display or print a worksheet
    14·1 answer
  • Mary wants to run a text ad on the Google Search Network. She's new to text ads and needs to start with the basics. What are the
    5·1 answer
  • Which key should you press and hold to select multiple cells?
    8·2 answers
  • This is a quick and easy program that will let you practice the basics of the switch statement. You will ask the user to enter a
    6·1 answer
  • Can someone give me the code for the edhesive 3.7 code practice for python? Thanks.
    11·1 answer
  • How do I create a powershell script to make a Windows user account that is a non-admin user
    7·1 answer
  • Windows hard disks can now use a variety of file systems, including FAT16, FAT32, ____, and Resilient File System.
    8·1 answer
  • Meera has created a small program in Python. She wants to store elements of the same data type in an organized
    7·1 answer
  • Explain why computer professionals are engaged in technical services
    14·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!