Answer:
import random
a = random.randint(1,10)
b = random.randint(1,10)
answer = a * b
print (str(a) + " X " + str(b) + " = " + str(answer))
Explanation:
Happy to help you mate
Answer:
Zero (0); one (1).
Explanation:
Boolean logic refers to a theory of mathematics developed by the prominent British mathematician, called George Boole. In Boolean logic, all variables are either true or false and are denoted by the number "1" or "0" respectively; True = 1 or False = 0.
The memory of a computer generally stores data as a series of 0s and 1s. In computer memory, zero (0) represents the absence of an electric signal i.e OFF and one (1) represents the presence of an electric signal i.e ON.
Answer:
from collections import Counter
def anagram(dictionary, query):
newList =[]
for element in dictionary:
for item in query:
word = 0
count = 0
for i in [x for x in item]:
if i in element:
count += 1
if count == len(item):
newList.append(item)
ans = list()
for point in Counter(newList).items():
ans.append(point)
print(ans)
mylist = ['jack', 'run', 'contain', 'reserve','hack','mack', 'cantoneese', 'nurse']
setter = ['ack', 'nur', 'can', 'con', 'reeve', 'serve']
anagram(mylist, setter)
Explanation:
The Counter class is used to create a dictionary that counts the number of anagrams in the created list 'newList' and then the counter is looped through to append the items (tuple of key and value pairs) to the 'ans' list which is printed as output.
The way a particular application views the data from the database that the application uses is a sub-schema.
<h3>What is Database?</h3>
A Database may be defined as a process of collecting data and information that is principally assembled for quick search and recoupment by a computer.
The sub-schema is the reasoning elucidation of that section of the database which is applicable and accessible to a specific application. This type of database is common to two or more applications.
Therefore, the sub-schema is the way through which a particular application views the data from the database that the application uses.
To learn more about Database, refer to the link:
brainly.com/question/26096799
#SPJ4
Answer: Backtracking
Explanation:
Backtracking algorithm approaches a solution in a recursive fashion whereby it tries to build answers and modify them in time intervals as we progress through the solution. One such backtracking algorithm is the N Queen problem whereby we place N Queen in a chessboard of size NxN such that no two queens attack each other. So we place a queen and backtrack if there is a possibility that the queen is under attack from other queen. This process continues with time and thereby it tends to extend a partial solution towards the completion.
