1) a data structure is described as this if its size can be changed actively during execution a) constructor b) pop c) dynamic d) isempty e) static f) immutable 2) a data structure is described as this if its size cannot be changed actively during execution a) isempty b) noncontiguous c) hashtable d) static e) dynamic f) immutable 3) a LIFO data structure. a) modulo b) stack c) record d) dequeue e) queue f) tree 4) a static data structure that has elements and each element has a unique integer index. a) array b) linked list c) dequeue d) dynamic e) dictionary f) record 5) a FIFO data structure a) immutable b) record c) isfull d) queue e) tree f) stack 6) a queue that accounts for insertion of data by order of the importance. a) immutable b) hashtable c) linear d) function e) circular f) priority 7) an immutable data structure, that can hold different data types. a) collision b) pointer c) tuple d) abstract e) list f) array 8) This word means the data cannot be changed during execution. a) parameters b) isfull c) immutable d) tuple e) static f) dynamic 9) A storage structure that can have different data types and is often created using classes. a) list b) pop c) hashtable d) push e) array f) record 10) An integer value that is used to lookup data in an associated index location of an array. a) pointer b) function c) dequeue d) object e) parameter f) variable 11) We describe memory as this when it is not located in a single block, but rather fragmented across RAM. a) isempty b) object c) queue d) noncontiguous e) contiguous f) heap 12) It is good practice when using a stack & queue to determine if there is any room to insert new items, if not then this specially named function should return True. a) enqueue b) stack c) isfull d) abstract e) isEmpty f) Peek 13) It is good practice when using a stack & queue is to determine if there is any data when trying to remove items, if not this special function should return True. a) collision b) isempty c) procedure d) static e) isFull f) pop 14) A function used to add items to a queue a) enqueue b) record c) linkedlist d) immutable e) push f) pop 15) A function to remove items from a queue. a) pop b) push c) parameters d) nextfree e) dequeue f) pull 16) a function used in a stack to remove the data from the top of it. a) hashvalue b) queue c) immutable d) pop e) push f) peek 17) a function used to put things onto the top of the stack. a) push b) record c) queue d) nextfree e) pop f) peek 18) a circular queue relies on this operator to generate the wrap-around of indexes. a) push b) parameters c) modulo d) isempty e) DIV f) EXP 19) this type of subroutine returns a value. a) modulo b) function c) record d) queue e) parameter f) procedure 20) this type of subroutine doesn't return a value. a) static b) push c) procedure d) noncontiguous e) function f) pop 21) The method that always gets called when you create a new object of type class. a) hashtable b) constructor c) procedure d) modulo e) initiator f) instantiation 22) a new instance of a class. a) pointer b) static c) object d) enqueue e) class f) child 23) When a data structure is homogeneous, this means... a) only a single data type is supported b) multiple data types are supported c) the data structure can grow d) the data structure is fixed e) data cannot be deleted f) data cannot be changed 24) When a data structure is heterogeneous, this means... a) only a single data type is supported b) multiple data types are supported c) the data structure can grow d) the data structure is fixed e) data cannot be deleted f) data cannot be changed

Data Structures - Arrays, Lists, Queues, Stacks, Tuples, Dict

Εκτύπωση
Ενσωμάτωση

Κατάταξη

Οπτικό στυλ

Επιλογές

Αλλαγή προτύπου

Επαναφορά αυτόματα αποθηκευμένου: ;