Test your basic knowledge |

Data Structures

Subject : it-skills
Instructions:
  • Answer 50 questions in 15 minutes.
  • If you are not ready to take this test, you can study here.
  • Match each statement with the correct term.
  • Don't refresh. All questions and answers are randomly picked and ordered every time you load a test.

This is a study tool. The 3 wrong answers for each question are randomly chosen from answers to other questions. So, you might find at times the answers obvious, but you will see it re-enforces your understanding as you take the test each time.
1. All nodes below a give node in a tree






2. A data structure representing a sequence of items - which are removed in the same order as they were inserted.






3. A sequence of clear and precise step-by-step instructions for solving a problem in a finite amount of time






4. The top node of a tree - from which all other nodes can be reached






5. Separation of the properties of a data type from its implementation






6. A case where tow data structures share some elements






7. An order of processing a tree in which the parent node is processed in between its children






8. A formal description of a language in terms of vocabulary and rules for writing phrases and sentences






9. Describes a function that modifies its arguments






10. The area of program text over which a variable can be referenced






11. A collection of objects that are inserted and removed according to the LIFO principle






12. To answer the question - "If the algorithm is run several times - what is the average time per run - given the worst possible sequence of runs?"






13. o(n^2) - a problem whose solution requires a quadratic amount of time or space if the problem is of size n






14. Two variables that reference the same object






15. In a tree - a node pointed to by a parent node






16. A number that is defined as an object so that it has a runtime type and methods that can be used - e.g. Integer in Java






17. A sequence of records - where each record contains a link to the next one






18. A given collection of values along with a collection of operations for use on those values






19. First in first out: describes ordering of a queue






20. Depth first search






21. Give two sets - the set difference is the set of elements of the first set that are not members of the second set






22. Composed of multiple sequential elements stored in contiguous bytes of memory






23. An ordering that can be guaranteed to terminate - e.g. starting at a positive integer and counting down






24. A section of the runtime stack holding the values of all variables for one invocation






25. Any effect of a procedure other than returning a value - e.g. printing or modifying a data structure






26. A condition of the input data where the data will be handled by call(s) to the same program






27. Use of a function or method without knowing how it's accomplished






28. A pointer to the next element in a linked list






29. In a tree - the union of a node's parent and the parent's ancestors






30. A linked list in which each elements has both forward and backward pointers






31. An item (or description of items) being sough in a search






32. In object oriented programming - a description of a set of similar objects






33. To hide similar items with the same name






34. A queue implemented within an array - where the first elements of the array logically follows the last elements






35. A stack containing a stack frame of variable value for each active invocation of procedure






36. 1. In lisp - the function that constructs a pair of points - or basic elements of list structure. 2. To make a cons data structure 2. a cons data structure






37. In a search tree - the number of children of a given node. often - the branching factors of individual nodes will vary - so an average value may be used






38. Describes a though experiment or view of an entity






39. A linked list in which the last element points back to the first element






40. A contiguous block of memory containing elements of the same type - accessed by numeric index






41. Values are in the most basic form and cannot be decomposed into smaller parts






42. An order of processing a tree in which the parent node is processed before its children






43. To modify the order of a set of elements so that a desired ordering holds between them - e.g. alphabetic order






44. A type in which variables of that type are pointers to objects. in the code integer i = 3 - the variable i holds a pointer to the integer object that contains the value. in in j = 3 - the variable j contains the value. in java - only reference types






45. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






46. A description of the state of a process such as a board game






47. Describes a data structure or device in which all accesses have the same cost - O(1)






48. An elements of a linked list - tree - or graph - often represented by a data structure






49. A node of a tree that has children






50. Constructed of multiple components (simple or complex types)