Thomas
Haiden
Computer Science student at FH Wr. Neustadt. Born in Austria, focused on C, C++, and elegant system architecture.
Get in touch ->
PHASE: v3.0 [CURRENT]
ACADEMIC_MASTER
Sept 2025 — 2027
BSc Computer Science
University of Applied Sciences Wr. Neustadt
PHASE: v2.5
PROF_INSTANCE
Oct 2024 — June 2025
Civil Service
Immigration & Asylum (Wr. N.)
PHASE: v2.2
PROF_INSTANCE
Summer 2022 & 2023
Front Office
Parkhotel Hirschwang
PHASE: v2.0
ACADEMIC_MODULE
2019 — 2024
Tourism Mgmt.
Semmering — Event & Sales
PHASE: v1.0
ACADEMIC_MODULE
2015 — 2019
Middle School
NMS Schöllerstraße
ID: 0x01
C / C++
Core systems and memory-efficient programming. Architecting at the metal.
ID: 0x02
SQL
SELECT * FROM architecture WHERE efficiency > 99;
_
Database architecture and relational logic. Complex query optimization.
ID: 0x03
Hardware
SYSTEM OK
PC diagnostics and component logic.
ID: 0x04
English
C1/C2 Fluent — Negotiation level.
ID: 0x05
Spanish
A2 Basic — Foundational language.
0x06: COMING SOON...
03 / ENCRYPTED UPLINK
NODE: 0x01
UPLINK_HUB
thomashaiden17@gmail.com
NODE: 0x02
DATA_REPO
GITHUB / tomsliikee
NODE: 0x03
GEO_ZONE
AUSTRIA
BST [0]
LINKED LIST [1]
STACK [2]
HASH [3]
QUEUE [4]
// --- BINARY SEARCH TREE ---
struct Node* search(struct Node* root, int key) {
if (root == NULL || root->key == key) return root;
if (root->key < key) return search(root->right, key);
return search(root->left, key);
}
// --- LINKED LIST ---
void push(struct Node** head, int val) {
struct Node* new_node = malloc(sizeof(struct Node));
new_node->data = val;
new_node->next = (*head);
(*head) = new_node;
}
// --- STACK POP ---
int pop(struct Stack* stack) {
if (isEmpty(stack)) return INT_MIN;
return stack->array[stack->top--];
}
// --- HASH FUNCTION ---
unsigned int hash(char *str) {
unsigned int h = 5381;
int c;
while ((c = *str++)) h = ((h << 5) + h) + c;
return h;
}
// --- QUEUE ENQUEUE ---
void enqueue(struct Queue* q, int k) {
struct QNode* temp = newNode(k);
if (q->rear == NULL) {
q->front = q->rear = temp;
return;
}
q->rear->next = temp;
q->rear = temp;
}
// --- REPEATING FOR WATERFALL EFFECT ---
struct Node* search(struct Node* root, int key) {
if (root == NULL || root->key == key) return root;
if (root->key < key) return search(root->right, key);
return search(root->left, key);
}
// --- BINARY SEARCH TREE ---
struct Node* search(struct Node* root, int key) {
if (root == NULL || root->key == key) return root;
if (root->key < key) return search(root->right, key);
return search(root->left, key);
}
// --- LINKED LIST ---
void push(struct Node** head, int val) {
struct Node* new_node = malloc(sizeof(struct Node));
new_node->data = val;
new_node->next = (*head);
(*head) = new_node;
}
// --- STACK POP ---
int pop(struct Stack* stack) {
if (isEmpty(stack)) return INT_MIN;
return stack->array[stack->top--];
}
// --- HASH FUNCTION ---
unsigned int hash(char *str) {
unsigned int h = 5381;
int c;
while ((c = *str++)) h = ((h << 5) + h) + c;
return h;
}
// --- QUEUE ENQUEUE ---
void enqueue(struct Queue* q, int k) {
struct QNode* temp = newNode(k);
if (q->rear == NULL) {
q->front = q->rear = temp;
return;
}
q->rear->next = temp;
q->rear = temp;
}
// --- REPEATING FOR WATERFALL EFFECT ---
struct Node* search(struct Node* root, int key) {
if (root == NULL || root->key == key) return root;
if (root->key < key) return search(root->right, key);
return search(root->left, key);
}