Arjun Suresh (talk | contribs) (Created page with " ==Discrete Mathematics== *Propositional and first order logic. *Sets, relations, functions, partial orders and lattices. Groups. * Graphs: connectivity, matching, coloring....") |
Arjun Suresh (talk | contribs) |
||
Line 23: | Line 23: | ||
*Conditional probability and Bayes theorem. | *Conditional probability and Bayes theorem. | ||
− | + | ==Digital Logic== | |
− | Boolean algebra. Combinational and sequential circuits. Minimization. Number | + | |
− | representations and computer arithmetic (fixed and floating point). | + | *Boolean algebra. |
− | + | *Combinational and sequential circuits. Minimization. | |
− | Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction | + | *Number representations and computer arithmetic (fixed and floating point). |
− | pipelining. Memory hierarchy: cache, main memory and secondary storage; I/O | + | |
− | interface (interrupt and DMA mode). | + | ==Computer Organization and Architecture== |
− | + | ||
− | Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search | + | *Machine instructions and addressing modes. |
− | trees, binary heaps, graphs. | + | *ALU, data‐path and control unit. |
− | + | *Instruction pipelining. | |
− | Searching, sorting, hashing. Asymptotic worst case time and space complexity. | + | * Memory hierarchy: cache, main memory and secondary storage; |
− | Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. | + | * I/O interface (interrupt and DMA mode). |
− | Graph search, minimum spanning trees, shortest paths. | + | |
− | + | ==Programming and Data Structures== | |
− | Regular expressions and finite automata. Context-free grammars and push-down | + | *Programming in C. Recursion. |
− | automata. Regular and contex-free languages, pumping lemma. Turing machines and | + | *Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. |
− | undecidability. | + | |
− | + | ==Algorithms== | |
− | Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate | + | *Searching, sorting, hashing. |
− | code generation. | + | *Asymptotic worst case time and space complexity. |
− | + | *Algorithm design techniques: greedy, dynamic programming and divide‐and‐conquer. | |
− | Processes, threads, inter‐process communication, concurrency and synchronization. | + | *Graph search, minimum spanning trees, shortest paths. |
− | Deadlock. CPU scheduling. Memory management and virtual memory. File systems. | + | |
− | + | ==Theory of Computation== | |
− | ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, | + | *Regular expressions and finite automata. |
− | normal forms. File organization, indexing (e.g., B and B+ trees). Transactions and | + | *Context-free grammars and push-down automata. |
− | concurrency control. | + | *Regular and contex-free languages, pumping lemma. |
− | + | *Turing machines and undecidability. | |
− | Concept of layering. LAN technologies (Ethernet). Flow and error control techniques, | + | |
− | switching. IPv4/IPv6, routers and routing algorithms (distance vector, link state). TCP/UDP | + | ==Compiler Design== |
− | and sockets, congestion control. Application layer protocols (DNS, SMTP, POP, FTP, HTTP). | + | *Lexical analysis, parsing, syntax-directed translation. |
− | Basics of Wi-Fi. Network security: authentication, basics of public key and private key | + | *Runtime environments. |
− | cryptography, digital signatures and certificates, firewalls. | + | *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. | ||
[[Category:GATE]] | [[Category:GATE]] |
Section 2: Digital Logic Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating point). Section 3: 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). Section 4: Programming and Data Structures Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. Section 5: 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. Section 6: 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. Section 7: Compiler Design Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Section 8: Operating System Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems. Section 9: 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. Section 10: 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.