ZOOKEEPER-4766 - Avoid snapshots during leader election

Hello ZK Community! Tagging some friends in the community for starting the conversation. * @Enrico Olivelli from bookkeeper and pulsar who might have more context. * Yan Zhao who brought up very good concerns. Yan Zhao thinks it's a good idea to implement this, however has concerns

Zookeeper metadata reconstruction for BookKeeper

this effort for the Apache community. What do you folks think? Regards, Anup -- Anup Ghatage www.ghatage.com

Discussion about possible perf degradation in the client R/W path & approach to upgrades and CVEs

be generic enough @Venkateswara Rao Jujjuri ? Maybe there is something on the Pulsar side which we could reuse? After which we should see if this can be a part of our CI/CD GitHub Actions. *[Community action item]* -> Can come to this when we resolve the earlier discussion. Regards, Anup -- Anup Ghatage www.ghatage.com

Re: Running without journal

good to you all. > > > > Great to hear that ! > > > > Thanks > > Enrico > > > >> > >> Thanks > >> Jack > >> > >> -- > >> *Jack Vanlightly* > >> Principal Software Engineer > >> Splunk Inc. > >> jvanligh...@splunk.com <mailto:jvanligh...@splunk.com> < > kramas...@splunk.com <mailto:kramas...@splunk.com>> > >> Barcelona > > -- Anup Ghatage www.ghatage.com

Re: Getting 404 error when trying to merge the PRs using the bk-merge-pr.py script ...

rsonal API token expires. Has anyone else seen this behavior? > > Thanks, > > - Henry > -- Anup Ghatage www.ghatage.com

Re: Bookkeeper and running in FIPS mode

Anup On Fri, Feb 26, 2021, 4:46 PM Henry Saputra wrote: > Any implication on the project's release process to comply with FIPS if it > turns on by default? > > - Henry > > On Fri, Feb 26, 2021 at 12:56 PM Anup Ghatage wrote: > > > Hi Bookies, > > >

Bookkeeper and running in FIPS mode

Hi Bookies, FIPS is 'Federal Information Processing Standard'. Basically it's a set of guidelines for security functions such as encryption/decryption/RNG etc. Applications running in FIPS mode are said to be more secure as they adhere to more stringent standards. Java's security framework is exte

Re: Contributing Splunk changes back to OSS

Kelly wrote: > > There might be slight overlap with BP-40 which I have in the works for > > Audit logging for BKShell and Bkctl. > > Where is BP-40? I don't see it on the dev list. > > -Ivan > -- Anup Ghatage www.ghatage.com

Re: Contributing Splunk changes back to OSS

ht overlap with BP-40 which I have in the works for Audit logging for BKShell and Bkctl. We also have some more work in this area that we're looking to contribute back soon as well. Would like to have a discussion around this when we come to it. Nonetheless, I'm very interested in this. > Anyhow, any feedback appreciated. > > -Ivan > -- Anup Ghatage www.ghatage.com

Client certificate based Authorization.

15atmnl3pS4HrhQ6fV-gSY7faIVlmU91KoApBaXPjEfg/edit?usp=sharing> . Regards, Anup -- Anup Ghatage www.ghatage.com

Re: New BookKeeper website - Translation

Looping in Lobo. On Tue, Oct 27, 2020 at 9:14 AM Anup Ghatage wrote: > Hi Bookies, > > I was looking at using https://crowdin.com/ for the automatic translation > of the new BookKeeper website. As a part of that I was following the steps > @Sijie > Guo had done for Pulsa

New BookKeeper website - Translation

start a mailing list thread about it for the wider audience. So Lobo, I don't have your email address, but if you're in the dev mailing list, feel free to reply on this thread! Regards, Anup -- Anup Ghatage www.ghatage.com

Re: Moving BooKeeper to JDK11

on responsible > may incur in penalties. > The use of this e-mail is only for professional purposes; there is no > guarantee that the correspondence towards this e-mail will be read only by > the recipient, because, under certain circumstances, there may be a need to > access this email by third subjects belonging to the Company. > -- Anup Ghatage www.ghatage.com

Re: Moving BooKeeper to JDK11

on responsible > may incur in penalties. > The use of this e-mail is only for professional purposes; there is no > guarantee that the correspondence towards this e-mail will be read only by > the recipient, because, under certain circumstances, there may be a need to > access this email by third subjects belonging to the Company. > -- Anup Ghatage www.ghatage.com

State of deprecated code and plans ahead

use functionalities which are mentioned above we all have to agree on a path forward. Regards, Anup -- Anup Ghatage www.ghatage.com

Re: [ANNOUNCE] New Committer: Anup Ghatage

Thank you! I am excited to be a part of this passionate community and hope I can contribute to making it even better. Regards, Anup On Wed, Oct 21, 2020 at 2:05 AM Enrico Olivelli wrote: > The Project Management Committee (PMC) for Apache BookKeeperhas invited > Anup Ghatage to be

Re: New website development alert!

oubts, please feel free to post on the mailing list / post on the issue and we can figure it out. Regards, Anup On Sat, Oct 17, 2020 at 11:08 PM Abhey Rana wrote: > Hey Anup, > > I would like to work on BookKeeper #2443 > > Thanks, > Abhey > > On Sun, 18 Oct 2020 at

Re: New website development alert!

list / post on the issue. Regards, Anup On Sat, Oct 17, 2020 at 9:05 PM Rudy wrote: > I’d like to try > > 发自我的iPhone > > > 在 2020年10月14日，上午4:02，Anup Ghatage 写道： > > > > There are colleges which sponsor hacktoberfest competitions. > > Let me set up the issues i

[jira] [Commented] (ZOOKEEPER-3731) Disable HTTP TRACE Method

[ https://issues.apache.org/jira/browse/ZOOKEEPER-3731?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17215589#comment-17215589 ] Anup Ghatage commented on ZOOKEEPER-3731: - This has been fixed here: [h

Re: New website development alert!

encourage new committers and improve our community. Let me check if I can find any contacts for those. Regards, Anup On Tue, Oct 13, 2020 at 12:32 PM Enrico Olivelli wrote: > Anup > thank you for driving this effort > > Il giorno lun 12 ott 2020 alle ore 19:03 Anup Ghatage

[jira] [Issue Comment Deleted] (ZOOKEEPER-2649) The ZooKeeper do not write in log session ID in which the client has been authenticated.

[ https://issues.apache.org/jira/browse/ZOOKEEPER-2649?page=com.atlassian.jira.plugin.system.issuetabpanels:all-tabpanel ] Anup Ghatage updated ZOOKEEPER-2649: Comment: was deleted (was: There was no activity on this since a while, so opened a pr

[jira] [Commented] (ZOOKEEPER-2649) The ZooKeeper do not write in log session ID in which the client has been authenticated.

[ https://issues.apache.org/jira/browse/ZOOKEEPER-2649?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17212714#comment-17212714 ] Anup Ghatage commented on ZOOKEEPER-2649: - There was no activity on

[jira] [Commented] (ZOOKEEPER-3926) make the rc constant in the ClientCnxn

[ https://issues.apache.org/jira/browse/ZOOKEEPER-3926?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17212523#comment-17212523 ] Anup Ghatage commented on ZOOKEEPER-3926: - Since there has been no acti

New website development alert!

Hi everyone, Till now, Bookkeeper has had a custom website which had to be maintained but has been difficult lately as many components/plugins are out of date/broken. @Sijie Guo suggested we follow Pulsar's lead to transform the website into a docusaurus based website. Docusaurus is an easy mark

[jira] [Commented] (ZOOKEEPER-3961) Inaccurate Error Message

[ https://issues.apache.org/jira/browse/ZOOKEEPER-3961?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=17212094#comment-17212094 ] Anup Ghatage commented on ZOOKEEPER-3961: - [~eolivelli] Opened PR 1495

Re: Release Bookkeeper 4.11.1

Update: Was running with JDK8 and got a few test failures. Going to check it out again tomorrow to rule out if it had anything to do with my environment. Regards, Anup On Sat, Sep 19, 2020 at 10:59 AM Enrico Olivelli wrote: > Anup > > Il Sab 19 Set 2020, 18:39 Anup Ghatage h

Re: Release Bookkeeper 4.11.1

Hi Enrico, I can help. Let me know. Regards, Anup On Sat, Sep 19, 2020, 9:27 AM Enrico Olivelli wrote: > If no one has cycles I will start the release process by the end of the > next week. > > > > Enrico > > Il Gio 17 Set 2020, 02:46 Rajan Dhabalia ha > scritto: > > > Hi, > > > > It would be g

Running Bookkeeper tests with JDK11

Hi Bookies, I currently have a unique situation and wanted the community's advice on it. I have an older fork of the Bookkeeper repo which runs on JDK8 and I want to run with JDK11. Specifically I want to build Bookkeeper with JDK8 but run its unit tests with JDK11. Usually runtime JRE/JDK changes

Re: [IMPORTANT] - Migration to ci-builds.a.o

Great chance to review all existing jobs and add new jobs! (Like the slack digest and other bot jobs) On Thu, Jul 16, 2020, 12:56 PM Enrico Olivelli wrote: > FYI > > -- Forwarded message - > Da: Gavin McDonald > Date: Gio 16 Lug 2020, 18:33 > Subject: [IMPORTANT] - Migration to

Re: [VOTE] Release 4.11.0, release candidate #0

//repository.apache.org/content/repositories/staging/org/apache/bookkeeper/ > [4] https://github.com/apache/bookkeeper/tree/v4.11.0-rc0 > -- Anup Ghatage www.ghatage.com

Slack digest emailing bot for Apache BookKeeper

Hi Everyone, Enrico had suggested that conversations are best had on the mailing list as the ASF uses that as a metric to understand the community activity and health. In our recent quarterly report, we noticed that there were A LOT of slack messages and not as many emails which paints an incorrec

Re: Community development work review for 4.11

che/bookkeeper/pull/1893> to be > > merged and then we can start the release process soon. > > > > Thanks, > > Rajan > > > > > > > > On Thu, Jun 11, 2020 at 8:49 AM Anup Ghatage wrote: > > > >> Sounds good Enrico. > >> >

Re: Re-working the BookKeeper site

t a couple of items: > - we must ask for consent before using logos > - we should make the website look well on mobile > - think about the release procedure and how we will have to update the > website after the release (now we have a script but it is awkward) > > Thank you very mu

Re-working the BookKeeper site

Hi Bookies, We've had quite a few issues reported recently about the site. Some are about the fact that the site has dead links and some are about the content. I tried to build the site recently and it didn't even build. @Sijie Guo suggested here

Re: Community development work review for 4.11

ase he has no time within the end of the month > > some comments below > Enrico > > > Il giorno gio 11 giu 2020 alle ore 04:44 Anup Ghatage > ha scritto: > >> >> Hi Bookies! >> >> [image: image.png] >> >> >> >> We've seen awesome

Community development work review for 4.11

t; - Not being worked on yet (OLD) - Add more test cases on LongZkLedgerIdGenerator <https://github.com/apache/bookkeeper/issues/901> - Not being worked on yet (OLD) - remove old Codahale in package `org.apache.bookkeeper.stats` <https://github.com/apache/bookkeeper/issues/1262> - Not being worked on yet (OLD) -- Anup Ghatage www.ghatage.com

Generating documentation for the website

Hi Everyone, I noticed this issue . And when I went to the website, I saw that the link is not populated yet: https://bookkeeper.apache.org/docs/4.10.0/admin/decomission I had created this page as a request from someone in the slack channel

Re: Certificate based authorization for bookkeeper client

ks for bringing up this this topic. > > > Il giorno gio 28 mag 2020 alle ore 00:30 Anup Ghatage > ha scritto: > > > Hey everyone, > > > > I see that we have certificate based authentication in this commit > > < > > > https://github.com/apache/b

Certificate based authorization for bookkeeper client

Hey everyone, I see that we have certificate based authentication in this commit . We also provide a extensibility for 'authorization' by implementing our own AuthZ factory which extends bookieAuthProvider. Howe

Re: Release 4.11.0 and 4.10.0 "stable"

20 09:33 > > A: Bookkeeper-Dev > > Oggetto: Re: Release 4.11.0 and 4.10.0 "stable" > > > > Il giorno lun 20 apr 2020 alle ore 09:20 Anup Ghatage < > ghat...@gmail.com> > > ha scritto: > > > &g

Re: Board report draft for May 2020

Thank you for your comments Enrico, I've made the changes as you suggested. I have tried to tell the story behind the metrics, tried to include the work being done and the work that was done in the past quarter. Please find below the updated report, let me know what you think.

Board report draft for May 2020

Hello, Please find below a draft of the report for Bookkeeper for the ASF board. Any comments / additions are welcome. I've used https://reporter.apache.org/wizard/?bookkeeper and Slack analytics to generate the details for the report. Regards, Anup -

Re: Audit Logging for BookieShell

let me know, so we can work on how to parse the new audit logging based output. Regards, Anup On Wed, Dec 4, 2019 at 1:41 PM Anup Ghatage wrote: > Thanks Sijie, done. > > Regards, > Anup > > On Wed, Dec 4, 2019 at 1:39 PM Sijie Guo wrote: > >> +1 the proposal looks go

Re: Release 4.11.0 and 4.10.0 "stable"

please inform > the > > > sender immediately and destroy this e-mail, its attachments and any > > copies. > > > Any use, distribution, reproduction or disclosure by any person other > > than > > > the intended recipient is strictly prohibited and the person > responsible > > > may incur in penalties. > > > The use of this e-mail is only for professional purposes; there is no > > > guarantee that the correspondence towards this e-mail will be read only > > by > > > the recipient, because, under certain circumstances, there may be a > need > > to > > > access this email by third subjects belonging to the Company. > > > > > > -- Anup Ghatage www.ghatage.com

Re: [VOTE] Relax Time Based Release Plan to 6 months

onal purposes; there is no > > > guarantee that the correspondence towards this e-mail will be read only > > by > > > the recipient, because, under certain circumstances, there may be a > need > > to > > > access this email by third subjects belonging to the Company. > > > > > > -- > Karan Mehta > > <http://smart.salesforce.com/sig/k.mehta//us_mb/default/link.html> > -- Anup Ghatage www.ghatage.com

Re: Audit Logging for BookieShell

eeper_proposals/ > > Thanks, > Sijie > > On Tue, Dec 3, 2019 at 3:11 PM Anup Ghatage wrote: > > > Hi Everyone!, > > > > I have written up a proposal for audit logging in BookieShell. > > < > > > https://docs.google.com/document/d/1bVZfvEnzxmsS2L

Re: Audit Logging for BookieShell

if you look at the code you will see that > bkctl is modern, made with JCommander and very well organized > > Unfortunately there is no doc :) > > Enrico > > Il mer 4 dic 2019, 00:11 Anup Ghatage ha scritto: > > > Hi Everyone!, > > > > I have written up

Audit Logging for BookieShell

n reception of the feature. Kindly take a look when you have time and feel free to add comments on the doc! Regards -- Anup Ghatage www.ghatage.com

Re: Bookkeeper stickers?

That would be awesome! What can we do for those of us who can't attend the events but would still like the stickers? Regards, Anup On Thu, Nov 14, 2019, 5:06 AM Enrico Olivelli wrote: > Hi, > > We do not have Apache Bookkeeper stickers! > > I was at ApacheCon Europe and there were stickers for

[jira] [Comment Edited] (ARROW-2708) [C++] Internal GetValues function in arrow::compute should check for nullptr

[ https://issues.apache.org/jira/browse/ARROW-2708?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16512996#comment-16512996 ] Anup Ghatage edited comment on ARROW-2708 at 6/14/18 9:1

[jira] [Commented] (ARROW-2708) [C++] Internal GetValues function in arrow::compute should check for nullptr

[ https://issues.apache.org/jira/browse/ARROW-2708?page=com.atlassian.jira.plugin.system.issuetabpanels:comment-tabpanel&focusedCommentId=16512996#comment-16512996 ] Anup Ghatage commented on ARROW-2708: - Hi [~wesmckinn]! I'd like to take t

Re: [algogeeks] Re: Generating mazes

3:51 AM, Don wrote: > I believe that this will generate a maze with multiple cycles, which > violates the requirement stated in the initial question that the maze > have exactly one solution. > > On Feb 6, 11:53 am, Anup Ghatage wrote: > > There is another algorithm.. T

Re: [algogeeks] Re: Generating mazes

ve the logic of your rnd() function? > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To unsubscribe from this group and stop receiving emails from it, send an > email to algogeeks+unsubscr...@googlegroup

Re: [algogeeks]

isit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this gro

Re: [algogeeks] Anagrams

egroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to

Re: [algogeeks] Interview question

gt; "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=e

Re: [algogeeks] Finding frequent words

Correction: Upon the frequency of an element it's BROUGHT UP closer to the root. On Wed, Nov 30, 2011 at 6:39 AM, Anup Ghatage wrote: > Splay Trees are self modifying trees. > Upon the frequency of an element it's not is brought up closer to the root. > > So in a cont

Re: [algogeeks] Finding frequent words

umar raja wrote: > @Anup: > > How splay trees come into picture here?? I think TRIE or Hashtable will > work out. > > But it is difficult to conceive the TRIE solutions and explain it to the > Interviewer .so i am looking for something else better and concrete one. > > > O

Re: [algogeeks] Finding frequent words

googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@

Re: [algogeeks] Re: Finding the repeated element

gt; > >> > -- >> > Regards >> > Kumar Raja >> > M.Tech(SIT) >> > IIT Kharagpur, >> > 10it60...@iitkgp.ac.in >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks&q

Re: [algogeeks] An Array Problem

stored in sorted order. Get > a new element from array and lets call this number as m. Push m into the > stack. Now, find all elements which are <= (m-1) using binary search. Pop > out all these elements and assign the value m in the output array. Elements > remaining at the end will

Re: [algogeeks] An Array Problem

algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group

Re: [algogeeks] Amazon Onsite Chennai SDE

quot;Algorithm Geeks" group. >> > To post to this group, send email to algogeeks@googlegroups.com. >> > To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> > For more options, visit this group at >> http://groups.google.c

Re: [algogeeks] difference btw int *a[] and int (*a)[]

p://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks

Re: [algogeeks] Re: kth smallest element

For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To uns

Re: [algogeeks] Re: Median of 2D matrix

>> > > > > > > and use the well known O(N) median selection algorithm to get >> a median >> > > > > > > of this. This has the quality we want of being somewhere >> roughly in >> > > > > > > the middle half of the remaini

Re: [algogeeks] Median of 2D matrix

the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/al

Re: [algogeeks] Microsoft Question

options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscrib

Re: [algogeeks] Dp solution for this problem?

ibe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geek

Re: [algogeeks] Re: Intersection of arrays

"Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. >

Re: [algogeeks] Re: Intersection of arrays

) > > IIT Kharagpur, > > 10it60...@iitkgp.ac.in > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send em

Re: [algogeeks] Re: Questions

. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You re

Re: [algogeeks] Searching In a large file

received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, vis

Re: [algogeeks] Re: Array Problem??

http://groups.google.com/group/algogeeks?hl=en. >> >> > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group,

Re: [algogeeks] Google Interview Question

oogle Groups >>> "Algorithm Geeks" group. >>> To post to this group, send email to algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at

Re: [algogeeks] Amazon Interview Question

.@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algog

Re: [algogeeks]

this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received t

Re: [algogeeks] DS QUESTION

age because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at &

Re: [algogeeks] Microsoft Question

> > > On Sat, Sep 17, 2011 at 8:30 AM, Anup Ghatage wrote: > >> As WgpShashank once pointed out. >> >> Search the whole matrix for the first character instances, for each >> instance, send the array, string and that char's position to a function that >&g

Re: [algogeeks] c output

message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this gro

Re: [algogeeks] How one can measure time spent in context switch??

mail to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subsc

Re: [algogeeks] Microsoft Question

re subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://gro

Re: [algogeeks] Find the output

5} >> a >>&a >> a+1 >> &a+1 >> &a is address of whole array...so &a+1 means next element after array >> completion. >> >> so ptr-1 will point to 5 >

Re: [algogeeks] Re: no of elements of the array

"Algorithm Geeks" group. >> To post to this group, send email to algogeeks@googlegroups.com. >> To unsubscribe from this group, send email to >> algogeeks+unsubscr...@googlegroups.com. >> For more options, visit this group at >> http://groups.google.com/group/

[algogeeks] Find the output

#include int main() { int a[5]={1,2,3,4,5}; int *ptr=(&a + 1); printf("%d %d\n",*(a+1),*(ptr-1)); return 0; } Find the output! -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. T

Re: [algogeeks] C++ Query...

mail to algogeeks@googlegroups.com. >>> To unsubscribe from this group, send email to >>> algogeeks+unsubscr...@googlegroups.com. >>> For more options, visit this group at >>> http://groups.google.com/group/algogeeks?hl=en. >>> >> >> -- >&

Re: [algogeeks] OS

isit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from

Re: [algogeeks] Re: Returning 0 with probability p and 1 with probability 1-p

gogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > > -- Anup Ghatage -- You received this message because you are sub

Re: [algogeeks] Re: Questions -->

gorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > &g

Re: [algogeeks]

or more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To uns

Re: [algogeeks] informatica pattern and question of interview

gt; > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@googlegroups.com. > To unsubscribe from this group, send email to > algogeeks+unsubscr...@googlegroups.com. >

Re: [algogeeks] Re: Please provide Code to Find kth Smallest or kth Largest element in unsorted array in liner time ?

Here is another one. Pardon me if it goes by some other name. Divide the array in K parts. Find the Maximum in each of these parts and store it in an array of size K. Find the Minimum in K to find the K'th max. Total Time Complexity = O ( n + k ) where 0 <= k <= n -- Anup Ghata

Re: [algogeeks] EOF

You can quite easily map this problem to that of a typical client-server protocol. You don't know the size of the data, and the all packets will be of a certain size, possibly, except the last one. So the solutions provided for that problem might apply to some cases of this! -- Anup Gh

Re: [algogeeks] IP Address

> http://groups.google.com/group/algogeeks?hl=en. >> > > > > -- > **Regards > SAGAR PAREEK > COMPUTER SCIENCE AND ENGINEERING > NIT ALLAHABAD > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks&quo

Re: [algogeeks] MICROSOFT

le , we don't give the size of >> the table ahead ... It decides some size, and implements.. when we cross the >> assumed size,then it again gives some more memory so that all the operations >> are optimum (less collisions). >> >> >> On Sun, Sep 4, 2011 a

Re: [algogeeks] MICROSOFT

2 in worst case. So the algorithm would be O( m^2 log m ) just to populate the hash and find the frequencies. -- Anup Ghatage -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups

Re: [algogeeks] Min no of moves

That's interesting. when n = 3 We have been given this :F F F | E E E Swap the middle element and it becomes: F E F | E F E Which is what you want, but when n = 5 F F F F F | E E E E E And you swap the middle element it becomes: F F E F F | E E F E E So the same startegy doesn't apply. But

Re: [algogeeks] MICROSOFT

Just a quick note to the above solution. If the tree is a binary search tree and you are going to put it in an array after an inorder traversal, the elements will be sorted, so to find the k'th max just access the n-k'th element -- You received this message because you are subscribed to the Goog

Re: [algogeeks] Tejas networks

Could you please give an example for question 3? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroup

Re: [algogeeks] very urgent .. help

What is the purpose of this elitmus test? Does scoring good in it qualify you for something? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@googlegroups.com. To unsubscribe from this group, send

  1   2   >