mmm... i dont remember the questions but these are the 1s i faintly
remember:
1. semaphore based qs
2. a question from theory of computation
3. some questions on the big O-notation.
4. b-tree vs b+-tree
5. some questions on unix
6. http,tcp based qs..
well sorry but these r da 1s i m able 2
did symantec come to your col...how many did they shortlist in first
rounds...can u say pattern of written test...
On Sep 28, 11:30 pm, rashmi i rash...@gmail.com wrote:
they have a package of around 5.8 in hand. they have a written test followed
by 2-3 interviews.The written test questions
@rashmi .thanks of lot for sharing.It would be of great
help if u detail much about written test pattern and share the
questions whatever u remember...thanks in advance..
On Sep 29, 6:40 am, sush57 sushaant...@gmail.com wrote:
didsymanteccome to your col...how many did they
@ Rashmi thanks a lot
On Thu, Sep 29, 2011 at 8:49 AM, siva viknesh sivavikne...@gmail.comwrote:
@rashmi .thanks of lot for sharing.It would be of great
help if u detail much about written test pattern and share the
questions whatever u remember...thanks in advance..
On Sep
I am supposing that file is count.txt and is already exists
so in initials of the main()
do this
*int count;
FILE* fp;
if((fp=fopen(count.txt,r))==NULL)
{
printf(File does not exist\n);
exit(0):
}
fscanf(fp,%d,count);
count++;
fclose(fp);
fp=fopen(count.txt,w);
fprintf(fp,%d,count);
@prasanth I know this solution...Try giving with constraints
specified ...
only following operations are available...
SHR reg1, op1
ADD reg1, op1
AND reg1, op1
NOT reg1.
On Sep 17, 6:46 pm, prasanth n nprasnt...@gmail.com wrote:
let a and b be the two numbers
int temp,result;
temp=a-b;
@Silva:
AND A,0 // sets register A to zero
NOT A // complements all bits of A
The result is that A is filled with 1-bits, giving MAXINT.
Dave
On Sep 17, 6:06 am, siva viknesh sivavikne...@gmail.com wrote:
Two registers A and B. Initial Contents of the registers
@Sivaviknesh: I already answered in another thread, but it is short,
so here goes again.
AND A,0 // sets register A to zero
NOT A// complements the bits of A
The result is that register A is filled with 1-bits, giving MAXINT.
Dave
On Sep 17, 8:33 am, sivaviknesh s
@dave .. I think we should find maximum of 2 no.s (present in 2
registers)plz provide solution for this...correct me if i m wrong
On Sep 17, 8:50 pm, Dave dave_and_da...@juno.com wrote:
@Silva:
AND A,0 // sets register A to zero
NOT A // complements all bits
hi anyone at least provide code using file handling.i found this
ques from other site
On Sep 17, 6:35 pm, sivaviknesh s sivavikne...@gmail.com wrote:
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
@Siva: The problem clearly states that we are to find MAXINT - The
maximum positive unsigned integer. It doesn't say that we are to find
the maximum of any particular integers. In particular, it says that
the initial contents of A and B are unknown, not that the initial
contents are two integers
thanks a lot dave for clarification :) but this is there any
possibility to find max of 2 no.s using those instructions
alone(assuming contents of registers are +ve ) ?
I found a solution finding difference of 2 no.s (SUB is required) and
checking for the whether a-b is +ve or -ve using '' and
@Siva: Note that in 2-s complement arithmetic, -b = ~b + 1.
So a - b = a + (-b) = a + (~b + 1) = (a + ~b) + 1.
Thus, a - b can be written as
NOT B
ADD A,B // reading this as add B to A, i.e., result is in A.
ADD A,1
Dave
On Sep 17, 11:15 am, siva viknesh sivavikne...@gmail.com wrote:
thats a nice solution dave :)
On Sep 17, 9:26 pm, Dave dave_and_da...@juno.com wrote:
@Siva: Note that in 2-s complement arithmetic, -b = ~b + 1.
So a - b = a + (-b) = a + (~b + 1) = (a + ~b) + 1.
Thus, a - b can be written as
NOT B
ADD A,B // reading this as add B to A, i.e., result
14 matches
Mail list logo
