@ sachin : again u misunderstood the question .. question says *longest* ..
As per u'r algo ..
1. Find out start and end index of contiguous subarray which has max sum
O(n)
2.Once u have start and end index calculate avg if it satisfies the
condition then done O(n)
*NO -- even if it
Hi,
Amazon is hiring people for software development projects undergoing at
Blore, Hyd and Chennai divisions.There are openings for Software
Development Engineer, Software Development Engineer in Test, Application
Engineer and for Quality Assurance Engineer positions .Send me your resume
if you
no more replies on this thread please.
On Fri, Nov 23, 2012 at 9:29 PM, Vivek Ramamoorthy vivekr...@gmail.comwrote:
Hi,
Amazon is hiring people for software development projects undergoing at
Blore, Hyd and Chennai divisions.There are openings for Software
Development Engineer, Software
i) vector = A non synced data structure good for random access and bad
for insertions,deletions and sequential scans.
ii) Singly linked list = Bad for random access, good for one way
sequential access, good for insertions in the middle.
iii) Doubly linked list = Bad for random access, best for
I am sorry, vectors are synced and hence slow (concurrency overhead,
arraylists are non synced). Rest remain the same, if your application
demands frequent two way sequential scans, go for DLL.
Pralay Biswas
MS-CS, University of California Irvine
On Wed, Nov 21, 2012 at 6:57 AM, Pralay Biswas
i would rather suggest vector for FAST SEQUENTIAL ACCESS
as Vector contain elements in contiguous memory locations...so cache
locality is good in case of it
as in case of Singly Linked List or Doubly Linked List,, cached locality is
not good,, Sequntial access would not be fast in a long run..
Maximum no. of nodes in a B-tree : ∑ from i=0 to h-1 of (n+1)^i = 1/n * (
(n+1)^h -1). This is the case as, each node can have a max. of n keys, then
it will have a max. of n+1 children. So then summing up the max. no. of
children from the root till the level h-1, gives the total no. of nodes
Any experience is needed for to apply this job..???
On Fri, Nov 23, 2012 at 9:29 PM, Vivek Ramamoorthy vivekr...@gmail.comwrote:
Hi,
Amazon is hiring people for software development projects undergoing at
Blore, Hyd and Chennai divisions.There are openings for Software
Development Engineer,
@Pralay.. can u give a more detail about non synced data structure
--
@ bharat, koup
Sorry I missed this condition...
Algo can tweaked little bit further to cover all conditions..
Algorithm--
1. Find out start and end index of contiguous subarray which* has sum 0 *
O(n)
2.Once u have start and end index calculate avg if it satisfies the
condition then done O(n)
On Friday 23 November 2012 09:29 PM, Vivek Ramamoorthy wrote:
Hi,
Amazon is hiring people for software development projects undergoing
at Blore, Hyd and Chennai divisions.There are openings for Software
Development Engineer, Software Development Engineer in Test,
Application Engineer and for
Also, vectors are not contiguously memory slotted always. Its a expanding
array where the resizing takes place on demand. There are times when the
array backing the vector is resized and re-allocated, but even then the
amortized cost of insertion stays linear (O(n)). Although it makes sense
to
@Dave: Could you please correct me if am wrong here.
1) So we are looking out for the worst case, and that happens when m and n
are consecutive Fibo numbers, being mutually prime to reach other.
2) Its taking 5 iterations to reduce the number of digits in the smaller of
m and n, by one. Assuming
assume there are no additional insertions, so we care about only accessing
an element.
On Sat, Nov 24, 2012 at 12:30 AM, Pralay Biswas
pralaybiswas2...@gmail.comwrote:
non synced data structure = not thread safe in most prog languages!
On Fri, Nov 23, 2012 at 9:00 AM, Atul Singh
@Pralaybi: You've got it right. Since h is proportional to the log of the
smaller number, we also can say that the complexity is O(log^2 (smaller
number)).
Dave
On Friday, November 23, 2012 2:09:01 PM UTC-6, pralaybi...@gmail.com wrote:
@Dave: Could you please correct me if am wrong here.
@kartik +1:P :P
PS : pardon the pun.
On Sat, Nov 24, 2012 at 11:42 AM, Kartik Sachan kartik.sac...@gmail.comwrote:
hey anybody has any idea about video streaming using vlcj lib ??
--
*WITH REGARDS,
*KARTIK SACHAN
B.Tech. Final Year
Computer Science And Engineering
Motilal
16 matches
Mail list logo
