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. An extra record at the start or end of a data structure such as a linked list - to simplify processing






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






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






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






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






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






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






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






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






10. Container for storing a collection of data in unique key/value pairs






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






12. A pointer to data






13. A problem-solving strategy in which a problem is broken down into sub-problems - until simple subproblems are reached






14. A collection of values






15. To combine two ordered linear structures into one






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






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






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






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. Any container with linear ordering






21. To hide similar items with the same name






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






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






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






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






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






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






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






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






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






31. A node of a tree that has children






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






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






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






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






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






37. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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






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






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






41. The next element in a linked list






42. Describes a though experiment or view of an entity






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






44. A pattern that describes a set of similar programs






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






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






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






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






49. First-child/next-sibling






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