Golgappa.net | Golgappa.org | BagIndia.net | BodyIndia.Com | CabIndia.net | CarsBikes.net | CarsBikes.org | CashIndia.net | ConsumerIndia.net | CookingIndia.net | DataIndia.net | DealIndia.net | EmailIndia.net | FirstTablet.com | FirstTourist.com | ForsaleIndia.net | IndiaBody.Com | IndiaCab.net | IndiaCash.net | IndiaModel.net | KidForum.net | OfficeIndia.net | PaysIndia.com | RestaurantIndia.net | RestaurantsIndia.net | SaleForum.net | SellForum.net | SoldIndia.com | StarIndia.net | TomatoCab.com | TomatoCabs.com | TownIndia.com
Interested to Buy Any Domain ? << Click Here >> for more details...


i want to know aptitude questions,technical questions

Answers were Sorted based on User's Feedback



i want to know aptitude questions,technical questions..

Answer / gokul

yes i need to know aptitude questions,technical questions

Is This Answer Correct ?    5 Yes 0 No

i want to know aptitude questions,technical questions..

Answer / vignesh1988i

SEE.,..... 1 ST ROUND WILL BE THE APTITUDE ROUND.......
in this basic questions on maths,vocabulary, reasoning
questions will be asked...... it can be online or writtern
accordsing to the companies...............
in vocabulary section:
meanings .... antonyms and synomys will be given so refer
GRE BARRONS 12th edition..........
comprehension passasges.... word anology........ sentence
corrections .............
in quantitative section:(BASIC MATHS)
questions related to numbers sequences,time and
distances, work finish sums, graphs will be given from that
questions will be asked....., next is pipes and cartesims
sums,,,, age problems,.... mixtures and allegation
problems....... etc etc will be asked....... so PLEASE REFER
TO PREVIOUS YEARS QUESTIONS AND R.S.AGGARWAL..............
in reasoning section:
critical reasoning......... TCS followes this.......
pl. refer GRE BARRONS 12th edition......... a passage will
be given.. then 5 q. will be asked ..... but the given all
choices you would think it is correct.. but one only it wil
be .......... this will be always tough...... then logical
reasoning.................. here you have to draw an see as
venn diagrams etc........ refer GRE BARRONS.............


TECH.INTERVIEW


if you are an comp. student you must have ideas about
C.C++,OS,data structures,DBMS very important....... and
microprocessors.......... what you put as your AREA OF
INTEREST they will concentrate in that........ questions
also will be there from your projects.........


if you are an non IT student.... you ought to
know C/C++.... basic criteria.......... if you are strong
enough in C/c++ you can be sure to enter any IT
companies...................................................


ALL THE BEST

Is This Answer Correct ?    4 Yes 1 No

Post New Answer

More C Interview Questions

Write a progarm to find the length of string using switch case?

0 Answers   TCS,


c program to manipulate x=1!+2!+3!+...+n! using recursion

1 Answers   TCS,


input any 4 digit number and find the difference of all the digits?

3 Answers   Google,


‘ C’ PROGRAME TO SHOW THE TYPE OF TRANGLE BY ACCEPTING IT’S LENGTH .

0 Answers  


Write a program to print ASCII code for a given digit.

0 Answers   EXL, HCL,


Write a program that accepts a string where multiple spaces are given in between the words. Print the string ignoring the multiple spaces. Example: Input: “ We.....Are....Student “ Note: one .=1 Space Output: "We Are Student"

6 Answers   IBM,


What is the difference between text and binary modes?

0 Answers  


1. Write a C program to count the number of occurrence of a specific word in the given strings. (for e.g. Find how many times the word “live” comes in the sentence “Dream as if you’ll live forever, live as if you’ll die today ”)

12 Answers   Eskom, TCS,


What is the difference between a string and an array?

0 Answers  


What are advantages and disadvantages of recursive calling ?

12 Answers   College School Exams Tests, Evolving Systems, HP, Jyoti Ltd, Sage, Wipro,


Given an array A[n+m] of n+m numbers, where A[1] ... A[n] is sorted and A[n+1] ... A[n+m] is sorted. Design a linear time algorithm to obtain A[1...n+m] sorted using only O(1) extra space. Time Complexity of your algorithm should be O(n) and Space Complexity O(1).

0 Answers  


Can you subtract pointers from each other? Why would you?

0 Answers  


Categories