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 runtime error that occurs when an operation such as method call is attempted on a null pointer






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






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






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






5. A pattern that describes a set of similar programs






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






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






22. To hide similar items with the same name






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






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






25. A case where a program calls itself






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






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






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






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






30. First-child/next-sibling






31. The next element in a linked list






32. Describes a though experiment or view of an entity






33. Any container with linear ordering






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






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






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






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






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






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






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






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






42. Describes a function that modifies its arguments






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






44. All nodes below a give node in a tree






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






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






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






48. A case where tow data structures share some elements






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






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