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






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






3. A node of a tree that has children






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






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






6. Two variables that reference the same object






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






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






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






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






11. The process of collecting garbage for recycling






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






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






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






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






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






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






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






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






20. All nodes below a give node in a tree






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






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






23. First-child/next-sibling






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






25. To hide similar items with the same name






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






27. A pointer to data






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






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






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






31. A case where tow data structures share some elements






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






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






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






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






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






37. A pattern that describes a set of similar programs






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






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






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






41. Describes a function that modifies its arguments






42. A process that removes unwanted elements from a collection






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






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






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






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






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






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






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






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







Sorry!:) No result found.

Can you answer 50 questions in 15 minutes?


Let me suggest you:

Browse all subjects

Browse all tests

Most popular tests



Major Subjects

Tests & Exams


AP
CLEP
DSST
GRE
SAT
GMAT

Browse all subjects

Browse all tests

Most popular tests