Question
Find the smallest perfect square that is divisible by 10,
14, 18, and 21. What is the remainder when it is divided by 85?Solution
ATQ,
LCM of 10, 14, 18 and 21 = 630
Since, 630 = (2 Γ 3 Γ 3 Γ 5 Γ 7)
To make it a perfect square, multiply by (2 Γ 5 Γ 7) = 70
So, required number = 630 Γ 70 = 44100
44100 Γ· 85 = 518 Γ 85 + 30
So, desired remainder = 30
What is a deadlock in a computer system?
Which application layer protocol is commonly used for transferring web pages over the internet?
What is the concept of "paging" in memory management?
Trace the output int main() { int a=12,b=39; printf ("%d",a&b); return 0; }
Which classic dynamic programming problem involves finding the shortest path in a weighted, directed graph?
What is the term for the process of transferring data between physical memory and secondary storage in virtual memory systems?
A control unit in a CPU uses a microprogram to:
The Master-Slave JK flip-flop overcomes the problem of race conditions by:
_______is the machine learning algorithms that can be used with unlabeled data?
Which notation is used to represent a weak entity in an ER diagram?