All categories

4 years ago

Wireframing and storyboarding are helpful in which step of web development?

Computers and Technology

2 answers:

bazaltina [42]4 years ago

5 0

Answer: Planning

Explanation:

The wire-framing and the story boarding are the types of tools that are helpful for planning during the web development. The Storyboard is the type of blueprint that is used in the web project planning and it is one of the simple and flexible tool.

The storyboard are basically divided into the three main parts that are: Site map, Page layout and the flowchart. The wire-framing is mainly used for designing the website services and make a proper layout of content page at structural level.

Thepotemich [5.8K]4 years ago

4 0

Since wireframing and storyboarding are both part of the developing phase, I would think that the answer is Planning

You might be interested in

WHICH COMPUTER COMPONENT CONTAINS ALL THE CIRCUITRY NECESSARY FOR THE OTHER COMPONENTS OR DEVICES TO COMMUNICATE WITH ONE ANOTHE

netineya [11]

I'm pretty sure it's the motherboard. You shouldn't use all caps. It makes it seem like you are shouting, and less people want to answer. :)

7 0

3 years ago

Select the correct answer. Larry finds it easy to run legacy programs and applications in a virtualized environment. How does th

muminat

The answer is B: installs and runs different versions of an operating system on the same computing device

Virtual machines are like guest operating systems or application environments that give you the perception that you are physically connected to a different box. A system virtual machine, for instance, copies all the components and processes of a real computer. It helps the user experiment with different operating systems and applications without the need to install them on your physical hardware.

8 0

3 years ago

If you know the unit prices of two different brands of an item you are better able to

vitfil [10]

Answer:

TO UNDERSTAND TO ITS VALUES AND ITS FEATURES

Explanation:

4 0

3 years ago

It takes 2 seconds to read or write one block from/to disk and it also takes 1 second of CPU time to merge one block of records.

Alexxx [7]

Answer:

Part a: For optimal 4-way merging, initiate with one dummy run of size 0 and merge this with the 3 smallest runs. Than merge the result to the remaining 3 runs to get a merged run of length 6000 records.

Part b: The optimal 4-way merging takes about 249 seconds.

Explanation:

The complete question is missing while searching for the question online, a similar question is found which is solved as below:

Part a

For optimal 4-way merging, we need one dummy run with size 0.

Merge 4 runs with size 0, 500, 800, and 1000 to produce a run with a run length of 2300. The new run length is calculated as follows $L_{mrg}=L_0+L_1+L_2+L_3=0+500+800+1000=2300$
Merge the run as made in step 1 with the remaining 3 runs bearing length 1000, 1200, 1500. The merged run length is 6000 and is calculated as follows

$L_{merged}=L_{mrg}+L_4+L_5+L_6=2300+1000+1200+1500=6000$

The resulting run has length 6000 records.

Part b

For step 1

Input Output Time

Input Output Time is given as

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}$

Here

L_run is 2300 for step 01
Size_block is 100 as given
Time_{I/O per block} is 2 sec

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}\\T_{I.O}=\frac{2300}{100} \times 2 sec\\T_{I.O}=46 sec$

So the input/output time is 46 seconds for step 01.

CPU Time

CPU Time is given as

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}$

Here

L_run is 2300 for step 01
Size_block is 100 as given
Time_{CPU per block} is 1 sec

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}\\T_{CPU}=\frac{2300}{100} \times 1 sec\\T_{CPU}=23 sec$

So the CPU time is 23 seconds for step 01.

Total time in step 01

$T_{step-01}=T_{I.O}+T_{CPU}\\T_{step-01}=46+23\\T_{step-01}=69 sec\\$

Total time in step 01 is 69 seconds.

For step 2

Input Output Time

Input Output Time is given as

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}$

Here

L_run is 6000 for step 02
Size_block is 100 as given
Time_{I/O per block} is 2 sec

$T_{I.O}=\frac{L_{run}}{Size_{block}} \times Time_{I/O \, per\, block}\\T_{I.O}=\frac{6000}{100} \times 2 sec\\T_{I.O}=120 sec$

So the input/output time is 120 seconds for step 02.

CPU Time

CPU Time is given as

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}$

Here

L_run is 6000 for step 02
Size_block is 100 as given
Time_{CPU per block} is 1 sec

$T_{CPU}=\frac{L_{run}}{Size_{block}} \times Time_{CPU \, per\, block}\\T_{CPU}=\frac{6000}{100} \times 1 sec\\T_{CPU}=60 sec$

So the CPU time is 60 seconds for step 02.

Total time in step 02

$T_{step-02}=T_{I.O}+T_{CPU}\\T_{step-02}=120+60\\T_{step-02}=180 sec\\$

Total time in step 02 is 180 seconds

Merging Time (Total)

Now the total time for merging is given as

$T_{merge}=T_{step-01}+T_{step-02}\\T_{merge}=69+180\\T_{merge}=249 sec\\$

Total time in merging is 249 seconds seconds

5 0

3 years ago

Briefly explain the following terms and concepts:

morpeh [17]

Answer:

Answer below

Explanation:

Maximum transmission unit (MTU)

A maximum transmission unit (MTU) is the largest packet or frame size that is usually specified in Eight-bit bytes, which can be sent in a packet or frame-based network such as the internet.

Longest Prefix Match

Longest prefix match is an algorithm used by routers in Internet Protocol to lookup the IP prefix that will likely be the terminal point of the next hop from the router.

CIDR and Subnet Mask

CIDR, known in full as Classless inter-domain routing, is a set of IP standards that is used to make customized identifiers for networks and individual devices.

A subnet mask separates the internet protocol (IP) address into the network address and host address.

Switching Fabric

Switching fabric is simply an arrangement of the elements of a communication network also known as network topology, whereby the nodes of the network are seen to interconnect with one or more network switches.

7 0

3 years ago

Read 2 more answers