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

Talking of Books and 2017

Originally posted on Its PH:
Yayy!  and here is why! I know 20 is lot less but with the workload and things that go into my plate, I am pretty excited to complete my Goodreads 2017 challenge. Here is how I am going to put the 20 into different buckets! Bucket 01: The Top-Notch –…

General Discussions

The Celebrity Dinner

Originally posted on Its PH:
This post is written for IndiSpire Edition number 136. The prompt given is: If you had 6 chairs on your dining table, which celebrities would you invite to dinner and why? #Celebritydinner It is a warm Sunday evening, dining hall calling for a celebration. I have been waiting for my…

General Discussions

And Machines!

Originally posted on Its PH:
Its PH View original post

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

General Discussions

Literate Programming

Originally posted on PH Bytes:
If you really want to get the story of the code you write, follow literate programming for the initial few days. There is a high probability that you might continue once you are used to it which is obviously a very good programming practice.  Literate programming was introduced by Donald…

C Codes

Files in C – Sample Program

The code can also be downloaded from Github HERE. Question: Mobile Service Provider – Service Directory ====================================================== A mobile service provider maintains a minimum data service file with following details: Registration number Name Age City Of a customer for some quick information retrieval The file is named as “service.txt”. The console for this is provided… Continue reading Files in C – Sample Program