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) ADT stand for ........ data types. It means the details of how the data is stored and managed are hidden from the user.  a) abstract b) allure c) anticollision d) procedure e) aided f) alldata 4) a LIFI data structure. a) modulo b) stack c) record d) dequeue e) queue f) tree 5) 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) tree 6) a FIFO data structure a) immutable b) record c) isfull d) queue e) tree f) stack 7) 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 8) an immutable data structure, that can hold different data types. a) collision b) pointer c) tuple d) abstract e) list f) array 9) This word means the data cannot be changed during execution. a) parameters b) isfull c) immutable d) tuple e) static f) dynamic 10) 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 11) 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 12) The pointers name often used to determine where to put the next data when adding to a linked list a) arguments b) top c) immutable d) priority e) empty f) nextFree 13) A data structure that each node uses a pointer to point to the next nodes location a) object b) dequeue c) pop d) linkedlist e) queue f) stack 14) 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 15) 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. a) enqueue b) stack c) isfull d) abstract e) isEmpty f) Peek 16) 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. a) collision b) isempty c) procedure d) static e) isFull f) pop 17) A function used to add items to a queue a) enqueue b) record c) linkedlist d) immutable e) push f) pop 18) A function to remove items from a queue. a) pop b) push c) parameters d) nextfree e) dequeue f) pull 19) A value that is generated from the data itself [2 words] a) push b) hashvalue c) enqueue d) queue e) digest f) encrypt 20) A table that has data inserted in it based on the hash value that data creates and therefore it is easy to retrieve.   a) parameters b) hashvalue c) priority d) hashtable e) tuple f) stack 21) 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 ......... a) function b) noncontiguous c) collision d) arguments e) crash f) bang 22) 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 23) a function used to put things onto the top of the stack. a) push b) record c) queue d) nextfree e) pop f) peek 24) 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 25) this type of subroutine returns a value. a) modulo b) function c) record d) queue e) parameter f) procedure 26) this type of subroutine doesn't return a value. a) static b) push c) procedure d) noncontiguous e) function f) pop 27) 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 28) a new instance of a class. a) pointer b) static c) object d) enqueue e) class f) child 29) the things that get passed to a subroutine. a) isfull b) dynamic c) arguments d) linkedlist e) parameters f) reference 30) arguments once passed to a subroutine become these within the subroutine a) arguments b) parameters c) procedure d) immutable e) constants f) variables

Data Structures part 1

由
列印
嵌入

排行榜

視覺風格

選項

切換範本

恢復自動保存: ?