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 function whose value either does not involve a recursive call - or is exactly the value of a recursive call






2. Any container with linear ordering






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






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






5. A case where a program calls itself






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






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






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






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






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






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






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






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






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






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






16. All nodes below a give node in a tree






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






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






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






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






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






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






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






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






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






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






27. The next element in a linked list






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






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






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






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






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






33. A process that removes unwanted elements from a collection






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






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






36. A pointer to data






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






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






39. A case where tow data structures share some elements






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






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






42. Describes a though experiment or view of an entity






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






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






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






46. First-child/next-sibling






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






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






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






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