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 collection of objects that are inserted and removed according to the LIFO principle






2. To combine two ordered linear structures into one






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






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






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






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






7. To hide similar items with the same name






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






9. binary tree that is ordered such that each node has contents - and all of its left descendants are less than the contents - an all of its right descendants are greater than the contents






10. Any container with linear ordering






11. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






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






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






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






23. A collection of values






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






25. Two variables that reference the same object






26. A tree node containing a contents value but with no children






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






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






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






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






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






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






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






34. A case where a program calls itself






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






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






37. In a tree search - to move back from the node currently being examined to its parent






38. All nodes below a give node in a tree






39. A pointer to data






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






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






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






43. Describes a function that modifies its arguments






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






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






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






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






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






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






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