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. To look through a data structure until a goal object is found






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






3. First-child/next-sibling






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






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






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






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






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






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






11. Two variables that reference the same object






12. Any container with linear ordering






13. Depth first search






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






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






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






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






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






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






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






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






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






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






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






25. All nodes below a give node in a tree






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






27. A case where tow data structures share some elements






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






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






30. To combine two ordered linear structures into one






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






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






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






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






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






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






37. The next element in a linked list






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






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






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






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






42. A process that removes unwanted elements from a collection






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






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






45. A case where a program calls itself






46. A pointer to data






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






48. A variable containing the address of other data






49. A problem whose solution requires a linear amount of time or space if the problem is size n






50. Describes a though experiment or view of an entity