Answer:
The time complexity of the code is O(log₇n).
Explanation:
The i is updated by 7*i.On each iteration i is multiplied by 7.So on finding the time complexity of the code given above it will come out to be log base 7.
When we divide the input by 2 the time complexity is log base 2.
So on dividing it by 7 we get the time complexity of log base 7.
Answer:
log base 3a= -0.631.log a/3 base 3
Now, -log m= log 1/m
hence,
log base 3a= 0.631.log 3/a base 3
log base 3a/log 3/a base 3 =0.631
log base 3 ( a.3/a) =.631 since, log m/logn =log n(m)
log base 3 3=0.631
Hence, answer is log base 3 3=0.631
Explanation:
Please check the answer section.
Answer:
The above query gives an error.
Explanation:
- The query gives an error because is not the correct syntax of the select or inserts query.
- The syntax of the select query is as follows: "select Attributes_1_name, Attributes_2_name,...., Attributes_n_name from table_name;".
- The syntax of the insert query is : "insert into table_name (column_1_name, column_2_name,...,column_n_name) values (column_1_value, column_2_value,...,column_n_value);".
- The syntax of the insert and select query is : "insert into table_name (select Attributes_1_name, Attributes_2_name,...., Attributes_n_name from table_name);".
- But the above query does not satisfy any property which is defined above. Hence it gives a compile-time error.
Answer:
umm wheres the options so we can answer it and ty
Explanation:
