• Overview of different operating systems, functionalities and charateristics of OS, comparing Windows, Linux. Hardware concepts, CPU states, I/O channels, memory hierarchy. A process, operations on them, process states, concurrent processes, process control block, process context.
• Windows/UNIX process control, PCB, signals, forks, pipes. Interrupt processing, operating system organisation, OS kernel, dispatcher.
• Job and processor scheduling, scheduling algorithms, process hierarchies, Problems of concurrent processes, critical sections, mutual exclusion, synchronisation, deadlock.
• Mutual exclusion, process co-operation, producer and consumer processes. Semaphores: definition, init, wait, signal operations.
• Critical regions, Conditional Critical Regions, Monitors, Ada Tasks. Interprocess Communication (IPC), Message Passing, Direct and Indirect
• Deadlock: prevention, detection, avoidance, banker's algorithm. Memory organisation and management, storage allocation.
• Virtual memory concepts, paging and segmentation, address mapping. Virtual storage management, page replacemant strategies.
• File organisation, blocking/buffering, file descriptor, directory structure. File and Directory structures, blocks and fragments

Propositional logic: Syntax and semantics, valid, satisfiable and unsatisfiable formulas, the validity of some logical arguments.Proof Techniques: Forward proof, proof by contradiction, contrapositive proofs, proof of necessity and sufficiency.Sets, relations and functions: Operations on sets, relations and functions, binary relations, partial ordering relations, equivalence relations, principles of mathematical induction. Size of a set: Finite and infinite sets, countable and uncountable sets, Cantor's diagonal argument and the power set theorem, Schröder-Bernstein theorem. Combinatorics: Basic counting techniques: inclusion and exclusion, pigeon-hole principle, permutation, combination, summations. Introduction to recurrence relations and generating functions. Algebraic structures and morphisms : Algebraic structures with one binary operation - semigroups, monoids and groups, congruence relation and quotient structures. Free and cyclic monoids and groups, permutation groups, substructures, normal subgroups. Algebraic structures with two binary operations - rings, integral domains and fields. Boolean algebra and Boolean ring. Graphs and trees: degree, path, cycle, subgraphs, isomorphism, Eulerian and Hamiltonian walks, graph coloring, planar graphs, trees.