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. storage that is no longer pointed to by any variable and therefore can no longer be accessed






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






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






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






5. The amount of space on the runtime stack required for execution of a program






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






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






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






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






10. A pattern that describes a set of similar programs






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






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






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






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






15. Any container with linear ordering






16. First-child/next-sibling






17. The process of collecting garbage for recycling






18. A search in which children of a node are considered before siblings are considered






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






20. A problem that is so hard that it cannot be solved unless the problem is small






21. A pointer to data






22. Describes a though experiment or view of an entity






23. In a search tree - a program that changes a state into a child state e.g a move in a game






24. A process that removes unwanted elements from a collection






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






26. A description of the kinds of objects that exist in a computer program - e.g a Java class hierarchy






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






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






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






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






31. A case where a program calls itself






32. Given two sets -the union is the set of elements that are members of either set






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






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






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






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






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






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






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






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






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






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






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






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






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






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






47. Depth first search






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






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






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