GATE 2017 Test Series

Graduate Aptitude Test in Engineering (GATE) is one of the toughest and most competitive entrance exam in India to seek admissions in masters courses at top Engineering Universities like IITs & NITs and jobs in various PSUs. In GATE 2016, over 1.5 lakh students appeared for the exam for Computer Science and IT (CS) stream. There were approximately 450 seat in IITs for M.Tech and other post-graduation courses in Computer Science and IT. Qualifying marks for CS was 25 (General), 22.5 (OBC) and 16.67 (SC/ST) in year 2015. We, at Examinia, are well aware of intense competition that GATE entails. We strive to provide the most comprehensive practice material with top quality content for GATE CS. Plan your preparation for GATE 2017 with Examinia.

ABOUT

The Graduate Aptitude Test in Engineering (GATE) is mandatory for pursuing M.Tech, MS in prestigious institutes viz. Indian Institute of Science (IISc Bangalore), Indian Institute of Technology (IIT Bombay, IIT Delhi, IIT Guwahati, IIT Kanpur, IIT Kharagpur, IIT Madras and IIT Roorkee),National Institute of Technology and other universities and is jointly administered by The Indian Institute of Science (IISC) and seven Indian Institute of Technology. GATE 2015 score is valid for THREE YEARS from the date of announcement of the results.

EXAM FORMAT(AS PER GATE 2015)

The examination for all the papers ( AE, AG, AR, BT, CE, CH, CS,CY, EC,EE,EY, GG, IN,MA, ME,MN, MT, PH, PI, TF, XE and XL) will be carried out in an ONLINE Computer Based Test (CBT) mode where the candidates will be shown the questions in a random sequence on a computer screen. In the papers bearing the codes AE, AG, BT, CE, CH, CS, EC, EE, IN, ME, MN, MT, PI, TF and XE, the Engineering Mathematics will carry around 13% of the total marks, the General Aptitude section will carry 15% of the total marks and the remaining percentage of the total marks is devoted to the subject of the paper. In the papers bearing the codes AR, CY, EY, GG, MA, PH and XL, the General Aptitude section will carry 15% of the total marks and the remaining 85% of the total marks is devoted to the subject of the paper. Official Source: GATE 2015

MARKING SCHEME

QUESTION TYPEDETAILMARKING SCHEME
Multiple Choice Questions (MCQ)These questions are objective in nature, and each will have a choice of four answers, out of which the candidate has to mark the correct answer(s).Carry 1 or 2 marks each. One third of mark(s) will be deducted for wrong answer.
Numerical Answer QuestionsFor these questions the answer is a real number, to be entered by the candidate using the virtual keypad. No choices will be shown for this type of questions.Carry 1 or 2 marks each. No negative marks will be awarded for a wrong answer.

NOTES

ENGINEERING MATHEMATICS

Discrete Mathematics:Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions Linear Algebra:Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition. Calculus:Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration. Probability:Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

COMPUTER SCIENCE AND INFORMATION TECHNOLOGY

Digital Logic:Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point). Computer Organization and Architecture:Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode). Programming and Data Structures:Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Algorithms:Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. Graph search, minimum spanning trees, shortest paths. Theory of Computation:Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability. Compiler Design:Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Operating System:Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems. Databases:ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control. Computer Networks:Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). Basics of Wi-Fi. Network security: authentication, basics of public key and private key cryptography, digital signatures and certificates, firewalls.