Ask & Answer: India's Largest Education Community

Hi,
As per the official website of GATE 2014, below is the syllabus for Computer Science and Information Technology (CS) : -
ENGINEERING MATHEMATICS
Mathematical Logic: Propositional Logic; First Order Logic.
Probability: Conditional Probability; Mean, Median, Mode and Standard Deviation; Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.
Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.
Combinatory: Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotics.
Graph Theory: Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Colouring; Planarity; Isomorphism.
Linear Algebra: Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.
Numerical Methods: LU decomposition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson's rules.
Calculus: Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.
COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Digital Logic: Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).
Computer Organization and Architecture: Machine instructions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instruction pipelining, Cache and main memory, Secondary storage.
Programming and Data Structures: Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.
Algorithms: Analysis, Asymptotic notation, Notions of space and time complexity, Worst and average case analysis; Design: Greedy approach, Dynamic programming, Divide-and-conquer; Tree and graph traversals, Connected components, Spanning trees, Shortest paths; Hashing, Sorting, Searching. Asymptotic analysis (best, worst, average cases) of time and space, upper and lower bounds, Basic concepts of complexity classes – P, NP, NP-hard, NP-complete.

Hi,
As per your query it seems that you are interested in being a air hostess so regarding this please remember being a air hostess is one of the good career option as it offers good career prospects and excellent growth opportunities not only in India but across the globe.
In order to be a air hostess, you may consider pursuing some of the below mentioned course:
- Diploma in Aviation, Hospitality and Travel Management.
- Diploma in Hospitality, Travel and Customer Service.
The duration of these course may be from 12 months to 18 months.
In order to pursue above mentioned course you need to be 12th pass and above, and need to have a good communication skills.
National and some international airlines recruit Air Hostess by calling for applications through leading newspapers.
Graduates in the age group of 19-25 years for training. Preference is given to Degree or Diploma holders in Hotel Management/Tourism.
Female candidates from Home science background, fulfilling other requirements, are also preferred. International Airlines recruit airhostesses in the age group of 18-35 years.
Good language, ability and proficiency in English, Hindi, a regional language and at least one foreign language are essential requirements for inflight crew members working for National or International carriers.
Physical requirements - Height for Air Hostesses - minimum of 157.5 cm and Flight Pursers 163 cm with proportionate weight.
Normal eyesight without glasses or a minimum uncorrected distant vision of 6/40 is acceptable.
For your reference find below some of the institutes offering the above mentioned course:
- Frankfinn Institute Of Air Hostess Training.
- Air Hostess Academy.
- Kompass Aviation.
Feel free to raise more questions. Appreciate by giving it thumbs up or marking as best.
All the Best.

Hi,
Thanks for the tag.
Below is the list of some of the GATE reference books for Computer Science :
* Discrete Mathematics – COLEMAN , C.L. Liu
* Numerical Methods – V. Rajaraman
* PROGRAMMING IN C : DENISE RITCHE, SCHAUM'S SERIES
C Language – Kerninghan, Ritchie
* DIGITAL LOGIC:
1. Digital Design – Morris Mano
2. Malvino, Leach
* COMPUTER ORGANIZATION AND ARCHITECTURE:
1. Computer Architecture and Organisation – J.P. Hayes
2. Computer organization and architecture: Hamacher, kye haung
* PROGRAMMING & DATA STRUCTURES AND ALGORITHMS:
1. Data structure : A. S. Tanenbaum, J.D. Ullman
2. Data structures and algorithms – Horowitz, Sahani
3. Algorithm analysis and design: T.h.cormen, Anne levitin
* THEORY OF COMPUTATION:
1. Theory of computation: Peter linz, J.d. ullman, Papadimitriau
2. K.L.P Mishra & N. Chandrasekharan – “Theory of Computer Science”, PHI
* COMPILER DESIGN:
1. Compilers: Principles, Techniques, and Tools (2nd Edition) – Alfred V. Aho, Monica S. Lam, Ravi Sethi, Jeffrey D. Ullman
* OPERATING SYSTEM:
1. Operating system: w. stallings, Galvin, a. s. Tanenbaum
2. Operating Systems – Silberschatz
3. The design of Unix operating system – Maurice J. Bach
* DATABASES:
1. Databases Management System – H.H. KORTH, NAVATHE
2. DBMS – C.J. Date
* COMPUTER NETWORKS:
1. A. S. TANENBAUM, W.STALLINGS
2. ForouzenINFORMATION SYSTEMS AND SOFTWARE ENGINEERING:
1. Software Engineering – Pressman
* GRAPH THEORY: NARSHIMA DEO
* Practice set in CS : MCQ in Computer Science – Timothy Williams
All the Best!