Thanks Varun.
Does it include everything(tution+hostel)?
On Tue, Jun 25, 2013 at 4:50 PM, Varun Nagpal wrote:
> Prepare to spend atleast 20 Lakhs
>
>
> On Tue, Jun 25, 2013 at 4:49 PM, Jagannath Prasad Das > wrote:
>
>> Folks,
>>I suppose this is not the
is easy to get a RA in the university you study and that helps
in someway.
Regards,
Jagannath
--
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
Is this not similar to knapsack problem?
On Fri, Jun 21, 2013 at 11:24 AM, Ravi Ranjan wrote:
> There is a Blank Paper Sheet, Given a list of characters and their sizes,
> for ex. A, P, O, N, Q with different font sizes and designs.
> Now we need to cut characters from given sheet of paper of al
I guess they are garbage values.
On Fri, May 31, 2013 at 3:41 PM, shubham saini wrote:
> #include
> using namespace std;
>
> class Test
> {
> private:
> int x;
> int y;
> public:
> Test(int x = 0, int y = 0) { this->x = x; this->y = y; }
> void setX(int a) { x = a; }
> void setY(int b)
mp;mutex);
.
//We can take a lock on this also.
flag++;
pthread_exit(0);
}
//Rest of the code for
On Mon, Nov 26, 2012 at 10:08 AM, Sachin Maheshwari <
sachin.maheshw...@gmail.com> wrote:
> Hi Jagannath,
> pthread_join function call will suspend the execution of the current
&
eoretical Computer Science.
> PSG College of Technology
>
>
>
> On 25 November 2012 22:37, jagannath wrote:
>
>> Folks, I have one pthread question.I know that its not the right place
>> but i thought this is the right place to post this. Code snippet:
>> #incl
Folks, I have one pthread question.I know that its not the right place but
i thought this is the right place to post this. Code snippet:
#include
#include
#include /* defines _POSIX_THREADS if pthreads are available */
#ifdef _POSIX_THREADS
# include
#endif
#include
void *text(voi
@shashank and @samm: Is the deletion and searching is o(1). I doubt
On Sat, Oct 1, 2011 at 6:30 PM, SAMM wrote:
> Yaa it will work , but in case of deletion don't u think array will
> not as efficient as linked list becoz array is Static we need to
> define the memory b4 hand..
>
> On 10/1/11,
What this means compiler looks for closest possible match ,then other
alternatives.In this func(char*) is executed if that is not there then
func(const char*) is executed.
Comment the func(char*) and check.There is no overloading in c as far i
know.
On Tue, Nov 22, 2011 at 10:11 PM, Jagannath
Run this one:
#include
void fun(const char *p)
{
printf("const\n");
}
void fun(char *P)
{
printf("simple\n");
}
int main(void)
{
char str[] = "funcheck";
//const char str1[] =
"constcheck";
fun(str);
fun(str);
}
On Tue, Nov 22, 2011 at 7:13 PM, MJ wrote:
> Hi
> This type of functi
I think any traversal has o(n) complexity as we traverse all the
nodes.There is no skipping of nodes.Very simple logic:)
On Sun, Nov 20, 2011 at 9:57 AM, tech coder wrote:
> @ sravanreddy001
> complexity is O(N^2) whether tree is balanced or not doesn't matter
> For each level it's visiting elem
How many students they took and whats the offer?
On Thu, Nov 10, 2011 at 8:03 AM, rahul sharma wrote:
> facebook visit DCE???wats package???
>
>
> On Wed, Nov 9, 2011 at 9:22 PM, Decipher wrote:
>
>> This question was asked by Facebook during their 2 hour online exam (Only
>> 1 question in 2 hou
I think its same as the Virtual memory
On Mon, Nov 7, 2011 at 4:22 PM, Gene wrote:
> I think you just said the same thing I did.
>
> I disagree. As I said, you get an approximation with wrappers. You
> can track the amount of memory actually in use by the client program.
> For malloc/frees that
seems to be a independent problemu can see maximum subarray problem
On Tue, Nov 1, 2011 at 11:54 PM, atul007 wrote:
> Assume that there are n numbers (some possibly negative) on a circle,
> and
> we wish to find the maximum contiguous sum along an arc of the circle.
> Give an
> efficien
@Amol:the answer u have given is for binary ..and thats catalan
number...recursive solution
On Sun, Sep 18, 2011 at 1:33 PM, Anup Ghatage wrote:
> (2n)! / ((n+1)! + (n)!)
> Where n is the number of nodes.
> The above mentioned formula is for the n'th Catalan number.
>
> @all correct
what do u folks think please reply
On Mon, Aug 22, 2011 at 11:43 PM, Jagannath Prasad Das
wrote:
> In formal arguments compiler comes to know about the type of its
> arguments.
> In the actual parameter compiler also knows what is the type of parameter
> passed.
> Actually the
the function is called ,first of all the the expression representing
actual parameter is evaluated and a copy of it made/copy constructor is
called incase of object passing.
So i feel "both" is the answer
cheers
jagannath
On Mon, Aug 22, 2011 at 10:28 PM, sukran dhawan wrote:
> i
for the stick prob is the stick length required?
On Mon, Aug 22, 2011 at 12:48 PM, Jagannath Prasad Das
wrote:
> i think find max and min of all time-stamps respectively
>
>
> On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal wrote:
>
>> How did u solved :
>>
>>
i think find max and min of all time-stamps respectively
On Mon, Aug 22, 2011 at 12:44 PM, saurabh agrawal wrote:
> How did u solved :
>
> 3) There is a list containing the checkin and checkout time of every person
> in a party . The checkin time is in ascending order while the checkout is
> rand
, 2011 at 9:46 PM, Abhishek Yadav
wrote:
> @jagannath: no its not i am totally confused.
>
>
> On Sun, Aug 21, 2011 at 5:57 PM, priya ramesh <
> love.for.programm...@gmail.com> wrote:
>
>> it is not an error.
>>
>> check this code: I compiled it
>>
>
Since long time i am not able to implement a min-stack where in const space
and const time ...
Folks please help meif it is solved then answer is the last
option
On Sun, Aug 21, 2011 at 9:15 PM, Dumanshu wrote:
> first option is correct. Because we are not allowed to use any extr
A(OED)=1/4 A(OCB) from similarity area relationship
A(OED)+A(ODC)=6;
A(ODC)+A(OCB)=12;
solve them
A(OED)=2 sq units
On Sun, Aug 21, 2011 at 12:06 PM, Greeshma wrote:
> hey got it!
> the ans s 2 :)
>
> --
> You received this message because you are subscribed to the Google Groups
> "Algorithm Ge
Copy constructor should have been called two times!!1
On Sun, Aug 21, 2011 at 1:38 PM, Abhishek Yadav
wrote:
> what are you trying to say?...can you please explain?h
>
>
> On Sun, Aug 21, 2011 at 1:35 PM, JAIDEV YADAV wrote:
>
>> try to use X b = a ; b.fun() ;
>>
>> On Sun, Aug 21, 2011 at 1
what does sorted row means???
is it
00011
0
1
0
where each row is sorted or among the rows also?
On Sun, Aug 21, 2011 at 9:51 AM, Sanjay Rajpal wrote:
> hey see this array is not sorted, I forgot to mention this in my first
> post, but cleared this in subsequent posts that the
@naren:a[i] may exceed array limit.sigsegv error amy result
On Sat, Aug 20, 2011 at 9:08 PM, Naren s wrote:
>
>
> On Sat, Aug 20, 2011 at 9:07 PM, Naren s wrote:
>
>> for(i=0 to n)
>> {
>> if(a[abs(a[i])-1]>0)
>> a[abs(a[i])-1] = -a[abs(a[i])-1];
>> else
>> printf("%d",abs(a[i]));
>>
>> }
od enough to find R ...
Please correct me if i am wrong
cheers
JAGANNATH
On Sat, Aug 20, 2011 at 5:12 PM, aditya kumar
wrote:
> instead of that find sum of first n natural number sum ie (n(n+1))/2.;say
> NSum
> then find the sum of all elements of the array . say ASum
> ASUm - NS
depends on endianess of processor
On Mon, Jul 25, 2011 at 12:22 PM, aditya kumar wrote:
> thnks all :)
> @rajeev : u are right dats y *((char*)iPtr+2) will printf 0.
>
>
> On Mon, Jul 25, 2011 at 11:56 AM, ~*~VICKY~*~ wrote:
>
>> Consider the binary representation of 257 which is 10001
>>
>
@anshu:thats means you say that pthreads are either kernel -level or
hybrid in nature
@lalit:mapping dependsfor user-level kernel isn't aware of
threads,m-m is for kernel-level ,m-n for hybrid
kinda
does anbody knows whether pthreads are user-level or hybrid?
hi guys,
i know that pthread is an user-level thread and an user-level
can't take the advantage of SMP. Then what is the point of creating
user-level threads if they can't be scheduled on multiple cores?Please
clear my doubt which has been hitting me for long...
--
You received this me
how to register for amazon ol exm .can you plz mention ?
On Sun, Apr 24, 2011 at 6:46 PM, balaji a wrote:
> yeah i did.,...there were two section
> Section 1 - some aptitude question + predicting output of a given program +
> some conceptual question(mainly in OS)
> Section 2- programming secti
Pthread is a user-level thread or kernel-level?.Java
supports user-level threading i know ,but while doing a project on
web-
crawling i marked the cpu-utilization in conky(ubuntu) ,both the
cores' utilization increased drastically as program ran.I know that in
user-level threading kernel is not awa
ascii values da...not 9
On Wed, Mar 23, 2011 at 8:39 PM, saurabh singh wrote:
> @cegprakash Relax shut down your computer for some time and switch on your
> i-pod.:)
>
> On Wed, Mar 23, 2011 at 8:39 PM, saurabh singh wrote:
>
>> @cegprakash Relax shut down your computer for some time and
@ankit sinha:i dont think the algo u wrote is o(logn).its o(N) i guess
On Thu, Mar 3, 2011 at 7:05 PM, Ankit Sinha wrote:
> @sukhmeet, as per the question, there is a unique value which satisfy
> a[i] = i in the array and written code captures that only. Else we
> need to modify if we are in
@rajesgeeks:i think probability of sucess of 2nd game is 2(x^2(1-x))+x^2
becoz as explained below:
1.HH...so success in 2 shots no need of 3rd one
2.HFH
3.FHH
where H-hit the hoop.
F-failed to hit the hoop.
On Wed, Mar 2, 2011 at 7:20 PM, rajessge...@yahoo.com wrote:
> let p be the
d find fuel in failure"
> +919985813081
> +919966006652
>
>
> On Wed, Feb 9, 2011 at 1:18 PM, jagannath wrote:
>
>> i want to implement extendible hashing for may major project.so the
>> crux of the problem is to directly access the disk block without using
>>
void change()
{
#define i i=10,n
}
this will do..
On Tue, Feb 15, 2011 at 11:33 PM, Rel Guzman Apaza wrote:
> Nothing... 10 in base 5 = 5 in base 10.
>
> void change(){
> printf(""); //...?
> }
>
> 2011/2/15 Don
>
> A semicolon is valid in the middle of a line in C or C++.
>>
>> For i
here start is pointing to string constant which is created in read-only
memory which can't be changed.so modifying it in the for loop causes
segmentation fault
declare it as a array type
On Tue, Feb 15, 2011 at 12:36 PM, rahul wrote:
> char *start is const char *start, pointer to const char, u c
1.Let the time taken to switch between user and kernel modes of execution be
t1
while the time taken to switch between two processes be t2. Which of the
following is TRUE?
(A) t1 > t2
(B) t1 = t2
(C) t1 < t2
(D) Nothing can be said about the relation between t1 and t2
2.Let P be a regular language
i wanted the source code not this..anyway thanks..
On Sat, Feb 12, 2011 at 1:46 AM, Gene wrote:
> This is a very lame question. Type "Berkeley DB" into Google. The 3rd
> listing is Berkeley DB downloads at Oracle:
>
> http://www.oracle.com/technetwork/database/berkeleydb/downloads/index.
how to access berkley DB any source
On Fri, Feb 11, 2011 at 4:01 PM, jagannath prasad das
wrote:
> can u plz give the link or any source codes if possible.thanx in
> advance
>
>
> On Fri, Feb 11, 2011 at 6:35 AM, Gene wrote:
>
>> If I remember correctly Berkel
can u plz give the link or any source codes if possible.thanx in
advance
On Fri, Feb 11, 2011 at 6:35 AM, Gene wrote:
> If I remember correctly Berkeley DB uses an extensible hashing system or
> did at one time. This is not part of the OS API, but rather a library that
> runs in user sp
guys someone help me out..its urgent
On Wed, Feb 9, 2011 at 1:18 PM, jagannath wrote:
> i want to implement extendible hashing for may major project.so the
> crux of the problem is to directly access the disk block without using
> the undelying os file system interface.one idea wh
i want to implement extendible hashing for may major project.so the
crux of the problem is to directly access the disk block without using
the undelying os file system interface.one idea which comes to my mind
is to build a virtual file system interface for my project but
currently i want to avoid
u r printing frm left to right??
>
> as in, u said-
>
> "Now it try to display the value from left to right which makes a++ as 13,
> then a has 14 and ++a as 14"
>
> so it has to beacc. to ua++ as 13, thn a as 14 and thn ++a shd b 15
> thn.
>
> On Mo
u can merge first two rows and proceed two at time.then slowly merge 4 at a
tym and so on.a recursive algo will do
On Mon, Feb 7, 2011 at 6:25 PM, Ashish Goel wrote:
> yet to test...
> will download xcode to compile, not on linux or windows (:
>
> remote case of all both entries in last
bit operation means what?
On Mon, Feb 7, 2011 at 12:00 PM, Rajiv Podar wrote:
> @Dave: ++ and -- are arithmetic operations.
> @Jalaj: I agree with the above solution
>
>
> Thanks & Regards,
> Rajiv Podar
>
>
>
> On Mon, Feb 7, 2011 at 11:47 AM, jalaj jaiswal
> wrote:
>
>> try this
>>
>> let
@rajiv:i guess obj is a pointer here
On Mon, Feb 7, 2011 at 10:51 AM, Rajiv Podar wrote:
> Hi
> Try following code
>
> Suppose we need to find size of variable *"obj"*
> int size = (char*)(obj +1 ) - (char*)(obj);
>
> *
> *Thanks & Regards,
> Ricky
>
>
>
> On Mon, Feb 7, 2011 at 12:19 A
6, 2011 at 9:04 PM, jagannath prasad das
> wrote:
>
>> @anand:while printing post fix gave 13 but rest two why 14
>>
>> On Mon, Feb 7, 2011 at 10:28 AM, Anand wrote:
>>
>>> int a=10,b;
>>> b=a++ + ++a; (Till here I think it is clear the value
++a
> makes the value of a as 13, then a and then a++ which is post increment
> still makes a as 13)
> Now it try to display the value from left to right which makes a++ as 13,
> then a has 14 and ++a as 14
>
> I hope it is clear.
>
>
> On Sun, Feb 6, 2011 at 8:40 PM, j
t;> i think juver has explained
>> On Feb 5, 9:34 pm, jagannath prasad das wrote:
>> > @manish:can you explain with the example of a specific compiler...
>> >
>> > On Sat, Feb 5, 2011 at 10:02 PM, jagannath prasad das
>> > wrote:
>> >
>> >
&
@manish:can you explain with the example of a specific compiler...
On Sat, Feb 5, 2011 at 10:02 PM, jagannath prasad das
wrote:
> @ankit:ans is 22 13 14 14 in gcc compiler.
>
>
> On Sat, Feb 5, 2011 at 7:24 PM, Manish Verma wrote:
>
>> answer will de
@ankit:ans is 22 13 14 14 in gcc compiler.
On Sat, Feb 5, 2011 at 7:24 PM, Manish Verma wrote:
> answer will depend on your compiler.
>
> On Feb 5, 1:02 am, jagannath prasad das wrote:
> > *#include
> > void main(void)
> > {
> > int a=10,b;
>
*#include
void main(void)
{
int a=10,b;
b=a++ + ++a;
printf("%d,%d,%d,%d",b,a++,a,++a);
}
*what is the answer?how are the function parameters passed on the stack?
--
You received this message because you are subscribed to the Google Groups
"Algorithm Geeks" group.
To post to this group, send em
i guess you dont require first hash at all.create a hash map
that maps a letter to a set of keys now once you have all your sets you can
just compare the input set with your the formed sets...
On Tue, Nov 16, 2010 at 8:51 AM, Gene wrote:
> Your description is imprecise. I guess
linked representation...for k-ary trees use sibling and
lchild pntr...arrays can lead to memory wastage .Moreover arrays
have to be statically allocated
On Mon, Nov 15, 2010 at 2:32 AM, Ruturaj wrote:
> Since its a data structure, we need to root the tree. Plus my
> sugge
4 8 3 7
2 6 1 5
On Thu, Nov 11, 2010 at 5:57 PM, sunny agrawal wrote:
> @rohit
> 4 5 are diagonally adjacent .
>
> On Thu, Nov 11, 2010 at 5:09 PM, Rohit Singhal
> wrote:
>
>> 1 5 2 6
>>
>> - - - - - -
>>
>> 3 7 4 8
>>
>>
>> On Thu, Nov 11, 2010 at 3:16 PM, Abhilasha jain > > wrote:
>>
>>>
answer is 17i got in gcc comp
On Sun, Nov 7, 2010 at 7:23 PM, Piyush wrote:
> C standard says that between two sequence points object's stored value can
> be modified only once ( by evaluation of expression),
> A sequence point occurs in following conditions:
> 1. at the end of full
Design a data structure that allows one to search, insert, and delete
an integer X in O (1) time in a table (i.e. constant time, independent
of the total number of integers stored). Assume that 1≤X≤N. Also
assume that the maximum number of integers in the table can only be M
at any one time. You
58 matches
Mail list logo
