General Discussions

Knit Engine [Ver. 0.4]

After the Third version Update of my research work which was named as Knit Engine [Ver. 0.3], here is the update of next version. However nothing is made public as of yet. This release Version 0.4, saw the following changes: GUI underwent a major refinement 3000+ lines of code was added over all Two more iterations were  completed… Continue reading Knit Engine [Ver. 0.4]

General Discussions

Understanding Various Call by Mechanisms – Structures and Functions

Originally posted on PH Bytes:
The medium picked to understand the said is by the following: Passing the structure members to the function by call by value or call by reference Passing structures to functions using pass by value Passing structures to functions using pass by reference 1. Demonstrating call by value and reference when…

General Discussions

Data Structure: KeyLink

We often encounter projects and experiments where keywords are associated to the web links. For each of those keywords present in the list, one or more links are collected to gather and process the data related to it. Keylink data structure maintains a web link to every keyword present in the list. The number of… Continue reading Data Structure: KeyLink

General Discussions

Data Structure: Inventory

Inventory data structure is a makeover of a matrix data structure. Often we encounter tasks where we have keywords and their associated properties. Consider like we have 5 items and each item has associated 10 properties, we want to put them in a table and then perform some operations on it.  A matrix is too… Continue reading Data Structure: Inventory

General Discussions

Static V/S Dynamic Memory Allocation

Originally posted on PH Bytes:
? Si. No Static Memory Allocation Dynamic Memory Allocation 1 Memory allocation happens at compile time Memory allocation happens at Run time 2 It applies to global variables, file scope variables, and variables qualified with static defined inside functions It applies to variables that allocate memory during runtime using memory allocation…

General Discussions

Prim’s and Kruskal’s Algorithm

Prim Kruskal Grows with minimum cost vertex Grows with minimum cost edge If we stop in the middle, Prim always generates connected trees If we stop the algorithm in the middle, Kruskal can give a disconnected tree or forest Need not give attention on cycle check Need to give attention on cycle check Graph must… Continue reading Prim’s and Kruskal’s Algorithm