# Author Archives

Aditya Prakash is a Sr. Software Engineer having 8+ yrs of experience with a strong emphasis on programming languages like C, C++, and Python on a Linux platform and worked on multiple products on Network Security and Telecom Domain.

He holds a degree in Computer Science Engineering and Diploma in Software System Development from CDAC, Bangalore and
also is a Cisco Certified Network Associate(CCNA) Certified Network Engineer.

• #### To get a particular bit from a number

This program is to get a particular bit from a number To solve this problem we will be taking two approach: First Approach:Right shift the number by that bit, and(&) that 1. If the result is 1 means that bit… Read More ›

• #### To count number of bit set and unset

This program is for counting the number of bit set and unset. Run through each bit and increment the set count if the bit is set else increment the unset counter. Output:

• #### To check a bit is set or not

This program check whether a particular bit is set or not. In this we will be seeing three approach: Approach 1:Right shift the number by bit given, and(&) the result with 1. If the result is 1, the given bit… Read More ›

• #### User defined malloc(), calloc(), realloc() and free()

In this article we will be learning: Introduction to Heap brk() and sbrk() system call Unmapped region Dummy malloc() Organizing the Heap Memory block representation Malloc implementation calloc(), free() and realloc() implemtattaion Heap: Heap is a memory region responsible for… Read More ›

• #### Memory Allocators:brk() and sbrk()

In the memory management section we saw that there are three libraries function: malloc(), calloc() and realloc() which are responsible for managing memory dynamically. Key point to consider that above function are memory managers not memory allocators. Memory allocation is… Read More ›

• #### C interview Questions

Q.1) what do we mean by data type in C? Data types are the keywords, which are used for assigning a type to a variable or a function that is declaring a variable or a function of a specific type…. Read More ›

• #### Asymptotic Notation

When it comes to analyzing the complexity of an algorithm on the basis of time and space complexity, one can never provide an exact number to define the time and space required by an algorithm, instead we express it using… Read More ›

• #### Space Complexity

Any solution to a problem requires memory to complete its required task. For any algorithm, memory is used for the following entities: Variables be it temporary or constant. The instruction of the program. Memory is required for the execution that… Read More ›

• #### Time Complexity

Every algorithm needs some time to execute its instructions to perform the task. This computer time required is called time complexity. For a particular problem, there can be multiple solutions, which solution is chosen depends upon time and space required… Read More ›

• #### PERFORMANCE ANALYSIS OF ALGORITHM

An algorithm is a set of instructions to solve a particular problem. There can be multiple solutions for a single problem. The performance of an algorithm is determined by the resource required by an algorithm to perform a particular task…. Read More ›