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

Assembly Language Fundamentals: Key Concepts and Definitions

1. Clock Frequency and Cycle Time

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle duration of $10^{-6}$ seconds (1 microsecond).

2. General-Purpose Registers (8-bit, 16-bit, and 32-bit Access)

The general-purpose registers that can be accessed in 8 bits, 16 bits, and 32 bits are: EAX, EBX, ECX, and EDX.

3. Purpose of EAX and ECX Registers

These registers serve specific roles in CPU operations:

• EAX – Accumulator: Automatically used by multiplication and division instructions. It is often referred to as the extended accumulator register.
• ECX – Loop Counter: The CPU automatically uses ECX as a counter for loop instructions.

4. Reserved Words and Identifiers

1. Create Table Coach

CoachID INT PRIMARY KEY,

CoachName VARCHAR(20) NOT NULL,

Sports VARCHAR(15) NOT NULL,

DOJ DATE NOT NULL,

Gender CHAR(1) NOT NULL,

Salary INT NOT NULL

INSERT INTO Coach (CoachID, CoachName, Sports, DOJ, Gender, Salary)

VALUES

(1001, 'Mulund Gogoi', 'Boxing', '2004-09-01', 'M', 40000),

(1002, 'Arnab Duwara', 'Karate', '1999-10-01', 'M', 60000),

(1003, 'Nayan Bora', 'Arm Wrestling', '2005-02-28', 'M', 50000),

(1004, 'Devesh Hazarika', 'Basketball', '2010-05-05', 'M', 25000),

(1005, 'Chetan Sharma', 'Swimming', '2010-03-31', 'M', 25000),

(1006, 'Lakshmi Devi', 'Boxing', '2012-01-01', 'F', 22000);

3. Queries for Questions:

a) Display the Maximum and Minimum Salary of the Coaches

SELECT MAX(Salary) AS Max_Salary, MIN(Salary) AS Min_Salary

Key Concepts in Data Science & Scientific Computing

Visualization Techniques

• Overlapping Histograms: Use semi-transparent alpha parameter for comparison.

Data Structures & Algorithms

• BFS Implementation: collections.deque is ideal for Breadth-First Search.
• Grid Representation: Obstacles often represented by a value like 1.

Jupyter Notebook & Markdown

• Markdown Headings: Use # prefix for headings in Jupyter Markdown cells.

Optimization & Least Squares

• Normal Equations: Direct matrix inversion for Least Squares: β = (XᵀX)⁻¹Xᵀy.

Numerical Integration & Simulation

• Orbit Simulation: Runge–Kutta 4th order method is a common integration technique.

Search Algorithms

• Brute-Force Search: Often implemented using nested loops.

Python Ecosystem

CPU Fundamentals and Timing

Clock Cycles and Frequency

A clock that oscillates 1 million times per second (1 MHz) produces a clock cycle of 1 microsecond (1 μs), which equals 10^-6 seconds per cycle.

Instruction Execution Pipeline

The steps for executing a machine instruction are:

1. Fetch the instruction.
2. Decode the instruction.
3. Fetch the operand (if any).
4. Execute the instruction.
5. Store the result or output.

Cache Memory Operations

Cache memory is a small, fast memory used to temporarily store frequently accessed data or instructions to speed up CPU operations.

• A cache hit occurs when the CPU finds the required data in cache memory.
• A cache miss occurs when the data is not found and must be fetched from main memory.

Assembly Language Basics

General-Purpose

Inserting the First Element into a Tree Structure

Method to add the first element (root) to a Tree Structure:

public void insertFirstNode(Object item)
{
    // If the tree is empty, the new node becomes the root of the tree
    if (theRoot == null)
    {
        Node theNewNode = new Node(item);
        theRoot = theNewNode;
    }
}

Deleting an Element from a Linked List

Method to remove an element at a specific index in a Linked List:

public void remove(int index) {
    // Special case: removing at the head of the list
    if (index == 1) {
        head = head.getNext();
    } else {
        // Find the previous and current node
        setCurrent(index);
        prev.setNext(curr.getNext());
    }
    size = size - 1;
}

Steps for Inserting an Element

🔎 Threat Actors & Their Attack Paths

Who is attacking?

Threat Actors are the people or groups launching attacks. Mnemonic: “NO HIS” (Nation-State, Organized Crime, Hacktivists, Insiders, Script Kiddies).

How do threats reach systems?

Threat Vectors are the attack paths used by threat actors. Mnemonic: “MFWDVN” (Messages, Files, Websites, Devices, Vendors, Networks).

FCFS and SJF CPU Scheduling C Program Example

Corrected and formatted C source code for FCFS and SJF scheduling.

FCFS Scheduling C Implementation

#include <stdio.h>

int FCFS() {
    int bt[15], n, i, wt[15];
    float twt = 0, tat = 0, att, awt;
    printf("\nTHE FCFS SCHEDULING\n");
    printf("Enter the number of processes: ");
    scanf("%d", &n);
    printf("Enter burst time of all the processes:\n");
    for (i = 0; i < n; i++) {
        printf("P%d: ", i + 1);
        scanf("%d", &bt[i]);
    }

    wt[0] = 0;
    // for calculating waiting time of each process
    for (i = 1; i < n; i++)
        wt[i] = bt[i - 1] + wt[i - 1];

    printf("ProcessID\tBurstTime\tWaitingTime\tTurn Around Time\n");
    for (i = 0; i <

Basic Protocol Filters

Use these filters to quickly isolate traffic based on common protocols:

• arp (Address Resolution Protocol)
• dns (Domain Name System)
• http (Hypertext Transfer Protocol)
• https (HTTP Secure)
• icmp (Internet Control Message Protocol)
• ip (Internet Protocol)
• ipv6 (Internet Protocol Version 6)
• ntp (Network Time Protocol)
• smtp (Simple Mail Transfer Protocol)
• ftp (File Transfer Protocol)
• ssh (Secure Shell)
• tls (Transport Layer Security)
• udp (User Datagram Protocol)
• tcp (Transmission Control Protocol)
• dhcp (Dynamic Host Configuration Protocol)
• bootp (Bootstrap Protocol)
• radius (Remote Authentication Dial-In User Service)
• snmp (Simple Network Management Protocol)
• kerberos
• smb (Server Message Block)
• nbns (NetBIOS Name Service)
• nbss (NetBIOS Session Service)