GeekInterview.com
  I am new, Sign me up!
 

TCS Aptitude


TCS Aptitude

Questions: 147
Comments: 684
 Showing Questions 71-80 of 149 Questions
<< Previous 4 5 6 7 [8] 9 10 11 12 13 Next >>
 Sponsored Links

 
 TCS Aptitude
Sorting Options :  

A fisherman's day is rated as good if he catches 9 fishes ,fair if 7 fishes and bad if 5 fishes .He catches 53 fishes in a week n had all good,faiur n bad days in the week.So how many good ,fair n bad days did the fisher man had in the weekAns:4 good,1 fair n 2 bad daysplz explain the procedure
Read Answers (8) | Asked by : Mithila

Three companies are working independently and receiving the savings 20%, 30%, 40%. If the companies work combinely, what will be their net savings? If Anybody know the ans pls give the ans with explanation
Read Answers (5) | Asked by : lakshmi

If G(0) = -1 G(1)= 1 and G(N)=G(N-1) - G(N-2) then what is the value of G(6)?If anyone know the answer for this question pls tell me with explanation
Read Answers (10) | Asked by : Lakshmi

If A can copy 50 pages in 10 hours and A and B together can copy 70 pages in 10 hours, how much time does B takes to copy 26 pages?if anyone know the ans for this apps question pls tell me
Read Answers (5) | Asked by : Raji

Latest Answer: Mesmerize x Remember ...
Read Answers (1) | Asked by : ramya

What's the answer for that :A, B and C are 8 bit no's. They are as follows:A -> 1 1 0 0 0 1 0 1B -> 0 0 1 1 0 0 1 1C -> 0 0 1 1 1 0 1 0 ( - =minus, u=union)Find ((A - C) u B) =?
Read Answers (10) | Asked by : haja

One circular array is given(means memory allocation tales place in circular fashion) diamension(9X7) and sarting add. is 3000,What is the address od (2,3)........ What is the answer? Pls explain to me with steps
Read Answers (1) | Asked by : Hari

Please explain steps1)A, B and C are 8 bit no's. They are as follows:A -> 1 1 0 0 0 1 0 1B -> 0 0 1 1 0 0 1 1C -> 0 0 1 1 1 0 1 0 ( - =minus, u=union)Find ((A - C) u B) =?2)My flight takes of at 2pm from a place at 18N 40E and landed 10 Hrs later at a place with coordinates 36N40W.What is the local time when my plane landed?
Read Answers (3) | Asked by : senthilkumar

tel me the method to solve this....... plz 
Latest Answer: add all the respective digits........and if the sum is divisible by 3 then that no.is also divisble by three...or any case i.e.power...etc.......for e.eg in this case the correct ans is 6504===6+5+0+4==15====1+5==6 and 6 is divisible....hence that no ...
Read Answers (12) | Asked by : krithika

whats the method to find the answer...... plz any one tel me 
Latest Answer: 8-bit===>2^8=256.so the number must be below 256. so the answer is 251. ...
Read Answers (4) | Asked by : krithika

View page << Previous 4 5 6 7 [8] 9 10 11 12 13 Next >>

Ask A Question
Go Top
 Sponsored Links

 
Sponsored Links

 
Ask Question
You must login to Ask Question or Register your free account

Category:

 
Question Title:


Question in Detail:

Add this to my Subscribed Questions (?)
Send me email when new answer is posted (?)

 
Subscribe
Get Latest Updates Via RSS Reader or by Email
 Forum Discussion Subscribe to Forum Discussions Via E-Mail Latest Forum Discussions Subscribers
 Knowledge Base Subscribe to Knowledge Base Series Via E-Mail Knowledge Base Subscribers
 Learning Series Subscribe to GeekInterview Learning Series Via EMail Learning Series Subscribers
 Freelance Jobs Subscribe to GeekInterview Freelance Jobs Via EMail Latest Freelance Jobs Subscribers
 GeekInterview Blog Subscribe to GeekInterview Blog Via EMail GeekInterview Blog Subscribers
 Testing Interview Questions Subscribe to Testing Interview Questions Via EMail Testing Interview Questions Subscribers
 Oracle Interview Questions Subscribe to Oracle Interview Questions Via EMail Oracle Interview Questions Subscribers
 Java Interview Questions Subscribe to Java Interview Questions Via EMail Java Interview Questions Subscribers
 Latest Placement Papers Subscribe to Latest Placement Papers Placement Papers Subscribers
 Free Training Subscribe to Free Training Via EMail Free Training Subscribers
 Learn AJAX Subscribe to AJAXwith.com Via EMail AJAXwith Subscribers
About Us -  Privacy Policy -  Terms and Conditions -  Contact -  Ask Question -  Propose Category -  Site Updates 

Copyright © 2005 - 2009 GeekInterview.com. All Rights Reserved

Page copy protected against web site content infringement by Copyscape