GATE 2013\u00a0Syllabus\u00a0for Computer\u00a0Science & Information Technology<\/p>\n
download\u00a0GATE 2013\u00a0Syllabus\u00a0for Computer\u00a0Science & Information Technology<\/p>\n
ENGINEERING MATHEMATICS Mathematical Logic:<\/strong>\u00a0Propositional Logic;\u00a0First Order Logic.<\/p>\n Probability:<\/strong>\u00a0Conditional Probability; Mean, Median, Mode and Standard Deviation;\u00a0Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial.<\/p>\n Set Theory\u00a0& Algebra:<\/strong>\u00a0Sets; Relations; Functions; Groups; Partial Orders; Lattice;\u00a0Boolean Algebra.<\/p>\n Combinatorics:<\/strong>\u00a0Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic.<\/p>\n Graph Theory:<\/strong>\u00a0Connectivity; spanning trees; Cut vertices & edges; covering; matching; independent sets; Coloring; Planarity; Isomorphism.<\/p>\n Linear Algebra:<\/strong>\u00a0Algebra of matrices, determinants, systems of linear equations, Eigen values and Eigen vectors.<\/p>\n Numerical Methods:<\/strong>\u00a0LU decomposition for\u00a0systems of linear equations; numerical solutions of non-linear algebraic equations by Secant, Bisection and Newton-Raphson Methods; Numerical integration by trapezoidal and Simpson\u2019s rules.<\/p>\n Calculus:<\/strong>\u00a0Limit, Continuity & differentiability, Mean value Theorems, Theorems of integral calculus, evaluation of definite & improper integrals, Partial derivatives, Total derivatives, maxima & minima.<\/p>\n \n COMPUTER SCIENCE AND INFORMATION TECHNOLOGY Digital Logic:<\/strong>\u00a0Logic functions, Minimization, Design and synthesis of combinational and sequential circuits; Number representation and computer arithmetic (fixed and floating point).<\/p>\n Computer Organization and Architecture:<\/strong>\u00a0Machine\u00a0instructions\u00a0and addressing modes, ALU and data-path, CPU control design, Memory interface, I\/O interface (Interrupt and DMA mode),\u00a0Instruction\u00a0pipelining, Cache and main memory, Secondary storage.<\/p>\n Programming and Data Structures:<\/strong>\u00a0Programming in C; Functions, Recursion, Parameter passing, Scope, Binding; Abstract data types, Arrays, Stacks, Queues, Linked Lists, Trees, Binary search trees, Binary heaps.<\/p>\n Algorithms:<\/strong>\u00a0Analysis, 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,\u00a0Connected\u00a0components, 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 \u2013 P, NP, NP-hard, NP-complete.<\/p>\n Theory of Computation:<\/strong>\u00a0Regular\u00a0languages\u00a0and finite automata, Context free languages and Push-down automata, Recursively enumerable sets and Turing machines, Undecidability.<\/p>\n Compiler Design:<\/strong>\u00a0Lexical analysis, Parsing, Syntax directed translation, Runtime environments, Intermediate and target\u00a0code generation, Basics of code optimization.<\/p>\n Operating System:<\/strong>\u00a0Processes, Threads, Inter-process communication, Concurrency, Synchronization, Deadlock, CPU scheduling, Memory management and\u00a0virtual\u00a0memory, File systems, I\/O systems, Protection and security.<\/p>\n Databases:<\/strong>\u00a0ER-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.<\/p>\n Information\u00a0Systems and Software Engineering<\/strong>: information gathering, requirement and feasibility analysis,\u00a0data flow diagrams, process specifications, input\/output design, process life cycle, planning and managing the project, design, coding, testing, implementation, maintenance.<\/p>\n Computer Networks:<\/strong>\u00a0ISO\/OSI stack, LAN\u00a0technologies\u00a0(Ethernet, Token ring), Flow and error control techniques, Routing algorithms, Congestion control, TCP\/UDP and sockets, IP(v4),\u00a0Application\u00a0layer protocols (icmp, dns, smtp, pop, ftp, http); Basic concepts of hubs, switches,\u00a0gateways, and routers. Network security \u2013 basic concepts of public key and private key cryptography,\u00a0digital\u00a0signature, firewalls.<\/p>\n Web technologies:<\/strong>\u00a0HTML, XML, basic concepts of client-server computing.<\/p>\n GATE 2013\u00a0Syllabus\u00a0for Computer\u00a0Science & Information Technology<\/span><\/p>\n","protected":false},"excerpt":{"rendered":" GATE 2013\u00a0Syllabus\u00a0for Computer\u00a0Science & Information Technology download\u00a0GATE 2013\u00a0Syllabus\u00a0for Computer\u00a0Science & Information Technology ENGINEERING MATHEMATICS Mathematical Logic:\u00a0Propositional Logic;\u00a0First Order Logic. Probability:\u00a0Conditional Probability; Mean, Median, Mode and Standard Deviation;\u00a0Random Variables; Distributions; uniform, normal, exponential, Poisson, Binomial. Set Theory\u00a0& Algebra:\u00a0Sets; Relations; Functions; Groups; Partial Orders; Lattice;\u00a0Boolean Algebra. Combinatorics:\u00a0Permutations; Combinations; Counting; Summation; generating functions; recurrence relations; asymptotic. Graph Theory:\u00a0Connectivity; […]<\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"open","ping_status":"open","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[27],"tags":[35,336,36,28],"class_list":["post-97","post","type-post","status-publish","format-standard","hentry","category-gate","tag-computer-science","tag-gate","tag-information-technology","tag-syllabus"],"_links":{"self":[{"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/posts\/97","targetHints":{"allow":["GET"]}}],"collection":[{"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/comments?post=97"}],"version-history":[{"count":5,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/posts\/97\/revisions"}],"predecessor-version":[{"id":1008,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/posts\/97\/revisions\/1008"}],"wp:attachment":[{"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/media?parent=97"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/categories?post=97"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/eduetc.com\/edu\/wp-json\/wp\/v2\/tags?post=97"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\n<\/strong><\/p>\n
\n<\/strong><\/p>\n