Re: [algogeeks] Re: symantec
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 recollect. On Thu, Sep 29, 2011 at 10:36 AM, swetha rahul swetharahu...@gmail.comwrote: @ 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 29, 6:40 am, sush57 sushaant...@gmail.com wrote: didsymanteccome 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 belonged to previous years GATE questions. The interviews were easier and the questions ranged from OS, OOP concepts, Java, Databases. On Wed, Sep 28, 2011 at 12:09 AM, swetha rahul swetharahu...@gmail.comwrote: can anyone tell the recruitment procedure ofsymantec? what is the package? -- 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. -- R@$!-! DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS. -- 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. -- 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. -- R@$!-! DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS. -- 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.
[algogeeks] Re: symantec
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 belonged to previous years GATE questions. The interviews were easier and the questions ranged from OS, OOP concepts, Java, Databases. On Wed, Sep 28, 2011 at 12:09 AM, swetha rahul swetharahu...@gmail.comwrote: can anyone tell the recruitment procedure of symantec? what is the package? -- 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. -- R@$!-! DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS. -- 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.
[algogeeks] Re: symantec
@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 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 belonged to previous years GATE questions. The interviews were easier and the questions ranged from OS, OOP concepts, Java, Databases. On Wed, Sep 28, 2011 at 12:09 AM, swetha rahul swetharahu...@gmail.comwrote: can anyone tell the recruitment procedure ofsymantec? what is the package? -- 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. -- R@$!-! DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS. -- 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.
Re: [algogeeks] Re: symantec
@ 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 29, 6:40 am, sush57 sushaant...@gmail.com wrote: didsymanteccome 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 belonged to previous years GATE questions. The interviews were easier and the questions ranged from OS, OOP concepts, Java, Databases. On Wed, Sep 28, 2011 at 12:09 AM, swetha rahul swetharahu...@gmail.comwrote: can anyone tell the recruitment procedure ofsymantec? what is the package? -- 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. -- R@$!-! DoN'T LimIt Ur cHaLlEngeS, ChAlLenGe uR LImItS. -- 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. -- 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.
Re: [algogeeks] Re: Symantec System programming ques
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);
fclose(fp);
*
On Sat, Sep 17, 2011 at 9:36 PM, siva viknesh sivavikne...@gmail.comwrote:
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 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 from 1
answers 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 more options, visit this group at
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 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.
[algogeeks] Re: Symantec ques - Find maximum element without using comparison operators
@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; //if temp is -ve,then its MSB will be 1..else it ll be 0..so temp=temp (131); //now temp either holds 0(if temp is +ve) or a -ve no(if temp is -ve) result=a - temp(a-b); //now result contains the required value since a-(a-b)=b printf(%d,result); On Sat, Sep 17, 2011 at 7:03 PM, sivaviknesh s sivavikne...@gmail.comwrote: 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive -- 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 more options, visit this group at http://groups.google.com/group/algogeeks?hl=en. -- *prasanth* -- 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.
[algogeeks] Re: Symantec ques - Find max without comparing
@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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive -- 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.
[algogeeks] Re: Symantec ques - Find maximum element without using comparison operators
@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 sivavikne...@gmail.com wrote: 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive -- 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 more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Symantec ques - Find max without comparing
@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 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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive -- 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.
[algogeeks] Re: Symantec System programming ques
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 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 from 1 answers 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 more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
[algogeeks] Re: Symantec ques - Find max without comparing
@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 that we are to find the greater of. Dave On Sep 17, 11:01 am, siva viknesh sivavikne...@gmail.com wrote: @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 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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive- Hide quoted text - - Show quoted text - -- 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.
[algogeeks] Re: Symantec ques - Find max without comparing
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 SHR operatorIs there any possibility with these instructions? On Sep 17, 9:08 pm, Dave dave_and_da...@juno.com wrote: @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 that we are to find the greater of. Dave On Sep 17, 11:01 am, siva viknesh sivavikne...@gmail.com wrote: @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 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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive- Hide quoted text - - Show quoted text - -- 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.
[algogeeks] Re: Symantec ques - Find max without comparing
@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: 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 SHR operatorIs there any possibility with these instructions? On Sep 17, 9:08 pm, Dave dave_and_da...@juno.com wrote: @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 that we are to find the greater of. Dave On Sep 17, 11:01 am, siva viknesh sivavikne...@gmail.com wrote: @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 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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive- Hide quoted text - - Show quoted text -- Hide quoted text - - Show quoted text - -- 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.
[algogeeks] Re: Symantec ques - Find max without comparing
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 is in A. ADD A,1 Dave On Sep 17, 11:15 am, siva viknesh sivavikne...@gmail.com wrote: 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 SHR operatorIs there any possibility with these instructions? On Sep 17, 9:08 pm, Dave dave_and_da...@juno.com wrote: @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 that we are to find the greater of. Dave On Sep 17, 11:01 am, siva viknesh sivavikne...@gmail.com wrote: @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 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 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 logical shift, not arithmetic shift.) ..solution plz .. i tried but unable to arrive- Hide quoted text - - Show quoted text -- Hide quoted text - - Show quoted text - -- 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.
