Freaks City

Unary Operators The bitwise NOT operator (~) performs a one's complement operation, flipping all bits in the binary representation. Since C stores signed integers using two's complement, applying ~ to zero yields -1: #include <stdio.h> int main() { int val = 0; int result = ~val; printf("%d\n", result); // Outputs: ...

In academic institutions, courses often have prerequisite dependencies. For instance, a course like Data Structures may require students to complete Introduction to Programming and Discrete Mathematics first. The challenge is to determine a valid sequence for scheduling all courses such that no course is taken before its prerequisites. This pro ...

Trimming a Binary Search Tree The task involves removing nodes from a binary search tree (BST) such that every remaining node's value falls within a specified range [low, high]. If the root node falls outside this range, the structure of the tree must be adjusted, potentially returning a new root. struct TreeNode* prune_bst(struct TreeNode* nod ...

Naive Linear Scan with Manual Shift This method iterates through the collection, identifying target values and shifting remaining items leftward to fill gaps. Each removal triggers a backward propagation of elements, resulting in quadratic time complexity. #include <stdio.h> int strip_target(int* arr, int capacity, int target) { int ...

Data Type Categories Integer Family Unsigned data types utilize all bits for value storage. Floating-Point Family Composite Types Other Types Arrays can modify they element types and sizes as needed. Integer Storage in Memory Original, Inverse, and Complement Codes Original code represents the true value of data. Integers are stored as compleme ...

Statement Categories C programs consist of several statement types: Expression statements Function call statements Control flow statements Compound statements (blocks) Null statements Control flow statements include decision-making (branching) and iteration (looping) constructs. Branching relies on if and switch, while loops are implemented v ...

Data Flow Diagrams and Structured Analysis When constructing data flow diagrams (DFDs), several key principles must be followed: Each process requires both input and output data flows. Data flows can only connect to processes—either from a source to a process, or from a process to a sink. All data flows and data stores must have definitions in ...

Merge Sort for Singly Linked Lists When dealing with singly linked lists, Merge Sort is often the preferred sorting algorithm due to its O(n log n) time complexity and efficiency in sequential data structures. Unlike arrays, linked lists do not allow random access, which makes algorithms like QuickSort less efficient. The core logic relies on t ...

Character pointers extend beyond simple variable addressing to handle string literals efficiently. When assigning a string literal to a pointer, the memory address of the first character is stored. Since string literals reside in read-only memory, qualifying the pointer with const prevents accidental modification. #include <stdio.h> int ...

Function Assembly Patterns int add_values(int a, int b) { return 0; } Assembly implementation follows stack-based parameter passing from right to left, with return values stored in EAX. EBP represents the stack base pointer, while ESP tracks the stack top. Variable Types Global Variables Memory address and size determined during compilati ...