programming's and data structure

1. what is the output of the following program?
   main()
   {
    extern int i;
    i=0;
    printf("%d",size of(i));
    }
   (a) 2         (b) 4
   (c) would vary from compilar to compilar
   (c) Error,i undefind
2. what is the output of the following program?
   main()
   {
    extern int a;
    i=0;
    printf("\n%d",a);
    }
     int a=20;
   (a) 0         (b) 20
   (c) Error     (c) Garbage value
3. what is the output of the following program?
   main()
   {
    int a[5]={2,3};
 
    printf("\n%d%d%d",a[2],a[3],a[4]);
    }
   (a) Garbge values         (b) 233
   (c) 322                   (c) 000
4. what is the output of the following program?
   main()
   {
    struct emp;
     {
       char name[20];
       int age;
       flot sal;
      };
      struct emp e={"Tiger"};
      printf("\n%d%f",e.age,e.sal);
    }
   (a) Error         (b) Garbge values
   (c) 0.000000      (c) 10.000000
5. in the following 'C' code, in which order the functions wpuld be called?
      a=f1(23,14)*f2(12/4)+f3();
    (a) f1,f2,f3    
    (a) f3,f2,f1
    (c) The order may varr from comfilar to compilar
    (d) None of these 

GATE SYLLBUS FOR- COMPUTER SCIENCE AND INFORMATION TECNOLOGY

GENERAL APTITUDE(GA)

     Veeval Ability:
English grammer
Sentence completion
verbal analgies
word group
instructions
critical reasoning and verbal deduction

  Numerical Ability:
Numerical computation
Numerical estimation
Numerical reasoning and data interpretation

ENGINEERING MATHEMATICS

  Mathematic Logic:
Propositional Logic
First Order Logic

  Probability:
conditional probability
Mean
Median
Mode and Standerd Deviation
Random Variables
Distributions
uniform
normal
exponential
Poisson
Binomial

  Set Theory & Algebra:
sets
Relation
Functions
Groups
Partial orders
Lattice
Boolean Algebra

  Cominatories:
Permutations
Combinations
Counting
Summations
generating functions
recurrence relations
asymptotic

  Graph Theory:
connectivity
spanning trees
cut vertices &adges
covering
matching
independent sets
Colorring
Planarity
Isomorphism

  Linear Algebra: 
Algebra of matrices
Determinants
system of linear equation
Eigen values and Eigen vectors

  Numerical methods:
LU decomposition for systems of linear equations
numerical solution of non-linear
algebraic equation by secant
Bisection and newton-Raphson Method
Numerical integration by trapezoidal and Simpsion Rules

  Calculus:
Limit
Continuty & differentiability
Mean value Theorems
theorms of integral calculua
Evaluation of definite & improper integrals
Partial derivatives
maxima & minima

TECHNICAL SECTION

  Digital Logic:
Logic Function
Minimization
Design and synthesis of combinational and sequetial circuit
Number representation and computer arithmetic(fixed and floatin point)

  Computer Organigation & Architecture:
Machine instructions and addressing mode
ALU and data-path
cou control design
Memory inteface
I/o interface(Interrupt and Dma mode)
Instruction pipelining
Cache and main memory
Secondray storage
  Programing and Data Structure:
Programming in C:
Function
Recurtion
Parameter Passing
Scope
Binding
Abstract Data types
Arrays
Stacks
Queues
Link List
Tree
Binary search Tree
Binar Heap

  Alorithms:
Analysis
Asymptoic notation
Notions of space and time complexity
Worst and average case analysis
Design:greedy approach
Dynamic programming
Divide-and-concqure
Tree and graph traversal
Connected components
Spanning Trees
Sortest path
Hashing
Sorting
Searching
Asmptotic analysis(best,wrost,average cases) space and time
upper and lower bounds
basic concepts oof complexity classes-P,NP,NP-hard,NP-complet

  Theory of Computation:
regular language and finite automata
Context free languages and Push-down autometa
Recursively enumerable sets and turing machine
Undecidability

  Compilar Design:
Lexical analysis
PArsing
Syntx directed translation
Runtime envirements
Tntermediate and targe code generation
Basics of code optimization

  Operating system:
process
Threads
Inter-process communication
Concurrency
Synchronization,
Deadlock
CPU scheduling
Memory management and vertual memory
File systems
I/o system
Protection And security

  Databases:
ER-model
Relational model(relationa algebra,tuple calculus)
Datbase Design(intrigrity constraints,normals forms)
querry language(SQL)
File Structure(sequential file,indexing,B and B+ Tree)
Transactions and cocurrency control

  Information System and Software Engineering:
Information gathering
requirement and feasibilit analysis
        data flow diagrams
process specifications
input/output design
process file cycle
planning and managing the project
Design
Coding
Testing
Implimentation
Manitenance

  Computer Networks:
ISO/OSI stack
LAN technogies(Ethernet , Token ring )
Flow and error control techniques
Routing algorithms
Congestion control
TCP/UDP and sockets
IP(v4)
Aplication layer protocal(icmp,dns,smtp,pop,ftp,http);
basic concepts hubs
Switches
gateways,and router
Network security-basic concepts of public key and private key cryptography
digital Signature
firewalls

  Web Technologies:
        HTML
XML
basicept of client-server computing.

GATE

The Graduate Aptitude Test in Engineering (GATE) is an all-India examination that primarily tests the comprehensive understanding of various undergraduate subjects in engineering and science. GATE is conducted jointly by the Indian Institute of Science and seven Indian Institutes of Technology (IIT Bombay, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Roorkee) on behalf of the National Coordination Board – GATE, Department of Higher Education, Ministry of Human Resources Development (MHRD), Government of India.

The GATE score of a candidate reflects the relative performance level of a candidate. The score is used for admissions to various post-graduate programs (e.g. Master of Engineering, Master of Technology, Doctor of Philosophy) in Indian higher education institutes, with financial assistance provided by MHRD and other government agencies. Recently, GATE scores are also being used by several Indian public sector undertakings (i.e., government-owned companies) for recruiting graduate engineers in entry-level positions. It is one of the most competitive examinations in India.