Answer: responsive
Explanation:
its called mobile responsivness and most good websites have it
Answer:
Check your electrical cords.
When you are done with an electrical appliance, do not rip the cord out of the wall.
Electrical cords should not be hidden from plain sight.
Do not run electrical cords underneath furniture, rugs or carpets.
Remember that water and electricity do not mix.
(i hope this helps id really know if i answered ur question right)
:)
Explanation:
Answer:
The answer to the give question as follows:
1) \n
2) \t
3) \'
4) \"
5) \\
Explanation:
The description of the above symbols as follows:
- The \n is used to provide the new line spacing.
- The \t is used to provide a tab space.
- To assign a single character value we use \' single.
- The double \" quote is used to assign a string value.
- The backslash is used to provide the character of the escape and it also used in a file path.
Answer:
Prototype is a framework that provides a simple API for performing web tasks.
Explanation:
Prototype is a JavaScript framework that aims to ease up the development of dynamic web applications. It basically take out the complexity out of the client-side programming.
Following are some salient features of Prototype:
1) Applies useful methods to extend DOM elements and built-in types.
2) Provides advance support for Event Management.
3) Provides powerful Ajax feature.
4) Built-in support for class-style OOP.
5) Not a complete application development framework
Answer: provided in the explanation section
Explanation:
Given that:
Assume D(k) =║ true it is [1 : : : k] is valid sequence words or false otherwise
now the sub problem s[1 : : : k] is a valid sequence of words IFF s[1 : : : 1] is a valid sequence of words and s[ 1 + 1 : : : k] is valid word.
So, from here we have that D(k) is given by the following recorance relation:
D(k) = ║ false maximum (d[l]∧DICT(s[1 + 1 : : : k]) otherwise
Algorithm:
Valid sentence (s,k)
D [1 : : : k] ∦ array of boolean variable.
for a ← 1 to m
do ;
d(0) ← false
for b ← 0 to a - j
for b ← 0 to a - j
do;
if D[b] ∧ DICT s([b + 1 : : : a])
d (a) ← True
(b). Algorithm Output
if D[k] = = True
stack = temp stack ∦stack is used to print the strings in order
c = k
while C > 0
stack push (s [w(c)] : : : C] // w(p) is the position in s[1 : : : k] of the valid world at // position c
P = W (p) - 1
output stack
= 0 =
cheers i hope this helps !!!