Notes, summaries, assignments, exams, and problems for Computers

Chapter 5: Synchronization

Critical Section Conditions

• Mutual Exclusion: Only one process may be in the critical section at a time.
• Progress: If the critical section is empty, some waiting process can enter.
• Bounded Waiting: No starvation; each process waits a bounded number of turns.

Atomic Instructions

• Test-and-Set: old = *b; *b = TRUE; return old
• Swap: temp = *a; *a = *b; *b = temp

Spinlocks

• TAS:

  bool m = false;
  lock() { while (TestAndSet(&m)); }
  unlock() { m = false; }
  

• Swap:

  bool m = false;
  lock() { bool key = true; while (key) Swap(&m, &key); }
  unlock() { m = false; }
  

Semaphores

• wait(S): S.val--; if S.val < 0 block
• signal(S): S.val++; if S.val <= 0 wake one
• Binary semaphore as mutex: init = 1; lock = wait; unlock = signal

Peterson's

Linux and Operating Systems Fundamentals

• 1. CD-ROM Directory: The CD-ROM contains a directory called /fortycdrom/data.
• 2. Permissions: -rwxr-xr applies to everyone and members.
• 3. Process Control: ID 42000 — kill -9.
• 4. Modern Operating Systems: Applies to all.
• 5. Child Process: Identified by the process ID.
• 6. 11-Bit Processor: Maximum value is 2047.
• 7. Block Special File: Represents a hard disk drive.
• 8. POSIX Compliant: There are different standards.
• 9. Code Execution: The following code crashes.
• 10. Bash Command: alias bubble.
• 11. Linux Shell: pwd prints the current working directory.
• 12. Shell Commands: chown is used for ownership.
• 13. Virtual Machine: Utilizes CPU and memory resources.
• 14. File Names: ls -al lists files including their names.
• 15.

This implementation demonstrates how to find the shortest path from a source node to all other nodes in a graph using Dijkstra's Algorithm.

Core Components

• minDist: Identifies the node with the minimum distance not yet included in the shortest path tree.
• print: Displays the calculated shortest distances from the source.
• dijkstra: The primary logic that updates distances based on the adjacency matrix.

import java.util.*;

public class Main {
    static int V;

    // Find the node with the minimum distance not yet in the shortest path tree
    int minDist(int dist[], Boolean boolset[]) {
        int min = Integer.MAX_VALUE, min_value = -1;
        for (int i = 0; i < V; i++) {
            if (!boolset[i] && dist[i] <= min) {

1. JK Flip-Flop Operation and Truth Table

Logic Diagram:

Working Principle

The JK flip-flop is an enhanced version of the gated SR flip-flop. It incorporates clock input circuitry to eliminate the invalid output condition that occurs when both S and R inputs are logic level "1".

Because of the added clock input, the JK flip-flop offers four distinct input combinations:

• Logic "1" (Set)
• Logic "0" (Reset)
• No Change
• Toggle

The S and R inputs of the preceding SR bistable are replaced by J and K inputs, named after its inventor, Jack Kilby. Thus, J = S and K = R.

The two 2-input AND gates in the gated SR bistable are replaced by two 3-input NAND gates. The third input of each NAND gate connects to the outputs Q and $\bar{Q}$. This cross-coupling allows the... Continue reading "Digital Electronics Concepts: Flip-Flops, Registers, and Converters" »

JavaScript: The Heart of Interactive Web Development

JavaScript is a powerful and widely used programming language mainly used for making websites interactive and dynamic. It works on the client-side, which means it runs inside the user's web browser. JavaScript allows web pages to respond to user actions like clicking buttons, typing in text boxes, hovering over images, and more. It works together with HTML (for structure) and CSS (for design) to build modern and user-friendly websites. It is easy to learn and used by almost every website today.

Apart from the client-side, JavaScript is also used on the server-side using platforms like Node.js, which allows building full web applications using JavaScript alone. It is a platform-independent language,... Continue reading "Core Web Development Concepts: Languages, Protocols, and Frameworks" »

Python Operations and Operators

This section covers fundamental operations and operators in Python, which are symbols used to perform operations on values and variables.

# Examples of different operators
a = 10 // 3  # Floor Division
a = 10 % 3   # Modulo Operator
a = 3        # Assignment
b = 1        # Declaring variables
a == b       # Comparison

Types of Operators

Operators are used for operations between values and variables. The main types are:

• Assignment Operators: Used to assign values to variables.
• Logical Operators: Used to combine conditional statements.
• Comparison Operators: Used to compare two values.
• Arithmetic Operators: Used with numeric values to perform common mathematical operations.
• Bitwise Operators: Used to compare binary numbers.

Core Graph Algorithms Pseudocode

Kruskal's Algorithm for MST

def Kruskal(V, E):

1. Sort E by increasing weight.
2. For each vertex v in V: create a tree for each v.

MST = {}

For i from 1 to |E|:

1. (u, v) ← lightest edge in E.
2. If u and v are not in the same tree:

• MST.add((u,v))
• Merge u and v trees.

Return MST.

Huffman Tree Construction

BuildHuffman(characters[1..n], frequencies[1..n]):

• Create nodes for each character.
• For i ← 1 to n: create a min-heap Q with each node frequency as a key.

While(length(Q) > 1):

1. x = pop minimum value from Q.
2. y = pop minimum value from Q.
3. Create new node z.
4. z.key = x.key + y.key
5. z.leftChild = x
6. z.rightChild = y
7. Insert z into Q.

Return the root value from Q.

Topological Sort

topological_sort(G):

Stack = []

While (unvisited Nodes):

helper_toposort(

Archivos HTML del Frontend

INDEX.HTML: Menú Principal del Sistema

<!DOCTYPE html>
<html>
<head>
    <title>Menú Principal del Sistema</title>
    <meta charset="UTF-8">
    <meta name="viewport" content="width=device-width, initial-scale=1.0">
    <style>
        h2 { color: #789; font-size: 45px; }
        select { color: brown; font-size: 30px; }
        h3 { color: #8b4513; font-size: 30px; }
    </style>
</head>
<body>
    <h2>Menú de Opciones del Sistema</h2>
    <h3>Seleccione una opción:</h3>
    <ol>
        <li><a href="Registro.html">Registrar Usuario</a></li>
        <li><a href="Acceso.html">Acceso

Single Inheritance in Java

This Single Inheritance program demonstrates how a child class inherits properties and methods from a single parent class.

class Animal {
    // Constructor of Parent class
    Animal() {
        System.out.println("Animal constructor called");
    }
    // Method of Parent class
    void eat() {
        System.out.println("I can eat");
    }
}

// Child class inheriting from Animal
class Dog extends Animal {
    // Constructor of Child class
    Dog() {
        System.out.println("Dog constructor called");
    }
    // Method of Child class
    void bark() {
        System.out.println("I can bark");
    }
}

// Main class to test inheritance
public class Main {
    public static void main(String[] args) {
        /

What is PHP?

PHP (Hypertext Preprocessor) is a widely-used open-source scripting language primarily designed for web development. It runs on the server-side, meaning the code is executed on the web server before the output is sent to the user's browser. PHP is embedded within HTML and supports various databases, making it a powerful tool for creating dynamic and interactive web applications.

Key Features of PHP

PHP has several features that make it a popular choice for web development:

• Open-Source – PHP is free to use, with a large community of developers providing support and updates.
• Cross-Platform Compatibility – PHP works on multiple operating systems like Windows, Linux, and macOS.
• Easy to Learn and Use – Its syntax is simple and similar