Answer:
(C) progressive enhancement
Explanation:
Progressive enhancement is a web design technique that first underlines the main functionality web page and then incorporates increasingly enhanced and advanced features and design levels.
This process enables the users to use and access the basic features of the web pages. These users can use any browser to access the main contents of the web page. Progressive Enhancement also offers an advanced version of the website for those with more advanced and sophisticated computer browsers or faster internet connection.
So the user can access basic features of a web sites as well as the complex features. This process first makes sure the basic intended purpose and main contents of the web site is accessible to all users before adding complex features which are supported by different browsers and devices.
Validation is a process which checks that code of the website is as per the world wide web standards and also checks that content of web pages and design of websites is being properly displayed and the site is accessible. So this is not the correct option.
Technique of altering a web site in a way that it can appear higher in the search engine results is called optimization so this is not a correct option.
Answer:
- def check_subset(l1, l2):
- status = False
- count = 0
- if(len(l1) > len(l2)):
- for x in l2:
- for y in l1:
- if x == y:
- count += 1
-
- if(count == len(l2)):
- return True
- else:
- return False
-
- else:
- for x in l1:
- for y in l2:
- if x==y:
- count += 1
-
- if(count == len(l1)):
- return True
- else:
- return False
-
- print(check_subset([1,4,6], [1,2,3,4,5,6]))
- print(check_subset([2,5,7,9,8], [7,8]))
- print(check_subset([1, 5, 7], [1,4,6,78,12]))
Explanation:
The key idea of this solution is to create a count variable to track the number of the elements in a shorter list whose value can be found in another longer list.
Firstly, we need to check which list is shorter (Line 4). If the list 2 is shorter, we need to traverse through the list 2 in an outer loop (Line 5) and then create another inner loop to traverse through the longer list 1 (Line 6). If the current x value from list 2 is matched any value in list 1, increment the count variable by 1. After finishing the outer loop and inner loop, we shall be able to get the total count of elements in list 2 which can also be found in list 1. If the count is equal to the length of list 2, it means all elements in the list 2 are found in the list 1 and therefore it is a subset of list 1 and return true (Line 10-11) otherwise return false.
The similar process is applied to the situation where the list 1 is shorter than list 2 (Line 15-24)
If we test our function using three pairs of input lists (Line 26-28), we shall get the output as follows:
True
True
False
Answer:
1/3
Explanation:
T₁ , T₂ , be the arrival times of two customers.
See expected time for the earliest and latest below.
The formulas used will guide you.
<u>Client computer:</u>
A customer is a bit of PC equipment or programming that gets to assistance made accessible by a server. The server is frequently (yet not generally) on another PC framework, wherein case the customer gets to the administration by method for a system.
A gathering of customers is generally called a customer framework. The individuals from a customer framework are normally identified with each other in at least one perspective. The customer is likewise another name for a product program used to associate with a server. 3. A customer can likewise be another term used to depict a client.
Answer:
C is the answer mostly I guess
