GATE syllabus 2015





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.
Theory of Computation:
Regular languages and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.
Compiler Design:
Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target code generation, Basics of code optimization.
Operating System:
Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and virtual memory, File systems, I/O systems, Protection and security.
Databases:
ER-model, Relational model (relational algebra, tuple calculus), Database design (integrity constraints, normal forms), Query languages (SQL), File structures (sequential files, indexing, B and B+ trees), Transactions and concurrency control.
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.
Computer Networks:
ISO/OSI stack, LAN technologies (Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP/UDP and sockets, IP(v4), Application layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches, gateways, and routers. Network security  basic concepts of public key and private key cryptography, digital signature, firewalls.
Software Engg. / Web technologies:
HTML, XML, basic concepts of client-server computing.

Reasoning & Aptitude:
English grammar,sentence completion,word groups,numerical estimation,data intepretation,critical reasoning.

Note:15 marks questions are asked from this section in 2010,2011 and 2012,2013 & 2014( 5 one mark question and 5 two marks question) .

Click to give free online GATE mock test
Previous
Next Post »

1 comments:

Write comments
Anonymous
AUTHOR
6 August 2012 at 03:20 delete

#include
void main()
{
int a,b;
printf("enter two no\n");
scanf("%d%d",&a,&b);
printf("before swapping\n");
printf("a=%d and b=%d",a,b);
a=a-b;
b=a+b;
a=b-a;
printf("\nafter swapping\n");
printf("a=%d and b=%d",a,b);
return(0);
}
-------------------------------------------
#include

main()
{
int n, c;

printf("Enter a number\n");
scanf("%d", &n);

if ( n == 2 )
printf("Prime number.\n");
else
{
for ( c = 2 ; c <= n - 1 ; c++ )
{
if ( n % c == 0 )
break;
}
if ( c != n )
printf("Not prime.\n");
else
printf("Prime number.\n");
}
return 0;
}
------------------------------------------------
#include
void main()
{
int n,t,count=1;

printf("Enter any number\n\n");
scanf("%d",&n);
while(count<=10)
{
t=n*count;
printf("\n%d * %d = %d",n,count,t);
count++;
}
return(0);
}
-----------------------------------------
#include
main ()
{
int number, last_digit, next_digit, total;
printf ("Enter the 5-digit number whose sum of digits is to be calculated: ");
scanf ("%d", &number);
last_digit = number%10;
total = last_digit;
next_digit = (number/10) % 10;
total = total + next_digit;
next_digit = (number/100) % 10;
total = total + next_digit;
next_digit = (number/1000) %10;
total = total + next_digit;
next_digit = (number/10000) %10;
total = total + next_digit;
printf ("The sum of the digits of the entered number is: %d\n", total);
if(total % 2 == 0)
printf("\n%d is even number",total);
else
printf("\n%d is odd no",total);
}

Reply
avatar