a data structure is described as this if its size can be changed actively during execution, constructor, pop, dynamic, isempty, static, immutable, a data structure is described as this if its size cannot be changed actively during execution, isempty, noncontiguous, hashtable, static, dynamic, immutable, ADT stand for ........ data types. It means the details of how the data is stored and managed are hidden from the user. , abstract, allure, anticollision, procedure, aided, alldata, a LIFI data structure., modulo, stack, record, dequeue, queue, tree, a static data structure that has elements and each element has a unique integer index., array, linked list, dequeue, dynamic, dictionary, tree, a FIFO data structure, immutable, record, isfull, queue, tree, stack, a queue that accounts for insertion of data by order of the importance., immutable, hashtable, linear, function, circular, priority, an immutable data structure, that can hold different data types., collision, pointer, tuple, abstract, list, array, This word means the data cannot be changed during execution., parameters, isfull, immutable, tuple, static, dynamic, A storage structure that can have different data types and is often created using classes., list, pop, hashtable, push, array, record, An integer value that is used to lookup data in an associated index location of an array., pointer, function, dequeue, object, parameter, variable, The pointers name often used to determine where to put the next data when adding to a linked list, arguments, top, immutable, priority, empty, nextFree, A data structure that each node uses a pointer to point to the next nodes location, object, dequeue, pop, linkedlist, queue, stack, We describe memory as this when it is not located in a single block, but rather fragmented across RAM., isempty, object, queue, noncontiguous, contiguous, heap, It is good practice when using a stack, queue or linked list is to determine if there is any room to insert new items, if not then this specially named function should return True., enqueue, stack, isfull, abstract, isEmpty, Peek, It is good practice when using a stack, queue or linked list is to determine if there is any data when trying to remove items, if not this special function should return True., collision, isempty, procedure, static, isFull, pop, A function used to add items to a queue, enqueue, record, linkedlist, immutable, push, pop, A function to remove items from a queue., pop, push, parameters, nextfree, dequeue, pull, A value that is generated from the data itself [2 words], push, hashvalue, enqueue, queue, digest, encrypt, A table that has data inserted in it based on the hash value that data creates and therefore it is easy to retrieve.  , parameters, hashvalue, priority, hashtable, tuple, stack, when two different pieces of data create the same hash value and we try to insert it in a hash table we call it a ........., function, noncontiguous, collision, arguments, crash, bang, a function used in a stack to remove the data from the top of it., hashvalue, queue, immutable, pop, push, peek, a function used to put things onto the top of the stack., push, record, queue, nextfree, pop, peek, a circular queue relies on this operator to generate the wrap-around of indexes., push, parameters, modulo, isempty, DIV, EXP, this type of subroutine returns a value., modulo, function, record, queue, parameter, procedure, this type of subroutine doesn't return a value., static, push, procedure, noncontiguous, function, pop, The method that always gets called when you create a new object of type class., hashtable, constructor, procedure, modulo, initiator, instantiation, a new instance of a class., pointer, static, object, enqueue, class, child, the things that get passed to a subroutine., isfull, dynamic, arguments, linkedlist, parameters, reference, arguments once passed to a subroutine become these within the subroutine , arguments, parameters, procedure, immutable, constants, variables.

Data Structures part 1

by
Print
Embed

Leaderboard

Visual style

Options

Switch template

Continue editing: ?