User:Bomanhoo19/EngineeringCSE

Notes for Programming in C#
= GATE Syllabus for CSE 2024 = {| class="wikitable" !Sections !Topics !Section 1: Engineering Mathematics

Discrete Mathematics:
Propositional and first order logic. Sets, relations, functions, partial orders and lattices. Monoids, 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 and Statistics:
Random variables. Uniform, normal, exponential, poisson and binomialdistributions. Mean, median, mode and standard deviation. Conditional probability and Bayes theorem.

Computer Science and Information Technology
!Section 2: Digital Logic computer arithmetic (fixed and floating point). !Section 3: Computer Organization and Architecture pipelining, pipeline hazards. Memory hierarchy: cache, main memory and secondary storage; I/O interface (interrupt and DMA mode). !Section 4: Programming and Data Structures binary heaps, graphs. !Section 5: Algorithms techniques: greedy, dynamic programming and divide‐and‐conquer. Graph traversals, minimum spanning trees, shortest paths !Section 6: Theory of Computation Regular and contex-free languages, pumping lemma. Turing machines and undecidability. !Section 7: Compiler Design generation. Local optimisation, Data flow analyses: constant propagation, liveness analysis, common sub expression elimination. !Section 8: Operating System Deadlock. CPU and I/O scheduling. Memory management and virtual memory. File systems. !Section 9: Databases forms. File organization, indexing (e.g., B and B+ trees). Transactions and concurrency control. !Section 10: Computer Networks Routing protocols: shortest path, flooding, distance vector and link state routing; Fragmentation and IP addressing, IPv4, CIDR notation, Basics of IP support protocols (ARP, DHCP, ICMP), Network Address Translation (NAT); Transport layer: flow control and congestion control, UDP, TCP, sockets; Application layer protocols: DNS, SMTP, HTTP, FTP, Email.
 * Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and
 * In this section of GATE Exam Syllabus for Computer Science, we will learn Machine instructions and addressing modes. ALU, data‐path and control unit. Instruction
 * Programming in C. Recursion. Arrays, stacks, queues, linked lists, trees, binary search trees,
 * Searching, sorting, hashing. Asymptotic worst case time and space complexity. Algorithm design
 * In this section of GATE Exam Syllabus for Computer Science, we will learn Regular expressions and finite automata. Context-free grammars and push-down automata.
 * Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code
 * System calls, processes, threads, inter‐process communication, concurrency and synchronization.
 * In this section of GATE Exam Syllabus for Computer Science, we will learn ER‐model. Relational model: relational algebra, tuple calculus, SQL. Integrity constraints, normal
 * In this section of GATE Exam Syllabus for Computer Science, we will learn Concept of layering: OSI and TCP/IP Protocol Stacks; Basics of packet, circuit and virtual circuit switching; Data link layer: framing, error detection, Medium Access Control, Ethernet bridging;
 * }