Sources

AI sources:
  • CS188 Artificial Intelligence (UC Berkeley course)

Computer Architecture sources:
  • CS61C Machine Structures and Computer Architecture (UC Berkeley course)

Popular posts from this blog

Tips on Pointers and Arrays in C

Image
*p++ vs. (*p)++   *p++ means *(p++) ++ binds to p , not to *p ++ will increment "p," not "*p," which is the thing that "p" points to The value of the expression *p++ is the value that p pointed to before being incremented ( *p ) Two useful charts Pointer arithmetic notes (~pointer~) += (~number~);  means  (~pointer~) += ~number~) * sizeof((~type~)); Pointer arithmetic addition adds multiples of the type size to the memory address Ex. If p is a pointer to an integer, then p += 1 means p += 1 * sizeof(int)   (~pointer name~) + 1 points to the next object in memory (returns a pointer to the next element)  (~pointer name~) + i points to the i -th object beyond (~pointer name~) in memory  (~pointer name~) += i increments (~pointer name~) to point to i elements beyond itself  Types of valid pointer arithmetic Adding an integer to a pointer Subtracting 2 pointers (in the same array) Comparing...
Read more

Constraint Satisfaction Problems

Image
identification problem  - a problem in which the agent must identify whether it is a goal state or not, with no regards of how it arrives at that goal In identification problems, the goal itself it important, not the path of reaching the goal All paths have the same depth, which is the number of variables in the problem constraint satisfaction problem (CSP)  - an identification search problem in which each state must satisfy a number of constraints (limitations) in order to be a valid goal state In CSPs, states are partial assignments  of variables (i.e. some variables have been assigned values while others have not) constraint graph  - a graph whose nodes represent a CSP's variables and edges represent the constraints between the variables/nodes Components of a CSP variables - a set of $N$ variables ($X_1,...,X_N$) that can each take on a single value from the domain domain  - a set ${x_1,...,x_d}$ representing all possible values that a ...
Read more

Where C Variables are Stored in Memory

Image
Memory sections stack - the portion of memory that stores variables that were declared inside functions (i.e. stores local variables and constants) local variables are freed when the function returns (these variables cannot be accessed once the function ends) Stack memory grows downward heap - the portion of memory that stores things that were created by malloc() Data on the heap persists across functions (unlike the local variables of stack memory) Heap memory grows upward static - the portion of memory that stores "pre-allocated" variables including static and global variables (variables declared outside functions), constants, and string literals  Two sections of static memory:  read-only (stores variables that can only be read and not modified) read-write (stores variables that can be both read and written to (modified)) Static memory does not grow or shrink code (text) - the portion of memory that stores the executable instructions and constants C...
Read more