Friday, July 24, 2015
Friday, July 10, 2015
Tuesday, July 7, 2015
gate exam syllabus for computer science 2016
CS & IT COMPUTER SCIENCE AND INFORMATION TECHNOLOGY
Click Here to See more Books and Materials and Syllabus
gate exam syllabus for computer science 2016
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.
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.
GENERAL APTITUDE :
Verbal Ability: English grammar, sentence completion, verbal analogies, word groups, instructions, critical reasoning and verbal deduction.
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.
Web technologies: HTML, XML, basic concepts of client-server computing.
Location:
India
Thursday, July 2, 2015
Do you know how many Candidates are qualified in 2015 gate exam
GATE (Graduate Aptitude Test in Engineering) is a national level examination test the Comprehensive understanding of various subjects in the undergraduate level.
For the acadamic year of 2015 gate exam has been conducted by IIT Kanpur. Total number of Candidates are registered for the academic year is 927580 Lakhs.
A total of 927580 Candidates are registered but only 804463 candidates have appeared for examination that means 123117 candidates are absent for examination
Out of total registered candidates 567111 are male and 237235 are female registered candidates are appeared for the gate examination
Total 22 papers are there in gate exam
Let's see top five papers candidates appeared for examination
- Electronics and Communication Engineering (172714),
- Mechanical Engineering (185758),
- Computer Science and Information Technology (115425),
- Electrical Engineering (125851) and
- Civil Engineering (101429)
Do you know how many Candidates are qualified in 2015 gate exam
In gate 2015 total qualified 121060 candidates have received gate score card that is (15.05%)
Category wise candidates qualified
General
Category candidates who have scored above the OBC category cut off marks but below the
General Category cut off marks. Those candidates, although not qualified in General
Category, have been issued score cards. They will be considered qualified in the OBC category.In case their category status changes to OBC at a later stage.
In terms of the category as declared by the candidates (General, OBC(NCL), SC, ST and PwD),
61450 General candidates,
39538 OBC(NCL),
15861 SC,
4211 ST and
947 PwD candidates will be receiving the scorecards.
The number of female candidates receiving the scorecards is 24545 (18.19% of the total).
Candidates who are qualified in the gate exam will be attend for the admission test in different IIT’s and GATE score is used for admissions to post-graduate programs (e.g, M.E., M.Tech., direct Ph.D.) in Indian institutes of higher education with financial assistance provided by MHRD and other Government agencies. The score is also used by many Public Sector Undertakings (PSUs) for employment screening purposes.
Students who are looking to take gate 2016 exam this static might help you
If you want to see iit Kanpur officals result Notifications ClickHere
Subscribe to:
Posts (Atom)

