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
koban [17]
3 years ago
10

Finding your style in photography is about ___

Computers and Technology
2 answers:
marusya05 [52]3 years ago
7 0
Only B and C would be the best choice
Dafna11 [192]3 years ago
5 0
Only b and c i would say thats how ppl should take there pictures
You might be interested in
Which of the following are good backup methods you can use to protect important files and folders from loss in the case of a har
grigory [225]

Answer:A,B, and D

Explanation:

6 0
2 years ago
Read 2 more answers
Which number is the smallest? 4.4 ⋅ 10^-5, 3.99 ⋅ 10^-6, 2.6 ⋅ 10^3
tiny-mole [99]
3.99 • 10^3 is the smallest
8 0
2 years ago
The byte-ordering scheme used by computers to store large integers in memory with the high-order byte at the lowest address is c
Ostrovityanka [42]

Answer:

a. big endian      

Explanation:

  • Endianness determines the order of how the multiple bytes of information are stored in the memory.
  • Big-endian is a byte ordering scheme in which the most significant byte also called the big end of data is stored at the the lowest address.
  • First byte is the biggest so Big-endian order puts most significant byte first and least significant byte in the last.
  • For example: A hexadecimal number 1D23 required two bytes to be represented so in big endian order this hexadecimal number will be represented as 1D 23.
4 0
3 years ago
How do you do this question?
laila [671]

Answer:

(a) 1 to 8

(b) 1 to 6

Explanation:

A "leaf" is a node at the end of a binary tree (in other words, it has no "children").  All other nodes are "non-leaf" nodes.

The smallest number of leaves is 1.  That would be a binary tree that's just a straight line; each node will have only 1 child, until you get to the last node (the leaf).

To find the largest number of leaves, we start drawing a full binary tree.  A complete tree with 15 nodes has 7 non-leaf nodes and 8 leaf nodes.  A full tree with 6 non-leaf nodes can have up to 6 leaf nodes.

6 0
3 years ago
Read 2 more answers
Paris que tipo de sustantivo es?​
pashok25 [27]

Explanation:

CATEGORIA GRAMATICAL PARIS

Paris es sustantivo.

3 0
2 years ago
Other questions:
  • Assume that a kernel is launched with 1000 thread blocks each of which has 512 threads. If a variable is declared as a shared me
    6·1 answer
  • Which of the following factors wouldn't change an account's optimization score?
    7·1 answer
  • How can you employ one of the most powerful interactive business tools on the Internet today?
    11·1 answer
  • What might happen if the internet use policies were broken at your school
    11·2 answers
  • Insert XXX to output the student's ID. public class Student { private double myGPA; private int myID; public getID) { return myI
    10·1 answer
  • Maria is creating a program where the user will enter their name to begin. What kind of variable should be used for the user’s n
    15·2 answers
  • 10. Differentiate between equity share & preference share.​
    11·1 answer
  • Please help this is a coding assignment I need help! (use python)
    12·1 answer
  • I need subscribers plz ​
    15·2 answers
  • Which of the following statements is true about mobile devices and procedures?
    11·1 answer
Add answer
Login
Not registered? Fast signup
Signup
Login Signup
Ask question!