Tag: c programming

~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰𝑰𝑰

In a linear time scenario, the time taken to complete a task grows with the size of the input. Like avoiding pesky questions at a big family gathering, each relative must be checked before finding the relative of interest. Similarly, in algorithms, checking each element in a list one by one creates a linear relationship. As datasets grow, efficient algorithms become crucial.

Read More ~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰𝑰𝑰

~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰𝑰

O(logn) indicates logarithmic time complexity, where the algorithm’s efficiency grows as the problem size reduces. For instance, in a sorted list search, you progressively eliminate half the list at each step, akin to finding a word in a dictionary by halving the search space. Various examples illustrate logarithmic time complexity, emphasizing its efficiency for large datasets.

Read More ~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰𝑰

~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰

Big O Notation provides a way to describe how the performance of an algorithm changes with input size, offering a worst-case scenario. O(1) represents constant time, where the algorithm takes the same amount of time regardless of input size. Examples include accessing array elements by index, swapping numbers, and inserting nodes in a linked list.

Read More ~~~ 𝑻𝒉𝒆 π‘Ίπ’†π’“π’Šπ’†π’” 𝒐𝒇 π‘©π’Šπ’ˆ 𝑢 ~~~𝑷𝒂𝒓𝒕 – 𝑰

𝑾𝒉𝒂𝒕 π’Šπ’” 𝒂 𝑹𝒂𝒄𝒆 π‘ͺπ’π’π’…π’Šπ’•π’Šπ’π’? 𝑫𝒐𝒆𝒔 π’Šπ’• π’“π’†π’‚π’π’π’š π’Žπ’‚π’•π’•π’†π’“?

A race condition in software occurs when multiple processes try to access shared resources simultaneously, leading to unpredictable outcomes. An example is the Therac-25 radiation therapy machine incidents in the 1980s, where a race condition in the machine’s software led to patients receiving massive overdoses of radiation, highlighting the critical need for thorough software testing and safety standards.

Read More 𝑾𝒉𝒂𝒕 π’Šπ’” 𝒂 𝑹𝒂𝒄𝒆 π‘ͺπ’π’π’…π’Šπ’•π’Šπ’π’? 𝑫𝒐𝒆𝒔 π’Šπ’• π’“π’†π’‚π’π’π’š π’Žπ’‚π’•π’•π’†π’“?

Β π‘­π’†π’˜ 𝑰𝑷π‘ͺ π‘΄π’†π’„π’‰π’‚π’π’Šπ’”π’Žπ’” π’Šπ’ π‘³π’Šπ’π’–π’™

Pipes, FIFOs, and message queues are inter-process communication mechanisms. Pipes enable unidirectional data flow between related processes, while FIFOs allow communication between unrelated processes. Message queues provide message boundaries and message type selection. Each mechanism offers unique functions for creating, sending, receiving, and controlling communication.

Read More Β π‘­π’†π’˜ 𝑰𝑷π‘ͺ π‘΄π’†π’„π’‰π’‚π’π’Šπ’”π’Žπ’” π’Šπ’ π‘³π’Šπ’π’–π’™

Peeking Into The Assembly

Assembly is tough. How does the processing of c code takes place in assembly? What are the kinds of instructions that we could see? What is actually happening in this gigantic mesh of lines? This is my small step to look into the assembly code of a small program/ replicating a small segment of code […]

Read More Peeking Into The Assembly