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

C Socket Server Implementation

#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <unistd.h>
#include <arpa/inet.h>

#define PORT 8080
#define BUFFER_SIZE 1024

int main() {
    int server_fd, new_socket;
    struct sockaddr_in address;
    int addrlen = sizeof(address);
    char buffer[BUFFER_SIZE] = {0};

    if ((server_fd = socket(AF_INET, SOCK_STREAM, 0)) == 0) {
        perror("socket failed");
        exit(EXIT_FAILURE);
    }

    address.sin_family = AF_INET;
    address.sin_addr.s_addr = INADDR_ANY;
    address.sin_port = htons(PORT);

    if (bind(server_fd, (struct sockaddr *)&address, sizeof(address)) < 0) {
        perror("bind failed");
        exit(EXIT_FAILURE);
    }

Manual Installation:
Current State (Tests are Conducted in ESXi5):

1. Download OmniOS (Bloody or Stable)
2a. Option: Run on ESXi, create a new VM (Solaris 10-64) with e1000 or install on hardware (15 GB disk minimum)

2b. Run on Hardware:
You can install Omni + Napp-IT onto SATA or fast USB sticks >=16 GB (absolute minimum=8 GB when needed).
If you use USB, the best are external USB3 enclosures with a SATA SSD >=16 GB inside.
(Prefer USB3; they are mostly even faster on USB2)

3. Install with defaults from CD or USB install media, login as root (no password)

4. Setup Network. Network is set to (by default): network/physical:default,
so login as root (no password)

4.1 Create Interface
- List available interfaces and use link name, e.g., e1000g0:
dladm... Continue reading "Step-by-Step Installation of OmniOS with Napp-IT" »

Core Concepts in Compiler Design

Compiler

Compiler: Translates entire source code to target code before execution. It requires a full parse and upfront error checking, then executes the generated target code.

Interpreter

Interpreter: Executes source code incrementally (line-by-line or statement-by-statement). It translates and executes on the fly, and may partially execute ill-formed programs until an error is encountered.

LVar vs. x86 Architecture

LVar: Features nested expressions, implicit control flow (represented by an Abstract Syntax Tree - AST), and an unlimited number of logical variables.

x86: Characterized by flat instructions, atomic operands (registers/memory), explicit control flow (jumps), and a limited set of registers. Compilation passes... Continue reading "Core Concepts in Compiler Design and Language Runtime" »

NLTK Text Processing Examples

Experiment 4: Basic Text Preprocessing

This section demonstrates fundamental text preprocessing steps using NLTK, including tokenization, stop word removal, filtering for alphabetic tokens, and stemming.

import nltk
from nltk.corpus import stopwords
from nltk.tokenize import word_tokenize
from nltk.stem import PorterStemmer
from nltk.corpus import words

text = "Random sampling is a method of choosing a sample of observations from a population to make assumptions about the population"

tokens = word_tokenize(text)
stop_words = set(stopwords.words('english'))
stemmer = PorterStemmer()

# 1. Lowercase and filter for alphabetic tokens
alpha_tokens = [token.lower() for token in tokens if token.isalpha()]

# 2. Filter

Algorithm Implementations in C#

Coin Change: Number of Ways

Calculates the number of ways to make change for amount N using given coin denominations.

• Time Complexity: O(N * C), where C is the number of coins.
• Space Complexity: O(N).

static long GetNumberOfWays(long N, long[] Coins)
{
    long[] ways = new long[(int)N + 1];
    ways[0] = 1;
    for (int i = 0; i < Coins.Length; i++)
    {
        for (int j = 0; j < ways.Length; j++)
        {
            if (Coins[i] <= j)
            {
                ways[j] = ways[j] + ways[(int)(j - Coins[i])];
            }
        }
    }
    return ways[(int)N];
}

Coin Change: Minimum Number of Coins

Determines the minimum number of coins needed to make change for a given amount.

• Time Complexity: O(

Introduction to OOP Concepts

This document presents practical code examples demonstrating fundamental Object-Oriented Programming (OOP) concepts in both Delphi (Pascal) and C++. It covers class definitions, object instantiation, properties, events, static members, inheritance, polymorphism, memory management, and exception handling.

Delphi Object-Oriented Programming

The following Delphi code illustrates the creation of classes, properties, events, and static members, along with their usage in a console application.

program Cheat;
{$APPTYPE CONSOLE}

uses
  SysUtils, Classes;

type
  TNotify = procedure(Sender: TObject) of object;

  TEngine = class
    procedure Start;
    begin
      Writeln('Engine Started');
    end;
  end;

  TCar = class

C Linked List Implementations for Student Data

This document presents two distinct C language implementations for managing student records using linked lists: a singly linked list and a circular linked list. Both examples demonstrate fundamental data structure operations such as adding, deleting, searching, and displaying student information.

1. Singly Linked List Implementation

This section details a student management system built using a singly linked list. Students are stored in ascending order of their roll numbers, and duplicate roll numbers are prevented.

Core Structure and Global Head

The Student structure defines the data for each node, including roll number, total marks, average, and a pointer to the next student. The head pointer always... Continue reading "C Linked List Student Data Management Systems" »

C++ Pointer and Array Operations

This collection demonstrates fundamental C++ techniques for handling pointers, arrays, and memory management.

Core Functions

void squareByPointer(int* n) { 
    *n = (*n) * (*n);
}

void capitalizeFirst(char* word) { 
    word[0] = toupper(word[0]);
}

void fillWithSquares(int* arr, int size) {
    for (int i = 0; i < size; i++)
        arr[i] = i * i;
}

int sumArray(const int* arr, int size) {
    int sum = 0;
    for (int i = 0; i < size; i++)
        sum += arr[i];
    return sum;
}

void swap(int& a, int& b) {
    int temp = a;
    a = b;
    b = temp;
}

int* makeFilledArray(int size, int val) {
    int* arr = new int[size];
    for (int i = 0; i < size; i++)
        arr[i] = val;
    return

C++ Recursive Function Examples

countUp — Print Increasing Numbers

#include <iostream>
using namespace std;

void countUp(int n) {
    if (n == 0) return;
    countUp(n - 1);
    cout << n << " ";
}

int main() {
    int n;
    cout << "Enter a positive integer: ";
    cin >> n;
    countUp(n);
    return 0;
}

summation — Sum of 1 to n

#include <iostream>
using namespace std;

int summation(int n) {
    if (n == 0) return 0;
    return n + summation(n - 1);
}

int main() {
    int n;
    cout << "Enter a positive integer: ";
    cin >> n;
    cout << summation(n);
    return 0;
}

power — Exponentiation (Recursive)

#include <iostream>
using namespace std;

int power(int n, int e)

Journaling Motivation and Necessity

File System Check (FSck) ensures metadata consistency after crashes but is slow and requires deep file system knowledge. Recovery time should ideally depend on the number of recent writes.

File System Transactions and ACID Properties

Transactions provide ACID guarantees:

• Atomicity
• Consistency
• Isolation
• Durability

These are used to treat file system operations (like file creation) as transactions. Recovery ensures committed transactions are applied and uncommitted ones are discarded.

ext3 Journaling File System

ext3 is a journaling file system using physical redo logging, adding journaling to existing ext2 structures.

Redo Logging Mechanism in ext3

The process involves writing updates to a journal first, then committing... Continue reading "File System Journaling: Mechanisms, ext3, and NTFS Recovery" »