Answer:
Program :
list_1=[]#take the empty list.
size=int(input("Enter the size of the list: "))#take the size of the list from the user
for x in range(size): #for loop which insert the elemnt on the list.
list_1.append(int(input("Enter the "+str(x+1)+" element of the list: ")))#take the user input and insert the element.
element=int(input("Enter the element to be searched: "))#it take the elemnt to search.
loc=1#intialize the location value.
count=0
for x in list_1:#for loop to check the element.
if(x==element): #check the element.
print(loc,end=", ")#print the location of the element.
count=count+1
loc=loc+1
if(count==0):
print("The element is not present on the list")#print when elemnt are not present.
Output:
- If the user input 5 for the size and 1,2,3,4,5 for the list and 5 for the element, then it will print 5.
Explanation:
- The above code is in python language which is used to take the size for the list, then take the value to add on the list.
- Then the element is entered from the user to search on the list.
- Then the element is searched on the list with the help of for loop.
- It prints the location when the element is matched.
Answer:
ToolBox.
Explanation:
A label control may be added to a form by double-clicking on the Label control icon in the ToolBox window.
Answer:
In C:
#include <stdio.h>
#include <math.h>
int main(){
float f0,r,temp;
r = pow(2.0,1.0/12);
printf("f0: "); scanf("%f", &f0);
temp = f0;
for(int i = 0; i<=4;i++){
f0 = f0 * pow(r,i);
printf("%.2lf ", f0);
f0 = temp; }
return 0;
}
Explanation:
This declares f0, r and temp as float
float f0,r,temp;
This initializes r to 2^(1/12)
r = pow(2.0,1.0/12);
This prompts the user for f0
printf("f0: "); scanf("%f", &f0);
This saves f0 in temp
temp = f0;
This iterates the number of keys from 0 to 4
for(int i = 0; i<=4;i++){
This calculates each key
f0 = f0 * pow(r,i);
This prints the key
printf("%.2lf ", f0);
This gets the initial value of f0
f0 = temp; }
return 0;
Answer:
++ provides versions of these algorithms in the namespace std::ranges. Algorithms are the vast topic that covers topics from searching, sorting to min/max heaps. These can be categorized as:
Explanation of C++ Algorithm
Explanation:
Answer:
red
Explanation:
color is set to red in the last line of being defined.
