Round 1:
1.A sequence is defined to be a increasingly sorted set of fully reduced fractions always having values in between 0 and 1. Input will be the the order of the sequence. Note that the sequence will always start by 0/1.
Examples:
Input : 1 Output : 0/1, 1/1 Input : 2 Output : 0/0,1/2,1/1 Input : 3 Output : 0/0,1/3,1/2,2/3,1/1 Input : 4 Output : 0/0,1/4,1/3,1/2,2/3,3/4,1/12. Given an integer n, find the minimum number of 'digits' that has the product equal to the number.Print -1 if not possible to express as a product of digits. Expected complexity O(log(n)). Examples:
Input : 10 Output : 2 as x = 25 Input : 26 Output : -1 Input : 100 Output : 3 as x = 4553. Egyptian fractions problem with the restriction that only odd denominators are allowed. Examples:
Input : 12/35 Output : 1/3 + 1/105Round 2: Questions on semaphore: 1. Reader's writer problem 2. Building H20 Round 3: Question on Distributed Systems and achieving consistency using Lamport Timestamps. If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
