Flashcards
08227 Flash Card
Cards in this deck (18)
- 1Shifting- ◦The two > symbols mean shift right, the number is how far to shift (i.e. >>8 shifts by 8 bits).
- The same as dropping the last/first bit and sticking a 0 on the left/right end. - 2Masking◾A bit is one in the result if only the corresponding bits in both operands are one. (the bits that are ones in the mask will show in the result)
- Uses the bitwise AND operation written as &
- 1 * 0 = 0, 1 * 1 = 1 - 3Stack•The stack stores information about active functions/procedures/methods. The main method is the first method to use it.
•Main reason for having a stack is to keep track of the point to which each active subroutine should return control when it finishes executing. - 4Stack Process◦When a function is called, the caller pushes the return address onto (top of) the stack,
◦When it finishes, it pulls or pops the return address of the call stack and transfers control to that address (Moving the EIP (instruction pointer) towards the old EBP(Base Pointer)).
◾If another function is called within that function, it will push another return address onto the call stack and so on..
◾if the pushing consumes all the space allocated for the call stack; stack overflow error blows up the program. - 5Trees1-n relationship between elements, each element has possibly n children, every element has only one parent
- 6Lists1-1 relationship between elements, each element has one next element (or one prior element).
- 7Graphn-n relationship between elements, each element can be related to possibly every other element and vice versa.
- 8Multiple indexes◦Can be created to give access to complex records based on several different field values
◦each index may be arranged/sorted differently, while bulk data need not be specifically sorted - 9Hash tablesA data structure that uses a random access data structure such as an array and a mapping function, called a hash function, to allow for O(1) searches
◦An array of records(or structs) - 10HashingThe process of running data through a hash function. A hash function is a mapping between a set of input values and a set of integers known as hash values.
- 11CollisionOccurs when two data elements are hashed to the same value and try to occupy the same space in the hash table; solved often by linear or quadratic probing method or by separate chaining
- 12Separate ChainingThe hash table is an array of linked lists. Data elements that hash to the same value are stored in a linked list originating from the index equivalent of their hash value.
- 13argv- argv contains any parameters that where passed to the program when it was started.
- argc holds the number of parameters passed to the whole program when started - 14Friend FunctionA way of allowing access to a member, function or class which wouldn't normally be accessible. 1) Prototype of a function can be declared as 'friend' inside a class and then that function can use private members of that class it is friends with.
- 15BufferThe instance when something is output to a file stream but not immediately written to disk
- 16FlushingWhen a buffer is written to disk.
- 17Volatile ModifierVolatile indicates that the object may be changed outside of the scope of the current process.
- 18RegisterRegister indicates that the compiler should attempt to assign the object to a register on the processor
Information
- Description
- Flashcards on 08227 Flash Card, created by Mohamed Moalin on 17/01/2015.
- Created by
- Mohamed Moalin
- Views
- 9
- Rating