Computer Engineering Archives - Student Notes

Data Structures and Algorithms Code Snippets

Posted by admin on Jan 18, 2026 in Computer Engineering | 0 comments

Data Structures and Algorithms Implementations

Merge Sort Implementation

The mergeSort method recursively divides the array and then merges the sorted halves.

public static void mergeSort(int[] array) {
    int length = array.length;
    if (length <= 1)
        return;

    int middle = length / 2;
    int[] leftArray = new int[middle];
    int[] rightArray = new int[length - middle];

    int j = 0;
    for (int i = 0; i < length; i++) {
        if (i < middle)
            leftArray[i] =

Data Structure Algorithms: Linked Lists, Trees, and Hashing

Posted by admin on Jan 18, 2026 in Computer Engineering | 0 comments

SINGLY LINKED LIST

// Insert at beginning 0

Algorithm InsertAtBeginning(data)
:1. NewNode = (Node*)malloc(sizeof(Node))2. NewNode->data = data3. NewNode->next = head4. head = newNode

// Insert at endAlgorithm InsertAtEnd(data):1. NewNode = (Node*)malloc(sizeof(Node))2. NewNode->data = data3. NewNode->next = NULL4. If head == NULL:

head = newNodeElse:temp = headWhile temp->next != NULL:temp = temp->nexttemp->next = newNode;

// Insert at position Algorithm InsertAtPos(data, pos):1.

Essential C Programming Examples: Data Structures & Algorithms

Posted by admin on Jan 16, 2026 in Computer Engineering | 0 comments

Fundamental C Operations (String and Math)

String Reversal Without Built-in Functions

This program demonstrates manual string reversal using pointers and loops, calculating the string length without relying on strlen().

#include <stdio.h>
#include <string.h>
int main() {
    char str[100], original[100];
    char *start, *end, temp;
    int length = 0;
    printf("Enter a string: ");
    scanf("%s", str); // accepts string without spaces
    strcpy(original, str); // keep a copy of original

Power BI Data Modeling: Star Schema, Normalization & KPIs

Posted by admin on Jan 15, 2026 in Computer Engineering | 0 comments

Flat Table

A Flat Table stores all data in a single table. It is simple and quick to build, making it suitable for very small or basic analyses. However, it leads to duplicated data, which increases the risk of errors and inconsistencies. As the dataset grows, performance and scalability worsen. For this reason, flat tables are not recommended for advanced or professional Power BI reports.

Relational Model

A Relational Model organizes data into multiple tables connected through keys. This structure

Data Structures and Algorithms Exam Review

Posted by admin on Jan 14, 2026 in Computer Engineering | 0 comments

1) Recurrences

1.1 10-mark: Solve T(n)=2T(n/2)+n, T(1)=c

T(n)=2T(n/2)+n
=4T(n/4)+2n
=8T(n/8)+3n
… after i steps: T(n)=2ⁱ T(n/2ⁱ) + i*n
Stop: n/2ⁱ=1 => i=log₂ n
T(n)=n*T(1) + n log₂ n = n*c + n log₂ n
=> T(n)=Θ(n log n)

1.2 Master Theorem (Write As-Is)

T(n)=aT(n/b)+f(n), compare f(n) with n^{log_b a}

Case 1: f(n)=O(n^{log_b a – ε}) => T(n)=Θ(n^{log_b a})
Case 2: f(n)=Θ(n^{log_b a} log^k n) => T(n)=Θ(n^{log_b a} log^k+1 n)
Case 3: f(n)=Ω(n^{log_b a + ε}) and a f(n/b) ≤ c f(n) (c<1) => T(n)=Θ(f(n))

2)

Essential Concepts in Statistics, Machine Learning, and Network Security