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

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

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.

Core Java Programming Concepts Explained

Key Java Definitions

• Exception: An event that disrupts the normal flow of a program's instructions.
• Thread: A lightweight subprocess enabling multitasking within a program.
• Event Handling: Implemented using listeners and event classes that respond to user actions.
• Applet: A small Java program embedded in a web page for interactive content.
• Remote Applets: Used to download and execute applets from a web server over the internet.
• Applet Parameters: Passed to applets using <PARAM> tags in HTML, accessed via the getParameter() method.
• Daemon Thread: Runs in the background for services like garbage collection and ends when main threads finish.
• Thread Synchronization Advantages:
  • Prevents thread interference.
  • Ensures

SystemVerilog Fundamentals

• logic Data Type: Supports 4 states (0, 1, X, Z).
• Legacy Types: Replace old Verilog reg/wire with logic in SystemVerilog (SV).

• Always Blocks

  • Combinational Logic: always_comb begin ... end
  • Sequential Logic: always_ff @(posedge clk or posedge rst) begin ... end

• Assignments

  • Blocking Assignment (=): Sequential execution. Use in combinational logic (always_comb).
  • Non-blocking Assignment (<=): Parallel execution. Essential for sequential logic (always_ff).

• Module Definition Example

  module m(input logic a, b, output logic y);
  assign y = a & b;
  endmodule

• Concatenation: {a, b, c}
• Replication: {8{in[7]}} (Repeats the specified bit 8 times, often used for sign extension).

Testbench Development

• Instantiate the Device Under Test (DUT) inside

Palindrome and Digit Sum Calculation

#include <iostream>
using namespace std;
int main() {
    int n, r, rev = 0, sum = 0, t;
    cin >> n; t = n;
    while (n) {
        r = n % 10;
        rev = rev * 10 + r;
        sum += r;
        n /= 10;
    }
    cout << (t == rev ? "Palindrome" : "Not");
    cout << "\nSum=" << sum;
}

Matrix Addition in C++

#include <iostream>
using namespace std;
int main() {
    int a[10][10], b[10][10], c[10][10], r, col;
    cin >> r >> col;
    for (int i = 0; i < r; i++)
        for (int j = 0; j < col; j++) cin >> a[i][j];
    for (int i = 0; i < r; i++)
        for (int j = 0; j < col; j++) cin >> b[i][j];
    for (int i = 0; i < r; i+

Understanding Servlet Architecture for Java Web Applications

Servlet architecture is a core component of Java EE (Enterprise Edition) used for building dynamic web applications. A Servlet is a Java class that runs on a web server and acts as a middle layer between client requests (typically from a browser) and server responses (usually from a database or application logic).

What is a Servlet?

A Servlet is a Java class used to handle HTTP requests and responses in web applications. It runs on a server, receives requests from a client (usually a browser), processes them (e.g., reads form data, interacts with a database), and sends back a dynamic response (like HTML or JSON).

Key Components of Servlet Architecture

• Client (Browser): Sends an HTTP request