-- Forwarded message --
From: Harikannan Shanmugam harikannan.mi...@gmail.com
Date: Tue, Feb 7, 2012 at 5:37 PM
Subject: Fwd: PRAYATNA '12 - A NATIONAL LEVEL TECHNICAL SYMPOSIUM
To: ananth...@gmail.com, arivu04@gmail.com, aru.valarpu...@gdit.com,
aru.valarpu...@gmail.com,
Hope it will be useful :)
--
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,
A parallel program consists of 8 tasks – T1 through T8. Each task requires
one time step to be executed on a single processor. Let X - Y denote the
fact that task X must be executed before task Y is executed. Suppose only
the tasks X, Y are to be executed. On any multiprocessor machine it would
Consider a virtual memory system in which the virtual page addresses are
mapped onto physical page addresses as follow
Virtual page address.. Physical page address
03
for(i=0;in;i++)
for(j=0;ji*i;j++)
for(k=0;kj;k++)
sum++;
Is itn^5 log n . n * (n^2 log n) * (n^2 log n) ???
correct me if i m wrong? also anybody can tell some easy approach to tackle
these ques ?? I worked out for some values of n and arrived at the ans.
Two registers A and B. Initial Contents of the registers are unknown.
Write a program to find MAXINT - The maximum positive unsigned integer
The instructions available are:
SHR reg1, op1
ADD reg1, op1
AND reg1, op1
NOT reg1.
Op1 may represent any number or register.
(Hint: The Shift operation is a
you have to write a program which tell about how many times it has run. ex:
if you run first time it will print 1.
if you run second time it will print 2.
like this.
this can easily done by File Handling but think other solution like IPC.
after booting your system, your program's output start
if possible code plz
--
Regards,
$iva
--
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
Write a method fill up an array of size n - and returns the array to the
caller - with the following conditions
1. the numbers shud be between 0 to n-1
2. no repeated numbers
3. the method should have a deterministic time to fill the arrays
4. arrays returned from the method should have
-- Forwarded message --
From: sivaviknesh s sivavikne...@gmail.com
Date: Fri, Sep 9, 2011 at 12:23 PM
Subject: Fwd: Interview question in Thoughtworks
To: Pritpal Singh pritpal2...@gmail.com
-- Forwarded message --
From: sasi kumar tmsasiku...@gmail.com
Date
-- Forwarded message --
From: Sesha krishnan sesha.naraya...@gmail.com
Date: Mon, Aug 22, 2011 at 6:04 PM
Subject: Re: ThoughtWorks Programming Questions
To: mitcse08i...@googlegroups.com
All,
We uploaded the thoughtworks interview questions from GCT yesterday @
-- Forwarded message --
From: sivaviknesh s sivavikne...@gmail.com
Date: Fri, Sep 9, 2011 at 12:28 PM
Subject:
To: Pritpal Singh pritpal2...@gmail.com
Interview Questions: Thoughtworks
As said by senior- S.Abhinaya
Round1:
Logic test- some simple numerical problems.This doesn't
-- Forwarded message --
From: LOKE$[-] sripathi.karth...@gmail.com
Date: Mon, Aug 22, 2011 at 4:13 PM
Subject: Fwd: ThoughtWorks Programming Questions
To: mitcse08info mitcse08i...@googlegroups.com
With regards
Lokesh Chandrakumar
-
Hi ,
Attached are the links to the
main()
{
char *p=persons;
clrscr();
if(p==persons)
printf(technical %s,p);
else
printf(true %s,p);
return 0;
}
..op : technical persons ..plz explain .. how come it works like an strcmp
operation???
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
printf(%d,3.14*6.25*6.25);
...ans : 0 ..how and why?? why not type conversion take place??
--
Regards,
$iva
--
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
you have 4 classes A,B,C,D and class Z is derived from all these classes
using
Class Z: public A,private B,Protected C, Virtual D
What is the order of constructor call?
...plz reason out also
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
int main()
{
fork();
fork();
fork();
printf(Hello world!);
}
...this will print hello world 8 times...i.e . 2^n times
but...
int main()
{
fork();
fork();
fork();
fork()
printf(Hello world!);
}
http://ideone.com/TRKTE
..but this prints only 11 times
-- and for five forks 25 times...plz
http://faq.programmerworld.net/networking/unix-interview-questions-answers.html
refer 16 th ques in this site .. they ve told 2^n times..so only i asked
whether its compiler dependent ??
On Sun, Aug 14, 2011 at 11:12 PM, sivaviknesh s sivavikne...@gmail.comwrote:
int main()
{
fork();
fork
#includeiostream
#includestdio.h
using namespace std;
class Base
{
public:
Base()
{
fun(); //note: fun() is virtual
}
virtual void fun()
{
cout\nBase Function;
}
};
class Derived: public Base
{
public:
Derived(){}
virtual void fun()
{
cout\nDerived Function;
}
};
1. Given words in a newspaper as input find the words that have occured oly
once
2. Find the 5 most repeating words in a given document
...Is there any other optimal solutions other than using map ??
--
Regards,
$iva
--
You received this message because you are subscribed to the Google
*Given an nxn screen, Each pixel is represented by intensity values. Given
a specific pixel as an input, find the no. of pixels of the same colour
which can reached from this pixel. Assume any suitable data structure for a
screen.
..can this be implemented through BFS ...similar to BITMAP prob
the question is clear..you draw the sample test case and work out ..
you will understand
1
/ / \
4 2 3
/\
5 6
here from node 2 the maximum cost to reach any node 'i' is 2 and
minimum is 1
...so M(2) = max(1,2)=2..the same is the case
we can do like creating an adjacency matrix..populate all values i.e.
cost to reach each node...finally find the nodes that has min value...any
other gud solutions??
On Wed, Jul 27, 2011 at 2:16 AM, sivaviknesh s sivavikne...@gmail.comwrote:
the question is clear..you draw the sample test
-- Forwarded message --
From: Padmaja Sridharan padmaja...@yahoo.in
Date: Wed, Jul 27, 2011 at 5:15 AM
Subject: SORTING ARRAYS
To: mitcse08i...@googlegroups.com
Given two arrays
a[] = {1,3,2,4}
b[] = {4,2,3,1}
both will have the same numbers but in different combination.
We have
what is the time complexity of a hash map??for insertion and searching
are hash table and hash map same ??
can anybody give a good explanation with example or even suggest good
links.thanks in advance :)
--
Regards,
$iva
--
You received this message because you are subscribed
Implement a C++ garbage collector efficiently..any ideas ???
..shud we need to do something with destructor???
--
Regards,
$iva
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to
-- Forwarded message --
From: subramania jeeva subramaniaje...@gmail.com
Date: Thu, Sep 23, 2010 at 7:53 AM
Subject: Re: MICROSOFT INTERNSHIP (Coding round)
To: mitcse08i...@googlegroups.com
Also in placement the question asked was
Given a 2 dimensional matrix
-- Forwarded message --
From: sivaviknesh s sivavikne...@gmail.com
Date: Mon, Jul 18, 2011 at 11:29 PM
Subject: Fwd: MICROSOFT INTERNSHIP (Coding round)
To: algogeeks@googlegroups.com
-- Forwarded message --
From: subramania jeeva subramaniaje...@gmail.com
Date
convert a number in base 5 to base 9
--
Regards,
$iva
--
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
29 matches
Mail list logo
