Hello,
I am looking for some one who can code excellent algorithms, have clear concepts in programming, good with data structures and can code with good design.
Who has good understanding about Big O notations and time/space complexity. If you can answer below questions, and provide support (online) for an hour. You will be awarded this project and good money, excellent feedback and bonus on good work. I am 5.0/5.0 employer. I will create 100% Milestone Money. It will be fun, exciting to work together.
****** Please Refer to the attached File.
BASIC ALGORITHMS
1. What is the best data structure to implement priority queue?
2. What are the worst case time complexity of the following algorithms, performed on containers of size N:
(a) Locating a number in an unsorted array.
(b) Locating a number in a sorted array.
(c) Inserting a number in a balanced binary tree
(f) Deleting a number from an unbalanced binary tree
(g) Building a heap
(h) Adding a number to a hash table
(i) Sorting an array
3. What is the relation (less, greater, equal) between O(n) and O(2n)? O(log2 N) and O(log10 N)?
CODING
EXPECTED TIME TO COMPLETE: 20-30 minutes
1. In a two dimensional array of integers of size m x n, for each element which value is zero, set to zero the entire row and
the column where this element is located, and leave the rest of the elements untouched.
2. Write a function that takes an integer argument and returns the corresponding Excel column name.
For instance 1 would return 'A', 2 would return 'B', ...., 27 would return 'AA' and so on
3. Write code to merge 3 sorted arrays of integers (all different sizes) into a single sorted array.
DEBUGGING
1. Find the bug in the following code:
// Find the first break in monotonically increasing sequence Returns c if there is no break.
int r(int *p, size_t c)
{
int i = 0;
while(p[i + 1] >= p[i] && i < c - 1)
++i;
return i + 1;
}
MATH, PROBABILITY, COMPLEXITY
1. A rare disease afflicts 1% of the population. A medical test for this disease has 1% false positive rate (if a person is healthy, there is a 1% probability that the test will show that the person is ill), and 1% false negative rate (if a person is ill, there is a 1% probability that the test will that the person is healthy). A person tests as having the disease. What is the probability that the person actually has the disease?
2. An evil dictator captured you and made you play a game. You are in front of three glasses of wine. Two of them are poisoned; one is not. You must pick one can and drink it. If you survive, the evil dictator will release you. When you pick one of the glasses, the dictator reveals which one of the other two is poisoned, and offers you to stay with your original choice, or switch. Should you switch?
3. In front of you there is a black box. The box can perform two operations: push(N) adds a number to its internal storage; pop-min() extracts the current minimum of all numbers that are currently stored, and makes the box forget it. The numbers are mathematical objects: there is no upper bound. Both push(N) and pop-min() execute in O(1) time. Design and algorithm that could be used to implement such a box.
4. You are asked to design a plotter. A plotter is a computer-controlled device that picks a pen, carries it to a point on paper using mechanical maniplator, lowers it so that it touches the paper, and drags it to the next point drawing a line. In your plotter there will be 3 pens, red, green, and blue. Computer uploads a picture to the plotter which consists of list of segments and colors in which these segments must be drawn. You are asked to reorder the segments such that the work performed by mechanical manipulator is optimal.
Can you design an algorithm that would do so?
5. What is the time complexity of the following algorithm:
unsigned int Rabbits(unsigned int r)
{
return (r < 2) ? r : Rabbits(r - 1) + Rabbits(r - 2);
}
I know its my first time to bid, but this is the part I'm expert in this is my accounts on online contest sites which contains a lot of algorithms and data structure problems :
TopCoder : [login to view URL]
CodeForces : [login to view URL]
UVA : [login to view URL]
SPOJ : [login to view URL]
I'm forth year computer and System Engineering Department at Faculty of Engineering , Alexandria University and I'm good at java, C++ and we studied an Algorithm Course last year from book : "Introduction to Algorithms By Thomas [login to view URL]"
$44 USD en 1 día
5,0 (1 comentario)
1,3
1,3
14 freelancers están ofertando un promedio de $225 USD por este trabajo
Hi Sir,
I am ready to work for you.I have 9 years of experience in C/C++ , java, mathematics, algorithm, statistics. please see some of my works also check my reviews you will get better idea about my skill.I deliver quality work within time
frame. Please visit my profile once.
Thanks with regards,
Amit
Thanks for the invitation, I am professional from academic institute. Can we start with a small project.
In $80 bid I will work for your project for 7 hours.
Or you can offer me project at $11/hr rate with $33 as MILESTONE and daily as I submit my work I will collect my payment as per invoices raised after work delivery
Hi i am a postgraduate student in computer science and i can answer all the questions in minimum time and will provide detailed solution for the same..
Please refer these answer:-
ques 3. What is the relation (less, greater, equal) between O(n) and O(2n)? O(log2 N) and O(log10 N)?
answer;- O(n) = O(2n) O(log2 N) < O(log10 N)
2. What are the worst case time complexity of the following algorithms, performed on containers of size N:
(a) Locating a number in an unsorted array.---> O(n)
(b) Locating a number in a sorted array. --> O(lg n) by binary search
(c) Inserting a number in a balanced binary tree
(f) Deleting a number from an unbalanced binary tree
(g) Building a heap --> O(n lg n)
(h) Adding a number to a hash table---> O(1)
(i) Sorting an array
i will provide the full solution after awarding the project..
i have more samples , please initiate the chat so that i can send u the sample.....
Thanks
arpit
Hi, I posses all the skills needed to complete this task. I can complete it for you. Similar to you I am also a 5.0/5.0 rated freelancer and have done many programming projects in the past. Do let me know in what language do you need the solutions to be, I can provide them in C, C++ or Java whichever you need.
Thank You!
I have MS in Information Security with research interest of Cryptography.
I have implemented Cryptography algorithms in Java and C, written security solutions in J2EE and Java, have implemented datastructures in Java, and built two websites for research / proof-of-concept purposes. Additionally, ~2 years of IT experience.
I have taken Graduate level courses in Cryptography and Security that dealt with analysis of Cryptographic protocols, my Masters level project involved design of a Cryptographic protocol for a specific authentication problem in three-party settings.
I have executed a number of projects that focussed almost entirely / heavily on Cryptography. I have also written Cryptographically signed Java applet for a J2EE application.
Details about projects executed available on request.
You might want to go through reviews project creators left for me on freelancer.com, see https://www.freelancer.com/u/ciphe.html.
1/ Heap tree: can retrieve element as a sequence (heap sort) and the tree is balance
2/
a) N -> you have to go through all elements in the worst case
b) logN -> use binary search
c) logN -> the maximum height of balanced BST is logN
f) N -> unbalanced tree can be a linked list -> worst case is delete the last element of linked list
g) NlogN -> heap is balanced -> the complexity of insert 1 element is logN -> the complexity of building N element heap tree is: [log1] + [log2] + [log3] + ..... + [log N] is nearly NlogN
h) 1 -> use hash function to find a place to insert.
i) which sorting algorithm you want to use ?
3/ O(log10N) < O(log2N) < O(n) = O(2n)
1/ i = c - 1 -> i + 1 = c -> p[i+1] will give error even in the condition, we can access p[i+1]
1/ Use Bayes -> P = (1% x 1%) / (1% x 1% + 1% x 99%) = 0.01
2/ Should switch
A -> choose normal glass in the seccond time
B -> choose normal glass in the first time
If not switch: P(A) = P(B) = 1/3
If switch: P(A) = P(not B) = 2/3
3/ not enough words
4/ Divide the segments into 3 part: segment with red, segment with green and segment with blue. For each part, calculate the distance between each point of segment. For exam: we need to draw AB, CD cal the dist(A,C); dist(A,D); dist(B,C); dist(B;D)
Step 1: Choose the smallest dist
Step 2: Draw the segment contained one of 2 two points
Step 3: Remove all dist contains 2 points of segment that we've just drawn
5/
U(n) = U(n-1) + U(n-2) + 1 -> can easily proved that the complexity is 2^n
I am a professor in Computer science and engineering with specialization in computer algorithms, data structure and mathematical computing. I have been teaching for last 10 years. I have been involved in various R&D activities for last 10 years. I am confident enough for this job as I am specialized in coding data structure and algorithms in C/C++. I can easily solve the given question within a day. Please assign me.