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

Implementação da Transposição de Matriz 4x4 em C

Este programa em C demonstra como calcular e exibir a matriz transposta (B) de uma matriz quadrada de ordem 4 (A). A transposição é realizada trocando as linhas pelas colunas, ou seja, o elemento na posição A[i][j] é copiado para B[j][i].

Código Fonte em C para Transposição de Matriz

O código utiliza as bibliotecas padrão stdio.h para entrada/saída e conio.h (comum em ambientes legados) para controle de console.

#include <stdio.h>
#include <conio.h>

int main()
{
    int i, j, A[4][4], B[4][4];

    // 1. Entrada de Dados
    printf("Insira os elementos da Matriz A (4x4):\n");
    for(i = 0; i < 4; i++)
    {
        for(j = 0; j < 4; j++)
        {
            printf(

Building Java GUI Applications with AWT

Creating GUI applications using Abstract Window Toolkit (AWT) involves setting up a top-level container, adding components, arranging them with a Layout Manager, and making the container visible.

Steps to Create an AWT Application

1. Choose a Top-Level Container

The application needs a primary window to hold all components. The most common choice is the Frame class, which provides a title bar, borders, and window controls.

import java.awt.*;

// Class extends Frame to be the application window itself
public class AWTExample extends Frame {
    // Constructor and other methods
}

2. Initialize the Container (The Frame)

Inside the constructor, you set up the basic properties of the window:

• Title: Set the window

Core Database Concepts and Relational Algebra

Question 1: Cartesian Product Size

Question 1: S is a relation instance. If S has 6 tuples, how many tuples are there in the result of the following SQL query?

SELECT * FROM S S1, S S2;

Answer: 36 (Calculated as 6 * 6, representing the Cartesian product of S with itself.)

Question 2: Maximum Tuples and Primary Keys

Question 2: Let R(A, B, C, D) be a relation, where (A, B, C) is the Primary Key (PK) of R, and attribute D cannot be NULL. Assume A's domain has 5 different values, B's domain has 2, C has 4, and D has 3. What is the maximum number of tuples that can be in an instance of R?

Answer: 40 (Calculated as 5 * 2 * 4. The maximum number of tuples is determined by the product of the domain sizes of the... Continue reading "Database Fundamentals: SQL Queries and Relational Concepts" »

Java File Copy Program

This simple Java program demonstrates how to read data from one file and write it to another.

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;

public class FileCopy {
    public static void main(String[] args) {
        String sourceFile = "input.txt";
        String destinationFile = "output.txt";
        try {
            FileReader fr = new FileReader(sourceFile);
            FileWriter fw = new FileWriter(destinationFile);
            int character;
            while ((character = fr.read()) != -1) {
                fw.write(character);
            }
            fr.close();
            fw.close();
            System.out.println("File copied successfully.");
        } catch (IOException

1. Anagram Detection: C++ String Comparison

This C++ program determines if two input strings are anagrams of each other. It achieves this by converting both strings to lowercase, sorting their characters alphabetically, and then comparing the sorted strings. If they are identical, the original strings are considered anagrams.

#include<bits/stdc++.h>
using namespace std;

int main(){
    string s2,s1;
    cin>>s1>>s2;
    transform(s1.begin(),s1.end(),s1.begin(),::tolower);
    transform(s2.begin(),s2.end(),s2.begin(),::tolower);
    sort(s1.begin(),s1.end());
    sort(s2.begin(),s2.end());
    cout<< (s2==s1);
}

2. Array Subarray: C++ Sliding Window Minimum

This C++ program attempts to find the maximum of minimums within... Continue reading "C++ & C Programming Solutions: Algorithms & Patterns" »

Understanding Synchronization

Synchronization ensures the correct ordering of instructions across threads. It relies on hardware support to achieve two primary concurrency objectives:

• Mutual Exclusion: Solved using locks.
• Ordering: Solved using locks and semaphores.

A condition variable acts as a queue for waiting threads. Maintain state alongside condition variables; they are used to signal threads when state changes. If the state is already as needed, the thread does not wait for a signal. Whenever a lock is acquired, recheck assumptions about the state. Some libraries experience spurious wakeups, where multiple threads may wake up unexpectedly. To wake the right thread, use specific condition variables per condition rather than waking all threads.... Continue reading "Mastering Multithreading: Synchronization and Concurrency" »

1. Infix to Postfix Conversion

#include <stdio.h>
#include <conio.h>
#include <ctype.h>

char stack[20];
int top = -1;

void push(char x) { stack[++top] = x; }
char pop() { return stack[top--]; }

int priority(char x) {
    if (x == '(') return 0;
    if (x == '+' || x == '-') return 1;
    if (x == '*' || x == '/') return 2;
    if (x == '^') return 3;
    return 0;
}

void main() {
    char exp[20];
    int i;
    char x;
    clrscr();
    printf("Enter Infix Expression: ");
    scanf("%s", exp);
    printf("Postfix Expression: ");
    for (i = 0; exp[i] != '\0'; i++) {
        if (isalnum(exp[i])) printf("%c", exp[i]);
        else if (exp[i] == '(') push(exp[i]);
        else if (exp[i] == ')') {
            while ((x =

Java Programming Examples

This collection provides fundamental Java code snippets demonstrating core concepts such as classes, arrays, interfaces, and data structures.

1. Employee Salary Management

This example demonstrates how to manage employee data using an array of objects and basic arithmetic calculations.

import java.util.Scanner;

class Emp {
    private int id;
    private String name;
    private double sal, pf, hra;

    void set(int i, String n, double s, double p, double h) {
        id = i; name = n; sal = s; pf = p; hra = h;
    }

    void display() {
        double total = sal + hra - pf;
        System.out.println(id + " " + name + " Total: " + total);
    }
}

public class Main {
    public static void main(String[] args) {

File Operations

• ls — List files and directories (-a for hidden, -l for detailed)
• cd [directory] — Change directory
• mkdir [directory] — Create directory
• cp [source] [destination] — Copy files/directories (-r for recursive)
• mv [source] [destination] — Move or rename files/directories
• rm [file] — Remove files (-r for recursive)
• chmod [permissions] [file] — Change file permissions
• chown [user]:[group] [file] — Change file ownership

System Monitoring

• top / htop — Monitor system processes
• ps — List running processes
• df -h — Display disk space usage
• free -m — Show memory usage

Networking Commands

• ifconfig / ip a — Display network interfaces
• ping [host] — Test network connectivity
• netstat -tuln — List network connections
• nmap [IP] — Scan

Objective

To implement robust cloud-native security controls, including Encryption, Access Management, and Network Security.

Core Security Principles

• Encryption: Protects data at rest (stored) and in transit (moving).
• Access Management (IAM): Ensures the Principle of Least Privilege by managing user roles and Multi-Factor Authentication (MFA).
• Network Security: Uses VPCs, Firewalls, and DDoS protection to isolate resources and filter malicious traffic.

Implementation Procedure

1. Data Encryption

• At Rest: Use services like AWS KMS, Google KMS, or Azure Key Vault to manage cryptographic keys. Enable encryption on storage buckets (S3/Blob) and use Transparent Data Encryption (TDE) for databases.
• In Transit: Force HTTPS/TLS protocols for all web traffic.