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. A contiguous block of memory containing elements of the same type - accessed by numeric index






2. A case where a program calls itself






3. 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?"






4. A case where tow data structures share some elements






5. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






7. Describes a though experiment or view of an entity






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






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






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






11. A data structure that implements a complete binary tree within an array - such that every parent node has a value that is less than the value of either of its children






12. Given two sets - the intersection is the set of elements that are members of both sets






13. 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






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






15. A data structure that can be identified at runtime as being a member of a class






16. Depth first search






17. An abstracted function that describes the amount of computer time or memory space required by an algorithm - as a function of problem size. for problems larger than a certain size - the actual time or space required will be less than the Big O multip






18. An extra record at the start or end of a data structure such as a linked list - to simplify processing






19. A node of a tree that has children






20. Describes a function that makes a new data structure but does not modify its arguments






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






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






23. Describes a function that modifies its arguments






24. A process that removes unwanted elements from a collection






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






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






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






28. 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






29. A function whose value either does not involve a recursive call - or is exactly the value of a recursive call






30. A runtime error that occurs when an operation such as method call is attempted on a null pointer






31. In a tree - a node that points to a given node






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






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






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






35. To combine two ordered linear structures into one






36. A classification of objects into a tree structure that groups related objects






37. A pattern that describes a set of similar programs






38. Any container with linear ordering






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






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






41. 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






42. To hide similar items with the same name






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






44. Last in first out: describes the order of a stack






45. 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






46. The process of collecting garbage for recycling






47. To convert from a pointer to the data that is pointed to






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






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






50. A description of operations on a data type that could have multiple possible implementations