Archives: Courses

Digital Logic

Syllabus: Boolean algebra. Combinational and sequential circuits. Minimization. Number representations and computer arithmetic (fixed and floating-point). Very important topics: Boolean algebra. Combinational and sequential circuits. Minimization Text Books: Digital Logic and Design by Morris Mano.

Compiler Design

Syllabus: Lexical analysis, parsing, syntax-directed translation. Runtime environments. Intermediate code generation. Very important topics: Lexical analysis, parsing, syntax-directed translation Textbooks: Principles of Compiler Design by Aho and Ullman.

Database Management Systems

Syllabus: 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. Very important topics: relational algebra, tuple calculus, SQL, normal forms, indexing (e.g., B and B+ trees) Text Books: “Database System Concepts” by Korth DBMS by Raghu Rama Krishnan DBMS …

Database Management Systems Read More »

Computer Networks

Syllabus: 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 a public key and private key cryptography, digital signatures and certificates, firewalls. …

Computer Networks Read More »

Theory of computation

Syllabus: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages, pumping lemma. Turing machines and undecidability. Very important topics: Regular expressions and finite automata. Context-free grammars and push-down automata. Regular and context-free languages Text Books: Theory of Computation by Ullman. Introduction to the Theory of Computation by Michael Sipser.T

Operating Systems

Syllabus: Processes, threads, inter‐process communication, concurrency and synchronization. Deadlock. CPU scheduling. Memory management and virtual memory. File systems. Very important topics: Processes, Deadlock, CPU scheduling,Memory management and virtual memory, inter‐process communication, concurrency and synchronization Text Books: Operating System Principles by Galvin

Basic Maths

Syllabus: 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: Random variables. Uniform, normal, exponential, Poisson, and binomial distributions. Mean, median, mode, and standard deviation. Conditional probability and Bayes theorem. Very important topics: Matrices, determinants, eigenvalues and eigenvectors, …

Basic Maths Read More »

Data Structures and Algorithms

Programming and Data Structures Programming in C, Arrays, Recursion, stacks, queues, linked lists, trees, binary search trees, binary heaps, graphs. 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 Very important topics C programming, recursion, linked lists, trees, searching, …

Data Structures and Algorithms Read More »

Discrete Maths

Syllabus: Propositional and first-order logic. Sets, relations, functions, partial orders, and lattices. Groups. Graphs: connectivity, matching, coloring. Combinatorics: counting, recurrence relations, generating functions Very Important topics: Propositional and first-order logic, Groups, Counting, Relations, introduction to graphs, connectivity, trees TextBooks: Kenneth . H. Rosen