Scribd
Upload
8K views

Gate Syllabus For 2011

The document outlines the topics covered in the IT section of the GATE 2011 exam, including mathematical logic, probability, set theory, combinatorics, graph theory, linear algebra, numerical methods, calculus, formal languages, computer hardware, digital logic, computer organization, data structures and algorithms, programming methodology, operating systems, information systems, databases, data communication and networks, and web technologies.

Uploaded by

Gaurav
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
8K views

Gate Syllabus For 2011

The document outlines the topics covered in the IT section of the GATE 2011 exam, including mathematical logic, probability, set theory, combinatorics, graph theory, linear algebra, numerical methods, calculus, formal languages, computer hardware, digital logic, computer organization, data structures and algorithms, programming methodology, operating systems, information systems, databases, data communication and networks, and web technologies.

Uploaded by

Gaurav
Copyright
© Attribution Non-Commercial (BY-NC)
Available Formats
Download as DOC, PDF, TXT or read online on Scribd
You are on page 1/ 1

IT-INFORMATION TECHNOLOGY (GATE 2011)

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.
COMBINATORICS: 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.
REGULAR LANGUAGES: FINITE AUTOMATA, REGULAR EXPRESSIONS, REGULAR GRAMMAR.
CONTEXT FREE LANGUAGES: PUSH DOWN AUTOMATA, CONTEXT FREE GRAMMARS
COMPUTER HARDWARE
DIGITAL LOGIC: LOGIC FUNCTIONS, MINIMIZATION, DESIGN AND SYNTHESIS OF COMBINATORIAL AND SEQUENTIAL
CIRCUITS, NUMBER REPRESENTATION AND COMPUTER ARITHMETIC (FIXED AND FLOATING POINT)
COMPUTER ORGANIZATION: MACHINE INSTRUCTIONS AND ADDRESSING MODES, ALU AND DATA PATH, HARDWIRED
AND MICROPROGRAMMED CONTROL, MEMORY INTERFACE, I/O INTERFACE (INTERRUPT AND DMA MODE), SERIAL
COMMUNICATION INTERFACE, INSTRUCTION PIPELINING, CACHE, MAIN AND SECONDARY STORAGE
DATA STRUCTURES AND ALGORITHMS : THE NOTION OF ABSTRACT DATA TYPES, STACK, QUEUE, LIST, SET,
STRING, TREE, BINARY SEARCH TREE, HEAP, GRAPH, TREE AND GRAPH TRAVERSALS, CONNECTED COMPONENTS,
SPANNING TREES, SHORTEST PATHS, HASHING, SORTING, SEARCHING, DESIGN TECHNIQUES (GREEDY, DYNAMIC,
DIVIDE AND CONQUER, ALGORITHM DESIGN BY INDUCTION), 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.
PROGRAMMING METHODOLOGY: SCOPE, BINDING, PARAMETER PASSING, RECURSION, C PROGRAMMING – DATA
TYPES AND DECLARATIONS, ASSIGNMENT AND CONTROLFLOWSTATEMENTS, 1-D AND 2-D ARRAYS, FUNCTIONS,
POINTERS, CONCEPTS OF OBJECT-ORIENTED PROGRAMMING - CLASSES, OBJECTS, INHERITANCE, POLYMORPHISM,
OPERATOR OVERLOADING.
OPERATING SYSTEMS (IN THE CONTEXT OF UNIX) : CLASSICAL CONCEPTS (CONCURRENCY, SYNCHRONIZATION,
DEADLOCK), PROCESSES, THREADS AND INTERPROCESS COMMUNICATION, CPU SCHEDULING, MEMORY MANAGEMENT, FILE
SYSTEMS, I/O SYSTEMS, PROTECTION AND SECURITY, SHELL PROGRAMMING.
INFORMATION SYSTEMS AND SOFTWARE ENGINEERING: INFORMATION GATHERING, REQUIREMENT AND FEASIBILITY
ANALYSIS, DATA FLOW DIAGRAMS, PROCESS SPECIFICATIONS, INPUT/OUTPUT DESIGN, PROCESS LIFE CYCLE,
PLANNING AND MANAGING THE PROJECT, DESIGN, CODING, TESTING, IMPLEMENTATION, MAINTENANCE.
DATABASES: E-R DIAGRAMS, RELATIONAL MODEL, DATABASE DESIGN, INTEGRITY CONSTRAINTS, NORMAL FORMS,
QUERY LANGUAGES (SQL), FILE STRUCTURES (SEQUENTIAL, INDEXED), B-TREES, TRANSACTION AND CONCURRENCY
CONTROL.
DATA COMMUNICATION AND NETWORKS : ISO/OSI STACK, TRANSMISSION MEDIA, DATA ENCODING,
MULTIPLEXING, FLOW AND ERROR CONTROL, LAN TECHNOLOGIES (ETHERNET, TOKEN RING), NETWORK DEVICES –
SWITCHES, GATEWAYS, ROUTERS, ICMP, APPLICATION LAYER PROTOCOLS – SMTP, POP3, HTTP, DNS, FTP, TELNET,
NETWORK SECURITY – BASIC CONCEPTS OF PUBLIC KEY AND PRIVATE KEY CRYPTOGRAPHY, DIGITAL SIGNATURE,
FIREWALLS
WEB TECHNOLOGIES: PROXY, HTML, XML, BASIC CONCEPTS OF CGI-BIN PROGRAMMING.

You might also like