CSCI-UA 102 Lecture Notes - Lecture 13: Pseudocode, Hexadecimal, Null Pointer
22 Jul 2021
School
Department
Course
Professor
Document Summary
Organize class notes: notes, code implement/understand, hw questions, practice ex, Implement important codes from slides to understand. *write down pseudocode that implements breadth first traversal. Decide structure going to use to implement it (queue) *t= what is in the drawer q is pointer to place with x inside- q=&x. Variable points to space in memory- when u save to that variable, it goes to that portion of the memory. Day today = sun (type = day, not string or int) Pointer to c2 and need 1st floor: c2 -> 1st floor a pointer that points to a class or structure. C2 is a class and need 1st floor: c2. 1st floor int t (third box) = *p; *q = t; ( assign to value of q to p) = is assign, not equal to. Moving it in memory (function takes copy and operates on the copy, does not operate on the thing itself)
