Print Page | Close Window

GATE 2008 Sylabus for I nformation Technology

Printed From: One Stop GATE
Category: GATE AT A GLANCE
Forum Name: Syllabus
Forum Discription: Keep track of everchanging GATE Syllabus. Inform the same to others too.
URL: http://forum.onestopgate.com/forum_posts.asp?TID=1551
Printed Date: 07Feb2025 at 8:14am


Topic: GATE 2008 Sylabus for I nformation Technology
Posted By: shreya
Subject: GATE 2008 Sylabus for I nformation Technology
Date Posted: 16Sep2007 at 11:25pm

Mathematical Logic

Propositional Logic, First Order Logic

Probability

Random Variables And Expectation, Conditional Probability, Independent Random Variables, Distributions - Uniform, Normal, Exponential, Binomial

Discrete Mathematics

Sets, Relations, Functions, Boolean Algebra, Induction, Recurrence Relations

Combinatorics

Permutations, Combinations, Counting Summations

Graph Theory

Elementary Concepts, Planarity, Matching

Algebra

Elementary Concepts Of Linear And Matrix Algebra

Numerical Methods

Classical Algorithms For Interpolation And Root Finding

Formal Languages and Automata 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

Software Systems

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), Asymptotic Analysis (Best, Worst, Average Cases) Of Time And Space, Upper And Lower Bounds, Intractability

Programming Methodology

C Programming, Program Control (Iteration, Recursion, Functions), Scope, Binding, Parameter Passing, Elementary Concepts Of Object Oriented Programming

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

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

Relational Model, Database Design, Integrity Constraints, Normal Forms, Query Languages (SQL), File Structures (Sequential, Indexed), B-trees, Transaction And Concurrency Control

Data Communication

Data Encoding And Transmission, Data Link Control, Multiplexing, Packet Switching, Lan Architecture, Lan Systems (Ethernet, Token Ring), Network Devices Switches, Gateways, Routers

Networks

ISO/OSI Stack, Sliding Window Protocols, Routing Protocols, TCP/UDP, Application Layer Protocols and Systems (HTTP, SMTP, DNS, FTP), Network Security

Web technologies

Three Tier Web Based Architecture; JSP, ASP, J2EE, .NET Systems; HTML, XML




Print Page | Close Window