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 pointer to the next element in a linked list






2. A pattern that describes a set of similar programs






3. First-child/next-sibling






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






5. The next element in a linked list






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






7. Any container with linear ordering






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






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






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






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






12. A node of a tree that has children






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






14. Describes a though experiment or view of an entity






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






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






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






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






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






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






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






22. The number of links between the root of a tree and the leaves






23. A simple case that can be solved easily - without recursion






24. Depth first search






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






26. To look through a data structure until a goal object is found






27. Describes a function that modifies its arguments






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






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






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






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






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






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






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






35. A pointer to data






36. Composed of a collection of data values; implemented with a data structure






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






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






39. To hide similar items with the same name






40. A variable containing the address of other data






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






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






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






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






45. The process of collecting garbage for recycling






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






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






48. A case where a program calls itself






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






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