Close sidebar

plez give the detailed syllabus of cs in gate exam

mathematics and all other

  • Raviraj
  • 1968 Views
  • 6 Answers
  Answer
6 Answers

  • Section1:br /Engineering Mathematicsbr /Discrete Mathematics:br /Propositional and first order logic. Sets, relations, functions, partialbr /orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:br /counting, recurrence relations, generating functions.br /Linear Algebra:Matrices, determinants, system of linear equations, eigenvalues andbr /eigenvectors, LU decomposition.br /Calculus:br /Limits, continuity and differentiability. Maxima and minima. Mean valuebr /theorem. Integration.br /Probability:br /Random variables. Uniform, normal, exponential, poisson and binomialbr /distributions. Mean, median, mode and standard deviation. Conditional probability andbr /Bayes theorem.br /br /Computer Science and Information Technologybr /br /Section 2: Digital Logicbr /Booleanbr /algebra. Combinational and sequential circuits. Minimization. Numberbr /representations and computer arithmetic (fixed and floating point).br /br /Section 3: Computer Organization and Architecturebr /Machine instructions and addressing modes. ALU, data‐path and control unit.br /Instruction pipelining. Memory hierarchy: cache, main memory and secondary storage; I/Obr /interface (interrupt and DMA mode).br /br /Section 4: Programming and Data Structuresbr /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary searchbr /trees, binary heaps, graphs.br /br /Section 5: Algorithmsbr /Searching, sorting, hashing. Asymptotic worst case time and space complexity.br /Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.br /Graph search, minimum spanning trees, shortest paths.br /br /Section 6: Theory of Computationbr /Regular expressions and finite automata. Context-free grammars and push-downbr /automata. Regular and contex-free languages, pumping lemma. Turing machines andbr /undecidability.br /br /Section 7: Compiler Designbr /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediatebr /code generation.br /br /Section 8: Operating Systembr /Processes, threads, inter‐process communication, concurrency and synchronization.br /Deadlock. CPU scheduling. Memorybr /management and virtual memory. File systems.br /br /Section 9: Databasesbr /ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,br /normal forms. File organization, indexing (e.g., B and B+ trees). Transactions andbr /concurrency control.br /br /Section 10: Computer Networksbr /Concept of layering.br /LAN technologies (Ethernet). Flow and error control techniques,br /switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDPbr /and sockets, congestion control. Applicabr /tion layer protocols (DNS, SMTP, POP, FTP, HTTP).br /Basics of Wi-Fi. Network security: authentication, basics of public key and private keybr /cryptography, digital signatures and certificates, firewalls.br /br / 

    0

  • 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.br /Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).br /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).br /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.br /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, and shortest paths.br /Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.br /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.br /Processes, threads, inter‐process communication, concurrency and synchronization.br /Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /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 controlbr /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.

    0

  • Check the official website alwaysbr /br /strongSection1: Engineering Mathematics/strongbr /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.br /Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues and eigenvectors, LU decomposition.br /Calculus: Limits, continuity and differentiability. Maxima and minima. Mean value theorem. Integration.br /Probability: Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.br /strongSection 2: Digital Logic /strongbr /Boolean algebra. Combinational and sequential circuits. Minimization. Numberrepresentations and computer arithmetic (fixed and floating point).br /br /strongSection 3: Computer Organization and Architecture/strongbr /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).br /strongSection 4: Programming and Data Structures /strongbr /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.br /strongSection 5: Algorithms /strongbr /Searching, sorting, hashing. Asymptotic worst case time and space complexity.br /Algorithm design techniques: greedy, dynamic programming and divide-and‐conquer. Graph search, minimum spanning trees, shortest paths.br /strongSection 6: Theory of Computation /strongbr /Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.br /br /strongSection 7: Compiler Design/strongbr /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.br /strongSection 8: Operating System /strongbr /Processes, threads, inter-process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /strongSection 9: Databases /strong ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,br /normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control.br /strongSection 10: Computer Networks /strong 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.

    0

  • download it from gate website for detailed syllabus

    0

  • stronguSection1: Engineering Mathematics/u/strongbr /br /uDiscrete Mathematics:/u Propositional and first-order logic. Sets, relations, functions, partial orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions.br /br /uLinear Algebra/u: Matrices, determinants, the system of linear equations, eigenvalues and eigenvectors, LU decomposition.br /br /uCalculus: /uLimits, continuity, and differentiability. Maxima and minima. Mean value theorem. Integration.br /br /uProbability:/u Random variables. Uniform, normal, exponential, poisson and binomial distributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.br /br /uComputer Science and Information Technology/ubr /br /stronguSection 2: Digital Logic/u/strongbr /br /Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point).br /br /stronguSection 3: Computer Organization and Architecture/u/strongbr /br /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).br /br /stronguSection 4: Programming and Data Structures /u/strongbr /br /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs.br /br /stronguSection 5: Algorithms /u/strongbr /br /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.br /br /stronguSection 6: Theory of Computation /u/strongbr /br /Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and contex-free languages, pumping lemma. Turing machines and undecidability.br /br /ustrongSection 7: Compiler Design/strong/ubr /br /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation.br /br /ustrongSection 8: Operating System/strong/ubr /br /Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /br /stronguSection 9: Databases/u/strongbr /br /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.br /br /ustrongSection 10: Computer Networks/strong/ubr /br /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. 

    0

  • GATE CS 2018-19 Syllabusbr /Section1: Engineering Mathematicsbr /Section 2: Digital Logicbr /Section 3: Computer Organization and Architecturebr /Section 4: Programming and Data Structures br /Section 5: Algorithms br /Section 6: Theory of Computation br /Section 7: Compiler Designbr /Section 8: Operating System br /Section 9: Databasesbr /Section 10: Computer Networks br /br /br /CS Computer Science and Information Technologybr /Section1: Engineering Mathematicsbr /Discrete Mathematics: Propositional and first order logic. Sets, relations, functions, partialbr /orders and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics:br /counting, recurrence relations, generating functions.br /Linear Algebra: Matrices, determinants, system of linear equations, eigenvalues andbr /eigenvectors, LU decomposition.br /Calculus: Limits, continuity and differentiability. Maxima and minima. Mean valuebr /theorem. Integration.br /Probability: Random variables. Uniform, normal, exponential, poisson and binomialbr /distributions. Mean, median, mode and standard deviation. Conditional probability andbr /Bayes theorem.br /Computer Science and Information Technologybr /Section 2: Digital Logicbr /Boolean algebra. Combinational and sequential circuits. Minimization. Numberbr /representations and computer arithmetic (fixed and floating point).br /Section 3: Computer Organization and Architecturebr /Machine instructions and addressing modes. ALU, data‐path and control unit. Instructionbr /pipelining. Memory hierarchy: cache, main memory and secondary storage; I/Obr /interface (interrupt and DMA mode).br /Section 4: Programming and Data Structuresbr /Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary searchbr /trees, binary heaps, graphs.br /Section 5: Algorithmsbr /Searching, sorting, hashing. Asymptotic worst case time and space complexity.br /Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer.br /Graph search, minimum spanning trees, shortest paths.br /Section 6: Theory of Computationbr /Regular expressions and finite automata. Context-free grammars and push-downbr /automata. Regular and contex-free languages, pumping lemma. Turing machines andbr /undecidability.br /Section 7: Compiler Designbr /Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediatebr /code generation.br /Section 8: Operating Systembr /Processes, threads, inter‐process communication, concurrency and synchronization.br /Deadlock. CPU scheduling. Memory management and virtual memory. File systems.br /br /Section 9: Databasesbr /ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints,br /normal forms. File organization, indexing (e.g., B and B+ trees). Transactions andbr /concurrency control.br /Section 10: Computer Networksbr /Concept of layering. LAN technologies (Ethernet). Flow and error control techniques,br /switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDPbr /and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP).br /Basics of Wi-Fi. Network security: authentication, basics of public key and private keybr /cryptography, digital signatures and certificates, firewalls.

    0
  Other Related Discussions
Ask a Question
Practice Mock Test
gate computer science (cs)
Youth4work © 2024