Programming Articles - Page 1484 of 3363

Tensorflow is a machine learning framework that is provided by Google. It is an open-source framework used in conjunction with Python to implement algorithms, deep learning applications and much more. It is used in research and for production purposes.It has optimization techniques that help in performing complicated mathematical operations quickly.This is because it uses NumPy and multi-dimensional arrays. These multi-dimensional arrays are also known as ‘tensors’. The framework supports working with deep neural network. It is highly scalable, and comes with many popular datasets. It uses GPU computation and automates the management of resources. It comes with multitude of machine ... Read More

Tensorflow is a machine learning framework that is provided by Google. It is an open-source framework used in conjunction with Python to implement algorithms, deep learning applications, and much more. It is used in research and for production purposes.It has optimization techniques that help in performing complicated mathematical operations quickly.This is because it uses NumPy and multi-dimensional arrays. These multi-dimensional arrays are also known as ‘tensors’. The framework supports working with deep neural networks. It is highly scalable and comes with many popular datasets. It uses GPU computation and automates the management of resources. It comes with multitude of machine ... Read More

Suppose we have a queue full of numbers. We have to check whether the consecutive elements in the queue are pairwise consecutive or not.So, if the input is like que = [3, 4, 6, 7, 8, 9], then the output will be True.To solve this, we will follow these steps −q := define a queue and insert all elements from given list into qtemp := a new listwhile q is not empty, doinsert front element of queue into temp and delete front element from queuetemp2 := a new listwhile temp is not empty, doinsert last element of temp into temp2delete ... Read More

Suppose we have a number n. We have to check whether the product of (1*2*...*n) is divisible by (1+2+...+n) or notSo, if the input is like num = 5, then the output will be True as (1*2*3*4*5) = 120 and (1+2+3+4+5) = 15, and 120 is divisible by 15.To solve this, we will follow these steps −if num + 1 is prime, thenreturn falsereturn trueExampleLet us see the following implementation to get better understanding − Live Demodef isPrime(num):    if num > 1:       for i in range(2, num):          if num % i == 0:             return False       return True    return False def solve(num):    if isPrime(num + 1):       return False    return True num = 3 print(solve(num))Input5OutputTrue

Suppose we have a number n. We have to check whether the product of odd placed digits and the even placed digits are same or not.So, if the input is like n = 2364, then the output will be True as product of odd placed numbers are 2 * 6 = 12 and product of even placed numbers are 3 * 4 = 12 which are same.To solve this, we will follow these steps −if num < 10, thenreturn Falseodd_place := 1, even_place := 1while num > 0, dod := last digit of numodd_place := odd_place * dnum := quotient ... Read More

Suppose we have an array nums with all prime numbers. We have to check whether the product of all numbers present in nums is a perfect square or not.So, if the input is like nums = [3, 3, 7, 7], then the output will be True as product of all elements in nums is 441 which is a perfect square as 21^2 = 441.To solve this, we will follow these steps −m := a map containing all elements in nums and their frequenciesfor each key in nums, doif m[key] is odd, thenreturn Falsereturn TrueExampleLet us see the following implementation to ... Read More

Suppose we have two coordinates (sx, sy), and (tx, ty), we have to check whether we can move from starting point to ending point or not. Here we can move consists of taking a point (x, y) and transforming it to either (x, x+y) or (x+y, y).So if the inputs are (1, 1) and (4, 5), then the answer will be true, this is because move (1, 1) to (2, 1), then (3, 1), then (4, 1), then (4, 5).To solve this, we will follow these steps −while tx > sx and ty > sy, do −if tx > ty, ... Read More

Suppose we have two numbers x and y. We have to check whether one of these two numbers is 1's complement of the other or not. We all know the 1's complement of a binary number is flipping all bits from 0 to 1 or 1 to 0.So, if the input is like x = 9, y = 6, then the output will be True as the binary representations are x = 1001 and y = 0110 which are complement of each other.To solve this, we will follow these steps −z = x XOR yreturn true when all bits in ... Read More

Suppose we have a number which is either in octal or in decimal form. If this is in octal form check whether it is palindrome or not. If the number in decimal, then convert it to octal then check whether it is palindrome or not.So, if the input is like num = 178, then the output will be True as the number is not in octal form (8 is not valid symbol in octal but valid in decimal), then convert it to octal which is 262 and this is palindrome.To solve this, we will follow these steps −base := 8 ... Read More

Suppose we have a number n, and we have another input c. We have to check whether n can be displayed using 7-segment displays or not. Now here is a constraint. We are only allowed to glow at most c number of LEDs.So, if the input is like n = 315 c = 17, then the output will be True as 315 needs 12 LEDs and we have 17.To solve this, we will follow these steps −seg := a list containing led counts for all digits : [6, 2, 5, 5, 4, 5, 6, 3, 7, 6]s := n as ... Read More