Show Menu
Cheatography

CSE/IT Gate Syllabus Cheat Sheet by [deleted]

CS/IT

Gate CSE/It Syllabus

Engine­ering Mathem­atics

Mathem­atical Logic: Propos­itional Logic; First Order Logic.

Probab­ility: Condit­ional Probab­ility; Mean, Median, Mode and Standard Deviation; Random Variables; Distri­but­ions; uniform, normal, expone­ntial, Poisson, Binomial.

Set Theory & Algebra: Sets; Relations; Functions; Groups; Partial Orders; Lattice; Boolean Algebra.

Combin­atorics: Permut­ations; Combin­ations; Counting; Summation; generating functions; recurrence relations; asympt­otics.

Graph Theory: Connec­tivity; spanning trees; Cut vertices & edges; covering; matching; indepe­ndent sets; Colouring; Planarity; Isomor­phism.

Linear Algebra: Algebra of matrices, determ­inants, systems of linear equations, Eigen values and Eigen vectors.

Numerical Methods: LU decomp­osition for systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton­-Ra­phson Methods; Numerical integr­ation by trapez­oidal and Simpson's rules.

Calculus: Limit, Continuity & differ­ent­iab­ility, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial deriva­tives, Total deriva­tives, maxima & minima.

GENERAL APTITU­DE(GA):
Verbal Ability: English grammar, sentence comple­tion, verbal analogies, word groups, instru­ctions, critical reasoning and verbal deduction.

Computer Science and Inform­ation Technology Digital Logic : Logic functions, Minimi­zation, Design and synthesis of combin­ational and sequential circuits; Number repres­ent­ation and computer arithmetic (fixed and floating point).

Computer Organi­zation and Archit­ecture: Machine instru­ctions and addressing modes, ALU and data-path, CPU control design, Memory interface, I/O interface (Interrupt and DMA mode), Instru­ction pipeli­ning, Cache and main memory, Secondary storage.

Progra­mming and Data Structures: Progra­mming 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 comple­xity, Worst and average case analysis; Design: Greedy approach, Dynamic progra­mming, Divide­-an­d-c­onquer; Tree and graph traver­sals, Connected compon­ents, 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-com­plete.

Theory of Comput­ation: Regular languages and finite automata, Context free languages and Push-down automata, Recurs­ively enumerable sets and Turing machines, Undeci­dab­ility.

Compiler Design: Lexical analysis, Parsing, Syntax directed transl­ation, Runtime enviro­nments, Interm­ediate and target code genera­tion, Basics of code optimi­zation.

Operating System: Processes, Threads, Inter-­process commun­ica­tion, Concur­rency, Synchr­oni­zation, Deadlock, CPU schedu­ling, Memory management and virtual memory, File systems, I/O systems, Protection and security.

Databases: ER-model, Relational model (relat­ional algebra, tuple calculus), Database design (integrity constr­aints, normal forms), Query languages (SQL), File structures (seque­ntial files, indexing, B and B+ trees), Transa­ctions and concur­rency control.

Inform­ation Systems and Software Engine­ering: inform­ation gathering, requir­ement and feasib­ility analysis, data flow diagrams, process specif­ica­tions, input/­output design, process life cycle, planning and managing the project, design, coding, testing, implem­ent­ation, mainte­nance.

Computer Networks: ISO/OSI stack, LAN techno­logies (Ethernet, Token ring), Flow and error control techni­ques, Routing algori­thms, Congestion control, TCP/UDP and sockets, IP(v4), Applic­ation 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 crypto­graphy, digital signature, firewalls.

Web techno­logies: HTML, XML, basic concepts of client­-server computing.
 

Comments

No comments yet. Add yours below!

Add a Comment

Your Comment

Please enter your name.

    Please enter your email address

      Please enter your Comment.

          Related Cheat Sheets

          Gate Syllabus Cheat Sheet
          EE Gate Cheat Sheet

          More Cheat Sheets by [deleted]

          Gate Syllabus Cheat Sheet
          EE Gate Cheat Sheet