## Analyst Interview Questions

- 0of 0 votes
Write a C program to print 'n' prime numbers in reverse order?

- 0of 0 votes
Write a program to print Fibonacci sequence in reverse order?

- 0of 0 votes
Well design a master controller/scheduler which should be configurable and capable of running multiple processors at a same time

Scheduler Operation :-

scheduler process should be able to perform various operations below are the examples

1. execute sql queries and stored procedures in the database

2 should be able to send emails with given set of arguments and attachment to business

3 should be able to send ftp files based on input arguments

4 should be able to execute batch files

process should have below capabilities

Process Operation :-

1 Remotely start/stop a child process

2 Raise alerts when any above process fails

3 Automatically restart the process if it fails

4Remotely kill a child process that breaches a pre set timeout limit

so for scheduler and processor I have to come to design with

1 High level design

2 Class level diagram

3 Design should be flexible t incorporate more operations

4 any design pattern you think we can use

- -1of 1 vote
What is the last digit of the largest prime number?

- 0of 0 votes
How many integers from 1 to 100 inclusive can be written as the product of two (not necessarily distinct) primes?

- 0of 0 votes
Mr. White is an approximately forty years old father with 4 sons of distinct ages. Writing his age 3 times in succession, we get a 6-digit number that is equal to the product of his age, his wife's age and his 4 sons' ages.

Give the sum of his wife's age and all 4 sons' ages.

- 0of 0 votes
2^2014 + 1007^4

Is this sum equal to a prime number?

- 0of 0 votes
If a prime 'p' can be expressed as the difference of square of two positive integers, then find the

Prime Numbers: Level 1 Challenges

If a prime can be expressed as the difference of square of two positive integers, then find the remainder, when (p^2 + 138 ) is divided by 4.

- 0of 0 votes
Find the number of primes among the numbers mentioned below. (! means factorial)

345!+2, 345!+3, 345!+4, ......., 345!+345.

- 0of 0 votes
The sum of three primes is 100. One of them exceeds the other by 36. Find the largest prime.

- -1of 1 vote
P, P+2, and P+3

If P > 3, can all three numbers above be prime?

- 0of 0 votes
Consider a digital clock. The first time after midnight when the three digits are all prime numbers is 2:22 am. What is the last time before 10:00 am when the three digits on the clock are all prime numbers?

- 0of 0 votes
Design a movie ticketing system where ticket prices goes up or down based on demand. If no tickets were booked in the last 4 hours, the prices should fall by 10%

- 0of 0 votes
How to do estimate driver arrival and drop off time?

- 0of 0 votes
How to evaluate that the estimated time (for when the driver arrives and the drop off time) is a good estimate?

- 0of 0 votes
The following is the design question I was asked.

Design a dash board.

Should be very realistic.

Should be scalabe .

Should have very less latency .

Can expect millions of updates per second.

Dash board should show :

for each day :

1. city name ,

2.total trips in that city for that day ,

3.total fare it could collect in that city on that day,

4. fare collected from old clients

5. fare collected from new clients (new client is the client who is having his first ride in Uber after registration)

Input : we get two strings s1 , s2.

the format of s1 : trip_id , client_id , city , datetime

the format of s2 : trip_id , fare.

Could you please suggest how to proceed for this kind of question?

- 0of 0 votes
A List contains objects (a collection even). On iterator.next(), if a collection is encountered it should traverse it until it finds an object(not collection). Entering list.get(4) should give the object at 4th position

List contains - String, Double, List(Double, Person), List(Employee, Long). list.get(4) should return Employee

write a java function?

- 0of 0 votes
You have a guy who is walking on a street with "X" doors on one side

(say left side).From the third round, He has to walk "X" rounds to and

fro( from point A, starting point to B, ending point).

So he walks "X" times from A to B, and back "X" times.

First two rounds he just walks to and fro.

Every time he walks he closes the particular doors corresponding to

the number of the round of his walk, starting from the third round. So

at the third round, he closes the third door, sixth door, ninth door,

.... upto

"X", if "X" is a multiple of 3,

"X-1", if "X-1" is a multiple of 3

AND

"X-2", if "X-2" is a multiple of 3

Then he walks till the "X" door. This he does for every round, till

the "Xth" round.

So, if X is 300, he walks upto the 300th door, closes the 300th door

and returns.

If X is 400, he closes upto 399th door, goes till the 400th door and returns.

If X is 500, he closes upto 498th door, goes till the 500th door and returns.

While returning, he just does nothing. He just returns to where he

started i.e. POINT A.

Likewise for the fourth round, where he close doors that are multiples

of 4 i.e. 4, 8, 12, 16, etc till X (Similar calc as in the 3rd round,

except that we consider multiples of 4 here).

And so on till the "Xth" round.

I.E.

This continiues till "X" rounds. So, from 3 to X rounds. Note that we

have not included 1st and 2nd rounds.

Problem here is:

Write the code in any language of your choice to find:

What is the minimum number of the round where he would not have to close any door?

- 0of 0 votes
The cox email customer service phone number is where experts will assist the user in any difficulty faced.

Apart from this option to make a call to the experts, users can also select the option of live chat in which user can have a direct talk with the experts in order to get the assistance on different issues. Users can also find the solutions store where they can visit to get the assistance.

for more information visit our site:http://www.emailhelpgroup.com/cox-customer-service

- 0of 0 votes
Implement cache dictionary Code Assesment CustomCache<T,TID>.

- 0of 0 votes
Write SQL query to get the earliest flight from A to B.

- 0of 0 votes
I want to run a function that does that automatically for me until the condition is complete (condition is some update statement),if i have 2000 records and exit when condition should be counter<500;

so if i have 2000 records so counter will be 2000/500 =4

loop will execute for 4 times

update statement should consist of

update tablename set counter=1 where rownum<500

this process continues until the update condition is met

- 0of 0 votes
Given an array of integers, rearrange the array in such a way that the first element is first maximum and second element is first minimum.

Input : {1, 2, 3, 4, 5, 6, 7}

Output : {7, 1, 6, 2, 5, 3, 4}

- 0of 0 votes
What technology is used by Autoportal.com to store there huge Databse?

- 0of 0 votes
You have a farm of 400m * 600m where coordinates of the field are from (0, 0) to (399, 599). Some part of the farm is barren. All the barren land is in form of rectangles. Due to these rectangles of barren land, the remaining area of fertile land is present in form of holes in the farm. Each hole is a maximal area of land that is not covered by any of the rectangles of barren land.

Input

You are given a set of rectangles that contain the barren land. Each String in rectangles consist of four integers separated by single spaces, with no additional spaces in the string. The first two integers are the coordinates of the bottom left corner in the given rectangle, and the last two integers are the coordinates of its top right corner.

Output

Output all the holes’s area in square meters, sorted from smallest area to greatest, separate by space.

Sample Input/ Output

Sample Input Sample Output

{“0 292 399 307”} 116800 116800

{“48 192 351 207”, “48 392 351 407”, “120 52 135 547”, “260 52 275 547”}

22816 192608

Deliverables – the code below or similar structure

import java.io.*;

public class Solution { public static void main(String args[] ) throws Exception { /* Enter your code here. ead input from STDIN. Print output to STDOUT */ }}

- 0of 0 votes
How to sort an array of integers using two priority queues ?

- 0of 0 votes
This was design question.

I have a single timer class which is running on a single port of a machine.

There are multiple clients that can send request to this timer class as follows.

request_timer (x)

where x is time in seconds.

when the timer class gets this request from a client it starts a timer object of x seconds and after x seconds are over it sends an event to the requesting client and client can handle the event the way it wants to .

The problem is if you have large number of clients then the timer class is single point of congestion and the clients may receive the event from it after a long time.

What are the good ways to scale this for a large number of clients?

- 0of 0 votes
A parent array P is given where P[i] denotes the parent of the ith node in the tree(the tree is generic). Parent of root is indicated with -1. I need to find the height/depth of tree. (Best sol in O(n))

- 0of 0 votes
Table 1; transaction_id, price

Table 2: transaction_id, zipcode

Query to find the avg price per zipcode

Query to show zipcodes that have an avg price more than $5.

- 0of 0 votes
Ebay lowers its listing fee for one of the product ( bikes), and sees an increase in avg sales price. Explain why?