Engineering Mathematics and Digital Logic Quiz

Study Notes

Discrete Mathematics: Covers propositional and first-order logic, sets, relations, functions, partial orders, lattices, monoids, groups, graphs (connectivity, matching, coloring), combinatorics (counting, recurrence relations), and generating functions.
Linear Algebra: Includes matrices, determinants, systems of linear equations, eigenvalues, eigenvectors, and LU decomposition.
Calculus: Topics encompass limits, continuity, differentiability, maxima/minima, mean value theorem, and integration.
Probability and Statistics: Focuses on random variables, uniform, normal, exponential, Poisson, and binomial distributions, along with mean, median, mode, standard deviation, conditional probability, and Bayes' theorem.

Boolean Algebra: Covers this fundamental concept as it applies to combinational and sequential circuits.
Combinational and Sequential Circuits: Includes topics on minimization, number representations, and computer arithmetic, encompassing fixed and floating-point systems.

Machine Instructions and Addressing Modes: Includes discussion of ALU, data-path and control unit, instruction pipelining, pipeline hazards and memory hierarchy.
Memory Hierarchy (Cache, Main, Secondary): Provides detail on cache, main memory, secondary storage, I/O interfaces, and how interrupts and DMA work.

Programming in C: Focuses on recursion, arrays, stacks, queues, linked lists, trees, binary search trees, and binary heaps. Also discussing graphs.

Searching and Sorting: Covers hashing, asymptotic worst-case time and space complexity, algorithm design (greedy, dynamic programming, divide-and-conquer), and graph traversals, including minimum spanning trees and shortest paths.

Finite Automata: Includes regular expressions, finite automata, context-free grammars, and push-down automata.
Formal Language Concepts: Includes regular and context-free languages, the pumping lemma, Turing machines, and undecidability

Compiler Components: Focus on lexical analysis, parsing, syntax-directed translation, runtime environments, intermediate code generation.
Optimization Techniques: Topics include constant propagation, liveness analysis, and common subexpression elimination.

System Principles: Covers system calls, processes, threads, inter-process communication, concurrency, synchronization, deadlocks, CPU and I/O scheduling, memory management, and virtual memory concepts.
File Systems: Covers file systems

Database Models: Includes ER-model, relational model, relational algebra, tuple calculus, SQL, integrity constraints, and normal forms.
Database Implementation: Covers file organization and indexing techniques (e.g., B-trees and B+ trees). Transactions and concurrency control strategies are introduced.

Network Architectures and Concepts: OSI and TCP/IP stacks, circuit and packet switching.
Data Link and Network Layers: Covers topics from framing, error detection to routing protocols (shortest path, flooding, distance vector and link state).
Transport and Application Layers: Includes fragmentation/IP addressing, IPv4/CIDR notation, protocols (ARP, DHCP, and ICMP), NAT, flow and congestion control, UDP, TCP, sockets, protocols such as DNS, SMTP, HTTP, FTP, and email.