This article does not have a corresponding language version

New version found

The website seems to have new content, do you want to update?

Real Number Construction Reading Report
2023-12-272023-12-271180 words 6 mins

Real Number Construction Reading Report

Foundations of Real Numbers Book Report Taking advantage of this mathematical analysis assignment, I’d like to document the construction of real numbers. The establishment of real numbers forms part of the foundational theories in mathematics, intersecting with multiple branches such as …
2023-12-202023-12-20682 words 4 mins

The Relationship Between the Residue Theorem and Laurent Series, Higher-Order Derivative Formulas, and Cauchy's Integral Formula

1. Residue Theorem The Residue Theorem is a pivotal result in complex function theory, built upon the concept of residues. Its core idea states that if a function is analytic everywhere on and within a closed contour enclosing isolated singularities, the integral around the contour equals the sum …
2023-12-182023-12-18238 words 2 mins

The Traveler and the Flower

A lovely traveler passed by a landscape that no one appreciated. She brought with her an exotic warm breeze that swept across the parched fields, brushed the treetops, and rippled the lake into a shimmering glow. The fruit trees, utterly enchanted by this beauty, hurriedly blossomed and bore fruit; …
2023-12-152023-12-15299 words 2 mins

Independence and Mutual Independence

When I did something wrong, it didn’t feel irrevocable at the time. Eighteen years of wandering taught me that nothing is worth regretting—all outcomes, good or bad, are merely inevitable steps in the process of growth. In other words, they are predestined, they are “meant to be.” …
Data Structure Lab Report 8 - Critical Path
2023-12-122023-12-121065 words 5 mins

Data Structure Lab Report 8 - Critical Path

a. Problem Analysis In the Critical Path Method (CPM), we need to identify the critical path in a project, which is the sequence of activities that determines the project’s total duration. To solve this problem, we first construct a data structure Activity to represent project activities and …
Data Structure Lab Report 7 – Kruskal's Algorithm and the Minimum Spanning Tree Problem, Dijkstra's Algorithm and the Shortest Path Problem in Weighted Graphs
2023-12-122023-12-122301 words 11 mins

Data Structure Lab Report 7 – Kruskal's Algorithm and the Minimum Spanning Tree Problem, Dijkstra's Algorithm and the Shortest Path Problem in Weighted Graphs

Kruskal’s Algorithm for Generating Minimum Spanning Trees a Problem Analysis We need to use Kruskal’s algorithm to find the minimum spanning tree (MST) for a graph with 10 nodes and 20 edges. Kruskal’s algorithm is based on a greedy approach, constructing the MST by iteratively …
Data Structure Lab Report 6 — Threading Binary Trees with Preorder and Postorder Traversals, Adjacency Matrix and Adjacency List Storage for Graphs
2023-12-122023-12-121375 words 7 mins

Data Structure Lab Report 6 — Threading Binary Trees with Preorder and Postorder Traversals, Adjacency Matrix and Adjacency List Storage for Graphs

Threading a Binary Tree in Pre-order and Post-order a. Problem Analysis We need to implement pre-order threading of a binary tree. Threading is a method that converts null pointer fields in a binary linked list into pointers pointing to the predecessor or successor node of the current node in a …
Data Structure Lab Report 5 - Huffman Tree Encoding and Decoding, Construction and Node Deletion of Binary Search Tree
2023-12-122023-12-121436 words 7 mins

Data Structure Lab Report 5 - Huffman Tree Encoding and Decoding, Construction and Node Deletion of Binary Search Tree

Implementing Huffman Tree Encoding and Decoding a. Problem Analysis Objective: Implement Huffman tree encoding and decoding. Key Questions: Is the Huffman tree construction process correct? Are the Huffman codes generated accurately? Does the encoding and decoding process function correctly? Can …
Data Structure Lab Report 4 - Binary Tree Construction, Storage, and Traversal
2023-12-122023-12-121116 words 6 mins

Data Structure Lab Report 4 - Binary Tree Construction, Storage, and Traversal

1. Creating Binary Trees from Input: Sequential and Linked Storage a. Problem Analysis: This task requires creating a binary tree from an input character sequence, implementing two storage methods: sequential storage and linked storage. The character ‘@’ in the input sequence represents …
Data Structure Lab Report 3 – Using KMP Algorithm for String Search
2023-12-122023-12-12536 words 3 mins

Data Structure Lab Report 3 – Using KMP Algorithm for String Search

Experiment Objective: This experiment aims to analyze and test the implementation of the KMP algorithm and explore its application in string searching. Experiment Content: a. Problem Analysis: How to construct the Longest Prefix Suffix (LPS) array to improve search efficiency? How to perform …