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

Finding the Basis of a Row Space

The easiest way to find the basis of a row space is to reduce matrix A to Reduced Row Echelon Form (RREF). The nonzero row vectors of R (which contain the leading 1s, or pivots) form a basis for row(A).

Finding the Basis of the Kernel

The following four steps outline the most effective method for finding a basis for null(A):

1. Reduce A to RREF (R): Find the Reduced Row Echelon Form (R) of the matrix A.
2. Solve the Homogeneous System: Use the RREF, R, to solve the equivalent homogeneous system Rx=0.
3. Identify and Parameterize Variables:
   • Identify the leading variables (those corresponding to columns containing a leading 1 or pivot in the RREF) and the free variables.
   • Solve for the leading variables in terms of the free variables.

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

SR Flip-Flop (Set-Reset Flip-Flop)

The SR flip-flop is one of the simplest sequential circuits and serves as a fundamental building block for more complex flip-flops. It is a 1-bit memory device with two inputs: Set (S) and Reset (R). It has two outputs, Q and its complement Q̅ (Q with overline).

Logic Diagram and Working

An SR flip-flop can be constructed using two cross-coupled NAND gates (or NOR gates). Below is the working principle for the NAND-gate implementation:

1. Set Condition (S = 0, R = 1):

   • When S = 0, the output of the top NAND gate (Q) is forced to 1 (since NAND is the inverse of AND).

   • This Q = 1 is fed into the bottom NAND gate with R = 1; the bottom gate's inputs become 1 and 1, so its output (Q̅) becomes 0.

   • The circuit is now in the

Web Security Fundamentals

Common Cross-Site Scripting (XSS) Types

############################### lAB 9 ####################3
import gymnasium as gym
import numpy as np
import tensorflow as tf

# Create the environment
env = gym.Make("CartPole-v1")

# Define a simple neural network model for the policy
model = tf.Keras.Sequential([
    tf.Keras.Layers.Dense(16, activation='relu', input_shape=(env.Observation_space.Shape[0],)),
    tf.Keras.Layers.Dense(env.Action_space.N, activation='softmax')
])

# Define the optimizer
optimizer = tf.Keras.Optimizers.Adam(learning_rate=0.01)

# Function to choose an action based on the current policy
def choose_action(state):
    """
    Chooses an action based on the probabilities output by the policy model.
    Args:
        state (np.Array): The current observation/state from... Continue reading "Implementing REINFORCE Policy Gradient for CartPole-v1" »

1. Arrays: Definition, Types, and Implementation

An array is a collection of elements of the same data type stored in contiguous memory locations. It is used to store multiple values in a single variable and can be accessed using index numbers. The indexing in an array starts from 0. Arrays help manage and process data efficiently, especially when dealing with large volumes of similar data.

Types of Arrays Based on Dimensions

• One-Dimensional Array: It stores data in a linear list format.
• Multi-Dimensional Array: It stores data in matrix form (like 2D, 3D arrays), which is useful in applications like image processing and tables.

Types of Arrays Based on Memory Allocation

1. Static Array:

   The size of the array is fixed at compile-time. Memory is allocated

Understanding Data Structures and Algorithms

8. Queues: FIFO Operations

A queue is a linear data structure that follows the First-In, First-Out (FIFO) principle. The element inserted first will be removed first, similar to people waiting in a line. It has two primary operations:

• enqueue(): Adds an element to the rear of the queue.
• dequeue(): Removes an element from the front of the queue.

Enqueue Operation Algorithm (Array-based):

1. Check if the queue is full (rear == size - 1).
2. If not full, increment rear.
3. Insert the new element at queue[rear].

Example:

if (rear == size - 1)
    printf("Queue Overflow");
else {
    rear++;
    queue[rear] = value;
}

Dequeue Operation Algorithm:

1. Check if the queue is empty (front > rear).
2. If not empty, retrieve the element

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" »

α

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum a ante ut purus aliquam pellentesque. Suspendisse potenti. In sit amet risus quam, et egestas mauris. Nunc feugiat risus ut est facilisis condimentum. Sed et turpis velit, sit amet pharetra lacus.

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum a ante ut purus aliquam pellentesque. Suspendisse potenti. In sit amet risus quam, et egestas mauris. Nunc feugiat risus ut est facilisis condimentum. Sed et turpis velit, sit amet pharetra lacus.

---

Lorem ipsum dolor sit amet, consectetur adipiscing elit. Vestibulum a ante ut purus aliquam pellentesque. Suspendisse potenti. In sit amet risus quam, et egestas mauris. Nunc feugiat risus ut est facilisis condimentum. Sed

1)A virtual-circuit network (VCN) is a hybrid network model that combines features of both circuit-switched and datagram networks. It provides a balance between connection-oriented and connectionless transmission methods :-Three Phases in a Virtual-Circuit Network In a virtual-circuit network, the communication between a source and destination involves three phases: setup, data transfer, and teardown. These phases ensure that a reliable path is established and maintained for the communication session. 1. Setup Phase: o The source and destination use their global addresses to establish a connection. During this phase, switches along the path create table entries to store information about the virtual circuit. This phase ensures that each switch... Continue reading "Core Concepts in Network Layer Protocols and Routing" »