Question

Explain memory allocation ,pointers,recursion and bit manipulation

Answer 1

⛤Hey There⛤
_________________________________________________


⛤Memory Allocation⛤

Dynamic memory allocation tends to be nondeterministic; the time taken to allocate memory may not be predictable and the memory pool may become fragmented, resulting in unexpected allocation failures. In this session the problems will be outlined in detail and an approach to deterministic dynamic memory allocation detailed.

⛤Pointers⛤

A pointer is essentially a simple integer variable which holds a memory address that points to a value, instead of holding the actual value itself.

The computer's memory is a sequential store of data, and a pointer points to a specific part of the memory. Our program can use pointers in such a way that the pointers point to a large amount of memory - depending on how much we decide to read from that point on.

⛤Recurision⛤


To traverse means to visit the vertices in some systematic order. preorder: visit each node before its children. postorder: visit each node after its children. inorder (for binary trees only): visit left subtree, node, right subtree. Depth first search is a way of traversing graphs, which is closely related to preorder traversal of a tree. The following programs demonstrate the DFS traversal of a tree, common tree traversals using recursion. They also demonstrate reversal of a stack and finds the length of string using recursion.

⛤Bit Manipulation⛤

There are different bitwise operations used in the bit manipulation. These bit operations operate on the individual bits of the bit patterns. Bit operations are fast and can be used in optimizing time complexity.