On 5/22/11, algogeeks+nore...@googlegroups.com
<algogeeks+nore...@googlegroups.com> wrote:
> =============================================================================
> Today's Topic Summary
> =============================================================================
>
> Group: algogeeks@googlegroups.com
> Url: http://groups.google.com/group/algogeeks/topics
>
>   - C OUTPUT [1 Update]
>     http://groups.google.com/group/algogeeks/t/d69d89bfd1fddcc1
>   - Divide 2 nos. without DIVISON [3 Updates]
>     http://groups.google.com/group/algogeeks/t/ce4b3b33265f52c7
>   - first fit bin packing [2 Updates]
>     http://groups.google.com/group/algogeeks/t/720b4c5e4dd6d408
>   - Popular Puzzle of the week [1 Update]
>     http://groups.google.com/group/algogeeks/t/4d4140d75e1fd94f
>   - Array problem [1 Update]
>     http://groups.google.com/group/algogeeks/t/feaba4b7154ebc93
>   - Study Online For Diploma [1 Update]
>     http://groups.google.com/group/algogeeks/t/851a798bf4d2ec7c
>   - PUZZLE [4 Updates]
>     http://groups.google.com/group/algogeeks/t/72f60d505357a38e
>   - 3 in 1 remote control [1 Update]
>     http://groups.google.com/group/algogeeks/t/13d3967865afcfbf
>   - convert a number from one base to another. [1 Update]
>     http://groups.google.com/group/algogeeks/t/e9ec80952d2ec42c
>   - Application of Data Structure In Moview] [1 Update]
>     http://groups.google.com/group/algogeeks/t/48431d6aa2066f18
>   - Puzzle Digest Of The Week 16May - 20May [1 Update]
>     http://groups.google.com/group/algogeeks/t/d57af414e991214b
>
>
> =============================================================================
> Topic: C OUTPUT
> Url: http://groups.google.com/group/algogeeks/t/d69d89bfd1fddcc1
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: sourabh jakhar <sourabhjak...@gmail.com>
> Date: May 22 03:11PM +0530
> Url: http://groups.google.com/group/algogeeks/msg/a0f8790eddd302bf
>
> #include<stdio.h>
> void main()
> {
>     long x;
>     float t;
>     scanf("%f",&t);
>     printf("%d\n",t);
>     x=90;
>     printf("%f\n",x);
>     {
>         x=1;
>         printf("%f\n",x);
>         {
>
>
> =============================================================================
> Topic: Divide 2 nos. without DIVISON
> Url: http://groups.google.com/group/algogeeks/t/ce4b3b33265f52c7
> =============================================================================
>
> ---------- 1 of 3 ----------
> From: punnu <punnu.gino...@gmail.com>
> Date: May 21 11:40PM -0700
> Url: http://groups.google.com/group/algogeeks/msg/7db62aff15b5d04
>
> Given 2 nos.  we need to divide them without performing divison.
> Please give a better solution than subtracting the nos. again and
> again.
>
>
> ---------- 2 of 3 ----------
> From: kunzmilan <kunzmi...@atlas.cz>
> Date: May 22 01:22AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/ff0dffbe3d724b83
>
>> Please give a better solution than subtracting the nos. again and
>> again.
>> Try to multiply the smaler number and by a suitable number, subtract the
>> product, compare, and repeat adding zeroes, if
>
> ---------- 3 of 3 ----------
> From: ankit sambyal <ankitsamb...@gmail.com>
> Date: May 22 01:50AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/bf3c722f64c335ae
>
> Solve it using shift operator....   here is the crude algo :
>  the procedure for the division algorithm, given a dividend and a divisor
> would be to left shift (multiply by 2) the divisor till it
>
>
> =============================================================================
> Topic: first fit bin packing
> Url: http://groups.google.com/group/algogeeks/t/720b4c5e4dd6d408
> =============================================================================
>
> ---------- 1 of 2 ----------
> From: "pacific :-)" <pacific4...@gmail.com>
> Date: May 22 01:33PM +0530
> Url: http://groups.google.com/group/algogeeks/msg/274c97e6a4dbb141
>
> @ankit: I didn't undertand ur explanation for why a sort wont work.
>
> 1. Sort the bins by the left over space.
> 2. For a new value to be inserted , do a binary search and locate the best
> fit.
>
> ---------- 2 of 2 ----------
> From: ankit sambyal <ankitsamb...@gmail.com>
> Date: May 22 01:48AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/76107786d599274e
>
> @chinna:   the question asks for first fit, not best fit
>
>
>
>
>
>
> =============================================================================
> Topic: Popular Puzzle of the week
> Url: http://groups.google.com/group/algogeeks/t/4d4140d75e1fd94f
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: Lavesh Rawat <lavesh.ra...@gmail.com>
> Date: May 22 12:57PM +0530
> Url: http://groups.google.com/group/algogeeks/msg/f99eafa6bec17f7a
>
> *Hi,*
> *
> *
> *Based on most comments, The popular puzzle of the last week is*
>
> *
> http://dailybrainteaser.blogspot.com/2011/05/like-dislike-mathamatical-quiz-17-may.html?lavesh=lavesh
> *
>
>
>
>
> =============================================================================
> Topic: Array problem
> Url: http://groups.google.com/group/algogeeks/t/feaba4b7154ebc93
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: MONSIEUR <monsieur....@gmail.com>
> Date: May 21 11:47PM -0700
> Url: http://groups.google.com/group/algogeeks/msg/45c0d194d7fab1b8
>
> @piyush: excellent buddy....btw what was the initial
> spark...???.....:-)
>
>
>
>
> =============================================================================
> Topic: Study Online For Diploma
> Url: http://groups.google.com/group/algogeeks/t/851a798bf4d2ec7c
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: Geo News <22au...@gmail.com>
> Date: May 22 08:52AM +0500
> Url: http://groups.google.com/group/algogeeks/msg/6cbd958703340a39
>
> *Japanese Universities
> All classes are offered in English. 30-100% tuition reduction offered.
> http://bit.ly/khS0GB
> Study Online For Diploma
> Study at Your Own Time & Own Pace Globally Recognized
>
>
> =============================================================================
> Topic: PUZZLE
> Url: http://groups.google.com/group/algogeeks/t/72f60d505357a38e
> =============================================================================
>
> ---------- 1 of 4 ----------
> From: bittu <shashank7andr...@gmail.com>
> Date: May 21 05:14AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/907b305a2148bab8
>
> @all  you can find the better explanation here , hope it will help
>
> http://ashutosh7s.blogspot.com/2011/02/camel-and-banana.html
>
> feel free to comment if anything wrong
>
>
> Thanks
>
> ---------- 2 of 4 ----------
> From: Dave <dave_and_da...@juno.com>
> Date: May 21 07:54AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/6ff5e9ca52f4b5d6
>
> @All: The difference between the camel-and-banana problem and this one
> is that the elephant eats the banana _after_ he has gone the km. As in
> the camel explanation, he establishes a cache of bananas
>
> ---------- 3 of 4 ----------
> From: Anders Ma <xuejiao...@gmail.com>
> Date: May 21 11:58PM +0800
> Url: http://groups.google.com/group/algogeeks/msg/610266c8b25af683
>
> 1) go to 1000/3 with 1000 babanas, reserves 1000/3 at 1000/3 position
> 2) same as 1)
>
> now there are 2000/3 bananas at 1000/3 position.
>
> 3) go to 1000/3 position with 1000 babanas, then there are
>
> ---------- 4 of 4 ----------
> From: Dave <dave_and_da...@juno.com>
> Date: May 21 12:12PM -0700
> Url: http://groups.google.com/group/algogeeks/msg/9223a9aadd0fea8e
>
> @Anders: First cache should be 2,000 bananas at 200 km. Then you can
> get 534 bananas to the destination as I explained in
> http://groups.google.com/group/algogeeks/msg/6ff5e9ca52f4b5d6.
>
> Dave
>
>
>
>
> =============================================================================
> Topic: 3 in 1 remote control
> Url: http://groups.google.com/group/algogeeks/t/13d3967865afcfbf
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: Kunal Patil <kp101...@gmail.com>
> Date: May 21 09:09PM +0530
> Url: http://groups.google.com/group/algogeeks/msg/b3dade0bd95341f1
>
> Not strictly an algorithmic question, rather a test-of-design-skills type of
> question.
> You are asked to design a 3-in-1 remote control for TV, a DVD player, and a
> cable box.
> How will you go with
>
>
> =============================================================================
> Topic: convert a number from one base to another.
> Url: http://groups.google.com/group/algogeeks/t/e9ec80952d2ec42c
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: Dave <dave_and_da...@juno.com>
> Date: May 21 07:20AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/2c8765228db9db55
>
> @Saurabh: Implement a long division algorithm using the original base.
> Divide the number by the second base. Convert the remainder to a
> single digit in the new base. This is the low-order digit.
>
>
> =============================================================================
> Topic: Application of Data Structure In Moview]
> Url: http://groups.google.com/group/algogeeks/t/48431d6aa2066f18
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: bittu <shashank7andr...@gmail.com>
> Date: May 21 05:29AM -0700
> Url: http://groups.google.com/group/algogeeks/msg/b79e44cdf747f0ae
>
> Which data structure is the most efficient to store and access movie
> shots.
> Say, when a movie song is shot, it may include 5 scenes from
> Switzerland,8 from malaysia, 6 from india etc.
>
>
> =============================================================================
> Topic: Puzzle Digest Of The Week 16May - 20May
> Url: http://groups.google.com/group/algogeeks/t/d57af414e991214b
> =============================================================================
>
> ---------- 1 of 1 ----------
> From: Lavesh Rawat <lavesh.ra...@gmail.com>
> Date: May 21 05:48PM +0530
> Url: http://groups.google.com/group/algogeeks/msg/37eadb1ead14cc5b
>
> *Hi*
> *
> *
> *Puzzle Digest Of The Week 16May - 20May*
> *
> *
> *
> http://dailybrainteaser.blogspot.com/2011/05/logic-riddle-20-may.html?lavesh=lavesh
> *
> *
> *
> *
>
>
>
> --
> 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.
> For more options, visit this group at
> http://groups.google.com/group/algogeeks?hl=en.
>
>

-- 
Sent from my mobile device

-- 
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.
For more options, visit this group at 
http://groups.google.com/group/algogeeks?hl=en.

Reply via email to