Binary Tree Operations, Sorting Algorithms & CLL Pseudocode

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

Binary Tree Insert

1. ptr = ROOT; flag = FALSE
2. While (ptr != NULL) and (flag == FALSE) do
3.   Case: ITEM < ptr->DATA
4.     ptr1 = ptr
5.     ptr = ptr->LCHILD
6.   Case: ITEM > ptr->DATA
7.     ptr1 = ptr
8.     ptr = ptr->RCHILD
9.   Case: ptr->DATA = ITEM
10.    flag = TRUE
11.    Print "ITEM already exists"
12.    Exit
13.  EndCase
14. EndWhile
15. If (ptr == NULL) then
16.   new = GetNode(NODE)
17.   new->DATA = ITEM
18.   new->LCHILD = NULL
19.   new->RCHILD
Read More

C Programs: Tower of Hanoi and Singly Linked List

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

C Programs: Tower of Hanoi and Singly Linked List

Includes: Two C programs: a recursive Tower of Hanoi solver and a singly linked list implementation with stack demo. The original code has been preserved, formatted, and corrected for spelling, grammar, and readability.

Tower of Hanoi – C Program


#include <stdio.h>

void tower_hanoi(int n, char src, char dest, char temp) {
    if (n == 1) {
        printf("\nMove disk %d from peg %c to peg %c", n, src, dest);
        return;
    }
    tower_hanoi(
Read More

UML and System Modeling Techniques for Software Design

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

Chapter 5: System Modeling Fundamentals

System Modeling

  • System modeling is the process of developing abstract models of a system, with each model presenting a different view or perspective of that system.
  • System modeling has now come to mean representing a system using some kind of graphical notation, which is now almost always based on notations in the Unified Modeling Language (UML).
  • System modeling helps the analyst to understand the functionality of the system, and models are used to communicate
Read More

C Implementation: Circular Linked List for Polynomials

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

C Implementation: 3D Polynomials with Circular Linked Lists

This code defines structures and functions to manage multivariate polynomials (in terms of $x, y, z$) using a circular linked list to store individual terms.

Data Structure Definition

struct node {
    int coeff;
    int x_exp, y_exp, z_exp;
    struct node *next;
};

A pointer to the first term is initialized:

struct node *poly1 = NULL;

Term Insertion Function

insertTerm Function

Inserts a new term into the circular linked list. If the list is

Read More

Data Structure Algorithms: BST, Sort, and CLL Operations

Posted by on Dec 13, 2025 in Computer Engineering in Computer Engineering | 0 comments

Binary Tree Insertion

  1. ptr = ROOT, flag = FALSE
  2. While (ptr != NULL) and (flag = FALSE) do:
  • Case: ITEM < ptr→DATA
  1. ptr1 = ptr
  2. ptr = ptr→LCHILD
Case: ITEM > ptr→DATA
  1. ptr1 = ptr
  2. ptr = ptr→RCHILD
Case: ptr→DATA = ITEM
  1. flag = TRUE
  2. Print “ITEM already exists”
  3. Exit
EndWhile If (ptr = NULL) then:
  • new = GetNode(NODE)
  • new→DATA = ITEM
  • new→LCHILD = NULL
  • new→RCHILD = NULL
  • If (ptr1→DATA < ITEM) then
    • ptr1→RCHILD = new
  • Else
    • ptr1→LCHILD = new
  • EndIf
EndIf Stop

Binary Tree Deletion

  1. ptr = ROOT, flag = FALSE
  2. While
Read More

Essential Software Engineering Concepts: SQA, Agile, Testing, and Design Principles

Posted by on Nov 21, 2025 in Computer Engineering in Computer Engineering | 0 comments

Software Quality Assurance (SQA) and Its Types

What is SQA?

Software Quality Assurance (SQA) is a systematic process designed to prevent defects from happening in the first place, ensuring the final software meets required quality standards and user expectations. It covers activities like audits, reviews, and monitoring throughout the entire Software Development Life Cycle (SDLC). The main goal is to deliver reliable, efficient, and maintainable software.

Types of SQA

  • Process Assurance: Ensures the
Read More