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

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) {

Binary Search Algorithm

The Binary Search algorithm is an efficient way to find a target value within a sorted array.

arr = [10, 20, 30, 40, 50, 60, 70]
key = int(input("Enter number to search: "))

low = 0
high = len(arr) - 1

while low <= high:
    mid = (low + high) // 2

    if arr[mid] == key:
        print("Element found at index", mid)
        break
    elif arr[mid] < key:
        low = mid + 1
    else:
        high = mid - 1
else:
    print("Element not found")

Finding the Largest Element

This snippet demonstrates how to iterate through a list to identify the maximum value.

numbers = [10, 25, 8, 45, 30]

largest = numbers[0]

for i in numbers:
    if i > largest:
        largest = i

print("Largest element is:", largest)

Linear

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

Case Manipulation Methods

• title(): Displays each word in a string in Title Case, where every word begins with a capital letter.
• upper(): Converts every character in a string to all uppercase letters.
• lower(): Converts every character in a string to all lowercase letters. This is particularly useful for normalizing user input before storing it.

Whitespace Stripping Methods

Python considers whitespace (tabs, spaces, etc.) significant. Use these methods to clean up extra spacing:

• rstrip(): Removes whitespace from the right side (end) of a string.
• lstrip(): Removes whitespace from the left side (beginning) of a string.
• strip(): Removes whitespace from both the beginning and the end of a string simultaneously.

Related Data Type Conversion

• str(): While not

In C++, Input/Output (I/O) operations are managed through a hierarchy of classes collectively known as streams. A stream is an abstraction that represents a flow of data between a source (like a keyboard) and a destination (like a screen).

Here is a comprehensive breakdown of how C++ handles both unformatted and formatted I/O operations, along with the core stream mechanisms.

Streams, Insertion, and Extraction

At the heart of C++ I/O are the standard stream objects:

• cin: Standard input stream (usually the keyboard), an instance of istream.
• cout: Standard output stream (usually the screen), an instance of ostream.

The Insertion Operator (<<)

Used with cout to output data. It "inserts" data into the output stream.

cout << "Hello, World!";

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) {
        /