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. An elements of a linked list - tree - or graph - often represented by a data structure






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






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






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






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






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






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






8. The next element in a linked list






9. Given two sets -the union is the set of elements that are members of either set






10. To hide similar items with the same name






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






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






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






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






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






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






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






18. Composed of individually named data fields






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






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






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






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






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






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






25. A case where a program calls itself






26. First-child/next-sibling






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






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






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






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






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






32. To combine two ordered linear structures into one






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






34. A case where tow data structures share some elements






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






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






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






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






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






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






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






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






43. Describes a data structure that cannot be changed once it has been created - such as Integer or String in Java






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






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






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






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






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






49. Implementation of complex ADTs. Physical representation of how data is stored - organized - and manipulated






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